arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2312.00042physics.data-ancs.LGhep-ex
收藏

DeepTreeGANv2:点云的迭代池化

DeepTreeGANv2: Iterative Pooling of Point Clouds

Deutsches Elektronen-Synchrotron DESY(德国电子同步加速器);Jülich Supercomputing Centre, Institute for Advanced Simulation(于利希超级计算中心,先进模拟研究所);RWTH Aachen University(亚琛工业大学)

Moritz Alfons Wilhelm Scham, Dirk Krücker, Kerstin Borras

AI总结:

本文提出DeepTreeGAN的扩展版本DeepTreeGANv2,引入判别器以基于树的方式迭代聚合点云,用于快速生成高能物理中的大型粒子簇射点云,并在JetNet 150数据集上验证了其复现复杂分布的能力。

摘要:

在高能物理中,使用详细且耗时的模拟来处理粒子与探测器的相互作用。为了用生成模型绕过这些模拟,需要在短时间内生成大型点云,同时必须正确建模粒子间的复杂依赖关系。粒子簇射本质上是基于树的过程,因为每个粒子都由上一代粒子的衰变或探测器相互作用产生。在这项工作中,我们对DeepTreeGAN进行了重大扩展,引入了一个判别器,能够以基于树的方式迭代地聚合此类点云。我们表明该模型能够复现复杂的分布,并在公开的JetNet 150数据集上评估了其性能。

英文摘要:

In High Energy Physics, detailed and time-consuming simulations are used for particle interactions with detectors. To bypass these simulations with a generative model, the generation of large point clouds in a short time is required, while the complex dependencies between the particles must be correctly modelled. Particle showers are inherently tree-based processes, as each particle is produced by the decay or detector interaction of a particle of the previous generation. In this work, we present a significant extension to DeepTreeGAN, featuring a critic, that is able to aggregate such point clouds iteratively in a tree-based manner. We show that this model can reproduce complex distributions, and we evaluate its performance on the public JetNet 150 dataset.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