CAJ | 학술논문

针对基于图割法的立体匹配算法耗时太长的问题,提出了一种基于简化网格图的立体匹配算法.算法通过区域匹配算法得到每个像素的初始视差值,然后只保留完整网格图的部分可能的视差值,去除其余大部分的节点和边缘,建立简化的网格图.该方法大大缩减了网格图的容量,缩短匹配所用时间,并且能够选用更大的视差范围.实验证明,该算法能够得到比较理想的视差图,而且人大缩短屯体匹配所用时间.
침대기우도할법적입체필배산법모시태장적문제,제출료일충기우간화망격도적입체필배산법.산법통과구역필배산법득도매개상소적초시시차치,연후지보류완정망격도적부분가능적시차치,거제기여대부분적절점화변연,건립간화적망격도.해방법대대축감료망격도적용량,축단필배소용시간,병차능구선용경대적시차범위.실험증명,해산법능구득도비교이상적시차도,이차인대축단둔체필배소용시간.
For the problem that stereo matching methods based on graph cuts are time consuming, this paper puts forward an improved stereo matching algorithm based on reduced graphs. First, the initial disparity for each pixel can be calculated by using local matching method. Then, we keep only some potential disparity values in the complete graph, and the reduced graph will contain a reduced number of vertices and edges. Therefore the graph capacity and execution time are decreased, and a wider disparity range is obtained. At last, it is proved by experiments that this algorithm can achieve a relatively ideal disparity map and save much time in stereo matching.