Concatenate and Boost for Multiple Measurement Vector Problems

Details Concatenate and Boost for Multiple Measurement Vector Problems Concatenate and Boost for Multiple Measurement Vector Problems

2009-06-15

arxiv.org/abs/0906.2609v1

Computer Science

Information Theory

11 pages, 6 figures, Submitted to IEEE Signal Processing Letters

Scientific paper

Multiple measurement vector (MMV) problem addresses the recovery of a set of sparse signal vectors that share common non-zero support, and has emerged an important topics in compressed sensing. Even though the fundamental performance limit of recoverable sparsity level has been formally derived, conventional algorithms still exhibit significant performance gaps from the theoretical bound. The main contribution of this paper is a novel concatenate MMV and boost (CoMBo) algorithm that achieves the theoretical bound. More specifically, the algorithm concatenates MMV to a larger dimensional SMV problem and boosts it by multiplying random orthonormal matrices. Extensive simulation results demonstrate that CoMBo outperforms all existing methods and achieves the theoretical bound as the number of measurement vector increases.

Affiliated with

Also associated with

No associations

Rating

Concatenate and Boost for Multiple Measurement Vector Problems 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 Concatenate and Boost for Multiple Measurement Vector Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Concatenate and Boost for Multiple Measurement Vector Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-315588