{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T07:36:39Z","timestamp":1648971399392},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,4,11]],"date-time":"2018-04-11T00:00:00Z","timestamp":1523404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Image Video Proc."],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1186\/s13640-018-0249-y","type":"journal-article","created":{"date-parts":[[2018,4,11]],"date-time":"2018-04-11T05:11:53Z","timestamp":1523423513000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient cost aggregation for feature-vector-based wide-baseline stereo matching"],"prefix":"10.1186","volume":"2018","author":[{"given":"Xiaoming","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdesselam","family":"Bouzerdoum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Son Lam","family":"Phung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,11]]},"reference":[{"issue":"1-3","key":"249_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1014573219977","volume":"47","author":"D Scharstein","year":"2002","unstructured":"D Scharstein, R Szeliski, A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. Int. J. Comput. Vis.47(1-3), 7\u201342 (2002).","journal-title":"Int. J. Comput. Vis."},{"key":"249_CR2","unstructured":"C Strecha, R Fransens, L Van Gool, in Proc. Computer Vision and Pattern Recognition (CVPR). Combined depth and outlier estimation in multi-view stereo, (2006), pp. 2394\u20132401."},{"key":"249_CR3","unstructured":"X Huang, in Proc. 26th DAGM Symposium. Cooperative optimization for energy minimization in computer vision: a case study of stereo matching, (2004), pp. 302\u2013309."},{"key":"249_CR4","unstructured":"Z Wang, Z Zheng, in Proc. Computer Vision and Pattern Recognition (CVPR). A region based stereo matching algorithm using cooperative optimization, (2008), pp. 1\u20138."},{"issue":"11","key":"249_CR5","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y Boykov","year":"2001","unstructured":"Y Boykov, O Veksler, R Zabih, Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell.23(11), 1222\u20131239 (2001).","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"249_CR6","unstructured":"JS Yedidia, WT Freeman, Y Weiss, in Advances in Neural Information Processing Systems (NIPS). Generalized belief propagation, (2000), pp. 689\u2013695."},{"issue":"11","key":"249_CR7","doi-asserted-by":"publisher","first-page":"3697","DOI":"10.1109\/TIT.2005.856938","volume":"51","author":"MJ Wainwright","year":"2005","unstructured":"MJ Wainwright, TS Jaakkola, AS Willsky, Map estimation via agreement on trees: message-passing and linear programming. IEEE Trans. Inf. Theory. 51(11), 3697\u20133717 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"249_CR8","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1109\/TPAMI.2007.70844","volume":"30","author":"R Szeliski","year":"2008","unstructured":"R Szeliski, R Zabih, D Scharstein, O Veksler, V Kolmogorov, A Agarwala, M Tappen, C Rother, A comparative study of energy minimization methods for Markov random fields with smoothness-based priors. IEEE Trans. Pattern Anal. Mach. Intell.30(6), 1068\u20131080 (2008).","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"12","key":"249_CR9","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1016\/j.imavis.2004.03.009","volume":"22","author":"L Di Stefano","year":"2004","unstructured":"L Di Stefano, M Marchionni, S Mattoccia, A fast area-based stereo matching algorithm. Image Vis. Comput.22(12), 983\u20131005 (2004).","journal-title":"Image Vis. Comput."},{"key":"249_CR10","unstructured":"F Tombari, S Mattoccia, L Di Stefano, E Addimanda, in Proc. Computer Vision and Pattern Recognition (CVPR). Classification and evaluation of cost aggregation methods for stereo correspondence, (2008), pp. 1\u20138."},{"issue":"2","key":"249_CR11","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/TPAMI.2007.1166","volume":"30","author":"H Hirschm\u00fcller","year":"2008","unstructured":"H Hirschm\u00fcller, Stereo processing by semiglobal matching and mutual information. IEEE Trans. Pattern Anal. Mach. Intell.30(2), 328\u2013341 (2008).","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"5","key":"249_CR12","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1109\/TPAMI.2006.70","volume":"28","author":"KJ Yoon","year":"2006","unstructured":"KJ Yoon, IS Kweon, Adaptive support-weight approach for correspondence search. IEEE Trans. Pattern Anal. Mach. Intell.28(5), 650\u2013656 (2006).","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"249_CR13","unstructured":"S Mattoccia, S Giardino, A Gambini, in Proc. Asian Conference on Computer Vision (ACCV). Accurate and efficient cost aggregation strategy for stereo correspondence based on approximated joint bilateral filtering, (2009), pp. 371\u2013380."},{"key":"249_CR14","unstructured":"D Min, J Lu, MN Do, in Proc. International Conference on Computer Vision (ICCV). A revisit to cost aggregation in stereo matching: how far can we reduce its computational redundancy? (2011), pp. 1567\u20131574."},{"issue":"2","key":"249_CR15","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1109\/TPAMI.2012.156","volume":"35","author":"A Hosni","year":"2013","unstructured":"A Hosni, C Rhemann, M Bleyer, C Rother, M Gelautz, Fast cost-volume filtering for visual correspondence and beyond. IEEE Trans. Pattern Anal. Mach. Intell.35(2), 504\u2013511 (2013).","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"6","key":"249_CR16","doi-asserted-by":"publisher","first-page":"1397","DOI":"10.1109\/TPAMI.2012.213","volume":"35","author":"K He","year":"2013","unstructured":"K He, J Sun, X Tang, Guided image filtering. IEEE Trans. Pattern Anal. Mach. Intell.35(6), 1397\u20131409 (2013).","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"249_CR17","unstructured":"Q Yang, in Proc. Computer Vision and Pattern Recognition (CVPR). A non-local cost aggregation method for stereo matching, (2012), pp. 1402\u20131409."},{"key":"249_CR18","unstructured":"X Mei, X Sun, W Dong, H Wang, X Zhang, in Proc. Computer Vision and Pattern Recognition (CVPR). Segment-tree based cost aggregation for stereo matching, (2013), pp. 313\u2013320."},{"key":"249_CR19","unstructured":"K Zhang, Y Fang, D Min, L Sun, S Yang, S Yan, Q Tian, in Proc. Computer Vision and Pattern Recognition (CVPR). Cross-scale cost aggregation for stereo matching, (2014), pp. 1590\u20131597."},{"issue":"7","key":"249_CR20","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1109\/TPAMI.2011.222","volume":"34","author":"M Calonder","year":"2012","unstructured":"M Calonder, V Lepetit, M Ozuysal, T Trzcinski, C Strecha, P Fua, BRIEF: computing a local binary descriptor very fast. IEEE Trans. Pattern Anal. Mach. Intell.34(7), 1281\u20131298 (2012).","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"249_CR21","unstructured":"S Leutenegger, M Chli, RY Siegwart, in Proc. International Conference on Computer Vision (ICCV). BRISK: Binary robust invariant scalable keypoints, (2011), pp. 2548\u20132555."},{"key":"249_CR22","unstructured":"A Alahi, R Ortiz, P Vandergheynst, in Proc. Computer Vision and Pattern Recognition (CVPR). FREAK: fast retina keypoint, (2012), pp. 510\u2013517."},{"key":"249_CR23","unstructured":"E Rublee, V Rabaud, K Konolige, G Bradski, in Proc. International Conference on Computer Vision (ICCV). ORB: an efficient alternative to SIFT or SURF, (2011), pp. 2564\u20132571."},{"issue":"2","key":"249_CR24","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/B:VISI.0000029664.99615.94","volume":"60","author":"DG Lowe","year":"2004","unstructured":"DG Lowe, Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vis.60(2), 91\u2013110 (2004).","journal-title":"Int. J. Comput. Vis."},{"issue":"3","key":"249_CR25","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/j.cviu.2007.09.014","volume":"110","author":"H Bay","year":"2008","unstructured":"H Bay, A Ess, T Tuytelaars, L Van Gool, Speeded-up robust features (SURF). Comput. Vis. Image Understanding. 110(3), 346\u2013359 (2008).","journal-title":"Comput. Vis. Image Understanding"},{"key":"249_CR26","unstructured":"J Heinly, E Dunn, JM Frahm, in Proc. European Conference on Computer Vision (ECCV). Comparative evaluation of binary features, (2012), pp. 759\u2013773."},{"issue":"6","key":"249_CR27","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1007\/s00138-015-0689-7","volume":"26","author":"N Khan","year":"2015","unstructured":"N Khan, B McCane, S Mills, Better than SIFT?Mach. Vis. Appl.26(6), 819\u2013836 (2015).","journal-title":"Mach. Vis. Appl."},{"issue":"5","key":"249_CR28","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1109\/TPAMI.2009.77","volume":"32","author":"E Tola","year":"2010","unstructured":"E Tola, V Lepetit, P Fua, DAISY: an efficient dense descriptor applied to wide-baseline stereo. IEEE Trans. Pattern Anal. Mach. Intell.32(5), 815\u2013830 (2010).","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"5","key":"249_CR29","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1109\/TPAMI.2010.147","volume":"33","author":"C Liu","year":"2011","unstructured":"C Liu, J Yuen, A Torralba, SIFT flow: dense correspondence across scenes and its applications. IEEE Trans. Pattern Anal. Mach. Intell.33(5), 978\u2013994 (2011).","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"249_CR30","unstructured":"K Zhang, J Li, Y Li, W Hu, L Sun, S Yang, in Proc. International Conference on Pattern Recognition (ICPR). Binary stereo matching, (2012), pp. 356\u2013359."},{"key":"249_CR31","unstructured":"S Zagoruyko, N Komodakis, in Proc. Computer Vision and Pattern Recognition (CVPR). Learning to compare image patches via convolutional neural networks, (2015), pp. 4353\u20134361."},{"key":"249_CR32","unstructured":"J \u017ebontar, Y LeCun, in Proc. Computer Vision and Pattern Recognition (CVPR). Computing the stereo matching cost with a convolutional neural network, (2015), pp. 1592\u20131599."},{"key":"249_CR33","unstructured":"Z Chen, X Sun, L Wang, Y Yu, C Huang, in Proc. International Conference on Computer Vision (ICCV). A deep visual correspondence embedding model for stereo matching costs, (2015), pp. 972\u2013980."},{"key":"249_CR34","unstructured":"W Luo, AG Schwing, R Urtasun, in Proc. Computer Vision and Pattern Recognition (CVPR). Efficient deep learning for stereo matching, (2016), pp. 5695\u20135703."},{"key":"249_CR35","unstructured":"N Mayer, E Ilg, P Hausser, P Fischer, D Cremers, A Dosovitskiy, T Brox, in Proc. Computer Vision and Pattern Recognition (CVPR). A large dataset to train convolutional networks for disparity, optical flow, and scene flow estimation, (2016), pp. 4040\u20134048."},{"issue":"3","key":"249_CR36","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/964965.808600","volume":"18","author":"F Crow","year":"1984","unstructured":"F Crow, Summed-area tables for texture mapping. Comput. Graphics. 18(3), 207\u2013212 (1984).","journal-title":"Comput. Graphics"},{"key":"249_CR37","unstructured":"C Strecha, W von Hansen, L Van Gool, P Fua, U Thoennessen, in Proc. Computer Vision and Pattern Recognition (CVPR). On benchmarking camera calibration and multi-view stereo for high resolution imagery, (2008), pp. 1\u20138."},{"key":"249_CR38","unstructured":"D Scharstein, H Hirschmller, Y Kitajima, G Krathwohl, N Nesic, X Wang, P Westling, in Proc. German Conference on Pattern Recognition (GCPR). High-resolution stereo datasets with subpixel-accurate ground truth, (2014), pp. 31\u201342."},{"key":"249_CR39","unstructured":"R Zabih, J Wood, in Proc. European Conference on Computer Vision (ECCV). Non-parametric local transforms for computing visual correspondence, (1994), pp. 151\u2013158."},{"issue":"9","key":"249_CR40","doi-asserted-by":"publisher","first-page":"1582","DOI":"10.1109\/TPAMI.2008.221","volume":"31","author":"H Hirschm\u00fcller","year":"2009","unstructured":"H Hirschm\u00fcller, D Scharstein, Evaluation of stereo matching costs on images with radiometric differences. IEEE Trans. Pattern Anal. Mach. Intell.31(9), 1582\u20131599 (2009).","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"7","key":"249_CR41","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1177\/02783640122067525","volume":"20","author":"J Banks","year":"2001","unstructured":"J Banks, P Corke, Quantitative evaluation of matching methods and validity measures for stereo vision. Int. J. Robot. Res.20(7), 512\u2013532 (2001).","journal-title":"Int. J. Robot. Res."}],"container-title":["EURASIP Journal on Image and Video Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13640-018-0249-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13640-018-0249-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13640-018-0249-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T19:16:05Z","timestamp":1554923765000},"score":1,"resource":{"primary":{"URL":"https:\/\/jivp-eurasipjournals.springeropen.com\/articles\/10.1186\/s13640-018-0249-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,11]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["249"],"URL":"https:\/\/doi.org\/10.1186\/s13640-018-0249-y","relation":{},"ISSN":["1687-5281"],"issn-type":[{"value":"1687-5281","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,11]]},"assertion":[{"value":"27 April 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Publisher\u2019s Note"}}],"article-number":"24"}}