The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Computing visual correspondence with occlusions using graph cuts
Abstract
Several new algorithms for visual correspondence based on graph cuts have recently been developed. While these methods give very strong results in practice, they do not handle occlusions properly. Specifically, they treat the two input images asymmetrically, and they do not ensure that a pixel corresponds to at most one pixel in the other image. In this paper, we present a new method which properly addresses occlusions, while preserving the advantages of graph cut algorithms. We give experimental results for stereo as well as motion, which demonstrate that our method performs well both at detecting occlusions and computing disparities.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949 · cited 1×
“For example, correlation based approaches and energy minimization methods based on regularization [15] or Markov Random Fields [11] are typically formulated as labeling problems, where each pixel in one image must be assigned a disparity.”
MethodNetwork Flows: Theory, Algorithms, and Applications.
Smith, D. K., Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1994) · The Journal of the Operational Research Society · doi:10.2307/2583863 · Cited by 8,034
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 · cited 2×
“However, the methodology used by [ 22 ] to evaluate”
MethodAn 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
Self-citationFord, D. R., & Fulkerson, D. R. (1962) · Cited by 4,072
What energy functions can be minimized via graph cuts?
Kolmogorov, V., & Zabih, R. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1262177 · Cited by 3,127
Self-citationSome generalized order-disorder transformations
Potts, R. B. (1952) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100027419 · Cited by 2,122
Computational vision and regularization theory
Poggio, T., Torre, V., & Koch, C. (1985) · Nature · doi:10.1038/317314a0 · Cited by 1,412
Exact Maximum A Posteriori Estimation for Binary Images
Greig, D. M., Porteous, B. T., & Seheult, A. H. (1989) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1989.tb01764.x · Cited by 1,055
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
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
Self-citationA 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
“More recently, max-flow and graph-cut methods have been proposed to solve a special class of global optimization problems [59, 36, 18, 77, 44].”
MethodAn 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
Self-citationStereo Processing by Semiglobal Matching and Mutual Information
Hirschmuller, H. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1166 · Cited by 4,195
What energy functions can be minimized via graph cuts?
Kolmogorov, V., & Zabih, R. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1262177 · Cited by 3,127
Self-citationAccurate and Efficient Stereo Processing by Semi-Global Matching and Mutual Information
Hirschmuller, H. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.56 · Cited by 1,698
SIFT Flow: Dense Correspondence across Scenes and Its Applications
Liu, C., Yuen, J., & Torralba, A. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.147 · Cited by 1,582
End-to-End Learning of Geometry and Context for Deep Stereo Regression
Kendall, A., Martirosyan, H., Dasgupta, S., Henry, P., Kennedy, R., Bachrach, A., & Bry, A. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.17 · Cited by 1,470
Stereo matching using belief propagation
Sun, J., Zheng, N.-N., & Shum, H.-Y. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1206509 · Cited by 1,271
Advances in computational stereo
Brown, M. Z., Burschka, D., & Hager, G. D. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1217603 · Cited by 1,132
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
Self-citationLearning Conditional Random Fields for Stereo
Scharstein, D., & Pal, C. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383191 · Cited by 851
Efficient Large-Scale Stereo Matching
Geiger, A., Roser, M., & Urtasun, R. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19315-6_3 · Cited by 761
Group-Wise Correlation Stereo Network
Guo, X., Yang, K., Yang, W., Wang, X., & Li, H. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00339 · Cited by 742
Multi-camera Scene Reconstruction via Graph Cuts
Kolmogorov, V., & Zabih, R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47977-5_6 · Cited by 739
Self-citationMassively Parallel Multiview Stereopsis by Surface Normal Diffusion
Galliani, S., Lasinger, K., & Schindler, K. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.106 · Cited by 599
AANet: Adaptive Aggregation Network for Efficient Stereo Matching
Xu, H., & Zhang, J. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00203 · Cited by 583
Yang, Q., Wang, L., Yang, R., Stewenius, H., & Nister, D. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.99 · Cited by 529
Scene reconstruction from high spatio-angular resolution light fields
Kim, C., Zimmer, H., Pritch, Y., Sorkine-Hornung, A., & Gross, M. (2013) · ACM Transactions on Graphics · doi:10.1145/2461912.2461926 · Cited by 439
Optical flow modeling and computation: A survey
Fortun, D., Bouthemy, P., & Kervrann, C. (2015) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2015.02.008 · Cited by 431
Symmetric Stereo Matching for Occlusion Handling
Sun, J., Li, Y., Kang, S. B., & Shum, H.-Y. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.337 · Cited by 415
StereoNet: Guided Hierarchical Refinement for Real-Time Edge-Aware Depth Prediction
Khamis, S., Fanello, S., Rhemann, C., Kowdle, A., Valentin, J., & Izadi, S. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-01267-0_35 · Cited by 401
Feature Correspondence Via Graph Matching: Models and Global Optimization
Torresani, L., Kolmogorov, V., & Rother, C. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88688-4_44 · Cited by 388
Self-citationSoft 3D reconstruction for view synthesis
Penner, E., & Zhang, L. (2017) · ACM Transactions on Graphics · doi:10.1145/3130800.3130855 · Cited by 358
Handling occlusions in dense multi-view stereo
Kang, S. B., Szeliski, R., & Chai, J. (2005) · Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001 · doi:10.1109/cvpr.2001.990462 · Cited by 353
Segment-based stereo matching using graph cuts
Hong, L., & Chen, G. (2004) · Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. · doi:10.1109/cvpr.2004.1315016 · Cited by 329
Real-Time Plane-Sweeping Stereo with Multiple Sweeping Directions
Gallup, D., Frahm, J.-M., Mordohai, P., Yang, Q., & Pollefeys, M. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383245 · Cited by 322
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision
Boykov, Y., & Kolmogorov, V. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44745-8_24 · Cited by 320
Self-citationHITNet: Hierarchical Iterative Tile Refinement Network for Real-time Stereo Matching
Tankovich, V., Hane, C., Zhang, Y., Kowdle, A., Fanello, S., & Bouaziz, S. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.01413 · Cited by 309
Stereo Matching Using Belief Propagation
Sun, J., Shum, H.-Y., & Zheng, N.-N. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47967-8_34 · Cited by 296
Review of stereo vision algorithms and their suitability for resource-limited systems
Tippetts, B., Lee, D. J., Lillywhite, K., & Archibald, J. (2016) · Journal of Real-Time Image Processing · doi:10.1007/s11554-012-0313-2 · Cited by 274
Consistent Depth Maps Recovery from a Video Sequence
Zhang, G., Jia, J., Wong, T.-T., & Bao, H. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.52 · Cited by 270
Furukawa, Y., & Hernández, C. (2015) · now publishers, Inc. eBooks · doi:10.1561/9781601988379 · Cited by 268
Hierarchical Deep Stereo Matching on High-Resolution Images
Yang, G., Manela, J., Happold, M., & Ramanan, D. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00566 · Cited by 261
Fast-MVSNet: Sparse-to-Dense Multi-View Stereo With Learned Propagation and Gauss-Newton Refinement
Yu, Z., & Gao, S. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00202 · Cited by 253
Vision-based Navigation in Image-Guided Interventions
Mirota, D. J., Ishii, M., & Hager, G. D. (2011) · Annual Review of Biomedical Engineering · doi:10.1146/annurev-bioeng-071910-124757 · Cited by 137
Shao, F., Li, K., Lin, W., Jiang, G., Yu, M., & Dai, Q. (2015) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2436332 · Cited by 116
Duran, O., & Turan, B. (2022) · Measurement · doi:10.1016/j.measurement.2022.110732 · Cited by 25
Investigation on Rock Segmentation and 3D Surface Evaluation Based on Binocular Vision
Shenyang Ligong University, Gao, H., Niu, B., Chinese Academy of Sciences, Li, B., Shenyang Ligong University, Yu, Y., & Shenyang Ligong University (2010) · International Journal of Intelligent Engineering and Systems · doi:10.22266/ijies2010.0930.01 · Cited by 1
Metadata
- Authors
- Kolmogorov, V., & Zabih, R.
- Venue
- Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-13
- Volume
- 2
- Pages
- 508-515
- OpenAlex
- W2121781154
- Cited by
- 1,119
- References
- 25
- FWCI
- 22.92
- 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.