pith. sign in

arxiv: 1702.04917 · v2 · pith:I5SMZQUNnew · submitted 2017-02-16 · 💻 cs.IT · math.IT

Compressed sensing in Hilbert spaces

classification 💻 cs.IT math.IT
keywords describemeasurementsrecoveryunknownvectorlinearpossibleproblems
0
0 comments X
read the original abstract

In many linear inverse problems, we want to estimate an unknown vector belonging to a high-dimensional (or infinite-dimensional) space from few linear measurements. To overcome the ill-posed nature of such problems, we use a low-dimension assumption on the unknown vector: it belongs to a low-dimensional model set. The question of whether it is possible to recover such an unknown vector from few measurements then arises. If the answer is yes, it is also important to be able to describe a way to perform such a recovery. We describe a general framework where appropriately chosen random measurements guarantee that recovery is possible. We further describe a way to study the performance of recovery methods that consist in the minimization of a regularization function under a data-fit constraint.

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.