809 search results - page 89 / 162 » Similarity, topology, and uniformity |
124
click to vote
CVPR
2012
IEEE
13 years 1 months ago
2012
IEEE
We present a new approach to matching graphs embedded in R2 or R3 . Unlike earlier methods, our approach does not rely on the similarity of local appearance features, does not req...
107
Voted
SDM
2003
SIAM
15 years 12 days ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
102
Voted
ICPR
2008
IEEE
16 years 7 days ago
2008
IEEE
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...
ICPR
2006
IEEE
16 years 4 days ago
2006
IEEE
We present a unified framework for modeling and solving invariant point pattern matching problems. Invariant features are encoded as potentials in a probabilistic graphical model....
ICPR
2006
IEEE
16 years 4 days ago
2006
IEEE
Scientists find that the human perception is based on the similarity on the manifold of data set. Isometric feature mapping (Isomap) is one of the representative techniques of man...