Beyond sparse denoising in frames: minimax estimation with a scattering transform
Nathana\"el Cuvelle--Magar, St\'ephane Mallat

TL;DR
This paper introduces a novel denoising estimator based on scattering transforms that adapt to complex image regularities, achieving minimax bounds for cartoon images with unknown regularity parameters.
Contribution
It proposes a new joint minimax estimator using scattering coefficients, bridging harmonic analysis and deep learning for optimal noise suppression.
Findings
Estimator reaches minimax asymptotic bounds for all Lipschitz exponents α ≤ 2
Provides a harmonic analysis approach to noise suppression and geometric regularity detection
States a mathematical conjecture supported by numerical experiments
Abstract
A considerable amount of research in harmonic analysis has been devoted to non-linear estimators of signals contaminated by additive Gaussian noise. They are implemented by thresholding coefficients in a frame, which provide a sparse signal representation, or by minimising their norm. However, sparse estimators in frames are not sufficiently rich to adapt to complex signal regularities. For cartoon images whose edges are piecewise curves, wavelet, curvelet and Xlet frames are suboptimal if the Lipschitz exponent is an unknown parameter. Deep convolutional neural networks have recently obtained much better numerical results, which reach the minimax asymptotic bounds for all . Wavelet scattering coefficients have been introduced as simplified convolutional neural network models. They are computed by transforming the modulus of wavelet…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
