A fast graph cut algorithm for disparity estimation

Cheng Wei Chou*, Jang Jer Tsai, Hsueh-Ming Hang, Hung Chih Lin

*Corresponding author for this work

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

1 Scopus citations

Abstract

In this paper, we propose a fast graph cut (GC) algorithm for disparity estimation. Two accelerating techniques are suggested: one is the early termination rule, and the other is prioritizing the α-β swap pair search order. Our simulations show that the proposed fast GC algorithm outperforms the original GC scheme by 210% in the average computation time while its disparity estimation quality is almost similar to that of the original GC.

Original languageEnglish
Title of host publication28th Picture Coding Symposium, PCS 2010
Pages326-329
Number of pages4
DOIs
StatePublished - 1 Dec 2010
Event28th Picture Coding Symposium, PCS 2010 - Nagoya, Japan
Duration: 8 Dec 201010 Dec 2010

Publication series

Name28th Picture Coding Symposium, PCS 2010

Conference

Conference28th Picture Coding Symposium, PCS 2010
CountryJapan
CityNagoya
Period8/12/1010/12/10

Keywords

  • Disparity estimation
  • FTV
  • Graph cut
  • Stereo correspondence

Cite this