Translator Disclaimer
25 October 2004 Solving correspondence problems with 1D signal matching
Author Affiliations +
Signal matching can be applied to many applications, such as shape matching, stereo vision, image registration, and so on. With the development of hardware, 1D signal matching can be implemented with hardware to make fast processing more feasible. This is especially important for many real-time 3D vision applications such as unmanned air vehicles and mobile robots. When lighting variance is not significant in a controlled lighting environment or when the baseline is short, images taken from two viewpoints are quite similar. It is also true for each scan line pair if the attention is drawn to 1D signal. By processing 1D signal line by line, a dense disparity map can be achieved and 3D scene can be reconstructed. In this paper, we present a robust 1D signal matching method, which combines spline representation and genetic algorithm to obtain a dense disparity map. By imposing smoothness constraint implicitly, matching parameters can be solved in terms of their spline representations by minimizing a certain cost function. Genetic algorithm can then be used to perform the optimization task. Reconstruction results of three different scene settings are shown to prove the validity of our algorithm. Due to the similarity of the problem in nature, this algorithm can be easily extended to solve image registration and motion detection problems.
© (2004) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Pengcheng Zhan, Dah-Jye Lee, and Randal Beard "Solving correspondence problems with 1D signal matching", Proc. SPIE 5608, Intelligent Robots and Computer Vision XXII: Algorithms, Techniques, and Active Vision, (25 October 2004);

Back to Top