论文信息 - Parallel Image Processing by Memory-Augmented Cellular Automata

Parallel Image Processing by Memory-Augmented Cellular Automata

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.

Azriel Rosenfeld | Charles R. Dyer

[1] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[2] S. Rao Kosaraju,et al. Fast parallel processing array algorithms for some graph problems(Preliminary Version) , 1979, STOC.

[3] W. Beyer. RECOGNITION OF TOPOLOGICAL INVARIANTS BY ITERATIVE ARRAYS , 1969 .

[4] S. Levialdi,et al. Basics of cellular logic with some applications in medical image processing , 1979, Proceedings of the IEEE.

[5] Jeffrey D. Ullman,et al. Nonerasing Stack Automata , 1967, J. Comput. Syst. Sci..

[6] Alvy Ray Smith,et al. Two-Dimensional Formal Languages and Pattern Recognition by Cellular Automata , 1971, SWAT.

[7] Luigi P. Cordella,et al. Parallel Detection of Concavities in Cellular Blobs , 1976, IEEE Transactions on Computers.

[8] Bruce H. McCormick,et al. The Illinois Pattern Recognition Computer-ILLIAC III , 1963, IEEE Trans. Electron. Comput..

[9] Arthur W. Burks,et al. Essays on cellular automata , 1970 .

[10] Stefano Levialdi,et al. On shrinking binary picture patterns , 1972, CACM.