Computer Science – Information Theory
Scientific paper
2011-02-23
Computer Science
Information Theory
Scientific paper
In this paper, we develop verifiable and computable performance analysis of sparsity recovery. We define a family of goodness measures for arbitrary sensing matrices as a set of optimization problems, and design algorithms with a theoretical global convergence guarantee to compute these goodness measures. The proposed algorithms solve a series of second-order cone programs, or linear programs. As a by-product, we implement an efficient algorithm to verify a sufficient condition for exact sparsity recovery in the noise-free case. We derive performance bounds on the recovery errors in terms of these goodness measures. We also analytically demonstrate that the developed goodness measures are non-degenerate for a large class of random sensing matrices, as long as the number of measurements is relatively large. Numerical experiments show that, compared with the restricted isometry based performance bounds, our error bounds apply to a wider range of problems and are tighter, when the sparsity levels of the signals are relatively low.
Nehorai Arye
Tang Gongguo
No associations
LandOfFree
Verifiable and computable performance analysis of sparsity recovery 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 Verifiable and computable performance analysis of sparsity recovery, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Verifiable and computable performance analysis of sparsity recovery will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-85927