A linear time algorithm for computing exact Euclidean distance transforms of binary images in arbitrary dimensions

A sequential algorithm is presented for computing the exact Euclidean distance transform (DT) of a k-dimensional binary image in time linear in the total number of voxels N. The algorithm, which is based on dimensionality reduction and partial Voronoi diagram construction, can be used for computing...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on pattern analysis and machine intelligence Jg. 25; H. 2; S. 265 - 270
Hauptverfasser:	Maurer, C.R., Rensheng Qi, Raghavan, V.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.02.2003 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Anisotropic magnetoresistance Chamfering Computer vision Computing time Construction Euclidean distance Image processing Image registration Interpolation Mathematical analysis Nearest neighbor searches Pattern analysis Pattern matching Skeleton Studies Surface morphology Transforms
ISSN:	0162-8828, 1939-3539
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!