Tree approximation and optimal encoding
Wavelets are utilized in many applications including image processing and numerical methods for partial differential equations. Wavelets provide efficient decompositions of functions into simple building blocks. The authors discuss the following important question: what is the most effective way to organize the terms in the wavelet decomposition, by using tree-structures and certain ideas for nonlinear approximation [see \textit{R. A. DeVore}, Acta Numer. 7, 51-150 (1998; Zbl 0931.65007)]. The tree-structured algorithm underlying coder of \textit{J. M. Shapiro} [IEEE Trans. Signal Process. 41, No. 12, 3445-3462 (1993; Zbl 0841.94020)] is one motivation for the proposed theory. Tree approximation is a new form of nonlinear approximation which appears naturally in image processing and adaptive numerical methods. It is more restrictive than the usual \(n\)-term approximation. The restrictions of tree approximation cost little in terms of approximation rates. The authors use this method to design encoders for compression. These encoders are universal (applicable to general multivariate functions) and progressive (increasing accuracy is obtained by sending bit stream increments). The optimality of the encoders is shown in that sense that the encoders provide upper estimates for the Kolmogorov entropy of unit balls of Besov spaces.
- An adaptive compression algorithm in Besov spaces
- Biorthogonal bases of compactly supported wavelets
- Compression of Wavelet Decompositions
- Embedded image coding using zerotrees of wavelet coefficients
- scientific article; zbMATH DE number 3491650 (Why is no real title available?)
- scientific article; zbMATH DE number 1215245 (Why is no real title available?)
- scientific article; zbMATH DE number 477682 (Why is no real title available?)
- scientific article; zbMATH DE number 713342 (Why is no real title available?)
- Maximal functions measuring smoothness
- On the importance of combining wavelet-based nonlinear approximation with coding strategies
- Orthonormal bases of compactly supported wavelets
- Restricted nonlinear approximation
- Stable multiscale bases and local error estimation for elliptic problems
- Ten Lectures on Wavelets
- The best m-term approximation and greedy algorithms
- Unconditional bases and bit-level compression
- Quasilinear subdivision schemes with applications to ENO interpolation.
- Adaptive biorthogonal spline schemes for advection-reaction equations.
- Near best tree approximation
- An optimal adaptive wavelet method for first order system least squares
- Encoding trees by linear recurrence sequences
- A hybrid scheme for encoding audio signal using hidden Markov models of waveforms
- Bit-optimal decoding of codes whose Tanner graphs are trees
- On a nonlinear cell-average multiresolution scheme for image compression
- On the performances of a new thresholding procedure using tree structure
- Ideal denoising within a family of tree-structured wavelet estimators
- An optimal adaptive tensor product wavelet solver of a space-time FOSLS formulation of parabolic evolution problems
- Multiscale regression on unknown manifolds
- Non-malleable codes for decision trees
- Hyperbolic wavelet thresholding methods and the curse of dimensionality through the maxiset approach
- Efficient adaptive operator application on wavelet expansions
- Adaptation to anisotropy and inhomogeneity via dyadic piecewise polynomial selection
- Adaptive algorithms of nonlinear approximation with finite terms
- Adaptive wavelet methods using semiorthogonal spline wavelets: Sparse evaluation of nonlinear functions
- Approximation of piecewise smooth functions and images by edge-adapted (ENO-EA) nonlinear multiresolution techniques
- Adaptive application of operators in standard representation
- Generalized Huffman coding for binary trees with choosable edge lengths
- Tree wavelet approximations with applications
- Optimal stable nonlinear approximation
- Algorithms and error bounds for multivariate piecewise constant approximation
- scientific article; zbMATH DE number 6683480 (Why is no real title available?)
- On a dense minimizer of empirical risk in inverse problems
- Combining thresholding rules: A new way to improve the performance of wavelet estimators
- Adaptive methods for boundary integral equations: complexity and convergence estimates
- On the Besov regularity of periodic Lévy noises
- Entropy encoding, Hilbert space, and Karhunen-Loève transforms
- Tree-Based Encoding for Cancellations on Morse Complexes
- OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES
- Tree approximation with anisotropic decompositions
- Replicant compression coding in Besov spaces
- A New Coding Algorithm for Trees
- Discussion: Time-threshold maps: using information from wavelet reconstructions with all threshold values simultaneously
- Algorithms for nonlinear piecewise polynomial approximation: Theoretical aspects
- Classification algorithms using adaptive partitioning
- Optimal approximation with sparsely connected deep neural networks
- An adaptive stochastic Galerkin method based on multilevel expansions of random fields: convergence and optimality
- High-order AFEM for the Laplace-Beltrami operator: convergence rates
- Adaptive finite element methods for the Stokes problem with discontinuous viscosity
- Adaptive multiresolution analysis based on anisotropic triangulations
- A wavelet adaptive two-step Newton type method
- Near optimal seperation of tree-like and general resolution
- Wavelet methods for PDEs -- some recent developments
- Greedy algorithms and best \(m\)-term approximation with respect to biorthogonal systems
- Data compression with ENO schemes: A case study
- Uniform tree approximation by global optimization techniques
- Compactly supported shearlets are optimally sparse
- Fast evaluation of nonlinear functionals of tensor product wavelet expansions
- Response to stress via underlying deep gene regulation networks
- Deep operator network approximation rates for Lipschitz operators
- Introduction: Wolfgang Dahmen's mathematical work (as of 2009)
- Deep neural networks are adaptive to function regularity and data distribution in approximation and estimation
- Adaptive martingale approximations
- On multiresolution schemes using a stencil selection procedure: applications to ENO schemes
- A review on the piecewise polynomial harmonic interpolation
- Bijective linear time coding and decoding for \(k\)-trees
- On a class of \(L^{1}\)-stable nonlinear cell-average multiresolution schemes
- Sparse approximate solution of partial differential equations
- Complexity-penalized estimation of minimum volume sets for dependent data
- Anisotropic smoothness classes: from finite element approximation to image models
This page was built for publication: Tree approximation and optimal encoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5946561)
