Please use this identifier to cite or link to this item: https://doi.org/10.1109/ICCSIT.2010.5564081
Title: A new segment-based stereo matching using graph cuts
Authors: Wang, D.
Lim, K.B. 
Keywords: Color segmentation
Disparity plane jitting
Graph cuts
Stereo matching
Issue Date: 2010
Source: Wang, D.,Lim, K.B. (2010). A new segment-based stereo matching using graph cuts. Proceedings - 2010 3rd IEEE International Conference on Computer Science and Information Technology, ICCSIT 2010 5 : 410-416. ScholarBank@NUS Repository. https://doi.org/10.1109/ICCSIT.2010.5564081
Abstract: In the paper, we formulate a new energy function followed by the use of graph cuts to refine the disparity map which takes segment as node. Firstly, the robust disparity plane fitting is modeled and the method of Singular Value Decomposition (SVD) is used to solve least square. In order to ensure reliable pixel sets for the segment, we filter out outliers through three main rules, namely; cross-checking, judging reliable area and measuring the distance between previous disparity to the computed disparity plane. Secondly, we apply improve hierarchical clustering algorithm to merge neighbor. Finally, the final disparity map is obtained. Experimental results demonstrate that our approach is effective in improving the state of the art. © 2010 IEEE.
Source Title: Proceedings - 2010 3rd IEEE International Conference on Computer Science and Information Technology, ICCSIT 2010
URI: http://scholarbank.nus.edu.sg/handle/10635/73065
ISBN: 9781424455386
DOI: 10.1109/ICCSIT.2010.5564081
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

7
checked on Dec 13, 2017

Page view(s)

39
checked on Dec 16, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.