An Error-Tolerant Approximate Matching Algorithm for Attributed Planar Graphs and Its Application to Fingerprint Classification

Graph edit distance is a powerful error-tolerant similarity measure for graphs. For pattern recognition problems involving large graphs, however, the high computational complexity makes it sometimes impossible to apply edit distance algorithms. In the present paper we propose an efficient algorithm for edit distance computation of planar graphs. Given graphs embedded in the plane, we iteratively match small subgraphs by locally optimizing structural correspondences. Eventually we obtain a valid edit path and hence an upper bound of the edit distance. To demonstrate the efficiency of our approach, we apply the proposed algorithm to the problem of fingerprint classification.

[1]  A. Ganson Fingerprint Classification , 1970, Nature.

[2]  Gian Luca Marcialis,et al.  Fusion of Statistical and Structural Fingerprint Classifiers , 2003, AVBPA.

[3]  Miro Kraetzl,et al.  Graph distances using graph union , 2001, Pattern Recognit. Lett..

[4]  Adnan Amin,et al.  Fingerprint classification: a review , 2004, Pattern Analysis and Applications.

[5]  Horst Bunke,et al.  On Graphs with Unique Node Labels , 2003, GbRPR.

[6]  Francisco Casacuberta,et al.  A windowed weighted approach for approximate cyclic string matching , 2002, Object recognition supported by user interaction for service robots.

[7]  Antonio Robles-Kelly,et al.  String Edit Distance, Random Walks And Graph Matching , 2002, Int. J. Pattern Recognit. Artif. Intell..

[8]  Horst Bunke,et al.  A graph distance metric based on the maximal common subgraph , 1998, Pattern Recognit. Lett..

[9]  Craig I. Watson,et al.  Neural Network Fingerprint Classification , 1994 .

[10]  Gabriel Valiente,et al.  A graph distance metric combining maximum common subgraph and minimum common supergraph , 2001, Pattern Recognit. Lett..

[11]  John E. Hopcroft,et al.  Linear time algorithm for isomorphism of planar graphs (Preliminary Report) , 1974, STOC '74.

[12]  Horst Bunke,et al.  Applications of approximate string matching to 2D shape recognition , 1993, Pattern Recognit..

[13]  Anil K. Jain,et al.  Is there any texture in the image? , 1996, Pattern Recognit..

[14]  King-Sun Fu,et al.  A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[15]  Josep Lladós,et al.  Symbol Recognition by Error-Tolerant Subgraph Matching between Region Adjacency Graphs , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Eugene M. Luks,et al.  Isomorphism of graphs of bounded valence can be tested in polynomial time , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[17]  Horst Bunke,et al.  Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom Idenfication , 2003, GbRPR.

[18]  Alessandra Lumini,et al.  Inexact graph matching for fingerprint classification , 1999 .

[19]  Anil K. Jain,et al.  A Multichannel Approach to Fingerprint Classification , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[20]  Akio Tojo,et al.  Fingerprint pattern classification , 1984, Pattern Recognit..

[21]  Andrés Marzal,et al.  Fast cyclic edit distance computation with weighted edit costs in classification , 2002, Object recognition supported by user interaction for service robots.

[22]  C. V. Kameswara Rao,et al.  Type Classification of Fingerprints: A Syntactic Approach , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[23]  Horst Bunke,et al.  A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection , 1998, IEEE Trans. Pattern Anal. Mach. Intell..