{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T04:09:33Z","timestamp":1750392573642,"version":"3.41.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T00:00:00Z","timestamp":1497571200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s11042-017-4897-1","type":"journal-article","created":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T06:52:29Z","timestamp":1497595949000},"page":"12469-12491","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficiency-enhanced cost-volume filtering featuring coarse-to-fine strategy"],"prefix":"10.1007","volume":"77","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1441-889X","authenticated-orcid":false,"given":"Ryosuke","family":"Furuta","sequence":"first","affiliation":[]},{"given":"Satoshi","family":"Ikehata","sequence":"additional","affiliation":[]},{"given":"Toshihiko","family":"Yamaskai","sequence":"additional","affiliation":[]},{"given":"Kiyoharu","family":"Aizawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,16]]},"reference":[{"issue":"11","key":"4897_CR1","doi-asserted-by":"crossref","first-page":"2274","DOI":"10.1109\/TPAMI.2012.120","volume":"34","author":"R Achanta","year":"2012","unstructured":"Achanta R, Shaji A, Smith K, Lucchi A, Fua P, Su\u0307sstrunk S (2012) SLIC Superpixels compared to state-of-the-art superpixel methods. IEEE Trans PAMI 34(11):2274\u20132281","journal-title":"IEEE Trans PAMI"},{"key":"4897_CR2","doi-asserted-by":"crossref","unstructured":"Bai X, Luo X, Li S, Lu H (2014) Adaptive stereo matching via loop-erased random walk. In: ICIP","DOI":"10.1109\/ICIP.2014.7025769"},{"key":"4897_CR3","unstructured":"Bames C, Shechtman E, Goldman DB, Finkelstein A (2010) The generalized patchmatch correspondence algorithm. In: ECCV"},{"key":"4897_CR4","doi-asserted-by":"crossref","unstructured":"Bao L, Yang Q, Jin H (2014) Fast edge-preserving PatchMatch for large displacement optical flow. In: CVPR","DOI":"10.1109\/CVPR.2014.452"},{"issue":"12","key":"4897_CR5","doi-asserted-by":"crossref","first-page":"4996","DOI":"10.1109\/TIP.2014.2359374","volume":"23","author":"L Bao","year":"2014","unstructured":"Bao L, Yang Q, Jin H (2014) Fast edge-preserving patchmatch for large displacement optical flow. IEEE Trans Image Process 23(12):4996\u20135006","journal-title":"IEEE Trans Image Process"},{"key":"4897_CR6","doi-asserted-by":"crossref","unstructured":"Barnes C, Shechtman E, Finkelstein A, Goldman DB (2009) Patchmatch: A randomized correpondence algorithm for structual image editing. In: ACM SIGGRAGH","DOI":"10.1145\/1576246.1531330"},{"issue":"9","key":"4897_CR7","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1109\/TPAMI.2004.60","volume":"26","author":"Y Boykov","year":"2004","unstructured":"Boykov Y, Kolmogorov V (2004) An experimental comparison of min-cut\/max-flow algorithm for energy minimization in vision. IEEE Trans PAMI 26(9):1124\u20131137","journal-title":"IEEE Trans PAMI"},{"issue":"11","key":"4897_CR8","doi-asserted-by":"crossref","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y Boykov","year":"2001","unstructured":"Boykov Y, Veksler O, Zabih R (2001) Fast approximate energy minimization via graph cuts. IEEE Trans PAMI 23(11):1222\u20131239","journal-title":"IEEE Trans PAMI"},{"key":"4897_CR9","doi-asserted-by":"crossref","unstructured":"Brox T, Bruhn A, Papenberg N, Weickert J (2004) High accuracy optical flow estimation based on a theory for warping. In: ECCV","DOI":"10.1007\/978-3-540-24673-2_3"},{"key":"4897_CR10","doi-asserted-by":"crossref","unstructured":"Brunton A, Lang J, Dubois E (2012) Efficient multi-scale stereo of high-resolution planar and spherical images. In: 3DIMPVT","DOI":"10.1109\/3DIMPVT.2012.42"},{"key":"4897_CR11","doi-asserted-by":"crossref","unstructured":"Chen Z, Sun X, Wang L, Yu Y, Huang C (2015) A deep visual correspondence embedding model for stereo matching costs. In: ICCV","DOI":"10.1109\/ICCV.2015.117"},{"key":"4897_CR12","doi-asserted-by":"crossref","unstructured":"Cho J, Ikehata S, Yoo H, Gelautz M, Aizawa K (2013) Depth map up-sampling using cost-volume filtering. In: IVMSP Workshop","DOI":"10.1109\/IVMSPW.2013.6611912"},{"key":"4897_CR13","doi-asserted-by":"crossref","unstructured":"Dosovitskiy A, Fischer P, Ilg E, Hausser P, Hazirbas C, Golkov V, van der Smagt P, Cremers D, Brox T (2015) Flownet: Learning optical flow with convolutional networks. In: ICCV","DOI":"10.1109\/ICCV.2015.316"},{"issue":"1","key":"4897_CR14","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s11263-006-7899-4","volume":"70","author":"PF Felzenszwalb","year":"2006","unstructured":"Felzenszwalb PF, Huttenlocher DP (2006) Efficient belief propagation for early vision. IJCV 70(1):41\u201354","journal-title":"IJCV"},{"key":"4897_CR15","doi-asserted-by":"crossref","unstructured":"Furuta R, Ikehata S, Yamasaki T, Aizawa K (2014) Coarse-to-fine strategy for efficient cost-volume filtering. In: ICIP","DOI":"10.1109\/ICIP.2014.7025770"},{"key":"4897_CR16","doi-asserted-by":"crossref","unstructured":"He K, Sun J, Tang X (2010) Guided image filtering. In: ECCV","DOI":"10.1007\/978-3-642-15549-9_1"},{"key":"4897_CR17","doi-asserted-by":"crossref","unstructured":"Helala MA, Qureshi FZ (2014) Accelerating cost volume filtering using salient subvolumes and robust occlusion handling. In: ACCV","DOI":"10.1007\/978-3-319-16808-1_22"},{"key":"4897_CR18","unstructured":"Hosni A, Rhemann C, Bleyer M, Gelautz M (2012) Temporally consistent disparity and optical flow via efficient spatio-temporal filtering. In: Advances in image and video technology, pp 165\u2013177"},{"issue":"10","key":"4897_CR19","doi-asserted-by":"crossref","first-page":"1568","DOI":"10.1109\/TPAMI.2006.200","volume":"28","author":"V Kolmogorov","year":"2006","unstructured":"Kolmogorov V (2006) Convergent tree-reweighted message passing for energy minimization. IEEE Trans PAMI 28(10):1568\u20131583","journal-title":"IEEE Trans PAMI"},{"key":"4897_CR20","doi-asserted-by":"crossref","unstructured":"Kramarev V, Demetz O, Schroers C, Weickert J (2013) Cross anisotropic cost volume filtering for segmentation. In: ACCV","DOI":"10.1007\/978-3-642-37331-2_60"},{"key":"4897_CR21","unstructured":"Lu J, Shi K, Min D, Lin L, Do MN (2012) Cross-based local multipoint filtering. In: CVPR"},{"key":"4897_CR22","doi-asserted-by":"crossref","unstructured":"Lu J, Yang H, Min D, Minh ND (2013) Patchmatch filter: Efficient edge-aware filtering meets randomized search for fast correspondence field estimation. In: CVPR","DOI":"10.1109\/CVPR.2013.242"},{"key":"4897_CR23","doi-asserted-by":"crossref","unstructured":"Luo W, Schwing AG, Urtasun R (2016) Efficient deep learning for stereo matching. In: CVPR","DOI":"10.1109\/CVPR.2016.614"},{"key":"4897_CR24","unstructured":"Middlebury optical flow database. http:\/\/vision.middlebury.edu\/flow\/"},{"key":"4897_CR25","unstructured":"Middlebury stereo database. http:\/\/vision.middlebury.edu\/stereo\/"},{"key":"4897_CR26","doi-asserted-by":"crossref","unstructured":"Min D, Lu J, Do MN (2011) A revisit to cost aggregation in stereo matching: How far can we reduce its computational redundancy? In: ICCV","DOI":"10.1109\/ICCV.2011.6126416"},{"issue":"10","key":"4897_CR27","doi-asserted-by":"crossref","first-page":"2539","DOI":"10.1109\/TPAMI.2013.15","volume":"35","author":"D Min","year":"2013","unstructured":"Min D, Lu J, Do MN (2013) Joint histogram-based cost aggregation for stereo matching. IEEE Trans PAMI 35(10):2539\u20132545","journal-title":"IEEE Trans PAMI"},{"key":"4897_CR28","doi-asserted-by":"crossref","unstructured":"Rhemann C, Hosni A, Bleyer M, Rother C, Gelautz M (2011) Fast cost-volume filtering for visual correspondence and beyond. In: CVPR","DOI":"10.1109\/CVPR.2011.5995372"},{"key":"4897_CR29","doi-asserted-by":"crossref","unstructured":"Richardt C, Orr D, Davies I, Criminisi A, Dodgson NA (2010) Real-time spatiotemporal stereo matching using the dual-cross-bilateral grid. In: ECCV","DOI":"10.1007\/978-3-642-15558-1_37"},{"issue":"7","key":"4897_CR30","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1109\/TPAMI.2003.1206509","volume":"25","author":"J Sun","year":"2003","unstructured":"Sun J, Zheng NN, Shum HY (2003) Stereo matching using belief propagation. IEEE Trans PAMI 25(7):787\u2013800","journal-title":"IEEE Trans PAMI"},{"key":"4897_CR31","doi-asserted-by":"crossref","unstructured":"Sun D, Roth S, Black MJ (2010) Secrets of optical flow estimation and their principles. In: CVPR","DOI":"10.1109\/CVPR.2010.5539939"},{"issue":"6","key":"4897_CR32","doi-asserted-by":"crossref","first-page":"1068","DOI":"10.1109\/TPAMI.2007.70844","volume":"30","author":"R Szeliski","year":"2008","unstructured":"Szeliski R, Zabih R, Scharstein D, Veksler O, Kolmogorov V, Agarwala A, Tappen M, Rother C (2008) A comparative study of energy minimization methods for markov random fields with smoothnes-based priors. IEEE Trans PAMI 30(6):1068\u20131080","journal-title":"IEEE Trans PAMI"},{"key":"4897_CR33","doi-asserted-by":"crossref","unstructured":"Tan X, Sun C, Wang D, Guo Y, Pham TD (2014) Soft cost aggregation with multi-resolution fusion. In: ECCV","DOI":"10.1007\/978-3-319-10602-1_2"},{"key":"4897_CR34","doi-asserted-by":"crossref","unstructured":"Tao M, Bai J, Kohli P, Paris S (2012) Simpleflow: a non-iterative, sublinear optical flow algorithm. In: Computer graphics forum, vol 31, pp 345\u2013353","DOI":"10.1111\/j.1467-8659.2012.03013.x"},{"key":"4897_CR35","doi-asserted-by":"crossref","unstructured":"Tappen MF, Freeman WT (2003) Comparison of graph cuts with belief propagation for stereo, using identical mrf parameters. In: ICCV","DOI":"10.1109\/ICCV.2003.1238444"},{"key":"4897_CR36","doi-asserted-by":"crossref","unstructured":"Tomasi C, Manduchi R (1998) Bilateral filtering for gray and color images. In: ICCV","DOI":"10.1109\/ICCV.1998.710815"},{"issue":"11","key":"4897_CR37","doi-asserted-by":"crossref","first-page":"3697","DOI":"10.1109\/TIT.2005.856938","volume":"51","author":"MJ Wainwright","year":"2005","unstructured":"Wainwright MJ, Jaakkola TS, Willsky AS (2005) Map estimation via agreement on trees: Message-passing and linear-programming approaches. IEEE Trans Inf Theory 51(11):3697\u20133717","journal-title":"IEEE Trans Inf Theory"},{"key":"4897_CR38","doi-asserted-by":"crossref","unstructured":"Wang Y, Wang K, Dunn E, Frahm JM (2014) Stereo under sequential optimal sampling: a statistical analysis framework for search space reduction. In: CVPR","DOI":"10.1109\/CVPR.2014.69"},{"key":"4897_CR39","doi-asserted-by":"crossref","unstructured":"Wedel A, Pock T, Zach C, Bischof H, Cremers D (2009) An improved algorithm for tv-l 1 optical flow. In: Statistical and geometrical approaches to visual motion analysis, pp 23\u201345","DOI":"10.1007\/978-3-642-03061-1_2"},{"key":"4897_CR40","unstructured":"Yang Q (2012) A non-local cost aggregation method for stereo matching. In: CVPR"},{"issue":"4","key":"4897_CR41","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1109\/TPAMI.2014.2353642","volume":"37","author":"Q Yang","year":"2015","unstructured":"Yang Q (2015) Stereo matching using tree filtering. IEEE Trans PAMI 37(4):834\u2013846","journal-title":"IEEE Trans PAMI"},{"key":"4897_CR42","doi-asserted-by":"crossref","unstructured":"Yang R, Pollefeys M (2003) Multi-resolution real-time stereo on commodity graphics hardware. In: CVPR","DOI":"10.1145\/1242073.1242253"},{"key":"4897_CR43","doi-asserted-by":"crossref","unstructured":"Yang Q, Wang L, Ahuja N (2010) A constant-space belief propagation algorithm for stereo matching. In: CVPR","DOI":"10.1109\/CVPR.2010.5539797"},{"key":"4897_CR44","unstructured":"Yoon KJ, Kweon IS (2005) Locally adaptive support-weight approach for visual correspondence search. In: CVPR"},{"issue":"4","key":"4897_CR45","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1109\/TPAMI.2006.70","volume":"28","author":"KJ Yoon","year":"2006","unstructured":"Yoon KJ, Kweon IS (2006) Adaptive support-weight approach for correspondence search. IEEE Trans PAMI 28(4):650\u2013656","journal-title":"IEEE Trans PAMI"},{"key":"4897_CR46","doi-asserted-by":"crossref","unstructured":"Zbontar J, LeCun Y (2015) Computing the stereo matching cost with a convolutional neural network. In: CVPR","DOI":"10.1109\/CVPR.2015.7298767"},{"issue":"1-32","key":"4897_CR47","first-page":"2","volume":"17","author":"J Zbontar","year":"2016","unstructured":"Zbontar J, LeCun Y (2016) Stereo matching by training a convolutional neural network to compare image patches. JMLR 17(1-32):2","journal-title":"JMLR"},{"issue":"9","key":"4897_CR48","first-page":"1632","volume":"26","author":"Y Zhan","year":"2016","unstructured":"Zhan Y, Gu Y, Huang K, Zhang C, Hu K (2016) Accurate image-guided stereo matching with efficient matching cost and disparity refinement. IEEE Trans CSVT 26(9):1632\u20131645","journal-title":"IEEE Trans CSVT"},{"key":"4897_CR49","doi-asserted-by":"crossref","unstructured":"Zhang K, Fang Y, Min D, Sun L, Yang S, Yan S, Tian Q (2014) Cross-scale cost aggregation for stereo matching. In: CVPR","DOI":"10.1109\/CVPR.2014.206"},{"issue":"6","key":"4897_CR50","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/j.imavis.2011.01.007","volume":"29","author":"Y Zhao","year":"2011","unstructured":"Zhao Y, Taubin G (2011) Real-time stereo on gpgpu using progressive multi-resolution adaptive windows. Image Vis Comput 29(6):420\u2013432","journal-title":"Image Vis Comput"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11042-017-4897-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-017-4897-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-017-4897-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T17:54:12Z","timestamp":1750355652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11042-017-4897-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,16]]},"references-count":50,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["4897"],"URL":"https:\/\/doi.org\/10.1007\/s11042-017-4897-1","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"type":"print","value":"1380-7501"},{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2017,6,16]]}}}