Fast Sequential Binary Morphological Erosions and Dilations

• Anderson Fraiha Machado USP
• Ronaldo Fumio Hashimoto USP

Abstract

This work proposes new fast methods for computing binary morphological erosions and dilations. Such methods are based on preprocessing techniques and new concepts presented and introduced by this research, such as Density Transformation and Set of Shells. The result of these preprocessing techniques is a speed up for computing binary erosions and dilations and also a new compact representation for binary images.

References

Banon, G. J. F. and Barrera, J. (1994). Bases da Morfologia Matemática para a Análise de Imagens Binárias. IX Escola de Computação, Recife.

Barrera, J. and Salas, G. P. (1996). Set Operations on Closed Intervals and Their Applications to the Automatic Programming of Morphological Machines. Electronic Imaging, 5(3):335–352.

Borgefors, G. (1986). Distance Transformations on Digital Images. Computer Vision and Image Processing, 51(34):344–371.

Brambor, J. (2002). Implementation Notes of Binary Dilation and Erosion on 64-bit SH-5 Processor.

Chen, S. and Haralick, R. M. (1995). Recursive erosion, dilation, opening, and closing transforms. IEEE Transactions on Computers, 4(3):335–345.

Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C. (2001). Introduction to Algorithms. MIT Press and McGraw-Hill.

Dougherty, E. R. and Lotufo, R. A. (2003). Hands-on Morphological Image Processing. SPIE International Society for Optical Engine.

Kim, W. J., Kim, S. D., and Kim, K. (2005). Fast Algorithms for Binary Dilation and Erosion Using Run-Length Encoding. ETRI Journal, 27(6):814–817.

Serra, J. (1982). Image Analysis and Mathematical Morphology. Academic Press, New York.

Xu, J. (1991). Decomposition of Convex Polygonal Morphological Structuring Elements into Neighborhood Subsets. IEEE Transactions on Pattern Analysis and Machine Inteligence, 13(2):153–162.