Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds
Shuyang Ling, Thomas Strohmer

TL;DR
This paper addresses the complex problem of simultaneously recovering multiple signals and their convolutional blurring functions from a single observed mixture, proposing a semidefinite programming approach with theoretical guarantees.
Contribution
It introduces a novel method combining blind deconvolution and blind demixing, providing explicit measurement bounds and robustness analysis for the recovery process.
Findings
Successful recovery under practical assumptions
Explicit measurement bounds derived
Method remains robust with noisy data
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…
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
TopicsSparse and Compressive Sensing Techniques · Blind Source Separation Techniques · Image and Signal Denoising Methods
