10 January 1997 Dependent coding in quantized matching pursuit
Author Affiliations +
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.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Vivek K. Goyal, Vivek K. Goyal, Martin Vetterli, Martin Vetterli, } "Dependent coding in quantized matching pursuit", Proc. SPIE 3024, Visual Communications and Image Processing '97, (10 January 1997); doi: 10.1117/12.263177; https://doi.org/10.1117/12.263177
PROCEEDINGS
11 PAGES


SHARE
Back to Top