Parallel Image Processing by Memory-Augmented Cellular Automata
Charles R. Dyer, Azriel Rosenfeld · IEEE Transactions on Pattern Analysis and Machine Intelligence · 1981
This paper introduces a generalization of cellular automata in which each celi is a tape-bounded Turing machine rather than a finite-state machine. Fast algorithms are given for performing various basic image processing tasks by such automata. It is suggested that this model of parallel computation is a very suitable one for studying the advantages of parallelism in this domain.