Parsing and Translation of (Attributed) Expansive Graph Languages for Scene Analysis

Authors:
Q. Y. Shi;King-Sun Fu
Affiliations:
School of Electrical Engineering, Purdue University, West Lafayette, IN 47907/ Department of Mathematics, Peking University, Beijing, Peoples Republic of China.;FELLOW, IEEE, School of Electrical Engineering, Purdue University, West Lafayette, IN 47907.
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1983

Citing 0
Cited 2

A non-left-to-right, non-directional parser for ambiguous lattices

Pattern Recognition Letters
Inference of Parsable Graph Grammars for Syntactic Pattern Recognition

Fundamenta Informaticae

Quantified Score

Hi-index	0.15

Visualization

Abstract

In this paper, we suggest a class of (attributed) expansive graph grammars which generate languages contained in a graph family 驴. It turns out that by means of node renumbering using a very effi-cient algorithm, any graph in 驴 can be converted into a standard form, which enables the use of related string representation for that graph to facilitate the syntax analysis. As a consequence, the syntax analysis of (attributed) expansive graph language is very efficient and almost like the parsing of tree languages. Furthermore, a syntax-directed transla-tion can be established for mapping one (attributed) expansive graph language to another. Finally, since many relational graphs for scene analysis can be considered as belonging to these graph languages, the proposed graph grammar model appears to be quite attractive from the application point of view.