Abstract
Level set methods are fruitful in computer vision, image coding, image processing, geographic information systems, and many other fields. The connected components of the level sets of an image, ordered by inclusion, are organized into a component tree. We present an algorithm to compute the component tree from image level lines. The running time is O(m), where m is the number of image level lines. Experiments show that the new algorithm runs nearly 2 times faster than the existing method.
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 subscriptionsReferences
Silva Dennis, J., Alves Wonder, A.L., Fumio, H.R.: Incremental bit-quads count in component trees: theory, algorithms, and optimization. Pattern Recogn. Lett. 129, 33–40 (2020)
Serna, A., Marcotegui, B., et al.: Segmentation of elongated objects using attribute profiles and area stability: application to melanocyte segmentation in engineered skin. Pattern Recogn. Lett. 47, 172–182 (2014)
Naegel, B., Passat, N.: Towards connected filtering based on component-graphs. In: Hendriks, Cris L.Luengo, Borgefors, G., Strand, R. (eds.) ISMM 2013. LNCS, vol. 7883, pp. 353–364. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38294-9_30
Kurtz, C., Naegel, B., Passat, N.: Connected filtering based on multivalued component-trees. IEEE Trans. Image Process. 23(12), 5152–5164 (2014)
Gloger, O., Tönnies, K.: Subject-Specific prior shape knowledge in feature-oriented probability maps for fully automatized liver segmentation in MR volume data. Pattern Recogn. 84, 288–300 (2018)
Xu, Y., Carlinet, E., Géraud, T., et al.: Hierarchical segmentation using tree-based shape spaces. IEEE Trans. Pattern Anal. Mach. Intell. 39(3), 457–469 (2017)
Pham, M.T., Aptoula, E., Lefevre, S.: Classification of remote sensing images using attribute profiles and feature profiles from different trees: a comparative study. In: IEEE International Geoscience & Remote Sensing Symposium. IEEE (2018)
Drapeau, J., Thierry, G., Mickaël, C., et al.: Extraction of ancient maps content by using trees of connected components. In: International Conference on Document Analysis & Recognition. IEEE (2018)
Çağlayan, T., Behzad, M., et al.: Component trees for image sequences and streams. Pattern Recogn. Lett 129 (2019) https://doi.org/10.1016/j.patrec.2019.11.038
Maia, D.S., Cousty, J., Najman, L., et al.: On the probabilities of hierarchical watersheds. In: Mathematical Morphology and its Applications to Signal and Image Processing (2019)
Najman, L., Cousty, J., Perret, B.: Playing with Kruskal: algorithms for morphological trees in edge-weighted graphs. In: Hendriks, C.L.L., Borgefors, G., Strand, R. (eds.) ISMM 2013. LNCS, vol. 7883, pp. 135–146. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38294-9_12
Couprie, C., Grady, L., Najman, L., Talbot, H.: Power watershed: a unifying graph-based optimization framework. IEEE Trans. Pattern Anal. Mach. Intell. 33(7), 1384–1399 (2011)
Carlinet, E., Géraud, T.: A comparison of many max-tree computation algorithms. In: Hendriks, C.L.L., Borgefors, G., Strand, R. (eds.) ISMM 2013. LNCS, vol. 7883, pp. 73–85. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38294-9_7
Gotz, M., Cavallaro, G., Geraud, T., et al.: Parallel computation of component trees on distributed memory machines. IEEE Trans. Parallel Distrib. Syst. 29(11), 2582–2598 (2018)
Gueunet, C., Fortin, P., Tierny, J., et al.: Task-based augmented contour trees with fibonacci heaps. IEEE Trans. Parallel Distrib. Syst. 30(8), 1889–1905 (2019)
Carlinet, E., Geraud, T.: MToS: a tree of shapes for multivariate images. IEEE Trans. Image Process. 24(12), 5330–5342 (2015)
Monasse, P., Guichard, F.: Fast computation of a contrast-invariant image representation. IEEE Trans. Image Process. 9(5), 860–872 (2000)
Monasse, P.: Morphological representation of digital images and application of registration. PhD dissertation, University of Paris-Dauphine (2000)
Caselles, V., et al.: 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)
Géraud, T., Carlinet, E., Crozet, S., Najman, L.: A Quasi-linear algorithm to compute the tree of shapes of nD images. In: Hendriks, C.L.L., Borgefors, G., Strand, R. (eds.) ISMM 2013. LNCS, vol. 7883, pp. 98–110. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38294-9_9
Song, Y.: A topdown algorithm for computation of level line trees. IEEE Trans. Image Process. 16(8), 2107–2116 (2007)
Song, Y.: Computation of level lines of 4-/8-connectedness. J. Vis. Commun. Image Represent. 25(2), 435–444 (2014)
Song, Y., et al.: Computation of level set components from level lines. IEEE Trans. Image Process. 20(10), 2722–2729 (2011)
Acknowledgment
This research was supported by Natural Science Foundation of China [61070112], Tianjin Science and Technology Innovation Platform Plan [16PTGCCX00150], and Tianjin Artificial Intelligence Science and Technology Major Project [17ZXRGGX00070].
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Tao, R., Song, Y. (2020). Component Tree Computation of 2D Images. In: Huang, DS., Bevilacqua, V., Hussain, A. (eds) Intelligent Computing Theories and Application. ICIC 2020. Lecture Notes in Computer Science(), vol 12463. Springer, Cham. https://doi.org/10.1007/978-3-030-60799-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-030-60799-9_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-60798-2
Online ISBN: 978-3-030-60799-9
eBook Packages: Computer ScienceComputer Science (R0)