A Graph Distance Measure for Image Analysis

IEEE Transactions on Systems, Man and Cybernetics

Volumn SMC-14, Issue 3, 1984, Pages 398-408

  Eshera, M A ^a   Fu, King Sun ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - GRAPH THEORY;

ATTRIBUTED RELATIONAL GRAPHS; COMPUTER VISION; STATE-SPACE REPRESENTATION;

IMAGE PROCESSING;

EID: 0021432552     PISSN: 00189472     EISSN: 21682909     Source Type: Journal    
DOI: 10.1109/TSMC.1984.6313232     Document Type: Article

References (20)

1. B. Carre, Graphs and Networks. Oxford: Clarendon Press, 1979.
2. J. K. Cheng, and T. S. Huang, “A subgraph isomorphism algorithm using resolution,” Patt. Recogn., vol. 13, no. 5, pp. 371–379, 1981.
3. E. V. Denardo, Dynamic Programming: Theory and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1982.
4. K. S. Fu, Syntactic Pattern Recognition and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1982.
5. K. S. Fu, “A step towards unification of syntactic and statistical pattern recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. PAMI-5, no. 2, pp. 200–205, March 1983.
6. M. R. Garey, and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Bell Telephone Laboratory, Inc., Murray Hill, NJ, 1979.
7. R. M. Haralick, and J. S. Kartus, “Arrangements, Homomorphisms, and discrete relaxation,” IEEE Trans. Syst., Man, Cybern., vol. SMC-8, pp. 600–612, Aug. 1978.
8. R. M. Haralick, and L. G. Shapiro, “The consistent labeling problem: Part I,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. PAMI-1, no. 2, pp. 173–184, Apr. 1979.
9. R. M. Haralick, and L. G. Shapiro, “ The consistent labeling problem: Part II,” IEEE Trans, on Pattern Analysis and Machine Intelligence, vol. PAMI-2, no. 3, pp. 193–203, May 1980.
10. E. Horowitz, and S. Sahni, Fundamentals of Computer Algorithms. Potomac, MD: Computer Science Press, 1978.
11. V. I. Levenshtein, “Binary codes capable of correcting deletions, insertions, and reversals,” Soviet Physics-Doklady, vol. 10, no. 8, Feb. 1965.
12. C. H. Papadimitriou, and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
13. A. Sanfeliu, “Distance between attributed relational graphs for pattern recognition,” IEEE Trans. Syst., Man, Cybern., vol. SMC-13, no. 3, May/June 1983.
14. A. Sanfeliu, “An application of a distance measure between graphs to the analysis of muscle tissue patterns,” Purdue Univ., Lafayette, IN, TR-EE, 81–15, May 1981.
15. L. G. Shapiro, and R. M. Haralick, “Structural descriptions and inexact matching,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. PAMI-3, no. 5, Sept. 1981.
16. Q. Y. Shi, and K. S. Fu, “Efficient error-correcting parsing (attributed and stochastic) tree grammars,” Inform. Sci., vol. 26, pp. 159–188, 1982.
17. Q. Y. Shi, and K. S. Fu, “Parsing and translation of (attributed) expansive graph languages for scene analysis,” IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI-5, no. 5, Sept. 1983.
18. W. H. Tsai, and K. S. Fu, “Error-correcting isomorphism of attributed relational graphs for pattern analysis,” IEEE Trans. Syst., Man, Cybern., vol. SMC-9, no. 12, Dec. 1979.
19. W. H. Tsai, and K. S. Fu, “Subgraph error-correcting isomorphism for syntactic pattern recognition,” IEEE Trans. Syst., Man, Cybern., vol. SMC-13, no. 1, Jan./Feb. 1983.
20. J. R. Ullman, “An algorithm for subgraph isomorphism,” J. ACM, vol. 23, no. 1, Jan. 1976.