Occlusion is one of the challenging problems in stereo. In this paper, we solve the problem in a segment-based style. Both images are segmented, and we propose a novel patch-based stereo algorithm that cuts the segments of one image using the segments of the other, and handles occlusion areas in a proper way. A symmetric graph-cuts optimization framework is used to find correspondence and occlusions simultaneously. The experimental results show superior performance of the proposed algorithm, especially on occlusions, untextured areas and discontinuities.
A symmetric patch-based correspondence model for occlusion handling
Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 ; 2 ; 1316-1322 Vol. 2
2005-01-01
530199 byte
Conference paper
Electronic Resource
English
A Symmetric Patch-Based Correspondence Model for Occlusion Handling
British Library Conference Proceedings | 2005
|Symmetric stereo matching for occlusion handling
IEEE | 2005
|Appearance models for occlusion handling
British Library Online Contents | 2006
|Context-based multi-target tracking with occlusion handling
British Library Online Contents | 2016
|