dqm_algorithms::RootFitGraph Struct Reference

#include <RootFitGraph.h>

Inheritance diagram for dqm_algorithms::RootFitGraph:

Collaboration diagram for dqm_algorithms::RootFitGraph:

Public Member Functions
	RootFitGraph (const std::string &name)
	~RootFitGraph ()
RootFitGraph *	clone ()
dqm_core::Result *	execute (const std::string &, const TObject &, const dqm_core::AlgorithmConfig &)
void	printDescription (std::ostream &out)

Private Attributes
std::string	m_name
std::unique_ptr< TF1 >	m_func

Detailed Description

Definition at line 23 of file RootFitGraph.h.

Constructor & Destructor Documentation

RootFitGraph()

dqm_algorithms::RootFitGraph::RootFitGraph

(

const std::string &

name

)

Definition at line 29 of file RootFitGraph.cxx.

  : m_name( name )
{ 
 
  if (m_name == "fermi"){
    m_func = std::make_unique<TF1> ( "fermi","[0]/(1+exp(([1]-x)/[2]))" );
  }
  if (m_name == "erf"){
    m_func = std::make_unique<TF1> ( "erf","[0]*TMath::Erf((x-[1])/(sqrt(2.)*[2]))" );
  }
  if (m_name == "flat"){
    m_func = std::make_unique<TF1> ( "flat","[0]" );
  }
  dqm_core::AlgorithmManager::instance().registerAlgorithm( "Simple_"+name +"_Fit_Graph", this );
}

~RootFitGraph()

dqm_algorithms::RootFitGraph::~RootFitGraph

(

)

Definition at line 45 of file RootFitGraph.cxx.

{
  // totally defeats the purpose of unique_ptr, but fixes a segfault in 5.34 ...
  (void)m_func.release();
}

Member Function Documentation

clone()

dqm_algorithms::RootFitGraph * dqm_algorithms::RootFitGraph::clone

(

)

Definition at line 52 of file RootFitGraph.cxx.

{
  return new RootFitGraph( m_name );
}

execute()

dqm_core::Result * dqm_algorithms::RootFitGraph::execute	(	const std::string &	name,
		const TObject &	object,
		const dqm_core::AlgorithmConfig &	config )

Definition at line 59 of file RootFitGraph.cxx.

{  
 
  //std::cout<<"ROOTFITGRAPH = calling rootfit with name "<<name<<std::endl;
  const TGraph * graph;
  if(object.IsA()->InheritsFrom( "TGraph" ))
    {  
      graph = static_cast<const TGraph*>(&object);
    }
  else {
    throw dqm_core::BadConfig( ERS_HERE, name, "does not inherit from TGraph" );
  }
  
  //std::cout<<"ROOTFITGRAPH = trying to get parameters"<<std::endl;  
  Axis_t xmin = dqm_algorithms::tools::GetFirstFromMap( "xmin", config.getParameters(), graph->GetXaxis()->GetXmin());
  Axis_t xmax = dqm_algorithms::tools::GetFirstFromMap( "xmax", config.getParameters(), graph->GetXaxis()->GetXmax());
 
  Axis_t ymin = dqm_algorithms::tools::GetFirstFromMap( "ymin", config.getParameters(), graph->GetYaxis()->GetXmin());
  Axis_t ymax = dqm_algorithms::tools::GetFirstFromMap( "ymax", config.getParameters(), graph->GetYaxis()->GetXmax());
 
  double xaxismean = (xmax + xmin)/2.;
  double xdiff = xmax - xmin;
  double ydiff = ymax - ymin;
 
 
  const double minpoint = dqm_algorithms::tools::GetFirstFromMap( "MinPoint", config.getParameters(), -1);
  const bool verbose = static_cast<bool>(dqm_algorithms::tools::GetFirstFromMap( "Verbose", config.getParameters(), 0));
  const double minSig = dqm_algorithms::tools::GetFirstFromMap( "MinSignificance", config.getParameters(), 0);
  const bool improve = static_cast<bool>(dqm_algorithms::tools::GetFirstFromMap( "ImproveFit", config.getParameters(), 0));
 
  //std::cout << "verbose " << verbose 
  //<< " draw " << draw  
  //<< " lf " << lf << std::endl;
  //std::cout<<"ROOTFITGRAPH = trying to get num points"<<std::endl;  
  if (graph->GetN() < minpoint || graph->GetN()==0) {
    if(verbose)std::cout << name << " number of points are too small " << graph->GetN() << std::endl;
    dqm_core::Result *result = new dqm_core::Result(dqm_core::Result::Undefined);
    result->tags_["InsufficientN"] = graph->GetN();
    return result;
  }
  if(verbose)std::cout << name << " enough number of points  " << graph->GetN() << std::endl;
  //std::cout<<"ROOTFITGRAPH = trying to get axes"<<std::endl;    
  TAxis *x = graph->GetXaxis();
  int nbins = x->GetNbins();
  double high = x->GetBinUpEdge(nbins);
  double low = x->GetBinUpEdge(0);
 
 
  if ( xmin>high || xmin<low || xmax>high || xmax<low) {
    throw dqm_core::BadConfig( ERS_HERE, name, "xmin and/or xmax value not in graph bin range" );
  }
     
  std::string option;
  //Always set option end to avoid making graphics object and drawing it.
  //draw fit curve if DrawFitCurve == 1.0 
  if (verbose){
    //if( draw == 1.0 ) option = "";
    //else option="N";
    option="N";
  } else {
    //if( draw == 1.0 ) option = "Q";
    //else option = "QN";
    option = "QN";
  }
 
  //Use Minos technique as recommended for better error calculation, if errors are important:
  // if both minos and improve are specified ("EM"), minos is used by ROOT automatically
  if ( minSig != 0    ) option += "E";
  if ( improve ) option += "M";
  //show histo name and fit option for verbose mode
  if( verbose ){
    std::cout <<" graph name " << graph->GetName() << std::endl;
    std::cout <<" fit option " << option << std::endl;
  }
  //std::cout<<"ROOTFITGRAPH = trying to do fits"<<std::endl;  
  if (m_name == "fermi") {
    if(verbose)std::cout << "set "<<name<< " parameters" << std::endl;
    m_func->SetParameter(0,ymax*0.9);
    m_func->SetParameter(1,xaxismean);
    m_func->SetParameter(2,xdiff/50.);
    m_func->SetParNames("Plateau","Threshold","Resolution");
 
    m_func->SetParLimits(0, ymin - 0.1 * ydiff, ymax + 0.1 * ydiff );
    m_func->SetParLimits(1, xmin, xmax );
    m_func->SetParLimits(2, 0., xdiff/4. );
  }
  else if(m_name == "erf") {
    if(verbose)std::cout << "set "<<name<< " parameters" << std::endl;
    m_func->SetParameter(0,ymax*0.9);
    m_func->SetParameter(1,xaxismean);
    m_func->SetParameter(2,xdiff/50.);
    m_func->SetParNames("Plateau","Threshold","Resolution");
 
    m_func->SetParLimits(0, ymin - 0.1 * ydiff, ymax + 0.1 * ydiff );
    m_func->SetParLimits(1, xmin, xmax );
    m_func->SetParLimits(2, 0., xdiff/4. );
  }
  else if(m_name == "flat") {
    if(verbose)std::cout << "set "<<name<< " parameters" << std::endl;
    m_func->SetParNames("Height");
  }
/*
  const int numsig = m_func->GetParNumber("Sigma");
 
  if (numsig != -1 ){
      double sigmaup = dqm_algorithms::tools::GetFirstFromMap( "Sigma_upperLimit", config.getParameters(), 1000000);
          m_func->SetParLimits(numsig, 0., sigmaup);
  }
  */ 
 
  if(verbose)std::cout << "fit "<<name<< " with interval cut " << xmin << " - " << xmax  << std::endl;
  const_cast<TGraph*>(graph)->Fit( m_func.get(), option.c_str(),"",xmin,xmax );
 
  const int numsig = m_func->GetParNumber("Sigma");
  if (numsig != -1 ){
      double sigma=m_func->GetParameter(numsig);
      m_func->SetParameter(numsig,std::abs(sigma));
  }
 
  try {
    dqm_core::Result *result= dqm_algorithms::tools::GetFitResult (m_func.get() , config, minSig );
    return result;
  }
  catch ( dqm_core::Exception & ex ) {
    throw dqm_core::BadConfig( ERS_HERE, name, ex.what(), ex );
  }
}

