Abstract
We propose a new algorithm based on cellular automation (CA) for preservingn-connectivity,n>1. The CA algorithm transforms an initial grid configuration in a grid with same number of holes but without 1-connected components. Also, maximal thinning ofn-connected components,n>1, is achieved. The grid can be used as initial for investigating properties of initial grid. Computational performances are evaluated and measured on real cases. The obtained results indicate that the proposed approach achieves comparable complexity as standard approaches; however, the speed-up and scalability of the proposed algorithm are not limited by the number of processing nodes.
Highlights
The cellular automata (CA) can be considered as an alternative way of computation based on local data flow principles
The shrinking of binary picture patterns, which is a step towards the recognition of image objects, has been first investigated, using cellular automation (CA), by Neumann [1], Thatcher [2], and Levialdi [11]
The CA model is represented by 2-dimensional grid of square cells and each cell can exist in two different sates, white or black
Summary
The cellular automata (CA) can be considered as an alternative way of computation based on local data flow principles. The shrinking of binary picture patterns, which is a step towards the recognition of image objects, has been first investigated, using CAs, by Neumann [1], Thatcher [2], and Levialdi [11]. Parallel versions of these algorithms have been developed in [3, 12]. In this paper we propose a new algorithm for thinning of an arbitrary binary rectangular grid. The algorithm preserves 2 or more levels of connectivity of all components on the grid.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
