Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds
From MaRDI portal
Abstract: Suppose that we have sensors and each one intends to send a function (e.g. a signal or an image) to a receiver common to all sensors. During transmission, each gets convolved with a function . The receiver records the function , given by the sum of all these convolved signals. When and under which conditions is it possible to recover the individual signals and the blurring functions from just one received signal ? This challenging problem, which intertwines blind deconvolution with blind demixing, appears in a variety of applications, such as audio processing, image processing, neuroscience, spectroscopy, and astronomy. It is also expected to play a central role in connection with the future Internet-of-Things. We will prove that under reasonable and practical assumptions, it is possible to solve this otherwise highly ill-posed problem and recover the transmitted functions and the impulse responses in a robust, reliable, and efficient manner from just one single received function by solving a semidefinite program. We derive explicit bounds on the number of measurements needed for successful recovery and prove that our method is robust in the presence of noise. Our theory is actually sub-optimal, since numerical experiments demonstrate that, quite remarkably, recovery is still possible if the number of measurements is close to the number of degrees of freedom.
Cited in
(24)- Sparse blind deconvolution and demixing through \(\ell_{1,2}\)-minimization
- Painless breakups -- efficient demixing of low rank matrices
- Blind deconvolution when noise is symmetric: Existence and examples of solutions
- Exact matrix completion based on low rank Hankel structure in the Fourier domain
- Sparse power factorization: balancing peakiness and sample complexity
- Hierarchical compressed sensing
- Proof methods for robust low-rank matrix recovery
- A comparison of block based Kalman filter and H-infinity algorithms for blind image separation
- Guarantees of Riemannian optimization for low rank matrix completion
- Blind three dimensional deconvolution via convex optimization
- Rapid, robust, and reliable blind deconvolution via nonconvex optimization
- Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements
- Self-calibration and bilinear inverse problems via linear least squares
- Geometry and symmetry in short-and-sparse deconvolution
- Noisy matrix completion: understanding statistical guarantees for convex relaxation via nonconvex optimization
- Multi-target detection with application to cryo-electron microscopy
- Optimal injectivity conditions for bilinear inverse problems with applications to identifiability of deconvolution problems
- The numerics of phase retrieval
- Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs
- Riemannian thresholding methods for row-sparse and low-rank matrix recovery
- Bisparse blind deconvolution through hierarchical sparse recovery
- How robust is randomized blind deconvolution via nuclear norm minimization against adversarial noise?
- Recovery performance of PhaseLift for phase retrieval from coded diffraction patterns
- Graphical model for factorization and completion of relatively high rank tensors by sparse sampling
This page was built for publication: Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358585)
