Abstract
Multi-scale connectivity measures have been introduced in the context of shape analysis and image segmentation. They are computed by progressive shape decomposition of binary images. This paper presents an efficient method to compute them based on the dual-input Max-Tree algorithm. Instead of handling a stack of binary images, one for each scale, the new method reads a single gray-level image, with each level associated to a unique scale. This reduces the component labeling iterations from a total number equal to the number of scales to just a single pass of the image. Moreover, it prevents the repetitive decomposition of each component under study, for the remaining scale range, since these information are already mapped from the input image to the tree hierarchy. Synthetic and real image examples are given and performance issues are discussed.
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
Heijmans, H.J.A.M.: Connected morphological operators for binary images. Comp. Vis. Image Understand. 73(1), 99–120 (1999)
Serra, J.: Connectivity on complete lattices. Journal of Mathematical Imaging and Vision 9(3), 231–251 (1998)
Serra, J. (ed.): Image Analysis and Mathematical Morphology. II: Theoretical Advances. Academic Press, London (1988)
Salembier, P., Oliveras, A., Garrido, L.: Anti-extensive connected operators for image and sequence processing. IEEE Trans. Image Proc. 7(4), 555–570 (1998)
Tzafestas, C., Maragos, P.: Shape connectivity: Multiscale analysis and application to generalized granulometries. Journal Math. Imaging and Vision 17(2), 109–129 (2002)
Ronse, C.: Set-theoretical algebraic approaches to connectivity in continuous or digital spaces. Journal of Mathematical Imaging and Vision 8(1), 41–58 (1998)
Braga-Neto, U., Goutsias, J.: Connectivity on complete lattices: New results. Comp. Vis. Image Understand. 85(1), 22–53 (2002)
Ouzounis, G.K., Wilkinson, M.H.F.: Countering oversegmentation in partitioning-based connectivities. In: Proc. Int. Conf. Image Processing, pp. 844–847 (2005)
Urbach, E.R., Roerdink, J.B.T.M., Wilkinson, M.H.F.: Connected shape-size pattern spectra for rotation and scale-invariant classification of gray-scale images. IEEE Trans. Pattern Anal. Mach. Intell. 29(2), 272–285 (2007)
Ouzounis, G.K., Wilkinson, M.H.F.: Mask-based second-generation connectivity and attribute filters. IEEE Trans. Pattern Anal. Mach. Intell. 29(6), 990–1004 (2007)
Salembier, P., Serra, J.: Flat zones filtering, connected operators, and filters by reconstruction. IEEE Trans. Image Proc. 4(8), 1153–1160 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ouzounis, G.K. (2009). An Efficient Algorithm for Computing Multi-scale Connectivity Measures. In: Wilkinson, M.H.F., Roerdink, J.B.T.M. (eds) Mathematical Morphology and Its Application to Signal and Image Processing. ISMM 2009. Lecture Notes in Computer Science, vol 5720. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03613-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-03613-2_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03612-5
Online ISBN: 978-3-642-03613-2
eBook Packages: Computer ScienceComputer Science (R0)