Parallel algorithm for quadtree medial axis transform

The quadtree medial axis transform (QMAT) representation of a binary image is a very useful scheme for computer graphics and image processing applications. We present an efficient algorithm for QMAT on the shared memory EREW-PRAM model. For an image of size n/spl times/n, using n/spl times/n processors, we compute QMAT in O(log n) time. Since image sensors provide image data as a two-dimensional array, a mesh connected computer (MCC) is a popular architecture for image processing applications. Previously known parallel algorithms for QMAT require O(log/sup 2/ n) and O(log n) time on a pyramid model, and a simulation of these two algorithms takes O(n log n) time on an MCC. However, our algorithm can be executed on an MCC in O(n) time, which is optimal for that model due to the size of its diameter.<<ETX>>

[1]  Hanan Samet,et al.  A quadtree medial axis transform , 1983, Commun. ACM.

[2]  N. P. Fan,et al.  Computing quadtree medial axis transform by a multi-layered pyramid of LISP-processor arrays , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[3]  Azriel Rosenfeld,et al.  Parallel processing of regions represented by linear quadtrees , 1988, Comput. Vis. Graph. Image Process..

[4]  Hanan Samet,et al.  The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

[5]  Afonso Ferreira,et al.  Efficient Parallel Construction and Manipulation of Quadtrees , 1991, ICPP.

[6]  Luigi Cinque,et al.  Computing shape description transforms on a multiresolution architecture , 1992, CVGIP Image Underst..

[7]  Clifford A. Shaffer,et al.  Linear time distance transforms for quadtrees , 1991, CVGIP Image Underst..

[8]  Oscar H. Ibarra,et al.  Quadtree building algorithms on an SIMD hypercube , 1992, Proceedings Sixth International Parallel Processing Symposium.