Applying the Hungarian method to stereo matching

Gabriel Fielding, Moshe Kam

Research output: Contribution to journalConference articlepeer-review

12 Scopus citations


The correspondence problem in stereo vision is to calculate matches between pixels (points) or features (e.g., lines) in stereo images. The method of calculating these matches over an entire stereo image pair usually depends upon the application for which the resulting depth information will be used. Functional minimization and dynamic programming are two widely used techniques for selecting matches. We present an alternative technique based on integer-programming formulation of the correspondence problem. Computation of the disparity map is accomplished in polynomial time by casting the selection of matches along corresponding epipolar lines as the problem of finding a maximum weighted matching on bipartite graphs. This approach incorporates several desirable properties of disparity maps, including implicit occlusion estimation, preference for fronto-parallel surfaces, and improved performance in the absence of texture (when compared to non-global techniques which do not maximize over the entire epipolar line).

Original languageEnglish (US)
Pages (from-to)1928-1933
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
StatePublished - 1997
Externally publishedYes
EventProceedings of the 1997 36th IEEE Conference on Decision and Control. Part 1 (of 5) - San Diego, CA, USA
Duration: Dec 10 1997Dec 12 1997

All Science Journal Classification (ASJC) codes

  • Control and Optimization
  • Control and Systems Engineering
  • Modeling and Simulation


Dive into the research topics of 'Applying the Hungarian method to stereo matching'. Together they form a unique fingerprint.

Cite this