A fast PNN design algorithm for entropy-constrained residual vector quantization

TitleA fast PNN design algorithm for entropy-constrained residual vector quantization
Publication TypeJournal Article
Year of Publication1998
AuthorsKossentini, F., and M. J. T. Smith
JournalIEEE Transactions on Image Processing
Volume7
Pagination1045–1050
ISSN1057-7149
Abstract

A clustering algorithm based on the pairwise nearest-neighbor algorithm developed by Equitz, is introduced for the design of entropy-constrained residual vector quantizers. The algorithm designs residual vector quantization codebooks by merging the pair of stage clusters that minimizes the increase in overall distortion subject to a given decrease in entropy. Image coding experiments show that the clustering design algorithm typically results in more than a 200:1 reduction in design time relative to the standard iterative entropy-constrained residual vector quantization algorithm while introducing only small additional distortion. Multipath searching over the sequence of merges is also investigated and shown experimentally to slightly improve rate-distortion performance, The proposed algorithm can be used alone or can be followed by the iterative algorithm to improve the reproduction quality at the same bit rate.

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2021 The University of British Columbia