Computer Science – Information Theory
Scientific paper
2009-05-20
Computer Science
Information Theory
Scientific paper
In this report, a novel efficient algorithm for recovery of jointly sparse signals (sparse matrix) from multiple incomplete measurements has been presented, in particular, the NESTA-based MMV optimization method. In a nutshell, the jointly sparse recovery is obviously superior to applying standard sparse reconstruction methods to each channel individually. Moreover several efforts have been made to improve the NESTA-based MMV algorithm, in particular, (1) the NESTA-based MMV algorithm for partially known support to greatly improve the convergence rate, (2) the detection of partial (or all) locations of unknown jointly sparse signals by using so-called MUSIC algorithm; (3) the iterative NESTA-based algorithm by combing hard thresholding technique to decrease the numbers of measurements. It has been shown that by using proposed approach one can recover the unknown sparse matrix X with () Spark A -sparsity from () Spark A measurements, predicted in Ref. [1], where the measurement matrix denoted by A satisfies the so-called restricted isometry property (RIP). Under a very mild condition on the sparsity of X and characteristics of the A, the iterative hard threshold (IHT)-based MMV method has been shown to be also a very good candidate.
Li Fang
Li Lianlin
No associations
LandOfFree
Novel Algorithm for Sparse Solutions to Linear Inverse Problems with Multiple Measurements 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 Novel Algorithm for Sparse Solutions to Linear Inverse Problems with Multiple Measurements, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Novel Algorithm for Sparse Solutions to Linear Inverse Problems with Multiple Measurements will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-242370