The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Fast cost-volume filtering for visual correspondence and beyond
Abstract
Many computer vision tasks can be formulated as labeling problems. The desired solution is often a spatially smooth labeling where label transitions are aligned with color edges of the input image. We show that such solutions can be efficiently achieved by smoothing the label costs with a very fast edge preserving filter. In this paper we propose a generic and simple framework comprising three steps: (i) constructing a cost volume (ii) fast cost volume filtering and (iii) winner-take-all label selection. Our main contribution is to show that with such a simple framework state-of-the-art results can be achieved for several computer vision applications. In particular, we achieve (i) disparity maps in real-time, whose quality exceeds those of all other fast (local) approaches on the Middlebury stereo benchmark, and (ii) optical flow fields with very fine structures as well as large displacements. To demonstrate robustness, the few parameters of our framework are set to nearly identical values for both applications. Also, competitive results for interactive image segmentation are presented. With this work, we hope to inspire other researchers to leverage this framework to other application areas.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fast approximate energy minimization via graph cuts
Boykov, Y., Veksler, O., & Zabih, R. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.969114 · Cited by 6,988
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
Scharstein, D., & Szeliski, R. (2002) · International Journal of Computer Vision · doi:10.1023/a:1014573219977 · Cited by 6,740
GrabCut: Interactive foreground extraction using iterated graph cuts
Rother, C., Kolmogorov, V., & Blake, A. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015720 · Cited by 5,703
Self-citationAn experimental comparison of min-cut/max- flow algorithms for energy minimization in vision
Boykov, Y., & Kolmogorov, V. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.60 · Cited by 4,577
PatchMatch: a randomized correspondence algorithm for structural image editing
Barnes, C., Shechtman, E., Finkelstein, A., & Goldman, D. B. (2009) · ACM Transactions on Graphics · doi:10.1145/1531326.1531330 · Cited by 2,880
He, K., Sun, J., & Tang, X. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15549-9_1 · Cited by 1,565
Secrets of optical flow estimation and their principles
Sun, D., Roth, S., & Black, M. J. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539939 · Cited by 1,389
Large Displacement Optical Flow: Descriptor Matching in Variational Motion Estimation
Brox, T., & Malik, J. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.143 · Cited by 1,295
Adaptive support-weight approach for correspondence search
Yoon, K.-J., & Kweon, I. S. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.70 · Cited by 1,194
Sigal, L., Balan, A. O., & Black, M. J. (2010) · International Journal of Computer Vision · doi:10.1007/s11263-009-0273-6 · Cited by 1,164
Summed-area tables for texture mapping
Crow, F. C. (1984) · Proceedings of the 11th annual conference on Computer graphics and interactive techniques · doi:10.1145/800031.808600 · Cited by 1,125
A taxonomy and evaluation of dense two-frame stereo correspondence algorithms
Scharstein, D., Szeliski, R., & Zabih, R. (2002) · Proceedings IEEE Workshop on Stereo and Multi-Baseline Vision (SMBV 2001) · doi:10.1109/smbv.2001.988771 · Cited by 1,084
"GrabCut": interactive foreground extraction using iterated graph cuts
Rother, C., Kolmogorov, V., & Blake, A. (2004) · ACM SIGGRAPH 2004 Papers · doi:10.1145/1186562.1015720 · Cited by 935
Self-citationA Fast Approximation of the Bilateral Filter Using a Signal Processing Approach
Paris, S., & Durand, F. (2009) · International Journal of Computer Vision · doi:10.1007/s11263-007-0110-8 · Cited by 797
PatchMatch Stereo - Stereo Matching with Slanted Support Windows
Bleyer, M., Rhemann, C., & Rother, C. (2011) · Procedings of the British Machine Vision Conference 2011 · doi:10.5244/c.25.14 · Cited by 736
Self-citationIntegral histogram: a fast way to extract histograms in Cartesian spaces
Porikli, F. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.188 · Cited by 701
Vector-valued image regularization with PDEs: a common framework for different applications
Tschumperle, D., & Deriche, R. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.87 · Cited by 671
Cross-Based Local Stereo Matching Using Orthogonal Integral Images
Zhang, K., Lu, J., & Lafruit, G. (2009) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2009.2020478 · Cited by 503
Motion Detail Preserving Optical Flow Estimation
Xu, L., Jia, J., & Matsushita, Y. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.236 · Cited by 493
A perceptually motivated online benchmark for image matting
Rhemann, C., Rother, C., Wang, J., Gelautz, M., Kohli, P., & Rott, P. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206503 · Cited by 367
Self-citationHumanEva: Synchronized video and Motion Capture Dataset for Evaluation of Articulated Human Motion
Sigal, L., Bălan, A. O., & Black, M. J. (2006) · Cited by 356
Non-Linear Gaussian Filters Performing Edge Preserving Diffusion
Aurich, V., & Weule, J. (1995) · Informatik aktuell · doi:10.1007/978-3-642-79980-8_63 · Cited by 299
Stereo Correspondence by Dynamic Programming on a Tree
Veksler, O. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.334 · Cited by 295
GeoS: Geodesic Image Segmentation
Criminisi, A., Sharp, T., & Blake, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88682-2_9 · Cited by 277
Local stereo matching using geodesic support weights
Hosni, A., Bleyer, M., Gelautz, M., & Rhemann, C. (2009) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2009.5414478 · Cited by 233
Self-citationBilateral Filtering-Based Optical Flow Estimation with Occlusion Detection
Xiao, J., Cheng, H., Sawhney, H., Rao, C., & Isnardi, M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11744023_17 · Cited by 229
Real-Time Spatiotemporal Stereo Matching Using the Dual-Cross-Bilateral Grid
Richardt, C., Orr, D., Davies, I., Criminisi, A., & Dodgson, N. A. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15558-1_37 · Cited by 223
Motion estimation with non-local total variation regularization
Werlberger, M., Pock, T., & Bischof, H. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539945 · Cited by 216
Classification and evaluation of cost aggregation methods for stereo correspondence
Tombari, F., Mattoccia, S., Di Stefano, L., & Addimanda, E. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587677 · Cited by 212
A fast stereo matching algorithm suitable for embedded real-time systems
Humenberger, M., Zinner, C., Weber, M., Kubinger, W., & Vincze, M. (2010) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2010.03.012 · Cited by 197
A Convex Formulation of Continuous Multi-label Problems
Pock, T., Schoenemann, T., Graber, G., Bischof, H., & Cremers, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88690-7_59 · Cited by 196
Motion detail preserving optical flow estimation
Xu, L., Jia, J.-Y., & Matsushita, Y. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539820 · Cited by 193
A Performance Study on Different Cost Aggregation Approaches Used in Real-Time Stereo Matching
Gong, M., Yang, R., Wang, L., & Gong, M. (2007) · International Journal of Computer Vision · doi:10.1007/s11263-006-0032-x · Cited by 178
Geodesic image and video editing
Criminisi, A., Sharp, T., Rother, C., & P'erez, P. (2010) · ACM Transactions on Graphics · doi:10.1145/1857907.1857910 · Cited by 175
Self-citationLarge displacement optical flow computation withoutwarping
Steinbrücker, F., Pock, T., & Cremers, D. (2009) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2009.5459364 · Cited by 137
De-Maeztu, L., Mattoccia, S., Villanueva, A., & Cabeza, R. (2011) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2011.6126434 · Cited by 102
Vector-valued image regularization with PDE's: a common framework for different applications
Tschumperlé, D., & Rachid Deriche, B. (2003) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2003.1211415 · Cited by 100
LogCut - Efficient Graph Cut Optimization for Markov Random Fields
Lempitsky, V., Rother, C., & Blake, A. (2007) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2007.4408907 · Cited by 96
Self-citationOptical flow estimation on coarse-to-fine region-trees using discrete optimization
Lei, C., & Yang, Y.-H. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459253 · Cited by 67 · cited 1×
“Such a model has been shown to be robust to illumination changes and is commonly used in optical flow estimation [29], [43]:”
An Experimental Comparison of Discrete and Continuous Shape Optimization Methods
Klodt, M., Schoenemann, T., Kolev, K., Schikora, M., & Cremers, D. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88682-2_26 · Cited by 66
Temporally Consistent Disparity and Optical Flow via Efficient Spatio-temporal Filtering
Hosni, A., Rhemann, C., Bleyer, M., et al. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25367-6_15 · Cited by 40
Self-citationGwosdek, P., Zimmer, H., Grewenig, S., Bruhn, A., & Weickert, J. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-35740-4_29 · Cited by 39
Optical flow estimation with adaptive convolution kernel prior on discrete framework
Lee, K. J., Kwon, D., Yun, I., & Lee, S.-U. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539953 · Cited by 32
Continuous Energy Minimization Via Repeated Binary Fusion
Trobin, W., Pock, T., Cremers, D., & Bischof, H. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88693-8_50 · Cited by 30
Joint integral histograms and its application in stereo matching
Zhang, K., Lafruit, G., Lauwereins, R., et al. (2010) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2010.5653410 · Cited by 22
Cited by
Are we ready for autonomous driving? The KITTI vision benchmark suite
Geiger, A., Lenz, P., & Urtasun, R. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6248074 · Cited by 14,897
He, K., Sun, J., & Tang, X. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.213 · Cited by 5,546
Pixelwise View Selection for Unstructured Multi-View Stereo
Schönberger, J. L., Zheng, E., Frahm, J.-M., & Pollefeys, M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46487-9_31 · Cited by 2,315
DTAM: Dense tracking and mapping in real-time
Newcombe, R. A., Lovegrove, S. J., & Davison, A. J. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126513 · Cited by 2,078
Fast Cost-Volume Filtering for Visual Correspondence and Beyond
Hosni, A., Rhemann, C., Bleyer, M., Rother, C., & Gelautz, M. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.156 · Cited by 673
Self-citation
Metadata
- Authors
- Rhemann, C., Hosni, A., Bleyer, M., Rother, C., & Gelautz, M.
- Venue
- CVPR 2011
- Publisher
- IEEE
- Published
- 2011-06
- Pages
- 3017-3024
- OpenAlex
- W1968799614
- Cited by
- 485
- References
- 45
- FWCI
- 41.61
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.