Parallel thinning with two-subiteration algorithms
Communications of the ACM
| Hi-index | 0.02 |
Lowering operations playa key role when skeletonizing a gray-tone picture. We define ridge points in a 3x3 neighborhood, and discuss the computational advantage obtained when lowering is accomplished by parallel operations based on a non-ridge point condition rather than on a simple point condition. Two parallel algorithms are given, respectively characterized by four subiterations and two subiterations.