Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published September 28, 2013 | Submitted
Report Open

The achievable performance of convex demixing

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.

Additional Information

MBM thanks Prof. Leonard Schulman for helpful conversations about this research. This research was supported by ONR awards N00014-08-1-0883 and N00014-11-1002, AFOSR award FA9550-09-1-0643, and a Sloan Research Fellowship.

Attached Files

Submitted - 1309.7478.pdf

Files

1309.7478.pdf
Files (1.2 MB)
Name Size Download all
md5:2d631c12fb189b26cd475a5d547a2aa2
1.2 MB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 18, 2023