Algorithms
The stable marriage problem: structure and algorithms
The stable marriage problem: structure and algorithms
A maximum likelihood stereo algorithm
Computer Vision and Image Understanding
A Bayesian approach to binocular stereopsis
International Journal of Computer Vision
Occlusions, Discontinuities, and Epipolar Lines in Stereo
ECCV '98 Proceedings of the 5th European Conference on Computer Vision-Volume I - Volume I
Disparity Component Matching for Visual Correspondence
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
| Hi-index | 0.00 |
This paper deals with stable monotonic matching (SMM), which is a generalization of stable matching that includes ordering constraint. The matching algorithm is fast, does not optimize any explicit cost functional, processes one epipolar line at a time, and requires only two parameters for disparity search range. A designed experiment demonstrates that SMM has no occluding boundary artifacts, that it detects half-occluded regions reliably even if they are wide, and that it rarely misses thin objects in the foreground, unless the ordering is violated. On the other hand, the resulting disparity map is often not dense, especially in weakly textured areas.