[u/mrichter/AliRoot.git] / RICH / AliRICHClusterFinder.cxx

/**************************************************************************
 * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
 *                                                                        *
 * Author: The ALICE Off-line Project.                                    *
 * Contributors are mentioned in the code where appropriate.              *
 *                                                                        *
 * Permission to use, copy, modify and distribute this software and its   *
 * documentation strictly for non-commercial purposes is hereby granted   *
 * without fee, provided that the above copyright notice appears in all   *
 * copies and that both the copyright notice and this permission notice   *
 * appear in the supporting documentation. The authors make no claims     *
 * about the suitability of this software for any purpose. It is          *
 * provided "as is" without express or implied warranty.                  *
 **************************************************************************/


#include "AliRICHClusterFinder.h"
#include "AliRICHMap.h"
#include <TMinuit.h>
#include <TParticle.h>
#include <TVector3.h>
#include <AliLoader.h>
#include <AliStack.h>
#include <AliRun.h>

void RICHMinMathieson(Int_t &npar, Double_t *gin, Double_t &chi2, Double_t *par, Int_t iflag);

ClassImp(AliRICHClusterFinder)
//__________________________________________________________________________________________________
AliRICHClusterFinder::AliRICHClusterFinder(AliRICH *pRICH)   
{//main ctor
  fRICH = pRICH;//this goes first as GetDebug depends on it.
  if(GetDebug())Info("main ctor","Start.");
  
  fDigitMap = 0;
  fRawCluster.Reset();
  fResolvedCluster.Reset();
  if(GetDebug())Info("main ctor","Stop.");
}//main ctor
//__________________________________________________________________________________________________
void AliRICHClusterFinder::Exec()
{
//Main method of cluster finder. Loops on  events and chambers, everything else is done in FindClusters()  
  if(GetDebug()) Info("Exec","Start.");
    
  R()->GetLoader()                ->LoadDigits();   
  R()->GetLoader()->GetRunLoader()->LoadHeader();
  R()->GetLoader()->GetRunLoader()->LoadKinematics();

  for(Int_t iEventN=0;iEventN<gAlice->GetEventsPerRun();iEventN++){//events loop
    if(GetDebug()) Info("Exec","Processing event %i...",iEventN);
    R()->GetLoader()->GetRunLoader()->GetEvent(iEventN);
    
    R()->GetLoader()->MakeTree("R");  R()->MakeBranch("R");
    R()->ResetDigits();               R()->ResetClusters();
    
    R()->GetLoader()->TreeD()->GetEntry(0);
    for(Int_t iChamber=1;iChamber<=kNCH;iChamber++){//chambers loop
      FindClusters(iChamber);
    }//chambers loop
    R()->GetLoader()->TreeR()->Fill();  R()->GetLoader()->WriteRecPoints("OVERWRITE");//write out clusters for current event
  }//events loop  
  
  R()->ResetDigits();//reset and unload everything
  R()->ResetClusters();
  R()->GetLoader()                ->UnloadDigits(); 
  R()->GetLoader()                ->UnloadRecPoints();  
  R()->GetLoader()->GetRunLoader()->UnloadHeader();
  R()->GetLoader()->GetRunLoader()->UnloadKinematics();

  if(GetDebug()) Info("Exec","Stop.");      
}//Exec()
//__________________________________________________________________________________________________
void AliRICHClusterFinder::FindClusters(Int_t iChamber)
{
//Loops on digits for a given chamber, forms raw clusters, then tries to resolve them if requested
  Int_t iNdigits=R()->Digits(iChamber)->GetEntriesFast();
  if(GetDebug())Info("FindClusters","Start for chamber %i with %i digits.",iChamber,iNdigits);  
  
  if(iNdigits==0)return;//no digits for a given chamber, nothing to do

  fDigitMap=new AliRICHMap(R()->Digits(iChamber));//create digit map for the given chamber

  for(Int_t iDigN=0;iDigN<iNdigits;iDigN++){//digits loop for a given chamber    
    AliRICHdigit *dig=(AliRICHdigit*)R()->Digits(iChamber)->At(iDigN);
    Int_t i=dig->X();   Int_t j=dig->Y();
    if(fDigitMap->TestHit(i,j)==kUsed) continue;//this digit is already taken, go after next digit
	
    FormRawCluster(i,j);//form raw cluster starting from (i,j) pad 
    if(GetDebug()) {Info("FindClusters","After FormRawCluster:");fRawCluster.Print();}  
    FindLocalMaxima();  //find number of local maxima and initial center of gravity
    if(GetDebug()) {Info("FindClusters","After FindLocalMaxima:");fRawCluster.Print();}  
    
    if(AliRICHParam::IsResolveClusters()&&fRawCluster.Size()>1&&fRawCluster.Size()<6){
      FitCoG(); //serialization of resolved clusters will happen inside
    }else{//cluster size=1 or resolving is switched off
      WriteRawCluster();//simply output the formed raw cluster without deconvolution
    }
    fRawCluster.Reset(); fResolvedCluster.Reset();
  }//digits loop for a given chamber

  delete fDigitMap;
  
  if(GetDebug())Info("FindClusters","Stop.");  
}//FindClusters()
//__________________________________________________________________________________________________
void AliRICHClusterFinder::FindClusterContribs(AliRICHcluster *pCluster)
{
//Finds cerenkov-feedback-mip mixture for a given cluster
  if(GetDebug()) {Info("FindClusterContribs","Start.");pCluster->Print();}
  
  TObjArray *pDigits = pCluster->Digits();
  if(!pDigits) return; //??????????
  Int_t iNmips=0,iNckovs=0,iNfeeds=0;
  TArrayI contribs(3*pCluster->Size());
  Int_t *pindex = new Int_t[3*pCluster->Size()];
  for(Int_t iDigN=0;iDigN<pCluster->Size();iDigN++) {//loop on digits of a given cluster
    contribs[3*iDigN]  =((AliRICHdigit*)pDigits->At(iDigN))->GetTrack(0);
    if (contribs[3*iDigN] >= 10000000) contribs[3*iDigN] = 0;
    contribs[3*iDigN+1]=((AliRICHdigit*)pDigits->At(iDigN))->GetTrack(1);
    if (contribs[3*iDigN+1] >= 10000000) contribs[3*iDigN+1] = 0;
    contribs[3*iDigN+2]=((AliRICHdigit*)pDigits->At(iDigN))->GetTrack(2);
    if (contribs[3*iDigN+2] >= 10000000) contribs[3*iDigN+2] = 0;
  }//loop on digits of a given cluster
  TMath::Sort(contribs.GetSize(),contribs.GetArray(),pindex);
  for(Int_t iDigN=0;iDigN<3*pCluster->Size()-1;iDigN++) {//loop on digits to sort tids
    if(GetDebug()) Info("FindClusterContribs","%4i for digit n. %4i",contribs[pindex[iDigN]],iDigN);
    if(contribs[pindex[iDigN]]!=contribs[pindex[iDigN+1]]) {
      TParticle* particle = R()->GetLoader()->GetRunLoader()->Stack()->Particle(contribs[pindex[iDigN]]);
      Int_t code   = particle->GetPdgCode();
      Double_t charge = 0;
      if(particle->GetPDG()) charge=particle->GetPDG()->Charge();
      if(GetDebug()) Info("FindClusterContribs"," charge of particle %f",charge);

      if(code==50000050) iNckovs++;
      if(code==50000051) iNfeeds++;
      if(charge!=0) iNmips++;
    }
  }//loop on digits to sort Tid
  
  if (contribs[pindex[3*pCluster->Size()-1]]!=kBad) {

     TParticle* particle = R()->GetLoader()->GetRunLoader()->Stack()->Particle(contribs[pindex[3*pCluster->Size()-1]]);
     Int_t code   = particle->GetPdgCode();
     Double_t charge = 0;
     if(particle->GetPDG()) charge=particle->GetPDG()->Charge();
     if(GetDebug()) Info("FindClusterContribs"," charge of particle %f",charge);
     if(code==50000050) iNckovs++;
     if(code==50000051) iNfeeds++;
     if(charge!=0) iNmips++;
  }
    
  pCluster->CFM(iNckovs,iNfeeds,iNmips);
//  
  delete [] pindex; 
  if(GetDebug()) {pCluster->Print();Info("FindClusterContribs","Stop.");}
}//FindClusterContribs()
//__________________________________________________________________________________________________
void  AliRICHClusterFinder::FormRawCluster(Int_t i, Int_t j)
{
//Builds the raw cluster (before deconvolution). Starts from the first pad (i,j) then calls itself recursevly  for all neighbours.
  if(GetDebug()) Info("FormRawCluster","Start with digit(%i,%i) Q=%f",i,j,((AliRICHdigit*)fDigitMap->GetHit(i,j))->Q());
  
  fRawCluster.AddDigit((AliRICHdigit*) fDigitMap->GetHit(i,j));//take this pad in cluster
  fDigitMap->FlagHit(i,j);//flag this pad as taken  

  Int_t listX[4], listY[4];    //  Now look recursively for all neighbours
  for (Int_t iNei=0;iNei<R()->P()->PadNeighbours(i,j,listX,listY);iNei++)
    if(fDigitMap->TestHit(listX[iNei],listY[iNei])==kUnused) FormRawCluster(listX[iNei],listY[iNei]);    
}//FormRawCluster()
//__________________________________________________________________________________________________
void AliRICHClusterFinder::FindLocalMaxima()
{
//find number of local maxima in the current raw cluster and then calculates initial center of gravity
  fNlocals=0;
  for(Int_t iDig1=0;iDig1<fRawCluster.Size();iDig1++) {
    Int_t iNotMax = 0;
    AliRICHdigit *pDig1 = (AliRICHdigit *)fRawCluster.Digits()->At(iDig1);
    TVector pad1 = pDig1->Pad();
    Int_t padQ1 = (Int_t)(pDig1->Q()+0.1);
    Int_t padC1 = pDig1->ChFbMi();
    for(Int_t iDig2=0;iDig2<fRawCluster.Size();iDig2++) {
      AliRICHdigit *pDig2 = (AliRICHdigit *)fRawCluster.Digits()->At(iDig2);
      TVector pad2 = pDig2->Pad();
      Int_t padQ2 = (Int_t)(pDig2->Q()+0.1);
      if(iDig1==iDig2) continue;
      Int_t diffx = TMath::Sign(Int_t(pad1[0]-pad2[0]),1);
      Int_t diffy = TMath::Sign(Int_t(pad1[1]-pad2[1]),1);
      if((diffx+diffy)<=1) {
         if(padQ2>=padQ1) iNotMax++;
      }
    }
    if(iNotMax==0) {
      TVector2 x2=AliRICHParam::Pad2Loc(pad1);
      fLocalX[fNlocals]=x2.X();fLocalY[fNlocals]=x2.Y();
      fLocalQ[fNlocals] = (Double_t)padQ1;
      fLocalC[fNlocals] = padC1;
      fNlocals++;
    }
  }
  fRawCluster.CoG(fNlocals); //first initial approximation of the CoG...to start minimization.
}//FindLocalMaxima()
//__________________________________________________________________________________________________
void AliRICHClusterFinder::WriteRawCluster()
{
//Add the current raw cluster to the list of clusters
  if(GetDebug()) Info("WriteRawCluster","Start.");
  
  FindClusterContribs(&fRawCluster);  
  R()->AddCluster(fRawCluster);
  
  if(GetDebug()){fRawCluster.Print(); Info("WriteRawCluster","Stop.");}  
}//WriteRawCluster()
//__________________________________________________________________________________________________
void AliRICHClusterFinder::WriteResolvedCluster()
{
//Add the current resolved cluster to the list of clusters
  if(GetDebug()) Info("WriteResolvedCluster","Start.");
  
  FindClusterContribs(&fResolvedCluster);  
  R()->AddCluster(fResolvedCluster);
  
  if(GetDebug()){fResolvedCluster.Print(); Info("WriteResolvedCluster","Stop.");}  
}//WriteResolvedCluster()
//__________________________________________________________________________________________________
void AliRICHClusterFinder::FitCoG()
{
//Fits cluster of size  by the corresponding number of Mathieson shapes.
//This methode is only invoked in case everything is ok to start deconvolution  
  if(GetDebug()) {Info("FitCoG","Start with:"); fRawCluster.Print();}
  
  Double_t arglist;
  Int_t ierflag = 0;

  TMinuit *pMinuit = new TMinuit(3*fNlocals-1);
  pMinuit->mninit(5,10,7);
  
  arglist = -1;
  pMinuit->mnexcm("SET PRI",&arglist, 1, ierflag);
  pMinuit->mnexcm("SET NOW",&arglist, 0, ierflag);
  
  TString chname;
  Int_t ierflg;
  
  pMinuit->SetObjectFit((TObject*)this);
  pMinuit->SetFCN(RICHMinMathieson);
  
  Double_t vstart,lower, upper;
  Double_t stepX= 0.001;
  Double_t stepY= 0.001;
  Double_t stepQ= 0.0001;
  
  for(Int_t i=0;i<fNlocals;i++) {
    vstart   = fLocalX[i];
    lower    = vstart - 2*AliRICHParam::PadSizeX();
    upper    = vstart + 2*AliRICHParam::PadSizeX();
    pMinuit->mnparm(3*i  ,Form("xCoG  %i",i),vstart,stepX,lower,upper,ierflag);
    vstart   = fLocalY[i];
    lower    = vstart - 2*AliRICHParam::PadSizeY();
    upper    = vstart + 2*AliRICHParam::PadSizeY();
    pMinuit->mnparm(3*i+1,Form("yCoG  %i",i),vstart,stepY,lower,upper,ierflag);
    if(i==fNlocals-1) break;                    // last parameter is constrained
    vstart = fLocalQ[i]/fRawCluster.Q();
    lower  = 0;
    upper  = 1;
    pMinuit->mnparm(3*i+2,Form("qfrac %i",i),vstart,stepQ,lower,upper,ierflag);
  }
  
  arglist = -1;
  pMinuit->mnexcm("SET NOGR",&arglist, 1, ierflag);
  arglist = 1;
  pMinuit->mnexcm("SET ERR", &arglist, 1,ierflg);
  arglist = -1;
  pMinuit->mnexcm("SIMPLEX",&arglist, 0, ierflag);
  pMinuit->mnexcm("MIGRAD",&arglist, 0, ierflag);
  pMinuit->mnexcm("EXIT" ,&arglist, 0, ierflag);

  Double_t xCoG[50],yCoG[50],qfracCoG[50];
  Double_t eps, b1, b2;

  Double_t qfraclast=0;  
  for(Int_t i=0;i<fNlocals;i++) {
    pMinuit->mnpout(3*i  ,chname,     xCoG[i], eps , b1, b2, ierflg);
    pMinuit->mnpout(3*i+1,chname,     yCoG[i], eps , b1, b2, ierflg);
    if(i==fNlocals-1) break;
    pMinuit->mnpout(3*i+2,chname, qfracCoG[i], eps , b1, b2, ierflg);
    qfraclast+=qfracCoG[i];
   }
  qfracCoG[fNlocals-1] = 1 - qfraclast;
  delete pMinuit;

  for(Int_t i=0;i<fNlocals;i++){//resolved positions loop
    fResolvedCluster.Fill(&fRawCluster,xCoG[i],yCoG[i],qfracCoG[i],fLocalC[i]);
    WriteResolvedCluster();
  }
  if(GetDebug()) Info("CoG","Stop.");
}//FitCoG()
//__________________________________________________________________________________________________
void RICHMinMathieson(Int_t &npar, Double_t *, Double_t &chi2, Double_t *par, Int_t )
{
//Mathieson minimization function 
  
  AliRICHcluster *pRawCluster = ((AliRICHClusterFinder*)gMinuit->GetObjectFit())->GetRawCluster();

  TVector2 centroid[50];
  Double_t q[50];
  Int_t nFunctions = (npar+1)/3;
  Double_t qfract = 0;
  for(Int_t i=0;i<nFunctions;i++) {
    centroid[i].Set(par[3*i],par[3*i+1]);
    if(i==nFunctions-1) break;
    q[i]=par[3*i+2];
    qfract+=q[i];
  }
  q[nFunctions-1] = 1 - qfract;
    
  chi2 = 0;
  Int_t qtot = pRawCluster->Q();
  for(Int_t i=0;i<pRawCluster->Size();i++) {
    TVector  pad=((AliRICHdigit *)pRawCluster->Digits()->At(i))->Pad();
    Double_t padQ = ((AliRICHdigit *)pRawCluster->Digits()->At(i))->Q();
    Double_t qfracpar=0;
    for(Int_t j=0;j<nFunctions;j++) {
      qfracpar += q[j]*AliRICHParam::FracQdc(centroid[j],pad);
    }
    chi2 += TMath::Power((qtot*qfracpar-padQ),2)/padQ;
  }     
}//RICHMinMathieson()
//__________________________________________________________________________________________________
Commit	Line	Data
8265fa96	1	/**************************************************************************
	2	* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
	3	* *
	4	* Author: The ALICE Off-line Project. *
	5	* Contributors are mentioned in the code where appropriate. *
	6	* *
	7	* Permission to use, copy, modify and distribute this software and its *
	8	* documentation strictly for non-commercial purposes is hereby granted *
	9	* without fee, provided that the above copyright notice appears in all *
	10	* copies and that both the copyright notice and this permission notice *
	11	* appear in the supporting documentation. The authors make no claims *
	12	* about the suitability of this software for any purpose. It is *
	13	* provided "as is" without express or implied warranty. *
	14	**************************************************************************/
	15
