SuperLectures.com

WEIGHTED COMPRESSED SENSING AND RANK MINIMIZATION

Full Paper at IEEE Xplore

Compressed Sensing: Theory and Methods

Přednášející: Babak Hassibi, Autoři: Samet Oymak, M. Amin Khajehnejad, Babak Hassibi, California Institute of Technology, United States

We present an alternative analysis of weighted $ell_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 $ell_1$ minimization.

  Přepis řeči

|

  Slajdy

Zvětšit slajd | Zobrazit všechny slajdy

0:00:16

  1. slajd

0:00:54

  2. slajd

0:01:43

  3. slajd

0:02:43

  4. slajd

0:04:42

  5. slajd

0:07:04

  6. slajd

0:08:23

  7. slajd

0:10:40

  8. slajd

0:11:01

  9. slajd

0:11:22

 10. slajd

0:12:16

 11. slajd

0:12:36

 12. slajd

0:13:58

 13. slajd

0:14:42

 14. slajd

0:15:51

 15. slajd

0:16:06

 16. slajd

0:16:40

 17. slajd

0:17:02

     6. slajd

  Komentáře

Please sign in to post your comment!

  Informace o přednášce

Nahráno: 2011-05-26 14:25 - 14:45, Club B
Přidáno: 22. 6. 2011 05:50
Počet zhlédnutí: 72
Rozlišení videa: 1024x576 px, 512x288 px
Délka videa: 0:19:49
Audio stopa: MP3 [6.70 MB], 0:19:49