Abstract
Attribute-space connectivity has been put forward as a means of improving image segmentation in the case of overlapping structures. Its main drawback is the huge memory load incurred by mapping a N-dimensional image to an \((N + \dim (A))\)-dimensional volume, with \(\dim (A)\) the dimensionality of the attribute vectors used. In this theoretical paper we introduce a more space and time efficient scheme, by representing attribute spaces for analysis of binary images as a graph rather than a volume. Introducing a graph formalism for attribute-space connectivity opens up the possibility of using attribute-space connectivity on 3D volumes or using more than one attribute dimension, without incurring huge memory costs. Furthermore, the graph formalism does not require quantization of the attribute values, as is the case when representing attribute spaces in terms of \((N + \dim (A))\)-dimensional discrete volumes. Efficient processing of high dimensional data produced by multi-sensor detection systems is another advantage of application of our formalism.
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
References
Babai, M., Kalantar-Nayestanaki, N., Messchendorp, J.G., Wilkinson, M.H.F.: An efficient attribute-space connected filter on graphs to reconstruct paths in point-clouds. Pattern Recognition (submitted)
Bloch, I., Bretto, A.: Mathematical morphology on hypergraphs, application to similarity and positive kernel. Comput. Vis. Image Underst. 117(4), 342–354 (2013)
Braga-Neto, U., Goutsias, J.: A theoretical tour of connectivity in image processing and analysis. J. Math. Imag. Vis. 19, 5–31 (2003)
Breen, E.J., Jones, R.: Attribute openings, thinnings and granulometries. Comp. Vis. Image Understand. 64(3), 377–389 (1996)
Cousty, J., Najman, L., Dias, F., Serra, J.: Morphological filtering on graphs. Comput. Vis. Image Underst. 117(4), 370–385 (2013). https://doi.org/10.1016/j.cviu.2012.08.016. http://www.sciencedirect.com/science/article/pii/S107731421200183X, special issue on Discrete Geometry for Computer Imagery
Cousty, J., Najman, L., Serra, J.: Some morphological operators in graph spaces. In: Wilkinson, M.H.F., Roerdink, J.B.T.M. (eds.) ISMM 2009. LNCS, vol. 5720, pp. 149–160. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03613-2_14
Erni, P.C.W., Keshelashvili, I., Krusche, B., et al.: Technical design report for the panda straw tube tracker. Eur. Phys. J. A 49, 25 (2013). Special Article - Tools for Experiment and Theory
Franken, E., Duits, R.: Crossing-preserving coherence-enhancing diffusion on invertible orientation scores. Int. J. Comput. Vis. 85, 253–278 (2009)
Géraud, T.: Ruminations on Tarjan’s union-find algorithm and connected operators. In: Ronse, C., Najman, L., Decenciére, E. (eds.) Mathematical Morphology: 40 Years On, vol. 30. Springer, Dordrecht (2005)
Meijster, A., Wilkinson, M.H.F.: A comparison of algorithms for connected set openings and closings. IEEE Trans. Pattern Anal. Mach. Intell. 24(4), 484–494 (2002)
Nacken, P.F.M.: Image analysis methods based on hierarchies of graphs and multi-scale mathematical morphology. Ph.D. thesis, University of Amsterdam, Amsterdam, The Netherlands (1994)
Najman, L., Couprie, M.: Building the component tree in quasi-linear time. IEEE Trans. Image Proc. 15, 3531–3539 (2006)
Najman, L., Cousty, J.: A graph-based mathematical morphology reader. Pattern Recogn. Lett. 47, 3–17 (2014)
Oosterbroek, J., Wilkinson, M.H.F.: Mask-edge connectivity: theory, computation, and application to historical document analysis. In: Proceedings of 21st International Conference on Pattern Recognition, pp. 3112–3115 (2012)
Ouzounis, G.K., Wilkinson, M.H.F.: Mask-based second generation connectivity and attribute filters. IEEE Trans. Pattern Anal. Mach. Intell. 29, 990–1004 (2007)
Perret, B., Lefevre, S., Collet, C., Slezak, E.: Hyperconnections and hierarchical representations for grayscale and multiband image processing. IEEE Trans. Image Process. (2011). https://doi.org/10.1109/TIP.2011.2161322
Ronse, C.: Set-theoretical algebraic approaches to connectivity in continuous or digital spaces. J. Math. Imag. Vis. 8, 41–58 (1998)
Salembier, P., Serra, J.: Flat zones filtering, connected operators, and filters by reconstruction. IEEE Trans. Image Proc. 4, 1153–1160 (1995)
Serra, J.: Mathematical morphology for Boolean lattices. In: Serra, J. (ed.) Image Analysis and Mathematical Morphology, II: Theoretical Advances, pp. 37–58. Academic Press, London (1988)
Serra, J.: Connectivity on complete lattices. J. Math. Imag. Vis. 9(3), 231–251 (1998)
Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. ACM 22, 215–225 (1975)
Tarjan, R.E.: Data Structures and Network Algorithms. SIAM, Philadelphia (1983)
Vincent, L.: Graphs and mathematical morphology. Signal Processing 16(4), 365–388 (1989). https://doi.org/10.1016/0165-1684(89)90031-5. http://www.sciencedirect.com/science/article/pii/0165168489900315, special Issue on Advances in Mathematical Morphology
Wilkinson, M.H.F.: Attribute-space connectivity and connected filters. Image Vis. Comput. 25, 426–435 (2007)
Wilkinson, M.H.F.: Hyperconnectivity, attribute-space connectivity and path openings: theoretical relationships. In: Wilkinson, M.H.F., Roerdink, J.B.T.M. (eds.) ISMM 2009. LNCS, vol. 5720, pp. 47–58. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03613-2_5
Wilkinson, M.H.F.: A fast component-tree algorithm for high dynamic-range images and second generation connectivity. In: 2011 Proceedings of International Conference Image Processing, pp. 1041–1044 (2011)
Wilkinson, M.H.F.: Hyperconnections and openings on complete lattices. In: Soille, P., Pesaresi, M., Ouzounis, G.K. (eds.) ISMM 2011. LNCS, vol. 6671, pp. 73–84. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-21569-8_7
Acknowledgement
We want to thank the Centre for Information Technology (CIT) of the Rijksuniversiteit Groningen for their support and facilitating this work.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Babai, M., Chowdhury, A.S., Wilkinson, M.H.F. (2019). A Graph Formalism for Time and Memory Efficient Morphological Attribute-Space Connected Filters. In: Burgeth, B., Kleefeld, A., Naegel, B., Passat, N., Perret, B. (eds) Mathematical Morphology and Its Applications to Signal and Image Processing. ISMM 2019. Lecture Notes in Computer Science(), vol 11564. Springer, Cham. https://doi.org/10.1007/978-3-030-20867-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-030-20867-7_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-20866-0
Online ISBN: 978-3-030-20867-7
eBook Packages: Computer ScienceComputer Science (R0)