Algorithms for intervector dependency utilization in variable-rate tree-structured vector quantization

Ligang Lu; William A. Pearlman

doi:10.1117/12.233241

27 February 1996 Algorithms for intervector dependency utilization in variable-rate tree-structured vector quantization

Ligang Lu, William A. Pearlman

Proceedings Volume 2727, Visual Communications and Image Processing '96; (1996) https://doi.org/10.1117/12.233241
Event: Visual Communications and Image Processing '96, 1996, Orlando, FL, United States

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

Citation Download Citation

Ligang Lu and William A. Pearlman "Algorithms for intervector dependency utilization in variable-rate tree-structured vector quantization", Proc. SPIE 2727, Visual Communications and Image Processing '96, (27 February 1996); https://doi.org/10.1117/12.233241

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available