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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on pattern analysis and machine intelligence Ročník 25; číslo 2; s. 265 - 270
Hlavní autori:	Maurer, C.R., Rensheng Qi, Raghavan, V.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.02.2003 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
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!