Mo-PM1-8: Algorithms for Compressed Sensing |
Session Type: Lecture |
Time: Monday, June 15, 14:40 - 16:20 |
Location: S228 (L2) |
Session Chair: Byonghyo Shim, Seoul National University |
Mo-PM1-8.1: Subspace Thresholding Pursuit: A Reconstruction Algorithm for Compressed Sensing |
ChaoBing Song; Tsinghua University |
Shu-Tao Xia; Tsinghua University |
Xin-Ji Liu; Tsinghua University |
Mo-PM1-8.2: On Joint Recovery of Sparse Signals with Common Supports |
Xiaochen Zhao; Imperial College London |
Wei Dai; Imperial College London |
Mo-PM1-8.3: On Recovery of Sparse Signals with Block Structures |
Pan Li; Tsinghua University |
Wei Dai; Imperial College London |
Huadong Meng; Tsinghua University |
Xiqin Wang; Tsinghua University |
Mo-PM1-8.4: Sparse Group Covers and Greedy Tree Approximations |
Siddhartha Satpathi; Indian Institute of Technology, Kharagpur |
Luca Baldassarre; École Polytechnique Fédérale de Lausanne |
Volkan Cevher; École Polytechnique Fédérale de Lausanne |
Mo-PM1-8.5: Isotropically Random Orthogonal Matrices: Performance of Lasso and Minimum Conic Singular Values |
Christos Thrampoulidis; California Institute of Technology |
Babak Hassibi; California Institute of Technology |