Approximate Message Passing Algorithm for Nonconvex Regularization
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...
Saved in:
| Published in: | IEEE access Vol. 7; pp. 9080 - 9090 |
|---|---|
| Main Authors: | , , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Piscataway
IEEE
2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 2169-3536, 2169-3536 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 2169-3536 2169-3536 |
| DOI: | 10.1109/ACCESS.2019.2891121 |