1 /**************************************************************************
2 * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
4 * Author: The ALICE Off-line Project. *
5 * Contributors are mentioned in the code where appropriate. *
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 **************************************************************************/
17 #include "AliRICHClusterFinder.h"
18 #include "AliRICHMap.h"
20 #include <TParticle.h>
22 #include <AliLoader.h>
26 void RICHMinMathieson(Int_t &npar, Double_t *gin, Double_t &chi2, Double_t *par, Int_t iflag);
28 ClassImp(AliRICHClusterFinder)
29 //__________________________________________________________________________________________________
30 AliRICHClusterFinder::AliRICHClusterFinder(AliRICH *pRICH)
33 AliDebug(1,"main ctor Start.");
37 fResolvedCluster.Reset();
38 AliDebug(1,"main ctor Stop.");
40 //__________________________________________________________________________________________________
41 void AliRICHClusterFinder::Exec()
43 //Main method of cluster finder. Loops on events and chambers, everything else is done in FindClusters()
44 AliDebug(1,"Exec Start.");
46 R()->GetLoader() ->LoadDigits();
47 // R()->GetLoader()->GetRunLoader()->LoadHeader();
48 R()->GetLoader()->GetRunLoader()->LoadKinematics(); //header is already loaded
50 for(Int_t iEventN=0;iEventN<gAlice->GetEventsPerRun();iEventN++){//events loop
51 AliDebug(1,Form("Processing event %i...",iEventN));
52 R()->GetLoader()->GetRunLoader()->GetEvent(iEventN);
54 R()->GetLoader()->MakeTree("R"); R()->MakeBranch("R");
55 R()->ResetDigits(); R()->ResetClusters();
57 R()->GetLoader()->TreeD()->GetEntry(0);
58 for(Int_t iChamber=1;iChamber<=kNchambers;iChamber++){//chambers loop
59 FindClusters(iChamber);
61 R()->GetLoader()->TreeR()->Fill(); R()->GetLoader()->WriteRecPoints("OVERWRITE");//write out clusters for current event
64 R()->ResetDigits();//reset and unload everything
66 R()->GetLoader() ->UnloadDigits();
67 R()->GetLoader() ->UnloadRecPoints();
68 // R()->GetLoader()->GetRunLoader()->UnloadHeader();
69 R()->GetLoader()->GetRunLoader()->UnloadKinematics();
73 //__________________________________________________________________________________________________
74 void AliRICHClusterFinder::FindClusters(Int_t iChamber)
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 AliDebug(1,Form("Start for chamber %i with %i digits.",iChamber,iNdigits));
80 if(iNdigits==0)return;//no digits for a given chamber, nothing to do
82 fDigitMap=new AliRICHMap(R()->Digits(iChamber));//create digit map for the given chamber
84 for(Int_t iDigN=0;iDigN<iNdigits;iDigN++){//digits loop for a given chamber
85 AliRICHdigit *dig=(AliRICHdigit*)R()->Digits(iChamber)->At(iDigN);
86 Int_t i=dig->X(); Int_t j=dig->Y();
87 if(fDigitMap->TestHit(i,j)==kUsed) continue;//this digit is already taken, go after next digit
89 FormRawCluster(i,j);//form raw cluster starting from (i,j) pad
90 AliDebug(1,"After FormRawCluster:");ToAliDebug(1,fRawCluster.Print());
91 FindLocalMaxima(); //find number of local maxima and initial center of gravity
92 AliDebug(1,"After FindLocalMaxima:");ToAliDebug(1,fRawCluster.Print());
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
99 fRawCluster.Reset(); fResolvedCluster.Reset();
100 }//digits loop for a given chamber
106 //__________________________________________________________________________________________________
107 void AliRICHClusterFinder::FindClusterContribs(AliRICHcluster *pCluster)
109 //Finds cerenkov-feedback-mip mixture for a given cluster
110 AliDebug(1,"Start.");ToAliDebug(1,pCluster->Print());
112 R()->GetLoader()->GetRunLoader()->LoadHeader();
113 AliStack *pStack = R()->GetLoader()->GetRunLoader()->Stack();
115 {AliInfo("No Stack found!!! No contrib to cluster found.");return;}
117 TObjArray *pDigits = pCluster->Digits();
118 if(!pDigits) return; //??????????
119 Int_t iNmips=0,iNckovs=0,iNfeeds=0;
120 TArrayI contribs(3*pCluster->Size());
121 Int_t *pindex = new Int_t[3*pCluster->Size()];
122 for(Int_t iDigN=0;iDigN<pCluster->Size();iDigN++) {//loop on digits of a given cluster
123 contribs[3*iDigN] =((AliRICHdigit*)pDigits->At(iDigN))->GetTrack(0);
124 if (contribs[3*iDigN] >= 10000000) contribs[3*iDigN] = 0;
125 contribs[3*iDigN+1]=((AliRICHdigit*)pDigits->At(iDigN))->GetTrack(1);
126 if (contribs[3*iDigN+1] >= 10000000) contribs[3*iDigN+1] = 0;
127 contribs[3*iDigN+2]=((AliRICHdigit*)pDigits->At(iDigN))->GetTrack(2);
128 if (contribs[3*iDigN+2] >= 10000000) contribs[3*iDigN+2] = 0;
129 }//loop on digits of a given cluster
130 TMath::Sort(contribs.GetSize(),contribs.GetArray(),pindex);
131 for(Int_t iDigN=0;iDigN<3*pCluster->Size()-1;iDigN++) {//loop on digits to sort tids
132 AliDebug(1,Form("%4i for digit n. %4i",contribs[pindex[iDigN]],iDigN));
133 if(contribs[pindex[iDigN]]!=contribs[pindex[iDigN+1]]) {
134 TParticle* particle = pStack->Particle(contribs[pindex[iDigN]]);
136 Int_t code = particle->GetPdgCode();
138 if(particle->GetPDG()) charge=particle->GetPDG()->Charge();
139 AliDebug(1,Form(" charge of particle %f",charge));
141 if(code==50000050) iNckovs++;
142 if(code==50000051) iNfeeds++;
143 if(charge!=0) iNmips++;
145 }//loop on digits to sort Tid
147 if (contribs[pindex[3*pCluster->Size()-1]]!=kBad) {
149 TParticle* particle = pStack->Particle(contribs[pindex[3*pCluster->Size()-1]]);
150 Int_t code = particle->GetPdgCode();
152 if(particle->GetPDG()) charge=particle->GetPDG()->Charge();
153 AliDebug(1,Form(" charge of particle %f",charge));
154 if(code==50000050) iNckovs++;
155 if(code==50000051) iNfeeds++;
156 if(charge!=0) iNmips++;
159 pCluster->CFM(iNckovs,iNfeeds,iNmips);
162 ToAliDebug(1,pCluster->Print());
164 }//FindClusterContribs()
165 //__________________________________________________________________________________________________
166 void AliRICHClusterFinder::FormRawCluster(Int_t i, Int_t j)
168 //Builds the raw cluster (before deconvolution). Starts from the first pad (i,j) then calls itself recursevly for all neighbours.
169 AliDebug(1,Form("Start with digit(%i,%i) Q=%f",i,j,((AliRICHdigit*)fDigitMap->GetHit(i,j))->Q()));
171 fRawCluster.AddDigit((AliRICHdigit*) fDigitMap->GetHit(i,j));//take this pad in cluster
172 fDigitMap->FlagHit(i,j);//flag this pad as taken
174 Int_t listX[4], listY[4]; // Now look recursively for all neighbours
175 for (Int_t iNei=0;iNei<R()->P()->PadNeighbours(i,j,listX,listY);iNei++)
176 if(fDigitMap->TestHit(listX[iNei],listY[iNei])==kUnused) FormRawCluster(listX[iNei],listY[iNei]);
178 //__________________________________________________________________________________________________
179 void AliRICHClusterFinder::FindLocalMaxima()
181 //find number of local maxima in the current raw cluster and then calculates initial center of gravity
183 for(Int_t iDig1=0;iDig1<fRawCluster.Size();iDig1++) {
185 AliRICHdigit *pDig1 = (AliRICHdigit *)fRawCluster.Digits()->At(iDig1);
186 TVector pad1 = pDig1->Pad();
187 Int_t padQ1 = (Int_t)(pDig1->Q()+0.1);
188 Int_t padC1 = pDig1->ChFbMi();
189 for(Int_t iDig2=0;iDig2<fRawCluster.Size();iDig2++) {
190 AliRICHdigit *pDig2 = (AliRICHdigit *)fRawCluster.Digits()->At(iDig2);
191 TVector pad2 = pDig2->Pad();
192 Int_t padQ2 = (Int_t)(pDig2->Q()+0.1);
193 if(iDig1==iDig2) continue;
194 Int_t diffx = TMath::Sign(Int_t(pad1[0]-pad2[0]),1);
195 Int_t diffy = TMath::Sign(Int_t(pad1[1]-pad2[1]),1);
196 if((diffx+diffy)<=1) {
197 if(padQ2>=padQ1) iNotMax++;
201 TVector2 x2=AliRICHParam::Pad2Loc(pad1);
202 fLocalX[fNlocals]=x2.X();fLocalY[fNlocals]=x2.Y();
203 fLocalQ[fNlocals] = (Double_t)padQ1;
204 fLocalC[fNlocals] = padC1;
208 fRawCluster.CoG(fNlocals); //first initial approximation of the CoG...to start minimization.
210 //__________________________________________________________________________________________________
211 void AliRICHClusterFinder::WriteRawCluster()
213 //Add the current raw cluster to the list of clusters
214 AliDebug(1,"Start.");
216 FindClusterContribs(&fRawCluster);
217 R()->AddCluster(fRawCluster);
219 ToAliDebug(1,fRawCluster.Print()); AliDebug(1,"Stop.");
221 //__________________________________________________________________________________________________
222 void AliRICHClusterFinder::WriteResolvedCluster()
224 //Add the current resolved cluster to the list of clusters
225 AliDebug(1,"Start.");
227 FindClusterContribs(&fResolvedCluster);
228 R()->AddCluster(fResolvedCluster);
230 ToAliDebug(1,fResolvedCluster.Print()); AliDebug(1,"Stop.");
231 }//WriteResolvedCluster()
232 //__________________________________________________________________________________________________
233 void AliRICHClusterFinder::FitCoG()
235 //Fits cluster of size by the corresponding number of Mathieson shapes.
236 //This methode is only invoked in case everything is ok to start deconvolution
237 AliDebug(1,"Start with:"); ToAliDebug(1,fRawCluster.Print());
242 TMinuit *pMinuit = new TMinuit(3*fNlocals-1);
243 pMinuit->mninit(5,10,7);
246 pMinuit->mnexcm("SET PRI",&arglist, 1, ierflag);
247 pMinuit->mnexcm("SET NOW",&arglist, 0, ierflag);
252 pMinuit->SetObjectFit((TObject*)this);
253 pMinuit->SetFCN(RICHMinMathieson);
255 Double_t vstart,lower, upper;
256 Double_t stepX= 0.001;
257 Double_t stepY= 0.001;
258 Double_t stepQ= 0.0001;
260 for(Int_t i=0;i<fNlocals;i++) {
262 lower = vstart - 2*AliRICHParam::PadSizeX();
263 upper = vstart + 2*AliRICHParam::PadSizeX();
264 pMinuit->mnparm(3*i ,Form("xCoG %i",i),vstart,stepX,lower,upper,ierflag);
266 lower = vstart - 2*AliRICHParam::PadSizeY();
267 upper = vstart + 2*AliRICHParam::PadSizeY();
268 pMinuit->mnparm(3*i+1,Form("yCoG %i",i),vstart,stepY,lower,upper,ierflag);
269 if(i==fNlocals-1) break; // last parameter is constrained
270 vstart = fLocalQ[i]/fRawCluster.Q();
273 pMinuit->mnparm(3*i+2,Form("qfrac %i",i),vstart,stepQ,lower,upper,ierflag);
277 pMinuit->mnexcm("SET NOGR",&arglist, 1, ierflag);
279 pMinuit->mnexcm("SET ERR", &arglist, 1,ierflg);
281 pMinuit->mnexcm("SIMPLEX",&arglist, 0, ierflag);
282 pMinuit->mnexcm("MIGRAD",&arglist, 0, ierflag);
283 pMinuit->mnexcm("EXIT" ,&arglist, 0, ierflag);
285 Double_t xCoG[50],yCoG[50],qfracCoG[50];
286 Double_t eps, b1, b2;
288 Double_t qfraclast=0;
289 for(Int_t i=0;i<fNlocals;i++) {
290 pMinuit->mnpout(3*i ,chname, xCoG[i], eps , b1, b2, ierflg);
291 pMinuit->mnpout(3*i+1,chname, yCoG[i], eps , b1, b2, ierflg);
292 if(i==fNlocals-1) break;
293 pMinuit->mnpout(3*i+2,chname, qfracCoG[i], eps , b1, b2, ierflg);
294 qfraclast+=qfracCoG[i];
296 qfracCoG[fNlocals-1] = 1 - qfraclast;
299 for(Int_t i=0;i<fNlocals;i++){//resolved positions loop
300 fResolvedCluster.Fill(&fRawCluster,xCoG[i],yCoG[i],qfracCoG[i],fLocalC[i]);
301 WriteResolvedCluster();
305 //__________________________________________________________________________________________________
306 void RICHMinMathieson(Int_t &npar, Double_t *, Double_t &chi2, Double_t *par, Int_t )
308 //Mathieson minimization function
310 AliRICHcluster *pRawCluster = ((AliRICHClusterFinder*)gMinuit->GetObjectFit())->GetRawCluster();
312 TVector2 centroid[50];
314 Int_t nFunctions = (npar+1)/3;
316 for(Int_t i=0;i<nFunctions;i++) {
317 centroid[i].Set(par[3*i],par[3*i+1]);
318 if(i==nFunctions-1) break;
322 q[nFunctions-1] = 1 - qfract;
325 Int_t qtot = pRawCluster->Q();
326 for(Int_t i=0;i<pRawCluster->Size();i++) {
327 TVector pad=((AliRICHdigit *)pRawCluster->Digits()->At(i))->Pad();
328 Double_t padQ = ((AliRICHdigit *)pRawCluster->Digits()->At(i))->Q();
330 for(Int_t j=0;j<nFunctions;j++) {
331 qfracpar += q[j]*AliRICHParam::FracQdc(centroid[j],pad);
333 chi2 += TMath::Power((qtot*qfracpar-padQ),2)/padQ;
335 }//RICHMinMathieson()
336 //__________________________________________________________________________________________________