Share Email Print

Proceedings Paper

Dependent coding in quantized matching pursuit
Author(s): Vivek K. Goyal; Martin Vetterli
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Matching pursuit, introduced by Mallat and Zhang, is an algorithm for decomposing a signal into a linear combination of functions chosen from possibly redundant dictionary of functions. A variant which we call quantized matching pursuit has been proposed for various lossy compression problems. Here a simple dependent coding scheme is introduced to code the coefficients and indices in a quantized matching pursuit representation. The improvement in rate-distortion performance is shown through simulations on synthetic sources. The resulting systems is used to code still images and motion-compensated video residual images. Since a DCT-basis dictionary is used, the multiplicative computational complexity is equal to that of traditional transform coding. The image coding results are ambiguous, with a very slight increase in PSNR but no discernible subjective improvement. The video coding results are more promising, with bit rate reductions of up to 20 percent comparing at constant SNR. The competitive performance and design flexibility indicate that the method warrants further investigation.

Paper Details

Date Published: 10 January 1997
PDF: 11 pages
Proc. SPIE 3024, Visual Communications and Image Processing '97, (10 January 1997); doi: 10.1117/12.263177
Show Author Affiliations
Vivek K. Goyal, Univ. of California/Berkeley (United States)
Martin Vetterli, Univ. of California/Berkeley and Swiss Federal Institute of Technology (Switzerland)

Published in SPIE Proceedings Vol. 3024:
Visual Communications and Image Processing '97
Jan Biemond; Edward J. Delp III, 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?