Access the full text.
Sign up today, get DeepDyve free for 14 days.
Shailender, Shelej Khera, S. Singh, Jyoti (2022)
Estimation of Channel for Millimeter-Wave Hybrid Massive MIMO Systems using Orthogonal Matching Pursuit (OMP)Journal of Physics: Conference Series, 2327
T. Blumensath, M. Davies (2008)
Iterative Hard Thresholding for Compressed SensingArXiv, abs/0805.0510
Adrien Besson, Dimitris Perdios, Y. Wiaux, J. Thiran (2019)
Joint Sparsity With Partially Known Support and Application to Ultrasound ImagingIEEE Signal Processing Letters, 26
Kyriakos Axiotis, M. Sviridenko (2020)
Sparse Convex Optimization via Adaptively Regularized Hard ThresholdingJ. Mach. Learn. Res., 22
J. Suykens, L. Lukas, J. Vandewalle (2000)
Sparse approximation using least squares support vector machines2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353), 2
Yun-Bin Zhao, Z. Luo (2022)
Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithmsScience China Mathematics, 66
Jie Yang, Jun Ma (2014)
A sparsity-based training algorithm for Least Squares SVM2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)
S. Foucart, H. Rauhut (2013)
A Mathematical Introduction to Compressive Sensing
R. Carrillo, Luisa Polanía, K. Barner (2011)
Iterative hard thresholding for compressed sensing with partially known support2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
(2010)
F.Duarte, C.Hegde: Model-based compressive sensing
M. Khajehnejad, Weiyu Xu, A. Avestimehr, B. Hassibi (2009)
Weighted ℓ1 minimization for sparse recovery with prior information2009 IEEE International Symposium on Information Theory
Raghvendra Mall, J. Suykens (2015)
Very Sparse LSSVM Reductions for Large-Scale DataIEEE Transactions on Neural Networks and Learning Systems, 26
Kaiyan Cui, Zhanjie Song, Ningning Han (2020)
Fast Thresholding Algorithms with Feedbacks and Partially Known Support for Compressed SensingAsia Pac. J. Oper. Res., 37
Y. Shao, Chunna Li, Ming-Zeng Liu, Zhen Wang, N. Deng (2018)
Sparse Lq-norm least squares support vector machine with feature selectionPattern Recognit., 78
Namrata Vaswani, Wei Lu (2010)
Modified-CS: Modifying Compressive Sensing for Problems With Partially Known SupportIEEE Transactions on Signal Processing, 58
S. Chen, D. Donoho, M. Saunders (1998)
Atomic Decomposition by Basis PursuitSIAM J. Sci. Comput., 20
Ming Yu, Zhaoran Wang, Varun Gupta, M. Kolar (2018)
Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approachElectronic Journal of Statistics
R. Carrillo, Luisa Polanía, K. Barner (2010)
Iterative algorithms for compressed sensing with partially known support2010 IEEE International Conference on Acoustics, Speech and Signal Processing
Jie Shen, Ping Li (2016)
A Tight Bound of Hard ThresholdingArXiv, abs/1605.01656
R G Baraniuk, V Cevher, M F Duarte, C Hegde (2010)
Model-based compressive sensingIEEE Trans. Inf. Theory, 56
E. Candès, T. Tao (2005)
Decoding by linear programmingIEEE Transactions on Information Theory, 51
Haoyang Liu, R. Barber (2018)
Between hard and soft thresholding: optimal iterative thresholding algorithmsInformation and Inference: A Journal of the IMA
R. Borries, C. Miosso, C. Potes (2007)
Compressed Sensing Using Prior Information2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing
G. Cawley, N. Talbot (2002)
Improved sparse least-squares support vector machinesNeurocomputing, 48
S. Foucart (2010)
A note on guaranteed sparse recovery via ℓ1-minimizationApplied and Computational Harmonic Analysis, 29
Namrata Vaswani, Wei Lu (2009)
Modified-CS: Modifying compressive sensing for problems with partially known support2009 IEEE International Symposium on Information Theory
Xiaobo Zhang, Wenbo Xu, Yupeng Cui, Liyang Lu, Jiaru Lin (2019)
On Recovery of Block Sparse Signals via Block Compressive Sampling Matching PursuitIEEE Access, 7
Xizhao Wang, Hong-Jie Xing, Yan Li, Qiang Hua, Chunru Dong, W. Pedrycz (2015)
A Study on Relationship Between Generalization Abilities and Fuzziness of Base Classifiers in Ensemble LearningIEEE Transactions on Fuzzy Systems, 23
S S Chen, D L Donoho, M A Saunders (2001)
Atomic decomposition by basis pursuitSIAM Rev., 43
Jie Yang, A. Bouzerdoum, S. Phung (2010)
A training algorithm for sparse LS-SVM using Compressive Sampling2010 IEEE International Conference on Acoustics, Speech and Signal Processing
L. Jacques (2009)
A short note on compressed sensing with partially known signal supportSignal Process., 90
Yuangui Li, Chen Lin, Weidong Zhang (2006)
Improved sparse least-squares support vector machine classifiersNeurocomputing, 69
S. Foucart (2011)
Hard Thresholding Pursuit: An Algorithm for Compressive SensingSIAM J. Numer. Anal., 49
T. Blumensath, M. Davies (2010)
Normalized Iterative Hard Thresholding: Guaranteed Stability and PerformanceIEEE Journal of Selected Topics in Signal Processing, 4
T. Blumensath, M. Davies (2008)
Iterative Thresholding for Sparse ApproximationsJournal of Fourier Analysis and Applications, 14
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 δ3s−2k<132≈0.1768\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$${\delta _{3s - 2k}} < {1 \over {\sqrt {32}}} \approx 0.1768$$\end{document} to δ3s−2k<5−14\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$${\delta _{3s - 2k}} < {{\sqrt 5 - 1} \over 4}$$\end{document}, 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.
Applications of Mathematics – Springer Journals
Published: Oct 1, 2023
Keywords: iterative hard thresholding; signal reconstruction; classification problem; least squares support vector machine; 34B16; 34C25; 90C31
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.