{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T00:59:53Z","timestamp":1718499593913},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,1,16]],"date-time":"2017-01-16T00:00:00Z","timestamp":1484524800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s11042-016-4295-0","type":"journal-article","created":{"date-parts":[[2017,1,16]],"date-time":"2017-01-16T06:53:30Z","timestamp":1484549610000},"page":"4095-4112","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Sparsity estimation based adaptive matching pursuit algorithm"],"prefix":"10.1007","volume":"77","author":[{"given":"Shihong","family":"Yao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanwen","family":"Chong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaoming","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,16]]},"reference":[{"key":"4295_CR1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2544779","author":"G Bin","year":"2016","unstructured":"Bin G, Sun X, Sheng VS (2016a) Structural minimax probability machine. IEEE Transactions on Neural Networks and Learning Systems. doi:\n10.1109\/TNNLS.2016.2544779","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"4295_CR2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2527796","author":"G Bin","year":"2016","unstructured":"Bin G, Victor S, Sheng A (2016b) Robust regularization path algorithm for \u03bd-support vector classification. IEEE Transactions on Neural Networks and Learning Systems. doi:\n10.1109\/TNNLS.2016.2527796","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"issue":"11","key":"4295_CR3","doi-asserted-by":"crossref","first-page":"4333","DOI":"10.1109\/TSP.2009.2025088","volume":"57","author":"T Blumensath","year":"2009","unstructured":"Blumensath T, Davies ME (2009) Stagewise Weak Gradient Pursuits. IEEE Trans Signal Process 57(11):4333\u20134346","journal-title":"IEEE Trans Signal Process"},{"key":"4295_CR4","first-page":"1433","volume":"3","author":"EJ Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s EJ (2006) Compressive sampling. In Proceedings of the International Congress of Mathematicians 3:1433\u20131452","journal-title":"In Proceedings of the International Congress of Mathematicians"},{"key":"4295_CR5","unstructured":"Candes E, Romberg J (2005) l1-magic: Recovery of sparse signals via convex programming. URL:\nwww.acm.caltech.edu\/l1magic\/downloads\/l1magic.pdf\n\n, 4, p 14"},{"issue":"2","key":"4295_CR6","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"EJ Candes","year":"2006","unstructured":"Candes EJ, Romberg J, Tao T (2006) Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans Inf Theory 52(2):489\u2013509","journal-title":"IEEE Trans Inf Theory"},{"issue":"5","key":"4295_CR7","doi-asserted-by":"crossref","first-page":"2230","DOI":"10.1109\/TIT.2009.2016006","volume":"55","author":"W Dai","year":"2009","unstructured":"Dai W, Milenkovic O (2009) Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans Inf Theory 55(5):2230\u20132249","journal-title":"IEEE Trans Inf Theory"},{"key":"4295_CR8","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"Daubechies I, Defrise M, De Mol C (2004) An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Comm Pure Appl Math 57:1413\u20131457","journal-title":"Comm Pure Appl Math"},{"key":"4295_CR9","doi-asserted-by":"crossref","unstructured":"Do TT, Gan L, Nguyen N et al. (2008) Sparsity adaptive matching pursuit algorithm for practical compressed sensing. 42nd Asilomar IEEE Conference on Signals, Systems and Computers, p 581\u2013587","DOI":"10.1109\/ACSSC.2008.5074472"},{"key":"4295_CR10","unstructured":"Donoho DL, Tsaig Y, Drori I et al. (2006) Sparse Solution of Underdetermined Linear Equations by Stagewise Orthogonal Matching Pursuit. Technique Report TR-2006-2, Standford University, Department of Statistics"},{"issue":"2","key":"4295_CR11","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.jat.2007.01.004","volume":"147","author":"DL Donoho","year":"2007","unstructured":"Donoho DL, Elad M, Temlyakov VN (2007) On Lebesgue-typ2e inequalities for greedy approximation. Journal of Approximation Theory 147(2):185\u2013195","journal-title":"Journal of Approximation Theory"},{"key":"4295_CR12","doi-asserted-by":"crossref","unstructured":"Elad M, Bruckstein AM (2002) A generalized uncertainty principle and sparse representation in pairs of bases. IEEE Transactions on Information Theory, p 2558\u20132567","DOI":"10.1109\/TIT.2002.801410"},{"key":"4295_CR13","doi-asserted-by":"crossref","unstructured":"Eldar YC., Kutyniok G eds. (2012) Compressed sensing: theory and applications. Cambridge University Press","DOI":"10.1017\/CBO9780511794308"},{"key":"4295_CR14","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1109\/JSTSP.2007.910281","volume":"1","author":"MAT Figueiredo","year":"2007","unstructured":"Figueiredo MAT, Nowak RD, Wright SJ (2007) Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems. IEEE J Sel Top Signa 1:586\u2013597","journal-title":"IEEE J Sel Top Signa"},{"key":"4295_CR15","unstructured":"Fornasier M, Rauhut H (2010) Compressive sensing. Handbook. Mathematical Methods in Imaging, vol. 1, ed. by O. Scherzer Springer, Berlin, p 187\u2013229"},{"key":"4295_CR16","doi-asserted-by":"crossref","unstructured":"Foucart S, Rauhut H (2013) Restricted Isometry Property. A Mathematical Introduction to Compressive Sensing. Springer, New York, 133\u2013174","DOI":"10.1007\/978-0-8176-4948-7_6"},{"key":"4295_CR17","unstructured":"Gilber AC, Strauss MJ, Tropp JA et al. (2006) Algorithmic linear dimension reduction in the L1 norm for sparse vectors. Proceedings of the 44th Annual Allerton Conference on Communication, Control and Computing 1\u20139"},{"key":"4295_CR18","doi-asserted-by":"crossref","unstructured":"Gilbert AC, Strauss MJ, Vershynin R (2007) One sketch for all: Fast algorithms for Compressed Sensing. In Proc. 39th ACM Symp. Theory of Computing (STOC), San Diego, June 2007","DOI":"10.1145\/1250790.1250824"},{"key":"4295_CR19","unstructured":"Hoyer PO (2004) Non-negative matrix factorization with sparseness constraints. J Mach Learn Res 5:1457\u20131469"},{"issue":"3","key":"4295_CR20","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10208-009-9057-1","volume":"10","author":"MA Iwen","year":"2010","unstructured":"Iwen MA (2010) Combinatorial sublinear-time Fourier algorithms. Found Comput Math 10(3):303\u2013338","journal-title":"Found Comput Math"},{"key":"4295_CR21","doi-asserted-by":"crossref","unstructured":"Jinming W, Xiao-Wen C (2017) The success probability of the Babai point estimator in box-constrained integer linear models. IEEE Trans Inf Theory 63:631\u2013648","DOI":"10.1109\/TIT.2016.2627082"},{"issue":"12","key":"4295_CR22","doi-asserted-by":"crossref","first-page":"3397","DOI":"10.1109\/78.258082","volume":"41","author":"SG Mallat","year":"1993","unstructured":"Mallat SG, Zhang Z (1993) Matching pursuits with time-frequency dictionaries. IEEE Trans Signal Process 41(12):3397\u20133415","journal-title":"IEEE Trans Signal Process"},{"issue":"12","key":"4295_CR23","first-page":"93","volume":"26","author":"D Needell","year":"2008","unstructured":"Needell D, Tropp JA (2008) CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Applied & computational Harmonic Analysis 26(12):93\u2013100","journal-title":"Applied & computational Harmonic Analysis"},{"issue":"2","key":"4295_CR24","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1109\/JSTSP.2010.2042412","volume":"4","author":"D Needell","year":"2010","unstructured":"Needell D, Vershynin R (2010) Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit [J]. IEEE Journal of Selected Topics in Signal Processing 4(2):310\u2013316","journal-title":"IEEE Journal of Selected Topics in Signal Processing"},{"key":"4295_CR25","doi-asserted-by":"publisher","unstructured":"Pan ZQ, Lei JJ, Zhang Y, Sun XM, Kwong S (2016a) Fast motion estimation based on content property for low-complexity H.265\/HEVC encoder. IEEE Transactions on Broadcasting p 1\u201310 doi:\n10.1109\/TBC.2016.2580920","DOI":"10.1109\/TBC.2016.2580920"},{"issue":"3","key":"4295_CR26","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1109\/TBC.2016.2580920","volume":"62","author":"Z Pan","year":"2016","unstructured":"Pan Z, Lei J, Zhang Y et al (2016b) Fast motion estimation based on content property for low-complexity H. 265\/HEVC encoder[J]. IEEE Trans Broadcast 62(3):675\u2013684","journal-title":"IEEE Trans Broadcast"},{"key":"4295_CR27","unstructured":"Sharon Y, Wright J, Ma Y (2007) Computation and Relaxation of Conditions for Equivalence between l1and l0 Minimization. CSL Technical Report UILU-ENG-07-2208, Univ. of Illinois, Urbana-Champaign"},{"issue":"12","key":"4295_CR28","doi-asserted-by":"crossref","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","volume":"53","author":"JA Tropp","year":"2007","unstructured":"Tropp JA, Gilbert AC (2007) Signal recovery from random measurements via orthogonal matching pursuit[J]. IEEE Trans Inf Theory 53(12):4655\u20134666","journal-title":"IEEE Trans Inf Theory"},{"issue":"12","key":"4295_CR29","doi-asserted-by":"crossref","first-page":"6202","DOI":"10.1109\/TSP.2012.2218810","volume":"60","author":"J Wang","year":"2011","unstructured":"Wang J, Kwon S, Shim B (2011a) Generalized orthogonal matching pursuit. IEEE Trans Signal Process 60(12):6202\u20136216","journal-title":"IEEE Trans Signal Process"},{"issue":"11","key":"4295_CR30","doi-asserted-by":"crossref","first-page":"2925","DOI":"10.1016\/j.csda.2011.04.021","volume":"55","author":"H Wang","year":"2011","unstructured":"Wang H, Maldonado D, Silwal S (2011b) A nonparametric-test-based structural similarity measure for digital images. Comput Stat Data Anal 55(11):2925\u20132936","journal-title":"Comput Stat Data Anal"},{"issue":"8","key":"4295_CR31","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1002\/sec.864","volume":"7","author":"Z Xia","year":"2014","unstructured":"Xia Z, Wang X, Sun X et al (2014) Steganalysis of least significant bit matching using multi-order differences[J]. Security and Communication Networks 7(8):1283\u20131291","journal-title":"Security and Communication Networks"},{"key":"4295_CR32","unstructured":"Yao S, Wang T, Shen W, et al. (2015) Research of incoherence rotated chaotic measurement matrix in compressed sensing. Multimedia Tools & Applications 1\u201319"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11042-016-4295-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-016-4295-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-016-4295-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,16]],"date-time":"2018-02-16T08:03:04Z","timestamp":1518768184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11042-016-4295-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,16]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["4295"],"URL":"https:\/\/doi.org\/10.1007\/s11042-016-4295-0","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"value":"1380-7501","type":"print"},{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,16]]}}}