A Comparative Review of Component Tree Computation Algorithms

DOI10.1109/TIP.2014.2336551zbMath1374.94055OpenAlexW1966828720WikidataQ38229147 ScholiaQ38229147MaRDI QIDQ4592430

Thierry Géraud, Edwin Carlinet

Publication date: 20 November 2017

Published in: IEEE Transactions on Image Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tip.2014.2336551

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (16)

On the gold standard for security of universal steganography ⋮ A Comparison Between Extinction Filters and Attribute Filters ⋮ Intelligent Object Detection Using Trees ⋮ Shape-Based Analysis on Component-Graphs for Multivalued Image Processing ⋮ 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 ⋮ Shape-based analysis on component-graphs for multivalued image processing ⋮ Extending the Power Watershed Framework Thanks to $\Gamma$-Convergence ⋮ A new matching algorithm between trees of shapes and its application to brain tumor segmentation ⋮ Minimal Component-Hypertrees ⋮ Introducing the Dahu Pseudo-Distance ⋮ Morphological Hierarchical Image Decomposition Based on Laplacian 0-Crossings ⋮ Connected Morphological Attribute Filters on Distributed Memory Parallel Machines ⋮ Brain Lesion Detection in 3D PET Images Using Max-Trees and a New Spatial Context Criterion

This page was built for publication: A Comparative Review of Component Tree Computation Algorithms