Incremental and Efficient Computation of Families of Component Trees

DOI10.1007/978-3-319-18720-4_57zbMath1445.68307OpenAlexW2293926685MaRDI QIDQ2946857

Wonder Alexandre Luz Alves, Alexandre Morimitsu, Ronaldo Fumio Hashimoto

Publication date: 18 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18720-4_57

zbMATH Keywords

connected componentcomponent treesconnected operatorsecond-generation connectivity

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Minimal Component-Hypertrees

Cites Work

• Connectivity on complete lattices
• A theoretical tour of connectivity in image processing and analysis
• Constructing the tree of shapes of an image by fusion of the trees of connected components of upper and lower level sets
• Scale-Space Representation Based on Levelings Through Hierarchies of Level Sets
• Component-Hypertrees for Image Segmentation

This page was built for publication: Incremental and Efficient Computation of Families of Component Trees