A Pixel Dissimilarity Measure That Is Insensitive to Image Sampling
IEEE Transactions on Pattern Analysis and Machine Intelligence
Robust Parameter Estimation in Computer Vision
SIAM Review
Stereo Without Epipolar Lines: A Maximum-Flow Formulation
International Journal of Computer Vision - Special issue on computer vision research at NEC Research Institute
3-D reconstruction of urban scenes from aerial stereo imagery: a focusing strategy
Computer Vision and Image Understanding
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
International Journal of Computer Vision
Detecting Binocular Half-Occlusions: Empirical Comparisons of Five Approaches
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Cooperative Algorithm for Stereo Matching and Occlusion Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Occlusions, Discontinuities, and Epipolar Lines in Stereo
ECCV '98 Proceedings of the 5th European Conference on Computer Vision-Volume I - Volume I
Stereo Matching with Segmentation-Based Cooperation
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part II
ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 4 - Volume 4
Stereo Matching Using Belief Propagation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Advances in Computational Stereo
IEEE Transactions on Pattern Analysis and Machine Intelligence
What Energy Functions Can Be Minimizedvia Graph Cuts?
IEEE Transactions on Pattern Analysis and Machine Intelligence
Symmetric Stereo Matching for Occlusion Handling
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
A Symmetric Patch-Based Correspondence Model for Occlusion Handling
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
Surfaces with occlusions from layered stereo
IEEE Transactions on Pattern Analysis and Machine Intelligence
A fast quasi-dense matching algorithm with an adaptive window
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
| Hi-index | 0.14 |
A novel patch-based correspondence model is presented in this paper. Many segment-based correspondence approaches have been proposed in recent years. Untextured pixels and boundaries of discontinuities are imposed with hard constraints by the discontinuity assumption that large disparity variation only happens at the boundaries of segments in the above approaches. Significant improvements on performance of untextured and discontinuity area have been reported. But, the performance near occlusion is not satisfactory because a segmented region in one image may be only partially visible in the other one. To solve this problem, we utilize the observation that the shared edge of a visible area and an occluded area corresponds to the discontinuity in the other image. So, the proposed model conducts color segmentation on both images first and then a segment in one image is further cut into smaller patches corresponding to the boundaries of segments in the other when it is assigned with a disparity. Different visibility of patches in one segment is allowed. The uniqueness constraint in a segment level is used to compute the occlusions. An energy minimization framework using graph-cuts is proposed to find a global optimal configuration including both disparities and occlusions. Besides, some measurements are taken to make our segment-based algorithm suffer less from violation of the discontinuity assumption. Experimental results have shown superior performance of the proposed approach, especially on occlusions, untextured areas, and near discontinuities.