A fast algorithm for morphological erosion and dilation

Abstract

This paper describes a new algorithm for performing erosion and dilation which is suitable for flat line-segment structuring functions, and which has a computational complexity that is independent of the structuring function size. Unlike other proposed algorithms, the computation time required by this method is directly proportional to the number of extrema… (More)

Topics

2 Figures and Tables

Cite this paper

@article{Pye1996AFA, title={A fast algorithm for morphological erosion and dilation}, author={C. Jeremy Pye and J. Andrew Bangham}, journal={1996 8th European Signal Processing Conference (EUSIPCO 1996)}, year={1996}, pages={1-4} }