STAR SVT Self Alignment V. Perevoztchikov Brookhaven National Laboratory,USA.

Slides:



Advertisements
Similar presentations
Image Registration  Mapping of Evolution. Registration Goals Assume the correspondences are known Find such f() and g() such that the images are best.
Advertisements

Terzo Convegno sulla Fisica di ALICE - LNF, Andrea Dainese 1 Preparation for ITS alignment A. Dainese (INFN – LNL) for the ITS alignment group.
P. Venkataraman Mechanical Engineering P. Venkataraman Rochester Institute of Technology DETC2011 –47658 Determining ODE from Noisy Data 31 th CIE, Washington.
The loss function, the normal equation,
Classification and Prediction: Regression Via Gradient Descent Optimization Bamshad Mobasher DePaul University.
x – independent variable (input)
1 Vertex fitting Zeus student seminar May 9, 2003 Erik Maddox NIKHEF/UvA.
Motion Analysis (contd.) Slides are from RPI Registration Class.
Tracking using the Kalman Filter. Point Tracking Estimate the location of a given point along a sequence of images. (x 0,y 0 ) (x n,y n )
Nonlinear Sampling. 2 Saturation in CCD sensors Dynamic range correction Optical devices High power amplifiers s(-t) Memoryless nonlinear distortion t=n.
Radial Basis Function Networks
STAR Collaboration Meeting, Nantes, July2002 SVT Analysis/Status Update Jun Takahashi – University of Sao Paulo.
Collaborative Filtering Matrix Factorization Approach
FTPC calibration status Joern Putschke for the STAR FTPC group STAR Analysis Meeting 2002 October 22-24, 2002.
Dr. Hala Moushir Ebied Faculty of Computers & Information Sciences
STAR StiVmc V. Perevoztchikov Brookhaven National Laboratory,USA.
Chapter 15 Modeling of Data. Statistics of Data Mean (or average): Variance: Median: a value x j such that half of the data are bigger than it, and half.
Non-Linear Models. Non-Linear Growth models many models cannot be transformed into a linear model The Mechanistic Growth Model Equation: or (ignoring.
Numerical Methods Applications of Loops: The power of MATLAB Mathematics + Coding 1.
Non-Linear Models. Non-Linear Growth models many models cannot be transformed into a linear model The Mechanistic Growth Model Equation: or (ignoring.
Chem Math 252 Chapter 5 Regression. Linear & Nonlinear Regression Linear regression –Linear in the parameters –Does not have to be linear in the.
Example: line fitting. n=2 Model fitting Measure distances.
STS track recognition by 3D track-following method Gennady Ososkov, A.Airiyan, A.Lebedev, S.Lebedev, E.Litvinenko Laboratory of Information Technologies.
STAR Sti, main features V. Perevoztchikov Brookhaven National Laboratory,USA.
STAR Collaboration Meeting Rene Bellwied – Wayne State University July 2004 SVT Calibration and STI tracking status An update of work since the SVT review.
Y.Fisyak, BNL - STAR Upgrade workshop, 12/2/ Integrated Tracker – STAR tracking framework of the future update on  status and  perspective IT(TF)
How Errors Propagate Error in a Series Errors in a Sum Error in Redundant Measurement.
STAR STAR VMC tracker V. Perevoztchikov Brookhaven National Laboratory,USA.
STAR Kalman Track Fit V. Perevoztchikov Brookhaven National Laboratory,USA.
STAR Event data storage and management in STAR V. Perevoztchikov Brookhaven National Laboratory,USA.
© Imperial College LondonPage 1 Tracking & Ecal Positional/Angular Resolution Hakan Yilmaz.
Integrated Tracker (progress, status, plans) Y. Fisyak.
LM Feb SSD status and Plans for Year 5 Lilian Martin - SUBATECH STAR Collaboration Meeting BNL - February 2005.
1 A first look at the KEK tracker data with G4MICE Malcolm Ellis 2 nd December 2005.
Lec 9. Root Locus Analysis I From last lecture, the locations of the closed loop poles have important implication in –Stability –Transient behavior –Steady.
Secondary Vertex reconstruction for the D + Elena Bruna University of Torino ALICE Physics Week Erice, Dec. 6 th 2005.
Non-Linear Models. Non-Linear Growth models many models cannot be transformed into a linear model The Mechanistic Growth Model Equation: or (ignoring.
CMS Torino meeting, 4 th June, 2007 R. Castello on behalf of Torino Tracker’s group Tracker Alignment with MillePede.
STAR StiVmc V. Perevoztchikov Brookhaven National Laboratory,USA.
FIRST RESULTS OF THE SILICON STRIP DETECTOR at STAR Jörg Reinnarth, Jonathan Bouchet, Lilian Martin, Jerome Baudot and the SSD teams in Nantes and Strasbourg.
Jin Huang M.I.T. For Transversity Collaboration Meeting Jan 29, JLab.
FTPC calibration status & plans for Y03 Joern Putschke for the STAR FTPC group STAR Calibration Meeting 2002 November 7, 2002.
Curve Simplification under the L 2 -Norm Ben Berg Advisor: Pankaj Agarwal Mentor: Swaminathan Sankararaman.
STAR Simulation. Status and plans V. Perevoztchikov Brookhaven National Laboratory,USA.
Sti primary track puzzle Yuri Fisyak. Charge dependent relative difference in primary track transverse momentum between Sti (.dev) and TpT On STAR collaboration.
Numerical Analysis – Data Fitting Hanyang University Jong-Il Park.
LHCb Alignment Strategy 26 th September 2007 S. Viret 1. Introduction 2. The alignment challenge 3. Conclusions.
Detector Alignment with Tracks Wouter Hulsbergen (Nikhef, BFYS)
Comparison of algorithms for hit reconstruction in the DTs: Test of calibration procedures for t trig and drift velocity on Test Beam data Test of calibration.
Lecture 16: Image alignment
Michele Faucci Giannelli
New TRD (&TOF) tracking algorithm
Alignment of the ALICE MUON Spectrometer
CENG 789 – Digital Geometry Processing 08- Rigid-Body Alignment
Beam Gas Vertex – Beam monitor
Tracking System at CERN 06 and 07 test beams
Analysis Test Beam Pixel TPC
Tracker to Solenoid Alignment
Solution of Equations by Iteration
Collaborative Filtering Matrix Factorization Approach
Alignment of the Silicon Vertex Tracker (SVT)
Structure from Motion with Non-linear Least Squares
Learning Theory Reza Shadmehr
The loss function, the normal equation,
Mathematical Foundations of BME Reza Shadmehr
LHCb Alignment Strategy
Mathematical Foundations of BME
Chapter 4 . Trajectory planning and Inverse kinematics
Structure from Motion with Non-linear Least Squares
Presentation transcript:

STAR SVT Self Alignment V. Perevoztchikov Brookhaven National Laboratory,USA

STAR Victor Perevoztchikov, BNL SVT Review What is the PROBLEM? Right now the SVT alignment is based on TPC tracks. But TPC has less precision than the SVT. Now it is solved by big statistics of TPC data. Then our accuracy depends on systematic errors of TPC, which can not be improved by statistics. Hence, alignment based on TPC could be considered only as preliminary. What is the best possible strategy?  Direct measurement alignment;  Alignment based on big TPC statistics;  Self alignment, based on good tracks, selected by TPC+SVT. Only SVT hits,selected by these tracks plus condition that tracks are primaries, and hence have one common point, are used for alignment. Measurements from TPC are ignored now;  Again TPC+SVT track are used for alignment of SVT global position. To avoid time dependency of TPC space charge, we need to select all runs, where we believe, SVT in the same position. Then influence of TPC systematic errors to some extent is diminished;  It is still not very good, but we do not have any additional information to improve the situation.

STAR Victor Perevoztchikov, BNL SVT Review Simple example vertex

STAR Victor Perevoztchikov, BNL SVT Review Drift velocity. SVT alignment consists of SVT geometry and SVT drift velocities. It is practically impossible to align them separately. How to account drift velocity?  Self alignment based on drift velocities from the previous TPC+SVT alignment.  Improve velocities using: l Known size of hybrid; l Distribution of hits on hybrid must be flat;  Self alignment again;  Iterations; Non flat noise makes the above procedure as a non trivial task.

STAR Victor Perevoztchikov, BNL SVT Review Self Alignment assumptions. Basic assumptions:  Selection of minimal geometric entities. Right now we selected the ladders as a minimal geometrical part of SVT. When they will be successfully aligned, then wafers or hybrids will be selected;  Ideal local frame. This is rather arbitrary frame, but must be close to real one. The most calculations are made in this frame. This frame is not changing during alignment. As ideal local frame we selected an Sti local frame. In this frame all ladders are placed exactly along Z axis and rotated around Z by fixed angles ;  The real ladders have 3 rotations and 3 space shifts wrt to ideal ladders; These 6 parameters for each ladder we must to find. The ideal local frame is selected in such a way, that these 6 parameters are small enough, to use linear approximation;  Projected hits: Real hits transformed into ideal local frame are not sitting on measurement plane, but not too far from it. We move hit point along the track direction up to crossing of ideal measurement plane. This new point is a “projected hit”.

STAR Victor Perevoztchikov, BNL SVT Review Self Alignment assumptions (continue)  6 parameters transformation is applied not to ideal local frame, but to projected hits. As a result, these hits are not anymore on the ideal measurement plane. Then we repeat projection of them along the track direction to the ideal measurement plane. So, transformation of projected hits consists of two parts: l Geometrical transformation, which is the same for all events; l Plus projection along track to ideal measurement plane, which is different for each event.  As a result, we got 6 parameters geometrical transformation for each ladder, transform them into standard SVT transformation format. Which will be used in geometry reconstruction.

STAR Victor Perevoztchikov, BNL SVT Review A simplified fitting algorithm There are two approaches for fitting. A simplified one and the complex one. The simplified algorithm does not need complex calculation of derivatives. A simplified algorithm:  Reading Sti reconstruction result;  Selects tracks with 3 or more Svt hits plus some additional cuts;  If event has less than 5 such tracks, discard it and read the next event;  Keep only SVT (or SSD) hits;  Transform hits into ideal local frame;  Apply the 6 parameters geometrical transformation from the previous iteration, for these hits;  Transform updated hits back into global system;  Fit these hits by simple helix and create SelfTracks;

STAR Victor Perevoztchikov, BNL SVT Review A simplified fitting algorithm (continue)  Evaluate primary vertex as a common point of all tracks;  Refit SelfTracks with condition to go exactly through the vertex;  Project hits into projected hits;  Calculate residuals, as a difference between projected hits and track crossing points in ideal measurement plane.  Update specific matrix by residuals and read the next event.  Events are finished. Use the matrix, filled during the reading, to calculate all 6 parameters geometrical transformation, which minimizes the sum of squares of all residuals.  Go to next iteration;

STAR Victor Perevoztchikov, BNL SVT Review Why simplified algorithm must work?  For each event we choose the vertex point, for which sum of square of residuals for this event is minimal;  At the end of iteration we apply transformation which decreases the total sum of residuals  During the next iteration, updating the vertex, residuals for each event could be only improved.  As a result, each iteration could only improve total residuals or leave it as it is.

STAR Victor Perevoztchikov, BNL SVT Review Complex algorithm This algorithm is very similar to the previous one. The difference is:  Simple algorithm is trying to minimize residuals without accounting that after moving the hits, track will move as well.  Complex algorithm minimizes the sum of chi-squares of tracks, taking into account track changing. Also it accounts condition that all tracks have the common point. To do this, you must evaluate derivatives of track parameters by hit. This algorithm must need less iterations, but result should be the same.

STAR Victor Perevoztchikov, BNL SVT Review Current status Work is not finished yet, but close to the end. Right now both algorithms are working well, when the solution is far from the minimum. Near the minimum some instability occurs and no convergence happened. This behavior is not yet understood. But we believe, it will be fixed soon.