.png){kind=icon}
Return
An Alpha-Tree Algorithm for Massively Parallel Architectures
.png){kind=icon}
PRE
AI
DOI：10.1109/TIP.2025.3586495.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The alpha-tree, also known as the quasi-flat zone hierarchy is a widely used representation of images in Mathematical Morphology. This structure organizes the regions according to a similarity criterion into a tree, that eases the multiscale analysis of images. Many alpha-tree algorithms exist and computing this structure efficiently is still an active field of research. Indeed, the alpha-tree is commonly used in remote sensing where there is an urge for fast processing of large terabytes images. In this paper, we propose the first massively parallel alpha-tree algorithm that leverages concurrent union-find data structures to exploit the SIMT (Single Instruction Multiple Threads) programming model of GPUs. Our algorithm outperforms the State-of-the-Art parallel CPU algorithms by a factor of 10 on average on desktop computers and servers. It also opens new perspectives for using Mathematical Morphology methods on GPU pipelines.
Keywords:
Alpha-tree
quasi-flat zone hierarchy
mathematical morphology
Journal
IF:
13.7
Papers:
1.0W
Citations:
8.4W
Organization
Cited Papers
ShareSaveA fast component-tree algorithm for high dynamic-range images and second generation connectivity
PREAI
ShareSave
ShareSaveShareSaveExtracting building stock information from optical satellite imagery for mapping earthquake exposure and its vulnerability.png)
NATURAL HAZARDS
NATURAL HAZARDSIF3.7
PREAI
ShareSave
ShareSave
View more