کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6957259 | 1451915 | 2018 | 32 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Sparse signal recovery with multiple prior information: Algorithm and measurement bounds
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
پردازش سیگنال
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Sparse signal recovery with multiple prior information: Algorithm and measurement bounds Sparse signal recovery with multiple prior information: Algorithm and measurement bounds](/preview/png/6957259.png)
چکیده انگلیسی
We address the problem of reconstructing a sparse signal from compressive measurements with the aid of multiple known correlated signals. We propose a reconstruction algorithm with multiple side information signals (RAMSI), which solves an nââ1 minimization problem by weighting adaptively the multiple side information signals at every iteration. In addition, we establish theoretical bounds on the number of measurements required to guarantee successful reconstruction of the sparse signal via weighted nââ1 minimization. The analysis of the derived bounds reveals that weighted nââ1 minimization can achieve sharper bounds and significant performance improvements compared to classical compressed sensing (CS). We evaluate experimentally the proposed RAMSI algorithm and the established bounds using numerical sparse signals. The results show that the proposed algorithm outperforms state-of-the-art algorithms-including classical CS, â1-â1 minimization, Modified-CS, regularized Modified-CS, and weighted â1 minimization-in terms of both the theoretical bounds and the practical performance.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Signal Processing - Volume 152, November 2018, Pages 417-428
Journal: Signal Processing - Volume 152, November 2018, Pages 417-428
نویسندگان
Huynh Van Luong, Nikos Deligiannis, Jürgen Seiler, Søren Forchhammer, André Kaup,