Abstract
A cellular automaton is an array of identical cells operating in parallel in a SIMD fashion. These cells may be interconnected in different ways like the two-dimensional cellular architecture. This paper is concerned with computational models and languages for iterative cellular automata for image processing applications. We present some formal models with different computational resources that can be useful for solving certain algorithmic problems. These models lead to a very readable parallel language structure that can express low-level image processing algorithms in a clear and concise way.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bertrand, G. and Leite, N. J. “Quelques Modèles d'Automates Cellulaires Pour le Traitement d'Images”, in 8 RFIA, Lyon, 1991, pp.1125–1130.
Nagao, M. and Matsuyama. “Edge Preserving Smoothing”, Computer Graphics and Image Processing 9, 1979, pp.394–407.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leite, N.J., Bertrand, G. (1992). Computational models for image processing: Towards a concise parallel language. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_511
Download citation
DOI: https://doi.org/10.1007/3-540-55895-0_511
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55895-8
Online ISBN: 978-3-540-47306-0
eBook Packages: Springer Book Archive