Similarity hashing for charged particle tracking

Sabrina Amrouche, Tobias Golling, Moritz Kiehn, Claudia Plant, Andreas Salzburger

Abstract

The tracking of charged particles produced in high energy collisions is particularly challenging. The combinatorics approach currently used to track tens of thousands of particles becomes inadequate as the number of simultaneous collisions increase at the High Luminosity Large Hadron Collider (HLLHC). We propose to reduce the complexity of tracking in such dense environments with the use of similarity hashing. We use hashing techniques to separate the detector space into buckets. The particle purity of these buckets is increased using Approximate Nearest Neighbors search. The bucket size is sufficiently small to significantly reduce the complexity of track reconstruction within the buckets. We demonstrate the use of the proposed approach on a public dataset of simulated collisions. The performance evaluation shows a significant speed improvement over the current technique and a further understanding of charged particles structure.
BibTeX
@inproceedings{amrouche2019similarity,
  author = {Sabrina Amrouche and Tobias Golling and Moritz Kiehn and Claudia Plant and Andreas Salzburger},
  title = {{Similarity hashing for charged particle tracking}},
  booktitle = {IEEE BigData},
  year = {2019},
  doi = {10.1109/bigdata47090.2019.9006316},
}

Loading related content...

Figure