A fast and scalable parallel algorithms for Euclidean distance transform on LARPBS

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 n^2+ε processors. To our best knowledge, this is the most efficient constant-time EDT algorithm on LARPBS.