Coherence and sufficient sampling densities for reconstruction in compressed sensing

02/12/2013
by   Franz J Király, et al.
0

We give a new, very general, formulation of the compressed sensing problem in terms of coordinate projections of an analytic variety, and derive sufficient sampling rates for signal reconstruction. Our bounds are linear in the coherence of the signal space, a geometric parameter independent of the specific signal and measurement, and logarithmic in the ambient dimension where the signal is presented. We exemplify our approach by deriving sufficient sampling densities for low-rank matrix completion and distance matrix completion which are independent of the true matrix.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/25/2020

Adversarial Robust Low Rank Matrix Estimation: Compressed Sensing and Matrix Completion

We consider robust low rank matrix estimation when random noise is heavy...
research
04/06/2011

Compressed Sensing and Matrix Completion with Constant Proportion of Corruptions

We improve existing results in the field of compressed sensing and matri...
research
08/09/2014

Matrix Coherence and the Nystrom Method

The Nystrom method is an efficient technique used to speed up large-scal...
research
04/01/2022

Survey of Matrix Completion Algorithms

Matrix completion problem has been investigated under many different con...
research
04/18/2019

On Low-rank Trace Regression under General Sampling Distribution

A growing number of modern statistical learning problems involve estimat...
research
08/23/2021

On the Foundation of Sparse Sensing (Part I): Necessary and Sufficient Sampling Theory and Robust Remaindering Problem

In the first part of the series papers, we set out to answer the followi...
research
04/16/2013

Spectral Compressed Sensing via Structured Matrix Completion

The paper studies the problem of recovering a spectrally sparse object f...

Please sign up or login with your details

Forgot password? Click here to reset