• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.190-192
• /
• 2004

In this paper, we propose a low bit-rate embedded video compression scheme with 3-D block partition coding in the wavelet domain. The proposed video compression scheme includes multi-level 3-dimensional dyadic wavelet decomposition, raster scanning within each subband, formation of block, 3-D partitioning of block, and adaptive arithmetic entropy coding. Although the proposed video compression scheme is quit simple, it produces bit-stream with good features, including SNR scalability from the embedded nature. Experimental results demonstrate that the proposed video compression scheme is quit competitive to other good wavelet-based video coders in the literature.

• Proceedings of the KOSOMBE Conference
• /
• v.1994 no.12
• /
• pp.31-38
• /
• 1994

This paper proposed signal decomposition and multiresolution representation through wavelet transform using wavelet orthonormal basis. And it suggested most appropriate filter for scaling function in multiresoltion representation and compared two compression method, arithmetic coding and Huffman coding. Results are as follows 1. Daub18 coefficient is most appropriate in computing time, energy compaction, image quality. 2. In case of image browsing that should be small in size and good for recognition, it is reasonable to decompose to 3 scale using pyramidal algorithm. 3. For the case of progressive transmittion where requires most grateful image reconstruction from least number of sampls or reconstruction at any target rate, I embedded the data in order of significance after scaling to 5 step. 4. Medical images such as information loss is fatal have to be compressed by lossless method. As a result from compressing 5 scaled data through arithmetic coding and Huffman coding, I obtained that arithmetic coding is better than huffman coding in processing time and compression ratio. And in case of arithmetic coding I could compress to 38% to original image data.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.4
• /
• pp.567-574
• /
• 2006

This paper focuses on lossy medical image compression methods for medical images that operate on three-dimensional(3-D) irreversible integer wavelet transform. We offer an application of unbalanced tree structure algorithm to medical images, using a 3-D unbalanced wavelet decomposition and a 3-D unbalanced spatial dependence tree. The wavelet decomposition is accomplished with integer wavelet filters implemented with the lifting method. We have tested our encoder on volumetric medical images using different integer filters and 16 coding unit size. The coding unit sizes of 16 slices save considerable dynamic memory(RAM) and coding delay from full sequence coding units used in previous works. If we allow the formation of trees of different lengths, then we can accomodate more transaxial scales than three. Then the encoder and decoder can then keep track of the length of the tree in which each pixel resides through the sequence of decompositions. Results show that, even with these small coding units, our algorithm with I(5,3)filter performs as well and better in lossy coding than previous coding systems using 3-D integer unbalanced wavelet transforms on volumetric medical images.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.4
• /
• pp.1121-1131
• /
• 1997

In video coding at high compression rate, factal compression schemes in spatial domain have outstanding blocking artifacts and compression schemes in wavelet transform domain have rinfing artifacts at edges. In order to compensate these disadvantages, we propose a fractal video coding in wavelet transrorm domain which leads to clear edges without blocking atrifacts even at high bompression rate. The proposed method performs variable block sized motion estimation by using correlation among different subbands. Then the wavelet coefficients which are not enoded dffectively by the motion estimation are compressed by inter-frame fractal coding which predicts fine scale subbands hierarchically from the next coarser scale subbands. Computer sumulations with sev-eral test images wequences show that the proposed method shows better performance than the conventional video coding methods using fractal and wavelet.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.851-854
• /
• 1998

Recently efficient image coding algorithms using zerotree have been proposed. In these methods, the locations of nonzero wavelet coefficients are encoded with a tree structure, called zerotree, which can exploit the self-similarity of the wavelet pyramid decomposition across different scales. These are very effective, especially in low bit rate image coding. In this paper, two zerotree image coding algorithms, EZW and SPIHT, are briefly introduced, and a new zerotree searching scheme is proposed to emphasize the significance of a wavelet coefficient by its orientations as well as its scale.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.609-612
• /
• 1999

In this paper, we propose wavelet transform image compression method such that an image is decomposed into multiresolutions using biorthogonal wavelet transform with linear phase response property and decomposed subbands are classified by maximum classification gain. The classified data is quantized by allocating bits in accordance with classified class informations within subbands through arbitrary set bit allocation algorithm. And then, quantized data in each subband are entropy coded. The proposed coding method is that the quantized data perform shuffling before entropy coding in order to remove sign bit plane. And the context is assigned by maximum correlation direction for bit plane coding.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3C
• /
• pp.286-295
• /
• 2003

In this paper, the wavelet image coder, that can encode the image to various bit rate with minimum memory usage, is proposed. The proposed coder is used the 2D significant coefficient array(SCA) that has bit level informal on of the wavelet coefficients to reduce the memory requirement in coding process. The 2D SCA is two dimensional data structure that has bit level information of the wavelet coefficients. The proposed algorithm performs the coding of the significance coefficients and coding of bit level information of wavelet coefficients at a time by using the 2D SCA. Experimental results show a better or similar performance of the proposed method when compared with conventional embedded wavelet coding algorithm. Especially, the proposed algorithm performs stably without image distortion at various b it rates with minimum memory usage by using the 2D SCA.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.370-372
• /
• 2004

This paper addresses the wavelet-based fuzzy PI/PD controller design using DNA coding method. A structure of fuzzy controller model is adopted as the wavelet transform of which the coefficients are identified. The proposed method overcomes some mathematical limits of conventional methods by using the fuzzy logic that is optimized by DNA coding method. The feasibility of the proposed fuzzy controller design scheme is verified by applying to the servo control of the optical disk drive.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.433-436
• /
• 2003

In this paper, the efficient motion estimation and compensation method for 3 dimensional wavelet transform is proposed. Recently, since the compression performance and scalable functionality are provided by wavelet transform, many researches have been carried out for applying to the video compression. For the temporal filtering, motion estimation and compensation techniques are used, but the unconnected pixels, which are produced by motion compensation result into the degradation of coding performance and quality of the picture. For the efficient motion compensated temporal filtering by reducing the number of these unconnected pixels, we propose the variable block size motion estimation and compensation method. Also we propose a method that determines the block size using rate-distortion optimization technique according to the local characteristics of the frame. The simulation results show the improved performances than the MPEG-4 scalable coding methods and the 3 dimensional wavelet coding methods using fixed block size motion estimation and compensation.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.9
• /
• pp.99-108
• /
• 1997

An efficient wavelet packet algorithm to find wavelet packet quickly is presented in this paper. The top-down method maximizing the transform coding gain that is obtained from the second moment of the band is used to divide the subbands into wavelet tree. The bit allocation for each band in the tree is performed in proportion to its variance. Bands are coded by the lossless coding algorithm called the bit plane run length coding(BPRLC) and uniform quantizer. The proposed algorithm is compared with of the single tree algorithim proposed by Ramchandran and Vetterli. To verify the efficiency of our algorithm, simulations are jperformed using several sets of images. The results show us that our method reduces the execution time by about forty percent of that required by the single tree method while maintaining the comparable reconstructed image qualities.