Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.3390/a12020036 | ALGORITHMS |
Keywords | Field | DocType |
compressed sensing,sparse recovery,conjugate gradient,iterative algorithms | Conjugate gradient method,Convergence (routing),Mathematical optimization,Iterative and incremental development,Algorithm,Greedy algorithm,Line search,Rate of convergence,Thresholding,Mathematics,Compressed sensing | Journal |
Volume | Issue | ISSN |
12 | 2 | 1999-4893 |
Citations | PageRank | References |
1 | 0.37 | 16 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yanfeng Zhang | 1 | 3 | 2.47 |
| Yunbao Huang | 2 | 1 | 0.71 |
| Haiyan Li | 3 | 8 | 6.32 |
| Pu Li | 4 | 96 | 15.13 |
| Xi'an Fan | 5 | 1 | 0.37 |