Skip Navigation

The Computer Journal 2004 47(6):694-700; doi:10.1093/comjnl/47.6.694
© 2004 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Chen, L.
Right arrow Articles by Xu, X.-h.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Efficient Parallel Algorithms for Euclidean Distance Transform

Ling Chen1,2, Yi Pan3,*, Yixin Chen4 and Xiao-hua Xu1

1 Department of Computer Science, Yangzhou University, Yangzhou 225009, P. R. China 2 National Key Lab of Novel Software Tech, Nanjing University, Nanjing 210093, P. R. China 3 Department of Computer Science, Georgia State University, Atlanta, GA 30303, USA 4 Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA

The Euclidean distance transform (EDT) converts a binary image into one where each pixel has a value equal to its distance to the nearest foreground pixel. Two parallel algorithms for EDT on linear array with reconfigurable pipeline bus system (LARPBS) are presented. For an image with n x n pixels, the first algorithm can complete EDT in O[(log n log log n)/(log log log n)] time using n2 processors. The second algorithm can computethe EDT in O(log n log log n) time using n2/(log log n) processors.

Received 6 August 2003. Revised 11 February 2004.

* Email: pan{at}cs.gsu.edu


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.