Back to Search Start Over

Parallel Processing of Image Databases for Accelerated Morphological Analysis.

Authors :
Goodell, Edward
Sjoden, Glenn
Porter, Reid
McDonald IV, Luther
Sentz, Kari
Source :
Nuclear Science & Engineering. Nov2024, Vol. 198 Issue 11, p2069-2079. 11p.
Publication Year :
2024

Abstract

Nuclear forensics relies on different signatures to identify the source of nuclear material. Such signatures include crystalline structure, chemical composition, and particle morphology. One way to quantify morphology in electron microscope imagery is through image segmentation, where pixels are assigned to several partitions (or groups) that correspond to particles, grains, and other objects of interest within the image. Once pixels are assigned to segments, it is relatively straightforward to quantify other quantities of interest, such as grain size, circularity, etc. However, the range and diversity of microscope images make it difficult to obtain an accurate segmentation automatically. The accuracy of segmentation can be improved through supervised learning, but this requires many images to be manually segmented. Another way to improve the accuracy is to use interactive segmentation. Interactive segmentation requires a human to provide image-specific user input to improve performance. However, the amount of user input (effort) is generally far less than is required for supervised learning. In this paper, we investigate several parallelization strategies to automatically explore the user input parameter space of interactive segmentation algorithms across a large number of images. Specifically, we investigate four different parallelization mechanisms in a high-performance computing (HPC) environment and use the Amdahl fraction to evaluate efficiency on multiple processor cores across multiple nodes. Ultimately, the parallelization strategy that was most efficient utilized the message passing interface integrated with the segmentation and quantification code. This strategy had an Amdahl fraction of 0.985 and a performance of about 0.251 s/image. These results indicate that the parameter space of interactive segmentation algorithms can be efficiently explored using HPC. This opens the door to future work where user input is reduced and where interactive image segmentation algorithms are automatically applied to large image sets. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
00295639
Volume :
198
Issue :
11
Database :
Academic Search Index
Journal :
Nuclear Science & Engineering
Publication Type :
Academic Journal
Accession number :
179686142
Full Text :
https://doi.org/10.1080/00295639.2023.2287802