106 search results - page 1 / 22 » Fast Approximate Point Set Matching for Information Retrieva... |
SOFSEM
2007
Springer
13 years 10 months ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
ECCV
2010
Springer
13 years 4 months ago
2010
Springer
This paper presents a new method for 2-D and 3-D shape retrieval based on geodesic signatures. These signatures are high dimensional statistical distributions computed by extractin...
CVPR
2004
IEEE
14 years 6 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
KDD
2000
ACM
13 years 8 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
3DOR
2008
13 years 6 months ago
2008
Shape deformations preserving the intrinsic properties of a surface are called isometries. An isometry deforms a surface without tearing or stretching it, and preserves geodesic d...