By Topic

Stereo Matching Using Sub-segmentation and Robust Higher-Order Graph Cut

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yiran Xie ; NICTA, Australian Nat. Univ., Canberra, NSW, Australia ; Nianjun Liu ; Sheng Liu ; Nick Barnes

This paper provides a novel and efficient approach to dense stereo matching. The first contribution is, rather than applying disparity distribution inside a segment as hard constraint to directly project the likelihood of corresponding candidates to each pixel individually, our method treat segmentation and corresponding disparity distribution as soft constraint, and further partition each segment to sub-over segments which effectively facilitate the assumption of the disparity consistency. The second contribution is we transform this assumption into higher-order-based potential, and it can be minimized effectively through graph cut. The third contribution is the successful combination of several known techniques as one holistic framework. Two test-beds of both Middlebury and challenging real-scene data have been evaluated, results show that it obtains the state-of-the-art results while keeping efficiency.

Published in:

Digital Image Computing Techniques and Applications (DICTA), 2011 International Conference on

Date of Conference:

6-8 Dec. 2011