关键词: 立体匹配, 能量函数, 图割, 最大流/最小割

Abstract: As the complexity of the global match algorithm is too high, a new fast and robust stereo matching algorithm based on graph-cut is proposed. On the one hand, according to the local stereo matching algorithm, the nodes and edges in the graph-cut are reduced. It is unnecessary to traverse all parallax when getting the global optimization, so the match time is reduced. On the other hand, the 2D linear interpolation algorithm is used for calculating the sub-pixels, so the precision and robustness are improved. The experimental results demonstrate the algorithm is fast, robust and accurate.

Key words: stereo matching, energy function, graph cut, max-flow/min-cut