A robust stereo-matching algorithm using multiple-baseline cameras

被引：0

作者：

Jeon, J ^{[1
]}

Kim, K ^{[1
]}

Kim, C ^{[1
]}

Ho, YS ^{[1
]}

机构：

[1] Kwangju Inst Sci & Technol, Kwangju 500712, South Korea

来源：

2001 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING, VOLS I AND II, CONFERENCE PROCEEDINGS | 2001年

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Calculating the distance of various points in the scene relative to the camera position is one of the important tasks in stereovision systems. A fundamental problem in stereovision is to find corresponding pixels, points, or other features in both the left and right images that are taken from stereo cameras. For precise measurement and correct matching of repetitive patterns, a multiple-baseline stereo (MBS) algorithm has been proposed. In this paper, we develop a robust multiple-baseline stereo (RMBS) algorithm to solve continuous as well as repetitive multiple local minima through an adaptive window. Experimental results with both synthetic and natural scenes demonstrate that RMBS is faster in the processing speed than MBS by 24.1%. In addition, the proposed RMBS algorithm is robust to different types of multiple local minima.

引用

页码：263 / 266

页数：4