Close category search window
 

A new trellis vector residual quantizer with applications to speech and image coding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Carpentieri, B. ; Dipt. di Inf. ed Applicazioni, Salerno Univ., Italy ; Motta, G.

Summary form only given. We present a new trellis coded vector residual quantizer (TCVRQ) that combines trellis coding and vector residual quantization. Our TCVRQ is a general-purpose sub-optimal vector quantizer with low computational costs and small memory requirement that permits high memory savings when compared to traditional quantizers. Our experiments confirm that TCVRQ is a good compromise between memory/speed requirements and quality and that it is not sensitive to codebook design errors. We propose a method for computing quantization levels and experimentally analyze the performance of our TCVRQ when applied to speech coding at very low bit rates and to direct image coding. We employed our TCVRQ in a linear prediction based speech codec for the quantization of the LP parameters. Several experiments were performed using both SNR and a perceptive measure of distortion known as cepstral distance. The results obtained and some informal listening tests show that nearly transparent quantization can be performed at a rate of 1.9 bits per parameter. The experiments in image coding were performed encoding some 256 gray levels, 512×512 pixel images using blocks of 3×3 pixels. Our TCVRQ were compared, on the same training and test sets, to an exhaustive search vector quantizer (built using the generalized Lloyd algorithm) and to a tree quantizer for different coding rates ranging from 3 to 10 bits per block

Published in:
Data Compression Conference, 1997. DCC '97. Proceedings

Date of Conference: 25-27 Mar 1997

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.