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

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on image processing Vol. 28; no. 11; pp. 5322 - 5335
Main Authors:	Manduhu, Manduhu, Jones, Mark W.
Format:	Journal Article
Language:	English
Published:	United States IEEE 01.11.2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!