824 search results - page 10 / 165 » Efficient Distance Computation Between Non-Convex Objects |
ICDE
1999
IEEE
14 years 9 months ago
1999
IEEE
Clustering partitions a collection of objects into groups called clusters, such that similar objects fall into the same group. Similarity between objects is defined by a distance ...
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
ISSTA
2006
ACM
14 years 1 months ago
2006
ACM
Testing with random inputs can give surprisingly good results if the distribution of inputs is spread out evenly over the input domain; this is the intuition behind Adaptive Rando...
PAMI
2010
13 years 2 months ago
2010
The Earth Mover's Distance (EMD) is a similarity measure that captures perceptual difference between two distributions. Its computational complexity, however, prevents a direc...
CVPR
2009
IEEE
15 years 13 days ago
2009
IEEE
We propose a new approach for detecting low textured
planar objects and estimating their 3D pose. Standard
matching and pose estimation techniques often depend on
texture and fe...