Sciweavers

ICPR
2000
IEEE
15 years 1 months ago
Robust Dense Matching Using Local and Global Geometric Constraints
A new robust dense matching algorithm is introduced in this paper. The algorithm starts from matching the most textured points, then a match propagation algorithm is developed wit...
Maxime Lhuillier, Long Quan
CVPR
2007
IEEE
15 years 2 months ago
Quasi-Dense Wide Baseline Matching Using Match Propagation
In this paper we propose extensions to the match propagation algorithm which is a technique for computing quasidense point correspondences between two views. The extensions make t...
Juho Kannala, Sami S. Brandt