Computer Science – Learning
Scientific paper
2008-05-01
Computer Science
Learning
Scientific paper
This article considers constrained $\ell_1$ minimization methods for the recovery of high dimensional sparse signals in three settings: noiseless, bounded error and Gaussian noise. A unified and elementary treatment is given in these noise settings for two $\ell_1$ minimization methods: the Dantzig selector and $\ell_1$ minimization with an $\ell_2$ constraint. The results of this paper improve the existing results in the literature by weakening the conditions and tightening the error bounds. The improvement on the conditions shows that signals with larger support can be recovered accurately. This paper also establishes connections between restricted isometry property and the mutual incoherence property. Some results of Candes, Romberg and Tao (2006) and Donoho, Elad, and Temlyakov (2006) are extended.
Cai Tony T.
Xu Guangwu
Zhang James J.
No associations
LandOfFree
On Recovery of Sparse Signals via $\ell_1$ Minimization 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 On Recovery of Sparse Signals via $\ell_1$ Minimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Recovery of Sparse Signals via $\ell_1$ Minimization will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-340674