Abstract
The problem of feature points matching between pair of views of the scene is one of the key problems in computer vision, because of the number of applications, In this paper we discuss an alternative version of an SVD matching algorithm earlier proposed in the literature. In the version proposed the original algorithm has been modified for coping with large baselines, The claim of improved performances for larger baselines is supported by experimental evidence. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Delponte, E., Isgró, F., Odone, F., & Verri, A. (2005). Large baseline matching of scale invariant features. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3617 LNCS, pp. 794–801). https://doi.org/10.1007/11553595_97
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
