Stable Monotonic Matching for Stereoscopic Vision

  • Radim Šára
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1998)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    P. N. Belhumeur: A Bayesian approach to binocular stereopsis. Int. J. Computer Vision, 19 (1996) 237–260. 184CrossRefGoogle Scholar
  2. 2.
    Y. Boykov, O. Veksler, R. Zabih: Disparity component matching for visual correspondence. In: Proceed. Conf. Computer Vision and Pattern Recognition, (1997) 470–475. 184Google Scholar
  3. 3.
    I. J. Cox, S. L. Higorani, S. B. Rao, B. M. Maggs: A maximum likelihood stereo algorithm. Computer Vision and Image Understanding, 63 (1996) 542–567. 190CrossRefGoogle Scholar
  4. 4.
    D. Gale, L. S. Shapley: College admissions and the stability of marriage. American Mathematical Monthly, 69 (1962) 9–15. 185MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    D. Gusfield, R. W. Irving: The Stable Marriage Problem: Structure and Algorithms. The MIT Press, Cambridge, London, (1989). 185MATHGoogle Scholar
  6. 6.
    H. Ishikawa and D. Geiger. Occlusions, discontinuities, and epipolar lines in stereo. In: Proceed. European Conference on Computer Vision, vol. 1 (1998) 232–248. 184Google Scholar
  7. 7.
    S. B. Pollard, J. E. W. Mayhew, J. P. Frisby: PMF: A stereo correspondence algorithm using a disparity gradient limit. Perception, 14 (1985) 449–470. 184CrossRefGoogle Scholar
  8. 8.
    L. Robert, R. Deriche: Dense depth map reconstruction: A minimization and regularization approach which preserves discontinuities. In: Proc. Int. Conf. Image Processing, (1992) 123–127. 184Google Scholar
  9. 9.
    S. Roy, I. J. Cox: A maximum-flow formulation of the n-camera stereo correspondence problem. In: Internat. Conf. Proc. Computer Vision, (1998) 492–499. 184Google Scholar
  10. 10.
    R. Šára: The class of stable matchings for computational stereo. Research Report CTU-CMP-1999-22, Center for Machine Perception, Czech Technical University, Prague, Czech Republic, (1999). 185, 187, 1Google Scholar
  11. 11.
    R. Sedgewick: Algorithms. Addison-Wesley, 2nd edition, (1988). 187Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Radim Šára
    • 1
  1. 1.Faculty of Electrical EngineeringCenter for Machine Perception, Czech Technical UniversityPragueCzech Republic

Personalised recommendations