کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10132780 | 1645582 | 2018 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Vector minimax concave penalty for sparse representation
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
پردازش سیگنال
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
This paper proposes vector minimax concave (VMC) penalty for sparse representation using tools of Moreau envelope. The VMC penalty is a weighted MC function; by fine tuning the weight of the VMC penalty with given strategy, the VMC regularized least squares problem shares the same global minimizers with the L0 regularization problem but has fewer local minima. Facilitated by the alternating direction method of multipliers (ADMM), the VMC regularization problem can be tackled as a sequence of convex sub-problems, each of which can be solved fast. Theoretical analysis of ADMM shows that the convergence of solving the VMC regularization problem is guaranteed. We present a series of numerical experiments demonstrating the superior performance of the VMC penalty and the ADMM algorithm in broad applications for sparse representation, including sparse denoising, sparse deconvolution, and missing data estimation.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Digital Signal Processing - Volume 83, December 2018, Pages 165-179
Journal: Digital Signal Processing - Volume 83, December 2018, Pages 165-179
نویسندگان
Shibin Wang, Xuefeng Chen, Weiwei Dai, Ivan W. Selesnick, Gaigai Cai, Benjamin Cowen,