Recursive partitioning to reduce distortion

DOI10.1109/18.605573MaRDI QIDQ4345606zbMATH OpenOpenAlexFDO

Authors Andrew B. Nobel

Publication date 5 January 1998

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

Full work available at URL https://semanticscholar.org/paper/956629b4b4ad22a2cc15a2e79ad7b09375bdd0e9

zbMATH Keywords

asymptotic distortion of quantizersdata-compression schemestree-structured vector quantizersunsupervised procedures

Mathematics Subject Classification ID

Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Recommendations

• Multi-scale vector quantization with reconstruction trees
• Variable-rate tree-structured vector quantizers
• Termination and continuity of greedy growing for tree-structured vector quantizers

Cited in

(7)

• Information divergence estimation based on data-dependent partitions
• Average number of facets per cell in tree-structured vector quantizer partitions
• Risk bounds for CART classifiers under a margin condition
• Consistency of data-driven histogram methods for density estimation and classification
• Multi-scale vector quantization with reconstruction trees
• On signal representations within the Bayes decision framework
• Variable-rate tree-structured vector quantizers

This page was built for publication: Recursive partitioning to reduce distortion

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