Asymptotic uniformity of the quantization error for Moran measures on $\mathbb{R}^1$
Sanguo Zhu

TL;DR
This paper proves that for Moran measures on the real line, the quantization error and related measures become uniformly distributed as the number of quantization points increases, confirming a weaker form of Gersho's conjecture.
Contribution
It establishes asymptotic uniformity of quantization errors for Moran measures on , advancing understanding of quantization properties for fractal measures.
Findings
Quantization error decreases proportionally to 1/n.
Uniformity measures _n and _n are of the same order as 1/n times the quantization error.
A weaker version of Gersho's conjecture holds for Moran measures.
Abstract
Let be a Moran set on associated with a closed interval and two sequences and . Let be the infinite product measure (Moran measure) on associated with a sequence of positive probability vectors with . We assume that \[ \inf_{k\geq1}\min_{1\leq j\leq n_k}c_{k,j}>0,\;\inf_{k\geq1}\min_{1\leq j\leq n_k}p_{k,j}>0. \] For every , let be an optimal set in the quantization for of order and an arbitrary Voronoi partition with respect to . For every , we write and \[ \underline{J}(\alpha_n,\mu):=\min_{a\in\alpha_n}I_a(\alpha,\mu),\;…
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
TopicsMathematical Dynamics and Fractals · Mathematical Analysis and Transform Methods · Advanced Data Compression Techniques
