کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6957945 | 1451923 | 2018 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Nonconvex penalties with analytical solutions for one-bit compressive sensing
ترجمه فارسی عنوان
جریمه های غیرقانونی با راه حل های تحلیلی برای سنجش فشرده سازی یک بیتی
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
سنجش فشرده سازی یک بیتی، مجازات غیر محدب، راه حل های تحلیلی،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
پردازش سیگنال
چکیده انگلیسی
One-bit measurements widely exist in the real world and can be used to recover sparse signals. This task is known as one-bit compressive sensing (1bit-CS). In this paper, we propose novel algorithms based on both convex and non-convex sparsity-inducing penalties for robust 1bit-CS. We consider the dual problem, which has only one variable and provides a sufficient condition to verify whether a solution is globally optimal or not. For positive homogeneous penalties, a globally optimal solution can be obtained in two steps: a proximal operator and a normalization step. For other penalties, we solve the dual problem, and it needs to evaluate the proximal operators for many times. Then we provide fast algorithms for finding analytical solutions for three penalties: minimax concave penalty (MCP), â0 norm, and sorted â1 penalty. Specifically, our algorithm is more than 200 times faster than the existing algorithm for MCP. Its efficiency is comparable to the algorithm for the â1 penalty in time, while its performance is much better than â1. Among these penalties, sorted â1 is most robust to noise in different settings.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Signal Processing - Volume 144, March 2018, Pages 341-351
Journal: Signal Processing - Volume 144, March 2018, Pages 341-351
نویسندگان
Xiaolin Huang, Ming Yan,