Status of fast tracking algorithm mdchough
Download
1 / 14

Status of Fast Tracking Algorithm MdcHough - PowerPoint PPT Presentation


  • 69 Views
  • Uploaded on
  • Presentation posted in: General

Status of Fast Tracking Algorithm MdcHough. Guowei YU 8 th March 2006. Outline. Introduction MdcHough Algorithm Results and Discussions Summary. Introduction. Algorithm Developments in MDC Reconstruction Presented by W.D.Li ,Migrated from ATLAS. Purpose Efficient track finding

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha

Download Presentation

Status of Fast Tracking Algorithm MdcHough

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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


Status of Fast Tracking Algorithm MdcHough

Guowei YU

8th March 2006


Outline

  • Introduction

  • MdcHough Algorithm

  • Results and Discussions

  • Summary


Introduction

  • Algorithm Developments in MDC Reconstruction

  • Presented by W.D.Li ,Migrated from ATLAS


  • Purpose

  • Efficient track finding

  • Nice transverse momentum resolution

  • High efficiency of track finding at high noise level


Cosθ=0.83

Cosθ=0.93

Interaction point

MdcHough Algorithm

  • 43 layers,19 axial type

  • |cos|<0.93

  • Cell is near square ~8.1mm


Flow of MdcHough

Initial track finding

MdcHough

Local maximum finding

Hits

PT

Track selection and Merging

Track fitting


Initial track finding (use a LUT-base Hough Transform)

(R,)  (,1/pT) [(0~2) pT (400MeV~)]

qCTR=sin (–0) CT= 0.3/pT

Build a wire-ordered look-up table (  1/pT= 300  100)

.

wire n+1

wire n

active wire n-1

wire .

.

Flow of MdcHough


Local maximum finding (select good track candidates by wired-oreded LUT)

Track selectionand Merging

Nhit > 15

Merge some tracks sharing more than 9 hits

Flow of MdcHough

Flow of MdcHough


Flow of MdcHough

Flow of MdcHough

  • Track fitting

  • Obtain hits from Bin-ordered LUT

  • Fitting track to get PT by using lpav tool

    .

    bin n+1

    bin n

    bin bin n-1

    number .

    .


Track Reconstruction CPU Time~ 1ms/1 track

Resolution of PT(1.0GeV )

Generate (PT :1GeV) by Fixpt

Efficiency of Reconstruction () VS cos(polar angular)

Results and Discussion

p=8.0 MeV


Efficiency of Reconstruction VS PT( e  p)

Momentum resolution VS PT (μ,e,π,p) Double Gauss Fit


Efficiency vs noise

Resolution VS noise

Noise level type 0: = C type 1:  1/r type 2: 1/r2 (PT:1.0GeV )


Summary

  • It costs about 1ms to reconstruct 1 track

  • Efficiency of reconstruction() :

  •  >99% (PT>300MeV) for single track

  •  >99% when noise level are 5%,10% ,15% and 20%

  •  decrease quickly when polar angular more than 0.8

  • Resolution of momentum(p):

  • PT < 1.0GeVp of proton is more than others

  • PT > 1.0GeVp keeps about same value for all particles

  • p turns badatnoise level is more than 10% in type “0”

  • Same results by adding wires shift;

  • Further work is to enhance  nearpolar angular and test the Algorithm in adjusted magnetic field


Thank!


ad
  • Login