Affordable Access

deepdyve-link
Publisher Website

Join, select, and insert: efficient out-of-core algorithms for hierarchical segmentation trees

Authors
  • Lefèvre, Josselin
  • Cousty, Jean
  • Perret, Benjamin
  • Phelippeau, Harold
Publication Date
Oct 24, 2022
Identifiers
DOI: 10.1007/978-3-031-19897-7_22
OAI: oai:HAL:hal-03794772v1
Source
HAL-Ecole des Ponts ParisTech
Keywords
Language
English
License
Unknown
External links

Abstract

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.

Report this publication

Statistics

Seen <100 times