Blind Recovery of Sparse Signals From Subsampled Convolution
From MaRDI portal
Abstract: Subsampled blind deconvolution is the recovery of two unknown signals from samples of their convolution. To overcome the ill-posedness of this problem, solutions based on priors tailored to specific application have been developed in practical applications. In particular, sparsity models have provided promising priors. However, in spite of empirical success of these methods in many applications, existing analyses are rather limited in two main ways: by disparity between the theoretical assumptions on the signal and/or measurement model versus practical setups; or by failure to provide a performance guarantee for parameter values within the optimal regime defined by the information theoretic limits. In particular, it has been shown that a naive sparsity model is not a strong enough prior for identifiability in the blind deconvolution problem. Instead, in addition to sparsity, we adopt a conic constraint, which enforces spectral flatness of the signals. Under this prior, we provide an iterative algorithm that achieves guaranteed performance in blind deconvolution at near optimal sample complexity. Numerical results show the empirical performance of the iterative algorithm agrees with the performance guarantee.
Cited in
(20)- A geometric analysis of phase retrieval
- Sparse power factorization: balancing peakiness and sample complexity
- Proof methods for robust low-rank matrix recovery
- Near-optimal bounds for signal recovery from blind phaseless periodic short-time Fourier transform
- Solving phase retrieval with random initial guess is nearly as good as by spectral initialization
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
- Blind three dimensional deconvolution via convex optimization
- Fundamental limits of weak recovery with applications to phase retrieval
- Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements
- Median-truncated gradient descent: a robust and scalable nonconvex approach for signal estimation
- Self-calibration and bilinear inverse problems via linear least squares
- Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent
- Multi-target detection with application to cryo-electron microscopy
- L^p continuity and microlocal properties for pseudodifferential operators
- Spectral Methods for Passive Imaging: Nonasymptotic Performance and Robustness
- Blind deconvolution by a steepest descent algorithm on a quotient manifold
- Robust sensing of low-rank matrices with non-orthogonal sparse decomposition
- Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs
- Bisparse blind deconvolution through hierarchical sparse recovery
- Auto-calibration and biconvex compressive sensing with applications to parallel MRI
This page was built for publication: Blind Recovery of Sparse Signals From Subsampled Convolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989627)
