DocumentCode
3017617
Title
Quasi-Dense Wide Baseline Matching Using Match Propagation
Author
Kannala, Juho ; Brandt, Sami S.
Author_Institution
Oulu Univ., Oulu
fYear
2007
fDate
17-22 June 2007
Firstpage
1
Lastpage
8
Abstract
In this paper we propose extensions to the match propagation algorithm which is a technique for computing quasi-dense point correspondences between two views. The extensions make the match propagation applicable for wide baseline matching, i.e., for cases where the camera pose can vary a lot between the views. Our first extension is to use a local affine model for the geometric transformation between the images. The estimate of the local transformation is obtained from affine covariant interest regions which are used as seed matches. The second extension is to use the second order intensity moments to adapt the current estimate of the local affine transformation during the propagation. This allows a single seed match to propagate into regions where the local transformation between the views differs from the initial one. The experiments with real data show that the proposed techniques improve both the quality and coverage of the quasi-dense disparity map.
Keywords
image matching; image reconstruction; image sequences; pose estimation; affine covariant interest regions; camera pose; geometric image transformation; match propagation; quasidense point correspondences; quasidense wide baseline matching; second order intensity moments; seed matches; Algorithm design and analysis; Cameras; Computer vision; Geometry; Image reconstruction; Image sequences; Layout; Machine vision; Solid modeling; Surface reconstruction;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Vision and Pattern Recognition, 2007. CVPR '07. IEEE Conference on
Conference_Location
Minneapolis, MN
ISSN
1063-6919
Print_ISBN
1-4244-1179-3
Electronic_ISBN
1063-6919
Type
conf
DOI
10.1109/CVPR.2007.383247
Filename
4270272
Link To Document