A topological characterization of thinning
Theoretical Computer Science
Minimal Mesh Embeddings in Binary Hypercubes
IEEE Transactions on Computers
Parallel thinning with two-subiteration algorithms
Communications of the ACM
O(N) computation of projections and moments from the labeled skeleton
Computer Vision, Graphics, and Image Processing
A new thinning algorithm for gray-scale images by the relaxation technique
Pattern Recognition
Fast fully parallel thinning algorithms
CVGIP: Image Understanding
Thinning Methodologies-A Comprehensive Survey
IEEE Transactions on Pattern Analysis and Machine Intelligence
Data broadcasting in SIMD computers
IEEE Transactions on Computers
Thinning algorithms based on quadtree and octree representations
Information Sciences: an International Journal
| Hi-index | 0.01 |
We propose a parallel thinning algorithm for binary pictures. 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 behavior of this algorithm is studied considering a family of digitalization of the same object at a different level of resolution. With the Exclusive Read Exclusive Write (EREW) Parallel Random Access Machine (PRAM), our algorithm runs in O(log N) time using O(N^2/logN) processors and it is work-optimal. The same result is obtained with high-connectivity distributed memory SIMD machines having strong hypercube and pyramid. We describe the basic operator, the pyramidal algorithm and some experimental results on the SIMD MasPar parallel machine.