关键词: 立体匹配, 能量方程最小化, 全局优化, 视差空间, 最短路径

Abstract: Traditional stereo matching algorithms are to find the correspondence between left and right pixels by calculating the degree of similarity between pixels. To improve the matching accuracy, the current strategies for solving the stereo matching problems are often transformed into solving the energy equation minimization problem, and then optimize the global space. These algorithms include scanline optimization algorithm, dynamic programming algorithm, graph cut algorithm and belief propagation algorithm, but each algorithm has its own deficiencies. However, only thought from the original model, it is difficult to change their shortcomings. From the perspective of minimizing the energy equation this paper establishes a new model called the shortest path model. The energy equation will be mapped to a directed graph, and then the stereo matching problem can be solved by solving the shortest path. After describing the principle of the algorithm and steps, this paper shows the algorithm diagram from the angle of disparity space. Experiments show that the shortest path algorithm overcomes many inherent defects of the above four methods, and has higher precision and lower time complexity.

Key words: stereo matching, energy equation minimization, global optimization, disparity space, the shortest path