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

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on pattern analysis and machine intelligence Vol. 25; no. 2; pp. 265 - 270
Main Authors:	Maurer, C.R., Rensheng Qi, Raghavan, V.
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.02.2003 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!