Cluster finding in CALICE calorimeters Chris Ainsley University of Cambridge, UK General CALICE meeting: simulation/reconstruction session 28  29 June.

Slides:



Advertisements
Similar presentations
PFA-Enhanced Dual Readout Crystal Calorimetry Stephen Magill - ANL Hans Wenzel - FNAL Outline : Motivation Detector Parameters Use of a PFA in Dual Readout.
Advertisements

P. Gay Energy flow session1 Analytic Energy Flow F. Chandez P. Gay S. Monteil CALICE Coll.
Application of layer-by-layer clustering to a generalised calorimeter Chris Ainsley University of Cambridge General CALICE meeting March 2005, NIU,
Simulation of Z->jets in CMS Outline –Introduction –Technique –Results –Conclusion.
1 Study of the Tail Catcher Muon Tracker (TCMT) Scintillator Strips and Leakage with Simulated Coil Rick Salcido Northern Illinois University For CALICE.
Testbeam Requirements for LC Calorimetry S. R. Magill for the Calorimetry Working Group Physics/Detector Goals for LC Calorimetry E-flow implications for.
EF with simple multi-particle states Vishnu V. Zutshi NIU/NICADD.
ECFA-ILC Vienna 16/11/05Mark Thomson 1 Particle Flow Mark Thomson University of Cambridge This Talk:  Software needs for Detector Optimisation  Particle.
Ties Behnke, Vasiliy Morgunov 1SLAC simulation workshop, May 2003 Pflow in SNARK: the next steps Ties Behnke, SLAC and DESY; Vassilly Morgunov, DESY and.
1Calice-UK Cambridge 9/9/05D.R. Ward David Ward Compare Feb’05 DESY data with Geant4 and Geant3 Monte Carlos. Work in progress – no definitive conclusions.
Some early attempts at PFA Dhiman Chakraborty. LCWS05 Some early attempts at PFA Dhiman Chakraborty2 Introduction Primarily interested in exploring the.
Towards a clustering algorithm for CALICE Chris Ainsley University of Cambridge General CALICE meeting 7-8 December 2004, DESY, Germany.
 Track-First E-flow Algorithm  Analog vs. Digital Energy Resolution for Neutral Hadrons  Towards Track/Cal hit matching  Photon Finding  Plans E-flow.
