A parallel thinning algorithm using the bounding boxes techniques
S Ubeda - International journal of pattern recognition and artificial …, 1993 - World Scientific
S Ubeda
International journal of pattern recognition and artificial intelligence, 1993•World ScientificThinning algorithms are widely used in pattern recognition. This processing stage is
implemented on serial machines as well as on parallel machines. We can find two classes of
thinning algorithms in the literature. The first class is composed of strongly sequential
algorithms, based on contour tracing of the objects to be thinned. The second class is made
of iterative processes in which fully parallel mask-based operators are used at each
iteration. The weakness of the contour tracing based methods is its strong dependence upon …
implemented on serial machines as well as on parallel machines. We can find two classes of
thinning algorithms in the literature. The first class is composed of strongly sequential
algorithms, based on contour tracing of the objects to be thinned. The second class is made
of iterative processes in which fully parallel mask-based operators are used at each
iteration. The weakness of the contour tracing based methods is its strong dependence upon …
Thinning algorithms are widely used in pattern recognition. This processing stage is implemented on serial machines as well as on parallel machines. We can find two classes of thinning algorithms in the literature. The first class is composed of strongly sequential algorithms, based on contour tracing of the objects to be thinned. The second class is made of iterative processes in which fully parallel mask-based operators are used at each iteration.
The weakness of the contour tracing based methods is its strong dependence upon the original picture. Particularly, in the case of very complex pictures, this algorithm becomes inefficient.
The second thinning class of algorithms uses strongly regular operating processes. The general speed of those methods also depends upon the shapes to be thinned. The iteration number necessary to complete these iterative processes is proportional to the maximum thickness of the objects in the picture. The complexity of the contour of the objects does not influence the efficiency of the algorithm.
The goal of this paper is to keep the regularity of the second class of thinning processes, but to reduce the amount of standard parallel-operations. We use a partition of the original picture and we dynamically reduce the range of the full-parallel operator in its sub-picture.
World ScientificShowing the best result for this search. See all results