BLOCK SUBSPACE PURSUIT FOR BLOCK-SPARSE SIGNAL RECONSTRUCTION
Author(s):
Abstract:
Subspace Pursuit (SP) is an efficient algorithm for sparse signal reconstruction. When the interested signal is block sparse, i.e., the nonzero elements occur in clusters, block sparse recovery algorithms are developed. In this paper, a blocked algorithm based on SP, namely Block SP (BSP) is presented. Contrary to the previous algorithms such as Block Orthogonal Matching Pursuit (BOMP) and mixed 2 1 l /l -norm, our approach presents better recovery performance and requires less time when non-zero elements appear in fixed blocks in a particular hardware in most of the cases. It is demonstrated that our proposed algorithm can precisely reconstruct the blocksparse signals, provided that the sampling matrix satisfies the block restricted isometry property - which is a generalization of the standard RIP widely used in the context of compressed sensingwith a constant parameter. Furthermore, it is experimentally illustrated that the BSP algorithm outperforms other methods such as SP, mixed 2 1 l /l -norm and BOMP. This is more pronounced when the block length is small.
Keywords:
Language:
English
Published:
Iranian Journal of Science and Technology Transactions of Electrical Engineering, Volume:37 Issue: 1, 2013
Pages:
1 to 16
https://magiran.com/p1212207
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 1,390,000ريال میتوانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
- حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران میشود.
- پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانههای چاپی و دیجیتال را به کاربر نمیدهد.
In order to view content subscription is required
Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!