Abstract
We show that measures with finite support on the real line are the unique solution to an algorithm, named generalized minimal extrapolation, involving only a finite number of generalized moments (which encompass the standard moments, the Laplace transform, the Stieltjes transformation, etc.).Generalized minimal extrapolation shares related geometric properties with the basis pursuit approach of Chen etal. (1998) [5]. Indeed we also extend some standard results of compressed sensing (the dual polynomial, the nullspace property) to the signed measure framework.We express exact reconstruction in terms of a simple interpolation problem. We prove that every nonnegative measure, supported by a set containing s points, can be exactly recovered from only 2. s+. 1 generalized moments. This result leads to a new construction of deterministic sensing matrices for compressed sensing.
| Original language | English |
|---|---|
| Pages (from-to) | 336-354 |
| Number of pages | 19 |
| Journal | Journal of Mathematical Analysis and Applications |
| Volume | 395 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1 Nov 2012 |
| Externally published | Yes |
Keywords
- Basis pursuit
- Beurling minimal extrapolation
- Compressed sensing
- Convex optimization
Fingerprint
Dive into the research topics of 'Exact reconstruction using Beurling minimal extrapolation'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver