DocumentCode
3042036
Title
A fast and scalable parallel algorithms for Euclidean distance transform on LARPBS
Author
Chen, Ling ; Pan, Yi ; Xu, Xiao-Hua
Author_Institution
Dept. of Comput. Sci., Yangzhou Univ., China
fYear
2004
fDate
26-30 April 2004
Firstpage
38
Abstract
Summary form only given. A parallel algorithm for EDT transform on linear array with reconfigurable pipeline bus system (LARPBS) is presented. For an image with n×n pixels, the algorithm can complete the EDT transform in O(nlogn/(c(n)logd(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 our best knowledge, this is the most efficient constant-time EDT algorithm on LARPBS.
Keywords
computational complexity; multiprocessing systems; parallel algorithms; pipeline processing; reconfigurable architectures; Euclidean distance transform; LARPBS; constant-time EDT algorithm; linear array; parallel EDT algorithms; reconfigurable pipeline bus system; time complexity; Computer science; Contracts; Euclidean distance; High performance computing; Image processing; Optical arrays; Parallel algorithms; Phase change random access memory; Pipelines; Pixel;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International
Print_ISBN
0-7695-2132-0
Type
conf
DOI
10.1109/IPDPS.2004.1302952
Filename
1302952
Link To Document