Back to Search
Start Over
The Achievable Performance of Convex Demixing
- Publication Year :
- 2017
- Publisher :
- California Institute of Technology, 2017.
-
Abstract
- Demixing is the problem of identifying multiple structured signals from a superimposed, undersampled, and noisy observation. This work analyzes a general framework, based on convex optimization, for solving demixing problems. When the constituent signals follow a generic incoherence model, this analysis leads to precise recovery guarantees. These results admit an attractive interpretation: each signal possesses an intrinsic degrees-of-freedom parameter, and demixing can succeed if and only if the dimension of the observation exceeds the total degrees of freedom present in the observation.<br />A 20170314-110228775
Details
- Language :
- English
- Database :
- OpenAIRE
- Accession number :
- edsair.doi...........1ed932d5776a454558d710c035d81f74
- Full Text :
- https://doi.org/10.7907/4kwm-5n31