Clustering: Algorithm development and analysis R. Cassell, G. Bower.
Calice Meeting / DESY/January 2004D.R. Ward1 David Ward University of Cambridge Test beam requirements? Studies of cuts and models Fluka studies Clustering.
A preliminary analysis of the CALICE test beam data Dhiman Chakraborty, NIU for the CALICE Collaboration LCWS07, Hamburg, Germany May 29 - June 3, 2007.
PFA Development – Definitions and Preparation 0) Generate some events w/G4 in proper format 1)Check Sampling Fractions ECAL, HCAL separately How? Photons,
1/9/2003 UTA-GEM Simulation Report Venkatesh Kaushik 1 Simulation Study of Digital Hadron Calorimeter Using GEM Venkatesh Kaushik* University of Texas.
Angular resolution study of isolated gamma with GLD detector simulation 2007/Feb/ ACFA ILC Workshop M1 ICEPP, Tokyo Hitoshi HANO collaborated with Acfa-Sim-J.
Introduction Multi-jets final states are of major interest for the LC Physics EFlow : An essential test to design the foreseen detector Software (Algorithms)
2004 Xmas MeetingSarah Allwood WW Scattering at ATLAS.
Summary of Simulation and Reconstruction Shaomin CHEN (Tsinghua University)  Framework and toolkit  Application in ILC detector design Jupiter/Satellites,
A flexible approach to cluster- finding in generic calorimeters of the FLC detector Chris Ainsley University of Cambridge, U.K. 2 nd ECFA Workshop: simulation/reconstruction.
Event Reconstruction in SiD02 with a Dual Readout Calorimeter Detector Geometry EM Calibration Cerenkov/Scintillator Correction Jet Reconstruction Performance.
Angular resolution study of GLD Calorimeter 2006/Dec/21 ILC-sousei Annual Meeting M1 ICEPP, Tokyo Hitoshi HANO.
PFA Template Concept Performance Mip Track and Interaction Point ID Cluster Pointing Algorithm Single Particle Tests of PFA Algorithms S. Magill ANL.
Development of a Particle Flow Algorithms (PFA) at Argonne Presented by Lei Xia ANL - HEP.
Two Density-based Clustering Algorithms L. Xia (ANL) V. Zutshi (NIU)
1 Calorimetry Simulations Norman A. Graf for the SLAC Group January 10, 2003.
Cluster finding in CALICE calorimeters Chris Ainsley University of Cambridge, UK LCWS 04: Simulation (reconstruction) parallel session 20 April 2004, Paris,
Positional and Angular Resolution of the CALICE Pre-Prototype ECAL Hakan Yilmaz.
LCWS06 Bangalore 13/3/06Mark Thomson 1 A Topologic Approach to Particle Flow “PandoraPFA” Mark Thomson University of Cambridge This Talk:  Philosophy.
CBM ECAL simulation status Prokudin Mikhail ITEP.
1ECFA/Vienna 16/11/05D.R. Ward David Ward Compare these test beam data with Geant4 and Geant3 Monte Carlos. CALICE has tested an (incomplete) prototype.
13 July 2005 ACFA8 Gamma Finding procedure for Realistic PFA T.Fujikawa(Tohoku Univ.), M-C. Chang(Tohoku Univ.), K.Fujii(KEK), A.Miyamoto(KEK), S.Yamashita(ICEPP),
Photon reconstruction and matching Prokudin Mikhail.
Fast Shower Simulation in ATLAS Calorimeter Wolfgang Ehrenfeld – University of Hamburg/DESY On behalf of the Atlas-Calorimeter and Atlas-Fast-Parameterisation.
1 D.Chakraborty – VLCW'06 – 2006/07/21 PFA reconstruction with directed tree clustering Dhiman Chakraborty for the NICADD/NIU software group Vancouver.
Status of Reconstruction in sidloi3 Ron Cassell 5/20/10.
Presented by: Idan Aharoni
5-9 June 2006Erika Garutti - CALOR CALICE scintillator HCAL commissioning experience and test beam program Erika Garutti On behalf of the CALICE.
Ties Behnke: Event Reconstruction 1Arlington LC workshop, Jan 9-11, 2003 Event Reconstruction Event Reconstruction in the BRAHMS simulation framework:
John Marshall, 1 John Marshall, University of Cambridge LCD Meeting, December
Individual Particle Reconstruction The PFA Approach to Detector Development for the ILC Steve Magill (ANL) Norman Graf, Ron Cassell (SLAC)
Calice Meeting Argonne Muon identification with the hadron calorimeter Nicola D’Ascenzo.
Strip-splitting method for ECAL clustering K. Kawagoe (Kobe) for K. Kotera (Shinshu) CALICE meeting, Casablanca 24th September,
Calibration of the ZEUS calorimeter for hadrons and jets Alex Tapper Imperial College, London for the ZEUS Collaboration Workshop on Energy Calibration.
Two-particle separation studies with a clustering algorithm for CALICE Chris Ainsley University of Cambridge CALICE (UK) meeting 10 November 2004, UCL.
7/13/2005The 8th ACFA Daegu, Korea 1 T.Yoshioka (ICEPP), M-C.Chang(Tohoku), K.Fujii (KEK), T.Fujikawa (Tohoku), A.Miyamoto (KEK), S.Yamashita.
Mark Thomson University of Cambridge High Granularity Particle Flow Calorimetry.
12/20/2006ILC-Sousei Annual KEK1 Particle Flow Algorithm for Full Simulation Study ILC-Sousei Annual KEK Dec. 20 th -22 nd, 2006 Tamaki.
2005/07/12 (Tue)8th ACFA Full simulator study of muon detector and calorimeter 8th ACFA Workshop at Daegu, Korea 2005/07/12 (Tue) Hiroaki.
John Marshall, 1 John Marshall, University of Cambridge LCD-WG2, July
ECAL Interaction layer PFA Template Track/CalCluster Association Track extrapolation Mip finding Shower interaction point Shower cluster pointing Shower.
1 Dead material correction status. Alexei Maslennikov, Guennadi Pospelov. Bratislava/Kosice/MPI Calorimeter Meeting. 8-December Problems with DM.
Michele Faucci Giannelli
Performance of jets algorithms in ATLAS
slicPandora: slic + pandoraPFANew
Interactions of hadrons in the Si-W ECAL
Studies with PandoraPFA
Individual Particle Reconstruction
EFA/DHCal development at NIU
Rick Salcido Northern Illinois University For CALICE Collaboration
Argonne National Laboratory
Detector Optimization using Particle Flow Algorithm
Michele Faucci Giannelli
Steve Magill Steve Kuhlmann ANL/SLAC Motivation
A clustering algorithm for a generalised calorimeter
LC Calorimeter Testbeam Requirements
Sheraton Waikiki Hotel
Presentation transcript:

