کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
564478 | 875603 | 2010 | 5 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On a simple derivation of the complementary matching pursuit
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
پردازش سیگنال
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: On a simple derivation of the complementary matching pursuit On a simple derivation of the complementary matching pursuit](/preview/png/564478.png)
چکیده انگلیسی
Sparse approximation in a redundant basis has attracted considerable attention in recent years because of many practical applications. The problem basically involves solving an under-determined system of linear equations under some sparsity constraint. In this paper, we present a simple interpretation of the recently proposed complementary matching pursuit (CMP) algorithm. The interpretation shows that the CMP, unlike the classical MP, selects an atom and determines its weight based on a certain sparsity measure of the resulting residual error. Based on this interpretation, we also derive another simple algorithm which is seen to outperform CMP at low sparsity levels for noisy measurement vectors.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Signal Processing - Volume 90, Issue 2, February 2010, Pages 702–706
Journal: Signal Processing - Volume 90, Issue 2, February 2010, Pages 702–706
نویسندگان
Gagan Rath, Christine Guillemot,