Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11553595_97 | ICIAP |
Keywords | Field | DocType |
key problem,large baselines,feature point,improved performance,computer vision,larger baselines,experimental evidence,alternative version,scale invariant feature,original algorithm,svd matching algorithm | Scale-invariant feature transform,Computer vision,Singular value decomposition,Scale invariance,Pattern recognition,Epipolar line,Computer science,Baseline (configuration management),Invariant (mathematics),Artificial intelligence,Blossom algorithm | Conference |
Volume | ISSN | ISBN |
3617 | 0302-9743 | 3-540-28869-4 |
Citations | PageRank | References |
0 | 0.34 | 14 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Elisabetta Delponte | 1 | 50 | 4.72 |
| Francesco Isgrò | 2 | 108 | 11.35 |
| Francesca Odone | 3 | 411 | 45.90 |
| Alessandro Verri | 4 | 1754 | 190.73 |