Cluster finding in CALICE calorimeters Chris Ainsley University of Cambridge, UK General CALICE meeting: simulation/reconstruction session 28  29 June 2004, CERN, Switzerland

Chris Ainsley General CALICE meeting 28  29 June 2004, CERN, Switzerland 2 Motivation Desire for excellent jet energy resolution at future LC  calorimeter needs to be highly granular to resolve individual particles within jets;  calorimeter will have tracker-like behaviour: unprecedented;  novel approach to calorimeter clustering required. Aim to produce a flexible clustering algorithm, independent of ultimate detector configuration and not tied to a specific MC program. Develop within an LCIO-compatible framework  direct comparisons with alternative algorithms can be made straightforwardly.

Chris Ainsley General CALICE meeting 28  29 June 2004, CERN, Switzerland 3 Order of service Tracker-like clustering algorithm in outline. Generalisation of the full detector geometry. Application to single-particle cluster reconstruction. Application to multi-particle cluster reconstruction: –Z event at 91 GeV (W-Si Ecal, Fe-RPC Hcal); –W + W  event at 800 GeV (W-Si Ecal, Fe-RPC Hcal). Summary and outlook.

Chris Ainsley General CALICE meeting 28  29 June 2004, CERN, Switzerland 4 Tracker-like clustering algorithm in outline Sum energy deposits within each cell. Retain cells with total hit energy above some threshold (⅓ MIP; adjustable). Form clusters by tracking closely related hits layer- by-layer through calorimeters: –for a given hit j in a given layer l, minimize the angle  w.r.t all hits k in layer l  1; –if  <  max for minimum , assign hit j to same cluster as hit k which yields minimum; –if not, repeat with all hits in layer l  2, then, if necessary, layer l  3, etc.; –after iterating over all hits j, seed new clusters with those still unassigned; –calculate centre-of-energy of each cluster in layer l; –assign a direction cosine to each hit along the line joining its clusters’ seed (or {0,0,0} if it’s a seed) to its clusters’ centre-of-energy in layer l; –propagate layer-by-layer through Ecal, then Hcal; –retrospectively match any backward-spiralling track-like cluster fragments with the forward- propagating cluster fragments to which they correspond using directional and proximity information at the apex of the track.

Chris Ainsley General CALICE meeting 28  29 June 2004, CERN, Switzerland 5 Geometry generalisation (1) LayersPseudolayers Layer index changes discontinuously at: (i) Ecal barrel stave boundaries; (ii) barrel/endcap boundaries. Define “pseudolayers” as surfaces of coaxial octagonal prisms  discontinuities removed; pseudolayer indices vary smoothly.

Chris Ainsley General CALICE meeting 28  29 June 2004, CERN, Switzerland 6 Geometry generalisation (2) StavesPseudostaves Stave = plane of parallel layers Pseudostave = plane of parallel pseudolayers

