Catch和Prolong:用于寻找候选轨迹的循环神经网络
Catch and Prolong: recurrent neural network for seeking track-candidates
摘要:
事例重建是高能核物理数据处理中的一个重要问题。它的主要部分是轨道重建过程,其中包括寻找基本粒子通过探测器时留下的所有轨道,这些轨道是在飞行粒子发射探测器坐标平面时产生的大量点(所谓的命中)中。不幸的是,跟踪是严重阻碍了著名的缺点,多线,条和GEM检测器,由于在他们的外观很多假的命中所造成的额外的虚假交叉发射条。由于这些假货的数量比真正的热门歌曲大几个数量级,因此人们面临着通过忽略假货的真正热门歌曲来解开可能的候选曲目的相当严重的困难。我们引入了一种更新的方法,这是对我们以前的两阶段方法的重大改进,该方法基于使用定向K-d树搜索的命中预处理,然后是深度神经分类器。我们结合这两个阶段在一个应用循环神经网络,同时确定一组点是否属于一个真正的轨道或没有,并预测在哪里寻找下一个点的跟踪检测器的下一个坐标平面。我们表明,提出的深度网络更准确,更快,不需要任何特殊的预处理阶段。我们的方法的BM@N GEM探测器的模拟事件的初步结果。
英文摘要:
One of the most important problems of data processing in high energy and nuclear physics is the event reconstruction. Its main part is the track reconstruction procedure which consists in looking for all tracks that elementary particles leave when they pass through a detector among a huge number of points, so-called hits, produced when flying particles fire detector coordinate planes. Unfortunately, the tracking is seriously impeded by the famous shortcoming of multiwired, strip and GEM detectors due to appearance in them a lot of fake hits caused by extra spurious crossings of fired strips. Since the number of those fakes is several orders of magnitude greater than for true hits, one faces with the quite serious difficulty to unravel possible track-candidates via true hits ignoring fakes. We introduce a renewed method that is a significant improvement of our previous two-stage approach based on hit preprocessing using directed K-d tree search followed a deep neural classifier. We combine these two stages in one by applying recurrent neural network that simultaneously determines whether a set of points belongs to a true track or not and predicts where to look for the next point of track on the next coordinate plane of the detector. We show that proposed deep network is more accurate, faster and does not require any special preprocessing stage. Preliminary results of our approach for simulated events of the BM@N GEM detector are presented.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。