This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Computing the Medial Axis Transform in Parallel With Eight Scan Operations
March 1999 (vol. 21 no. 3)
pp. 277-282

Abstract—The main result of this paper shows that the block-based digital medial axis transform can be computed in parallel by a constant number of calls to scan (parallel prefix) operations. This gives time- and/or work-optimal parallel implementations for the distance-based and the block-based 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.

[1] G. Bertrand, "Skeleton in Derived Grids," Seventh ICPR, pp. 326-329,Montreal, 1984.
[2] G. Bitz and H.T. Kung, "Path Planning on the Warp Computer: Using a Linear Systolic Array in Dynamic Programming," Int'l J. Computer Mathematics, vol. 25, pp. 173-188, 1988.
[3] G.E. Blelloch, Synthesis of Parallel Algorithms, chapter I: Prefix Sums and Their Applications, J.H. Reif, ed., pp. 35-60. Morgan Kaufmann Pub., 1993.
[4] H. Blum, "A Transformation For Extracting New Descriptors," Symp. Models for Perception of Speech and Visual Form, MIT Press, 1964.
[5] A. Ferreira, Handbook of Parallel and Distributed Computing, chapter Parallel and Communication Algorithms for Hypercube Multiprocessors, A. Zomaya, ed. New York: McGraw-Hill, 1996.
[6] A. Ferreira, I. Guérin-Lassous, K. Marcus, and A. Rau-Chaplin, "Parallel Computation on Interval Graphs Using PC Clusters: Algorithms and Experiments," Proc. Europar'98, Lecture Notes in Computer Science,Southampton, UK, Sept. 1998. Springer Verlag.
[7] A. Ferreira and S. Ubéda, "Parallel Complexity of the Medial Axis Transform," Proc. IEEE Int'l Conf. Image Processing-ICIP'95, vol. 2, pp. 105-107,Washington D.C., Oct. 1995. IEEE Press.
[8] M.R. Garey and D.S. Johnson, Computers and Intractability.San Francisco, Calif.: W.H. Freeman, 1979.
[9] J.F. Jenq and S. Sahni, "Serial and Parallel Algorithms for Medial Axis Transform," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 14, no. 12, pp. 1,218-1,224, Dec. 1992.
[10] S.K. Kim, "Optimal Parallel Algorithms for Region Labeling and Medial Axis Transform of Binary Images," SIAM J. Discrete Mathematics, vol. 4, no. 3, pp. 385-396, 1991.
[11] U. Montanari, "A Method for Obtaining Skeletons Using a Quasi-Euclidean Distance," J. ACM, pp. 600-624, 1968.
[12] M. Lu and P. Varman, "Optimal Algorithms for Rectangle Problems on a Mesh-Connected Computer," J. Parallel Distributed Computing, vol. 5, pp. 611-622, 1988.
[13] S. Miguet and Y. Robert, "Path Planning on a Ring of Processors," Int'l J. Computer Mathematics, vol. 32, pp. 61-74, 1990.
[14] A. Montanvert, "Medial Line: Graph Representation and Shape Description," Eighth Int'l Conf. Pattern Recognition, pp. 430-432,Paris, 1986.
[15] T. Pavlidis, "A Review of Algorithms for Shape Analysis," Computer Graphics and Image Processing, vol. 7, pp. 243-258, 1978.
[16] A. Rosenfeld and A.C. Kak,Digital Picture Processing. Academic Press, 2nd ed., 1982
[17] A. Rosenfeld and J. Pfaltz,“Sequential operations in digital picture processing,” J. ACM, vol. 13, pp. 471-494, 1966.
[18] A. Rosenfeld and J.L. Pfaltz, "Computer Representation of Planar Regions by Their Skeletons," Comm. ACM, vol. 10, pp. 119-125, 1967.
[19] J. Serra, Image Analysis and Mathematical Morphology. Academy Press, 1982.
[20] A.Y. Wu, S.K. Bhaskar, and A. Rosenfeld, "Computation of Geometric Properties From the Medial Axis Transform in O(N Log N) Time," Computer Vision, Graphics and Image Processing, vol. 34, pp. 76-92, 1986.
[21] L.G. Valiant, “A Bridging Model for Parallel Computation,” Comm. ACM, vol. 33, no. 8, pp. 103-111, Aug. 1990.

Index Terms:
Parallel image processing, medial axis transform, parallel prefix, BSP algorithms
Citation:
Afonso Ferreira, Stéphane Ubéda, "Computing the Medial Axis Transform in Parallel With Eight Scan Operations," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 21, no. 3, pp. 277-282, March 1999, doi:10.1109/34.754629
Usage of this product signifies your acceptance of the Terms of Use.