Affordable Access

Recursive optimal pruning with applications to tree structured vector quantizers.

Authors
  • Kiang, S Z
  • Baker, R L
  • Sullivan, G J
  • Chiu, C Y
Type
Published Article
Journal
IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Publication Date
Jan 01, 1992
Volume
1
Issue
2
Pages
162–169
Identifiers
PMID: 18296151
Source
Medline
License
Unknown

Abstract

A pruning algorithm of P.A. Chou et al. (1989) for designing optimal tree structures identifies only those codebooks which lie on the convex hull of the original codebook's operational distortion rate function. The authors introduce a modified version of the original algorithm, which identifies a large number of codebooks having minimum average distortion, under the constraint that, in each step, only modes having no descendents are removed from the tree. All codebooks generated by the original algorithm are also generated by this algorithm. The new algorithm generates a much larger number of codebooks in the middle- and low-rate regions. The additional codebooks permit operation near the codebook's operational distortion rate function without time sharing by choosing from the increased number of available bit rates. Despite the statistical mismatch which occurs when coding data outside the training sequence, these pruned codebooks retain their performance advantage over full search vector quantizers (VQs) for a large range of rates.

Report this publication

Statistics

Seen <100 times