The high resolution vector quantization problem with Orlicz norm distortion

DOI10.1007/S10959-010-0327-2MaRDI QIDQ548163zbMATH OpenOpenAlexFDO

Authors Steffen Dereich, Christian Vormoor

Publication date 28 June 2011

Published in Journal of Theoretical Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1010.4248

zbMATH Keywords

complexityself-similaritydiscrete approximationhigh-resolution quantization

Mathematics Subject Classification ID

Source coding (94A29) Distribution theory (60E99)

Abstract: We derive a high-resolution formula for the quantization problem under Orlicz norm distortion. In this setting, the optimal point density solves a variational problem which comprises a function $g:mathbb{R}_{+}o[0,infty)$ characterizing the quantization complexity of the underlying Orlicz space. Moreover, asymptotically optimal codebooks induce a tight sequence of empirical measures. The set of possible accumulation points is characterized and in most cases it consists of a single element. In that case, we find convergence as in the classical setting.

Recommendations

• Distortion bounds for vector quantizers with finite codebook size
• High-rate vector quantization for detection
• Asymptotic distribution of the errors in scalar and vector quantizers
• On the asymptotic distribution of the errors in vector quantization
• Fast rates for empirical vector quantization

Cites work

• scientific article; zbMATH DE number 5010399 (Why is no real title available?)
• scientific article; zbMATH DE number 3680123 (Why is no real title available?)
• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 3638844 (Why is no real title available?)
• scientific article; zbMATH DE number 467196 (Why is no real title available?)
• scientific article; zbMATH DE number 3364397 (Why is no real title available?)
• Asymptotic quantization error of continuous signals and the quantization dimension
• Asymptotic quantizing error for unbounded random variables (Corresp.)
• Asymptotically optimal block quantization
• Convex Analysis
• Foundations of quantization for probability distributions
• Multidimensional asymptotic quantization theory with<tex>r</tex>th power distortion measures
• On the link between small ball probabilities and the quantization problem for Gaussian measures on Banach spaces
• Optimum quantization and its applications
• Quantization
• Quantization of probability distributions under norm-based distortion measures
• Sharp asymptotics of the functional quantization problem for Gaussian processes.
• Two results on the asymptotic performance of quantizers

Cited in

(10)

• Constructive quantization: approximation by empirical measures
• The coding complexity of diffusion processes under supremum norm distortion
• Asymptotics of one-dimensional Lévy approximations
• Best finite constrained approximations of one-dimensional probabilities
• Error bounds for high-resolution quantization with Rényi-\(\alpha\)-entropy constraints
• The coding complexity of diffusion processes under \(L^p[0,1]\)-norm distortion
• On the complexity of computing quadrature formulas for marginal distributions of SDEs
• Nonlinear pricing with finite information
• High-rate vector quantization for detection
• Best finite approximations of Benford's law

This page was built for publication: The high resolution vector quantization problem with Orlicz norm distortion

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