Efficient algorithms to implement the confinement tree
From MaRDI portal
Recommendations
- A fast, memory-efficient alpha-tree algorithm using flooding and tree size estimation
- Incremental and Efficient Computation of Families of Component Trees
- Fast Constrained Image Segmentation Using Optimal Spanning Trees
- A general approach to connected-component labeling for arbitrary image representations
- Component-trees and multivalued images: structural properties
Cited in
(7)- A fast, memory-efficient alpha-tree algorithm using flooding and tree size estimation
- Component-trees and multivalued images: structural properties
- Interactive segmentation based on component-trees
- Quasi-linear algorithms for the topological watershed
- Segmentation of Complex Images Based on Component-Trees: Methodological Tools
- Component-Trees and Multi-value Images: A Comparative Study
- A Faster CREW PRAM Algorithm for Computing Cartesian Trees
This page was built for publication: Efficient algorithms to implement the confinement tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471811)