Parsing of Graph-Representable Pictures
- 1 July 1970
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 17 (3), 453-481
- https://doi.org/10.1145/321592.321598
Abstract
A syntax-directed picture analysis system based on a formal picture description scheme is described. The system accepts a description of a set of pictures in terms of a grammar generating strings in a picture description language; the grammar is explicitly used to direct the analysis or parse, and to control the calls on pattern classification routines for primitive picture components. Pictures are represented by directed graphs with labeled edges, where the edges denote elementary picture components and the graph connectivity mirrors the picture component connectivity; blank and don't care “patterns” allow the description of simple relations between visible patterns. The bulk of the paper is concerned with the picture parsing algorithm which is an n -dimensional analog of a classical top-down string parser, and an application of an implemented system to the analysis of spark chamber film. The potential benefits of this approach, as demonstrated by the application, include ease of implementation and modification of picture processing systems, and simplification of the pattern recognition problem by automatically taking advantage of contextual information.Keywords
This publication has 6 references indexed in Scilit:
- On the structure of anagrammatic encodingsInformation and Control, 1969
- Translator writing systemsCommunications of the ACM, 1968
- Syntax-Directed Recognition of Hand-Printed Two-Dimensional MathematicsPublished by Elsevier ,1968
- Syntax-directed interpretation of classes of picturesCommunications of the ACM, 1966
- FORTRAN IV as a syntax languageCommunications of the ACM, 1964
- Steps toward Artificial IntelligenceProceedings of the IRE, 1961