.png){kind=icon}
Return
Max-Tree Computation on GPUs
.png){kind=icon}
OA
AI
DOI：10.1109/TPDS.2022.3158488.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In Mathematical Morphology, the max-tree is a region-based representation that encodes the inclusion relationship of the threshold sets of an image. This tree has proved useful in numerous image processing applications. For the last decade, work has led to improving the construction time of this structure; mixing algorithmic optimizations, parallel and distributed computing. Nevertheless, there is still no algorithm that benefits from the computing power of the massively parallel architectures. In this work, we propose the first GPU algorithm to compute the max-tree. The proposed approach leads to significant speed-ups, and is up to one order of magnitude faster than the current State-of-the-Art parallel CPU algorithms. This work paves the way for a max-tree integration in image processing GPU pipelines and real-time image processing based on Mathematical Morphology. It is also a foundation for porting other image representations from Mathematical Morphology on GPUs.
Keywords:
Image processing
Pipelines
Morphology
Optimization
Shape
Level set
Encoding
Mathematical morphology
hierarchical image representation
component-trees
max-tree
graph algorithms
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W
Organization
Cited Papers
Fibrillar Aβ causes profound microglial metabolic perturbations in a novel APP knock-in mouse model.png)
OAAI
IF0
OAAIShareSaveRemoval of Fluorine from RECl3 in Solution by Adsorption, Ion Exchange and PrecipitationMineralsOAAI
MineralsIF0
OAAIShareSave
ShareSaveShareSave
View more