# Global track finding algorithms

- Institution: CERN
- Department: Inverted CSC
- Speaker: Dmitry Neverov
- Year: 2019
- Language: English
- Subjects: Computer science
- Source: [CERN](https://videos.cern.ch/record/3006072)
- Licence: [CERN](http://copyright.web.cern.ch)
- Who can watch: Tweens profiles and older (sources give no ratings; placed by Invisible Network from the source's own words)

In high energy physics experiments the reconstruction of tracks of charged particles provides the core for the measurements of these particles' properties. Track finding algorithms can roughly be divided into two main categories: local and global. Local track finding algorithms try to link individual hits one by one while utilizing a variety of smart techniques to mitigate combinatorial complexity, whereas global track finding algorithms treat all hits simultaneously.

In this lecture we will look into track finding algorithms in wire chambers that are performed on all hits at once. The search is done by converting individual hit parameters to a curve in a dual space using Legendre or Hough transform, with the intersection of multiple curves corresponding to a track compatible with given hits. Then, the problem of finding a track is translated to the problem of finding most densely populated regions in the dual space which can be done effectively and quickly by a quadtree search..

0:00:00 Slide 1

0:00:29 Slide 2

0:01:47 Slide 3

0:04:15 Slide 4

0:06:09 Slide 5

0:06:59 Slide 6

0:07:32 Slide 7

0:07:44 Slide 8

0:09:34 Slide 9

0:10:48 Slide 10

0:12:04 Slide 11

0:12:31 Slide 12

0:13:09 Slide 13

0:13:37 Slide 14

0:13:41 Slide 15

0:13:57 Slide 16

0:14:46 Slide 17

0:16:16 Slide 18

0:17:19 Slide 19

0:18:07 Slide 20

0:19:04 Slide 21

0:21:08 Slide 22

0:21:13 Slide 23

0:22:03 Slide 24

0:22:18 Slide 25

0:23:07 Slide 26

0:24:34 Slide 27

0:24:41 Slide 28

0:25:21 Slide 29

0:25:55 Slide 30

0:26:18 Slide 31

0:27:07 Slide 32

0:27:45 Slide 33

0:28:12 Slide 34

0:28:47 Slide 35

0:29:12 Slide 36

0:29:51 Slide 37

0:30:14 Slide 38

0:31:12 Slide 39

0:31:18 Slide 40

0:32:20 Slide 41

0:33:09 Slide 42

0:33:13 Slide 43

0:33:26 Slide 44

0:33:35 Slide 45

0:34:24 Slide 46

0:35:10 Slide 47

0:36:30 Slide 48

0:36:36 Slide 49

0:37:20 Slide 50

0:37:51 Slide 51

0:38:06 Slide 52

0:38:23 Slide 53

0:38:53 Slide 54

0:38:59 Slide 55

0:39:09 Slide 56…

## Lectures

1. [Global track finding algorithms](https://invisiblenetwork.ai/learn/cern/3006072/090080bd98c5), 47 min (CERN's player)