16 September 1994 New compression method for multiresolution coding algorithms
Author Affiliations +
Proceedings Volume 2308, Visual Communications and Image Processing '94; (1994) https://doi.org/10.1117/12.185925
Event: Visual Communications and Image Processing '94, 1994, Chicago, IL, United States
The multiresolution coding algorithm, such as Laplacian-Gaussian coding, subband coding or wavelet transform coding, becomes very popular because it can achieve low bitrate and has the property of progressive transmission. In this paper, we propose a new image compression scheme for multiresolution coding algorithm. First, we decompose an image into its multiresolution representation by Laplacian-Gaussian pyramid coding, subband image coding or wavelet transform image coding. It is observed that the energy of high subbands are mainly concentrated around the appropriate edges of the original image. A simple direct VQ to encode the high subbands does not take full use of the sparsely distributed nature of the high subband, and waste many bits to encode the blocks with very low variance. In this paper, we apply a block busy/smooth detector on the lowest subband to predict whether the high subbands contain edge or not. If the block in the lowest subband is an edge block, a vector quantization is applied to encode the corresponding blocks in high subbands. Otherwise these corresponding blocks are discarded. Our simulation results show that our proposed coding scheme can achieve low bitrate without degrading the image quality visually.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ching-Yang Wang, Ching-Yang Wang, Tsann-Shyong Liu, Tsann-Shyong Liu, Long-Wen Chang, Long-Wen Chang, "New compression method for multiresolution coding algorithms", Proc. SPIE 2308, Visual Communications and Image Processing '94, (16 September 1994); doi: 10.1117/12.185925; https://doi.org/10.1117/12.185925

Back to Top