47 search results - page 1 / 10 » Efficient Colored Point Set Matching Under Noise |
ICCSA
2007
Springer
14 years 2 months ago
2007
Springer
ICCV
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper proposes a new affine registration algorithm
for matching two point sets in IR2 or IR3. The input point
sets are represented as probability density functions, using
e...
DAM
2011
13 years 6 months ago
2011
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
ECCV
2002
Springer
15 years 26 days ago
2002
Springer
Establishing point correspondences between images is a key step for 3D-shape computation. Nevertheless, shape extraction and point correspondence are treated, usually, as two diffe...
COMPGEOM
2008
ACM
14 years 24 days ago
2008
ACM
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...