CMS 3D CMS Logo

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

Simple method to get the correct jet combination in semileptonic ttbar events. More...

#include "TopQuarkAnalysis/TopLeptonSelection/interface/TtSemiSimpleBestJetComb.h"

Public Member Functions

int operator() (std::vector< TtSemiEvtSolution > &)
 
 TtSemiSimpleBestJetComb ()
 
 ~TtSemiSimpleBestJetComb ()
 

Detailed Description

Simple method to get the correct jet combination in semileptonic ttbar events.

This method starts from a vector of fitted TtSemiEvtSolutions. This class returns the solution with the highest probChi^2 value. In case that there are more possibilities (eg when only a hadrW constraint was applied), the correct hadronic b is assumed to be the one with the smallest DR angle wrt the Whadr direction.

Author
Jan Heyninck
Version
Id:
TtSemiSimpleBestJetComb.h,v 1.3 2007/09/20 18:03:21 lowette Exp

Definition at line 32 of file TtSemiSimpleBestJetComb.h.

Constructor & Destructor Documentation

TtSemiSimpleBestJetComb::TtSemiSimpleBestJetComb ( )

Definition at line 6 of file TtSemiSimpleBestJetComb.cc.

7 {
8 }
TtSemiSimpleBestJetComb::~TtSemiSimpleBestJetComb ( )

Definition at line 10 of file TtSemiSimpleBestJetComb.cc.

11 {
12 }

Member Function Documentation

int TtSemiSimpleBestJetComb::operator() ( std::vector< TtSemiEvtSolution > &  sols)

Definition at line 14 of file TtSemiSimpleBestJetComb.cc.

References max(), phi, and alignCSCRings::s.

15 {
16  // search the highest probChi^2 value in the among the different jet combination solutions
17  double maxProbChi2 = 0;
18  for(unsigned int s=0; s<sols.size(); s++) maxProbChi2 = std::max(maxProbChi2,sols[s].getProbChi2());
19 
20  //search indices of original solutions with highest probChi2 value
21  std::vector<unsigned int> indices;
22  indices.clear();
23  for(unsigned int s=0; s<sols.size(); s++){
24  if(fabs(sols[s].getProbChi2()-maxProbChi2) < 0.0001) indices.push_back(s);
25  }
26 
27  int bestSol = -999;
28  if(maxProbChi2 > 0.){
29  if(indices.size() == 1) bestSol = indices[0];
30  if(indices.size() == 2) {
31  //typically only light jets constraints applied, so still b-jet ambiguity to resolve
32  // -> look at DPhi(Whadr,bhadr) and choose smallest value
33  double DPhi_Wb0 = fabs(sols[indices[0]].getFitHadW().phi()-sols[indices[0]].getFitHadb().phi());
34  double DPhi_Wb1 = fabs(sols[indices[1]].getFitHadW().phi()-sols[indices[1]].getFitHadb().phi());
35  if(DPhi_Wb0>3.1415) DPhi_Wb0 = 2.*3.1415-DPhi_Wb0;
36  if(DPhi_Wb1>3.1415) DPhi_Wb1 = 2.*3.1415-DPhi_Wb1;
37  if(DPhi_Wb0 < DPhi_Wb1){
38  bestSol = indices[0];
39  }
40  else{
41  bestSol = indices[1];
42  }
43  }
44  }
45  return bestSol;
46 }
const T & max(const T &a, const T &b)
Definition: DDAxes.h:10