Paper
27 April 1995 Spatial and frequency decomposition for image compression
Wei-Lien Hsu, Haluk Derin
Author Affiliations +
Abstract
This paper presents the design of an improved image compression algorithm based on an optimal spatial and frequency decomposition of images. The use of spatially varying wavelet packets for a generalized wavelet decomposition of images was recently introduced by Asai, Ramchandram and Vetterli. They use a `double tree' algorithm to obtain the optimal set of bases for a given image, through a joint optimization with respect to frequency decomposition by a wavelet packet and spatial decomposition based on a quad-tree structure. In this paper, we present a `double-tree' frequency and spatial decomposition algorithm that extends the existing algorithm in three areas. First, instead of the quad-tree structure, our algorithm uses a more flexible merging scheme for the spatial decomposition of the image. Second, instead of a scalar quantizer, we use a pyramidal lattice vector quantizer to represent each subband of each wavelet packet, which improves the coding efficiency of the representation. Both of these extensions yield an improved rate-distortion (R-D) performance. Finally, our algorithm uses a scheme that gives a good initial value for the slope of the R-D curve, reducing the total computations needed to obtain the optimum decompositions.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Wei-Lien Hsu and Haluk Derin "Spatial and frequency decomposition for image compression", Proc. SPIE 2431, Medical Imaging 1995: Image Display, (27 April 1995); https://doi.org/10.1117/12.207660
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Wavelets

Distortion

Image compression

Quantization

Yield improvement

Image segmentation

Optimization (mathematics)

Back to Top