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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on image processing Jg. 28; H. 11; S. 5322 - 5335
Hauptverfasser:	Manduhu, Manduhu, Jones, Mark W.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	United States IEEE 01.11.2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!