Share Email Print

Proceedings Paper

Algorithms for intervector dependency utilization in variable-rate tree-structured vector quantization
Author(s): Ligang Lu; William A. Pearlman
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In this paper we improve and extend our previous results in finite-state variable rate tree- structured vector quantization (FSVRTSVQ) by developing two new algorithms to increase its coding efficiency. The two new algorithms are derived to utilize the inter-codeword dependency and the tree structure property of the codebook so as to achieve bit rate reduction. The evaluation of both algorithms on various synthesis and real sources has shown that as many as 32.2% of bit rate savings has been obtained over the pruned tree-structured vector quantization (PTSVQ).

Paper Details

Date Published: 27 February 1996
PDF: 12 pages
Proc. SPIE 2727, Visual Communications and Image Processing '96, (27 February 1996); doi: 10.1117/12.233241
Show Author Affiliations
Ligang Lu, Rensselaer Polytechnic Institute (United States)
William A. Pearlman, Rensselaer Polytechnic Institute (United States)

Published in SPIE Proceedings Vol. 2727:
Visual Communications and Image Processing '96
Rashid Ansari; Mark J. T. Smith, Editor(s)

© SPIE. Terms of Use
Back to Top