Abstract
This paper presents a new streaming algorithm for 1-D morphological opening and closing transformations on 2-D support. Thanks to a recursive computation technique, the algorithm processes an image in constant time irrespective of the Structuring Element (SE) size, with a minimal latency and very low memory requirements, supporting various input data types. It reads and writes data strictly sequentially in the same (horizontal) scan order for both the horizontal and vertical SE. Aforementioned properties allow an efficient implementation in embedded hardware opening a new opportunity of a parallel computation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Dokládal, P., Dokládalová, E.: Grey-scale morphology with spatially-variant rectangles in linear time. In: Blanc-Talon, J., Bourennane, S., Philips, W., Popescu, D., Scheunders, P. (eds.) ACIVS 2008. LNCS, vol. 5259, pp. 674–685. Springer, Heidelberg (2008)
Gil, J., Kimmel, R.: Efficient dilation, erosion, opening, and closing algorithms. IEEE Trans. Pattern Anal. Mach. Intell. 24(12), 1606–1617 (2002)
van Herk, M.: A fast algorithm for local minimum and maximum filters on rectangular and octagonal kernels. Pattern Recogn. Lett. 13(7), 517–521 (1992)
Lemire, D.: Streaming maximum-minimum filter using no more than three comparisons per element. Nordic Journal of Computing 13(4), 328–339 (2006)
Matheron, G.: Random sets and integral geometry [by] G. Matheron. Wiley, New York (1974)
Menotti-Gomes, D., Najman, L., de Albuquerque Araújo, A.: 1D Component tree in linear time and space and its application to gray-level image multithresholding. In: Proceedings of 8th ISMM, vol. 1, pp. 437–448. INPE (2007), http://ismm.dpi.inpe.br/2007/
Morard, V., Dokladal, P., Decenciere, E.: Linear openings in arbitrary orientation in O(1) per pixel. In: ICASSP 2011: Acoustics, Speech, and Signal Processing (2011)
Serra, J.: Image Analysis and Mathematical Morphology. Academic Press, Inc., Orlando (1983)
Van Droogenbroeck, M., Buckley, M.J.: Morphological erosions and openings: Fast algorithms based on anchors. J. Math. Imaging Vis. 22(2-3), 121–142 (2005)
Vincent, L.: Granulometries and opening trees. Fundam. Inform. 41(1-2), 57–90 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bartovsky, J., Dokladal, P., Dokladalova, E., Bilodeau, M. (2011). Fast Streaming Algorithm for 1-D Morphological Opening and Closing on 2-D Support. In: Soille, P., Pesaresi, M., Ouzounis, G.K. (eds) Mathematical Morphology and Its Applications to Image and Signal Processing. ISMM 2011. Lecture Notes in Computer Science, vol 6671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21569-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-21569-8_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21568-1
Online ISBN: 978-3-642-21569-8
eBook Packages: Computer ScienceComputer Science (R0)