International Journal of Pattern Recognition and Artificial Intelligence · 1994 · 22 citations · 6 references
ComputingComputer ScienceComputational GeometryParallel AlgorithmsParallel ComputingData ParallelismGeometry ProcessingParallel ArchitecturesParallel Geometric AlgorithmsParallel Image ProcessingSkeletonization
A perfectly parallel thinning algorithm (PPTA) is proposed. It can generate perfect skeletons, which consist of end points, break points, and hole points only. Experimental results show that the proposed PPTA can also preserve image connectivity, produce thinner skeletons, and is faster than many existing thinning algorithms. For example, it is twice as fast as one of the fastest parallel thinning algorithm by Holt, Stewart, Clint and Perrorte.
6
A characterization of parallel thinning algorithms
Azriel Rosenfeld · Information and Control · 1975 · 193 citations
An improved parallel thinning algorithm
Christopher M. Holt, A L Stewart, M. Clint et al. · Communications of the ACM · 1987 · 185 citations · Full text
A fast and flexible thinning algorithm
P.S.P. Wang, Y.Y. Zhang · IEEE Transactions on Computers · 1989 · 107 citations
Azriel Rosenfeld, Larry S. Davis · IEEE Transactions on Systems Man and Cybernetics · 1976 · 54 citations