We describe 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.
Two-frame wide baseline matching
2003-01-01
3976437 byte
Conference paper
Electronic Resource
English
Two-Frame Wide Baseline Matching
British Library Conference Proceedings | 2003
|British Library Conference Proceedings | 1998
|Dense matching of multiple wide-baseline views
IEEE | 2003
|Wide Baseline Matching between Unsynchronized Video Sequences
British Library Online Contents | 2006
|Wide-baseline stereo matching with line segments
IEEE | 2005
|