Sciweavers

162 search results - page 2 / 33
» Structural Matching Via Optimal Basis Graphs
Sort
View
ICALP
2009
Springer
14 years 5 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
JGAA
2007
135views more  JGAA 2007»
13 years 5 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
ICPR
2002
IEEE
14 years 6 months ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang
IPMI
1999
Springer
14 years 6 months ago
Registration of Cortical Anatomical Structures via Robust 3D Point Matching
Abstract. Inter-subjectnon-rigid registration of cortical anatomical structures as seen in MR is a challenging problem. The variability of the sulcal and gyral patterns across pati...
Haili Chui, James Rambo, James S. Duncan, Robert T...
ECCV
2000
Springer
14 years 7 months ago
Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...
Alain Trouvé, Laurent Younes