CMS 3D CMS Logo

 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Pages
List of all members | Public Types | Public Member Functions | Private Member Functions | Private Attributes
AdaptiveVertexFitter Class Reference

#include <AdaptiveVertexFitter.h>

Inheritance diagram for AdaptiveVertexFitter:
VertexFitter< 5 >

Public Types

typedef
ReferenceCountingPointer
< LinearizedTrackState< 5 > > 
RefCountedLinearizedTrackState
 
typedef
ReferenceCountingPointer
< VertexTrack< 5 > > 
RefCountedVertexTrack
 

Public Member Functions

 AdaptiveVertexFitter (const AnnealingSchedule &ann=GeometricAnnealing(), const LinearizationPointFinder &linP=DefaultLinearizationPointFinder(), const VertexUpdator< 5 > &updator=KalmanVertexUpdator< 5 >(), const VertexTrackCompatibilityEstimator< 5 > &estor=KalmanVertexTrackCompatibilityEstimator< 5 >(), const VertexSmoother< 5 > &smoother=DummyVertexSmoother< 5 >(), const AbstractLTSFactory< 5 > &ltsf=LinearizedTrackStateFactory())
 
 AdaptiveVertexFitter (const AdaptiveVertexFitter &original)
 
AdaptiveVertexFitterclone () const
 
void gsfIntermediarySmoothing (bool sm)
 
bool gsfIntermediarySmoothing () const
 
void setParameters (double maxshift=0.0001, double maxlpshift=0.1, unsigned maxstep=30, double weightthreshold=.001)
 
void setParameters (const edm::ParameterSet &)
 
void setWeightThreshold (float w)
 
virtual CachingVertex< 5 > vertex (const std::vector< reco::TransientTrack > &) const
 
virtual CachingVertex< 5 > vertex (const std::vector< RefCountedVertexTrack > &) const
 
virtual CachingVertex< 5 > vertex (const std::vector< RefCountedVertexTrack > &, const reco::BeamSpot &spot) const
 
virtual CachingVertex< 5 > vertex (const std::vector< reco::TransientTrack > &, const GlobalPoint &linPoint) const
 
virtual CachingVertex< 5 > vertex (const std::vector< reco::TransientTrack > &, const GlobalPoint &priorPos, const GlobalError &priorError) const
 
virtual CachingVertex< 5 > vertex (const std::vector< reco::TransientTrack > &tracks, const reco::BeamSpot &beamSpot) const
 
virtual CachingVertex< 5 > vertex (const std::vector< RefCountedVertexTrack > &, const GlobalPoint &priorPos, const GlobalError &priorError) const
 
virtual ~AdaptiveVertexFitter ()
 
- Public Member Functions inherited from VertexFitter< 5 >
virtual CachingVertex< N > vertex (const std::vector< typename CachingVertex< N >::RefCountedVertexTrack > &tracks) const =0
 
virtual CachingVertex< N > vertex (const std::vector< typename CachingVertex< N >::RefCountedVertexTrack > &tracks, const reco::BeamSpot &spot) const =0
 
virtual CachingVertex< N > vertex (const std::vector< typename CachingVertex< N >::RefCountedVertexTrack > &tracks, const GlobalPoint &priorPos, const GlobalError &priorError) const =0
 
 VertexFitter ()
 
virtual ~VertexFitter ()
 

Private Member Functions

CachingVertex< 5 > fit (const std::vector< RefCountedVertexTrack > &tracks, const VertexState &priorSeed, bool withPrior) const
 
double getWeight (float chi2) const
 
std::vector
< RefCountedVertexTrack
linearizeTracks (const std::vector< reco::TransientTrack > &, const VertexState &) const
 
std::vector
< RefCountedVertexTrack
reLinearizeTracks (const std::vector< RefCountedVertexTrack > &tracks, const CachingVertex< 5 > &vertex) const
 
std::vector
< RefCountedVertexTrack
reWeightTracks (const std::vector< RefCountedLinearizedTrackState > &, const CachingVertex< 5 > &seed) const
 
std::vector
< RefCountedVertexTrack
reWeightTracks (const std::vector< RefCountedVertexTrack > &, const CachingVertex< 5 > &seed) const
 
std::vector
< RefCountedVertexTrack
weightTracks (const std::vector< RefCountedLinearizedTrackState > &, const VertexState &seed) const
 

Private Attributes

bool gsfIntermediarySmoothing_
 
int mctr_
 
AnnealingScheduletheAssProbComputer
 
VertexTrackCompatibilityEstimator< 5 > * theComp
 
LinearizationPointFindertheLinP
 
const AbstractLTSFactory< 5 > * theLinTrkFactory
 
double theMaxLPShift
 
double theMaxShift
 
int theMaxStep
 
int theNr
 
VertexSmoother< 5 > * theSmoother
 
VertexUpdator< 5 > * theUpdator
 
double theWeightThreshold
 

Detailed Description

An iterative reweighted fitter. Very robust, very adaptive.

See CMS Note 2007/008.

Exceptions VertexException( "Supplied fewer than two tracks" ) VertexException( "fewer than 2 significant tracks (w>threshold)" )

Definition at line 29 of file AdaptiveVertexFitter.h.

Member Typedef Documentation

Definition at line 34 of file AdaptiveVertexFitter.h.

Definition at line 33 of file AdaptiveVertexFitter.h.

Constructor & Destructor Documentation

AdaptiveVertexFitter::AdaptiveVertexFitter ( const AnnealingSchedule ann = GeometricAnnealing(),
const LinearizationPointFinder linP = DefaultLinearizationPointFinder(),
const VertexUpdator< 5 > &  updator = KalmanVertexUpdator<5>(),
const VertexTrackCompatibilityEstimator< 5 > &  estor = KalmanVertexTrackCompatibilityEstimator<5>(),
const VertexSmoother< 5 > &  smoother = DummyVertexSmoother<5>(),
const AbstractLTSFactory< 5 > &  ltsf = LinearizedTrackStateFactory() 
)

