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

摘要： 针对全局匹配算法复杂度太高的问题，提出了一种基于图割的快速鲁棒立体匹配算法。一方面，参考局部立体匹配算法的思想，优化图割求解中的网格图的节点和边缘个数，使得在进行图割全局优化求解时不需要遍历所有视差值，从而减少匹配时间；另一方面，用二维线性插值算法计算亚像素，提高匹配精度和算法鲁棒性。实验结果表明，该算法快速、鲁棒、准确。

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