Track and vertex reconstruction in CMS - baseline and advanced algorithms
High multiplicity signal events and superimposed pileup constitute a
challenge for track and vertex reconstruction at the LHC. CMS has
opted for a pure semiconductor solution for the central tracking.
The region closest to the interaction point is covered by layers of
pixel detectors, followed by strip detectors in mono and stereo
The emphasis of the talk will be on track finding and fitting in this
environment. The default strategy - based on the Kalman Filter -
will be described and compared to advanced algorithms like the
Deterministic Annealing Filter or the Gaussian Sum Filter. Finally a
short overview of vertex reconstruction in CMS will be presented.