1397 search results - page 20 / 280 » Algorithms for Proximity Problems on Colored Point Sets |
CVPR
2004
IEEE
14 years 6 days ago
2004
IEEE
In the paper, we study the problem of optimal matching of two generalized functions (distributions) via a diffeomorphic transformation of the ambient space. In the particular case...
ICCV
2009
IEEE
15 years 1 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...
PVLDB
2010
13 years 6 months ago
2010
We introduce the proximity rank join problem, where we are given a set of relations whose tuples are equipped with a score and a real-valued feature vector. Given a target feature...
TALG
2008
13 years 8 months ago
2008
Given a set of n elements, each of which is colored one of c 2 colors, we must determine an element of the plurality (most frequently occurring) color by pairwise equal/unequal co...
CVPR
1996
IEEE
14 years 10 months ago
1996
IEEE
This paper addresses the general 3-D rigid motion problem, where the point correspondences and the motion parameters between two sets of 3-D points are to be recovered. The existe...