An eigenspace projection clustering method for inexact graph matching

作者：Caelli T^*; Kosinov S

来源：IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004, 26(4): 515-519.

DOI：10.1109/TPAMI.2004.1265866

• inexact multisubgraph matching
• eigendecom position
• eigenspace projections
• correspondence clustering
• shape matching
• random graphs

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.

• 出版日期2004-4