Reimplemented constructors to use any kind of linearisation point finder, vertex updator and smoother. If no smoother is to be used, do not specify an instance for it.

Definition at line 98 of file AdaptiveVertexFitter.cc.

References setParameters().

Referenced by clone().

104  :
105  theNr(0),
106  theLinP(linP.clone()), theUpdator( updator.clone()),
107  theSmoother ( smoother.clone() ), theAssProbComputer( ann.clone() ),
108  theComp ( crit.clone() ), theLinTrkFactory ( ltsf.clone() ),
110 {
111  setParameters();
112 }
LinearizationPointFinder * theLinP
VertexUpdator< 5 > * theUpdator
virtual AnnealingSchedule * clone() const =0
virtual VertexSmoother * clone() const =0
virtual const AbstractLTSFactory * clone() const =0
VertexSmoother< 5 > * theSmoother
AnnealingSchedule * theAssProbComputer
void setParameters(double maxshift=0.0001, double maxlpshift=0.1, unsigned maxstep=30, double weightthreshold=.001)
virtual LinearizationPointFinder * clone() const =0
virtual VertexUpdator * clone() const =0
const AbstractLTSFactory< 5 > * theLinTrkFactory
VertexTrackCompatibilityEstimator< 5 > * theComp
AdaptiveVertexFitter::AdaptiveVertexFitter ( const AdaptiveVertexFitter original)

Definition at line 120 of file AdaptiveVertexFitter.cc.

120  :
121  theMaxShift ( o.theMaxShift ), theMaxLPShift ( o.theMaxLPShift ),
122  theMaxStep ( o.theMaxStep ), theWeightThreshold ( o.theWeightThreshold ),
123  theNr ( o.theNr ),
124  theLinP ( o.theLinP->clone() ), theUpdator ( o.theUpdator->clone() ),
125  theSmoother ( o.theSmoother->clone() ),
126  theAssProbComputer ( o.theAssProbComputer->clone() ),
127  theComp ( o.theComp->clone() ),
128  theLinTrkFactory ( o.theLinTrkFactory->clone() ),
129  gsfIntermediarySmoothing_(o.gsfIntermediarySmoothing_)
130 {}
LinearizationPointFinder * theLinP
VertexUpdator< 5 > * theUpdator
VertexSmoother< 5 > * theSmoother
AnnealingSchedule * theAssProbComputer
const AbstractLTSFactory< 5 > * theLinTrkFactory
VertexTrackCompatibilityEstimator< 5 > * theComp
AdaptiveVertexFitter::~AdaptiveVertexFitter ( )
virtual

Definition at line 132 of file AdaptiveVertexFitter.cc.

References theAssProbComputer, theComp, theLinP, theLinTrkFactory, theSmoother, and theUpdator.

133 {
134  delete theLinP;
135  delete theUpdator;
136  delete theSmoother;
137  delete theAssProbComputer;
138  delete theComp;
139  delete theLinTrkFactory;
140 }
LinearizationPointFinder * theLinP
VertexUpdator< 5 > * theUpdator
VertexSmoother< 5 > * theSmoother
AnnealingSchedule * theAssProbComputer
const AbstractLTSFactory< 5 > * theLinTrkFactory
VertexTrackCompatibilityEstimator< 5 > * theComp

Member Function Documentation

AdaptiveVertexFitter * AdaptiveVertexFitter::clone ( void  ) const
virtual

Fit vertex out of a VertexSeed

Implements VertexFitter< 5 >.

Definition at line 372 of file AdaptiveVertexFitter.cc.

References AdaptiveVertexFitter().

Referenced by AdaptiveGsfVertexFitter::AdaptiveGsfVertexFitter().

373 {
374  return new AdaptiveVertexFitter( * this );
375 }
AdaptiveVertexFitter(const AnnealingSchedule &ann=GeometricAnnealing(), const LinearizationPointFinder &linP=DefaultLinearizationPointFinder(), const VertexUpdator< 5 > &updator=KalmanVertexUpdator< 5 >(), const VertexTrackCompatibilityEstimator< 5 > &estor=KalmanVertexTrackCompatibilityEstimator< 5 >(), const VertexSmoother< 5 > &smoother=DummyVertexSmoother< 5 >(), const AbstractLTSFactory< 5 > &ltsf=LinearizedTrackStateFactory())
CachingVertex< 5 > AdaptiveVertexFitter::fit ( const std::vector< RefCountedVertexTrack > &  tracks,
const VertexState priorSeed,
bool  withPrior 
) const
private

perform the fit

Definition at line 515 of file AdaptiveVertexFitter.cc.

References VertexUpdator< N >::add(), AnnealingSchedule::anneal(), AnnealingSchedule::currentTemp(), VertexState::error(), mergeVDriftHistosByStation::file, getId(), gsfIntermediarySmoothing_, i, AnnealingSchedule::isAnnealed(), CachingVertex< N >::isValid(), LogDebug, m, mag(), PV3DBase< T, PVType, FrameType >::perp(), VertexState::position(), CachingVertex< N >::position(), reLinearizeTracks(), AnnealingSchedule::resetAnnealing(), reWeightTracks(), VertexSmoother< N >::smooth(), launcher::step, theAssProbComputer, theMaxLPShift, theMaxShift, theMaxStep, theSmoother, theUpdator, theWeightThreshold, transverse(), AnnealingSchedule::weight(), and PV3DBase< T, PVType, FrameType >::z().

Referenced by vertex().

