کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5775542 | 1631740 | 2018 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A remark on joint sparse recovery with OMP algorithm under restricted isometry property
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
The theory and algorithms for recovering a sparse representation of multiple measurement vector (MMV) are studied in compressed sensing community. The sparse representation of MMV aims to find the K-row sparse matrix X such that Y=AX, where A is a known measurement matrix. In this paper, we show that, if the restricted isometry property (RIP) constant δK+1 of the measurement matrix A satisfies δK+1<1K+1, then all K-row sparse matrices can be recovered exactly via the Orthogonal Matching Pursuit (OMP) algorithm in K
iterations based on Y=AX. Moreover, a matrix with RIP constant δK+1=1K+0.086 is constructed such that the OMP algorithm fails to recover some K-row sparse matrix X in K
iterations. Similar results also hold for K-sparse signals recovery. In addition, our main result further improves the proposed bound δK+1=1K by Mo and Shen [12] which can not guarantee OMP to exactly recover some K-sparse signals.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 316, 1 January 2018, Pages 18-24
Journal: Applied Mathematics and Computation - Volume 316, 1 January 2018, Pages 18-24
نویسندگان
Xiaobo Yang, Anping Liao, Jiaxin Xie,