Computing Raster Images from Grid Picture Grammars

Drewes, Frank; Ewert, Sigrid; Klempien-Hinrichs, Renate; Kreowski, Hans‐Jörg

doi:10.1007/3-540-44674-5_9

Cited by 7 publications

(7 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Grid grammars are an interesting formalism defined by Drewes [7], [8]. Grid grammars are based on an extension of quadtrees [9], in which the number of "quadrants" is not limited to four, but can be k 2 , with k ≥ 2 (thus forming a square "grid").…”

Section: Grid Grammarsmentioning

confidence: 99%

“…The first is the classical Kolam grammar type of Siromoney [22] (which, in its context-free form, is equivalent to the grammars of Matz [15]); it is less general because the right parts of grammar rules must be tiled in ways decomposable as vertical and horizontal concatenations. Three other grammar families are then shown to be less general: Průša's type [18], grid grammars [8], and context-free matrix grammars [21]. The language inclusion properties for all the above families are thus clarified.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A unifying approach to picture grammars

Pradella

Cherubini

Reghizzi

2011

Information and Computation

View full text Add to dashboard Cite

Several old and recent classes of picture grammars, that variously extend context-free\ud string grammars in two dimensions, are based on rules that rewrite arrays of pixels. Such\ud grammars can be unified and extended using an approach, whereby the right part of a\ud rule is formalized by means of a finite set of permitted tiles. We focus on a simple type of\ud tiling, named regional, and define the corresponding regional tile grammars. They include\ud both Siromoney’s (or Matz’s) Kolam grammars and their generalization by Pru˚ ša, as well as\ud Drewes’s grid grammars. Regionally defined pictures can be recognized with polynomialtime\ud complexity by an algorithm extending the CKY one for strings. Regional tile grammars\ud and languages are strictly included into our previous tile grammars and languages, and are\ud incomparable with Giammarresi–Restivo tiling systems (or Wang systems)

show abstract

Section: Grid Grammarsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A unifying approach to picture grammars

Pradella

Cherubini

Reghizzi

2011

Information and Computation

View full text Add to dashboard Cite

show abstract

“…Grid picture grammars [14], were used to produce the images in Figures 4 and 5. The images were generated in the tree based approach using a regular tree grammar, a top down tree transducer and an algebra which was used to interpret the symbols of the transducer output into pictures.…”

Section: Definition 21 (Regular Tree Grammars)mentioning

confidence: 99%

Perceptual Similarity of Images Generated using Tree Grammars

Okundaye

Ewert

Sanders

2014

Proceedings of the Southern African Institute for Computer Scientist and Information Technologists Annual Conference 2014 on SA

Self Cite

View full text Add to dashboard Cite

In this paper, we take a look at how humans determine similarity (perceptual similarity) of abstract computer generated images. To this end, an online similarity survey was conducted with respondents ordering answer images in order of similarity to question images. Since all the survey images were generated with tree grammars, the most popular measure of tree similarity, the tree edit distance, was used to compare the images. This was done in order to determine how closely tree edit distance measures model perceptual similarity. Eight different types of tree edit distance measures were used in order to cover the broad range of tree edit distance and tree edit distance approximation methods. All the tree edit distance measures were then correlated with the online similarity survey results to determine which ones more closely model perceptual similarity. The results are then analysed in the light of some modern psychological theories of perceptual similarity.

show abstract

“…Grid grammars are an interesting formalism defined by Drewes [22,23]. Grid grammars are based on an extension of quadtrees [28], in which the number of "quadrants" is not limited to four, but can be k 2 , with k ≥ 2 (thus forming a square "grid").…”

Section: Grid Grammarsmentioning

confidence: 99%