mlsanityData to 7 Oct 2026

Segmentation of EM showers for neutrino experiments with deep graph neural networks

arXiv 2104.02040 ↗First posted 5 Apr 2021cs.LG hep-excited by 0

Not on the map. Why?

Abstract (arXiv)

We introduce a first-ever algorithm for the reconstruction of multiple showers from the data collected with electromagnetic (EM) sampling calorimeters. Such detectors are widely used in High Energy Physics to measure the energy and kinematics of in-going particles. In this work, we consider the case when many electrons pass through an Emulsion Cloud Chamber (ECC) brick, initiating electron-induced electromagnetic showers, which can be the case with long exposure times or large input particle flux. For example, SHiP experiment is planning to use emulsion detectors for dark matter search and neutrino physics investigation. The expected full flux of SHiP experiment is about 10^20 particles over five years. To reduce the cost of the experiment associated with the replacement of the ECC brick and off-line data taking (emulsion scanning), it is decided to increase exposure time. Thus, we expect to observe a lot of overlapping showers, which turn EM showers reconstruction into a challenging point cloud segmentation problem. Our reconstruction pipeline consists of a Graph Neural Network that predicts an adjacency matrix and a clustering algorithm. We propose a new layer type (EmulsionConv) that takes into account geometrical properties of shower development in ECC brick. For the clustering of overlapping showers, we use a modified hierarchical density-based clustering algorithm. Our method does not use any prior information about the incoming particles and identifies up to 87% of electromagnetic showers in emulsion detectors. The main test bench for the algorithm for reconstructing electromagnetic showers is going to be SND@LHC.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 13 of its 62 references that are in the map. First posted on arXiv 5 Apr 2021.

Builds on

13 of 62 references.

References · 13

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2018How Powerful are Graph Neural Networks?cited by 4,355
  3. 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
  4. 2018Dynamic Graph CNN for Learning on Point Cloudscited by 2,220
  5. 2017Focal Loss for Dense Object Detectioncited by 749
  6. 2017Understanding the Effective Receptive Field in Deep Convolutional Neural Networkscited by 549
  7. 2019DeepGCNs: Can GCNs Go as Deep as CNNs?cited by 527
  8. 2019PairNorm: Tackling Oversmoothing in GNNscited by 297
  9. 2021A Living Review of Machine Learning for Particle Physicscited by 77
  10. 2018GeniePath: Graph Neural Networks with Adaptive Receptive Pathscited by 66
  11. 2016A Convolutional Neural Network Neutrino Event Classifiercited by 26
  12. 2020Track Seeding and Labelling with Embedded-space Graph Neural Networkscited by 12
1 more
  1. 2021Instance Segmentation GNNs for One-Shot Conformal Tracking at the LHCcited by 4

Built on by

Not cited yet.