A new algorithm for subgraph optimal isomorphism

Pattern Recognition

Volumn 31, Issue 2, 1998, Pages 205-218

  El Sonbaty, Yasser ^a   Ismail, M A ^b  

^a Egypt Mansoura University   (Egypt)

^b Alexandria University Faculty Of Science   (Egypt)

Author keywords

Decision tree; Direct transformation; Graph decomposition; Subgraph isomorphism; Weighted bipartite graph

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION THEORY; ERROR CORRECTION; GRAPH THEORY; OPTIMIZATION;

GRAPH DECOMPOSITION; SUBGRAPH ISOMORPHISM; TREE SEARCH ALGORITHMS; WEIGHTED BIPARTITE GRAPH;

ALGORITHMS;

EID: 0031994123     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(97)00041-1     Document Type: Article

References (47)

1. A. Sanfeliu and K. S. Fu, A distance between attributed relational graphs for pattern recognition, IEEE Trans. Systems, Man Cybernet., 13(3), 353-362 (1983).
2. Narsingh Deo, Graph Theory with Applications to Engineering and Computer Science, Printice-Hall, Englewood Cliffs, New Jersey (1995).
3. A. K. C. Wong, M. You and S. C. Chan, An algorithm for graph optimal monomorphism, IEEE Trans. Systems, Man Cybernet. 20(3), 628-636 (1990).
4. L. G. Shapiro and R. M. Haralick, Structural descriptions and inexact matching, Technical Report CS-79011-R, Virginia Polytechnic Institute and State University, Blacksburg, Virginia (November 1979).
5. L. Kitchen, Relaxation applied to matching quantitative relational structures, IEEE Trans. Systems Man Cybernet. 10(2), (1980).
6. L. S. Davis, Shape matching using relaxation techniques, IEEE Trans. Pattern Analysis Mach. Intell, 1, 60-72 (1979).
7. S. Z. Li, Matching: invariant to translation, rotation, and scale changes, Pattern Recognition 25, 583-594 (1992).
8. W. J. Christmas, J. Kittler and M. Petrou, Structural matching in computer vision using probabilistic relaxation, IEEE Trans. Pattern Analysis Mach. Intell. 17(8), 749-764 (1995).
9. M. Berthod, M. Kato and J. Zerubia, DPA: a deterministic approach to the MAP problem, IEEE Trans. Image Process. (1996).
10. D. E. Ghahraman, A. K. C. Wong and T. Au, Graph optimal monomorphism algorithms, IEEE Trans. Systems, Man Cybernet. 10(4), (1980).
11. W. Tsai and K. S. Fu, Subgraph error-correcting isomorphisms for syntactic pattern recognition, IEEE Trans. Systems, Man Cybernet. 13 (1), 48-62 (1983).
12. M. A. Eshera and K. S. Fu, An image understanding system using attributed symbolic representation and in-exact graph matching, Pattern Analysis Mach. Intell. 8(5), 604-617 (1986).
13. M. A. Eshera and K. S. Fu, A graph distance measure for image analysis, IEEE Tran. Systems, Man Cybernet. 14 (3), 398-408 (1984).
14. S. S. Young, P. D. Scott and N. M. Nasrabadi, Object recognition using multilayer hopfield neural networks, Proc. IEEE Conf. Comput. Vision and Pattern Recognition, PP. 417-422 (1994).
15. T. W. Chen and W. C. Lin, A neural networks approach to CSG-based 3D object recognition, IEEE Trans. Pattern Analysis Mach. Intell. 16, 719-725 (1994).
16. P. Suganthan, E. Teoh and D. Mital, Pattern recognition by graph matching using the potts MFT neural networks, Pattern Recognition, 28, 997-1009 (1995).
17. S. Gold and A. Rangarajan, A graduated assignment algorithm for graph matching, IEEE Trans. Pattern Analysis Mach. Intell. 18(4), 377-388 (1996).
18. F. Depiero, M. Trivedi and S. Serbin, Graph matching using a direct classification of node attendance, Pattern Recognition, 29(6), 1031-1048 (1996).
19. S. Umeyama, An Eigendecomposition approach to weighted graph matching problems, IEEE Trans. Pattern Analysis Mach. Intell. 10, 695-703 (1988).
20. H. A. Almohamad, A polynomial transform for matching pairs of weighted graphs, J. Appl. Math. Modeling 15 (4), (1991).
21. H. A. Almohamad and S. O. Duffuaa, A linear programming approach for the weighted graph matching problem, IEEE Trans. Pattern Analysis Mach. Intell. 15(5), (1993).
22. H. L. Bodlaender, Polynomial algorithm for graph isomorphism and chromatic index on partial K-trees, J. Algorithms 11, 631-643 (1990).
23. J. Chen, A linear time algorithm for isomorphism of graphs of bounded average genus, Technical Report 91-015, Department of Computer Science Texas A and M University, 1991.
24. H. B. Mittal, A fast backtrack algorithm for graph isomorphism, Inform. Process. Lett. 29, 105-110 (1988).
25. U. Schoning, Graph isomorphism is in the low hierarchy, J. Comput. System Sci. 37, 312-323 (1988).
26. R. C. Read and D. G. Corneil, The graph isomorphism disease, J. Graph Theory, 339-363 (1977)
27. V. G. Timkovskii, Some Recognition Problems Related to Graph Isomorphism, UDC 519.1, PP. 153-160. Plenum Press, New York, (1988).
28. A. Lowe, Three dimension object recognition from single two dimension images, Artificial Intell. 31, 335-395 (1987).
29. R. Schalkoff, Pattern Recognition: Statistical, Structural and Neural Approaches, Wiley, New York (1992).
30. A. C. Shaw, A formal picture description scheme or a basis for picture processing systems, Inform. Control. 14, 9-52 (1969).
31. A. S. Shaw, Parsing of graph-representable pictures, J. ACM, Vol. 17, 453-481 (1970).
32. N. Abe, M. Mizumoto, J. Toyoda and K. Tanaka, Web grammar and several graphs, J. Comput. Systems Sci., 7, 37-65 (1973).
33. C. R. Cook, First order graph grammars, SIAM J. Comput., 3, 90-99 (1974).
34. T. Pavlidis, Linear and context-free graph grammars, J. ACM 19, 11-22 (1972).
35. T. Pavlidis, Representation of figures by labelled graphs, Pattern Recognition, 4, 5-17 (1972).
36. E. Tanaka, Theoretical aspects of syntactic pattern recognition, Pattern Recognition, 28(7), 1053-1061 (1995).
37. Y. Kajitani and H. Sakurai, On distance of graphs denned by use of orthogonality between circuits and cutsets, Report CT-73-30, The Institute of Electrical and Communication Engineers of Japan (1973).
38. Y. Kajitani and H. Uede, On the metric space of labeled Graphs, Rep. CST-74-115, The Institute of Electrical and Communication Engineers of Japan (1975).
39. E. Tanaka, A metric on graphs and its applica ions, IEE Japan ip-77-55, 31 October (1977).
40. H. W. Kuhn, The Hungarian method for the assignment problem, Naval Res. Log. Quart. 12, 83-97 (1955).
41. R. M. Karp, An algorithm to solve the m*n assignment problem in expected time O(mn log n), Networks, 10, 143-152 (1980).
42. M. S. Hung and W. O. Rom, Solving the assignment problem by relaxation, Oper. Res. 4, 969-982 (1980).
43. S. Yamada and T. Hasai, An efficient algorithm for planner assignment problem, Int. Symp. on Circuits and Systems., pp. 284-287 (1987).
44. D. Avis, A survey of heuristics for the weighted matching problem, Networks, 13, 475-493 (1983).
45. S. Yamada and T. Hasai, An efficient algorithm for the linear assignment problem, Elect. Comm. Japan, Part 3, 73(12), 28-36 (1990).
46. A. Hsieh, K. C. Fan and T. Fan, Bipartite weighted matching for on-line handwritten chiness character recognition, Pattern Recognition 28(2), 143-151 (1995).
47. J. Stroud, Airports of the world, Putnam and Company, London (1980).