{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T04:28:48Z","timestamp":1772166528661,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T00:00:00Z","timestamp":1710460800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T00:00:00Z","timestamp":1710460800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Xue-Qin Jiang","award":["2021ZD0300703"],"award-info":[{"award-number":["2021ZD0300703"]}]},{"name":"the National Natural Science Foundation project","award":["61971146"],"award-info":[{"award-number":["61971146"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURASIP J. Adv. Signal Process."],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In this paper, we consider the graph signals are sparse in the graph Fourier domain and propose an iterative threshold compressed sensing reconstruction (ITCSR) algorithm to reconstruct sparse graph signals in the graph Fourier domain. The proposed ITCSR algorithm derives from the well-known compressed sensing by considering a threshold for sparsity-promoting reconstruction of the underlying graph signals. The proposed ITCSR algorithm enhances the performance of sparse graph signal reconstruction by introducing a threshold function to determine a suitable threshold. Furthermore, we demonstrate that the suitable parameters for the threshold can be automatically determined by leveraging the sparrow search algorithm. Moreover, we analytically prove the convergence property of the proposed ITCSR algorithm. In the experimental, numerical tests with synthetic as well as 3D point cloud data demonstrate the merits of the proposed ITCSR algorithm relative to the baseline algorithms.<\/jats:p>","DOI":"10.1186\/s13634-024-01133-3","type":"journal-article","created":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T06:01:58Z","timestamp":1710482518000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An efficient algorithm with fast convergence rate for sparse graph signal reconstruction"],"prefix":"10.1186","volume":"2024","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-7660-1779","authenticated-orcid":false,"given":"Yuting","family":"Cao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xue-Qin","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shubo","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinxin","family":"Hou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,15]]},"reference":[{"key":"1133_CR1","doi-asserted-by":"publisher","unstructured":"A. Sandryhaila and J.M.F. Moura, Discrete signal processing on graphs: graph fourier transform, in: 2013 International Conference on Acoustics, Speech, and Signal Processing (ICASSP), pp. 6167-6170 (2013) https:\/\/doi.org\/10.1109\/ICASSP.2013.6638850","DOI":"10.1109\/ICASSP.2013.6638850"},{"issue":"3","key":"1133_CR2","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/MSP.2012.2235192","volume":"30","author":"DI Shuman","year":"2013","unstructured":"D.I. Shuman, S.K. Narang, P. Frossard, A. Ortega, P. Vandergheynst, The emerging field of signal processing on graphs: extending high-dimensional data analysis to networks and other irregular domains. IEEE Signal Process. Mag. 30(3), 83\u201398 (2013). https:\/\/doi.org\/10.1109\/MSP.2012.2235192","journal-title":"IEEE Signal Process. Mag."},{"issue":"5","key":"1133_CR3","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1109\/JPROC.2018.2820126","volume":"106","author":"A Ortega","year":"2018","unstructured":"A. Ortega, P. Forssard, J. Kovaevi, J.M.F. Moura, P. Vandergheynst, Graph signal processing: overview challenges, and applications. Proc. IEEE Inst. Electr. Electron Eng. 106(5), 808\u2013828 (2018)","journal-title":"Proc. IEEE Inst. Electr. Electron Eng."},{"key":"1133_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijepes.2022.108030","volume":"141","author":"P Xu","year":"2022","unstructured":"P. Xu, J. Zhang, T. Gao, S. Chen, X. Wang, H. Jiang, W. Gao, Real-time fast charging station recommendation for electric vehicles in coupled power-transportation networks: a graph reinforcement learning method. Int. J Elec. Power. 141, 108030 (2022). https:\/\/doi.org\/10.1016\/j.ijepes.2022.108030","journal-title":"Int. J Elec. Power."},{"issue":"1","key":"1133_CR5","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/LWC.2021.3120276","volume":"11","author":"J Feng","year":"2022","unstructured":"J. Feng, F. Chen, H. Chen, Data reconstruction coverage based on graph signal processing for wireless sensor networks. IEEE Wirel. Commun. Lett. 11(1), 48\u201352 (2022). https:\/\/doi.org\/10.1109\/LWC.2021.3120276","journal-title":"IEEE Wirel. Commun. Lett."},{"key":"1133_CR6","doi-asserted-by":"publisher","unstructured":"C. Dinesh, G. Cheung and I.V. Baji, 3D point cloud super-resolution via graph total variation on surface normals, in: 2019 IEEE International Conference on Image Processing (ICIP), pp. 4390-4394 (2019) https:\/\/doi.org\/10.1109\/ICIP.2019.8803560","DOI":"10.1109\/ICIP.2019.8803560"},{"key":"1133_CR7","doi-asserted-by":"publisher","unstructured":"X. Shang, R. Ye, H. Feng and Xue-Qin. Jiang, Robust feature graph for point cloud denoising, in: 2022 7th International Conference on Communication, Image and Signal Processing (CCISP), pp. 330-336 (2022) https:\/\/doi.org\/10.1109\/CCISP55629.2022.9974370","DOI":"10.1109\/CCISP55629.2022.9974370"},{"key":"1133_CR8","doi-asserted-by":"publisher","unstructured":"Q. Huang, R. Li, Z. Jiang, W. Feng, S.Wei, S. Lin, H.Feng and B.Hu, Fast color-guided depth denoising for RGB-D images by graph filtering, in: 2019 53rd Asilomar Conference on Signals, Systems, and Computers(ACSSC), pp. 1811-1815 (2019)https:\/\/doi.org\/10.1109\/IEEECONF44664.2019.9048703","DOI":"10.1109\/IEEECONF44664.2019.9048703"},{"issue":"24","key":"1133_CR9","doi-asserted-by":"publisher","first-page":"25350","DOI":"10.1109\/JIOT.2022.3196154","volume":"9","author":"PF Cid","year":"2022","unstructured":"P.F. Cid, J.M.B. Ordinas, J.G. Vidal, Graph signal reconstruction techniques for IoT air pollution monitoring platforms. IEEE Internet Things J. 9(24), 25350\u201325362 (2022). https:\/\/doi.org\/10.1109\/JIOT.2022.3196154","journal-title":"IEEE Internet Things J."},{"issue":"10","key":"1133_CR10","doi-asserted-by":"publisher","first-page":"0165","DOI":"10.1016\/j.sigpro.2022.108505","volume":"195","author":"A Hashemi","year":"2022","unstructured":"A. Hashemi, R. Shafipour, H. Vikalo, G. Mateos, Towards accelerated greedy sampling and reconstruction of bandlimited graph signals. Signal Process. 195(10), 0165\u20131684 (2022). https:\/\/doi.org\/10.1016\/j.sigpro.2022.108505","journal-title":"Signal Process."},{"issue":"17","key":"1133_CR11","doi-asserted-by":"publisher","first-page":"4609","DOI":"10.1109\/TSP.2015.2441042","volume":"63","author":"S Chen","year":"2015","unstructured":"S. Chen, A. Sandryhaila, J.M.F. Moura, J. Kovaevi, Signal recovery on graphs: variation minimization. IEEE Trans. Signal Process. 63(17), 4609\u20134624 (2015). https:\/\/doi.org\/10.1109\/TSP.2015.2441042","journal-title":"IEEE Trans. Signal Process."},{"issue":"13","key":"1133_CR12","doi-asserted-by":"publisher","first-page":"3462","DOI":"10.1109\/TSP.2017.2690388","volume":"65","author":"N Perraudin","year":"2017","unstructured":"N. Perraudin, P. Vandergheynst, Stationary signal processing on graphs. IEEE Trans. Signal Process. 65(13), 3462\u20133477 (2017). https:\/\/doi.org\/10.1109\/TSP.2017.2690388","journal-title":"IEEE Trans. Signal Process."},{"key":"1133_CR13","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/GlobalSIP.2013.6736922","volume":"2013","author":"SK Narang","year":"2013","unstructured":"S.K. Narang, A. Gadde, E. Sanou, A. Ortega, Localized iterative methods for interpolation in graph structured data. IEEE Glob. Conf. Signal Imform. Process. (GlobaISIP) 2013, 491\u2013494 (2013). https:\/\/doi.org\/10.1109\/GlobalSIP.2013.6736922","journal-title":"IEEE Glob. Conf. Signal Imform. Process. (GlobaISIP)"},{"key":"1133_CR14","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1109\/GlobalSIP.2014.7032157","volume":"2014","author":"X Wang","year":"2014","unstructured":"X. Wang, P. Liu, Y. Gu, Iterative reconstruction of graph signal in low-frequency subspace. IEEE Glob. Conf. Signal Inform. Process. (GlobalSIP) 2014, 448\u2013452 (2014). https:\/\/doi.org\/10.1109\/GlobalSIP.2014.7032157","journal-title":"IEEE Glob. Conf. Signal Inform. Process. (GlobalSIP)"},{"key":"1133_CR15","doi-asserted-by":"publisher","first-page":"2419","DOI":"10.1109\/TSP.2020.2981202","volume":"68","author":"Y Bai","year":"2020","unstructured":"Y. Bai, F. Wang, G. Cheung, Y. Nakatsukasa, W. Gao, Fast graph sampling set selection using Gershgorin disc alignment. IEEE Trans. Signal Process. 68, 2419\u20132434 (2020). https:\/\/doi.org\/10.1109\/TSP.2020.2981202","journal-title":"IEEE Trans. Signal Process."},{"issue":"4","key":"1133_CR16","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"D.L. Donoho, Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1133_CR17","doi-asserted-by":"publisher","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","volume":"53","author":"JA Tropp","year":"2007","unstructured":"J.A. Tropp, A.C. Gilbert, Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans. Inf. Theory 53(12), 4655\u20134666 (2007). https:\/\/doi.org\/10.1109\/TIT.2007.909108","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1133_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","volume":"27","author":"T Blumensath","year":"2009","unstructured":"T. Blumensath, M. Davies, Iterative hard thresholding for compressed sensing. Appl. Comput. Harmon. Anal. 27(3), 265\u2013274 (2009). https:\/\/doi.org\/10.1016\/j.acha.2009.04.002","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"1133_CR19","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1109\/SAMPTA.2017.8024339","volume":"2017","author":"MB Mashhadi","year":"2017","unstructured":"M.B. Mashhadi, M. Fallah, F. Marvasti, Interpolation of sparse graph signals by sequential adaptive thresholds, in. Int. Conf. Sampl. Theory Appl. (SampTA) 2017, 266\u2013270 (2017). https:\/\/doi.org\/10.1109\/SAMPTA.2017.8024339","journal-title":"Int. Conf. Sampl. Theory Appl. (SampTA)"},{"key":"1133_CR20","doi-asserted-by":"publisher","unstructured":"M. Brajovi\u0107, I. Stankovi\u0107, M. Dakovi\u0107 and L. Stankovi\u0107, Reconstruction of sparse graph signals from reduced sets of samples, in 2023 27th International Conference on Information Technology (ICIT), pp. 1-5 (2023) https:\/\/doi.org\/10.1109\/IT57431.2023.10078603","DOI":"10.1109\/IT57431.2023.10078603"},{"key":"1133_CR21","doi-asserted-by":"publisher","unstructured":"C.C. Tseng and L. Su-Ling, A missing data recovery method of sparse graph signal in GFT domain, in: 2018 IEEE International Conference on Consumer Electronics-Taiwan (ICCE-TW), pp. 1-2, https:\/\/doi.org\/10.1109\/ICCE-China.2018.8448787 (2018)","DOI":"10.1109\/ICCE-China.2018.8448787"},{"issue":"3","key":"1133_CR22","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","volume":"26","author":"D Needell","year":"2009","unstructured":"D. Needell, J.A. Tropp, CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmon. Anal. 26(3), 301\u2013321 (2009). https:\/\/doi.org\/10.1016\/j.acha.2008.07.002","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"1133_CR23","doi-asserted-by":"publisher","unstructured":"E. Candes and T. Tao, Decoding by linear programming, IEEE Trans. Inf. Theory, (2005), https:\/\/doi.org\/10.48550\/arXiv.math\/0502327","DOI":"10.48550\/arXiv.math\/0502327"},{"key":"1133_CR24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016006","author":"W Dai","year":"2009","unstructured":"W. Dai, O. Milenkovic, Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans. Inf. Theory (2009). https:\/\/doi.org\/10.1109\/TIT.2009.2016006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1133_CR25","doi-asserted-by":"publisher","unstructured":"J. Wang, S. Kwon, and B. Shim, Generalized orthogonal matching pursuit, IEEE Trans. Signal Process., 60(12), pp. 6202\u20136216 (2012)https:\/\/doi.org\/10.1109\/TSP.2012.2218810","DOI":"10.1109\/TSP.2012.2218810"},{"issue":"1","key":"1133_CR26","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1080\/21642583.2019.1708830","volume":"8","author":"J Xue","year":"2020","unstructured":"J. Xue, B. Shen, A novel swarm intelligence optimization approach: sparrow search algorithm. Syst. Sci. Control. Eng. 8(1), 22\u201334 (2020). https:\/\/doi.org\/10.1080\/21642583.2019.1708830","journal-title":"Syst. Sci. Control. Eng."},{"issue":"12","key":"1133_CR27","doi-asserted-by":"publisher","first-page":"5406","DOI":"10.1109\/TIT.2006.885507","volume":"52","author":"E Candes","year":"2007","unstructured":"E. Candes, T. Tao, Near-optimal signal recovery from random projections: universal encoding strategies? IEEE Trans. Inf. Theory 52(12), 5406\u20135425 (2007). https:\/\/doi.org\/10.1109\/TIT.2006.885507","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"1133_CR28","doi-asserted-by":"publisher","first-page":"2455","DOI":"10.1016\/j.laa.2012.05.036","volume":"437","author":"S Datta","year":"2012","unstructured":"S. Datta, S. Howard, D. Cochran, Geometry of the Welch bounds. Linear Algebra Appl. 437(10), 2455\u20132470 (2012). https:\/\/doi.org\/10.1016\/j.laa.2012.05.036","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"1133_CR29","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.laa.2009.01.030","volume":"431","author":"N Beresford","year":"2009","unstructured":"N. Beresford, A result complementary to Gersgorin? s circle theorem. Linear Algebra Appl. 431(1), 20\u201327 (2009). https:\/\/doi.org\/10.1016\/j.laa.2009.01.030","journal-title":"Linear Algebra Appl."},{"key":"1133_CR30","doi-asserted-by":"publisher","unstructured":"B. Girault, A. Ortega and S. S. Narayayan, Graph vertex sampling with arbitrary graph signal hilbert spaces, in: 2020 International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 5670-5674 (2020) https:\/\/doi.org\/10.1109\/ICASSP40776.2020.9054723","DOI":"10.1109\/ICASSP40776.2020.9054723"},{"key":"1133_CR31","doi-asserted-by":"publisher","unstructured":"D. E. Olivier Tzamarias, P. Akyazi and P. Frossard, A novel method for sampling bandlimited graph signals, in 2018 26th European Signal Processing Conference (EUSIPCO), pp. 126-130 (2018) https:\/\/doi.org\/10.23919\/EUSIPCO.2018.8553064","DOI":"10.23919\/EUSIPCO.2018.8553064"},{"key":"1133_CR32","doi-asserted-by":"publisher","unstructured":"H. Shomorony and A. S. Avestimehr, Sampling large data on graphs, in: IEEE Global Conference on Signal and Information Processing (GlobalSIP), pp. 933-936 (2014) https:\/\/doi.org\/10.1109\/GlobalSIP.2014.7032257","DOI":"10.1109\/GlobalSIP.2014.7032257"},{"issue":"12","key":"1133_CR33","first-page":"2197","volume":"100","author":"D Donoho","year":"2002","unstructured":"D. Donoho, M. Elad, Maximal sparsity representation via l-1 minimization. Comput. Sci. 100(12), 2197\u20132202 (2002). https:\/\/api.semanticscholar.org\/CorpusID:17259152","journal-title":"Comput. Sci."},{"issue":"10","key":"1133_CR34","doi-asserted-by":"publisher","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","volume":"50","author":"J Tropp","year":"2004","unstructured":"J. Tropp, Greed is good: algorithmic results for sparse approximation. IEEE Trans. Inf. Theory 50(10), 2231\u20132242 (2004). https:\/\/doi.org\/10.1109\/TIT.2004.834793","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1133_CR35","doi-asserted-by":"publisher","unstructured":"B. Girault, A. Ortega, and S.S. Narayayan, Graph vertex sampling with arbitrary graph signal hilbert spaces, in: 2014 International Conference on Acoustics, Speech, and Signal Processing (ICASSP), pp. 5670-5674, https:\/\/doi.org\/10.48550\/arXiv.2002.11238 (2014)","DOI":"10.48550\/arXiv.2002.11238"},{"key":"1133_CR36","doi-asserted-by":"publisher","unstructured":"H. Shomorony and A. S. Avestimehr, Sampling large data on graphs, in: 2014 IEEE Global Conference on Signal and Imformation Processing (GlobaISIP), pp. 933-936 (2014) https:\/\/doi.org\/10.48550\/arXiv.1411.3017","DOI":"10.48550\/arXiv.1411.3017"},{"key":"1133_CR37","doi-asserted-by":"publisher","unstructured":"X. Xu, J. Chen, N. Wan, D. Chen and J. Wan, Sparsity estimation method in compressed data gathering of wireless sensor networks, in: 2019 IEEE 8th Joint International Information Technology and Artificial Intelligence Conference (ITAIC), pp. 833-836 (2019) https:\/\/doi.org\/10.1109\/ITAIC.2019.8785897","DOI":"10.1109\/ITAIC.2019.8785897"},{"key":"1133_CR38","doi-asserted-by":"publisher","unstructured":"Qin, S., Yin, J, A Robust sparsity estimation method in compressed sensing, in: China Conference on Wireless Sensor Networks (CWSN), pp. 481-488 (2014) https:\/\/doi.org\/10.1007\/978-3-662-46981-1-46","DOI":"10.1007\/978-3-662-46981-1-46"},{"key":"1133_CR39","unstructured":"3D Point Datasets, http:\/\/graphics.stanford.edu\/data\/3Dscanrep\/ (2014)"}],"container-title":["EURASIP Journal on Advances in Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-024-01133-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13634-024-01133-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-024-01133-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T06:10:12Z","timestamp":1710483012000},"score":1,"resource":{"primary":{"URL":"https:\/\/asp-eurasipjournals.springeropen.com\/articles\/10.1186\/s13634-024-01133-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,15]]},"references-count":39,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["1133"],"URL":"https:\/\/doi.org\/10.1186\/s13634-024-01133-3","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3451820\/v1","asserted-by":"object"}]},"ISSN":["1687-6180"],"issn-type":[{"value":"1687-6180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,15]]},"assertion":[{"value":"20 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors have no competing interests to declare.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"38"}}