Paper Info
Title
A direct method for estimating planar projective transform
Abstract
Estimating planar projective transform (homography) from a pair of images is a classical problem in computer vision. In this paper, we propose a novel algorithm for direct registering two point sets in R2 using projective transform without using intensity values. In this very general context, there is no easily established correspondences that can be used to estimate the projective transform, and most of the existing techniques become either inadequate or inappropriate. While the planar projective transforms form an eight-dimensional Lie group, we show that for registering 2D point sets, the search space for the homographies can be effectively reduced to a three-dimensional space. To further improve on the running time without significantly reducing the accuracy of the registration, we propose a matching cost function constructed using local polynomial moments of the point sets and a coarse to fine approach. The resulting registration algorithm has linear time complexity with respect to the number of input points. We have validated the algorithm using points sets collected from real images. Preliminary experimental results are encouraging and they show that the proposed method is both efficient and accurate.
Year
DOI
Venue
2010
10.1007/978-3-642-19309-5_21
ACCV
Keywords
Field
DocType
resulting registration algorithm,search space,input point,three-dimensional space,point set,direct method,novel algorithm,linear time complexity,classical problem,estimating planar,planar projective,lie group,three dimensional,cost function,computer vision,linear time
Direct method,Computer vision,Lie group,Polynomial,Computer science,Homography,Artificial intelligence,Direct linear transformation,Real projective line,Real image,Time complexity
Conference
Volume
ISSN
Citations 
6493
0302-9743
3
PageRank 
References 
Authors
0.36
16
3
Name
Order
Citations
PageRank
Yu-Tseh Chi1412.30
Jeffrey Ho22190101.78
Yang Ming-Hsuan315303620.69