Conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
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.
- A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
- Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique
- Hard thresholding pursuit: an algorithm for compressive sensing
- The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing
- Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Accelerating Overrelaxed and Monotone Fast Iterative Shrinkage-Thresholding Algorithms With Line Search for Sparse Reconstructions
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- Compressed sensing
- Conjugate Gradient Iterative Hard Thresholding: Observed Noise Stability for Compressed Sensing
- Decoding by Linear Programming
- Hard thresholding pursuit algorithms: number of iterations
- Hard thresholding pursuit with continuation for \(\ell^{0}\)-regularized minimizations
- Hard thresholding pursuit: an algorithm for compressive sensing
- scientific article; zbMATH DE number 6765495 (Why is no real title available?)
- Iterative thresholding algorithm based on non-convex method for modified l_p-norm regularization minimization
- On the Gap Between Restricted Isometry Properties and Sparse Recovery Conditions
- On the number of iterations for convergence of CoSaMP and subspace pursuit algorithms
- Orthogonal matching pursuit under the restricted isometry property
- Reconstruction of sparse signals in impulsive disturbance environments
- Recovery of Sparse Signals via Generalized Orthogonal Matching Pursuit: A New Analysis
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Some convergence properties of the conjugate gradient method
- Sparse Signal Recovery Using Iterative Proximal Projection
- Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique
- The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing
- scientific article; zbMATH DE number 6982922 (Why is no real title available?)
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- Adaptive reweighting via GPSR algorithm for compressed sensing signal reconstruction
- Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing
- Non-negative sparse recovery via momentum-boosted adaptive thresholding algorithm
- On the conjugate gradient subspace pursuit algorithm
- A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
This page was built for publication: Conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2632508)
