Adapting to unknown noise level in sparse deconvolution
From MaRDI portal
Publication:4603711
Abstract: In this paper, we study sparse spike deconvolution over the space of complex-valued measures when the input measure is a finite sum of Dirac masses. We introduce a modified version of the Beurling Lasso (BLasso), a semi-definite program that we refer to as the Concomitant Beurling Lasso (CBLasso). This new procedure estimates the target measure and the unknown noise level simultaneously. Contrary to previous estimators in the literature, theory holds for a tuning parameter that depends only on the sample size, so that it can be used for unknown noise level problems. Consistent noise level estimation is standardly proved. As for Radon measure estimation, theoretical guarantees match the previous state-of-the-art results in Super-Resolution regarding minimax prediction and localization. The proofs are based on a bound on the noise level given by a new tail estimate of the supremum of a stationary non-Gaussian process through the Rice method.
Recommendations
- Sparse deconvolution using adaptive mixed-Gaussian models
- Adaptive de-noising of low SNR signals
- Deconvolution under Poisson noise using exact data fidelity and synthesis or analysis sparsity priors
- scientific article; zbMATH DE number 1742181
- Adaptive Image Denoising by Mixture Adaptation
- Estimation of Signal-Dependent Noise Level Function in Transform Domain via a Sparse Recovery Model
- From Bernoulli–Gaussian Deconvolution to Sparse Signal Restoration
- Adaptive Superresolution in Deconvolution of Sparse Peaks
Cites work
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A study of error variance estimation in Lasso regression
- Adaptive estimation of a quadratic functional by model selection.
- Atomic Decomposition by Basis Pursuit
- Comments on: \(\ell_{1}\)-penalization for mixture regression models
- Compressed Sensing Off the Grid
- Convex analysis and monotone operator theory in Hilbert spaces
- Estimation and testing under sparsity. École d'Été de Probabilités de Saint-Flour XLV -- 2015
- Exact reconstruction using Beurling minimal extrapolation
- Exact recovery of non-uniform splines from the projection onto spaces of algebraic polynomials
- Exact support recovery for sparse spikes deconvolution
- Graph implementations for nonsmooth convex programs
- Inverse problems in spaces of measures
- Level Sets and Extrema of Random Processes and Fields
- Near Minimax Line Spectral Estimation
- Near-ideal model selection by \(\ell _{1}\) minimization
- Non-uniform spline recovery from small degree polynomial approximation
- On the prediction performance of the Lasso
- Positive trigonometric polynomials and signal processing applications
- Prediction and Discovery
- Robust Regression and Lasso
- Robust Statistics
- Robust recovery of stream of pulses using convex optimization
- Scaled sparse linear regression
- Spike detection from inaccurate samplings
- Square-root lasso: pivotal recovery of sparse signals via conic programming
- Super-Resolution on the Sphere Using Convex Optimization
- Super-resolution from noisy data
- Super-resolution of point sources via convex programming
- Towards a Mathematical Theory of Super‐resolution
- \(L_1\)-penalization in functional linear regression with subgaussian design
- \(\ell_{1}\)-penalization for mixture regression models
Cited in
(8)- Simultaneous off-the-grid learning of mixtures issued from a continuous dictionary
- Structural, Syntactic, and Statistical Pattern Recognition
- Sampling the Fourier transform along radial lines
- Prediction bounds for higher order total variation regularized least squares
- The MLE is a reliable source: sharp performance guarantees for localization problems
- Localization of point scatterers via sparse optimization on measures
- Off-the-grid prediction and testing for linear combination of translated features
- The basins of attraction of the global minimizers of the non-convex sparse spike estimation problem
This page was built for publication: Adapting to unknown noise level in sparse deconvolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4603711)
