Paper
29 December 2000 Adaptive approximation image coding models
Rodrigo Montufar-Chaveznava, Francisco Garcia-Ugalde
Author Affiliations +
Proceedings Volume 4310, Visual Communications and Image Processing 2001; (2000) https://doi.org/10.1117/12.411858
Event: Photonics West 2001 - Electronic Imaging, 2001, San Jose, CA, United States
Abstract
In this work we present some image coding models based on adaptive approximation techniques. The image coding models presented are based on Matching Pursuit and High Resolution Pursuit, which are the most popular adaptive approximation techniques. These models have a similar computational complexity and structure. The models expands an image along an overcomplete dictionary. The dictionary was selected according to a best basis metric or a training strategy. From such expansion, the model selects the coefficients that correspond to the most important image structures. Selected coefficients are quantized just when they are chosen, in order to minimize error propagation along the process. These coefficients represent an optimal image decomposition, or a reduced image representation. This representation, in some way, corresponds to a coded image with a high compression rate. A simple reconstruction algorithm recovers the original image with a high visual quality.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Rodrigo Montufar-Chaveznava and Francisco Garcia-Ugalde "Adaptive approximation image coding models", Proc. SPIE 4310, Visual Communications and Image Processing 2001, (29 December 2000); https://doi.org/10.1117/12.411858
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image compression

Chemical species

Associative arrays

Image processing

Image quality

Wavelets

Image resolution

Back to Top