Clustering algorithm for entropy-constrained vector-quantizer design

Weiler A. Finamore; Diego Pinto de Garrido; William A. Pearlman

doi:10.1117/12.24272

1 September 1990 Clustering algorithm for entropy-constrained vector-quantizer design

Weiler A. Finamore, Diego Pinto de Garrido, William A. Pearlman

Proceedings Volume 1360, Visual Communications and Image Processing '90: Fifth in a Series; (1990) https://doi.org/10.1117/12.24272
Event: Visual Communications and Image Processing '90, 1990, Lausanne, Switzerland

Abstract

A clustering algorithm for the design of efficient vector quantizers to be followed by entropy coding is proposed. The algorithm generates a sequence of quantizers whith rates close to theoretical rate- distortion bound. A fast version of this algorithm can be used as an alternative to the entropy-constrained vector quantizer technique proposed by Chou, Lookabaugh and Gray.

Citation Download Citation

Weiler A. Finamore, Diego Pinto de Garrido, and William A. Pearlman "Clustering algorithm for entropy-constrained vector-quantizer design", Proc. SPIE 1360, Visual Communications and Image Processing '90: Fifth in a Series, (1 September 1990); https://doi.org/10.1117/12.24272

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