Download presentation

Presentation is loading. Please wait.

Published byJacob Maldonado Modified over 4 years ago

1
FTPC Conformal Mapping Tracker Markus D. Oldenburg Max-Planck-Institut für Physik, München 24.02.2000

2
Overview zIntroduction zAlgorithm yConformal Mapping yData organization yTrack finding zPerformance zFirst Results zOutlook

3
Introduction zGlobal tracking algorithms ytreat all clusters equally zLocal tracking algorithms ytry to extend given track by adding a new cluster ylook for the next point in the expected direction

4
Conformal Mapping I zAssumption: Particles follow helical trajectories. y circular path in the bending plane y straight line in (s, z) space, with: xs: length of track in 3-dimensional space xz: coordinate along magnetic field

5
Conformal Mapping II zFitting of straight lines is easier and faster than fitting cirlces. z transform x, y coordinates of a cluster to x, y with: yx = (x - x t ) / r 2 yy = (y t - y) / r 2 yr 2 = (x - x t ) 2 + (y - y t ) 2

6
Data organization I zClusters are organized in sub-volumes. zSub-volumes are obtained by segmenting the tracking volume into cubes in (r, ) with yr = row, y = azimuthal angle, and y = pseudorapidity. zThe origin of this coordinate system is the main vertex.

7
Data organization II zEach volume is identified by three indexes (i r, i, i ). zEach cluster is uniquely associated with one sub-volume.

8
Track finding zProgram starts with youtermost padrows and proceeds towards inner most ones yclusters with smaller z uncrowded regions are searched first

9
Where to look for the next cluster? zIf cluster k is located in sub-volume (k r, k, k ) only look for the next cluster on this track in sub-volume (j r, j, j ) with yk r - N r j r k r - 1 yk - N j k + N z parameters N r, N, N

10
Tracklet search: build track segments zlink a cluster k to its closest unused cluster j zdistance d |k r - j r | (| k - j | + | k - j |) ziterate until tracklet consists of a certain number of clusters N

11
Tracklet extension to tracks zif # clusters on track is N: zfit clusters to straight lines in yconformal space for bending plane ytracklength s vs. z: s(z) ziterate until: yno additional cluster found track ends here yall found clusters exceeds cut(s) track ended before ymaximal amount of clusters attained

12
Vertex constraint on/off ztracking is done twice ywith (main) vertex constraint (conformal mapping transformation includes main vertex: x t, y t = 0) ywithout vertex constraint (first cluster on track gives x t, y t )

13
Parameters zGeneral: # of segments in (r, ) zDifferent settings for main vertex tracks and tracks without vertex constraint y# of clusters to perform tracklet search N yminimal # of clusters on a track y# of row segm. to look into for clusters N r xfor tracklet extension xfor track extension y# of segm. to look into for clusters N, N

14
Cuts to reject new clusters zDifferent cuts for main vertex tracks and tracks without vertex constraint ymaximal angle for tracklets ymaximal angle for tracks ymaximal distance from circle fit ymaximal distance from length fit

15
Outlook zTrack Evaluator has to be completed yto be able to understand current problems yto be able to compare different track algorithms zCuts have to be refined by looking into simulated data

Similar presentations

OK

Angles and Polar Coordinates. Angles Angles are a way to describe the difference in slope of two intersecting lines Vertex Angle.

Angles and Polar Coordinates. Angles Angles are a way to describe the difference in slope of two intersecting lines Vertex Angle.

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on carbon and its compounds class Ppt on bmc remedy change Ppt on computer basics in hindi Ppt on regional trade agreements in africa Ppt on basic etiquette and manners Ppt on adding and subtracting matrices Ppt on latest mobile technology Ppt on disk formatting mac Ppt on harvard business review Ppt on green building design