The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—The main result of this paper shows that the <it>block-based digital medial axis transform</it> can be computed in parallel by a constant number of calls to <it>scan</it> (parallel prefix) operations. This gives time- and/or work-optimal parallel implementations for the <it>distance-based</it> and the <it>block-based</it> medial axis transform in a wide variety of parallel architectures. Since only eight scan operations plus a dozen local operations are performed, the algorithm is very easy to program and use. The originality of our approach is the use of the notion of a derived grid and the oversampling of the image in order to reduce the computation of the block-based medial axis transform in the original grid to the much easier task of computing the distance based medial axis transform of the oversampling of the image on the derived grid.</p>
Parallel image processing, medial axis transform, parallel prefix, BSP algorithms

S. Ubéda and A. Ferreira, "Computing the Medial Axis Transform in Parallel With Eight Scan Operations," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 21, no. , pp. 277-282, 1999.
84 ms
(Ver 3.3 (11022016))