By Topic

A parallel algorithm for weighted distance transforms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Fujiwara, A. ; Graduate Sch. of Inf. Sci., Nara Inst. of Sci. & Technol., Japan ; Inoue, I. ; Masuzawa, T. ; Fujiwara, H.

This paper presents a parallel algorithm for the weighted distance transform and the nearest feature transform of an n×n binary image. We show that the algorithm runs in O(log n) time using n2 /log n processors on the EREW PRAM and in O(log log n) time using n2/log log n processors on the common CRCW PRAM. We also show that the algorithm runs in O(n2/p2+n) time an a p×p mesh and in O (n2/p2+(n log p)/p) time on a p2 processor hypercube (for 1⩽p⩽n). The algorithm is cost optimal on the PRAMs, on the mesh (for 1⩽p⩽√n) and on the hypercube (for 1⩽p⩽n/log n). We show that the time complexity on the EREW PRAM is time optimal

Published in:

Parallel Processing Symposium, 1997. Proceedings., 11th International

Date of Conference:

1-5 Apr 1997