Heuristics - Based Stereo Matching
Shi Peng-Fei, Guo Yao-Zhong, Yang Xiang-Fan · 2005
This paper presents an improved stereo matching algorithm by heuristic strategy technique resulting from that the stereo matching problem can be cast as a search one. After early processing, our algorithm employs two search ways. One is intra-scanline search and the other a inter-scanline search. Both of them a can be calculated separately and treated as the problem of finding an optimal path on 2-D search graph by graph searching method with the concentration on minimizing some combination of cost of the path and effor of the search required to get the path, that is heuristic. Our algorithm hs been tested with block scences and its computational requirements have been discussed too.