论文标题
加入，选择和插入：层次分割树有效的高核外算法
Join, select, and insert: efficient out-of-core algorithms for hierarchical segmentation trees
论文作者
论文摘要
二进制分区层次结构（BPH）和最小跨越树是层次分析的基本数据结构，例如准平台区域或分水岭。但是，经典的BPH结构算法需要将整个数据存储在内存中，这阻止了无法完全适合计算机主内存的大图像的处理。为了解决这个问题，引入了导致高水平演算的代数框架，允许对BPH的核心计算。该演算取决于三个操作：选择，加入和插入。在本文中，我们介绍了三种有效的算法，以执行提供伪代码和复杂性分析的这些操作。
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.
