616 search results - page 7 / 124 » Local Feature Matching Using Entropic Graphs |
CVPR
2010
IEEE
14 years 10 days ago
2010
IEEE
The design of feature spaces for local image descriptors is an important research subject in computer vision due to its applicability in several problems, such as visual classifi...
ACIVS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In the pattern recognition context, objects can be represented as graphs with attributed nodes and edges involving their relations. Consequently, matching attributed grap...
ICPR
2002
IEEE
14 years 9 months ago
2002
IEEE
APPROX
2004
Springer
14 years 1 months ago
2004
Springer
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
PAKDD
2011
ACM
12 years 10 months ago
2011
ACM
A structural similarity kernel is presented in this paper for SVM learning, especially for learning with imbalanced datasets. Kernels in SVM are usually pairwise, comparing the sim...