518 {
520 
521  vector<RefCountedVertexTrack> initialTracks;
522  GlobalPoint priorVertexPosition = priorSeed.position();
523  GlobalError priorVertexError = priorSeed.error();
524 
525  CachingVertex<5> returnVertex( priorVertexPosition,priorVertexError,
526  initialTracks,0);
527  if (withPrior)
528  {
529  returnVertex = CachingVertex<5>(priorVertexPosition,priorVertexError,
530  priorVertexPosition,priorVertexError,initialTracks,0);
531  }
532 
533  // vector<RefCountedVertexTrack> globalVTracks = tracks;
534  // sort the tracks, according to distance to seed!
535  vector<RefCountedVertexTrack> globalVTracks ( tracks.size() );
536 
537  partial_sort_copy ( tracks.begin(), tracks.end(),
538  globalVTracks.begin(), globalVTracks.end(), DistanceToRefPoint ( priorSeed.position() ) );
539 
540  // main loop through all the VTracks
541  int lpStep = 0; int step = 0;
542 
543  CachingVertex<5> initialVertex = returnVertex;
544 
545  GlobalPoint newPosition = priorVertexPosition;
546  GlobalPoint previousPosition = newPosition;
547 
548  int ns_trks=0; // number of significant tracks.
549  // If we have only two significant tracks, we return an invalid vertex
550 
551  do {
552  ns_trks=0;
553  CachingVertex<5> fVertex = initialVertex;
554  if ((previousPosition - newPosition).transverse() > theMaxLPShift)
555  {
556  // relinearize and reweight.
557  // (reLinearizeTracks also reweights tracks)
558  if (gsfIntermediarySmoothing_) returnVertex = theSmoother->smooth(returnVertex);
559  globalVTracks = reLinearizeTracks( globalVTracks, returnVertex );
560  lpStep++;
561  } else if (step) {
562  // reweight, if it is not the first step
563  if (gsfIntermediarySmoothing_) returnVertex = theSmoother->smooth(returnVertex);
564  globalVTracks = reWeightTracks( globalVTracks, returnVertex );
565  }
566  // update sequentially the vertex estimate
567  CachingVertex<5> nVertex;
568  for(vector<RefCountedVertexTrack>::const_iterator i
569  = globalVTracks.begin(); i != globalVTracks.end(); i++)
570  {
571  if ((**i).weight() > 0.) nVertex = theUpdator->add( fVertex, *i );
572  else nVertex = fVertex;
573  if (nVertex.isValid()) {
574  if ( (**i).weight() >= theWeightThreshold )
575  {
576  ns_trks++;
577  };
578 
579  if ( fabs ( nVertex.position().z() ) > 10000. ||
580  nVertex.position().perp()>120.)
581  {
582  // were more than 100 m off!!
583  LogWarning ("AdaptiveVertexFitter" ) << "Vertex candidate just took off to " << nVertex.position()
584  << "! Will discard this update!";
585 // //<< "track pt was " << (**i).linearizedTrack()->track().pt()
586 // << "track momentum was " << (**i).linearizedTrack()->track().initialFreeState().momentum()
587 // << "track position was " << (**i).linearizedTrack()->track().initialFreeState().position()
588 // << "track chi2 was " << (**i).linearizedTrack()->track().chi2()
589 // << "track ndof was " << (**i).linearizedTrack()->track().ndof()
590 // << "track w was " << (**i).weight()
591 // << "track schi2 was " << (**i).smoothedChi2();
592  } else {
593  fVertex = nVertex;
594  }
595  } else {
596  LogWarning("RecoVertex/AdaptiveVertexFitter")
597  << "The updator returned an invalid vertex when adding track "
598  << i-globalVTracks.begin()
599  << ".\n Your vertex might just have lost one good track.";
600  };
601  }
602  previousPosition = newPosition;
603  newPosition = fVertex.position();
604  returnVertex = fVertex;
606  step++;
607  if ( step >= theMaxStep ) break;
608 
609  } while (
610  // repeat as long as
611  // - vertex moved too much or
612  // - we're not yet annealed
613  ( ((previousPosition - newPosition).mag() > theMaxShift) ||
614  (!(theAssProbComputer->isAnnealed()) ) ) ) ;
615 
616  if ( theWeightThreshold > 0. && ns_trks < 2 && !withPrior )
617  {
618  LogDebug("AdaptiveVertexFitter")
619  << "fewer than two significant tracks (w>" << theWeightThreshold << ")."
620  << " Fitted vertex is invalid.";
621  return CachingVertex<5>(); // return invalid vertex
622  }
623 
624  #ifdef STORE_WEIGHTS
625  map < string, dataharvester::MultiType > m;
626  m["chi2"]=chi2;
627  m["w"]=theAssProbComputer->weight(chi2);
629  m["n"]=iter;
630  m["id"]=getId ( *i );
631  m["pos"]="final";
632  dataharvester::Writer::file("w.txt").save ( m );
633  #endif
634  return theSmoother->smooth( returnVertex );
635 }
#define LogDebug(id)
virtual bool isAnnealed() const =0
int i
Definition: DBlmapReader.cc:9
T perp() const
Definition: PV3DBase.h:66
std::vector< RefCountedVertexTrack > reWeightTracks(const std::vector< RefCountedLinearizedTrackState > &, const CachingVertex< 5 > &seed) const
list step
Definition: launcher.py:15
T mag() const
The vector magnitude. Equivalent to sqrt(vec.mag2())
static unsigned int getId(void)
VertexUpdator< 5 > * theUpdator
GlobalPoint position() const
Definition: VertexState.h:29
std::vector< RefCountedVertexTrack > reLinearizeTracks(const std::vector< RefCountedVertexTrack > &tracks, const CachingVertex< 5 > &vertex) const
virtual CachingVertex< N > add(const CachingVertex< N > &v, const typename CachingVertex< N >::RefCountedVertexTrack t) const =0
T z() const
Definition: PV3DBase.h:58
VertexSmoother< 5 > * theSmoother
AnnealingSchedule * theAssProbComputer
virtual double currentTemp() const =0
tuple tracks
Definition: testEve_cfg.py:39
virtual CachingVertex< N > smooth(const CachingVertex< N > &vertex) const =0
GlobalPoint position() const
T transverse() const
Another name for perp()
bool isValid() const
Definition: CachingVertex.h:96
virtual void anneal()=0
virtual void resetAnnealing()=0
GlobalError error() const
Definition: VertexState.h:34
virtual double weight(double chi2) const =0
double AdaptiveVertexFitter::getWeight ( float  chi2) const
private

