By Topic

Scalable and efficient parallel algorithms for Euclidean distance transform on the LARPBS model

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

3 Author(s)
Ling Chen ; Dept. of Comput. Sci., Yangzhou Univ., China ; Y. Pan ; Xiao-hua Xu

A parallel algorithm for Euclidean distance transform (EDT) on linear array with reconfigurable pipeline bus system (LARPBS) is presented. For an image with n×n pixels, the algorithm can complete EDT transform in O(n log n/c(n) log d(n)) time using n·d(n)·c(n) processors, where c(n) and d(n) are parameters satisfying 1≤c(n)≤n, and 1ε, the algorithm can be completed in O(1) time using n2+ε processors. To the best of our knowledge, this is the most efficient constant-time EDT algorithm on LARPBS.

Published in:

IEEE Transactions on Parallel and Distributed Systems  (Volume:15 ,  Issue: 11 )