2012_基于近似距离序的重复模式图像匹配算法_唐俊精选.pdfVIP

34 12 Vol.34No.12 2012 12 Journal of Electronics Information Technology Dec. 2012 ( 230039) —— TP391 A 1009-5896(2012)12-3034-06 DOI: 10.3724/SP.J.1146.2012.00639 Approximate Distance Order Based Matching Algorithm for Images Containing Repetitive Patterns Tang Jun Zhou Hong-wei Liang Dong Wang Nian (Key Laboratory of Intelligent Computing Signal Processing Ministry of Education, Anhui University, Hefei 230039, China) Abstract: Due to the local ambiguities of images containing repetitive-patterns, it is difficult to match feature points reliably only by comparing similarity between local descriptors even if the disparity of viewpoint is not very large. Thus, a novel representation of geometric consistency named approximate distance order is proposed according to the space distribution of feature points. Then, an object function in hybrid form is defined by combining the matching cost of local descriptor, and the matching problem is formulated as an optimization problem with one-to-one correspondence constraints. Finally, the correspondences between feature points are obtained by maximizing the given object function via the method of probabilistic relaxation. Comparative experiments applied to various images demonstrate the algorithm is an effective approach to solving the suggested problem. Key words: Image processing; Image-matching; Repetitive pattern; Geometric consistency; Probabilistic relaxation 1 