A Work Efficient Parallel Algorithm for Exact Euclidean Distance Transform

A fully-parallelized work-time optimal algorithm is presented for computing the exact Euclidean Distance Transform (EDT) of a 2D binary image with the size of n × n. Unlike existing PRAM (Parallel Random Access Machine) and other algorithms, this algorithm is suitable for implementation on modern SI...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on image processing Ročník 28; číslo 11; s. 5322 - 5335
Hlavní autori:	Manduhu, Manduhu, Jones, Mark W.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	United States IEEE 01.11.2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	1D EDT 2D EDT Algorithms Approximation algorithms binary operations on GPU Computer architecture Euclidean geometry Graphics processing units Parallel algorithms Parallel processing Phase change random access memory Random access SIMD architecture Time complexity Transforms Work-time optimal parallel algorithm
ISSN:	1057-7149, 1941-0042, 1941-0042
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!