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.
Large Baseline Matching of Scale Invariant Features
ODONE, FRANCESCA;VERRI, ALESSANDRO
2005-01-01
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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
