BC Reconstruction Sharon Seun Algorithm by E P
BC Reconstruction Sharon Seun Algorithm by E. P. Hartouni 1. Hit Association 2. Track Finding 3. View Matching 4. Track Fitting Goal: determine some parameters in the algorithm
Algorithm 1. Hit Association – Goal: reduce the number of first and last chamber combinations – Adjacent hits within each plane are found and grouped together Wi Wi+1
Algorithm 2. Track Finding – Loops through all pair of associated hits in BC 1 and BC 3. Every pair of hits defines a line which intersects BC 2 in that view (u, v, s, t) w*2 ij = c 1 w 2 i + c 2 w 3 j – Search a road ±n wires wide around the prediction w*2 ij in the list of hits BC 2 – Pairs passing this test are kept in the track candidate list (Cand. Pair_t f. Cand. Trk)
Determine n in Track Finding (100 events) Choose n = ± 10
Algorithm 3. View Matching – Loop over track candidate list in u-s views – Predict wire indices in complementary views: 6 predictions are made – Final test: 5 out of 6 predictions find a hit within the road ±n around the predicted wire. – Form straight line 3 D trajectory (Cand. Trajectory_t f. Cand. Traj)
Determine n in View Matching (100 events)
Determine n in View Matching (100 events)
Determine n in View Matching (100 events) Choose n = ± 5?
Conclusion • BCReco is working as predicted • Trk. Find_n = 10, View. Match_n = 5? • Test on MC is needed to finalize the cuts in Track Finding and View Matching
- Slides: 9