Out-of-core Attribute Algorithms for Binary Partition Hierarchies - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

Out-of-core Attribute Algorithms for Binary Partition Hierarchies

Résumé

Binary Partition Hierarchies (BPHs) and Minimum Spanning Trees are key structures in hierarchical image analysis. However, the explosion in the size of image data poses a new challenge, as the memory available in conventional workstations becomes insufficient to execute classical algorithms. To address this problem, specific algorithms have been proposed for out-of-core computation of BPHs, where a BPH is actually represented by a collection of smaller trees, called a distribution, thus reducing the memory footprint of the algorithms. In this article, we address the problem of designing efficient out-of-core algorithms for computing classical attributes in distributions of BPHs, which is a necessary step towards a complete out-of-core hierarchical analysis workflow that includes tasks such as connected filtering and the generation of other representations such as hierarchical watersheds. The proposed algorithms are based on generic operations designed to propagate information through the distribution of trees, enabling the computation of attributes such as area, volume, height, minima and number of minima.
Fichier principal
Vignette du fichier
DGMM_2024.pdf (433.28 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04364371 , version 1 (26-12-2023)

Identifiants

  • HAL Id : hal-04364371 , version 1

Citer

Josselin Lefèvre, Jean Cousty, Benjamin Perret, Harold Phelippeau. Out-of-core Attribute Algorithms for Binary Partition Hierarchies. 2023. ⟨hal-04364371⟩
70 Consultations
31 Téléchargements

Partager

Gmail Facebook X LinkedIn More