کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6959738 | 1451959 | 2015 | 17 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Two-level â1 minimization for compressed sensing
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
پردازش سیگنال
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Compressed sensing using â1 minimization has been widely and successfully applied. To further enhance the sparsity, a non-convex and piecewise linear penalty is proposed. This penalty gives two different weights according to the order of the absolute value and hence is called the two-level â1-norm. The two-level â1-norm can be minimized by an iteratively reweighted â1 method. Compared with some existing non-convex methods, the two-level â1 minimization has similar sparsity and enjoys good convergence behavior. More importantly, the related soft thresholding algorithm has been established. The shrinkage operator for the two-level â1-norm is not non-expansive and its convergence is proved by showing the monotone of the objective value in the iterations. In numerical experiments, the proposed algorithms achieve good sparse signal estimation performance, which makes the two-level â1 minimization a promising technique for compressed sensing.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Signal Processing - Volume 108, March 2015, Pages 459-475
Journal: Signal Processing - Volume 108, March 2015, Pages 459-475
نویسندگان
Xiaolin Huang, Yipeng Liu, Lei Shi, Sabine Van Huffel, Johan A.K. Suykens,