printDescription()

void dqm_algorithms::RootFitGraph::printDescription

(

std::ostream &

out

)

Definition at line 190 of file RootFitGraph.cxx.

{
  out<<"Simple_"+m_name+"_Fit_Graph: Does simple "+m_name+" fit to graph and checks fit parameters against thresholds\n"<<std::endl;
  if (m_name == "fermi" ) {
    out<<"The following fit Parameters can be checked with Red and Green Thresholds; only one parameter is needed to get back real result"<<std::endl;
    out<<"Green/Red Threshold: Plateau : Plateau fit value to give Green/Red Result"<<std::endl;
    out<<"Green/Red Threshold: Threshold : Fermi energy fit value to give Green/Red Result"<<std::endl;
    out<<"Green/Red Threshold: Resolution : Templature fit value to give Green/Red Result\n"<<std::endl;
  }else if (m_name == "erf" ) {
    out<<"The following fit Parameters can be checked with Red and Green Thresholds; only one parameter is needed to get back real result"<<std::endl;
    out<<"Green/Red Threshold: Plateau : Plateau fit value to give Green/Red Result"<<std::endl;
    out<<"Green/Red Threshold: Threshold : mean of gaussian fit value to give Green/Red Result"<<std::endl;
    out<<"Green/Red Threshold: Resolution : sigma of gaussian fit value to give Green/Red Result\n"<<std::endl;
  }
  out<<"Optional Parameter: Verbose: Write out fit results to log file (set to 1)"<<std::endl;
  out<<"Optional Parameter: MinPoint: Minimum graph point needed to perform Algorithm"<<std::endl;
  out<<"Optional Parameter: MinSignificance : Minimum multiple of the error in fit paramenter by which the parameter must exceed the thresholds"<<std::endl;
  out<<"Optional Parameter: ImproveFit : IMPROVE is used to avoid local minima"<<std::endl;
  out<<"Optional Parameter: xmin: minimum x range"<<std::endl;
  out<<"Optional Parameter: xmax: maximum x range"<<std::endl;
  out<<"Optional Parameter: SubtractFromMean: value subtracted from XMean before test is applied: allows using AbsXMean for non-zero expected mean"<<std::endl;
//  out<<"Optional Parameter: Sigma_upperLimit: Upper limit on Sigma- lower limit set to 0. and default upper value is 1e^6\n"<<std::endl;
                                                                                                                                            
}

Member Data Documentation

m_func

std::unique_ptr<TF1> dqm_algorithms::RootFitGraph::m_func

private

Definition at line 35 of file RootFitGraph.h.

m_name

std::string dqm_algorithms::RootFitGraph::m_name

private

Definition at line 34 of file RootFitGraph.h.

---

The documentation for this struct was generated from the following files:

• RootFitGraph.h
• RootFitGraph.cxx