Shearlet

From testwiki
Jump to navigation Jump to search

In applied mathematical analysis, shearlets are a multiscale framework which allows efficient encoding of anisotropic features in multivariate problem classes. Originally, shearlets were introduced in 2006[1] for the analysis and sparse approximation of functions f∈L2(ℝ2). They are a natural extension of wavelets, to accommodate the fact that multivariate functions are typically governed by anisotropic features such as edges in images, since wavelets, as isotropic objects, are not capable of capturing such phenomena.

Shearlets are constructed by parabolic scaling, shearing, and translation applied to a few generating functions. At fine scales, they are essentially supported within skinny and directional ridges following the parabolic scaling law, which reads length² ≈ width. Similar to wavelets, shearlets arise from the affine group and allow a unified treatment of the continuum and digital situation leading to faithful implementations. Although they do not constitute an orthonormal basis for L2(ℝ2), they still form a frame allowing stable expansions of arbitrary functions f∈L2(ℝ2).

One of the most important properties of shearlets is their ability to provide optimally sparse approximations (in the sense of optimality in [2]) for cartoon-like functions f. In imaging sciences, cartoon-like functions serve as a model for anisotropic features and are compactly supported in [0,1]2 while being C2 apart from a closed piecewise C2 singularity curve with bounded curvature. The decay rate of the L2-error of the N-term shearlet approximation obtained by taking the N largest coefficients from the shearlet expansion is in fact optimal up to a log-factor:[3][4]

‖f−fN‖L22≤CN−2(log⁡N)3,N→∞,

where the constant C depends only on the maximum curvature of the singularity curve and the maximum magnitudes of f, f′ and f″. This approximation rate significantly improves the best N-term approximation rate of wavelets providing only O(N−1) for such class of functions.

Shearlets are to date the only directional representation system that provides sparse approximation of anisotropic features while providing a unified treatment of the continuum and digital realm that allows faithful implementation. Extensions of shearlet systems to L2(ℝd),d≥2 are also available. A comprehensive presentation of the theory and applications of shearlets can be found in.[5]

Definition

Continuous shearlet systems

Template:Multiple image

The construction of continuous shearlet systems is based on parabolic scaling matrices

Aa=[a00a1/2],a>0

as a means to change the resolution, on shear matrices

Ss=[1s01],s∈ℝ

as a means to change the orientation, and finally on translations to change the positioning. In comparison to curvelets, shearlets use shearings instead of rotations, the advantage being that the shear operator Ss leaves the integer lattice invariant in case s∈ℤ, i.e., Ssℤ2⊆ℤ2. This indeed allows a unified treatment of the continuum and digital realm, thereby guaranteeing a faithful digital implementation.

For ψ∈L2(ℝ2) the continuous shearlet system generated by ψ is then defined as

SHcont(ψ)={ψa,s,t=a3/4ψ(SsAa(⋅−t))∣a>0,s∈ℝ,t∈ℝ2},

and the corresponding continuous shearlet transform is given by the map

f↦𝒮ℋψf(a,s,t)=⟨f,ψa,s,t⟩,f∈L2(ℝ2),(a,s,t)∈ℝ>0×ℝ×ℝ2.

Discrete shearlet systems

A discrete version of shearlet systems can be directly obtained from SHcont(ψ) by discretizing the parameter set ℝ>0×ℝ×ℝ2. There are numerous approaches for this but the most popular one is given by

{(2j,k,A2j−1Sk−1m)∣j∈ℤ,k∈ℤ,m∈ℤ2}⊆ℝ>0×ℝ×ℝ2.

From this, the discrete shearlet system associated with the shearlet generator ψ is defined by

SH⁡(ψ)={ψj,k,m=23j/4ψ(SkA2j⋅−m)∣j∈ℤ,k∈ℤ,m∈ℤ2},

and the associated discrete shearlet transform is defined by

f↦𝒮ℋψf(j,k,m)=⟨f,ψj,k,m⟩,f∈L2(ℝ2),(j,k,m)∈ℤ×ℤ×ℤ2.

Examples

Template:Multiple image

Let ψ1∈L2(ℝ) be a function satisfying the discrete Calderón condition, i.e.,

∑j∈ℤ|ψ̂1(2−jξ)|2=1,for a.e. ξ∈ℝ,

with ψ̂1∈C∞(ℝ) and supp⁡ψ̂1⊆[−12,−116]∪[116,12], where ψ̂1 denotes the Fourier transform of ψ1. For instance, one can choose ψ1 to be a Meyer wavelet. Furthermore, let ψ2∈L2(ℝ) be such that ψ̂2∈C∞(ℝ), supp⁡ψ̂2⊆[−1,1] and

∑k=−11|ψ̂2(ξ+k)|2=1,for a.e. ξ∈[−1,1].

One typically chooses ψ̂2 to be a smooth bump function. Then ψ∈L2(ℝ2) given by

ψ̂(ξ)=ψ̂1(ξ1)ψ̂2(ξ2ξ1),ξ=(ξ1,ξ2)∈ℝ2,

is called a classical shearlet. It can be shown that the corresponding discrete shearlet system SH⁡(ψ) constitutes a Parseval frame for L2(ℝ2) consisting of bandlimited functions.[5]

