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.
Cited by 61 works. doi:10.1109/tpami.1981.4767048
Authors
References
- Digital Picture Processing
- Digital Picture Processing
- Formal Languages and their Relation to Automata
- The Illinois Pattern Recognition Computer-ILLIAC III
- Essays on cellular automata
- Basics of cellular logic with some applications in medical image processing
- Nonerasing stack automata
- On shrinking binary picture patterns
- RECOGNITION OF TOPOLOGICAL INVARIANTS BY ITERATIVE ARRAYS
- Two-dimensional formal languages and pattern recognition by cellular automata