Parsing and translation of (attributed) expansive graph languages for scene analysis

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...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1979. - 5(1983), 5 vom: 01. Mai, Seite 472-85
1. Verfasser: Shi, Q Y (VerfasserIn)
Weitere Verfasser: Fu, K S
Format: Aufsatz
Sprache:English
Veröffentlicht: 1983
Zugriff auf das übergeordnete Werk:IEEE transactions on pattern analysis and machine intelligence
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM211013900
003 DE-627
005 20231224012720.0
007 tu
008 231224s1983 xx ||||| 00| ||eng c
028 5 2 |a pubmed24n0703.xml 
035 |a (DE-627)NLM211013900 
035 |a (NLM)21869132 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Shi, Q Y  |e verfasserin  |4 aut 
245 1 0 |a Parsing and translation of (attributed) expansive graph languages for scene analysis 
264 1 |c 1983 
336 |a Text  |b txt  |2 rdacontent 
337 |a ohne Hilfsmittel zu benutzen  |b n  |2 rdamedia 
338 |a Band  |b nc  |2 rdacarrier 
500 |a Date Completed 02.10.2012 
500 |a Date Revised 12.11.2019 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a 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 
650 4 |a Journal Article 
700 1 |a Fu, K S  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on pattern analysis and machine intelligence  |d 1979  |g 5(1983), 5 vom: 01. Mai, Seite 472-85  |w (DE-627)NLM098212257  |x 1939-3539  |7 nnns 
773 1 8 |g volume:5  |g year:1983  |g number:5  |g day:01  |g month:05  |g pages:472-85 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 5  |j 1983  |e 5  |b 01  |c 05  |h 472-85