Feature matching in stereo images encouraging uniform spatial distribution

被引:31
作者
Tan, Xiao [1 ,2 ]
Sun, Changming [2 ]
Sirault, Xavier [3 ]
Furbank, Robert [3 ]
Pham, Tuan D. [4 ]
机构
[1] Univ New S Wales, Canberra, ACT 2600, Australia
[2] CSIRO Computat Informat, N Ryde, NSW 1670, Australia
[3] CSIRO Agr Flagship, Canberra, ACT 2601, Australia
[4] Univ Aizu, Aizu Res Cluster Med Engn & Informat, Fukushima 9658580, Japan
关键词
3D/stereo scene analysis; Stereo image processing; Feature correspondences;
D O I
10.1016/j.patcog.2015.02.026
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Finding feature correspondences between a pair of stereo images is a key step in computer vision for 3D reconstruction and object recognition. In practice, a larger number of correct correspondences and a higher percentage of correct matches are beneficial. Previous researches show that the spatial distribution of correspondences are also very important especially for fundamental matrix estimation. So far, no existing feature matching method considers the spatial distribution of correspondences. In our research, we develop a new algorithm to find good correspondences in all the three aspects mentioned, i.e., larger number of correspondences, higher percentage of correct correspondences, and better spatial distribution of correspondences. Our method consists of two processes: an adaptive disparity smoothing filter to remove false correspondences based on the disparities of neighboring correspondences and a matching exploration algorithm to find more correspondences according to the spatial distribution of correspondences so that the correspondences are as uniformly distributed as possible in the images. To find correspondences correctly and efficiently, we incorporate the cheirality constraint under an epipole polar transformation together with the epipolar constraint to predict the potential location of matching point. Experiments demonstrate that our method performs very well on both the number of correct correspondences and the percentage of correct correspondences; and the obtained correspondences are also well distributed over the image space. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:2530 / 2542
页数:13
相关论文
共 34 条
[1]  
[Anonymous], BMVC
[2]  
[Anonymous], P IEEE
[3]  
[Anonymous], INT C DIG IM COMP TE
[4]  
[Anonymous], 2003, Multiple view geometry in computer vision
[5]   Overall view regarding fundamental matrix estimation [J].
Armangué, X ;
Salvi, J .
IMAGE AND VISION COMPUTING, 2003, 21 (02) :205-220
[6]   SURF: Speeded up robust features [J].
Bay, Herbert ;
Tuytelaars, Tinne ;
Van Gool, Luc .
COMPUTER VISION - ECCV 2006 , PT 1, PROCEEDINGS, 2006, 3951 :404-417
[7]  
Brown M, 2003, NINTH IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION, VOLS I AND II, PROCEEDINGS, P1218
[8]   Feature Correspondence and Deformable Object Matching via Agglomerative Correspondence Clustering [J].
Cho, Minsu ;
Lee, Jungmin ;
Lee, Kyoung Mu .
2009 IEEE 12TH INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2009, :1280-1287
[9]  
FAUGERAS O, 1995, FIFTH INTERNATIONAL CONFERENCE ON COMPUTER VISION, PROCEEDINGS, P951, DOI 10.1109/ICCV.1995.466832
[10]   Good match exploration using triangle constraint [J].
Guo, Xiaojie ;
Cao, Xiaochun .
PATTERN RECOGNITION LETTERS, 2012, 33 (07) :872-881