Definition at line 377 of file AdaptiveVertexFitter.cc.

References theAssProbComputer, AnnealingSchedule::weight(), and CommonMethods::weight().

Referenced by reWeightTracks(), and weightTracks().

378 {
379  double weight = theAssProbComputer->weight(chi2);
380 
381  if ( weight > 1.0 )
382  {
383  LogWarning("RecoVertex/AdaptiveVertexFitter") << "Weight " << weight << " > 1.0!";
384  weight=1.0;
385  };
386 
387  if ( weight < 1e-20 )
388  {
389  // LogWarning("RecoVertex/AdaptiveVertexFitter") << "Weight " << weight << " < 0.0!";
390  weight=1e-20;
391  };
392  return weight;
393 }
AnnealingSchedule * theAssProbComputer
virtual double weight(double chi2) const =0
void AdaptiveVertexFitter::gsfIntermediarySmoothing ( bool  sm)
inline
bool AdaptiveVertexFitter::gsfIntermediarySmoothing ( ) const
inline

Definition at line 143 of file AdaptiveVertexFitter.h.

References gsfIntermediarySmoothing_.

vector< AdaptiveVertexFitter::RefCountedVertexTrack > AdaptiveVertexFitter::linearizeTracks ( const std::vector< reco::TransientTrack > &  tracks,
const VertexState seed 
) const
private

Linearize tracks, for the first time in the iteration.

Construct a container of VertexTrack from a set of reco::TransientTracks. As this is the first iteration of the adaptive fit, the initial error does not enter in the computation of the weights. This is to avoid that all tracks get the same weight when using a very large initial error matrix.

Definition at line 317 of file AdaptiveVertexFitter.cc.

References cmsCodeRules.cppFunctionSkipper::exception, i, AbstractLTSFactory< N >::linearizedTrackState(), VertexState::position(), theLinTrkFactory, and weightTracks().

Referenced by vertex().

319 {
320  const GlobalPoint & linP ( seed.position() );
321  vector<RefCountedLinearizedTrackState> lTracks;
322  for(vector<reco::TransientTrack>::const_iterator i = tracks.begin();
323  i != tracks.end(); ++i )
324  {
325  try {
328  lTracks.push_back(lTrData);
329  } catch ( exception & e ) {
330  LogWarning("RecoVertex/AdaptiveVertexFitter")
331  << "Exception " << e.what() << " in ::linearizeTracks."
332  << "Your future vertex has just lost a track.";
333  };
334  }
335  return weightTracks(lTracks, seed );
336 }
int i
Definition: DBlmapReader.cc:9
virtual RefCountedLinearizedTrackState linearizedTrackState(const GlobalPoint &linP, const reco::TransientTrack &track) const =0
GlobalPoint position() const
Definition: VertexState.h:29
tuple tracks
Definition: testEve_cfg.py:39
ReferenceCountingPointer< LinearizedTrackState< 5 > > RefCountedLinearizedTrackState
std::vector< RefCountedVertexTrack > weightTracks(const std::vector< RefCountedLinearizedTrackState > &, const VertexState &seed) const
const AbstractLTSFactory< 5 > * theLinTrkFactory
vector< AdaptiveVertexFitter::RefCountedVertexTrack > AdaptiveVertexFitter::reLinearizeTracks ( const std::vector< RefCountedVertexTrack > &  tracks,
const CachingVertex< 5 > &  vertex 
) const
private

Construct new a container of VertexTrack with a new linearization point and vertex seed, from an existing set of VertexTrack, from which only the recTracks will be used.

Parameters
tracksThe original container of VertexTracks, from which the reco::TransientTracks will be extracted.
vertexThe seed to use for the VertexTracks. This position will also be used as the new linearization point.
Returns
The container of VertexTracks which are to be used in the next fit.

Construct new a container of VertexTrack with a new linearization point and vertex seed, from an existing set of VertexTrack, from which only the recTracks will be used.

Definition at line 344 of file AdaptiveVertexFitter.cc.

References cmsCodeRules.cppFunctionSkipper::exception, i, AbstractLTSFactory< N >::linearizedTrackState(), VertexState::position(), reWeightTracks(), theLinTrkFactory, and CachingVertex< N >::vertexState().

Referenced by fit().

347 {
348  VertexState seed = vertex.vertexState();
349  GlobalPoint linP = seed.position();
350  vector<RefCountedLinearizedTrackState> lTracks;
351  for(vector<RefCountedVertexTrack>::const_iterator i = tracks.begin();
352  i != tracks.end(); i++)
353  {
354  try {
356  = theLinTrkFactory->linearizedTrackState( linP, (**i).linearizedTrack()->track() );
357  /*
358  RefCountedLinearizedTrackState lTrData =
359  (**i).linearizedTrack()->stateWithNewLinearizationPoint(linP);
360  */
361  lTracks.push_back(lTrData);
362  } catch ( exception & e ) {
363  LogWarning("RecoVertex/AdaptiveVertexFitter")
364  << "Exception " << e.what() << " in ::relinearizeTracks. "
365  << "Will not relinearize this track.";
366  lTracks.push_back ( (**i).linearizedTrack() );
367  };
368  };
369  return reWeightTracks(lTracks, vertex );
370 }
int i
Definition: DBlmapReader.cc:9
VertexState vertexState() const
Definition: CachingVertex.h:86
std::vector< RefCountedVertexTrack > reWeightTracks(const std::vector< RefCountedLinearizedTrackState > &, const CachingVertex< 5 > &seed) const
virtual RefCountedLinearizedTrackState linearizedTrackState(const GlobalPoint &linP, const reco::TransientTrack &track) const =0
GlobalPoint position() const
Definition: VertexState.h:29
tuple tracks
Definition: testEve_cfg.py:39
ReferenceCountingPointer< LinearizedTrackState< 5 > > RefCountedLinearizedTrackState
const AbstractLTSFactory< 5 > * theLinTrkFactory
vector< AdaptiveVertexFitter::RefCountedVertexTrack > AdaptiveVertexFitter::reWeightTracks ( const std::vector< RefCountedLinearizedTrackState > &  lTracks,
const CachingVertex< 5 > &  seed 
) const
private

