Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn PAMI-7, Issue 5, 1985, Pages 599-609

  Wong, Andrew K C ^a   You, Manlai ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b Mingchi Institute of Tecbnology ^*  (Taiwan)

Author keywords

Attributed graph; distance; entropy of random graph; graph; probability distribution; random graph; structural pattern recognition; synthesis of graphs; unsupervised classification

Indexed keywords

MATHEMATICAL TECHNIQUES - GRAPH THEORY; PROBABILITY;

ENTROPY; PATTERN CLASSIFICATION;

PATTERN RECOGNITION;

EID: 0021491949     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.1985.4767707     Document Type: Article

References (22)

1. [1] A. C. Shaw, “A formal picture description scheme as a basis for picture processing systems,” Inform. Contr., vol. 14, pp. 9–52, 1969.
2. [2] A. C. Shaw, “Parsing of graph-representable pictures,” J. Ass. Comput. Mach., vol. 17, pp. 453–481, 1970.
3. [3] A. C. Shaw, “Picture graphs, grammars, and parsing,” in Frontiers of Pattern Recognition, S. Watanabe, Ed. New York: Academic, 1972, pp. 491–510.
4. [4] T. Pavlidis, “Representation of figures by labeled graphs,” Pat ternRecogn., vol. 4, pp. 5–17, 1972.
5. [5] T. Pavlidis, Structural Pattern Recognition. New York: Springer-Verlag, 1977.
6. [6] T. Pavlidis, “Structural description and graph grammars,” in Pictorial Information Systems, S. K. Chang and K.-S. Fu, Eds. New York: Springer-Verlag, 1980, pp. 86–103.
7. [7] 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, pp. 757–768, 1979.
8. [8] A. Sanfeliu and K.-S. Fu, “A distance measure between attributed relational graphs for pattern recognition,” IEEE Trans. Syst. Man Cybern., vol. SMC-13, pp. 353–362, 1983.
9. [9] A. K. C. Wong and D. E. Ghahraman, “Random graphs: Structural-contextual contextual dichotomy,” IEEE Trans. Pattern Anal Machine Intell., vol. PAMI-2, pp. 341–348, 1980.
10. [10] C. Berge, Graphs and Hypergraphs. Amsterdam, The Netherlands: North-Holland, 1973.
11. [11] J. Aczel and A. Daroczy, On Measures of Information and Their Characteristics. New York: Academic, 1975.
12. [12] J. G. Kalbfleisch, Probability and Statistical Inference II. New York: Springer-Verlag.
13. [13] S. Impedovo and N. Abbattista, “Hand-written numerical recognition-The organization degree measurement,” in Proc. 1982 Int. Conf. Pattern Recogn., vol. 1, 1982, pp. 40–43.
14. [14] A. E. Masumi, “Picture analysis of graph transformation,” Ph.D. dissertation, Dep. Comput. Sci., Univ., Illinois Urbana-Cham-paign, 1973.
15. [15] K.-S. Fu, “Picture syntax,” in Pictorial Information Systems, S. K. Chang and K.-S. Fu, Eds. New York: Springer-Verlag, 1980, pp. 104–127.
16. [16] W. H. Tsai and K.-S. Fu, “Subgraph error-correcting isomorphisms for syntactic pattern recognition,” IEEE Trans. Syst. Man Cybern., vol. SMC-13, pp. 48–62, 1983.
17. [17] D. E. Ghahraman, A. K. C. Wong, and T. Au, “Graph optimal monomorphism algorithms,” IEEE Trans. Syst. Man Cybern., vol. SMC-10, no. 4, pp. 181–188, 1980.
18. [18] D. E. Ghahraman, A. K. C. Wong, and T. Au, “Graph monomorphism algorithms,” IEEE Trans. Syst. Man Cybern., vol. SMC-10, no. 4, pp. 189–196, 1980.
19. [19] L. G. Shapiro and R. M. Haralick, “Structural descriptions and inexact matching,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-3, no. 5, pp. 504–519, 1981.
20. [20] M. You, “A random graph approach to pattern recognition,” Ph.D. dissertation, Dep. Syst. Design, Univ. Waterloo, Waterloo, Ont., Canada, 1983.
21. [21] A. K. C. Wong and L. Goldfarb, “Modeling systems as multilevel hierarchical relational structures,” in Large Engineering Systems 2, G. J. Savage and P. H. Roe, Eds. Waterloo, Ont., Canada: Sanford Educational Press, 1978, pp. 37–44.
22. [22] H. Niemann, “Hierarchical graphs in pattern analysis,” in Proc. 1980 Int. Conf Pattern Recogn., 1980, pp. 213–216.