{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T16:14:04Z","timestamp":1764432844650,"version":"3.40.2"},"reference-count":34,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Digital Signal Processing"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1016\/j.dsp.2012.03.003","type":"journal-article","created":{"date-parts":[[2012,3,16]],"date-time":"2012-03-16T16:13:12Z","timestamp":1331914392000},"page":"555-568","source":"Crossref","is-referenced-by-count":62,"title":["A* orthogonal matching pursuit: Best-first search for compressed sensing signal recovery"],"prefix":"10.1016","volume":"22","author":[{"given":"Nazim Burak","family":"Karahanoglu","sequence":"first","affiliation":[]},{"given":"Hakan","family":"Erdogan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dsp.2012.03.003_br0010","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","article-title":"Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information","volume":"52","author":"Cand\u00e8s","year":"2006","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.dsp.2012.03.003_br0020","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","article-title":"Compressed sensing","volume":"52","author":"Donoho","year":"2006","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.dsp.2012.03.003_br0030","doi-asserted-by":"crossref","first-page":"5406","DOI":"10.1109\/TIT.2006.885507","article-title":"Near-optimal signal recovery from random projections: Universal encoding strategies?","volume":"52","author":"Cand\u00e8s","year":"2006","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.dsp.2012.03.003_br0040","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1064827596304010","article-title":"Atomic decomposition by basis pursuit","volume":"20","author":"Chen","year":"1998","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/j.dsp.2012.03.003_br0050","doi-asserted-by":"crossref","unstructured":"Y.C. Pati, R. Rezaiifar, P.S. Krishnaprasad, Orthogonal matching pursuit: Recursive bifunction approximation with applications to wavelet decomposition, in: Proc. 27th Asilomar Conference on Signals, Systems and Computers, vol. 1, Los Alamitos, CA, 1993, pp. 40\u201344.","DOI":"10.1109\/ACSSC.1993.342465"},{"key":"10.1016\/j.dsp.2012.03.003_br0060","doi-asserted-by":"crossref","first-page":"2230","DOI":"10.1109\/TIT.2009.2016006","article-title":"Subspace pursuit for compressive sensing signal reconstruction","volume":"55","author":"Dai","year":"2009","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.dsp.2012.03.003_br0070","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s00041-008-9035-z","article-title":"Iterative thresholding for sparse approximations","volume":"14","author":"Blumensath","year":"2008","journal-title":"J. Fourier Anal. Appl."},{"key":"10.1016\/j.dsp.2012.03.003_br0080","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","article-title":"Iterative hard thresholding for compressed sensing","volume":"27","author":"Blumensath","year":"2009","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"10.1016\/j.dsp.2012.03.003_br0090","first-page":"99","article-title":"Incremental heuristic search in AI","volume":"25","author":"Koenig","year":"2004","journal-title":"AI Mag."},{"key":"10.1016\/j.dsp.2012.03.003_br0100","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/3828.3830","article-title":"Generalized best-first search strategies and the optimality of A*","volume":"32","author":"Dechter","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/j.dsp.2012.03.003_br0110","unstructured":"F. Jelinek, Statistical Methods for Speech Recognition, MIT Press, Cambridge, MA, USA."},{"key":"10.1016\/j.dsp.2012.03.003_br0120","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"10.1016\/j.dsp.2012.03.003_br0130","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/1056777.1056779","article-title":"Correction to a formal basis for the heuristic determination of minimum cost paths","author":"Hart","year":"1972","journal-title":"SIGART Newslett."},{"key":"10.1016\/j.dsp.2012.03.003_br0140","doi-asserted-by":"crossref","unstructured":"N.B. Karahanoglu, H. Erdogan, Compressed sensing signal recovery via A* orthogonal matching pursuit, in: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2011, pp. 3732\u20133735.","DOI":"10.1109\/ICASSP.2011.5947162"},{"key":"10.1016\/j.dsp.2012.03.003_br0150","doi-asserted-by":"crossref","unstructured":"S. Cotter, B. Rao, Application of tree-based searches to matching pursuit, in: IEEE International Conference on Acoustics, Speech, and Signal Processing, Proceedings (ICASSP \u02bc01), 2001, pp. 3933\u20133936.","DOI":"10.1109\/ICASSP.2001.940704"},{"key":"10.1016\/j.dsp.2012.03.003_br0160","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1049\/ip-vis:20050201","article-title":"Integrating flexible tree searches to orthogonal matching pursuit algorithm","volume":"153","author":"Karabulut","year":"2006","journal-title":"IEE Proc. Vis. Image Signal Process."},{"key":"10.1016\/j.dsp.2012.03.003_br0170","doi-asserted-by":"crossref","unstructured":"P. Schniter, L. Potter, J. Ziniel, Fast bayesian matching pursuit, in: Information Theory and Applications Workshop, 2008, pp. 326\u2013333.","DOI":"10.1109\/ITA.2008.4601068"},{"key":"10.1016\/j.dsp.2012.03.003_br0180","doi-asserted-by":"crossref","first-page":"4701","DOI":"10.1109\/TIT.2009.2027565","article-title":"A plurality of sparse representations is better than the sparsest one alone","volume":"55","author":"Elad","year":"2009","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.dsp.2012.03.003_br0190","doi-asserted-by":"crossref","unstructured":"H. Pham, W. Dai, O. Milenkovic, Sublinear compressive sensing reconstruction via belief propagation decoding, in: IEEE International Symposium on Information Theory, ISIT 2009, 2009, pp. 674\u2013678.","DOI":"10.1109\/ISIT.2009.5205667"},{"key":"10.1016\/j.dsp.2012.03.003_br0200","doi-asserted-by":"crossref","unstructured":"C. La, M. Do, Tree-based orthogonal matching pursuit algorithm for signal reconstruction, in: IEEE International Conference on Image Processing, 2006, pp. 1277\u20131280.","DOI":"10.1109\/ICIP.2006.312578"},{"key":"10.1016\/j.dsp.2012.03.003_br0210","doi-asserted-by":"crossref","unstructured":"E. Cand\u00e8s, M. Rudelson, T. Tao, R. Vershynin, Error correction via linear programming, in: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Pittsburgh, PA, 2005, pp. 295\u2013308.","DOI":"10.1109\/SFCS.2005.5464411"},{"key":"10.1016\/j.dsp.2012.03.003_br0220","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","article-title":"Decoding by linear programming","volume":"51","author":"Cand\u00e8s","year":"2005","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.dsp.2012.03.003_br0230","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/j.crma.2008.03.014","article-title":"The restricted isometry property and its implications for compressed sensing","volume":"346","author":"Cand\u00e8s","year":"2008","journal-title":"C. R. Math."},{"key":"10.1016\/j.dsp.2012.03.003_br0240","doi-asserted-by":"crossref","unstructured":"M. Rudelson, R. Vershynin, Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements, in: 40th Annual Conference on Information Sciences and Systems, 2006, pp. 207\u2013212.","DOI":"10.1109\/CISS.2006.286463"},{"key":"10.1016\/j.dsp.2012.03.003_br0250","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1109\/JPROC.2010.2044010","article-title":"Computational methods for sparse solution of linear inverse problems","volume":"98","author":"Tropp","year":"2010","journal-title":"Proc. IEEE"},{"key":"10.1016\/j.dsp.2012.03.003_br0260","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.acha.2008.09.001","article-title":"Sparsest solutions of underdetermined linear systems via \u2113q-minimization for 0<q\u2a7d1","volume":"26","author":"Foucart","year":"2009","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"10.1016\/j.dsp.2012.03.003_br0270","doi-asserted-by":"crossref","first-page":"3397","DOI":"10.1109\/78.258082","article-title":"Matching pursuit in a time-frequency dictionary","volume":"41","author":"Mallat","year":"1993","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.dsp.2012.03.003_br0280","doi-asserted-by":"crossref","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","article-title":"Signal recovery from random measurements via orthogonal matching pursuit","volume":"53","author":"Tropp","year":"2007","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.dsp.2012.03.003_br0290","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s10208-008-9031-3","article-title":"Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit","volume":"9","author":"Needell","year":"2009","journal-title":"Found. Comput. Math."},{"key":"10.1016\/j.dsp.2012.03.003_br0300","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF03549495","article-title":"On the impossibility of uniform sparse reconstruction using greedy methods","volume":"7","author":"Rauhut","year":"2008","journal-title":"Sampl. Theory Signal Image Process."},{"key":"10.1016\/j.dsp.2012.03.003_br0310","unstructured":"D.L. Donoho, Y. Tsaig, I. Drori, J.-L. Starck, Sparse solution of underdetermined linear equations by Stagewise Orthogonal Matching Pursuit (StOMP), Technical Report, Statistics Dept., Stanford Univ., 2006."},{"key":"10.1016\/j.dsp.2012.03.003_br0320","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","article-title":"CoSaMP: Iterative signal recovery from incomplete and inaccurate samples","volume":"26","author":"Needell","year":"2008","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"10.1016\/j.dsp.2012.03.003_br0330","unstructured":"V. Cevher, S. Jafarpour, Fast hard thresholding with Nesterov\u02bcs gradient method, in: Neuronal Information Processing Systems, Workshop on Practical Applications of Sparse Modeling, Whistler, Canada, 2010."},{"key":"10.1016\/j.dsp.2012.03.003_br0340","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","article-title":"Smooth minimization of non-smooth functions","volume":"103","author":"Nesterov","year":"2005","journal-title":"Math. Program."}],"container-title":["Digital Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1051200412000656?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1051200412000656?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T10:05:19Z","timestamp":1742724319000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1051200412000656"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["S1051200412000656"],"URL":"https:\/\/doi.org\/10.1016\/j.dsp.2012.03.003","relation":{},"ISSN":["1051-2004"],"issn-type":[{"type":"print","value":"1051-2004"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}