Optimal Computing the Chessboard Distance Transform on Parallel Processing Systems,

Thedistance transform(DT) is an image computation tool which can be used to extract the information about the shape and the position of the foreground pixels relative to each other. It converts a binary image into a grey-level image, where each pixel has a value corresponding to the distance to the nearest foreground pixel. The time complexity for computing the distance transform is fully dependent on the different distance metrics. Especially, the more exact the distance transform is, the worse execution time reached will be. Nowadays, quite often thousands of images are processed in a limited time. It seems quite impossible for a sequential computer to do such a computation for the distance transform in real time. In order to provide efficient distance transform computation, it is considerably desirable to develop a parallel algorithm for this operation. In this paper, based on the diagonal propagation approach, we first provide anO(N2) time sequential algorithm to compute thechessboard distance transform(CDT) of anN×Nimage, which is a DT using the chessboard distance metrics. Based on the proposed sequential algorithm, the CDT of a 2D binary image array of sizeN×Ncan be computed inO(logN) time on the EREW PRAM model usingO(N2/logN) processors,O(log logN) time on the CRCW PRAM model usingO(N2/log logN) processors, andO(logN) time on the hypercube computer usingO(N2/logN) processors. Following the mapping as proposed by Lee and Horng, the algorithm for the medial axis transform is also efficiently derived. The medial axis transform of a 2D binary image array of sizeN×Ncan be computed inO(logN) time on the EREW PRAM model usingO(N2/logN) processors,O(log logN) time on the CRCW PRAM model usingO(N2/log logN) processors, andO(logN) time on the hypercube computer usingO(N2/logN) processors. The proposed parallel algorithms are composed of a set of prefix operations. In each prefix operation phase, only increase (add-one) operation and minimum operation are employed. So, the algorithms are especially efficient in practical applications.

[1]  Ingemar Ragnemalm,et al.  Fast erosion and dilation by contour processing and thresholding of distance maps , 1992, Pattern Recognit. Lett..

[2]  G. Borgefors.  Distance transformations in arbitrary dimensions , 1984 .

[3]  Gabriella Sanniti di Baja,et al.  Ridge points in Euclidean distance maps , 1992, Pattern Recognit. Lett..

[4]  Afonso Ferreira,et al.  Parallel complexity of the medial axis computation , 1995, Proceedings., International Conference on Image Processing.

[5]  Kiriakos N. Kutulakos,et al.  Fast Computation of the Euclidian Distance Maps for Binary Images , 1992, Inf. Process. Lett..

[6]  Q. Ye.  The signed Euclidean distance transform and its applications , 1988, [1988 Proceedings] 9th International Conference on Pattern Recognition.

[7]  Otfried Schwarzkopf,et al.  Parallel computation of disease transforms , 1991 .

[8]  Shi-Jinn Horng,et al.  Parallel Computation of Exact Euclidean Distance Transform , 1996, Parallel Comput..

[9]  Toshimitsu Masuzawa,et al.  A parallel algorithm for weighted distance transforms , 1997, Proceedings 11th International Parallel Processing Symposium.

[10]  Azriel Rosenfeld,et al.  Sequential Operations in Digital Picture Processing , 1966, JACM.

[11]  P. Danielsson.  Euclidean distance mapping , 1980 .

[12]  Azriel Rosenfeld,et al.  Computation of geometric properties from the medial axis transform in (O(nlogn) time , 1986, Comput. Vis. Graph. Image Process..

[13]  Partha Pratim Das,et al.  A note on "distance transformations in arbitrary dimensions" , 1988, Comput. Vis. Graph. Image Process..

[14]  Sartaj Sahni,et al.  Serial and Parallel Algorithms for the Medial Axis Transform , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Gunilla Borgefors,et al.  Distance transformations in digital images , 1986, Comput. Vis. Graph. Image Process..

[16]  Shi-Jinn Horng,et al.  Parallel Computation of the Euclidean Distance Transform on the Mesh of Trees and the Hypercube Computer , 1997, Comput. Vis. Image Underst..

[17]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[18]  Gabriella Sanniti di Baja,et al.  Computing Voronoi diagrams in digital pictures , 1986, Pattern Recognit. Lett..

[19]  Azriel Rosenfeld,et al.  Parallel computation of geometric properties from the medial axis transform , 1988, Comput. Vis. Graph. Image Process..

[20]  Toshimitsu Masuzawa,et al.  A Simple Parallel Algorithm for the Medial Axis Transform (Special Issue on Architectures Algorithms and Networks for Massively parallel Computing) , 1996 .

[21]  Azriel Rosenfeld,et al.  Digital Picture Processing , 1976 .

[22]  Ling Chen,et al.  A Fast Algorithm for Euclidean Distance Maps of a 2-D Binary Image , 1994, Inf. Process. Lett..

[23]  D. T. Lee,et al.  Medial Axis Transformation of a Planar Shape , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[24]  Shi-Jinn Horng,et al.  The chessboard distance transform and the medial axis transform are interchangeable , 1996, Proceedings of International Conference on Parallel Processing.

[25]  Akihiro Fujiwara,et al.  A simple parallel algorithm for the medial axis transform of binary images , 1996, Proceedings of 1996 IEEE Second International Conference on Algorithms and Architectures for Parallel Processing, ICA/sup 3/PP '96.

[26]  Sartaj Sahni,et al.  Odd Even Shifts in SIMD Hypercubes , 1990, IEEE Trans. Parallel Distributed Syst..

[27]  Toshimitsu Masuzawa,et al.  An Optimal Parallel Algorithm for the Euclidean Distance Maps of 2-D Binary Images , 1995, Inf. Process. Lett..

[28]  Richard Cole,et al.  Faster Optimal Parallel Prefix Sums and List Ranking , 2011, Inf. Comput..

[29]  Tomio Hirata,et al.  A Unified Linear-Time Algorithm for Computing Distance Maps , 1996, Inf. Process. Lett..

[30]  Shi-Jinn Horng,et al.  Fast parallel chessboard distance transform algorithms , 1996, Proceedings of 1996 International Conference on Parallel and Distributed Systems.

[31]  Martin A. Fischler,et al.  An iconic transform for sketch completion and shape abstraction , 1980 .

[32]  Mi Lu,et al.  Optimal Algorithms for Rectangle Problems on a Mesh-Connected Computer , 1988, J. Parallel Distributed Comput..

[33]  Uzi Vishkin,et al.  Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values , 1993, J. Algorithms.