Intrinsic quality analysis of binary partition trees - Université de Reims Champagne-Ardenne Access content directly
Conference Papers Year : 2018

Intrinsic quality analysis of binary partition trees


The binary partition tree (BPT) is a well-known hierarchical data-structure, frequently involved image segmentation procedures. The efficiency of segmentation based on BPTs depends on the segmentation process ("how to use a BPT?"), but also on the quality of the data-structure ("how to build a BPT?"). In this article, we propose a scheme for BPT quality analysis, with the purpose of answering the latter question. It relies on the observation of the very structure of a BPT, with respect to a given ground-truth example. Our hypothesis is that such intrinsic scheme can bring relevant clues about the ability of a BPT to provide correct segmentation results. Experiments carried out on satellite images illustrate the relevance of this scheme.
Fichier principal
Vignette du fichier
Randrianasoa_ICPRAI_2018.pdf (1.06 Mo) Télécharger le fichier
Randrianasoa ICPRAI 2018 slides.pdf (2.62 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01695077 , version 1 (09-02-2018)


  • HAL Id : hal-01695077 , version 1


Jimmy Francky Randrianasoa, Camille Kurtz, Pierre Gançarski, Eric Desjardin, Nicolas Passat. Intrinsic quality analysis of binary partition trees. International Conference on Pattern Recognition and Artificial Intelligence (ICPRAI), 2018, Montréal, Canada. pp.114-119. ⟨hal-01695077⟩
225 View
231 Download


Gmail Facebook X LinkedIn More