Construct a new container of VertexTracks with new weights accounting for vertex error, from an existing set of LinearizedTracks.

Definition at line 396 of file AdaptiveVertexFitter.cc.

References gather_cfg::cout, AnnealingSchedule::currentTemp(), VertexTrackCompatibilityEstimator< N >::estimate(), mergeVDriftHistosByStation::file, getId(), getWeight(), i, m, CachingVertex< N >::position(), python.multivaluedict::sort(), theAssProbComputer, theComp, theNr, CachingVertex< N >::vertexState(), VertexTrackFactory< N >::vertexTrack(), AnnealingSchedule::weight(), and CommonMethods::weight().

Referenced by fit(), reLinearizeTracks(), and reWeightTracks().

399 {
400  VertexState seed = vertex.vertexState();
401  theNr++;
402  // GlobalPoint pos = seed.position();
403 
404  vector<RefCountedVertexTrack> finalTracks;
405  VertexTrackFactory<5> vTrackFactory;
406  #ifdef STORE_WEIGHTS
407  iter++;
408  #endif
409  for(vector<RefCountedLinearizedTrackState>::const_iterator i
410  = lTracks.begin(); i != lTracks.end(); i++)
411  {
412  double weight=0.;
413  pair<bool, double> chi2Res = theComp->estimate ( vertex, *i );
414  if (!chi2Res.first) {
415  cout << "[AdaptiveVertexFitter] aie... vertex candidate is at " << vertex.position() << endl;
416  LogWarning("AdaptiveVertexFitter" ) << "When reweighting, chi2<0. Will add this track with w=0.";
417  // edm::LogWarning("AdaptiveVertexFitter" ) << "pt=" << (**i).track().pt();
418  }else {
419  weight = getWeight ( chi2Res.second );
420  }
421 
422  RefCountedVertexTrack vTrData
423  = vTrackFactory.vertexTrack(*i, seed, weight );
424 
425  #ifdef STORE_WEIGHTS
426  map < string, dataharvester::MultiType > m;
427  m["chi2"]=chi2;
428  m["w"]=theAssProbComputer->weight(chi2);
430  m["n"]=iter;
431  m["pos"]="reweight";
432  m["id"]=getId ( *i );
433  dataharvester::Writer::file("w.txt").save ( m );
434  #endif
435 
436  finalTracks.push_back(vTrData);
437  }
438  sort ( finalTracks.begin(), finalTracks.end(),
439  DistanceToRefPoint ( vertex.position() ) );
440  return finalTracks;
441 }
virtual BDpair estimate(const CachingVertex< N > &v, const RefCountedLinearizedTrackState track) const =0
int i
Definition: DBlmapReader.cc:9
VertexState vertexState() const
Definition: CachingVertex.h:86
RefCountedVertexTrack vertexTrack(const RefCountedLinearizedTrackState lt, const VertexState vs, float weight=1.0) const
static unsigned int getId(void)
virtual CachingVertex< 5 > vertex(const std::vector< reco::TransientTrack > &) const
ReferenceCountingPointer< VertexTrack< 5 > > RefCountedVertexTrack
AnnealingSchedule * theAssProbComputer
virtual double currentTemp() const =0
double getWeight(float chi2) const
GlobalPoint position() const
tuple cout
Definition: gather_cfg.py:41
virtual double weight(double chi2) const =0
VertexTrackCompatibilityEstimator< 5 > * theComp
vector< AdaptiveVertexFitter::RefCountedVertexTrack > AdaptiveVertexFitter::reWeightTracks ( const std::vector< RefCountedVertexTrack > &  tracks,
const CachingVertex< 5 > &  seed 
) const
private

Construct new a container of VertexTracks with new weights accounting for vertex error, from an existing set of VertexTracks. From these the LinearizedTracks will be reused.

Construct new a container of VertexTrack with new weights accounting for vertex error, from an existing set of VertexTracks. From these the LinearizedTracks will be reused.

Definition at line 495 of file AdaptiveVertexFitter.cc.

References i, and reWeightTracks().

498 {
499  vector<RefCountedLinearizedTrackState> lTracks;
500  for(vector<RefCountedVertexTrack>::const_iterator i = tracks.begin();
501  i != tracks.end(); i++)
502  {
503  lTracks.push_back((**i).linearizedTrack());
504  }
505 
506  return reWeightTracks(lTracks, seed);
507 }
int i
Definition: DBlmapReader.cc:9
std::vector< RefCountedVertexTrack > reWeightTracks(const std::vector< RefCountedLinearizedTrackState > &, const CachingVertex< 5 > &seed) const
tuple tracks
Definition: testEve_cfg.py:39
void AdaptiveVertexFitter::setParameters ( double  maxshift = 0.0001,
double  maxlpshift = 0.1,
unsigned  maxstep = 30,
double  weightthreshold = .001 
)

Reads the configurable parameters.

Parameters
maxshiftif the vertex moves further than this (in cm), then we re-iterate.
maxlpshiftif the vertex moves further than this, then we re-linearize the tracks.
maxstepthat's the maximum of iterations that we allow for.
weightthresholdthat's the minimum track weight for a track to be considered "significant". If fewer than two tracks are significant, an exception is thrown.

