Line segment matching for 3D computer vision using a new iteration scheme |
| |
| Authors: | Sheng-Lin Chou Wen-Hsiang Tsai |
| |
| Affiliation: | (1) Institute of Computer Science and Information Engineering, Republic of China;(2) Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan 300, Republic of China;(3) Present address: Advanced Technology Center, Computer and Communication Research Laboratories, Industrial Technology Research Institute, Chutung, Hsinchu, Taiwan 310, Republic of China |
| |
| Abstract: | A new iteration scheme is proposed to solve the line segment matching problem in stereo vision analysis. A match function which directly reflects the requirements of the epipolar and disparity constraints is proposed for line segment matching. The information contained in the match function is used to determine line segment correspondences indirectly. After a match network is established according to the match function values, a new iteration algorithm is employed to tune the strengths of the match links in the match network so that the match network can converge to a stable state. No explicit compatibility coefficient need be defined for computing the support function values in the iterations, resulting in a faster computation speed than those of conventional relaxation matching techniques. The inherent anti-symmetric characteristic of relaxation matching for the image correspondence problem is also avoided naturally. The experimental results show that the proposed iteration scheme is effective and suitable for matching line segments even when images are complicated. |
| |
| Keywords: | Stereo vision analysis Line segment matching Epipolar constraint Disparity constraint At-most-one-to-one mapping |
| 本文献已被 SpringerLink 等数据库收录！ |
|