Chris Ainsley General CALICE meeting 28  29 June 2004, CERN, Switzerland 7 Geometry generalisation (3) Clustering algorithm works as described earlier, but with layers replaced by pseudolayers  pseudolayer index changes smoothly;  clusters are tracked with continuity across stave boundaries. Pseudolayers/pseudostaves are defined automatically by the intersection of the real, physical layers  only need distances of layers from {0,0,0} and their angles w.r.t. each other to construct these;  idea applies to ANY detector design comprising an n-fold rotationally symmetric barrel closed by a pair of endcaps!

Chris Ainsley General CALICE meeting 28  29 June 2004, CERN, Switzerland 8 Single-particle reconstruction 15 GeV e  15 GeV  

Chris Ainsley General CALICE meeting 28  29 June 2004, CERN, Switzerland 9 91 GeV Z event: Full detector Reconstructed clustersTrue particle clusters

Chris Ainsley General CALICE meeting 28  29 June 2004, CERN, Switzerland GeV Z event: Zoom 1 Reconstructed clustersTrue particle clusters

Chris Ainsley General CALICE meeting 28  29 June 2004, CERN, Switzerland GeV Z event: Zoom 2 Reconstructed clustersTrue particle clusters

Chris Ainsley General CALICE meeting 28  29 June 2004, CERN, Switzerland 12 Fraction of true cluster energy in each reconstructed cluster 91 GeV Z event: Performance Fraction Reconstructed cluster ID True cluster ID Reconstructed cluster ID Fraction Fraction of event energy in each true-reconstructed cluster pairFraction of reconstructed cluster energy in each true cluster 15 highest energy reconstructed and true clusters plotted. Reconstructed and true clusters tend to have a 1:1 correspondence. Averaged over 100 Z events at 91 GeV: – 87.7 ± 0.5 % of event energy maps 1:1 from true onto reconstructed clusters; – 97.0 ± 0.3 % of event energy maps 1:1 from reconstructed onto true clusters.

Chris Ainsley General CALICE meeting 28  29 June 2004, CERN, Switzerland GeV W + W  event: Full detector Reconstructed clustersTrue particle clusters

Chris Ainsley General CALICE meeting 28  29 June 2004, CERN, Switzerland GeV W + W  event: Zoom 1 Reconstructed clustersTrue particle clusters

Chris Ainsley General CALICE meeting 28  29 June 2004, CERN, Switzerland GeV W + W  event: Zoom 2 Reconstructed clustersTrue particle clusters

Chris Ainsley General CALICE meeting 28  29 June 2004, CERN, Switzerland 16 Fraction of true cluster energy in each reconstructed cluster 800 GeV W + W  event: Performance Fraction Reconstructed cluster ID True cluster ID Reconstructed cluster ID Fraction Fraction of event energy in each true-reconstructed cluster pairFraction of reconstructed cluster energy in each true cluster 15 highest energy reconstructed and true clusters plotted. Reconstructed and true clusters tend to have a 1:1 correspondence. Averaged over 100 W + W  events at 800 GeV: – 83.3 ± 0.5 % of event energy maps 1:1 from true onto reconstructed clusters; – 80.2 ± 1.0 % of event energy maps 1:1 from reconstructed onto true clusters.

Chris Ainsley General CALICE meeting 28  29 June 2004, CERN, Switzerland 17 Summary & Outlook R&D on clustering algorithm for calorimeters at a future LC in progress. Approach mixes tracking and clustering aspects to utilize the high granularity of the calorimeter cells. Starts from calorimeter hits and builds up clusters – a “bottom up” approach (cf. “top down” approach of G. Mavromanolakis). Can be applied to any likely detector configuration  straightforward to try out alternative geometries. Works well for single-particles events. Good performance for 91 GeV Z events. Encouraging signs for 800 GeV W + W  events. Runs in the LCIO (v.1.0) framework: hits collection → clusters collection (awaiting next version to make full use of cluster object methods)  straightforward to try out alternative algorithms.