Efficient Moment Computation over Polygonal Domains with an Application to Rapid Wedgelet Approximation

DOI10.1137/050646597zbMATH Open1138.68063OpenAlexW2018092875MaRDI QIDQ5453566FDOQ5453566

Authors: Felix Friedrich, Laurent Demaret, Hartmut Führ, K. Wicker 

Publication date: 3 April 2008

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050646597

Recommendations

• Moments-based fast wedgelet transform
• A fast algorithm for computing moments of gray images based on NAM and extended shading approach
• Exact and fast algorithm for two-dimensional image wavelet moments via the projection transform
• Wedgelets: Nearly minimax estimation of edges
• A novel approach to the fast computation of zernike moments

zbMATH Keywords

plateletspolygonal domainsimage approximationdigital linesimage momentswedgeletsdiscrete Green's theorem

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Discrete geometry (52C99) Integral formulas of real functions of several variables (Stokes, Gauss, Green, etc.) (26B20)

Cited In (7)

• Complexity \(L^0\)-penalized \(M\)-estimation: consistency in more dimensions
• Locally adaptive image denoising by a statistical multiresolution criterion
• Complexity penalized least squares estimators: Analytical results
• Moments-based fast wedgelet transform
• The \(L^1\)-Potts functional for robust jump-sparse reconstruction
• Contour representation based on wedgelet
• Approximating data with weighted smoothing splines

This page was built for publication: Efficient Moment Computation over Polygonal Domains with an Application to Rapid Wedgelet Approximation

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