Weighted compressed sensing and rank minimization

We present an alternative analysis of weighted ℓ1 minimization for sparse signals with a nonuniform sparsity model, and extend our results to nuclear norm minimization for matrices with nonuniform singular vector distribution. In the case of vectors, we find explicit upper bounds for the successful recovery thresholds, and give a simple suboptimal weighting rule. For matrices, the thresholds we find are only implicit, and the optimal weight selection requires an exhaustive search. For the special case of very wide matrices, the relationship is made explicit and the optimal weight assignment is the same as the vector case. We demonstrate through simulations that for vectors, the suggested weighting scheme improves the recovery performance over that of regular ℓ1 minimization.

[1]  Weiyu Xu,et al.  On sharp performance bounds for robust sparse signal recoveries , 2009, 2009 IEEE International Symposium on Information Theory.

[2]  J. Kuelbs.  Probability on Banach spaces , 1978 .

[3]  Toshiyuki Tanaka,et al.  Optimal incorporation of sparsity information by weighted ℓ1 optimization , 2010, 2010 IEEE International Symposium on Information Theory.

[4]  E. Candès.  The restricted isometry property and its implications for compressed sensing , 2008 .

[5]  Y. Gordon.  Some inequalities for Gaussian processes and applications , 1985 .

[6]  David L. Donoho,et al.  Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing , 2009, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[7]  Weiyu Xu,et al.  Null space conditions and thresholds for rank minimization , 2011, Math. Program..

[8]  Pablo A. Parrilo,et al.  Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..

[9]  Weiyu Xu,et al.  Weighted ℓ1 minimization for sparse recovery with prior information , 2009, 2009 IEEE International Symposium on Information Theory.

[10]  Weiyu Xu,et al.  Analyzing Weighted $\ell_1$ Minimization for Sparse Recovery With Nonuniform Sparse Models , 2010, IEEE Transactions on Signal Processing.

[11]  D. Donoho,et al.  Neighborliness of randomly projected simplices in high dimensions. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[12]  Wei Lu,et al.  Modified-CS: Modifying compressive sensing for problems with partially known support , 2009, 2009 IEEE International Symposium on Information Theory.