Back to Search
Start Over
A tight bound of modified iterative hard thresholding algorithm for compressed sensing.
- Source :
-
Applications of Mathematics . Oct2023, Vol. 68 Issue 5, p623-642. 20p. - Publication Year :
- 2023
-
Abstract
- We provide a theoretical study of the iterative hard thresholding with partially known support set (IHT-PKS) algorithm when used to solve the compressed sensing recovery problem. Recent work has shown that IHT-PKS performs better than the traditional IHT in reconstructing sparse or compressible signals. However, less work has been done on analyzing the performance guarantees of IHT-PKS. In this paper, we improve the current RIP-based bound of IHT-PKS algorithm from δ 3 s − 2 k < 1 32 ≈ 0.1768 to δ 3 s − 2 k < 5 − 1 4 , where δ3s−2k is the restricted isometric constant of the measurement matrix. We also present the conditions for stable reconstruction using the IHTμ-PKS algorithm which is a general form of IHT-PKS. We further apply the algorithm on Least Squares Support Vector Machines (LS-SVM), which is one of the most popular tools for regression and classification learning but confronts the loss of sparsity problem. After the sparse representation of LS-SVM is presented by compressed sensing, we exploit the support of bias term in the LS-SVM model with the IHTμ-PKS algorithm. Experimental results on classification problems show that IHTμ-PKS outperforms other approaches to computing the sparse LS-SVM classifier. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 08627940
- Volume :
- 68
- Issue :
- 5
- Database :
- Academic Search Index
- Journal :
- Applications of Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 172311647
- Full Text :
- https://doi.org/10.21136/AM.2023.0221-22