A linear-time algorithm for Euclidean feature transform sets

The Euclidean distance transform of a binary image is the function that assigns to every pixel the Euclidean distance to the background. The Euclidean feature transform is the function that assigns to every pixel the set of background pixels with this distance. We present an algorithm to compute the...

Full description

Saved in:
Bibliographic Details
Published in:Information processing letters 2007-05, Vol.102 (5), p.181-186
Main Author: Hesselink, Wim H.
Format: Article
Language:English
Subjects:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Artificial intelligence
Computational geometry
Computer graphics
Computer science
control theory
systems
Distance transform
Euclidean space
Exact sciences and technology
Feature extraction
Feature transform
Geometry
Image processing
Image processing systems
Mathematics
Pattern recognition. Digital image processing. Computational geometry
Sciences and techniques of general use
Studies
Theoretical computing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Euclidean distance transform of a binary image is the function that assigns to every pixel the Euclidean distance to the background. The Euclidean feature transform is the function that assigns to every pixel the set of background pixels with this distance. We present an algorithm to compute the exact Euclidean feature transform sets in linear time. The algorithm is applicable in arbitrary dimensions.
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2006.12.005