pith. sign in

arxiv: 1103.4951 · v2 · pith:L4VCN6BFnew · submitted 2011-03-25 · 🧮 math.ST · cs.IT· math.IT· math.OC· math.PR· stat.TH

Exact Reconstruction using Beurling Minimal Extrapolation

classification 🧮 math.ST cs.ITmath.ITmath.OCmath.PRstat.TH
keywords generalizedextrapolationminimalmomentssensingcompressedexactfinite
0
0 comments X
read the original 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 basis pursuit of Chen, Donoho and Saunders [CDS98]. 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 2s + 1 generalized moments. This result leads to a new construction of deterministic sensing matrices for compressed sensing.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Weighted quantization using MMD: From mean field to mean shift via gradient flows

    stat.ML 2025-02 unverdicted novelty 6.0

    Derives MSIP algorithm from MMD gradient flows for weighted quantization, extending mean shift and relating to preconditioned gradient descent and Lloyd's clustering.