Abstract
Connectivity is the basis of several methodological concepts in mathematical morphology. In graph-based approaches, the notion of connectivity can be derived from the notion of adjacency. In this preliminary work, we investigate the effects of relaxing the symmetry property of adjacency. In particular, we observe the consequences on the induced connected components, that are no longer organised as partitions but as covers, and on the hierarchies that are obtained from such components. These hierarchies can extend data structures such as component-trees and partition-trees, and the associated filtering and segmentation paradigms, leading to improved image processing tools.
The research leading to these results has received funding from the French Agence Nationale de la Recherche (Grant Agreement ANR-2010-BLAN-0205).
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.
References
Bloch, I., Maître, H., Anvar, M.: Fuzzy adjacency between image objects. Int. J. Uncertain. Fuzz. 5, 615–654 (1997)
Braga-Neto, U., Goutsias, J.K.: A theoretical tour of connectivity in image processing and analysis. J. Math. Imaging Vis. 19, 5–31 (2003)
Cousty, J., Bertrand, G., Najman, L., Couprie, M.: Watershed cuts: Minimum spanning forests and the drop of water principle. IEEE T. Pattern Anal. 31, 1362–1374 (2009)
Cousty, J., Bertrand, G., Najman, L., Couprie, M.: Watershed cuts: Thinnings, shortest path forests, and topological watersheds. IEEE T. Pattern Anal. 32, 925–939 (2010)
Dufour, A., Tankyevych, O., Naegel, B., Talbot, H., Ronse, C., Baruthio, J., Dokládal, P., Passat, N.: Filtering and segmentation of 3D angiographic data: Advances based on mathematical morphology. Med. Image Anal. (2012), doi:10.1016/j.media.2012.08.004 (in press)
Guigues, L., Cocquerez, J.-P., Le Men, H.: Scale-sets image analysis. Int. J. Comput. Vision 68, 289–317 (2006)
Heijmans, H.J.A.M.: Connected morphological operators for binary images. Comput. Vis. Image Und. 73, 99–120 (1999)
Jones, R.: Connected filtering and segmentation using component trees. Comput. Vis. Image Und. 75, 215–228 (1999)
Meyer, F., Najman, L.: Segmentation, minimum spanning tree and hierarchies. In: Najman, L., Talbot, H. (eds.) Mathematical Morphology: From Theory to Applications, pp. 229–261. ISTE/J. Wiley & Sons (2010)
Najman, L.: On the equivalence between hierarchical segmentations and ultrametric watersheds. J. Math. Imaging Vis. 40, 231–247 (2011)
Ouzounis, G.K., Wilkinson, M.H.F.: Mask-based second-generation connectivity and attribute filters. IEEE T. Pattern Anal. 29, 990–1004 (2007)
Passat, N., Naegel, B.: Component-hypertrees for image segmentation. In: Soille, P., Pesaresi, M., Ouzounis, G.K. (eds.) ISMM 2011. LNCS, vol. 6671, pp. 284–295. Springer, Heidelberg (2011)
Passat, N., Naegel, B.: Component-trees and multivalued images: Structural properties. Technical report, INRIA-00611714 (2012), url: http://hal.inria.fr/inria-00611714
Perret, B., Lefèvre, S., Collet, C., Slezak, E.: Hyperconnections and hierarchical representations for grayscale and multiband image processing. IEEE T. Image Proc. 21, 14–27 (2012)
Ronse, C.: Set-theoretical algebraic approaches to connectivity in continuous or digital spaces. J. Math. Imaging Vis. 8, 41–58 (1998)
Rosenfeld, A.: Connectivity in digital pictures. J. Assoc. Comput. Mach. 17, 146–160 (1970)
Rosenfeld, A.: Fuzzy digital topology. Inform. Control 40, 76–87 (1979)
Salembier, P., Garrido, L.: Binary partition tree as an efficient representation for image processing, segmentation and information retrieval. IEEE T. Image Proc. 9, 561–576 (2000)
Salembier, P., Oliveras, A., Garrido, L.: Anti-extensive connected operators for image and sequence processing. IEEE T. Image Proc. 7, 555–570 (1998)
Salembier, P., Wilkinson, M.H.F.: Connected operators: A review of region-based morphological image processing techniques. IEEE Signal Proc. Mag. 26, 136–157 (2009)
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. Imaging Vis. 9, 231–251 (1998)
Serra, J.: Tutorial on connective morphology. IEEE J. Sel. Top. Signa. 6, 739–752 (2012)
Soille, P.: Constrained connectivity for hierarchical image partitioning and simplification. IEEE T. Pattern Anal. 30, 1132–1145 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tankyevych, O., Talbot, H., Passat, N. (2013). Semi-connections and Hierarchies. In: Hendriks, C.L.L., Borgefors, G., Strand, R. (eds) Mathematical Morphology and Its Applications to Signal and Image Processing. ISMM 2013. Lecture Notes in Computer Science, vol 7883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38294-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-38294-9_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38293-2
Online ISBN: 978-3-642-38294-9
eBook Packages: Computer ScienceComputer Science (R0)