Abstract
This chapter summarizes some of the contemporary work in structural pattern analysis which uses explicit or implicit representations of structure. The two major areas described are formal relational approaches and syntactic/semantic approaches. The techniques are illustrated with examples from the literature.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abramson, N., Information Theory and Coding, McGraw-Hill: New York, 1963.
American Heritage Dictionary of the English Language, Houghton Mifflin: Boston, MA, 1971.
Bunke, H., “Attributed graph grammars and their application to schematic diagram interpretation,” IEEE Trans. RAMI, vol. PAMI-4, no. 6, pp. 574–582, 1982.
Fu, K.S., “Picture syntax,” in Pictorial Information Systems, Springer-Verlag: New York, 1980.
Fu, K.S., Syntactic Pattern Recognition and Applications, Prentice-Hall: Engelwood Cliffs, NJ, 1982.
Fu, K.S. et. al., Reprinted papers in “Special Memorial Issue for Professor King-Sun Fu,” IEEE Trans. RAMI, vol. PAMI-8, no. 3, 1986.
Fukada, H. and Kamata, K., “Inference of automata from sample set of trees,” InVl. Jour. Comput. Info. Sci., vol. 13, no. 3, pp. 177–196, 1984.
Gonzalez, R.C. and Thomason, M.G., Syntactic Pattern Recognition: An Introduction, Addison Wesley: Reading, MA, 1978.
Graph-Grammars and their Application to Computer Science, Lecture Notes in Comp. Sc., Springer-Verlag: New York, 1983.
Isenor, D.K. and Zaky, S.G., “Fingerprint identification using graph matching,” Jour. Pat. Recog., vol. 19, no. 2, pp. 113–122, 1986.
Juang, B-H., and Rabiner, L.R., “A probabilistic distance measure for hidden Markov models,” AT & T Tech. Jour., vol. 64, no. 2, pp. 391–408, 1985.
Kak, A.C., Boyer, K.L., Chen, C.H., Safranek, R.J., and Yang, H.S., “A knowledge-based robotic assembly cell,” IEEE Expert, vol. 1, no. 1, pp. 63–83, 1986.
Kreowski, H.J., “A pumping lemma for context-free graph grammars,” in Graph-Grammars and their Application to Computer Science and Biology, Lecture Notes in Comp. Sc., Springer-Verlag: New York, 1979.
Levine, B., “Derivatives of tree sets with applications to grammatical inference,” IEEE Trans. PAMI, vol. PAMI-3, no. 3, pp. 285–293,1981.
Levinson, S.E., “Structural methods in automatic speech recognition,” Proc. of the IEEE, vol. 73, no. 11, pp. 1625–1650, 1985.
McKeown, D.M., Harvey, W.A., Jr., and McDermott, J., “Rule-based interpretation of aerial imagery,” IEEE Transactions PAMI, vol. PAMI-7, no. 5, pp. 570–585, 1985.
Merelli, D., Mussio, P. and Padula, M., “An approach to the definition, description, and extraction of structures in binary images,” Comp. Vision, Graphics, and Image Proc., vol. 31, pp. 19–49, 1985.
Nagl, M., “A tutorial and bibliographical survey on graph grammars,” in Graph-Grammars and their Application to Computer Science and Biology, Lecture Notes in Comp. Sc., Springer-Verlag: New York, 1979.
Ohta, Y., and Kanada, T., “Stereo by intra- and inter-scanline search using dynamic programming,” Tech. Rept. CMU-CS-83–162, Carnegie-Mellon University, 1983.
Pavlidis, T., “Structural descriptions and graph grammars,” in Pictorial Information Systems, Springer-Verlag: New York, 1980.
Pavlidis, T., Structural Pattern Recognition, Springer-Verlag: New York, 1977. Pyster, A. and Buttleman, H.W., “Semantic-syntax-directed translation,” Inform. Contr., vol. 39, pp. 320–361, 1978.
Richetin, M. and Vernadat, F., “Efficient regular grammatical inference for pattern recognition,” Jour. Pat. Recog., vol. 17, no. 2, pp. 245–250, 1984. Sanfeliu, A. and Fu, K.S., “A distance measure between attributed relational graphs for pattern recognition,” IEEE Transactions SMC, vol. SMC-13, no. 3, pp. 353–362, 1983.
Shapiro, L.G., “A structural model of shape,” IEEE Trans. PAMI, vol. PAMI-2, no. 2, pp. 111–126, 1980.
Shapiro, L.G. and Haralick, R.M., “Organization of relational models for scene analysis,” IEEE Trans. PAMI, vol. PAMI-4, no. 6, pp. 595–602, 1982. Shapiro, L.G. and Haralick, R.M., “Structural descriptions and inexact matching,” IEEE Trans. PAMI, vol. PAMI-3, no. 5, pp. 504–519, 1981.
Thomason, M.G. and Granum, E., “Dynamic programming inference of Markov networks from finite sets of sample strings,”IEEE Trans. PAMI, in press. Thomason, M.G., Granum, E., and Blake, R.E., “Experiments in dynamic programming inference of Markov networks with strings representing speech data,” to appear in Jour. Pat. Recog.
Tsai, W.H. and Fu, K.S., “Error-correcting isomorphisms of attributed relational graphs for pattern analysis,” IEEE Trans. SMC, vol. SMC-9, pp. 757–768, 1979. Tsai, W.H. and Yu, S.S., “Attributed string matching with merging for shape recognition,”IEEE Trans. PAMI, vol. PAMI-7, no. 4, pp. 453–462, 1985.
Vilnrotter, F. M., Nevatia, R., and Price, K.E., “Structural analysis of natural textures,” IEEE Trans. PAMI, vol. PAMI-8, no. 1, pp. 76–89, 1986.
Wong, A.K.C. and You, M., “Entropy and distance of random graphs with application to structural pattern recognition,” IEEE Trans. PAMI, vol. PAMI-7, no. 5, pp. 599–609, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thomason, M.G. (1987). Structural Methods in Pattern Analysis. In: Devijver, P.A., Kittler, J. (eds) Pattern Recognition Theory and Applications. NATO ASI Series, vol 30. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83069-3_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-83069-3_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-83071-6
Online ISBN: 978-3-642-83069-3
eBook Packages: Springer Book Archive