Biography | | | Education | | | CV | | | Publications | | | Research Projects | | | Book Chapter |
| | Photo Gallery | | | Contact |

Cellular Automata in Image Processing And Geometry

Series: Emergence, Complexity and Computation, Vol. 10

Paul Rosin, Andrew Adamatzky, and Xianfang Sun

Image processing and mathematical morphology routines are naturally parallel. The
intensity of a pixel is updated depending on the intensities of its closest neighbouring
pixels. The intensities of pixels are updated simultaneously, in discrete time and by
the same rule. This is exactly how a cellular automaton works if the intensity of a
pixel is taken as the state of a cell. A cellular automaton is a regular array of locally
connected finite state machines, or cells, which take discrete states and update their
states in parallel in discrete time depending on the states of their closest neighbours.
Therefore cellular automata would be a first port of call when designing computing
paradigms, architectures and implementations aimed at solving problems of image
processing, pattern recognition and generation.

**Authors:**A. Pahlavan Tafti, H. Hassannia

**Publisher:**Springer

**Year:**2014

**ISBN:**978-3-319-06430-7