A new matching algorithm between trees of shapes and its application to brain tumor segmentation
From MaRDI portal
Publication:2061786
DOI10.1007/978-3-030-76657-3_4zbMath1484.68288OpenAlexW3162278523MaRDI QIDQ2061786
Nicolas Boutry, Thierry Géraud
Publication date: 21 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-76657-3_4
Computing methodologies for image processing (68U10) Biomedical imaging and signal processing (92C55) Pattern recognition, speech recognition (68T10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A survey on tree edit distance and related problems
- Geometric description of images as topographic maps
- Grain filters
- Self-duality and Digital Topology: Links Between the Morphological Tree of Shapes and Well-Composed Gray-Level Images
- An eigendecomposition approach to weighted graph matching problems
- Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis
- A graph distance metric based on the maximal common subgraph
- A Comparative Review of Component Tree Computation Algorithms
- Measuring Distance between Reeb Graphs
- A Quasi-linear Algorithm to Compute the Tree of Shapes of nD Images
- Preferential Image Segmentation Using Trees of Shapes
- A Histogram Modification Framework and Its Application for Image Contrast Enhancement
- Structural, Syntactic, and Statistical Pattern Recognition
- Algorithm 457: finding all cliques of an undirected graph
- Edge detection by Helmholtz principle
This page was built for publication: A new matching algorithm between trees of shapes and its application to brain tumor segmentation