Efficient Recovery of Block Sparse Signals via Zero-point Attracting Projection

Details Efficient Recovery of Block Sparse Signals via Zero-point Attracting Projection Efficient Recovery of Block Sparse Signals via Zero-point Attracting Projection

2012-03-08

arxiv.org/abs/1203.1714v1

Computer Science

Information Theory

4 pages, 2 figures

Scientific paper

In this paper, we consider compressed sensing (CS) of block-sparse signals, i.e., sparse signals that have nonzero coefficients occurring in clusters. An efficient algorithm, called zero-point attracting projection (ZAP) algorithm, is extended to the scenario of block CS. The block version of ZAP algorithm employs an approximate $l_{2,0}$ norm as the cost function, and finds its minimum in the solution space via iterations. For block sparse signals, an analysis of the stability of the local minimums of this cost function under the perturbation of noise reveals an advantage of the proposed algorithm over its original non-block version in terms of reconstruction error. Finally, numerical experiments show that the proposed algorithm outperforms other state of the art methods for the block sparse problem in various respects, especially the stability under noise.

Affiliated with

Also associated with

No associations

Rating

Efficient Recovery of Block Sparse Signals via Zero-point Attracting Projection 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 Efficient Recovery of Block Sparse Signals via Zero-point Attracting Projection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Recovery of Block Sparse Signals via Zero-point Attracting Projection will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-16936