Unconditional bases and bit-level compression
In a previous article [Appl. Comput. Harmon. Anal. 1, No. 1, 100-115 (1993; Zbl 0796.62083)] the author gave results showing that an orthogonal basis which is an unconditional basis for a functional class \({\mathcal F}\) furnishes an optimal representation of elements of \({\mathcal F}\) for certain de-noising and compression tasks. Since publication of that article, the author has received several queries which pointed out that the definition of compression in that article was based on counting the number of significant transform domain coefficients which must be retained to get acceptable reconstruction error in transform coding. These queries asked whether results could instead be formulated in terms of the number of bits stored. The purpose of this note is to point out that results analogous to that previous article hold under a model which measures bits encoded. There are two key results: The sparsity of the coefficients in an unconditional basis determines the rough asymptotics in \(\varepsilon\) for the number of bits which must be stored to reconstruct any memher of \({\mathcal F}\) to within \(\varepsilon\)-accuracy. A simple transform coding scheme based on uniform quantization and run-length encoding of the coefficients in the unconditional basis can achieve near-optimal asymptotics for the number of bits needed to represent any member of \({\mathcal F}\) to accuracy \(\varepsilon\). In short, when an unconditional basis for a class \({\mathcal F}\) exists, transform coding in that basis offers near-optimal representation of elements of \({\mathcal F}\).
- Unconditional bases are optimal bases for data compression and for statistical estimation
- Universal Compression of Memoryless Sources Over Unknown Alphabets
- Compression and hadamard power inequalities
- Inequalities and algorithms for universal data compression
- Compressibility and uniform complexity
- scientific article; zbMATH DE number 78498
- Universal almost sure data compression
- scientific article; zbMATH DE number 3463524
- Universal Algorithms for Channel Decoding of Uncompressed Sources
- Dimensionality reduction and greedy learning of convoluted stochastic dynamics
- Greedy bases are best for \(m\)-term approximation
- Unconditional bases are optimal bases for data compression and for statistical estimation
- Wedgelets: Nearly minimax estimation of edges
- Information-theoretic determination of minimax rates of convergence
- Bayesian maximum entropy based algorithm for digital X-ray mammogram processing
- Estimates for entropy numbers of sets of smooth functions on the torus \(\mathbb{T}^d\)
- On the representation of smooth functions on the sphere using finitely many bits
- Efficient hedging of options with probabilistic Haar wavelets
- Metric entropy limits on recurrent neural network learning of linear dynamical systems
- On the minimax optimality and superiority of deep neural network learning over sparse parameter spaces
- Entropy numbers of Besov classes of generalized smoothness on the sphere
- Unconditional convergence of Fourier expansions in systems of product bases in Orlicz spaces
- Entropy numbers of functions on \([-1,1]\) with Jacobi weights
- Optimally sparse data representations
- Tree approximation with anisotropic decompositions
- Replicant compression coding in Besov spaces
- New tight frames of curvelets and optimal representations of objects with piecewise C2 singularities
- On the entropy numbers between the anisotropic spaces and the spaces of functions with mixed smoothness
- FUNCTIONAL APPROXIMATION IN MULTISCALE COMPLEX SYSTEMS
- Thresholding algorithms, maxisets and well-concentrated bases
- Tree approximation and optimal encoding
- Nonlinear estimation over weak Besov spaces and minimax Bayes
- Thresholding procedure with priors based on Pareto distributions
This page was built for publication: Unconditional bases and bit-level compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2564044)
