Fast Stereo Matching Using Reliability-Based Dynamic Programming and Consistency Constraints

  • Authors:
  • Minglun Gong;Yee-Hong Yang

  • Affiliations:
  • -;-

  • Venue:
  • ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

A method for solving binocular and multi-view stereomatching problems is presented in this paper. A weakconsistency constraint is proposed, which expresses thevisibility constraint in the image space. It can be provedthat the weak consistency constraint holds for scenes thatcan be represented by a set of 3D points. As well, alsoproposed is a new reliability measure for dynamicprogramming techniques, which evaluates the reliability ofa given match. A novel reliability-based dynamicprogramming algorithm is derived accordingly, which canselectively assign disparity values to pixels when thereliabilities of the corresponding matches exceed a giventhreshold. Consistency constraints and the new reliability-baseddynamic programming algorithm can be combinedin an iterative approach. The experimental results showthat the iterative approach can produce dense (60~90%)and reliable (total error rate of 0.1~1.1%) matching forbinocular stereo datasets. It can also generate promisingdisparity maps for trinocular and multi-view stereodatasets.