Various thresholds for $\ell_1$-optimization in compressed sensing

Details Various thresholds for $\ell_1$-optimization in compressed sensing Various thresholds for $\ell_1$-optimization in compressed sensing

2009-07-21

arxiv.org/abs/0907.3666v1

Computer Science

Information Theory

Scientific paper

Recently, \cite{CRT,DonohoPol} theoretically analyzed the success of a polynomial $\ell_1$-optimization algorithm in solving an under-determined system of linear equations. In a large dimensional and statistical context \cite{CRT,DonohoPol} proved that if the number of equations (measurements in the compressed sensing terminology) in the system is proportional to the length of the unknown vector then there is a sparsity (number of non-zero elements of the unknown vector) also proportional to the length of the unknown vector such that $\ell_1$-optimization succeeds in solving the system. In this paper, we provide an alternative performance analysis of $\ell_1$-optimization and obtain the proportionality constants that in certain cases match or improve on the best currently known ones from \cite{DonohoPol,DT}.

Affiliated with

Also associated with

No associations

Rating

Various thresholds for $\ell_1$-optimization in compressed sensing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Various thresholds for $\ell_1$-optimization in compressed sensing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Various thresholds for $\ell_1$-optimization in compressed sensing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-176187