Another example are compactly supported shearlet systems, where a compactly supported function ψ∈L2(ℝ2) can be chosen so that SH⁡(ψ) forms a frame for L2(ℝ2).[4][6][7][8] In this case, all shearlet elements in SH⁡(ψ) are compactly supported providing superior spatial localization compared to the classical shearlets, which are bandlimited. Although a compactly supported shearlet system does not generally form a Parseval frame, any function f∈L2(ℝ2) can be represented by the shearlet expansion due to its frame property.

Cone-adapted shearlets

One drawback of shearlets defined as above is the directional bias of shearlet elements associated with large shearing parameters. This effect is already recognizable in the frequency tiling of classical shearlets (see Figure in Section #Examples), where the frequency support of a shearlet increasingly aligns along the ξ2-axis as the shearing parameter s goes to infinity. This causes serious problems when analyzing a function whose Fourier transform is concentrated around the ξ2-axis.

Decomposition of the frequency domain into cones
Decomposition of the frequency domain into cones.

To deal with this problem, the frequency domain is divided into a low-frequency part and two conic regions (see Figure):

ℛ={(ξ1,ξ2)∈ℝ2∣|ξ1|,|ξ2|≤1},𝒞h={(ξ1,ξ2)∈ℝ2∣|ξ2/ξ1|≤1,|ξ1|>1},𝒞v={(ξ1,ξ2)∈ℝ2∣|ξ1/ξ2|≤1,|ξ2|>1}.
Frequency tiling of the cone-adapted shearlet system
Frequency tiling of the cone-adapted shearlet system generated by the classical shearlet.

The associated cone-adapted discrete shearlet system consists of three parts, each one corresponding to one of these frequency domains. It is generated by three functions ϕ,ψ,ψ~∈L2(ℝ2) and a lattice sampling factor c=(c1,c2)∈(ℝ>0)2:

SH⁡(ϕ,ψ,ψ~;c)=Φ(ϕ;c1)∪Ψ(ψ;c)∪Ψ~(ψ~;c),

where

Φ(ϕ;c1)={ϕm=ϕ(⋅−c1m)∣m∈ℤ2},Ψ(ψ;c)={ψj,k,m=23j/4ψ(SkA2j⋅−Mcm)∣j≥0,|k|≤⌈2j/2⌉,m∈ℤ2},Ψ~(ψ~;c)={ψ~j,k,m=23j/4ψ(S~kA~2j⋅−M~cm)∣j≥0,|k|≤⌈2j/2⌉,m∈ℤ2},

with

A~a=[a1/200a],a>0,S~s=[10s1],s∈ℝ,Mc=[c100c2],andM~c=[c200c1].

The systems Ψ(ψ) and Ψ~(ψ~) basically differ in the reversed roles of x1 and x2. Thus, they correspond to the conic regions 𝒞h and 𝒞v, respectively. Finally, the scaling function ϕ is associated with the low-frequency part ℛ.

Applications

Generalizations and extensions

See also

References

  1. ↑ Guo, Kanghui, Gitta Kutyniok, and Demetrio Labate. "Sparse multidimensional representations using anisotropic dilation and shear operators." Wavelets and Splines (Athens, GA, 2005), G. Chen and MJ Lai, eds., Nashboro Press, Nashville, TN (2006): 189–201. Template:Cite web
  2. ↑ Donoho, David Leigh. "Sparse components of images and optimal atomic decompositions." Constructive Approximation 17.3 (2001): 353–382. Template:Cite news
  3. ↑ Guo, Kanghui, and Demetrio Labate. "Optimally sparse multidimensional representation using shearlets." SIAM Journal on Mathematical Analysis 39.1 (2007): 298–318. Template:Cite web
  4. ↑ 4.0 4.1 Kutyniok, Gitta, and Wang-Q Lim. "Compactly supported shearlets are optimally sparse." Journal of Approximation Theory 163.11 (2011): 1564–1589. Template:Cite web
  5. ↑ 5.0 5.1 5.2 5.3 5.4 Kutyniok, Gitta, and Demetrio Labate, eds. Shearlets: Multiscale analysis for multivariate data. Springer, 2012, Template:Isbn
  6. ↑ Kittipoom, Pisamai, Gitta Kutyniok, and Wang-Q Lim. "Construction of compactly supported shearlet frames." Constructive Approximation 35.1 (2012): 21–72. Template:Cite arXiv
  7. ↑ 7.0 7.1 7.2 Kutyniok, Gitta, Jakob Lemvig, and Wang-Q Lim. "Optimally sparse approximations of 3D functions by compactly supported shearlet frames." SIAM Journal on Mathematical Analysis 44.4 (2012): 2962–3017. Template:Cite arXiv
  8. ↑ Purnendu Banerjee and B. B. Chaudhuri, “Video Text Localization using Wavelet and Shearlet Transforms”, In Proc. SPIE 9021, Document Recognition and Retrieval XXI, 2014 (doi:10.1117/12.2036077).Template:Cite book
  9. ↑ Guo, Kanghui, and Demetrio Labate. "The construction of smooth Parseval frames of shearlets." Mathematical Modelling of Natural Phenomena 8.01 (2013): 82–105. Template:Cite web
  10. ↑ Grohs, Philipp and Kutyniok, Gitta. "Parabolic molecules." Foundations of Computational Mathematics (to appear) Template:Cite arXiv
  11. ↑ Template:Cite journal
  12. ↑ Template:Cite journal