Pyramidal thinning algorithm for SIMD parallel machines
| Autor: | Stéphane Ubéda |
|---|---|
| Rok vydání: | 1995 |
| Předmět: |
Computer science
Binary image ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION Parallel algorithm Parallel computing Operator (computer programming) Artificial Intelligence Signal Processing Parallel random-access machine Distributed memory Computer Vision and Pattern Recognition Pyramid (image processing) Hypercube SIMD Algorithm Software |
| Zdroj: | Pattern Recognition. 28:1993-2000 |
| ISSN: | 0031-3203 |
| DOI: | 10.1016/0031-3203(95)00037-2 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect