A constant-time algorithm for erosions/dilations with application to morphological texture feature computation
Academic Article
Overview
Identity
Additional Document Info
Other
View All
Overview
abstract
A computationally efficient algorithm for computing erosions and dilations by one-dimensional grayscale structuring elements with constant slope is proposed. The computational complexity of this algorithm is independent of the size of the support of the structuring function. This is a generalization of the method proposed by Van Herk for the case of erosion and dilation by flat one-dimensional structuring elements. By appropriate combinations of these structuring elements, it is possible to approximate many useful structuring elements. This enables efficient computation of granulometries where the number of operations depends linearly on the number of openings. Theoretical and experimental results comparing the complexity of this algorithm with other standard techniques is presented. Two memory efficient algorithms are then presented. Several implementation issues in computing a granulometry and moments of the associated morphological pattern spectrum are then addressed. An efficient implementation of granulometries for large images on machines with limited memory, by dividing the image into smaller rectangular patches is then discussed. The optimum size of these patches is a function of the specific hardware and has been obtained experimentally for three different hardware platforms. Finally, parallel implementation of the different algorithms on two multi-processor machines is discussed. 2000 Academic Press.
