Communications on Pure and Applied Mathematics · 2003 · 1.6K citations · 20 references
ComputingComputer ScienceComputational GeometryComputer VisionMultiscale ModelingGeometry ProcessingShape RepresentationSignal ProcessingFramesMultiresolution RepresentationObjectsPartial ReconstructionPiecewise FunctionsWavelet AnalysisWavelet Transform
The curvelet transform is a multiscale pyramid with many directions and needle‑shaped elements at fine scales, giving it geometric multiscale features that distinguish it from classical wavelets. This paper introduces new tight frames of curvelets to achieve optimally sparse representations of objects with discontinuities along piecewise C² edges. Curvelets obey a parabolic scaling relation, so at scale 2⁻ʲ each element aligns along a ridge of length 2⁻ʲ⁄² and width 2⁻ʲ, enabling the construction of tight frames. The authors prove that these curvelet tight frames provide essentially optimal, nearly as sparse as smooth functions, representations for C² objects with piecewise C² discontinuities, far outperforming wavelet decompositions whose error decays only as n⁻¹. © 2003 Wiley Periodicals, Inc.
Abstract This paper introduces new tight frames of curvelets to address the problem of finding optimally sparse representations of objects with discontinuities along piecewise C 2 edges. Conceptually, the curvelet transform is a multiscale pyramid with many directions and positions at each length scale, and needle‐shaped elements at fine scales. These elements have many useful geometric multiscale features that set them apart from classical multiscale representations such as wavelets. For instance, curvelets obey a parabolic scaling relation which says that at scale 2 − j , each element has an envelope that is aligned along a “ridge” of length 2 − j /2 and width 2 − j . We prove that curvelets provide an essentially optimal representation of typical objects f that are C 2 except for discontinuities along piecewise C 2 curves. Such representations are nearly as sparse as if f were not singular and turn out to be far more sparse than the wavelet decomposition of the object. For instance, the n ‐term partial reconstruction f obtained by selecting the n largest terms in the curvelet series obeys This rate of convergence holds uniformly over a class of functions that are C 2 except for discontinuities along piecewise C 2 curves and is essentially optimal. In comparison, the squared error of n ‐term wavelet approximations only converges as n −1 as n → ∞, which is considerably worse than the optimal behavior. © 2003 Wiley Periodicals, Inc.
20
De-noising by soft-thresholding
David L. Donoho · IEEE Transactions on Information Theory · 1995 · 9.6K citations
High performance scalable image compression with EBCOT
David Taubman · IEEE Transactions on Image Processing · 2000 · 1.9K citations
Journal of Symbolic Logic · 1948 · 1.5K citations
Shiftable multiscale transforms
Eero P. Simoncelli, William T. Freeman, Edward H. Adelson et al. · IEEE Transactions on Information Theory · 1992 · 1.3K citations