Skip to main navigation Skip to search Skip to main content

Stereo matching with Global Edge Constraint and Graph Cuts

  • Hong Zhang
  • , Feiyang Cheng
  • , Ding Yuan
  • , Yuecheng Li
  • , Mingui Sun*
  • *Corresponding author for this work
  • Beihang University
  • University of Pittsburgh

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We propose a novel method on stereo matching based on the Global Edge Constraint (GEC) and Graph Cuts. Firstly, the GEC composed of particular image edges is employed to generate the initial disparity maps. And then the reliable disparity maps consistent with the observed data are extracted to construct the data term of the energy function. Finally, we incorporate the GEC as a soft constraint into our global optimization framework, and the optimal solution could be approximated via graph cuts. Experimental results demonstrated the good performance of our proposed approach.

Original languageEnglish
Title of host publicationICPR 2012 - 21st International Conference on Pattern Recognition
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages372-375
Number of pages4
ISBN (Print)9784990644109
StatePublished - 2012
Event21st International Conference on Pattern Recognition, ICPR 2012 - Tsukuba, Japan
Duration: 11 Nov 201215 Nov 2012

Publication series

NameProceedings - International Conference on Pattern Recognition
ISSN (Print)1051-4651

Conference

Conference21st International Conference on Pattern Recognition, ICPR 2012
Country/TerritoryJapan
CityTsukuba
Period11/11/1215/11/12

Fingerprint

Dive into the research topics of 'Stereo matching with Global Edge Constraint and Graph Cuts'. Together they form a unique fingerprint.

Cite this