Paper
6 April 1995 Image compression by parameterized-model coding of wavelet packet near-best bases
Carl Taswell
Author Affiliations +
Abstract
Top-down tree search algorithms with non-additive information cost comparisons as decision criteria have recently been proposed by Taswell for the selection of near-best bases in wavelet packet transforms. Advantages of top-down non-additive near-best bases include faster computation speed, smaller memory requirement, and extensibility to biorthogonal wavelets in addition to orthogonal wavelets. A new compression scheme called parameterized-model coding was also proposed and demonstrated for one-dimensional signals. These methods are extended here to two-dimensional signals and applied to the compression of images. Significant improvement in compression while maintaining comparable distortion is demonstrated for parameterized-model coding relative to quantized-scalar coding. In general, the lossy compression scheme is applicable for low bit rate coding of the M largest packets of wavelet packet decompositions with wavelet packet basis libraries and the M atoms of matching pursuit decompositions with time-frequency atom dictionaries.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Carl Taswell "Image compression by parameterized-model coding of wavelet packet near-best bases", Proc. SPIE 2491, Wavelet Applications II, (6 April 1995); https://doi.org/10.1117/12.205382
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image compression

Wavelets

Transform theory

Chemical species

Distortion

Wavelet packet decomposition

Associative arrays

Back to Top