Published June 2021 | Version v1
Journal article

Muon event localisation with AI

  • 1. Centre for Astrophysics and Supercomputing, Swinburne University of Technology, PO Box 218, Hawthorn, VIC 3122 (Australia)
  • 2. Centre for Medical Radiation Physics, University of Wollongong, Wollongong (Australia)
  • 3. Department of Radiation Science and Technology, Delft University of Technology (Netherlands)
  • 4. The University of Melbourne, Parkville, VIC 3010 (Australia)
  • 5. Swinburne University of Technology, John Street, Hawthorn, VIC (Australia)

Description

Low-cost muon detectors utilising cheap plastic scintillators and a limited number of individual silicon photomultipliers (SiPMs) offer a compelling approach to cheap experimental designs, provided the event localisation of a traversing particle can be accurately determined. In this theoretical work, we use Geant4 to simulate a diverse range of detector configurations, shapes and SiPM photosensors, predicting the light intensity received at a given SiPM. Testing a range of methods to localise muon events we determine that machine learning techniques outperform analytic models, and of these, a simple gradient boosted framework is the most reliably accurate localisation technique for our simulated scintillators. We find that a simple square scintillator outperforms other geometries and that AI performs, when applied to this shape, with a linear relationship between the positional accuracy of the event recovery and the average distance between photosensors around the detector perimeter.

Availability note (English)

Available from http://dx.doi.org/10.1016/j.nima.2021.165237

Additional details

Identifiers

DOI
10.1016/j.nima.2021.165237;
PII
S0168900221002217;

Publishing Information

Journal Title
Nuclear Instruments and Methods in Physics Research. Section A, Accelerators, Spectrometers, Detectors and Associated Equipment
Journal Volume
1001
Journal Page Range
vp.
ISSN
0168-9002
CODEN
NIMAER

Optional Information

Copyright
Copyright (c) 2021 Elsevier B.V. All rights reserved.