Sciweavers

284 search results - page 1 / 57
» Attributed Graph Matching Using Local Descriptions
Sort
View
ACIVS
2009
Springer
13 years 11 months ago
Attributed Graph Matching Using Local Descriptions
Abstract. In the pattern recognition context, objects can be represented as graphs with attributed nodes and edges involving their relations. Consequently, matching attributed grap...
Salim Jouili, Ines Mili, Salvatore Tabbone
ICPR
2010
IEEE
13 years 5 months ago
A Discrete Labelling Approach to Attributed Graph Matching Using SIFT Features
Local invariant feature extraction methods are widely used for image-features matching. There exist a number of approaches aimed at the refinement of the matches between image-fe...
Gerard Sanromà, René Alquézar...
CVPR
2004
IEEE
14 years 6 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
WWW
2004
ACM
14 years 5 months ago
Semantic api matching for automatic service composition
In this paper, we address the problem of matching I/O descriptions of services to enable their automatic service composition. Specifically, we develop a method of semantic schema ...
Doina Caragea, Tanveer Fathima Syeda-Mahmood
FLAIRS
2010
13 years 7 months ago
Handling of Numeric Ranges for Graph-Based Knowledge Discovery
Nowadays, graph-based knowledge discovery algorithms do not consider numeric attributes (they are discarded in the preprocessing step, or they are treated as alphanumeric values w...
Oscar E. Romero, Jesus A. Gonzalez, Lawrence B. Ho...