Analysis of equivalence relation in joint sparse recovery

The joint sparse recovery problem is a generalization of the single measurement vector problem which is widely studied in Compressed Sensing and it aims to recovery a set of jointly sparse vectors. i.e. have nonzero entries concentrated at common location. Meanwhile l_p-minimization subject to matrices is widely used in a large number of algorithms designed for this problem. Therefore the main contribution in this paper is two theoretical results about this technique. The first one is to prove that in every multiple systems of linear equation, there exists a constant p* such that the original unique sparse solution also can be recovered from a minimization in l_p quasi-norm subject to matrices whenever 0< p<p*. The other one is to show an analysis expression of such p*. Finally, we display the results of one example to confirm the validity of our conclusions.

[1]  Rémi Gribonval,et al.  Sparse representations in unions of bases , 2003, IEEE Trans. Inf. Theory.

[2]  M. Unser.  Sampling-50 years after Shannon , 2000, Proceedings of the IEEE.

[3]  Allen Y. Yang,et al.  Robust Face Recognition via Sparse Representation , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Bhaskar D. Rao,et al.  Sparse channel estimation via matching pursuit with application to equalization , 2002, IEEE Trans. Commun..

[5]  Michael P. Friedlander,et al.  Theoretical and Empirical Results for Recovery From Multiple Measurements , 2009, IEEE Transactions on Information Theory.

[6]  Rémi Gribonval,et al.  Real versus complex null space properties for sparse vector recovery , 2010 .

[7]  Yuan Lei,et al.  Analysis of convergence for the alternating direction method applied to joint sparse recovery , 2015, Appl. Math. Comput..

[8]  David J. Field,et al.  Emergence of simple-cell receptive field properties by learning a sparse code for natural images , 1996, Nature.

[9]  Emmanuel J. Candès,et al.  Exact Matrix Completion via Convex Optimization , 2008, Found. Comput. Math..

[10]  Michael P. Fitz,et al.  Reduced complexity decision feedback equalization for multipath channels with large delay spreads , 1999, IEEE Trans. Commun..

[11]  M. Lai,et al.  The null space property for sparse recovery from multiple measurement vectors , 2011 .

[12]  Michael Ulbrich,et al.  A Semismooth Newton Method with Multidimensional Filter Globalization for l1-Optimization , 2014, SIAM J. Optim..

[13]  Jigen Peng,et al.  $NP/CMP$ Equivalence: A Phenomenon Hidden Among Sparsity Models $l_{0}$ Minimization and $l_{p}$ , 2015, IEEE Transactions on Information Theory.

[14]  Dmitry M. Malioutov,et al.  A sparse signal reconstruction perspective for source localization with sensor arrays , 2005, IEEE Transactions on Signal Processing.

[15]  Bhaskar D. Rao,et al.  Sparse solutions to linear inverse problems with multiple measurement vectors , 2005, IEEE Transactions on Signal Processing.

[16]  Joel A. Tropp,et al.  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.

[17]  S. Foucart,et al.  Sparsest solutions of underdetermined linear systems via ℓq-minimization for 0 , 2009 .

[18]  Kaushik Mahata,et al.  A Robust Algorithm for Joint-Sparse Recovery , 2009, IEEE Signal Processing Letters.

[19]  Balas K. Natarajan,et al.  Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..

[20]  Rick Chartrand,et al.  Exact Reconstruction of Sparse Signals via Nonconvex Minimization , 2007, IEEE Signal Processing Letters.

[21]  Yonina C. Eldar,et al.  Beyond bandlimited sampling , 2009, IEEE Signal Processing Magazine.