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

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