Abstract
Component tree allows an image to be represented as a hierarchy of connected components. These components are directly related to the neighborhood chosen to obtain them and, in particular, a family of component trees built with increasing neighborhoods allows the linking of nodes of different trees according to their inclusion relation, adding a sense of scale as we travel along them. In this paper, we present a class of neighborhoods obtained from second-generation connectivities and show that this class is suited to the construction of a family of trees. Then, we provide an algorithm that benefits from the properties of this class, which reuses computation done in previously built tree in order to construct the entire family of component trees efficiently.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Salembier, P., Oliveras, A., Garrido, L.: Anti-extensive connected operators for image and sequence processing. IEEE Transactions on Image Processing 7(4), 555–570 (1998)
Xu, Y., Géraud, T., Najman, L.: Morphological filtering in shape spaces: Applications using tree-based image representations. In: 2012 21st International Conference on Pattern Recognition (ICPR), pp. 485–488. IEEE (2012)
Sun, L., Huo, Q.: A component-tree based method for user-intention guided text extraction. In: 2012 21st International Conference on Pattern Recognition (ICPR), pp. 633–636. IEEE (2012)
Alves, W., Hashimoto, R.: Text regions extracted from scene images by ultimate attribute opening and decision tree classification. In: Proceedings of the 23rd SIBGRAPI Conference on Graphics, Patterns and Images, pp. 360–367 (2010)
Serra, J.: Connectivity on complete lattices 9(3), 231–251 (1998)
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)
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)
Najman, L., Couprie, M.: Building the component tree in quasi-linear time. IEEE Transactions on Image Processing 15(11), 3531–3539 (2006)
Berger, C., Géraud, T., Levillain, R., Widynski, N., Baillard, A., Bertin, E.: Effective component tree computation with application to pattern recognition in astronomical imaging. In: IEEE International Conference on Image Processing, ICIP 2007, vol. 4, pp. IV – 41–IV – 44 (2007)
Braga-Neto, U., Goutsias, J.: A theoretical tour of connectivity in image processing and analysis. Journal of Mathematical Imaging and Vision 19(1), 5–31 (2003)
Alves, W.A.L., Morimitsu, A., Hashimoto, R.F.: Scale-space representation based on levelings through hierarchies of level sets. In: Benediktsson, J.A., Chanussot, J., Najman, L., Talbot, H. (eds.) ISMM 2015. LNCS, vol. 9082, pp. 265–276. Springer, Heidelberg (2015)
Caselles, V., Meinhardt, E., Monasse, P.: Constructing the tree of shapes of an image by fusion of the trees of connected components of upper and lower level sets. Positivity 12(1), 55–73 (2008)
Najman, L., Couprie, M.: Building the component tree in quasi-linear time. IEEE Transactions on Image Processing 15(11), 3531–3539 (2006)
Wilkinson, M.H.F., Gao, H., Hesselink, W.H., Jonker, J.E., Meijster, A.: Concurrent computation of attribute filters using shared memory parallel machines. IEEE Trans. Pattern Anal. Mach. Intell. 30(10), 1800–1813 (2008)
Lucas, S.M., Panaretos, A., Sosa, L., Tang, A., Wong, S., Young, R.: Icdar 2003 robust reading competitions. In: 2013 12th International Conference on Document Analysis and Recognition, vol. 2, pp. 682–682. IEEE Computer Society (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Morimitsu, A., Alves, W.A.L., Hashimoto, R.F. (2015). Incremental and Efficient Computation of Families of Component Trees. In: Benediktsson, J., Chanussot, J., Najman, L., Talbot, H. (eds) Mathematical Morphology and Its Applications to Signal and Image Processing. ISMM 2015. Lecture Notes in Computer Science(), vol 9082. Springer, Cham. https://doi.org/10.1007/978-3-319-18720-4_57
Download citation
DOI: https://doi.org/10.1007/978-3-319-18720-4_57
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18719-8
Online ISBN: 978-3-319-18720-4
eBook Packages: Computer ScienceComputer Science (R0)