|
[1] Gabriel Valiente, Algorithms on trees and graphs, New York : Springer, 2002. [2] Bruno T. Messmer and Horst Bunke, “A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 5, pp. 493-504, May 1998. [3] Josep Llado s, Enric MartõÂ, and Juan Jose Villanueva,, “Symbol Recognition by Error-Tolerant Subgraph Matching between Region Adjacency Graphs,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol.23, no. 10, pp.1137-1143, October 2001. [4] K. G. Khoo and P. N. Suganthan, “Structural Pattern Recognition Using Genetic Algorithms With Specialized Operators,” IEEE Trans. on Systems, Man, and Cybernetics—Part B, vol. 33, no. 1, pp. 156-165, Feb. 2003. [5] S.J. Dickinson, A.P. Pentland and A. Rosenfeld, “3-D shape recovery using distributed aspect matching,” IEEE Trans. Pattern Anal. Mach. Intell. vol. 14 pp. 174-198, 1992. [6] R. Horaud and T. Skordas,” Stereo correspondence through feature grouping and maximal cliques,” IEEE Trans. Pattern Anal. Mach. Intell. vol. 11, pp. 1168-1180, 1989. [7] A.C.M. Dumay, R.J. van der Geest, J.J. Gerbrands,E. Jansen and J.H.C. Reiber, “Consistent inexact graph matching applied to labeling coronary segments in arteriograms,” Proceedings of the 11th International Conference on Pattern Recognition, vol. C, pp. 439-442, 1992. [8] Michael A. van Wyk, Tariq S. Durrani, and Barend J. van Wyk , “A RKHS Interpolator-Based Graph Matching Algorithm,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 7, pp 988-995, July 2002. [9] Andrew D.J. Cross, R.C. Wilson and E.R. Hancock, “Inexact graph matching using genetic search,” Pattern Recognition, vol. 30, pp. 953-970, 1997. [10] Andrew D.J. Cross, Richard Myers, Edwin R. Hancock “Convergence of a hill-climbing genetic algorithm for graph matching,” Pattern Recognition, vol. 33, pp. 1863-1880, 2000. [11] Richard Myers and Edwin R. Hancock “Least-commitment graph matching with genetic algorithms,” Pattern Recognition, vol. 34, pp. 375-394, 2001. [12] Yuan-Kai Wang, Kuo-Chin Fan and Jorng-Tzong Horng, “Genetic-Based Search for Error-Correcting Graph Isomorphism,” IEEE Trans. Systems, Man, and Cybernetics─Part B, vol. 27, no. 4, pp. 588-597, August 1997. [13] Joshua Knowles and David Corne, “A New Evolutionary Approach to the Degree-Constrained Minimum Spanning Tree Problem,” IEEE Transaction on Evolutionary Computation, vol. 4, no.2, pp. 125-134, July 2000. [14] J.R. Ullman, ”An Algorithm for Subgraph Isomorphism,” J. Assoc. for Computing Machinery, vol. 23, no. 1, pp. 31-42, 1976. [15] F. Depiero, M. Trived, and S. Serbin, “Graph Matching Using a Direct Classification of Vertex Attendance,” Pattern Recognition, vol. 29, no. 6, pp. 1031-1048, 1996. [16] L. G. Shapiro and R. M. Haralick, “Structural description and inexact matching,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. PAMI-3, no. 5, pp. 504–519, 1981. [17] L.P. Cordella, P. Foggia, C. Sansone and M. Vento, “Performance Evaluation of the VF Graph Matching Algorithm,” Proc. 10th Int’l Conf. Image Analysis and Processing, pp. 1172-1177, Sept. 1999. [18] L.P. Cordella, P. Foggia, C. Sansone and M. Vento, “A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs,” IEEE Transactions on Pattern Analysis and Intelligence, vol. 26, no.10, pp. 1367-1372, October 2004. [19] W. H. Tsai and K. S. Fu, “Error-correcting isomorphisms of attributed relational graphs for pattern analysis,” IEEE Trans. Systems, Man, and Cybernetics, vol. SMC-9, pp. 757–768, 1979. [20] R.C. Wilson and E.R. Hancock, “Structural matching by discrete relaxation,” IEEE Trans. Pattern Anal. Mach. Intell. vol.19, pp. 634-648, 1997. [21] W.J. Christmas, J. Kittler, and M. Petrou, “Structural Matching in Computer Vision Using Probabilistic Relaxation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 8, pp. 749-764, Aug. 1995. [22] R.C. Wilson and E.R. Hancock, “A Bayesian Compatibility Model for Graph Matching,” Pattern Recognition Letters, vol. 17, pp. 263-276, 1996. [23] P.D. Simic, “Constrained Nets for Graph Matching and Other Quadratic Assignment Problems,” Neural Computation, vol. 3, pp. 268-281, 1991. [24] D.E. van den Bout and T.K. Miller, III, “Graph Partitioning Using Annealed Neural Networks,” IEEE Trans. Neural Networks, vol. 1, no. 2, pp. 192-203, 1990. [25] P. Kuner and B. Ueberreiter, “Pattern Recognition by Graph Matching: Combinatorial versus Continuous Optimization,” Int''l J. Pattern Recognition and Artificial Intelligence, vol. 2, no. 3, pp. 527-542, Sept. 1988. [26] P.N. Suganthan, E.K. Teoh, and D.P. Mital, ”Pattern Recognition by Graph Matching Using the Potts MFT Neural Networks,” Pattern Recognition, vol. 28, no. 7, pp. 997-1009, 1995. [27] P.N. Suganthan, E.K. Teoh, and D.P. Mital, “Pattern Recognition by Homomorphic Graph Matching Using Hopfield Neural Networks,” Image and Vision Computing, vol. 13, no. 1, pp. 45-60, Feb. 1995. [28] S. Kirkpatrick, C. D. Gellat, and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, pp. 671–680, 1983. [29] P.P.C. Yip and Y.H. Pao, “Combinatorial optimization with use of guided evolutionary simulated annealing,” IEEE Trans. Neural Networks, vol. 6, pp. 290-295, 1995. [30] D.S. Seong, Y.K. Choi, H.S. Kim, and K.H. Park, “An Algorithm for Optimal Isomorphism between Two Random Graphs,” Pattern Recognition Letters, vol. 15, pp. 321-327, Apr. 1994. [31] A.K.C. Wong and M. You, “Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 7, no. 5, pp. 599-609, Sept. 1985. [32] H. A. Almohamad and S. O. Duffuaa, “A Linear Programming Approach for the Weighted Graph Matching Problem,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol.15, no. 5, pp.522-525, May 1993. [33] S Umeyama, “An Eigendecomposition Approach to Weighted Graph Matching Problems,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, no. 5, pp. 695-703, Sept. 1988. [34] S. Gold and A. Rangarajan, “A Graduated Assignment Algorithm for Graph Matching,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 4, pp. 377-388, April 1996. [35] S.-Y. Ho, H.-M. Chen, S.-J. Ho and T.-K. Chen, “Design of Accurate Classifiers with a Compact Fuzzy-Rule Base Using an Evolutionary Scatter Partition of Feature Space,” IEEE Trans. Systems, Man, and Cybernetics─Part B. Aug. 2004. [36] K. Mehlhorn, Graph Algorithms and NP-Completeness. Berlin, Heidelberg: Springer-Verlag, 1984. [37] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Company, 1979. [38] P. Foggia, C. Sansone and M. Vento, “A Database of Graphs for Isomorphism and Sub-Graph Isomorphism Benchmarking,” Proceedings of the 3rd IAPR-TC15 Workshop on Graph based Representation, Italy, 2001. [39] L.P. Cordella, P. Foggia, C. Sansone, M. Vento, “Fast Graph Matching for Detecting CAD Image Components, ” 15th International Conference on Pattern Recognition, vol. 2, pp.6034, 2000.
|