Definition at line 142 of file AdaptiveVertexFitter.cc.

References theMaxLPShift, theMaxShift, theMaxStep, and theWeightThreshold.

Referenced by AdaptiveGsfVertexFitter::AdaptiveGsfVertexFitter(), AdaptiveVertexFitter(), ConfigurableAdaptiveFitter::configure(), and setParameters().

144 {
145  theMaxShift = maxshift;
146  theMaxLPShift = maxlpshift;
147  theMaxStep = maxstep;
148  theWeightThreshold=weightthreshold;
149 }
void AdaptiveVertexFitter::setParameters ( const edm::ParameterSet s)

Sets parameters. The following parameters are expected: maxshift, maxlpshift, maxstep, weightthreshold

Definition at line 152 of file AdaptiveVertexFitter.cc.

References edm::ParameterSet::getParameter(), and setParameters().

153 {
154  setParameters ( s.getParameter<double>("maxshift"),
155  s.getParameter<double>("maxlpshift"),
156  s.getParameter<int>("maxstep"),
157  s.getParameter<double>("weightthreshold") );
158 }
T getParameter(std::string const &) const
void setParameters(double maxshift=0.0001, double maxlpshift=0.1, unsigned maxstep=30, double weightthreshold=.001)
void AdaptiveVertexFitter::setWeightThreshold ( float  w)

Set the weight threshold should be used only to find (once) a good value FIXME this should disappear in the final version

Definition at line 114 of file AdaptiveVertexFitter.cc.

References theWeightThreshold.

Referenced by AdaptiveVertexReconstructor::setupFitters().

115 {
117 }
CachingVertex< 5 > AdaptiveVertexFitter::vertex ( const std::vector< reco::TransientTrack > &  unstracks) const
virtual

Method returning the fitted vertex, from a container of reco::TransientTracks. The linearization point will be searched with the given LP finder. No prior vertex position will be used in the vertex fit.

Returns
The fitted vertex

Implements VertexFitter< 5 >.

Definition at line 161 of file AdaptiveVertexFitter.cc.

References fit(), LinearizationPointFinder::getLinearizationPoint(), linearizeTracks(), python.multivaluedict::sort(), theLinP, and testEve_cfg::tracks.

Referenced by NuclearVertexBuilder::FillVertexWithAdaptVtxFitter(), V0Fitter::fitAll(), PFDisplacedVertexFinder::fitVertexFromSeed(), PrimaryVertexAnalyzer4PU::getSimEvents(), InclusiveVertexFinder::produce(), TrackVertexArbitrator::produce(), AdaptiveGsfVertexFitter::vertex(), and AdaptiveVertexReconstructor::vertices().

162 {
163  if ( unstracks.size() < 2 )
164  {
165  LogError("RecoVertex|AdaptiveVertexFitter")
166  << "Supplied fewer than two tracks. Vertex is invalid.";
167  return CachingVertex<5>(); // return invalid vertex
168  };
169  vector < reco::TransientTrack > tracks = unstracks;
170  sort ( tracks.begin(), tracks.end(), CompareTwoTracks() );
171  // Linearization Point
172  GlobalPoint linP = theLinP->getLinearizationPoint(tracks);
173  // Initial vertex seed, with a very large error matrix
174  VertexState lseed (linP, linPointError() );
175  vector<RefCountedVertexTrack> vtContainer = linearizeTracks(tracks, lseed);
176 
177  VertexState seed (linP, fitError() );
178  return fit(vtContainer, seed, false);
179 }
LinearizationPointFinder * theLinP
CachingVertex< 5 > fit(const std::vector< RefCountedVertexTrack > &tracks, const VertexState &priorSeed, bool withPrior) const
tuple tracks
Definition: testEve_cfg.py:39
virtual GlobalPoint getLinearizationPoint(const std::vector< reco::TransientTrack > &) const =0
std::vector< RefCountedVertexTrack > linearizeTracks(const std::vector< reco::TransientTrack > &, const VertexState &) const
CachingVertex< 5 > AdaptiveVertexFitter::vertex ( const std::vector< RefCountedVertexTrack > &  tracks) const
virtual

Method returning the fitted vertex, from a container of VertexTracks. For the first loop, the LinearizedTrack contained in the VertexTracks will be used. If subsequent loops are needed, the new VertexTracks will be created with the last estimate of the vertex as linearization point. No prior vertex position will be used in the vertex fit.

Returns
The fitted vertex

Definition at line 182 of file AdaptiveVertexFitter.cc.

References fit().

183 {
184  if ( tracks.size() < 2 )
185  {
186  LogError("RecoVertex|AdaptiveVertexFitter")
187  << "Supplied fewer than two tracks. Vertex is invalid.";
188  return CachingVertex<5>(); // return invalid vertex
189  };
190  // Initial vertex seed, with a very small weight matrix
191  GlobalPoint linP = tracks[0]->linearizedTrack()->linearizationPoint();
192  VertexState seed (linP, fitError() );
193  return fit(tracks, seed, false);
194 }
CachingVertex< 5 > fit(const std::vector< RefCountedVertexTrack > &tracks, const VertexState &priorSeed, bool withPrior) const
tuple tracks
Definition: testEve_cfg.py:39
CachingVertex< 5 > AdaptiveVertexFitter::vertex ( const std::vector< RefCountedVertexTrack > &  tracks,
const reco::BeamSpot spot 
) const
virtual

Same as above, only now also with BeamSpot constraint.

Definition at line 197 of file AdaptiveVertexFitter.cc.

References fit().

