Conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery (Q2632508): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q708226 |
Changed an Item |
||
Property / author | |||
Property / author: Yun Bao Huang / rank | |||
Normal rank |
Revision as of 16:48, 20 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery |
scientific article |
Statements
Conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery (English)
0 references
14 May 2019
0 references
Summary: We propose a new iterative greedy algorithm to reconstruct sparse signals in Compressed Sensing. The algorithm, called Conjugate Gradient Hard Thresholding Pursuit (CGHTP), is a simple combination of Hard Thresholding Pursuit (HTP) and Conjugate Gradient Iterative Hard Thresholding (CGIHT). The conjugate gradient method with a fast asymptotic convergence rate is integrated into the HTP scheme that only uses simple line search, which accelerates the convergence of the iterative process. Moreover, an adaptive step size selection strategy, which constantly shrinks the step size until a convergence criterion is met, ensures that the algorithm has a stable and fast convergence rate without choosing step size. Finally, experiments on both Gaussian-signal and real-world images demonstrate the advantages of the proposed algorithm in convergence rate and reconstruction performance.
0 references
compressed sensing
0 references
sparse recovery
0 references
conjugate gradient
0 references
iterative algorithms
0 references