Sciweavers

305 search results - page 14 / 61
» A Robust Interest Points Matching Algorithm
Sort
View
ICARCV
2008
IEEE
184views Robotics» more  ICARCV 2008»
14 years 2 months ago
Learning informative point classes for the acquisition of object model maps
—This paper proposes a set of methods for building informative and robust feature point representations, used for accurately labeling points in a 3D point cloud, based on the typ...
Radu Bogdan Rusu, Zoltan Csaba Marton, Nico Blodow...
DAGSTUHL
2006
13 years 9 months ago
Point-set algorithms for pattern discovery and pattern matching in music
An algorithm that discovers the themes, motives and other perceptually significant repeated patterns in a musical work can be used, for example, in a music information retrieval sy...
David Meredith
CVPR
2007
IEEE
14 years 10 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
ICIP
2002
IEEE
14 years 9 months ago
Fingerprint matching based on error propagation
Fingerprint matching is one of the most important modules in automatic fingerprint identification systems (AFIS). Traditional methods treat this problem as point pattern matching,...
Ying Hao, Tieniu Tan, Yunhong Wang
ECCV
2010
Springer
14 years 1 months ago
The Generalized PatchMatch Correspondence Algorithm
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...