Similarity Hashing For Charged Particle Tracking

2019 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA)(2019)

引用 17|浏览55
暂无评分
摘要
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 (HL-LHC). 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.
更多
查看译文
关键词
Hashing,Tracking,ANN,Clustering,HEP
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要