Sensitivity of robust vertex fitting algorithms
Open Access
- 18 October 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Nuclear Science
- Vol. 51 (5) , 2037-2044
- https://doi.org/10.1109/tns.2004.832296
Abstract
Robust vertex fitting algorithms are expected to improve the knowledge of the vertex position and of its uncertainty in the presence of mismeasured or misassociated tracks. Such contaminations are likely to happen in real data as well as in realistic detector simulations. This paper describes a simulation study of the sensitivity of two types of robust algorithms: a trimmed least squares estimator and an adaptive estimator. The statistical properties of the algorithms are studied as a function of the source and the level of contamination, and compared to the results obtained with classical least squares estimators. Two typical event topologies are studied: one resembling a high multiplicity primary vertex with a possible contamination from a nearby vertex and one resembling a low multiplicity secondary vertex in a jet.Keywords
This publication has 6 references indexed in Scilit:
- New developments in vertex reconstruction for CMSNuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment, 2003
- Robust estimators of the mode and skewness of continuous dataComputational Statistics & Data Analysis, 2002
- Track fitting with ambiguities and noise: A study of elastic tracking and nonlinear filtersComputer Physics Communications, 1999
- Vertex reconstruction and track bundling at the LEP collider using robust algorithmsComputer Physics Communications, 1996
- A deterministic annealing approach to clusteringPattern Recognition Letters, 1990
- Optimization by Simulated AnnealingScience, 1983