Share Email Print

Proceedings Paper

Adaptive approximation image coding models
Author(s): Rodrigo Montufar-Chaveznava; Francisco Garcia-Ugalde
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 29 December 2000
PDF: 10 pages
Proc. SPIE 4310, Visual Communications and Image Processing 2001, (29 December 2000); doi: 10.1117/12.411858
Show Author Affiliations
Rodrigo Montufar-Chaveznava, Instituto de Automatica Industrial and Univ. Nacional Autonoma de Mexico (Spain)
Francisco Garcia-Ugalde, Univ. Nacional Autonoma de Mexico (Mexico)

Published in SPIE Proceedings Vol. 4310:
Visual Communications and Image Processing 2001
Bernd Girod; Charles A. Bouman; Eckehard G. Steinbach, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?