loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ninth IEEE International Conference on Computer Vision (ICCV'03) - Volume 1
Two-Frame Wide Baseline Matching
Nice, France
October 13-October 16
ISBN: 0-7695-1950-4
Jiangjian Xiao, University of Central Florida, Orlando
Mubarak Shah, University of Central Florida, Orlando
This paper describes a novel approach to automatically recover corresponding feature points and epipolar geometry over two wide baseline frames. Our contributions consist of several aspects: First, the use of an affine invariant feature, edge-corner, is introduced to provide a robust and consistent matching primitives. Second, based on SVD decomposition of affine matrix, the affine matching space between two corners can be approximately divided into two independent spaces by rotation angle and scaling factor. Employing this property, a two-stage affine matching algorithm is designed to obtain robust matches over two frames. Third, using the epipolar geometry estimated by these matches, more corresponding feature points are determined. Based on these robust correspondences, the fundamental matrix is refined, and a series of virtual views of the scene are synthesized. Finally, several experiments are presented to illustrate that a number of robust correspondences can be stably determined for two wide baseline images under significant camera motions with illumination changes, occlusions, and self-similarities. After testing a number of examples and comparing with the existing methods, the experimental results strongly demonstrate that our matching method outperforms the state-of-art algorithms for all of the test cases.
Citation:
Jiangjian Xiao, Mubarak Shah, "Two-Frame Wide Baseline Matching," iccv, vol. 1, pp.603, Ninth IEEE International Conference on Computer Vision (ICCV'03) - Volume 1, 2003
Usage of this product signifies your acceptance of the Terms of Use.