Robust Computations of Reeb Graphs in 2-D Binary Images

Abstract : In this article, we present a novel approach devoted to robustly compute the Reeb graph of a digital binary image, possibly altered by noise. We first employ a skeletonization algorithm, named DECS (Discrete Euclidean Connected Skeleton), to calculate a discrete structure centered within the object. By means of an iterative process, valid with respect to Morse theory, we finally obtain the Reeb graph of the input object. Our various experiments show that our methodology is capable of computing the Reeb graph of images with a high impact of noise, and is applicable in concrete contexts related to medical image analysis.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01335696
Contributor : Aurélie Leborgne <>
Submitted on : Wednesday, June 22, 2016 - 11:27:38 AM
Last modification on : Wednesday, November 20, 2019 - 3:10:07 AM

Identifiers

Citation

Antoine Vacavant, Aurélie Leborgne. Robust Computations of Reeb Graphs in 2-D Binary Images. CTIC (Computational Topology in Image Context), Alexandra PAC & Jean-Luc Mari, Jun 2016, Marseille, France. ⟨10.1007/978-3-319-39441-1_19⟩. ⟨hal-01335696⟩

Share

Metrics

Record views

347