Combination of various data analysis techniques for efficient track reconstruction in very high multiplicity events

Research output: Contribution to journalConference article

Abstract

A novel combination of established data analysis techniques for reconstructing charged-particles in high energy collisions is proposed. It uses all information available in a collision event while keeping competing choices open as long as possible. Suitable track candidates are selected by transforming measured hits to a binned, three- or four-dimensional, track parameter space. It is accomplished by the use of templates taking advantage of the translational and rotational symmetries of the detectors. Track candidates and their corresponding hits, the nodes, form a usually highly connected network, a bipartite graph, where we allow for multiple hit to track assignments, edges. In order to get a manageable problem, the graph is cut into very many minigraphs by removing a few of its vulnerable components, edges and nodes. Finally the hits are distributed among the track candidates by exploring a deterministic decision tree. A depth-limited search is performed maximizing the number of hits on tracks, and minimizing the sum of track-fit χ2. Simplified but realistic models of LHC silicon trackers including the relevant physics processes are used to test and study the performance (efficiency, purity, timing) of the proposed method in the case of single or many simultaneous proton-proton collisions (high pileup), and for single heavy-ion collisions at the highest available energies.

Original languageEnglish
Article number00011
JournalEPJ Web of Conferences
Volume150
DOIs
Publication statusPublished - Aug 8 2017
EventWorkshop on Connecting the Dots/ Intelligent Trackers, CTD/WIT 2017 - Orsay, France
Duration: Mar 6 2017Mar 9 2017

Fingerprint

collisions
protons
ionic collisions
charged particles
purity
templates
time measurement
physics
energy
detectors
symmetry
silicon

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Cite this

Combination of various data analysis techniques for efficient track reconstruction in very high multiplicity events. / Siklér, F.

In: EPJ Web of Conferences, Vol. 150, 00011, 08.08.2017.

Research output: Contribution to journalConference article

@article{5ea3e8f33bc44576a39ad0acf815951c,
title = "Combination of various data analysis techniques for efficient track reconstruction in very high multiplicity events",
abstract = "A novel combination of established data analysis techniques for reconstructing charged-particles in high energy collisions is proposed. It uses all information available in a collision event while keeping competing choices open as long as possible. Suitable track candidates are selected by transforming measured hits to a binned, three- or four-dimensional, track parameter space. It is accomplished by the use of templates taking advantage of the translational and rotational symmetries of the detectors. Track candidates and their corresponding hits, the nodes, form a usually highly connected network, a bipartite graph, where we allow for multiple hit to track assignments, edges. In order to get a manageable problem, the graph is cut into very many minigraphs by removing a few of its vulnerable components, edges and nodes. Finally the hits are distributed among the track candidates by exploring a deterministic decision tree. A depth-limited search is performed maximizing the number of hits on tracks, and minimizing the sum of track-fit χ2. Simplified but realistic models of LHC silicon trackers including the relevant physics processes are used to test and study the performance (efficiency, purity, timing) of the proposed method in the case of single or many simultaneous proton-proton collisions (high pileup), and for single heavy-ion collisions at the highest available energies.",
author = "F. Sikl{\'e}r",
year = "2017",
month = "8",
day = "8",
doi = "10.1051/epjconf/201715000011",
language = "English",
volume = "150",
journal = "EPJ Web of Conferences",
issn = "2101-6275",
publisher = "EDP Sciences",

}

TY - JOUR

T1 - Combination of various data analysis techniques for efficient track reconstruction in very high multiplicity events

AU - Siklér, F.

PY - 2017/8/8

Y1 - 2017/8/8

N2 - A novel combination of established data analysis techniques for reconstructing charged-particles in high energy collisions is proposed. It uses all information available in a collision event while keeping competing choices open as long as possible. Suitable track candidates are selected by transforming measured hits to a binned, three- or four-dimensional, track parameter space. It is accomplished by the use of templates taking advantage of the translational and rotational symmetries of the detectors. Track candidates and their corresponding hits, the nodes, form a usually highly connected network, a bipartite graph, where we allow for multiple hit to track assignments, edges. In order to get a manageable problem, the graph is cut into very many minigraphs by removing a few of its vulnerable components, edges and nodes. Finally the hits are distributed among the track candidates by exploring a deterministic decision tree. A depth-limited search is performed maximizing the number of hits on tracks, and minimizing the sum of track-fit χ2. Simplified but realistic models of LHC silicon trackers including the relevant physics processes are used to test and study the performance (efficiency, purity, timing) of the proposed method in the case of single or many simultaneous proton-proton collisions (high pileup), and for single heavy-ion collisions at the highest available energies.

AB - A novel combination of established data analysis techniques for reconstructing charged-particles in high energy collisions is proposed. It uses all information available in a collision event while keeping competing choices open as long as possible. Suitable track candidates are selected by transforming measured hits to a binned, three- or four-dimensional, track parameter space. It is accomplished by the use of templates taking advantage of the translational and rotational symmetries of the detectors. Track candidates and their corresponding hits, the nodes, form a usually highly connected network, a bipartite graph, where we allow for multiple hit to track assignments, edges. In order to get a manageable problem, the graph is cut into very many minigraphs by removing a few of its vulnerable components, edges and nodes. Finally the hits are distributed among the track candidates by exploring a deterministic decision tree. A depth-limited search is performed maximizing the number of hits on tracks, and minimizing the sum of track-fit χ2. Simplified but realistic models of LHC silicon trackers including the relevant physics processes are used to test and study the performance (efficiency, purity, timing) of the proposed method in the case of single or many simultaneous proton-proton collisions (high pileup), and for single heavy-ion collisions at the highest available energies.

UR - http://www.scopus.com/inward/record.url?scp=85028370757&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85028370757&partnerID=8YFLogxK

U2 - 10.1051/epjconf/201715000011

DO - 10.1051/epjconf/201715000011

M3 - Conference article

AN - SCOPUS:85028370757

VL - 150

JO - EPJ Web of Conferences

JF - EPJ Web of Conferences

SN - 2101-6275

M1 - 00011

ER -