Complex Correspondences in Straight Line Stereo Matching  

作　　者：WANG Jiyang WEN Gongjian LI Deren 

机构地区：[1]ATR Key Laboratory, School of Electronic Science and Engineering, National University of Defense Technology, 109 Deya Road, Changsha 410073, China [2]State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, 129 Luoyu Road, Wuhan 430079, China

出　　处：《Geo-Spatial Information Science》2010年第2期103-110,共8页地球空间信息科学学报（英文）

基　　金：Supported by the National High Technology Research and Development Program of China(No.2006AA12Z140);the National Natural Science Foundation of China(No.60872153,No.40571103);the Advance Research Project of National University of Defense Technology

摘　　要：Partial occlusion and fragmented lines will result in the various cases of straight line correspondences, such as one-to-one, one-to-many or many-to-many ones. However, the complex correspondences, such as one-to-many and many-to-many ones, are usually ignored or cannot be established completely in the existing methods. Here, the essence of the complex correspondences will be analyzed. Based on the two characteristics of a straight line, which are introduced by regarding a straight line as a set of collinear points, the compatibility between the complex correspondences and the uniqueness constraint of point correspondence is proved and a new uniqueness constraint of correspondence for matching lines is proposed. Based on the analysis of the complex correspondences, a new concept of line feature group is defined to describe a set of integral correspondences among straight line features from different images and then a new algorithm for establishing all the correspondences completely is described simply. The experimental results with real stereo images illustrate that the complex correspondences among straight lines are actual cases and can be established effectively.Partial occlusion and fragmented lines will result in the various cases of straight line correspondences, such as one-to-one, one-to-many or many-to-many ones. However, the complex correspondences, such as one-to-many and many-to-many ones, are usually ignored or cannot be established completely in the existing methods. Here, the essence of the complex correspon- dences will be analyzed. Based on the two characteristics of a straight line, which are introduced by regarding a straight line as a set of collinear points, the compatibility between the complex correspondences and the uniqueness constraint of point correspondence is proved and a new uniqueness constraint of correspondence for matching lines is proposed. Based on the analysis of the complex correspondences, a new concept of line feature group is defined to describe a set of integral correspondences among straight line features from different images and then a new algorithm for establishing all the correspondences completely is described simply. The experimental results with real stereo images illustrate that the complex correspondences among straight lines are actual cases and can be established effectively.

关 键 词：straight line stereo matching OCCLUSION fragmentation complex correspondence uniqueness constraint feature group 

分 类 号：P231.51[天文地球—摄影测量与遥感] P208[天文地球—测绘科学与技术]