# Parallel Watershed Partitioning: GPU-Based Hierarchical Image Segmentation

Source: [Parallel Watershed Partitioning: GPU-Based Hierarchical Image Segmentation](<https://www.sota2.com/research/paper/68fa7b031e209131cea8638f>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-26T05:31:45.237Z

Authors: Varduhi Yeghiazaryan, Yeva Gabrielyan, Irina Voiculescu

Published: 2024-10-11T16:15:43.000Z

## Abstract

Many image processing applications rely on partitioning an image into disjoint regions whose pixels are 'similar.' The watershed and waterfall transforms are established mathematical morphology pixel clustering techniques. They are both relevant to modern applications where groups of pixels are to be decided upon in one go, or where adjacency information is relevant. We introduce three new parallel partitioning algorithms for GPUs. By repeatedly applying watershed algorithms, we produce waterfall results which form a hierarchy of partition regions over an input image. Our watershed algorithms attain competitive execution times in both 2D and 3D, processing an 800 megavoxel image in less than 1.4 sec. We also show how to use this fully deterministic image partitioning as a pre-processing step to machine learning based semantic segmentation. This replaces the role of superpixel algorithms, and results in comparable accuracy and faster training times.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2410.08946>)

[PDF](<https://arxiv.org/pdf/2410.08946.pdf>)