Fast Algorithms for Demixing Sparse Signals From Nonlinear Observations
From MaRDI portal
Publication:4621799
DOI10.1109/TSP.2017.2706181zbMATH Open1414.94578arXiv1608.01234OpenAlexW2487980609MaRDI QIDQ4621799FDOQ4621799
Authors: Mohammad Reza Soltani, Chinmay Hegde
Publication date: 8 February 2019
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Abstract: We study the problem of demixing a pair of sparse signals from noisy, nonlinear observations of their superposition. Mathematically, we consider a nonlinear signal observation model, , where denotes the superposition signal, and are orthonormal bases in , and are sparse coefficient vectors of the constituent signals, and represents the noise. Moreover, represents a nonlinear link function, and is the -th row of the measurement matrix, . Problems of this nature arise in several applications ranging from astronomy, computer vision, and machine learning. In this paper, we make some concrete algorithmic progress for the above demixing problem. Specifically, we consider two scenarios: (i) the case when the demixing procedure has no knowledge of the link function, and (ii) the case when the demixing algorithm has perfect knowledge of the link function. In both cases, we provide fast algorithms for recovery of the constituents and from the observations. Moreover, we support these algorithms with a rigorous theoretical analysis, and derive (nearly) tight upper bounds on the sample complexity of the proposed algorithms for achieving stable recovery of the component signals. We also provide a range of numerical simulations to illustrate the performance of the proposed algorithms on both real and synthetic signals and images.
Full work available at URL: https://arxiv.org/abs/1608.01234
Cited In (3)
This page was built for publication: Fast Algorithms for Demixing Sparse Signals From Nonlinear Observations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4621799)