Efficient Computation of the Euclidean Distance Transform

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 2000 English Publisher:Elsevier BVJournal:Computer Vision and Image Understanding, volume 80, pages 379-383 (issn: 1077-3142,

Copyright policy )

Authors: Laurence Boxer; Russ Miller;

doi: 10.1006/cviu.2000.0880

Efficient Computation of the Euclidean Distance Transform

- Summary
- Subjects
- Metrics

Abstract

Summary: We present a simple algorithm for the Euclidean distance transform of a binary image that runs more efficiently than other algorithms in the literature. We show that our algorithm runs in optimal time for many architectures and has optimal cost for the RAM and EREW PRAM.

Related Organizations

Niagara University
United States
State University of New York
United States
State University of New York at Potsdam
United States

Keywords

RAM, Computing methodologies and applications, mesh, parallel algorithm, Euclidean distance transform, EREW PRAM, Computing methodologies for image processing, binary image, mesh-of-trees, hypercube

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	9
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average