{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T13:35:29Z","timestamp":1758893729352,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T00:00:00Z","timestamp":1566777600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T00:00:00Z","timestamp":1566777600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61801214"],"award-info":[{"award-number":["61801214"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SIViP"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s11760-019-01555-9","type":"journal-article","created":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T04:02:43Z","timestamp":1566792163000},"page":"277-284","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A fast global matching pursuit algorithm for sparse reconstruction by $$l_{0}$$ minimization"],"prefix":"10.1007","volume":"14","author":[{"given":"Dan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaojun","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,26]]},"reference":[{"issue":"4","key":"1555_CR1","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1555_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/MSP.2007.914731","volume":"25","author":"EJ Cand\u2019e","year":"2008","unstructured":"Cand\u2019e, E.J., Wakin, M.B.: An introduction to compressive sampling. IEEE Signal Process. Mag. 25(2), 21\u201330 (2008)","journal-title":"IEEE Signal Process. Mag."},{"issue":"2","key":"1555_CR3","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"EJ Cand\u2019es","year":"2006","unstructured":"Cand\u2019es, E.J., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52(2), 489\u2013509 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1555_CR4","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/j.ymssp.2017.12.022","volume":"105","author":"X Tang","year":"2008","unstructured":"Tang, X., Chen, Z., Li, Y.: Compressive sensing-based electrostatic sensor array signal processing and exhausted abnormal debris detecting. Mech. Syst. Signal Process. 105, 404\u2013426 (2008)","journal-title":"Mech. Syst. Signal Process."},{"issue":"4","key":"1555_CR5","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1109\/TMI.2008.2007825","volume":"28","author":"J Provost","year":"2009","unstructured":"Provost, J., Lesage, F.: The application of compressed sensing for photo-acoustic tomography. IEEE Trans. Med. Imaging 28(4), 585\u2013594 (2009)","journal-title":"IEEE Trans. Med. Imaging"},{"issue":"4","key":"1555_CR6","doi-asserted-by":"publisher","first-page":"2162","DOI":"10.1109\/TWC.2018.2789349","volume":"17","author":"B Khalfi","year":"2018","unstructured":"Khalfi, B., Hamdaoui, B., Guizani, M.: Efficient spectrum availability information recovery for wideband DSA networks: a weighted compressive sampling approach. IEEE Trans. Wirel. Commun. 17(4), 2162\u20132172 (2018)","journal-title":"IEEE Trans. Wirel. Commun."},{"issue":"3","key":"1555_CR7","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1049\/iet-spr.2016.0597","volume":"12","author":"E Tohidi","year":"2018","unstructured":"Tohidi, E., Radmard, M., Majd, M.N.: Compressive sensing MTI processing in distributed MIMO radars. IET Signal Process. 12(3), 327\u2013334 (2018)","journal-title":"IET Signal Process."},{"issue":"3","key":"1555_CR8","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.sigpro.2005.05.027","volume":"86","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L., Elad, M.: On the stability of the basis pursuit in the presence of noise. Signal Process. 86(3), 511\u2013532 (2006)","journal-title":"Signal Process."},{"issue":"1","key":"1555_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"SS Chen","year":"1998","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20(1), 33\u201361 (1998)","journal-title":"SIAM J. Sci. Comput."},{"issue":"12","key":"1555_CR10","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Candes","year":"2005","unstructured":"Candes, E.J., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theory 51(12), 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1555_CR11","doi-asserted-by":"publisher","first-page":"1648","DOI":"10.1364\/BOE.6.001648","volume":"6","author":"H Guo","year":"2015","unstructured":"Guo, H., Yu, J.: Improved sparse reconstruction for fluorescence molecular tomography with $$l_{1\/2}$$ regularization. Biomed. Opt. Express 6(5), 1648\u20131664 (2015)","journal-title":"Biomed. Opt. Express"},{"issue":"4","key":"1555_CR12","doi-asserted-by":"publisher","first-page":"1559","DOI":"10.1016\/j.patcog.2013.10.017","volume":"47","author":"W Ou","year":"2014","unstructured":"Ou, W., You, X.: Robust face recognition via occlusion dictionary learning. Pattern Recognit. 47(4), 1559\u20131572 (2014)","journal-title":"Pattern Recognit."},{"issue":"1","key":"1555_CR13","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.acha.2017.04.004","volume":"46","author":"JF Cai","year":"2019","unstructured":"Cai, J.F., Wang, T.M.: Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion. Appl. Comput. Harmonic Anal. 46(1), 94\u2013121 (2019)","journal-title":"Appl. Comput. Harmonic Anal."},{"issue":"12","key":"1555_CR14","doi-asserted-by":"publisher","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","volume":"53","author":"J Tropp","year":"2007","unstructured":"Tropp, J., Gilbert, A.C., et al.: Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans. Inf. Theory 53(12), 4655\u20134666 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"1555_CR15","doi-asserted-by":"publisher","first-page":"4680","DOI":"10.1109\/TIT.2011.2146090","volume":"57","author":"TT Cai","year":"2011","unstructured":"Cai, T.T., Wang, L.: Orthogonal matching pursuit for sparse signal recovery with noise. IEEE Trans. Inf. Theory 57(7), 4680\u20134688 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1555_CR16","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","volume":"26","author":"D Needell","year":"2009","unstructured":"Needell, D., Tropp, J.A.: CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmonic Anal. 26(3), 301\u2013321 (2009)","journal-title":"Appl. Comput. Harmonic Anal."},{"key":"1555_CR17","doi-asserted-by":"crossref","unstructured":"Do, T.T., Gan, L., Nguyen, N., Tran, T.D.: Sparsity adaptive matching pursuit algorithm for practical compressed sensing. In: 2008 42nd Asilomar Conference on Signals, Systems and Computers IEEE, pp. 581\u2013587 (2008)","DOI":"10.1109\/ACSSC.2008.5074472"},{"issue":"2","key":"1555_CR18","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1109\/TIT.2011.2173241","volume":"58","author":"DL Donoho","year":"2012","unstructured":"Donoho, D.L., Tsaig, Y., Drori, I., Starck, J.-L.: Sparse solution of under-determined systems of linear equations by stagewise orthogonal matching pursuit. IEEE Trans. Inf. Theory 58(2), 1094\u20131121 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1555_CR19","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/11679363_26","volume-title":"Independent Component Analysis and Blind Signal Separation","author":"MD Plumbley","year":"2006","unstructured":"Plumbley, M.D.: Recovery of sparse representations by polytope faces pursuit. In: Puntonet, C.G., Prieto, A. (eds.) Independent Component Analysis and Blind Signal Separation, pp. 206\u2013213. Springer, Berlin (2006)"},{"issue":"1","key":"1555_CR20","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1137\/070703983","volume":"1","author":"W Yin","year":"2008","unstructured":"Yin, W., Osher, S., Goldfarb, D., Darbon, J.: Bregman iterative algorithms for l1 minimization with applications to compressed sensing. SIAM J. Imaging Sci. 1(1), 143\u2013168 (2008)","journal-title":"SIAM J. Imaging Sci."},{"issue":"5","key":"1555_CR21","doi-asserted-by":"publisher","first-page":"2230","DOI":"10.1109\/TIT.2009.2016006","volume":"55","author":"W Dai","year":"2009","unstructured":"Dai, W., Milenkovic, O.: Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans. Inf. Theory 55(5), 2230\u20132249 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"1555_CR22","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1109\/LSP.2011.2147313","volume":"18","author":"H Huang","year":"2011","unstructured":"Huang, H., Makur, A.: Backtracking-based matching pursuit method for sparse signal reconstruction. IEEE Signal Process. Lett. 18(7), 391\u2013394 (2011)","journal-title":"IEEE Signal Process. Lett."},{"key":"1555_CR23","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.neucom.2014.06.006","volume":"143","author":"M Tuba","year":"2014","unstructured":"Tuba, M., Bacanin, N.: Improved seeker optimization algorithm hybridized with firefly algorithm for constrained optimization problems. Neurocomputing 143, 197\u2013207 (2014)","journal-title":"Neurocomputing"},{"issue":"2","key":"1555_CR24","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1287\/moor.13.2.311","volume":"13","author":"B Hajek","year":"1988","unstructured":"Hajek, B.: Cooling schedules for optimal annealing. Math. Oper. Res. 13(2), 311\u2013329 (1988)","journal-title":"Math. Oper. Res."},{"key":"1555_CR25","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.ins.2013.04.001","volume":"241","author":"C-H Lin","year":"2013","unstructured":"Lin, C.-H.: A rough penalty genetic algorithm for constrained optimization. Inf. Sci. 241, 119\u2013137 (2013)","journal-title":"Inf. Sci."},{"key":"1555_CR26","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.sigpro.2015.11.019","volume":"122","author":"D Li","year":"2016","unstructured":"Li, D., Qiang, W.: Intelligent greedy pursuit model for sparse reconstruction based on l0 minimization. Signal Process. 122, 138\u2013151 (2016)","journal-title":"Signal Process."},{"key":"1555_CR27","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.neucom.2014.04.055","volume":"144","author":"M Jing","year":"2014","unstructured":"Jing, M., Zhou, X., Qi, C.: Quasi-Newton iterative projection algorithm for sparse recovery. Neurocomputing 144, 169\u2013173 (2014)","journal-title":"Neurocomputing"},{"issue":"3","key":"1555_CR28","doi-asserted-by":"publisher","first-page":"276","DOI":"10.3724\/SP.J.1004.2011.00276","volume":"37","author":"H Yang","year":"2011","unstructured":"Yang, H., Fang, H.: Iterative hard thresholding algorithm based on backtracking. Acta Autom. Sin. 37(3), 276\u2013282 (2011)","journal-title":"Acta Autom. Sin."},{"key":"1555_CR29","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.sigpro.2018.06.023","volume":"153","author":"R Qi","year":"2018","unstructured":"Qi, R., Yang, D.: On recovery of block sparse signals via block generalized orthogonal matching pursuit. Signal Process. 153, 34\u201346 (2018)","journal-title":"Signal Process."},{"key":"1555_CR30","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.neucom.2017.05.022","volume":"275","author":"Q Wang","year":"2018","unstructured":"Wang, Q., Qu, G.: A new greedy algorithm for sparse recovery. Neurocomputing 275, 137\u2013143 (2018)","journal-title":"Neurocomputing"},{"key":"1555_CR31","unstructured":"Needell, D.: Topics in compressed sensing. arXiv preprint \narXiv:0905.4482"}],"container-title":["Signal, Image and Video Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11760-019-01555-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11760-019-01555-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11760-019-01555-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T23:23:55Z","timestamp":1598311435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11760-019-01555-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,26]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["1555"],"URL":"https:\/\/doi.org\/10.1007\/s11760-019-01555-9","relation":{},"ISSN":["1863-1703","1863-1711"],"issn-type":[{"type":"print","value":"1863-1703"},{"type":"electronic","value":"1863-1711"}],"subject":[],"published":{"date-parts":[[2019,8,26]]},"assertion":[{"value":"1 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}