一种基于特征编组直线与立体匹配全局算法.docVIP

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software, Vol.17, No.12, December 2006, pp.2471?2484 DOI: 10.1360/jos172471 Tel/Fax: +86-10? 2006 by Journal of Software. All rights reserved. 一种基于特征编组的直线立体匹配全局算法( 文贡坚 (国防科学技术大学 电子科学与工程学院 ATR重点实验室,湖南 长沙 410073) A Global Algorithm for Straight Line Stereo Matching Based on Feature Grouping WEN Gong-Jian (ATR Key Laboratory, School of Electronic Science and Engineering, National University of Defense Technology, Changsha 410073, China) + Corresponding author: Phn: +86-731-4576343, Fax: +86-731-2586097, E-mail: wengongjian@ Wen GJ. A global algorithm for straight line stereo matching based on feature grouping. Journal of Software, 2006,17(12):2471?2484. /1000-9825/17/2471.htm Abstract: Due to line fragmentation, occlusion and projection of conjoint coplanar space straight lines, there are many “one-to-multiple” and even “multiple-to-multiple” mappings between two features sets in the process of stereo matching, but few reliable methods exist to deal with these cases. In this paper, an algorithm based on feature grouping is proposed to solve these problems. Different from the existing approaches, feature grouping is implemented among the feature set which is composed of linear features extracted from two images, and each feature group contains its associated matching relationships. Therefore, stereo matching becomes equivalent to extracting a set of mutually compatible feature groups from the two images. Two major steps involve in the whole matching process. As much putative feature groups as possible are constructed and their match measures are computed by exploiting some viable geometric and photometric constraints, and then a subset of feature groups is searched so that the sum of the associated match measures is the maximum under the condition that any extracted linear feature at most belongs to only a selected feature group. In order to solve the integer optimization problem, a two-stage method is d