Curve based stereo matching using the minimum Hausdorff distance

Klara Kedem, Yana Yarmovski

Research output: Contribution to conferencePaperpeer-review

Abstract

A new feature-based method of stereo matching is proposed. The method matches curved segments in the images, using the minimum Hausdorff distance to find the best match for each curved segment. A neighborhood graph is used to propagate the disparity results to neighboring curved segments and to resolve ambiguous matchings. Finally, some experimental results obtained with the proposed method are presented.

Original languageEnglish
PagesC-15-C-16
StatePublished - 1 Jan 1996
EventProceedings of the 1996 12th Annual Symposium on Computational Geometry - Philadelphia, PA, USA
Duration: 24 May 199626 May 1996

Conference

ConferenceProceedings of the 1996 12th Annual Symposium on Computational Geometry
CityPhiladelphia, PA, USA
Period24/05/9626/05/96

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics

Fingerprint

Dive into the research topics of 'Curve based stereo matching using the minimum Hausdorff distance'. Together they form a unique fingerprint.

Cite this