We proposes a parallel thinning algorithm for binary pictures. Given an N × N image including an object, our algorithm computes in O(N 2) the skeleton of ...

The general problem of pattern recognition lies in efficiently extracting some distinct features from the pattern. The object of this paper is the thinning ...

Stéphane Ubéda: Work-Optimal Thinning Algorithm On SIMD Machines. Canada-France Conference on Parallel and Distributed Computing 1994: 137-152.

We propose a parallel thinning algorithm for binary pictures. Given an N × N binary image including an object, our algorithm computes in O(N2) the skeleton ...

Get details about the chapter of Work-Optimal thinning algorithm on SIMD machines from book Parallel and Distributed Computing: Theory and Practice: Theory ...

Given an N x N binary image including an object, our algorithm computes in O(N^2) the skeleton of the object, using a pyramidal decomposition of the picture.

The same thinning algorithm has also been implemented in parallel in this work by using four subiterations and examining one type of border pixels (north, south ...

This algorithm can also be implemented in a distributed environment [66] by assigning nonoverlapping subsets of the pattern to different processors for thinning ...

Two new parallel algorithms are presented for the problem of labeling the connected components of a binary image, which is also known as the 'connected ones ...

This paper has designed a professional and practical SIMD computer mathematical model based on the SIMD physical machine model combined with the variable ...