Convex Feasibility Methods for Compressed Sensing

Details Convex Feasibility Methods for Compressed Sensing Convex Feasibility Methods for Compressed Sensing

2010-01-25

arxiv.org/abs/1001.4387v2

Computer Science

Information Theory

Scientific paper

We present a computationally-efficient method for recovering sparse signals from a series of noisy observations, known as the problem of compressed sensing (CS). CS theory requires solving a convex constrained minimization problem. We propose to transform this optimization problem into a convex feasibility problem (CFP), and solve it using subgradient projection methods, which are iterative, fast, robust and convergent schemes for solving CFPs. As opposed to some of the recently-introduced CS algorithms, such as Bayesian CS and gradient projections for sparse reconstruction, which become inefficient as the problem dimension and sparseness degree increase, the newly-proposed methods exhibit a marked robustness with respect to these factors. This renders the subgradient projection methods highly viable for large-scale compressible scenarios.

Affiliated with

Also associated with

No associations

Rating

Convex Feasibility Methods for 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 Convex Feasibility Methods for Compressed Sensing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convex Feasibility Methods for Compressed Sensing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-130731