An eigenspace projection clustering method for inexact graph matching.
other
Where this comes from
- Record sourced from PubMed, PMID 15382655.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
In this paper, we show how inexact graph matching (that is, the correspondence between sets of vertices of pairs of graphs) can be solved using the renormalization of projections of the vertices (as defined in this case by their connectivities) into the joint eigenspace of a pair of graphs and a form of relational clustering. An important feature of this eigenspace renormalization projection clustering (EPC) method is its ability to match graphs with different number of vertices. Shock graph-based shape matching is used to illustrate the model and a more objective method for evaluating the approach using random graphs is explored with encouraging results.
Medical subject headings
- Algorithms
- Artificial Intelligence
- Cluster Analysis
- Image Interpretation, Computer-Assisted
- Information Storage and Retrieval
- Pattern Recognition, Automated
- Subtraction Technique