198 {
199  if ( tracks.size() < 1 )
200  {
201  LogError("RecoVertex|AdaptiveVertexFitter")
202  << "Supplied no tracks. Vertex is invalid.";
203  return CachingVertex<5>(); // return invalid vertex
204  };
205  VertexState beamSpotState(spot);
206  return fit(tracks, beamSpotState, true );
207 }
CachingVertex< 5 > fit(const std::vector< RefCountedVertexTrack > &tracks, const VertexState &priorSeed, bool withPrior) const
tuple tracks
Definition: testEve_cfg.py:39
CachingVertex< 5 > AdaptiveVertexFitter::vertex ( const std::vector< reco::TransientTrack > &  tracks,
const GlobalPoint linPoint 
) const
virtual

Fit vertex out of a std::vector of reco::TransientTracks. Uses the specified linearization point.

Fit vertex out of a set of reco::TransientTracks. Uses the specified linearization point.

Implements VertexFitter< 5 >.

Definition at line 215 of file AdaptiveVertexFitter.cc.

References fit(), and linearizeTracks().

217 {
218  if ( tracks.size() < 2 )
219  {
220  LogError("RecoVertex|AdaptiveVertexFitter")
221  << "Supplied fewer than two tracks. Vertex is invalid.";
222  return CachingVertex<5>(); // return invalid vertex
223  };
224  // Initial vertex seed, with a very large error matrix
225  VertexState seed (linPoint, linPointError() );
226  vector<RefCountedVertexTrack> vtContainer = linearizeTracks(tracks, seed);
227  VertexState fitseed (linPoint, fitError() );
228  return fit(vtContainer, fitseed, false);
229 }
CachingVertex< 5 > fit(const std::vector< RefCountedVertexTrack > &tracks, const VertexState &priorSeed, bool withPrior) const
tuple tracks
Definition: testEve_cfg.py:39
std::vector< RefCountedVertexTrack > linearizeTracks(const std::vector< reco::TransientTrack > &, const VertexState &) const
CachingVertex< 5 > AdaptiveVertexFitter::vertex ( const std::vector< reco::TransientTrack > &  tracks,
const GlobalPoint priorPos,
const GlobalError priorError 
) const
virtual

Fit vertex out of a set of reco::TransientTracks. Uses the position as both the linearization point AND as prior estimate of the vertex position. The error is used for the weight of the prior estimate.

Implements VertexFitter< 5 >.

Definition at line 272 of file AdaptiveVertexFitter.cc.

References fit(), and linearizeTracks().

276 {
277  if ( tracks.size() < 1 )
278  {
279  LogError("RecoVertex|AdaptiveVertexFitter")
280  << "Supplied no tracks. Vertex is invalid.";
281  return CachingVertex<5>(); // return invalid vertex
282  };
283  VertexState seed (priorPos, priorError);
284  vector<RefCountedVertexTrack> vtContainer = linearizeTracks(tracks, seed);
285  return fit( vtContainer, seed, true );
286 }
CachingVertex< 5 > fit(const std::vector< RefCountedVertexTrack > &tracks, const VertexState &priorSeed, bool withPrior) const
tuple tracks
Definition: testEve_cfg.py:39
std::vector< RefCountedVertexTrack > linearizeTracks(const std::vector< reco::TransientTrack > &, const VertexState &) const
CachingVertex< 5 > AdaptiveVertexFitter::vertex ( const std::vector< reco::TransientTrack > &  tracks,
const reco::BeamSpot beamSpot 
) const
virtual

Fit vertex out of a set of TransientTracks. The specified BeamSpot will be used as priot, but NOT for the linearization. The specified LinearizationPointFinder will be used to find the linearization point.

Implements VertexFitter< 5 >.

Definition at line 237 of file AdaptiveVertexFitter.cc.

References fit(), LinearizationPointFinder::getLinearizationPoint(), linearizeTracks(), python.multivaluedict::sort(), theLinP, and testEve_cfg::tracks.

239 {
240  if ( unstracks.size() < 1 )
241  {
242  LogError("RecoVertex|AdaptiveVertexFitter")
243  << "Supplied no tracks. Vertex is invalid.";
244  return CachingVertex<5>(); // return invalid vertex
245  };
246 
247  VertexState beamSpotState(beamSpot);
248  vector<RefCountedVertexTrack> vtContainer;
249 
250  vector < reco::TransientTrack > tracks = unstracks;
251  sort ( tracks.begin(), tracks.end(), CompareTwoTracks() );
252 
253  if (tracks.size() > 1) {
254  // Linearization Point search if there are more than 1 track
255  GlobalPoint linP = theLinP->getLinearizationPoint(tracks);
256  VertexState lpState(linP, linPointError() );
257  vtContainer = linearizeTracks(tracks, lpState);
258  } else {
259  // otherwise take the beamspot position.
260  vtContainer = linearizeTracks(tracks, beamSpotState);
261  }
262 
263  return fit(vtContainer, beamSpotState, true);
264 }
LinearizationPointFinder * theLinP
CachingVertex< 5 > fit(const std::vector< RefCountedVertexTrack > &tracks, const VertexState &priorSeed, bool withPrior) const
tuple tracks
Definition: testEve_cfg.py:39
virtual GlobalPoint getLinearizationPoint(const std::vector< reco::TransientTrack > &) const =0
std::vector< RefCountedVertexTrack > linearizeTracks(const std::vector< reco::TransientTrack > &, const VertexState &) const
CachingVertex< 5 > AdaptiveVertexFitter::vertex ( const std::vector< RefCountedVertexTrack > &  tracks,
const GlobalPoint priorPos,
const GlobalError priorError 
) const
virtual

Fit vertex out of a set of VertexTracks Uses the position and error for the prior estimate of the vertex. This position is not used to relinearize the tracks.

Definition at line 293 of file AdaptiveVertexFitter.cc.

References fit().

