一种大规模持续同调计算的分布式方法
A Distributed Approach for Persistent Homology Computation on a Large Scale
AI总结:
针对持续同调计算成本高、难以应对海量成像数据的问题,提出新型算法PixHomology及基于Apache Spark的分布式优化版本,可高效处理二维图像0维持续同调,在内存、耗时和扩展性上均优于现有主流工具。
摘要:
持续同调(Persistent Homology,PH)是一种强大的数学方法,可自动从图像中提取相关洞见,例如电子显微镜或新一代望远镜等高分辨率成像设备获取的图像。然而,该方法的应用计算成本极高,且由于新型成像设备生成的数据量不断增长,这一成本势必会急剧攀升。本文提出了PixHomology,这是一种用于高效计算二维图像上0维PH的新型算法,可优化内存占用与处理时间。借助Apache Spark框架,我们还提出了该算法的分布式版本及若干优化变体,能够并行处理大批量天文图像。最后,我们展示了实验分析结果,表明我们的算法及其分布式版本在所需内存、执行时间和可扩展性方面均表现高效,在处理大型数据集时,性能始终优于现有的最先进PH计算工具。
英文摘要:
Persistent homology (PH) is a powerful mathematical method to automatically extract relevant insights from images, such as those obtained by high-resolution imaging devices like electron microscopes or new-generation telescopes. However, the application of this method comes at a very high computational cost, that is bound to explode more because new imaging devices generate an ever-growing amount of data. In this paper we present PixHomology, a novel algorithm for efficiently computing $0$-dimensional PH on 2D images, optimizing memory and processing time. By leveraging the Apache Spark framework, we also present a distributed version of our algorithm with several optimized variants, able to concurrently process large batches of astronomical images. Finally, we present the results of an experimental analysis showing that our algorithm and its distributed version are efficient in terms of required memory, execution time, and scalability, consistently outperforming existing state-of-the-art PH computation tools when used to process large datasets.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。