Intrinsic quality analysis of binary partition trees

Abstract : 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.
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.univ-reims.fr/hal-01695077
Contributor : Nicolas Passat <>
Submitted on : Friday, February 9, 2018 - 7:04:37 PM
Last modification on : Thursday, June 27, 2019 - 12:12:19 PM

File

Randrianasoa_ICPRAI_2018.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01695077, version 1

Citation

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⟩

Share

Metrics

Record views

159

Files downloads

100