Back to Search
Start Over
INEXACT GRAPH MATCHING USING EIGEN-SUBSPACE PROJECTION CLUSTERING.
- Source :
- International Journal of Pattern Recognition & Artificial Intelligence; May2004, Vol. 18 Issue 3, p329-354, 26p
- Publication Year :
- 2004
-
Abstract
- Graph eigenspaces have been used to encode many different properties of graphs. In this paper we explore how such methods can be used for solving inexact graph matching (the matching of sets of vertices in one graph to those in another) having the same or different numbers of vertices. In this case we explore eigen-subspace projections and vertex clustering (EPS) methods. The correspondence algorithm enables the EPC method to discover a range of correspondence relationships from one-to-one vertex matching to that of inexact (many-to-many) matching of structurally similar subgraphs based on the similarities of their vertex connectivities defined by their positions in the common subspace. Examples in shape recognition and random graphs are used to illustrate this method. [ABSTRACT FROM AUTHOR]
- Subjects :
- MATCHING theory
GRAPH theory
EIGENVECTORS
VECTOR spaces
ALGORITHMS
COMBINATORICS
Subjects
Details
- Language :
- English
- ISSN :
- 02180014
- Volume :
- 18
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- International Journal of Pattern Recognition & Artificial Intelligence
- Publication Type :
- Academic Journal
- Accession number :
- 13063900
- Full Text :
- https://doi.org/10.1142/S0218001404003186