Parallel Image Processing by Memory-Augmented Cellular Automata

Authors:
Charles R. Dyer;Azriel Rosenfeld
Affiliations:
MEMBER, IEEE, Computer Science Center, University of Maryland, College Park, MD 20742/ Department of Information Engineering, University of Illinois, Chicago, IL 60680.;FELLOW, IEEE, Computer Science Center, University of Maryland, College Park, MD 20742.
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1981

Citing 0
Cited 2

A fast general algorithm for extracting image features on SIMD mesh-connected computers

Pattern Recognition
Training cellular automata for image processing

SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis

Quantified Score

Hi-index	0.14

Visualization

Abstract

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.