A partial ordering for relational graphs applicable to varying levels of detail

A method for representing graphs by grammars is described. A partial ordering is defined for the grammars and thus for the graphs. This is put forward as a step towards representing varying levels of detail in a lattice based model of matching.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Pattern recognition letters 1990, Vol.11 (5), p.305-312
1. Verfasser:	Blake, R.E.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Artificial intelligence Combination of evidence Computer science control theory systems computer vision Exact sciences and technology lattice theory Pattern recognition. Digital image processing. Computational geometry syntactic methods
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	A method for representing graphs by grammars is described. A partial ordering is defined for the grammars and thus for the graphs. This is put forward as a step towards representing varying levels of detail in a lattice based model of matching.
ISSN:	0167-8655 1872-7344
DOI:	10.1016/0167-8655(90)90039-5