Adaptive multiresolution analysis based on anisotropic triangulations
From MaRDI portal
\(L^p\)-convergenceadaptive approximationalgorithmanisotropic triangulationsdata-adapted triangulationgreedy refinement procedurehierarchical structure of triangulationsimage compressionmultiresolution analysisnumerical examplesoptimal CART treespiecewise polynomial approximationwavelet bases
Spline approximation (41A15) Multidimensional problems (41A63) Numerical computation using splines (65D07) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55) Numerical methods for wavelets (65T60) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Abstract: A simple greedy refinement procedure for the generation of data-adapted triangulations is proposed and studied. Given a function of two variables, the algorithm produces a hierarchy of triangulations and piecewise polynomial approximations on these triangulations. The refinement procedure consists in bisecting a triangle T in a direction which is chosen so as to minimize the local approximation error in some prescribed norm between the approximated function and its piecewise polynomial approximation after T is bisected. The hierarchical structure allows us to derive various approximation tools such as multiresolution analysis, wavelet bases, adaptive triangulations based either on greedy or optimal CART trees, as well as a simple encoding of the corresponding triangulations. We give a general proof of convergence in the Lp norm of all these approximations. Numerical tests performed in the case of piecewise linear approximation of functions with analytic expressions or of numerical images illustrate the fact that the refinement procedure generates triangles with an optimal aspect ratio (which is dictated by the local Hessian of of the approximated function in case of C2 functions).
Recommendations
- Adaptive and anisotropic piecewise polynomial approximation
- Greedy bisection generates optimally adapted triangulations
- Multilevel least squares approximation of scattered data over binary triangulations
- scientific article; zbMATH DE number 3998420
- scientific article; zbMATH DE number 1189327
- scientific article; zbMATH DE number 1698732
- Adaptive approximations by greedy algorithms
- Univariate adaptive thinning
- Boundary improvement of piecewise linear interpolants defined over Delaunay triangulations
- Adaptive tree approximation with finite element functions: a first look
Cites work
- A Class of Bases in L² for the Sparse Representation of Integral Operators
- A Convergent Adaptive Algorithm for Poisson’s Equation
- Adaptive finite element methods with convergence rates
- Adaptive Multivariate Approximation Using Binary Space Partitions and Geometric Wavelets
- An Optimal Adaptive Finite Element Method
- Approximation of piecewise smooth functions and images by edge-adapted (ENO-EA) nonlinear multiresolution techniques
- Bandelet Image Approximation and Compression
- CART and best-ortho-basis: a connection
- Convergence of Adaptive Finite Element Methods
- Curvelets and curvilinear integrals
- Greedy bisection generates optimally adapted triangulations
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 5727752 (Why is no real title available?)
- scientific article; zbMATH DE number 43689 (Why is no real title available?)
- scientific article; zbMATH DE number 1277260 (Why is no real title available?)
- scientific article; zbMATH DE number 2147469 (Why is no real title available?)
- Nonlinear piecewise polynomial approximation beyond Besov spaces
- Optimal anisotropic meshes for minimizing interpolation errors in L^p-norm
- Tree approximation and optimal encoding
- Wedgelets: Nearly minimax estimation of edges
Cited in
(14)- Adaptive anisotropic Petrov-Galerkin methods for first order transport equations
- Adaptive two- and three-dimensional multiresolution computations of resistive magnetohydrodynamics
- Multiscale approximation of piecewise smooth two-dimensional functions using normal triangulated meshes
- Anisotropic Triangulation Methods in Adaptive Image Approximation
- scientific article; zbMATH DE number 5521063 (Why is no real title available?)
- scientific article; zbMATH DE number 1189327 (Why is no real title available?)
- Tree approximation with anisotropic decompositions
- Adaptive Computation with Splines on Triangulations with Hanging Vertices
- Optimal \(N\)-term approximation by linear splines over anisotropic Delaunay triangulations
- Efficient resolution of anisotropic structures
- Greedy bisection generates optimally adapted triangulations
- Optimal meshes for finite elements of arbitrary order
- An approximation algorithm for optimal piecewise linear interpolations of bounded variable products
- Generating an adaptive multiresolution image analysis with compact cupolets
This page was built for publication: Adaptive multiresolution analysis based on anisotropic triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5389433)
