Stein Block Thresholding For Image Denoising
Christophe Chesneau (LMNO), Jalal Fadili (GREYC), Jean-Luc Starck, (DAPNIA)

TL;DR
This paper analyzes the theoretical minimax properties of Stein block thresholding for image denoising across various dimensions, demonstrating near-optimal rates and practical effectiveness compared to state-of-the-art methods.
Contribution
It establishes the minimax rates of Stein block thresholding over decomposition spaces and provides a practical, fast denoising procedure with theoretical and empirical validation.
Findings
Achieves near-minimax rates in image denoising
Outperforms BLS-GSM in practical tests
Provides a theoretical framework for threshold parameter selection
Abstract
In this paper, we investigate the minimax properties of Stein block thresholding in any dimension with a particular emphasis on . Towards this goal, we consider a frame coefficient space over which minimaxity is proved. The choice of this space is inspired by the characterization provided in \cite{BorupNielsen} of family of smoothness spaces on , a subclass of so-called decomposition spaces \cite{Feichtinger}. These smoothness spaces cover the classical case of Besov spaces, as well as smoothness spaces corresponding to curvelet-type constructions. Our main theoretical result investigates the minimax rates over these decomposition spaces, and shows that our block estimator can achieve the optimal minimax rate, or is at least nearly-minimax (up to a factor) in the least favorable situation. Another contribution is that the minimax rates given here are stated…
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.
Taxonomy
TopicsImage and Signal Denoising Methods · Advanced Image Fusion Techniques · Advanced Image Processing Techniques
