Clustering of Electromagnetic Showers and Particle Interactions with Graph Neural Networks in Liquid Argon Time Projection Chambers Data

• URL: http://arxiv.org/abs/2007.01335v3
• Date: Tue, 15 Dec 2020 04:42:41 GMT
• Title: Clustering of Electromagnetic Showers and Particle Interactions with Graph Neural Networks in Liquid Argon Time Projection Chambers Data
• Authors: Francois Drielsma, Qing Lin, Pierre C\^ote de Soux, Laura Domin\'e, Ran Itay, Dae Heun Koh, Bradley J. Nelson, Kazuhiro Terao, Ka Vang Tsang, Tracy L. Usher
• Abstract summary: Liquid Argon Time Projection Chambers (LArTPCs) are a class of detectors that produce high resolution images of charged particles within their sensitive volume. The clustering of distinct particles into superstructures is of central importance to the current and future neutrino physics program. This paper uses Graph Neural Networks (GNNs) to predict the adjacency matrix of EM shower fragments and to identify the origin of showers.
• Score: 4.653747487703939
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Liquid Argon Time Projection Chambers (LArTPCs) are a class of detectors that produce high resolution images of charged particles within their sensitive volume. In these images, the clustering of distinct particles into superstructures is of central importance to the current and future neutrino physics program. Electromagnetic (EM) activity typically exhibits spatially detached fragments of varying morphology and orientation that are challenging to efficiently assemble using traditional algorithms. Similarly, particles that are spatially removed from each other in the detector may originate from a common interaction. Graph Neural Networks (GNNs) were developed in recent years to find correlations between objects embedded in an arbitrary space. The Graph Particle Aggregator (GrapPA) first leverages GNNs to predict the adjacency matrix of EM shower fragments and to identify the origin of showers, i.e. primary fragments. On the PILArNet public LArTPC simulation dataset, the algorithm achieves achieves a shower clustering accuracy characterized by a mean adjusted Rand index (ARI) of 97.8 % and a primary identification accuracy of 99.8 %. It yields a relative shower energy resolution of $(4.1+1.4/\sqrt{E (\text{GeV})})\,\%$ and a shower direction resolution of $(2.1/\sqrt{E(\text{GeV})})^{\circ}$. The optimized algorithm is then applied to the related task of clustering particle instances into interactions and yields a mean ARI of 99.2 % for an interaction density of $\sim\mathcal{O}(1)\,m^{-3}$.

Related papers

• NuGraph2: A Graph Neural Network for Neutrino Physics Event Reconstruction [0.3088816319960295]
  This article describes NuGraph2, a Graph Neural Network (GNN) for low-level reconstruction of simulated neutrino interactions in a LArTPC detector. The network operates directly on detector observables across multiple 2D representations, but utilizes a 3D-context-aware mechanism to encourage consistency between these representations.
  arXiv  Detail & Related papers  (2024-03-18T15:26:05Z)
• Interpretable Joint Event-Particle Reconstruction for Neutrino Physics at NOvA with Sparse CNNs and Transformers [124.29621071934693]
  We present a novel neural network architecture that combines the spatial learning enabled by convolutions with the contextual learning enabled by attention. TransformerCVN simultaneously classifies each event and reconstructs every individual particle's identity. This architecture enables us to perform several interpretability studies which provide insights into the network's predictions.
  arXiv  Detail & Related papers  (2023-03-10T20:36:23Z)
• Transformer with Implicit Edges for Particle-based Physics Simulation [135.77656965678196]
  Transformer with Implicit Edges (TIE) captures the rich semantics of particle interactions in an edge-free manner. We evaluate our model on diverse domains of varying complexity and materials.
  arXiv  Detail & Related papers  (2022-07-22T03:45:29Z)
• Fast Simulation of Particulate Suspensions Enabled by Graph Neural Network [21.266813711114153]
  We introduce a new framework, hydrodynamic interaction graph neural network (HIGNN), for inferring and predicting the particles' dynamics in Stokes suspensions. It overcomes the limitations of traditional approaches in computational efficiency, accuracy, and/or transferability. We demonstrate the accuracy, efficiency, and transferability of the proposed HIGNN framework in a variety of systems.
  arXiv  Detail & Related papers  (2022-06-17T14:05:53Z)
• Density-Based Clustering with Kernel Diffusion [59.4179549482505]
  A naive density corresponding to the indicator function of a unit $d$-dimensional Euclidean ball is commonly used in density-based clustering algorithms. We propose a new kernel diffusion density function, which is adaptive to data of varying local distributional characteristics and smoothness.
  arXiv  Detail & Related papers  (2021-10-11T09:00:33Z)
• Structure-aware Interactive Graph Neural Networks for the Prediction of Protein-Ligand Binding Affinity [52.67037774136973]
  Drug discovery often relies on the successful prediction of protein-ligand binding affinity. Recent advances have shown great promise in applying graph neural networks (GNNs) for better affinity prediction by learning the representations of protein-ligand complexes. We propose a structure-aware interactive graph neural network (SIGN) which consists of two components: polar-inspired graph attention layers (PGAL) and pairwise interactive pooling (PiPool)
  arXiv  Detail & Related papers  (2021-07-21T03:34:09Z)
• Segmentation of EM showers for neutrino experiments with deep graph neural networks [3.330229314824913]
  We introduce a novel method for showers reconstruction from the data collected with electromagnetic (EM) sampling calorimeters. In this work, we consider the case when a large number of particles pass through an Cloud Chamber (ECC) brick, generating electromagnetic showers. Our method does not use any prior information about the incoming particles and identifies up to 82% of electromagnetic showers in emulsion detectors.
  arXiv  Detail & Related papers  (2021-04-05T17:45:21Z)
• Scalable Graph Networks for Particle Simulations [1.933681537640272]
  We introduce an approach that transforms a fully-connected interaction graph into a hierarchical one. Using our approach, we are able to train models on much larger particle counts, even on a single GPU. Our approach retains high accuracy and efficiency even on large-scale gravitational N-body simulations.
  arXiv  Detail & Related papers  (2020-10-14T10:54:54Z)
• Fast Gravitational Approach for Rigid Point Set Registration with Ordinary Differential Equations [79.71184760864507]
  This article introduces a new physics-based method for rigid point set alignment called Fast Gravitational Approach (FGA) In FGA, the source and target point sets are interpreted as rigid particle swarms with masses interacting in a globally multiply-linked manner while moving in a simulated gravitational force field. We show that the new method class has characteristics not found in previous alignment methods.
  arXiv  Detail & Related papers  (2020-09-28T15:05:39Z)
• Scalable, Proposal-free Instance Segmentation Network for 3D Pixel Clustering and Particle Trajectory Reconstruction in Liquid Argon Time Projection Chambers [2.5576696189824912]
  Liquid Argon Time Projection Chambers (LArTPCs) are high resolution particle imaging detectors. We propose the first scalable deep learning algorithm for particle clustering in LArTPC data using sparse convolutional neural networks (SCNN) We benchmark the performance of our algorithm on PILArNet, a public 3D particle imaging dataset.
  arXiv  Detail & Related papers  (2020-07-06T21:37:28Z)
• Block-Approximated Exponential Random Graphs [77.4792558024487]
  An important challenge in the field of exponential random graphs (ERGs) is the fitting of non-trivial ERGs on large graphs. We propose an approximative framework to such non-trivial ERGs that result in dyadic independence (i.e., edge independent) distributions. Our methods are scalable to sparse graphs consisting of millions of nodes.
  arXiv  Detail & Related papers  (2020-02-14T11:42:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.