Quantization for a probability distribution generated by an infinite iterated function system
Lakshmi Roychowdhury, Mrinal Kanti Roychowdhury

TL;DR
This paper develops an induction formula to determine optimal quantization points and errors for probability measures generated by infinite iterated function systems, advancing understanding of their approximation properties.
Contribution
It introduces a novel induction formula for optimal quantization of measures from infinite iterated function systems, providing a systematic way to find optimal sets and errors.
Findings
Derived an induction formula for optimal n-means and quantization error.
Provided results and observations on optimal sets for all n ≥ 2.
Enhanced understanding of quantization for complex probability measures.
Abstract
Quantization for probability distributions concerns the best approximation of a -dimensional probability distribution by a discrete probability with a given number of supporting points. In this paper, we have considered a probability measure generated by an infinite iterated function system associated with a probability vector on . For such a probability measure , an induction formula to determine the optimal sets of -means and the th quantization error for every natural number is given. In addition, using the induction formula we give some results and observations about the optimal sets of -means for all .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Compression Techniques · Image Retrieval and Classification Techniques
