Computational geometry: an introduction
Computational geometry: an introduction
An introduction to parallel algorithms
An introduction to parallel algorithms
Serial and Parallel Algorithms for the Medial Axis Transform
IEEE Transactions on Pattern Analysis and Machine Intelligence
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
Medial axis for chamfer distances: computing look-up tables and neighbuorhoods in 2D or 3D
Pattern Recognition Letters
The Chessboard Distance Transform and the Medial Axis Transform are Interchangeable
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
An Effective Skeletonization Method Based on Adaptive Selection of Contour Points
ICITA '05 Proceedings of the Third International Conference on Information Technology and Applications (ICITA'05) Volume 2 - Volume 02
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An O(1) time algorithm for the 3D Euclidean distance transform on the CRCW PRAM model
IEEE Transactions on Parallel and Distributed Systems
3D block-based medial axis transform and chessboard distance transform based on dominance
Image and Vision Computing
Hi-index | 0.00 |
Traditionally, the block-based medial axis transform (BB-MAT) and the chessboard distance transform (CDT) were usually viewed as two completely different image computation problems, especially for three dimensional (3D) space. We achieve the computation of the 3D CDT problem by implementing the 3D BB-MAT algorithm first. For a 3D binary image of size N3, our parallel algorithm can be run in O(logN) time using N3processors on the concurrent read exclusive write (CREW) parallel random access machine (PRAM) model to solve both 3D BB-MAT and 3D CDT problems, respectively. In addition, we have implemented a message passing interface (MPI) program on an AMD Opteron Model 270 cluster system to verify the proposed parallel algorithm, since the PRAM model is not available in the real world. The experimental results show that the speedup is saturated when the number of processors used is more than four, regardless of the problem size.