O'Donoghue, Diarmuid and Mullally, Emma-Claire (2007) Extending Irregular Cellular Automata with Geometric Proportional Analogies. In: Proceedings of the Geographical Information Science Research UK Conference, 11th - 13th April 2007, NUI Maynooth, Ireland .

Download (308kB)

Abstract

We exploit the similarity between irregular Cellular Automata (CA) and Geometric Proportional Analogies (GPA), as both involve manipulations of geometric objects (points, lines and polygons). We describe how each GPA effectively defines a CA-like transition rule and we adapt an algorithm (called Structure Matching) used for solving GPAs to solving CAs. Irregular CAs improve on regular CAs by allowing an irregular tessellation of the plane, while further extensions support transition rules that lie beyond the scope of traditional CA. We describe three facets of the resulting model; layered inferences, incremental structures and the merge operation. Examples describe how structure matching (Mullally et al, 2005) is used to update and enhance a topographic land-cover map.

Item Type:	Conference or Workshop Item (Paper)
Keywords:	Regular cellular automata; Irregular cellular automata; Knowledge representation; Geometric proportional analogies; Structure matching algorithm; Extended cellular automata.
Academic Unit:	Faculty of Science and Engineering > Computer Science
Item ID:	1431
Depositing User:	Dr. Diarmuid O'Donoghue
Date Deposited:	09 Jun 2009 16:46
Refereed:	Yes
URI:	Organisation
Use Licence:	This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here

Repository Staff Only(login required)

Item control page

Downloads

Origin of downloads