A Unified Recovery of Structured Signals Using Atomic Norm
From MaRDI portal
Abstract: In many applications we seek to recover signals from linear measurements far fewer than the ambient dimension, given the signals have exploitable structures such as sparse vectors or low rank matrices. In this paper we work in a general setting where signals are approximately sparse in an so called atomic set. We provide general recovery results stating that a convex programming can stably and robustly recover signals if the null space of the sensing map satisfies certain properties. Moreover, we argue that such null space property can be satisfied with high probability if each measurement is subgaussian even when the number of measurements are very few. Some new results for recovering signals sparse in a frame, and recovering low rank matrices are also derived as a result.
Recommendations
- The convex geometry of linear inverse problems
- Simple bounds for recovering low-complexity models
- On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures
- Stable signal recovery from incomplete and inaccurate measurements
- Convex Recovery of a Structured Signal from Independent Random Linear Measurements
This page was built for publication: A Unified Recovery of Structured Signals Using Atomic Norm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6404911)
