Pith. sign in

REVIEW

Online Pattern Recognition for the ALICE High Level Trigger

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv physics/0307102 v1 pith:5WA7Y3BF submitted 2003-07-21 physics.ins-det

Online Pattern Recognition for the ALICE High Level Trigger

V. Lindenstruth , C. Loizides , D. Roehrich , B. Skaali , T. Steinbeck , R. Stock , H. Tilsner , K. Ullaland
show 2 more authors
A. Vestbo T. Vik (for the ALICE Collaboration)
This is my paper
classification physics.ins-det
keywords datahighaliceapproachclustercollisionsfinderlevel
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The ALICE High Level Trigger has to process data online, in order to select interesting (sub)events, or to compress data efficiently by modeling techniques.Focusing on the main data source, the Time Projection Chamber (TPC), we present two pattern recognition methods under investigation: a sequential approach "cluster finder" and "track follower") and an iterative approach ("track candidate finder" and "cluster deconvoluter"). We show, that the former is suited for pp and low multiplicity PbPb collisions, whereas the latter might be applicable for high multiplicity PbPb collisions, if it turns out, that more than 8000 charged particles would have to be reconstructed inside the TPC. Based on the developed tracking schemes we show, that using modeling techniques a compression factor of around 10 might be achievable

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.