Ridgelets and the representation of mutilated Sobolev functions

We show that ridgelets, a system introduced in [E. J. Candes, Appl. Comput. Harmon. Anal., 6(1999), pp. 197–218], are optimal to represent smooth multivariate functions that may exhibit linear singularities. For instance, let {u · x − b > 0} be an arbitrary hyperplane and consider the singular function f(x) = 1{u·x−b>0}g(x), where g is compactly supported with finite Sobolev L2 norm ||g||Hs, s > 0. The ridgelet coefficient sequence of such an object is as sparse as if f were without singularity, allowing optimal partial reconstructions. For instance, the n-term approximation obtained by keeping the terms corresponding to the n largest coefficients in the ridgelet series achieves a rate of approximation of order n−s/d; the presence of the singularity does not spoil the quality of the ridgelet approximation. This is unlike all systems currently in use, especially Fourier or wavelet representations

Coronal Mass Ejection Detection using Wavelets, Curvelets and Ridgelets: Applications for Space Weather Monitoring

Coronal mass ejections (CMEs) are large-scale eruptions of plasma and magnetic feld that can produce adverse space weather at Earth and other locations in the Heliosphere. Due to the intrinsic multiscale nature of features in coronagraph images, wavelet and multiscale image processing techniques are well suited to enhancing the visibility of CMEs and supressing noise. However, wavelets are better suited to identifying point-like features, such as noise or background stars, than to enhancing the visibility of the curved form of a typical CME front. Higher order multiscale techniques, such as ridgelets and curvelets, were therefore explored to characterise the morphology (width, curvature) and kinematics (position, velocity, acceleration) of CMEs. Curvelets in particular were found to be well suited to characterising CME properties in a self-consistent manner. Curvelets are thus likely to be of benefit to autonomous monitoring of CME properties for space weather applications.Comment: Accepted for publication in Advances in Space Research (3 April 2010

Recovering edges in ill-posed inverse problems: optimality of curvelet frames

We consider a model problem of recovering a function $f(x_1,x_2)$ from noisy Radon data. The function $f$ to be recovered is assumed smooth apart from a discontinuity along a $C^2$ curve, that is, an edge. We use the continuum white-noise model, with noise level $\varepsilon$. Traditional linear methods for solving such inverse problems behave poorly in the presence of edges. Qualitatively, the reconstructions are blurred near the edges; quantitatively, they give in our model mean squared errors (MSEs) that tend to zero with noise level $\varepsilon$ only as $O(\varepsilon^{1/2})$ as $\varepsilon\to 0$. A recent innovation--nonlinear shrinkage in the wavelet domain--visually improves edge sharpness and improves MSE convergence to $O(\varepsilon^{2/3})$. However, as we show here, this rate is not optimal. In fact, essentially optimal performance is obtained by deploying the recently-introduced tight frames of curvelets in this setting. Curvelets are smooth, highly anisotropic elements ideally suited for detecting and synthesizing curved edges. To deploy them in the Radon setting, we construct a curvelet-based biorthogonal decomposition of the Radon operator and build "curvelet shrinkage" estimators based on thresholding of the noisy curvelet coefficients. In effect, the estimator detects edges at certain locations and orientations in the Radon domain and automatically synthesizes edges at corresponding locations and directions in the original domain. We prove that the curvelet shrinkage can be tuned so that the estimator will attain, within logarithmic factors, the MSE $O(\varepsilon^{4/5})$ as noise level $\varepsilon\to 0$. This rate of convergence holds uniformly over a class of functions which are $C^2$ except for discontinuities along $C^2$ curves, and (except for log terms) is the minimax rate for that class. Our approach is an instance of a general strategy which should apply in other inverse problems; we sketch a deconvolution example

Detection and discrimination of cosmological non-Gaussian signatures by multi-scale methods

Recent Cosmic Microwave Background (CMB) observations indicate that the temperature anisotropies arise from quantum fluctuations in the inflationary scenario. In the simplest inflationary models, the distribution of CMB temperature fluctuations should be Gaussian. However, non-Gaussian signatures can be present. They might have different origins and thus different statistical and morphological characteristics. In this context and motivated by recent and future CMB experiments, we search for, and discriminate between, different non-Gaussian signatures. We analyse simulated maps of three cosmological sources of temperature anisotropies: Gaussian distributed CMB anisotropies from inflation, temperature fluctuations from cosmic strings and anisotropies due to the kinetic Sunyaev-Zel'dovich (SZ) effect both showing a non-Gaussian character. We use different multi-scale methods, namely, wavelet, ridgelet and curvelet transforms. The sensitivity and the discriminating power of the methods is evaluated using simulated data sets. We find that the bi-orthogonal wavelet transform is the most powerful for the detection of non-Gaussian signatures and that the curvelet and ridgelet transforms characterise quite precisely and exclusively the cosmic strings. They allow us thus to detect them in a mixture of CMB + SZ + cosmic strings. We show that not one method only should be applied to understand non-Gaussianity but rather a set of different robust and complementary methods should be used.Comment: Accepted for publication in A&A. Paper with high resolution figures can be found at http://jstarck.free.fr/cmb03.pd

Deep Convolutional Neural Networks Based on Semi-Discrete Frames

Deep convolutional neural networks have led to breakthrough results in practical feature extraction applications. The mathematical analysis of these networks was pioneered by Mallat, 2012. Specifically, Mallat considered so-called scattering networks based on identical semi-discrete wavelet frames in each network layer, and proved translation-invariance as well as deformation stability of the resulting feature extractor. The purpose of this paper is to develop Mallat's theory further by allowing for different and, most importantly, general semi-discrete frames (such as, e.g., Gabor frames, wavelets, curvelets, shearlets, ridgelets) in distinct network layers. This allows to extract wider classes of features than point singularities resolved by the wavelet transform. Our generalized feature extractor is proven to be translation-invariant, and we develop deformation stability results for a larger class of deformations than those considered by Mallat. For Mallat's wavelet-based feature extractor, we get rid of a number of technical conditions. The mathematical engine behind our results is continuous frame theory, which allows us to completely detach the invariance and deformation stability proofs from the particular algebraic structure of the underlying frames.Comment: Proc. of IEEE International Symposium on Information Theory (ISIT), Hong Kong, China, June 2015, to appea

The curvelet transform for image denoising

We describe approximate digital implementations of two new mathematical transforms, namely, the ridgelet transform and the curvelet transform. Our implementations offer exact reconstruction, stability against perturbations, ease of implementation, and low computational complexity. A central tool is Fourier-domain computation of an approximate digital Radon transform. We introduce a very simple interpolation in the Fourier space which takes Cartesian samples and yields samples on a rectopolar grid, which is a pseudo-polar sampling set based on a concentric squares geometry. Despite the crudeness of our interpolation, the visual performance is surprisingly good. Our ridgelet transform applies to the Radon transform a special overcomplete wavelet pyramid whose wavelets have compact support in the frequency domain. Our curvelet transform uses our ridgelet transform as a component step, and implements curvelet subbands using a filter bank of a` trous wavelet filters. Our philosophy throughout is that transforms should be overcomplete, rather than critically sampled. We apply these digital transforms to the denoising of some standard images embedded in white noise. In the tests reported here, simple thresholding of the curvelet coefficients is very competitive with "state of the art" techniques based on wavelets, including thresholding of decimated or undecimated wavelet transforms and also including tree-based Bayesian posterior mean methods. Moreover, the curvelet reconstructions exhibit higher perceptual quality than wavelet-based reconstructions, offering visually sharper images and, in particular, higher quality recovery of edges and of faint linear and curvilinear features. Existing theory for curvelet and ridgelet transforms suggests that these new approaches can outperform wavelet methods in certain image reconstruction problems. The empirical results reported here are in encouraging agreement