Fast parallel algorithm for distance transform

Authors:
A. Datta;S. Soundaralakshmi
Affiliations:
Sch. of Comput. Sci. & Software Eng., Univ. of Western Australia, Perth, WA, Australia;-
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Year:
2003

Citing 0
Cited 3

Scalable and Efficient Parallel Algorithms for Euclidean Distance Transform on the LARPBS Model

IEEE Transactions on Parallel and Distributed Systems
An adaptive parallel hierarchical clustering algorithm

HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
Fast fingerprint identification for large databases

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an O((log log N)2) -time algorithm for computing the distance transform of an N × N binary image. Our algorithm is designed for the common concurrent read concurrent write parallel random access machine (CRCW PRAM) and requires O(N2+ε/log log N) processors, for any ε such that 0 2+ε/log log p for some p 2/p2)+(N/p) log log p + (log log p)2) time. This scalable algorithm is more practical since usually the number of available processors is much less than the size of the image.