Fast Parallel Algorithm for Distance Transform

Amitava Datta; S. Subbiah

doi:10.1109/TSMCA.2003.809173

Fast Parallel Algorithm for Distance Transform

Amitava Datta, S. Subbiah

Research output: Contribution to journal › Article

7 Citations (Scopus)

Abstract

We present an O((log log N)2) -time algorithm for computing the distance transform of an N × N binary image. Our algorithm is designed for the common concurrent read concurrent write parallel random access machine (CRCW PRAM) and requires O(N2+&epsi;/log log N) processors, for any &epsi; such that 0 <&epsi; <1. Our algorithm is based on a novel deterministic sampling scheme and can be used for computing distance transforms for a very general class of distance functions. We also present a scalable version of our algorithm when the number of processors is available p2+&epsi;/log log p for some p <N. In this case, our algorithm runs in O((N2/p2)+(N/p) log log p + (log log p)2) time. This scalable algorithm is more practical since usually the number of available processors is much less than the size of the image.

Original language	English
Pages (from-to)	429-434
Journal	IEEE Transactions on Systems, Man and Cybernetics-Part A : Systems and Humans
Volume	33
Issue number	5
DOIs	https://doi.org/10.1109/TSMCA.2003.809173
Publication status	Published - 2003

Access to Document

10.1109/TSMCA.2003.809173

Fingerprint Dive into the research topics of 'Fast Parallel Algorithm for Distance Transform'. Together they form a unique fingerprint.

Cite this

@article{39af49ca6c8a48dc9006e7e1951e3de0,

title = "Fast Parallel Algorithm for Distance Transform",

abstract = "We present an O((log log N)2) -time algorithm for computing the distance transform of an N × N binary image. Our algorithm is designed for the common concurrent read concurrent write parallel random access machine (CRCW PRAM) and requires O(N2+&epsi;/log log N) processors, for any &epsi; such that 0 <&epsi; <1. Our algorithm is based on a novel deterministic sampling scheme and can be used for computing distance transforms for a very general class of distance functions. We also present a scalable version of our algorithm when the number of processors is available p2+&epsi;/log log p for some p <N. In this case, our algorithm runs in O((N2/p2)+(N/p) log log p + (log log p)2) time. This scalable algorithm is more practical since usually the number of available processors is much less than the size of the image.",

author = "Amitava Datta and S. Subbiah",

year = "2003",

doi = "10.1109/TSMCA.2003.809173",

language = "English",

volume = "33",

pages = "429--434",

journal = "IEEE Transactions on Systems, Man and Cybernetics-Part A : Systems and Humans",

issn = "1083-4427",

publisher = "IEEE, Institute of Electrical and Electronics Engineers",

number = "5",

}

TY - JOUR

T1 - Fast Parallel Algorithm for Distance Transform

AU - Datta, Amitava

AU - Subbiah, S.

PY - 2003

Y1 - 2003

N2 - We present an O((log log N)2) -time algorithm for computing the distance transform of an N × N binary image. Our algorithm is designed for the common concurrent read concurrent write parallel random access machine (CRCW PRAM) and requires O(N2+&epsi;/log log N) processors, for any &epsi; such that 0 <&epsi; <1. Our algorithm is based on a novel deterministic sampling scheme and can be used for computing distance transforms for a very general class of distance functions. We also present a scalable version of our algorithm when the number of processors is available p2+&epsi;/log log p for some p <N. In this case, our algorithm runs in O((N2/p2)+(N/p) log log p + (log log p)2) time. This scalable algorithm is more practical since usually the number of available processors is much less than the size of the image.

AB - We present an O((log log N)2) -time algorithm for computing the distance transform of an N × N binary image. Our algorithm is designed for the common concurrent read concurrent write parallel random access machine (CRCW PRAM) and requires O(N2+&epsi;/log log N) processors, for any &epsi; such that 0 <&epsi; <1. Our algorithm is based on a novel deterministic sampling scheme and can be used for computing distance transforms for a very general class of distance functions. We also present a scalable version of our algorithm when the number of processors is available p2+&epsi;/log log p for some p <N. In this case, our algorithm runs in O((N2/p2)+(N/p) log log p + (log log p)2) time. This scalable algorithm is more practical since usually the number of available processors is much less than the size of the image.

U2 - 10.1109/TSMCA.2003.809173

DO - 10.1109/TSMCA.2003.809173

M3 - Article

VL - 33

SP - 429

EP - 434

JO - IEEE Transactions on Systems, Man and Cybernetics-Part A : Systems and Humans

JF - IEEE Transactions on Systems, Man and Cybernetics-Part A : Systems and Humans

SN - 1083-4427

IS - 5

ER -