Termination and continuity of greedy growing for tree-structured vector quantizers

DOI10.1109/18.481789MaRDI QIDQ4880001zbMATH OpenOpenAlexFDO

Authors Andrew B. Nobel, Richard A. Olshen

Publication date 1 December 1996

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/175c9dfba68c53bc2f33b1e34bc6b54054dcb7d6

zbMATH Keywords

data compressiongreedy algorithmsvector quantizers

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Source coding (94A29)

Recommendations

• Variable-rate tree-structured vector quantizers
• Complexity-constrained tree-structured vector quantizers
• Recursive partitioning to reduce distortion
• Global convergence and empirical consistency of the generalized Lloyd algorithm

Cited in

(6)

• Complexity-constrained tree-structured vector quantizers
• Multi-scale vector quantization with reconstruction trees
• Average number of facets per cell in tree-structured vector quantizer partitions
• Recursive partitioning to reduce distortion
• Risk bounds for CART classifiers under a margin condition
• Variable-rate tree-structured vector quantizers

This page was built for publication: Termination and continuity of greedy growing for tree-structured vector quantizers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4880001)