1 / 61

Forward Tracking in the ILD Detector

Forward Tracking in the ILD Detector. ILC. Standalone track search for the FTDs (Forward Tracking Disks). the goal. Track Reconstruction. Vertextion Reconstruction. Digitizer. Why not combine with TPC tracking?. TPC. FTDs. Methods. Cellular Automaton Kalman Filter

gyda
Download Presentation

Forward Tracking in the ILD Detector

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Forward Tracking in the ILD Detector

  2. ILC

  3. Standalone track search for the FTDs (Forward Tracking Disks) the goal

  4. Track Reconstruction Vertextion Reconstruction Digitizer

  5. Why not combine with TPC tracking?

  6. TPC

  7. FTDs

  8. Methods • Cellular Automaton • Kalman Filter • Hopfield Neural Network

  9. The Cellular Automaton

  10. The Cellular Automaton

  11. It's about rules

  12. IP

  13. cell ( segment)

  14. state 0

  15. On the FTDs

  16. The Hits

  17. The Segments

  18. Cellular Automaton

  19. Clean Up

  20. Longer Segments

  21. Cellular Automaton

  22. Clean Up

  23. Track Candidates

  24. Kalman Filter • Prediction → Filtering (Updating) → Smoothing • Superior to simple helix fitter • Quality Indicator: χ ² probability

  25. Kalman Filter • Prediction → Filtering (Updating) → Smoothing • Superior to simple helix fitter • Quality Indicator: χ ² probability

  26. Track Candidates

  27. Kalman Filter

  28. p > 0.005

  29. The Hopfield Neural Network • Track ↔ Neuron • Goal: the global minimum

  30. T=0 T=1 T=2

  31. Background • Inner 2 disks are pixel detectors • How many bunch crossings? • 100 BX * hit density ≈ 900 hits / pixel disk

  32. Ghost hits • Outer 5 disks are strip detectors • Solution: shallow angle

  33. At the moment • Conversion to new geometry (staggered petals) • Debugging and efficiency • Seperating core form implementation • Sensible use of Hopfield Neural Network • Robustification • Picking up hits from other places • More analysis • Individual steering for pattern recognition → xml file • Measure the improvement (old vs. new software)

  34. Thanks to • Rudi Frühwirth and Winfried Mitaroff • Steve Aplin, Frank Gaede and Jan Engels • And Jakob Lettenbichler (Belle 2)

  35. Thank you!

More Related