Skip to main navigation Skip to search Skip to main content

Effective stereo matching using reliable points based graph cut

  • Tsinghua University

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

Abstract

In this paper, we propose an effective stereo matching algorithm using reliable points and region-based graph cut. Firstly, the initial disparity maps are calculated via local windowbased method. Secondly, the unreliable points are detected according to the DSI(Disparity Space Image) and the estimated disparity values of each unreliable point are obtained by considering its surrounding points. Then, the scheme of reliable points is introduced in region-based graph cut framework to optimize the initial result. Finally, remaining errors in the disparity results are effectively handled in a multi-step refinement process. Experiment results show that the proposed algorithm achieves a significant reduction in computation cost and guarantee high matching quality.

Original languageEnglish
Title of host publicationIEEE VCIP 2013 - 2013 IEEE International Conference on Visual Communications and Image Processing
PublisherIEEE Computer Society
ISBN (Print)9781479902903
DOIs
StatePublished - 2013
Externally publishedYes
Event2013 IEEE International Conference on Visual Communications and Image Processing, VCIP 2013 - Kuching, Sarawak, Malaysia
Duration: 17 Nov 201320 Nov 2013

Publication series

NameIEEE VCIP 2013 - 2013 IEEE International Conference on Visual Communications and Image Processing

Conference

Conference2013 IEEE International Conference on Visual Communications and Image Processing, VCIP 2013
Country/TerritoryMalaysia
CityKuching, Sarawak
Period17/11/1320/11/13

Keywords

  • disparity estimation
  • region-based graph cut
  • reliable points

Fingerprint

Dive into the research topics of 'Effective stereo matching using reliable points based graph cut'. Together they form a unique fingerprint.

Cite this