297 {
298  if ( tracks.size() < 1 )
299  {
300  LogError("RecoVertex|AdaptiveVertexFitter")
301  << "Supplied no tracks. Vertex is invalid.";
302  return CachingVertex<5>(); // return invalid vertex
303  };
304  VertexState seed (priorPos, priorError);
305  return fit(tracks, seed, true);
306 }
CachingVertex< 5 > fit(const std::vector< RefCountedVertexTrack > &tracks, const VertexState &priorSeed, bool withPrior) const
tuple tracks
Definition: testEve_cfg.py:39
vector< AdaptiveVertexFitter::RefCountedVertexTrack > AdaptiveVertexFitter::weightTracks ( const std::vector< RefCountedLinearizedTrackState > &  lTracks,
const VertexState seed 
) const
private

Weight the tracks, for the first time, using KalmanChiSquare.

track weighting, as opposed to re-weighting, must always be done with a reset annealer!

Definition at line 444 of file AdaptiveVertexFitter.cc.

References gather_cfg::cout, AnnealingSchedule::currentTemp(), VertexTrackCompatibilityEstimator< N >::estimate(), mergeVDriftHistosByStation::file, getId(), getWeight(), i, m, AnnealingSchedule::resetAnnealing(), theAssProbComputer, theComp, theNr, VertexTrackFactory< N >::vertexTrack(), AnnealingSchedule::weight(), and CommonMethods::weight().

Referenced by linearizeTracks().

447 {
448  theNr++;
449  CachingVertex<5> seedvtx ( seed, vector<RefCountedVertexTrack> (), 0. );
453 
454  vector<RefCountedVertexTrack> finalTracks;
455  VertexTrackFactory<5> vTrackFactory;
456  #ifdef STORE_WEIGHTS
457  iter++;
458  #endif
459  for(vector<RefCountedLinearizedTrackState>::const_iterator i
460  = lTracks.begin(); i != lTracks.end(); i++)
461  {
462 
463  double weight = 0.;
464  pair<bool, double> chi2Res = theComp->estimate ( seedvtx, *i );
465  if (!chi2Res.first) {
466  cout << "[AdaptiveVertexFitter] Aiee! " << endl;
467  LogWarning ("AdaptiveVertexFitter" ) << "When weighting a track, chi2 calculation failed;"
468  << " will add with w=0.";
469  } else {
470  weight = getWeight ( chi2Res.second );
471  }
472  RefCountedVertexTrack vTrData
473  = vTrackFactory.vertexTrack(*i, seed, weight );
474  #ifdef STORE_WEIGHTS
475  map < string, dataharvester::MultiType > m;
476  m["chi2"]=chi2;
477  m["w"]=theAssProbComputer->weight(chi2);
479  m["n"]=iter;
480  m["id"]=getId ( *i );
481  m["pos"]="weight";
482  dataharvester::Writer::file("w.txt").save ( m );
483  #endif
484  finalTracks.push_back(vTrData);
485  }
486  return finalTracks;
487 }
virtual BDpair estimate(const CachingVertex< N > &v, const RefCountedLinearizedTrackState track) const =0
int i
Definition: DBlmapReader.cc:9
RefCountedVertexTrack vertexTrack(const RefCountedLinearizedTrackState lt, const VertexState vs, float weight=1.0) const
static unsigned int getId(void)
ReferenceCountingPointer< VertexTrack< 5 > > RefCountedVertexTrack
AnnealingSchedule * theAssProbComputer
virtual double currentTemp() const =0
double getWeight(float chi2) const
virtual void resetAnnealing()=0
tuple cout
Definition: gather_cfg.py:41
virtual double weight(double chi2) const =0
VertexTrackCompatibilityEstimator< 5 > * theComp

Member Data Documentation

bool AdaptiveVertexFitter::gsfIntermediarySmoothing_
private

Definition at line 215 of file AdaptiveVertexFitter.h.

Referenced by fit(), and gsfIntermediarySmoothing().

int AdaptiveVertexFitter::mctr_
mutableprivate

Definition at line 216 of file AdaptiveVertexFitter.h.

AnnealingSchedule* AdaptiveVertexFitter::theAssProbComputer
private
VertexTrackCompatibilityEstimator<5>* AdaptiveVertexFitter::theComp
private

Definition at line 213 of file AdaptiveVertexFitter.h.

Referenced by reWeightTracks(), weightTracks(), and ~AdaptiveVertexFitter().

LinearizationPointFinder* AdaptiveVertexFitter::theLinP
private

Definition at line 209 of file AdaptiveVertexFitter.h.

Referenced by vertex(), and ~AdaptiveVertexFitter().

const AbstractLTSFactory<5>* AdaptiveVertexFitter::theLinTrkFactory
private
double AdaptiveVertexFitter::theMaxLPShift
private

Definition at line 204 of file AdaptiveVertexFitter.h.

Referenced by fit(), and setParameters().

double AdaptiveVertexFitter::theMaxShift
private

Definition at line 203 of file AdaptiveVertexFitter.h.

Referenced by fit(), and setParameters().

int AdaptiveVertexFitter::theMaxStep
private

Definition at line 205 of file AdaptiveVertexFitter.h.

Referenced by fit(), and setParameters().

int AdaptiveVertexFitter::theNr
mutableprivate

Definition at line 207 of file AdaptiveVertexFitter.h.

Referenced by reWeightTracks(), and weightTracks().

VertexSmoother<5>* AdaptiveVertexFitter::theSmoother
private

Definition at line 211 of file AdaptiveVertexFitter.h.

Referenced by fit(), and ~AdaptiveVertexFitter().

VertexUpdator<5>* AdaptiveVertexFitter::theUpdator
private

Definition at line 210 of file AdaptiveVertexFitter.h.

Referenced by fit(), and ~AdaptiveVertexFitter().

double AdaptiveVertexFitter::theWeightThreshold
private

Definition at line 206 of file AdaptiveVertexFitter.h.

Referenced by fit(), setParameters(), and setWeightThreshold().