Select, Insert and Join: Out-of-Core Efficient Algorithms for Hierarchies of Segmentation - Archive ouverte HAL Accéder directement au contenu
Poster De Conférence Année : 2023

Select, Insert and Join: Out-of-Core Efficient Algorithms for Hierarchies of Segmentation

Résumé

Binary Partition Hierarchies (BPH) and minimum spanning trees are fundamental data structures involved in hierarchical analysis such as quasi-flat zones or watershed. However, classical BPH construction algorithms require to have the whole data in memory, which prevent the processing of large images that cannot fit entirely in the main memory of the computer. To cope with this problem, an algebraic framework leading to a high level calculus was introduced allowing an out-of-core computation of BPHs. This calculus relies on three operations: select, join, and insert. In this article, we introduce three efficient algorithms to perform these operations providing pseudo-code and complexity analysis.
Fichier principal
Vignette du fichier
poster_2023_jnim.pdf (2.4 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Licence : CC BY NC - Paternité - Pas d'utilisation commerciale

Dates et versions

hal-04536891 , version 1 (08-04-2024)

Identifiants

  • HAL Id : hal-04536891 , version 1

Citer

Josselin Lefèvre, Jean Cousty, Benjamin Perret, Harold Phelippeau. Select, Insert and Join: Out-of-Core Efficient Algorithms for Hierarchies of Segmentation. JNIM 2023 : Journées Nationales du GDR IM, Apr 2023, Paris, France. . ⟨hal-04536891⟩
11 Consultations
2 Téléchargements

Partager

Gmail Facebook X LinkedIn More