返回
Approximate Message Passing Algorithm for Nonconvex Regularization
DOI:10.1109/ACCESS.2019.2891121.png)
摘要
En 中文
In this paper, we study the sparse signal reconstruction with nonconvex regularization, mainly focusing on two popular nonconvex regularization methods, minimax concave penalty (MCP) and smoothly clipped absolute deviation (SCAD). An approximate message passing (AMP) algorithm is an effective method for signal reconstruction. Based on the AMP algorithm, we propose an improved MCP iterative thresholding algorithm and an improved SCAD iterative thresholding algorithm. Furthermore, we analyze the convergence of the new algorithms and provide a series of experiments to assess the performance of the new algorithms. The experiments show that the new algorithms based on AMP have stronger reconstruction capabilities, higher phase transition for sparse signal reconstruction, and better variable selection ability than the original MCP iterative thresholding algorithm and the original SCAD iterative thresholding algorithm.
Keyword:
Approximate message passing algorithm
iterative thresholding algorithm
nonconvex regularization
sparsity
variable selection
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
暂无机构信息
引用论文
Normative pediatric visual acuity using single surrounded HOTV optotypes on the Electronic Visual Acuity Tester following the Amblyopia Treatment Study protocol根据弱视治疗研究方案,在电子视力测试仪上使用单个包围的HOTV视标的儿童视力

