Uncertainty Principles and Vector Quantization
From MaRDI portal
Abstract: Given a frame in C^n which satisfies a form of the uncertainty principle (as introduced by Candes and Tao), it is shown how to quickly convert the frame representation of every vector into a more robust Kashin's representation whose coefficients all have the smallest possible dynamic range O(1/sqrt{n}). The information tends to spread evenly among these coefficients. As a consequence, Kashin's representations have a great power for reduction of errors in their coefficients, including coefficient losses and distortions.
Cited in
(12)- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Sampling from non-smooth distributions through Langevin diffusion
- Sharp oracle inequalities for low-complexity priors
- The degrees of freedom of partly smooth regularizers
- Low complexity regularization of linear inverse problems
- Tighter uncertainty principles for periodic signals in terms of frequency
- Model selection with low complexity priors
- Uncertainty principle for multivector-valued functions
- Tsallis entropy based uncertainty relations on sparse representation for vector and matrix signals
- An efficient algorithm for decomposing a vector into two vectors with a small uniform norm
- Democracy in action: quantization, saturation, and compressive sensing
- Coefficient quantization for frames in Banach spaces
This page was built for publication: Uncertainty Principles and Vector Quantization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281416)
