Premium
A Fast Stereo Matching Algorithm for Sewer Inspection Robots
Author(s) -
Ahrary Alireza,
Ishikawa Masumi
Publication year - 2008
Publication title -
ieej transactions on electrical and electronic engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.254
H-Index - 30
eISSN - 1931-4981
pISSN - 1931-4973
DOI - 10.1002/tee.20297
Subject(s) - algorithm , interpolation (computer graphics) , matching (statistics) , computer science , graph , robot , cut , artificial intelligence , block (permutation group theory) , blossom algorithm , computer vision , segmentation , image (mathematics) , image segmentation , mathematics , theoretical computer science , geometry , statistics
In this paper, we present a fast stereo matching algorithm for sewer inspection robots. Conventional algorithms such as the sum of squared difference (SSD) and cross‐correlation based on segmentation, graph cuts and so on have been proposed. However, most of them are computationally expensive. In order to solve the problem, we propose a fast stereo matching algorithm using interpolation in this paper. In our algorithm, an image is initially divided into many blocks. Then, a matching measure combining SSD and the cross‐correlation is calculated only at the corner points of each block. A down sampled sewer disparity image is composed of only the corner points. Because the disparities change continuously in the sewer environment, we use the cubic interpolation for extending the down sampled sewer disparity image into a regular‐sized disparity image. The experimental results show that our algorithm outperforms the conventional algorithms in both accuracy and speed in the sewer environment. © 2008 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.