This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel Image Processing by Memory-Augmented Cellular Automata
January 1981 (vol. 3 no. 1)
pp. 29-41
Charles R. Dyer, MEMBER, IEEE, Computer Science Center, University of Maryland, College Park, MD 20742; Department of Information Engineering, University of Illinois, Chicago, IL 60680.
Azriel Rosenfeld, FELLOW, IEEE, Computer Science Center, University of Maryland, College Park, MD 20742.
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.
Citation:
Charles R. Dyer, Azriel Rosenfeld, "Parallel Image Processing by Memory-Augmented Cellular Automata," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 3, no. 1, pp. 29-41, Jan. 1981, doi:10.1109/TPAMI.1981.4767048
Usage of this product signifies your acceptance of the Terms of Use.