A fast algorithm for morphological erosion and dilation

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 within the signal being processed. This makes it particularly suitable for signals and images that have large and slowly varying segments.