A Shared-Memory Parallel Alpha-Tree Algorithm for Extreme Dynamic Ranges

The <inline-formula> <tex-math notation="LaTeX">\alpha </tex-math></inline-formula>-tree is an effective hierarchical image representation used for connected filtering or segmentation in remote sensing and other image applications. The <inline-formula> <tex...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on image processing Ročník 34; s. 6629 - 6640
Hlavní autori: Ryu, Jiwoo, Trager, Scott C., Wilkinson, Michael H. F.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: United States IEEE 01.01.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
Alpha-tree
Clustering algorithms
component tree
connected filter
Dynamic range
efficient algorithm
European Space Agency
Floods
Heuristic algorithms
Image color analysis
Image edge detection
Image segmentation
parallel algorithm
Parallel algorithms
Partitioning algorithms
Pixels
Remote sensing
Representations
ISSN:1057-7149, 1941-0042, 1941-0042
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The <inline-formula> <tex-math notation="LaTeX">\alpha </tex-math></inline-formula>-tree is an effective hierarchical image representation used for connected filtering or segmentation in remote sensing and other image applications. The <inline-formula> <tex-math notation="LaTeX">\alpha </tex-math></inline-formula>-tree constructs a tree based on the dissimilarities of the pixels in an image. Compared to other hierarchical image representations such as the component tree, the <inline-formula> <tex-math notation="LaTeX">\alpha </tex-math></inline-formula>-tree provides a better representation of the granularity of images and is easier to apply to multichannel images. The major drawback of the <inline-formula> <tex-math notation="LaTeX">\alpha </tex-math></inline-formula>-tree is its processing speed, due to the large amount of data to be processed and the lack of studies on an efficient algorithms, especially on multichannel and high dynamic range images. In this study, we introduce a novel adaptation of the hybrid component tree algorithm on the <inline-formula> <tex-math notation="LaTeX">\alpha </tex-math></inline-formula>-tree for fast parallel <inline-formula> <tex-math notation="LaTeX">\alpha </tex-math></inline-formula>-tree construction in any dynamic range of pixel dissimilarity. We tested the hybrid <inline-formula> <tex-math notation="LaTeX">\alpha </tex-math></inline-formula>-tree algorithm on Sentinel-2 remote sensing images from the European Space Agency (ESA) as well as randomly generated images, on the Hábrók high performance computing cluster. Experimental results show that the hybrid <inline-formula> <tex-math notation="LaTeX">\alpha </tex-math></inline-formula>-tree algorithm achieves the processing speed of 10-30Mpix/s and the speedup of 10-30 on a 128-core computer, proving the efficiency of the first parallel <inline-formula> <tex-math notation="LaTeX">\alpha </tex-math></inline-formula>-tree algorithm in high dynamic range, to the best of our knowledge.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1057-7149
1941-0042
1941-0042
DOI:10.1109/TIP.2025.3616578