8265fa96	16
8265fa96	17	#include "AliRICHClusterFinder.h"
543d5224	18	#include "AliRICHMap.h"
9d6f9427	19	#include <TMinuit.h>
ed3ceb24	20	#include <TParticle.h>
9d6f9427	21	#include <TVector3.h>
cbaf35fb	22	#include <AliLoader.h>
ed3ceb24	23	#include <AliStack.h>
cbaf35fb	24	#include <AliRun.h>
8265fa96	25
9d6f9427	26	void RICHMinMathieson(Int_t &npar, Double_t gin, Double_t &chi2, Double_t par, Int_t iflag);
8265fa96	27
8265fa96	28	ClassImp(AliRICHClusterFinder)
543d5224	29	//__________________________________________________________________________________________________
	30	AliRICHClusterFinder::AliRICHClusterFinder(AliRICH *pRICH)
	31	{//main ctor
e42a7b46	32	fRICH = pRICH;//this goes first as GetDebug depends on it.
e42a7b46	33	if(GetDebug())Info("main ctor","Start.");
543d5224	34
e42a7b46	35	fDigitMap = 0;
6865fb8d	36	fRawCluster.Reset();
6865fb8d	37	fResolvedCluster.Reset();
e42a7b46	38	if(GetDebug())Info("main ctor","Stop.");
543d5224	39	}//main ctor
543d5224	40	//__________________________________________________________________________________________________
543d5224	41	void AliRICHClusterFinder::Exec()
237c933d	42	{
e42a7b46	43	//Main method of cluster finder. Loops on events and chambers, everything else is done in FindClusters()
89924db8	44	if(GetDebug()) Info("Exec","Start.");
e42a7b46	45
	46	R()->GetLoader() ->LoadDigits();
	47	R()->GetLoader()->GetRunLoader()->LoadHeader();
	48	R()->GetLoader()->GetRunLoader()->LoadKinematics();
ed3ceb24	49
543d5224	50	for(Int_t iEventN=0;iEventN<gAlice->GetEventsPerRun();iEventN++){//events loop
e42a7b46	51	if(GetDebug()) Info("Exec","Processing event %i...",iEventN);
e42a7b46	52	R()->GetLoader()->GetRunLoader()->GetEvent(iEventN);
237c933d	53
e42a7b46	54	R()->GetLoader()->MakeTree("R"); R()->MakeBranch("R");
e42a7b46	55	R()->ResetDigits(); R()->ResetClusters();
543d5224	56
e42a7b46	57	R()->GetLoader()->TreeD()->GetEntry(0);
cbaf35fb	58	for(Int_t iChamber=1;iChamber<=kNCH;iChamber++){//chambers loop
ed3ceb24	59	FindClusters(iChamber);
543d5224	60	}//chambers loop
e42a7b46	61	R()->GetLoader()->TreeR()->Fill(); R()->GetLoader()->WriteRecPoints("OVERWRITE");//write out clusters for current event
543d5224	62	}//events loop
ed3ceb24	63
e42a7b46	64	R()->ResetDigits();//reset and unload everything
	65	R()->ResetClusters();
	66	R()->GetLoader() ->UnloadDigits();
	67	R()->GetLoader() ->UnloadRecPoints();
	68	R()->GetLoader()->GetRunLoader()->UnloadHeader();
	69	R()->GetLoader()->GetRunLoader()->UnloadKinematics();
ed3ceb24	70
89924db8	71	if(GetDebug()) Info("Exec","Stop.");
543d5224	72	}//Exec()
543d5224	73	//__________________________________________________________________________________________________
ed3ceb24	74	void AliRICHClusterFinder::FindClusters(Int_t iChamber)
ed3ceb24	75	{
e42a7b46	76	//Loops on digits for a given chamber, forms raw clusters, then tries to resolve them if requested
	77	Int_t iNdigits=R()->Digits(iChamber)->GetEntriesFast();
	78	if(GetDebug())Info("FindClusters","Start for chamber %i with %i digits.",iChamber,iNdigits);
	79
	80	if(iNdigits==0)return;//no digits for a given chamber, nothing to do
cbaf35fb	81
e42a7b46	82	fDigitMap=new AliRICHMap(R()->Digits(iChamber));//create digit map for the given chamber
cbaf35fb	83
e42a7b46	84	for(Int_t iDigN=0;iDigN<iNdigits;iDigN++){//digits loop for a given chamber
e42a7b46	85	AliRICHdigit dig=(AliRICHdigit)R()->Digits(iChamber)->At(iDigN);
cbaf35fb	86	Int_t i=dig->X(); Int_t j=dig->Y();
e42a7b46	87	if(fDigitMap->TestHit(i,j)==kUsed) continue;//this digit is already taken, go after next digit
cbaf35fb	88
e42a7b46	89	FormRawCluster(i,j);//form raw cluster starting from (i,j) pad
	90	if(GetDebug()) {Info("FindClusters","After FormRawCluster:");fRawCluster.Print();}
	91	FindLocalMaxima(); //find number of local maxima and initial center of gravity
	92	if(GetDebug()) {Info("FindClusters","After FindLocalMaxima:");fRawCluster.Print();}
6865fb8d	93
e42a7b46	94	if(AliRICHParam::IsResolveClusters()&&fRawCluster.Size()>1&&fRawCluster.Size()<6){
	95	FitCoG(); //serialization of resolved clusters will happen inside
	96	}else{//cluster size=1 or resolving is switched off
	97	WriteRawCluster();//simply output the formed raw cluster without deconvolution
ed3ceb24	98	}
e42a7b46	99	fRawCluster.Reset(); fResolvedCluster.Reset();
e42a7b46	100	}//digits loop for a given chamber
cbaf35fb	101
e42a7b46	102	delete fDigitMap;
cbaf35fb	103
e42a7b46	104	if(GetDebug())Info("FindClusters","Stop.");
ed3ceb24	105	}//FindClusters()
ed3ceb24	106	//__________________________________________________________________________________________________
6865fb8d	107	void AliRICHClusterFinder::FindClusterContribs(AliRICHcluster *pCluster)
ed3ceb24	108	{
e42a7b46	109	//Finds cerenkov-feedback-mip mixture for a given cluster
e42a7b46	110	if(GetDebug()) {Info("FindClusterContribs","Start.");pCluster->Print();}
ed3ceb24	111
6865fb8d	112	TObjArray *pDigits = pCluster->Digits();
e42a7b46	113	if(!pDigits) return; //??????????
ed3ceb24	114	Int_t iNmips=0,iNckovs=0,iNfeeds=0;
6865fb8d	115	TArrayI contribs(3*pCluster->Size());
	116	Int_t pindex = new Int_t[3pCluster->Size()];
	117	for(Int_t iDigN=0;iDigN<pCluster->Size();iDigN++) {//loop on digits of a given cluster
e42a7b46	118	contribs[3iDigN] =((AliRICHdigit)pDigits->At(iDigN))->GetTrack(0);
89924db8	119	if (contribs[3iDigN] >= 10000000) contribs[3iDigN] = 0;
e42a7b46	120	contribs[3iDigN+1]=((AliRICHdigit)pDigits->At(iDigN))->GetTrack(1);
89924db8	121	if (contribs[3iDigN+1] >= 10000000) contribs[3iDigN+1] = 0;
e42a7b46	122	contribs[3iDigN+2]=((AliRICHdigit)pDigits->At(iDigN))->GetTrack(2);
89924db8	123	if (contribs[3iDigN+2] >= 10000000) contribs[3iDigN+2] = 0;
ed3ceb24	124	}//loop on digits of a given cluster
ed3ceb24	125	TMath::Sort(contribs.GetSize(),contribs.GetArray(),pindex);
e42a7b46	126	for(Int_t iDigN=0;iDigN<3*pCluster->Size()-1;iDigN++) {//loop on digits to sort tids
e42a7b46	127	if(GetDebug()) Info("FindClusterContribs","%4i for digit n. %4i",contribs[pindex[iDigN]],iDigN);
ed3ceb24	128	if(contribs[pindex[iDigN]]!=contribs[pindex[iDigN+1]]) {
e42a7b46	129	TParticle* particle = R()->GetLoader()->GetRunLoader()->Stack()->Particle(contribs[pindex[iDigN]]);
89924db8	130	Int_t code = particle->GetPdgCode();
89924db8	131	Double_t charge = 0;
e42a7b46	132	if(particle->GetPDG()) charge=particle->GetPDG()->Charge();
e42a7b46	133	if(GetDebug()) Info("FindClusterContribs"," charge of particle %f",charge);
ed3ceb24	134
ed3ceb24	135	if(code==50000050) iNckovs++;
e42a7b46	136	if(code==50000051) iNfeeds++;
e42a7b46	137	if(charge!=0) iNmips++;
ed3ceb24	138	}
ed3ceb24	139	}//loop on digits to sort Tid
e42a7b46	140
	141	if (contribs[pindex[3*pCluster->Size()-1]]!=kBad) {
	142
	143	TParticle* particle = R()->GetLoader()->GetRunLoader()->Stack()->Particle(contribs[pindex[3*pCluster->Size()-1]]);
	144	Int_t code = particle->GetPdgCode();
	145	Double_t charge = 0;
	146	if(particle->GetPDG()) charge=particle->GetPDG()->Charge();
	147	if(GetDebug()) Info("FindClusterContribs"," charge of particle %f",charge);
	148	if(code==50000050) iNckovs++;
	149	if(code==50000051) iNfeeds++;
	150	if(charge!=0) iNmips++;
	151	}
	152
	153	pCluster->CFM(iNckovs,iNfeeds,iNmips);
	154	//
ed3ceb24	155	delete [] pindex;
e42a7b46	156	if(GetDebug()) {pCluster->Print();Info("FindClusterContribs","Stop.");}
3582c1f9	157	}//FindClusterContribs()
cbaf35fb	158	//__________________________________________________________________________________________________
9d6f9427	159	void AliRICHClusterFinder::FormRawCluster(Int_t i, Int_t j)
ed3ceb24	160	{
e42a7b46	161	//Builds the raw cluster (before deconvolution). Starts from the first pad (i,j) then calls itself recursevly for all neighbours.
e42a7b46	162	if(GetDebug()) Info("FormRawCluster","Start with digit(%i,%i) Q=%f",i,j,((AliRICHdigit*)fDigitMap->GetHit(i,j))->Q());
cbaf35fb	163
e42a7b46	164	fRawCluster.AddDigit((AliRICHdigit*) fDigitMap->GetHit(i,j));//take this pad in cluster
e42a7b46	165	fDigitMap->FlagHit(i,j);//flag this pad as taken
cbaf35fb	166
cbaf35fb	167	Int_t listX[4], listY[4]; // Now look recursively for all neighbours
e42a7b46	168	for (Int_t iNei=0;iNei<R()->P()->PadNeighbours(i,j,listX,listY);iNei++)
e42a7b46	169	if(fDigitMap->TestHit(listX[iNei],listY[iNei])==kUnused) FormRawCluster(listX[iNei],listY[iNei]);
3582c1f9	170	}//FormRawCluster()
cbaf35fb	171	//__________________________________________________________________________________________________
e42a7b46	172	void AliRICHClusterFinder::FindLocalMaxima()
	173	{
	174	//find number of local maxima in the current raw cluster and then calculates initial center of gravity
	175	fNlocals=0;
	176	for(Int_t iDig1=0;iDig1<fRawCluster.Size();iDig1++) {
	177	Int_t iNotMax = 0;
	178	AliRICHdigit pDig1 = (AliRICHdigit )fRawCluster.Digits()->At(iDig1);
	179	TVector pad1 = pDig1->Pad();
	180	Int_t padQ1 = (Int_t)(pDig1->Q()+0.1);
	181	Int_t padC1 = pDig1->ChFbMi();
	182	for(Int_t iDig2=0;iDig2<fRawCluster.Size();iDig2++) {
	183	AliRICHdigit pDig2 = (AliRICHdigit )fRawCluster.Digits()->At(iDig2);
	184	TVector pad2 = pDig2->Pad();
	185	Int_t padQ2 = (Int_t)(pDig2->Q()+0.1);
	186	if(iDig1==iDig2) continue;
	187	Int_t diffx = TMath::Sign(Int_t(pad1[0]-pad2[0]),1);
	188	Int_t diffy = TMath::Sign(Int_t(pad1[1]-pad2[1]),1);
	189	if((diffx+diffy)<=1) {
	190	if(padQ2>=padQ1) iNotMax++;
	191	}
	192	}
	193	if(iNotMax==0) {
	194	TVector2 x2=AliRICHParam::Pad2Loc(pad1);
	195	fLocalX[fNlocals]=x2.X();fLocalY[fNlocals]=x2.Y();
	196	fLocalQ[fNlocals] = (Double_t)padQ1;
	197	fLocalC[fNlocals] = padC1;
	198	fNlocals++;
	199	}
	200	}
	201	fRawCluster.CoG(fNlocals); //first initial approximation of the CoG...to start minimization.
	202	}//FindLocalMaxima()
