Projection pursuit image compression with variable block size segmentation
- 1 May 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 4 (5) , 117-120
- https://doi.org/10.1109/97.575551
Abstract
A novel multiresolution algorithm for lossy gray-scale image compression is presented. High-quality low bit rate image compression is achieved first by segmenting an image into regions of different sizes based on perceptual variation in each region and then constructing a distinct code for each block by using the theory of projection pursuit (PP). Projection pursuit allows one to adaptively construct a better approximation for each block by optimally selecting basis functions. The process is stopped when the desired peak signal-to-noise ratio (PSNR) or bit rate (b/pixel) is achieved. At rates below 0.5 b/pixel, our algorithm shows superior performance, both in terms of PSNR and subjective image quality, over the Joint Photographers Expert Group (JPEG) algorithm, and comparable performance to the embedded zerotree wavelet (EZW) algorithm.Keywords
This publication has 6 references indexed in Scilit:
- Quantization of overcomplete expansionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Embedded image coding using zerotrees of wavelet coefficientsIEEE Transactions on Signal Processing, 1993
- Matching pursuits with time-frequency dictionariesIEEE Transactions on Signal Processing, 1993
- Families of multiresolution and wavelet spaces with optimal propertiesNumerical Functional Analysis and Optimization, 1993
- Image compression with variable block size segmentationIEEE Transactions on Signal Processing, 1992
- Projection PursuitThe Annals of Statistics, 1985