A Quasi-linear Algorithm to Compute the Tree of Shapes of nD Images

DOI10.1007/978-3-642-38294-9_9zbMath1382.68261OpenAlexW138525918MaRDI QIDQ4925099

Sébastien Crozet, Laurent Najman, Thierry Géraud, Edwin Carlinet

Publication date: 11 June 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-38294-9_9

Mathematics Subject Classification ID

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

Related Items (24)

Continuous well-composedness implies digital well-composedness in \(n\)-D ⋮ Automatic Threshold Selection for Profiles of Attribute Filters Based on Granulometric Characteristic Functions ⋮ Scale-Space Representation Based on Levelings Through Hierarchies of Level Sets ⋮ A Color Tree of Shapes with Illustrations on Filtering, Simplification, and Segmentation ⋮ How to Make nD Functions Digitally Well-Composed in a Self-dual Way ⋮ Self-duality and Digital Topology: Links Between the Morphological Tree of Shapes and Well-Composed Gray-Level Images ⋮ Efficient Computation of Attributes and Saliency Maps on Tree-Based Image Representations ⋮ Some equivalence relation between persistent homology and morphological dynamics ⋮ Morphological hierarchies: a unifying framework with new trees ⋮ A topological tree of shapes ⋮ Component tree loss function: definition and optimization ⋮ Contrast invariant SNR and isotonic regressions ⋮ Introducing poset-based connected \(n\)-manifolds and \(\mathcal{P} \)-well-composedness in partially ordered sets ⋮ Topological properties of the first non-local digitally well-composed interpolation on \(n\)-D cubical grids ⋮ Equivalence between digital well-composedness and well-composedness in the sense of Alexandrov on \(n\)-d cubical grids ⋮ Discrete Set-Valued Continuity and Interpolation ⋮ A tutorial on well-composedness ⋮ A new matching algorithm between trees of shapes and its application to brain tumor segmentation ⋮ Stability of the tree of shapes to additive noise ⋮ How to make \(n\)-D plain maps defined on discrete surfaces Alexandrov-well-composed in a self-dual way ⋮ Strong Euler well-composedness ⋮ Introducing the Dahu Pseudo-Distance ⋮ Morphological Hierarchical Image Decomposition Based on Laplacian 0-Crossings ⋮ Inf-structuring functions: a unifying theory of connections and connected operators

This page was built for publication: A Quasi-linear Algorithm to Compute the Tree of Shapes of nD Images