478 search results - page 3 / 96 » Measuring the Similarity of Labeled Graphs |
WEA
2009
Springer
14 years 1 months ago
2009
Springer
What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer li...
IDEAL
2007
Springer
14 years 22 days ago
2007
Springer
Abstract. Tree edit distance is a conventional dissimilarity measure between labeled trees. However, tree edit distance including unit-cost edit distance contains the similarity of...
ECCV
2008
Springer
14 years 8 months ago
2008
Springer
Abstract. Shape retrieval/matching is a very important topic in computer vision. The recent progress in this domain has been mostly driven by designing smart features for providing...
CVPR
2006
IEEE
14 years 8 months ago
2006
IEEE
Multi-target tracking requires locating the targets and labeling their identities. The latter is a challenge when many targets, with indistinct appearances, frequently occlude one...
CVPR
2007
IEEE
14 years 8 months ago
2007
IEEE
We propose a family of kernels between images, defined as kernels between their respective segmentation graphs. The kernels are based on soft matching of subtree-patterns of the r...