Curvelets and curvilinear integrals

Citation
Ej. Candes et Dl. Donoho, Curvelets and curvilinear integrals, J APPROX TH, 113(1), 2001, pp. 59-90
Citations number
17
Categorie Soggetti
Mathematics
Journal title
JOURNAL OF APPROXIMATION THEORY
ISSN journal
00219045 → ACNP
Volume
113
Issue
1
Year of publication
2001
Pages
59 - 90
Database
ISI
SICI code
0021-9045(200111)113:1<59:CACI>2.0.ZU;2-3
Abstract
Let delta (t): I --> R-2 be a simple closed unit-speed C-2 curve in R-2 wit h normal (n) over right arrow (t). The curve delta generates a distribution Gamma which acts on vector fields (v) over right arrow (x(1), x(2)): R-2 - -> R-2 by line integration according to Gamma((v) over right arrow) = integral(v) over right arrow(delta (t)) (.) ( n) over right arrow (t)dt. We consider the problem of efficiently approximating such functionals. Supp ose we have a vector basis or frame Phi = (<(<phi>)over right arrow>(mu)) w ith dual Phi* = <(<phi>)over right arrow>*(mu); then an m-term approximatio n to Gamma can be formed by selecting in terms (mu (i)': 1 less than or equ al to i less than or equal to m) and taking <(<Gamma>)over tilde>(m)((v) over right arrow) = Sigma (m)(i=1) Gamma(<(<ph i>)over right arrow>*(mui))[(v) over right arrow,<(<phi>)over right arrow>( mui)]. Here the mu (i) can be chosen adaptively based on the curve delta. We are interested in finding a vector basis or frame for which the above sc heme yields the highest-quality m-term approximations. Here performance is measured by considering worst-case error on vector fields which are smooth in an L-2 Sobolev sense: Err(Gamma,<(<Gamma>)over tilde>(m)) = supp{\ Gamma((v) over right arrow)-<( <Gamma>)over tilde>(m)((v) over right arrow)\: parallel to Div((v) over rig ht arrow)parallel to (2) less than or equal to 1}. We establish an isometry between this problem and the, problem of approxima ting objects with edges in L-2 norm. Starting from the recently-introduced tight frames of scalar curvelets, we construct a vector frame, of curvelets for this problem. Invoking results on the near-optimality of scalar curvel ets in representing objects with edges, we argue that vector curvelets prov ide near-optimal quality in-term approximations. We show that they dramatic ally outperform both wavelet and Fourier-based representations in terms of in-term approximation error.