Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
531258 | Pattern Recognition | 2006 | 12 Pages |
Abstract
We investigate how common binary mathematical morphology operators can be adapted so that the size of the structuring element can vary across the image pixels. We show that when the structuring elements are balls of a metric, locally adaptable erosion and dilation can be efficiently implemented as a variant of distance transformation algorithms. Opening and closing are obtained by a local threshold of a distance transformation, followed by the adaptable dilation.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Vision and Pattern Recognition
Authors
Olivier Cuisenaire,