Non-parametric local transforms for computing visual correspondence
ECCV '94 Proceedings of the third European conference on Computer Vision (Vol. II)
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
International Journal of Computer Vision
A Cooperative Algorithm for Stereo Matching and Occlusion Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multi-camera Scene Reconstruction via Graph Cuts
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Stereo Matching Using Belief Propagation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Comparison of Graph Cuts with Belief Propagation for Stereo, using Identical MRF Parameters
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
A Symmetric Patch-Based Correspondence Model for Occlusion Handling
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
Adaptive Support-Weight Approach for Correspondence Search
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient Belief Propagation for Early Vision
International Journal of Computer Vision
Segment-Based Stereo Matching Using Belief Propagation and a Self-Adapting Dissimilarity Measure
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 03
Stereo Processing by Semiglobal Matching and Mutual Information
IEEE Transactions on Pattern Analysis and Machine Intelligence
Search Space Reduction for MRF Stereo
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part I
Depth estimation using monocular and stereo cues
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Norm-product belief propagation: primal-dual message-passing for approximate inference
IEEE Transactions on Information Theory
Contour Detection and Hierarchical Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient large-scale stereo matching
ACCV'10 Proceedings of the 10th Asian conference on Computer vision - Volume Part I
A general algorithm for approximate inference and its application to hybrid bayes nets
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Scene flow estimation by growing correspondence seeds
CVPR '11 Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition
Fast cost-volume filtering for visual correspondence and beyond
CVPR '11 Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition
Distributed message passing for large scale graphical models
CVPR '11 Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition
Are we ready for autonomous driving? The KITTI vision benchmark suite
CVPR '12 Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
International Journal of Computer Vision
| Hi-index | 0.00 |
In this paper we present a novel slanted-plane model which reasons jointly about occlusion boundaries as well as depth. We formulate the problem as one of inference in a hybrid MRF composed of both continuous (i.e., slanted 3D planes) and discrete (i.e., occlusion boundaries) random variables. This allows us to define potentials encoding the ownership of the pixels that compose the boundary between segments, as well as potentials encoding which junctions are physically possible. Our approach outperforms the state-of-the-art on Middlebury high resolution imagery [1] as well as in the more challenging KITTI dataset [2], while being more efficient than existing slanted plane MRF methods, taking on average 2 minutes to perform inference on high resolution imagery.