cbaf35fb	203	//__________________________________________________________________________________________________
9d6f9427	204	void AliRICHClusterFinder::WriteRawCluster()
6865fb8d	205	{
e42a7b46	206	//Add the current raw cluster to the list of clusters
89924db8	207	if(GetDebug()) Info("WriteRawCluster","Start.");
cbaf35fb	208
e42a7b46	209	FindClusterContribs(&fRawCluster);
	210	R()->AddCluster(fRawCluster);
	211
	212	if(GetDebug()){fRawCluster.Print(); Info("WriteRawCluster","Stop.");}
cbaf35fb	213	}//WriteRawCluster()
cbaf35fb	214	//__________________________________________________________________________________________________
6865fb8d	215	void AliRICHClusterFinder::WriteResolvedCluster()
6865fb8d	216	{
e42a7b46	217	//Add the current resolved cluster to the list of clusters
89924db8	218	if(GetDebug()) Info("WriteResolvedCluster","Start.");
6865fb8d	219
e42a7b46	220	FindClusterContribs(&fResolvedCluster);
e42a7b46	221	R()->AddCluster(fResolvedCluster);
6865fb8d	222
e42a7b46	223	if(GetDebug()){fResolvedCluster.Print(); Info("WriteResolvedCluster","Stop.");}
6865fb8d	224	}//WriteResolvedCluster()
6865fb8d	225	//__________________________________________________________________________________________________
9d6f9427	226	void AliRICHClusterFinder::FitCoG()
e42a7b46	227	{
	228	//Fits cluster of size by the corresponding number of Mathieson shapes.
	229	//This methode is only invoked in case everything is ok to start deconvolution
	230	if(GetDebug()) {Info("FitCoG","Start with:"); fRawCluster.Print();}
6865fb8d	231
0f72f306	232	Double_t arglist;
0f72f306	233	Int_t ierflag = 0;
6865fb8d	234
6865fb8d	235	TMinuit pMinuit = new TMinuit(3fNlocals-1);
0f72f306	236	pMinuit->mninit(5,10,7);
	237
	238	arglist = -1;
	239	pMinuit->mnexcm("SET PRI",&arglist, 1, ierflag);
19dd5b2f	240	pMinuit->mnexcm("SET NOW",&arglist, 0, ierflag);
9d6f9427	241
9d6f9427	242	TString chname;
	243	Int_t ierflg;
	244
	245	pMinuit->SetObjectFit((TObject*)this);
	246	pMinuit->SetFCN(RICHMinMathieson);
6865fb8d	247
	248	Double_t vstart,lower, upper;
	249	Double_t stepX= 0.001;
	250	Double_t stepY= 0.001;
	251	Double_t stepQ= 0.0001;
	252
	253	for(Int_t i=0;i<fNlocals;i++) {
	254	vstart = fLocalX[i];
	255	lower = vstart - 2*AliRICHParam::PadSizeX();
	256	upper = vstart + 2*AliRICHParam::PadSizeX();
	257	pMinuit->mnparm(3*i ,Form("xCoG %i",i),vstart,stepX,lower,upper,ierflag);
6865fb8d	258	vstart = fLocalY[i];
	259	lower = vstart - 2*AliRICHParam::PadSizeY();
	260	upper = vstart + 2*AliRICHParam::PadSizeY();
	261	pMinuit->mnparm(3*i+1,Form("yCoG %i",i),vstart,stepY,lower,upper,ierflag);
6865fb8d	262	if(i==fNlocals-1) break; // last parameter is constrained
	263	vstart = fLocalQ[i]/fRawCluster.Q();
	264	lower = 0;
	265	upper = 1;
	266	pMinuit->mnparm(3*i+2,Form("qfrac %i",i),vstart,stepQ,lower,upper,ierflag);
6865fb8d	267	}
6865fb8d	268
9d6f9427	269	arglist = -1;
9d6f9427	270	pMinuit->mnexcm("SET NOGR",&arglist, 1, ierflag);
9d6f9427	271	arglist = 1;
	272	pMinuit->mnexcm("SET ERR", &arglist, 1,ierflg);
	273	arglist = -1;
	274	pMinuit->mnexcm("SIMPLEX",&arglist, 0, ierflag);
	275	pMinuit->mnexcm("MIGRAD",&arglist, 0, ierflag);
6865fb8d	276	pMinuit->mnexcm("EXIT" ,&arglist, 0, ierflag);
	277
	278	Double_t xCoG[50],yCoG[50],qfracCoG[50];
9d6f9427	279	Double_t eps, b1, b2;
6865fb8d	280
	281	Double_t qfraclast=0;
	282	for(Int_t i=0;i<fNlocals;i++) {
	283	pMinuit->mnpout(3*i ,chname, xCoG[i], eps , b1, b2, ierflg);
	284	pMinuit->mnpout(3*i+1,chname, yCoG[i], eps , b1, b2, ierflg);
	285	if(i==fNlocals-1) break;
	286	pMinuit->mnpout(3*i+2,chname, qfracCoG[i], eps , b1, b2, ierflg);
	287	qfraclast+=qfracCoG[i];
	288	}
	289	qfracCoG[fNlocals-1] = 1 - qfraclast;
9d6f9427	290	delete pMinuit;
6865fb8d	291
e42a7b46	292	for(Int_t i=0;i<fNlocals;i++){//resolved positions loop
6865fb8d	293	fResolvedCluster.Fill(&fRawCluster,xCoG[i],yCoG[i],qfracCoG[i],fLocalC[i]);
6865fb8d	294	WriteResolvedCluster();
6865fb8d	295	}
e42a7b46	296	if(GetDebug()) Info("CoG","Stop.");
09c52ebc	297	}//FitCoG()
9d6f9427	298	//__________________________________________________________________________________________________
6865fb8d	299	void RICHMinMathieson(Int_t &npar, Double_t , Double_t &chi2, Double_t par, Int_t )
09c52ebc	300	{
e42a7b46	301	//Mathieson minimization function
9d6f9427	302
6865fb8d	303	AliRICHcluster pRawCluster = ((AliRICHClusterFinder)gMinuit->GetObjectFit())->GetRawCluster();
9d6f9427	304
3582c1f9	305	TVector2 centroid[50];
6865fb8d	306	Double_t q[50];
	307	Int_t nFunctions = (npar+1)/3;
	308	Double_t qfract = 0;
	309	for(Int_t i=0;i<nFunctions;i++) {
3582c1f9	310	centroid[i].Set(par[3i],par[3i+1]);
6865fb8d	311	if(i==nFunctions-1) break;
	312	q[i]=par[3*i+2];
	313	qfract+=q[i];
	314	}
	315	q[nFunctions-1] = 1 - qfract;
	316
9d6f9427	317	chi2 = 0;
	318	Int_t qtot = pRawCluster->Q();
	319	for(Int_t i=0;i<pRawCluster->Size();i++) {
e42a7b46	320	TVector pad=((AliRICHdigit *)pRawCluster->Digits()->At(i))->Pad();
9d6f9427	321	Double_t padQ = ((AliRICHdigit *)pRawCluster->Digits()->At(i))->Q();
6865fb8d	322	Double_t qfracpar=0;
6865fb8d	323	for(Int_t j=0;j<nFunctions;j++) {
e42a7b46	324	qfracpar += q[j]*AliRICHParam::FracQdc(centroid[j],pad);
9d6f9427	325	}
6865fb8d	326	chi2 += TMath::Power((qtot*qfracpar-padQ),2)/padQ;
6865fb8d	327	}
9d6f9427	328	}//RICHMinMathieson()
e42a7b46	329	//__________________________________________________________________________________________________