1 / 21

TRACK DICTIONARY (UPDATE) RESOLUTION, EFFICIENCY AND L – R AMBIGUITY SOLUTION

TRACK DICTIONARY (UPDATE) RESOLUTION, EFFICIENCY AND L – R AMBIGUITY SOLUTION. Claudio Chiri MEG meeting, 21 Jan 2004. The dictionary concept. Several tracks with similar kinematics producing a single hit pattern. Several tracks with similar kinematics producing a single hit pattern.

Download Presentation

TRACK DICTIONARY (UPDATE) RESOLUTION, EFFICIENCY AND L – R AMBIGUITY SOLUTION

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. TRACK DICTIONARY (UPDATE) RESOLUTION,EFFICIENCYAND L – R AMBIGUITY SOLUTION Claudio Chiri MEG meeting, 21 Jan 2004

  2. The dictionary concept Several tracks with similar kinematics producing a single hit pattern Several tracks with similar kinematics producing a single hit pattern Several tracks with similar kinematics producing a single hit pattern Several tracks with similar kinematics producing a single hit pattern Hit pattern Single and unique string(i.e. a dictionary key) Average (over the set) track parameters

  3. The track dictionary is a ordered list of records: Key (hit pattern)  average track parameters + rms The track dictionary exploits the “digital” response of the spectrometer NO Tdrift used NO z measurements used yet

  4. MC sample used to build the dictionary: • Positrons from Michel decay; • Unpolarized muons; • Generator level cuts: • 0.08 < |cosθ| < 0.35; • -60° < φ < 60° .

  5. Start with 50000 independent events The resulting dictionary consists of ~6500 different patterns Efficiency check on 10000 independent tracks produce: Efficiency = 86%

  6. Next steps for the dictionary update gives: 100000 generated events 9000 patterns; efficiency = 91% 250000 generated events 12900 patterns; efficiency = 95%

  7. Where are located the tracks populating the dictionary ? Wire N Sector N Not uniform spectrometer illumination  dictionary completeness does not grow linearly with generated statistics

  8. The actual dictionary is obtained with 250k independent MC tracks and consists of about 12900 different patterns The population of the patterns is not uniform: 40% has 1 entry 43% has 2 ÷ 10 entries 13% has 11 ÷ 50 entries 4% more than 50 entries Number of events in a dictionary record

  9. e+ Momentum components at the vertex Events in the dictionary Track first turn has hits in at least three sectors All events The spectrometer acceptance defines the e+ kinematics

  10. Other e+kinematics variables Events in the dictionary Track first turn has hits in at least three sectors All events

  11. How do the distributions of the average track parameters in the dictionary compare with the actual parameter distributions ?

  12. Momentum components for events in the dictionary LEFT RIGHT Px / MeV Px / MeV Event by event distributions Average in each Dictionary record Track first turn has hits in at least three sectors Py / MeV Py / MeV Pz / MeV Pz / MeV

  13. The comparison of the distributions of an average • parameter in the dictionary with the actual • parameter distribution shows: • Px and Py have similar shapes; • Pz • a hit pattern in the spectrometer cannot • tell the sign of Pz; • the shape of the distribution of |Pz| is not well reproduced •  • poor |Pz| resolution of the dictionary.

  14. What is the dictionary “resolution” for all parameters ? Generate a sample of independent events For tracks in the dictionary acceptance (Nsectors > 2) find the dictionary key compare; Px with <Px>(key); normalize to RMS<Px> vertex X Px vertex Y Py pMC - < pdict > σ vertex Z Pz

  15. LEFT – RIGHT AMBIGUITY SOLUTION Digitization of the MC hit from x,y,z to: number of sector (1-17), number of chamber (1-2) number of wire (1-9) D.C.A(digit) smearing of 200mm  Tdrift (const Vdrift) Z(digit) smearing of 300mm drift circle First reconstruction step Starting from digit ID and drift time, in each sector we have 4 possible solution (4 tangent segments)

  16. The assumption:track ~ circle with centre in C if PT and QT are straight segments tangent to C and intersecting in point T, then α = α´ The strategy:select the right tangents in two consecutive sectors by choosing the pairgiving the minimum Da=a-a´ C ‘ a’ a • Intrinsic limitations: • non uniform B implies that • tracks are not exactly circles • drift distance resolution P Q T

  17. The plot shows the distribution of Da for 1000 tracks All possible combinations (23097) Exact combinations (3778) We need to define a cut on Da which allows to keep high efficiency for correct left-right choices and to reject wrong combinations Da=0.24 rad rejects 57% of the incorrect solutions

  18. Efficiency vs Da • With Δα = 0.24 rad we reach • 90% of total efficiency in L – R • solution. • By definition, the total efficiency comes from two terms: • Tracks where the L – R • ambigurity is solved in each • sector (60%); • Tracks where the L – R • ambigurity isn’t solved only in • 1 sector (30%) efficiency Da cut

  19. To be donedictionary: • Optimize stats. given by 1 – eff. ~ 10-3 - 10-4 and by looking at RMS vs stats. (intrinsic resolution of method); • Add noise hits; • Add inefficiency of Drift Chamber; • Add drift time; • Superimpose tracks.

  20. To be doneL – R ambiguity solving: • improve efficiency, evaluate timing; • study the effect of resolution varying with the impact parameter • use the “calibrated” digits, (i.e. x,y.z as estimated after left-right ambiguity resolution) as starting points for F. Cei’s algorithm estimating track parameters.

  21. A long term plan once a fit algorithm is defined • Get dictionary output • if the hit pattern corresponds to a key • when/if the resolution is appropriate for the fit (save computing time) go to the track fit • Solve left-right ambiguity • if the track is not found in the dictionary • if the hit pattern gives ambiguous track parameters (high combinatorial calculations only when needed) go to the track fit else

More Related