A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
International Journal of Computer Vision
Robust Computer Vision through Kernel Density Estimation
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part I
Robust analysis of feature spaces: color image segmentation
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
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
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
IEEE Transactions on Pattern Analysis and Machine Intelligence
Surfaces with occlusions from layered stereo
IEEE Transactions on Pattern Analysis and Machine Intelligence
SCoBeP: Dense image registration using sparse coding and belief propagation
Journal of Visual Communication and Image Representation
Hi-index | 0.00 |
This paper presents a region-based stereo matching algorithm which uses a new method to select the final disparity: a random process computes for each pixel different approximations of its disparity relying on a surface model with different image segmentations and each found disparity gets a vote. At last, the final disparity is selected by estimating the mode of a density function built from these votes. We also advise how to choose the different parameters. Finally, an evaluation shows that the proposed method is efficient even at sub-pixel accuracy and is competitive with the state of the art.