Journal ArticleDOI
New tight frames of curvelets and optimal representations of objects with piecewise C2 singularities
TLDR
This paper introduces new tight frames of curvelets to address the problem of finding optimally sparse representations of objects with discontinuities along piecewise C2 edges.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 C n obtained by selecting the n largest terms in the curvelet series obeys ∥f - f C n ∥ 2 L2 ≤ C . n -2 . (log n) 3 , n → ∞. 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.read more
Citations
More filters
Proceedings ArticleDOI
Contourlet versus Wavelet Transform: A performance study for a robust image watermarking
TL;DR: Experimental results show the superiority of the CLT-based watermarking technique over the WT-based one in resisting the investigated common signal processing attacks.
Book ChapterDOI
Compressed Sensing and Dictionary Learning
Ke-Lin Du,Mallappa Kumara Swamy +1 more
TL;DR: This chapter introduces compressed sensing, sparse representation/sparse coding, tensor compressed sensing and sparse PCA, a matrix factorization technique for sparse coding.
Journal ArticleDOI
The fast Fourier Transform and fast Wavelet Transform for Patterns on the Torus
TL;DR: A fast Fourier transform on regular d-dimensional lattices is introduced, which can be used to perform a fast multivariate wavelet decomposition, where the wavelets are given as trigonometric polynomials and the preferred directions of the decomposition itself can be characterized.
Posted Content
Optimal approximation of piecewise smooth functions using deep ReLU neural networks
TL;DR: In this paper, the authors studied the necessary and sufficient complexity of ReLU neural networks in terms of depth and number of weights required for approximating classifier functions in L 2.
Journal ArticleDOI
X-ray computed tomography using curvelet sparse regularization
Matthias Wieczorek,Jürgen Frikel,Jakob Vogel,Elena Eggl,Felix K. Kopp,Peter B. Noël,Franz Pfeiffer,Laurent Demaret,Tobias Lasser +8 more
TL;DR: The authors conclude that curvelet sparse regularization is able to improve reconstruction quality by reducing noise while preserving highly directional features, in particular, high contrast features with smooth contrast variations.
References
More filters
Journal ArticleDOI
De-noising by soft-thresholding
TL;DR: The authors prove two results about this type of estimator that are unprecedented in several ways: with high probability f/spl circ/*/sub n/ is at least as smooth as f, in any of a wide variety of smoothness measures.
Journal ArticleDOI
The curvelet transform for image denoising
TL;DR: In this paper, the authors describe approximate digital implementations of two new mathematical transforms, namely, the ridgelet transform and the curvelet transform, which offer exact reconstruction, stability against perturbations, ease of implementation, and low computational complexity.
Journal ArticleDOI
High performance scalable image compression with EBCOT
TL;DR: A new image compression algorithm is proposed, based on independent embedded block coding with optimized truncation of the embedded bit-streams (EBCOT), capable of modeling the spatially varying visual masking phenomenon.
Journal ArticleDOI
Painless nonorthogonal expansions
TL;DR: In a Hilbert space H, discrete families of vectors {hj} with the property that f = ∑j〈hj ǫ à à hj à f à for every f in H are considered.
Journal ArticleDOI
Shiftable multiscale transforms
TL;DR: Two examples of jointly shiftable transforms that are simultaneously shiftable in more than one domain are explored and the usefulness of these image representations for scale-space analysis, stereo disparity measurement, and image enhancement is demonstrated.