A self-adaptive proximal point algorithm for signal reconstruction in compressive sensing
Kaizhan Huai, Yejun Li, Mingfang Ni, Zhanke Yu, Xiaoguo Wang
Abstract
Kaizhan Huai, Yejun Li, Mingfang Ni, Zhanke Yu, Xiaoguo Wang
Abstract
Compressive sensing (CS) is a new framework for simulations sensing and compressive. How to reconstruct a sparse signal from limited measurements is the key problem in CS. For solving the reconstruction problem of a sparse signal, we proposed a self-adaptive proximal point algorithm (PPA). This algorithm can handle the sparse signal reconstruction by solving a substituted problem — ℓ1problem. At last, the numerical results shows that the proposed method is more effective compared with the compressive sampling matching pursuit (CoSaMP).
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Compressive sensing (CS) is a new framework for simulations sensing and compressive. How to reconstruct a sparse signal from limited measurements is the key problem in CS. For solving the reconstruction problem of a sparse signal, we proposed a self-adaptive proximal point algorithm (PPA). This algorithm can handle the sparse signal reconstruction by solving a substituted problem — ℓ1problem. At last, the numerical results shows that the proposed method is more effective compared with the compressive sampling matching pursuit (CoSaMP).
Key concepts: Compressed sensing, Matching pursuit, Signal reconstruction, SIGNAL (programming language), Point (geometry), Algorithm, Computer science, Signal recovery