]>
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 | |
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> |
781ec278 | 25 | #include "AliRICHParam.h" |
8265fa96 | 26 | |
9d6f9427 | 27 | void RICHMinMathieson(Int_t &npar, Double_t *gin, Double_t &chi2, Double_t *par, Int_t iflag); |
8265fa96 | 28 | |
29 | ClassImp(AliRICHClusterFinder) | |
543d5224 | 30 | //__________________________________________________________________________________________________ |
0fe8fa07 | 31 | AliRICHClusterFinder::AliRICHClusterFinder(AliRunLoader *pRunLoader) |
543d5224 | 32 | {//main ctor |
0fe8fa07 | 33 | fRICH = (AliRICH*) pRunLoader->GetAliRun()->GetDetector("RICH"); |
34 | ||
998b831f | 35 | AliDebug(1,"main ctor Start."); |
543d5224 | 36 | |
e42a7b46 | 37 | fDigitMap = 0; |
6865fb8d | 38 | fRawCluster.Reset(); |
39 | fResolvedCluster.Reset(); | |
998b831f | 40 | AliDebug(1,"main ctor Stop."); |
543d5224 | 41 | }//main ctor |
42 | //__________________________________________________________________________________________________ | |
d3eb6079 | 43 | void AliRICHClusterFinder::Exec(const Option_t *) |
237c933d | 44 | { |
e42a7b46 | 45 | //Main method of cluster finder. Loops on events and chambers, everything else is done in FindClusters() |
998b831f | 46 | AliDebug(1,"Exec Start."); |
e42a7b46 | 47 | |
48 | R()->GetLoader() ->LoadDigits(); | |
998b831f | 49 | // R()->GetLoader()->GetRunLoader()->LoadHeader(); |
d3eb6079 | 50 | if(!R()->GetLoader()->GetRunLoader()->TreeK()) R()->GetLoader()->GetRunLoader()->LoadKinematics(); |
ed3ceb24 | 51 | |
543d5224 | 52 | for(Int_t iEventN=0;iEventN<gAlice->GetEventsPerRun();iEventN++){//events loop |
998b831f | 53 | AliDebug(1,Form("Processing event %i...",iEventN)); |
e42a7b46 | 54 | R()->GetLoader()->GetRunLoader()->GetEvent(iEventN); |
237c933d | 55 | |
e42a7b46 | 56 | R()->GetLoader()->MakeTree("R"); R()->MakeBranch("R"); |
f770edb5 | 57 | R()->DigitsReset(); R()->ClustersReset(); |
543d5224 | 58 | |
e42a7b46 | 59 | R()->GetLoader()->TreeD()->GetEntry(0); |
998b831f | 60 | for(Int_t iChamber=1;iChamber<=kNchambers;iChamber++){//chambers loop |
ed3ceb24 | 61 | FindClusters(iChamber); |
543d5224 | 62 | }//chambers loop |
e42a7b46 | 63 | R()->GetLoader()->TreeR()->Fill(); R()->GetLoader()->WriteRecPoints("OVERWRITE");//write out clusters for current event |
543d5224 | 64 | }//events loop |
ed3ceb24 | 65 | |
f770edb5 | 66 | R()->DigitsReset();//reset and unload everything |
0fe8fa07 | 67 | R()->ClustersReset(); |
e42a7b46 | 68 | R()->GetLoader() ->UnloadDigits(); |
69 | R()->GetLoader() ->UnloadRecPoints(); | |
998b831f | 70 | // R()->GetLoader()->GetRunLoader()->UnloadHeader(); |
e42a7b46 | 71 | R()->GetLoader()->GetRunLoader()->UnloadKinematics(); |
ed3ceb24 | 72 | |
998b831f | 73 | AliDebug(1,"Stop."); |
543d5224 | 74 | }//Exec() |
75 | //__________________________________________________________________________________________________ | |
ed3ceb24 | 76 | void AliRICHClusterFinder::FindClusters(Int_t iChamber) |
77 | { | |
e42a7b46 | 78 | //Loops on digits for a given chamber, forms raw clusters, then tries to resolve them if requested |
79 | Int_t iNdigits=R()->Digits(iChamber)->GetEntriesFast(); | |
998b831f | 80 | AliDebug(1,Form("Start for chamber %i with %i digits.",iChamber,iNdigits)); |
e42a7b46 | 81 | |
82 | if(iNdigits==0)return;//no digits for a given chamber, nothing to do | |
cbaf35fb | 83 | |
e42a7b46 | 84 | fDigitMap=new AliRICHMap(R()->Digits(iChamber));//create digit map for the given chamber |
cbaf35fb | 85 | |
e42a7b46 | 86 | for(Int_t iDigN=0;iDigN<iNdigits;iDigN++){//digits loop for a given chamber |
0fe8fa07 | 87 | AliRICHDigit *dig=(AliRICHDigit*)R()->Digits(iChamber)->At(iDigN); |
0422a446 | 88 | Int_t i=dig->PadX(); Int_t j=dig->PadY(); |
e42a7b46 | 89 | if(fDigitMap->TestHit(i,j)==kUsed) continue;//this digit is already taken, go after next digit |
cbaf35fb | 90 | |
e42a7b46 | 91 | FormRawCluster(i,j);//form raw cluster starting from (i,j) pad |
998b831f | 92 | AliDebug(1,"After FormRawCluster:");ToAliDebug(1,fRawCluster.Print()); |
e42a7b46 | 93 | FindLocalMaxima(); //find number of local maxima and initial center of gravity |
998b831f | 94 | AliDebug(1,"After FindLocalMaxima:");ToAliDebug(1,fRawCluster.Print()); |
6865fb8d | 95 | |
77bc1a05 | 96 | if(AliRICHParam::IsResolveClusters()&&fNlocals<=6&&fRawCluster.Size()>1){ |
e42a7b46 | 97 | FitCoG(); //serialization of resolved clusters will happen inside |
98 | }else{//cluster size=1 or resolving is switched off | |
99 | WriteRawCluster();//simply output the formed raw cluster without deconvolution | |
ed3ceb24 | 100 | } |
e42a7b46 | 101 | fRawCluster.Reset(); fResolvedCluster.Reset(); |
102 | }//digits loop for a given chamber | |
cbaf35fb | 103 | |
e42a7b46 | 104 | delete fDigitMap; |
cbaf35fb | 105 | |
998b831f | 106 | AliDebug(1,"Stop."); |
ed3ceb24 | 107 | }//FindClusters() |
108 | //__________________________________________________________________________________________________ | |
0fe8fa07 | 109 | void AliRICHClusterFinder::FindClusterContribs(AliRICHCluster *pCluster) |
ed3ceb24 | 110 | { |
e42a7b46 | 111 | //Finds cerenkov-feedback-mip mixture for a given cluster |
998b831f | 112 | AliDebug(1,"Start.");ToAliDebug(1,pCluster->Print()); |
e0b2e10c | 113 | |
781ec278 | 114 | // R()->GetLoader()->GetRunLoader()->LoadHeader(); //...message from AliRunLoader...hopefully will disappear in future... |
115 | // sometimes no stack found if the above line is commented out!! | |
e0b2e10c | 116 | AliStack *pStack = R()->GetLoader()->GetRunLoader()->Stack(); |
117 | if(!pStack) | |
118 | {AliInfo("No Stack found!!! No contrib to cluster found.");return;} | |
ed3ceb24 | 119 | |
6865fb8d | 120 | TObjArray *pDigits = pCluster->Digits(); |
e42a7b46 | 121 | if(!pDigits) return; //?????????? |
ed3ceb24 | 122 | Int_t iNmips=0,iNckovs=0,iNfeeds=0; |
6865fb8d | 123 | TArrayI contribs(3*pCluster->Size()); |
124 | Int_t *pindex = new Int_t[3*pCluster->Size()]; | |
125 | for(Int_t iDigN=0;iDigN<pCluster->Size();iDigN++) {//loop on digits of a given cluster | |
0fe8fa07 | 126 | contribs[3*iDigN] =((AliRICHDigit*)pDigits->At(iDigN))->GetTrack(0); |
89924db8 | 127 | if (contribs[3*iDigN] >= 10000000) contribs[3*iDigN] = 0; |
0fe8fa07 | 128 | contribs[3*iDigN+1]=((AliRICHDigit*)pDigits->At(iDigN))->GetTrack(1); |
89924db8 | 129 | if (contribs[3*iDigN+1] >= 10000000) contribs[3*iDigN+1] = 0; |
0fe8fa07 | 130 | contribs[3*iDigN+2]=((AliRICHDigit*)pDigits->At(iDigN))->GetTrack(2); |
89924db8 | 131 | if (contribs[3*iDigN+2] >= 10000000) contribs[3*iDigN+2] = 0; |
ed3ceb24 | 132 | }//loop on digits of a given cluster |
133 | TMath::Sort(contribs.GetSize(),contribs.GetArray(),pindex); | |
e42a7b46 | 134 | for(Int_t iDigN=0;iDigN<3*pCluster->Size()-1;iDigN++) {//loop on digits to sort tids |
998b831f | 135 | AliDebug(1,Form("%4i for digit n. %4i",contribs[pindex[iDigN]],iDigN)); |
ed3ceb24 | 136 | if(contribs[pindex[iDigN]]!=contribs[pindex[iDigN+1]]) { |
08999534 | 137 | Int_t thecontrib = contribs[pindex[iDigN]]; |
138 | if (thecontrib>=pStack->GetNtrack()) continue;//PH this should not happen | |
139 | TParticle* particle = pStack->Particle(thecontrib); | |
140 | if (!particle) continue;//PH this should not happen | |
89924db8 | 141 | Int_t code = particle->GetPdgCode(); |
142 | Double_t charge = 0; | |
e42a7b46 | 143 | if(particle->GetPDG()) charge=particle->GetPDG()->Charge(); |
998b831f | 144 | AliDebug(1,Form(" charge of particle %f",charge)); |
ed3ceb24 | 145 | |
146 | if(code==50000050) iNckovs++; | |
e42a7b46 | 147 | if(code==50000051) iNfeeds++; |
148 | if(charge!=0) iNmips++; | |
ed3ceb24 | 149 | } |
150 | }//loop on digits to sort Tid | |
e42a7b46 | 151 | |
0fe8fa07 | 152 | if (contribs[pindex[3*pCluster->Size()-1]]!=-1) { |
38c1fcd3 | 153 | Int_t thecontrib = contribs[pindex[3*pCluster->Size()-1]]; |
154 | if (thecontrib<pStack->GetNtrack()){ | |
155 | //PH the opposite should not happen | |
e42a7b46 | 156 | |
38c1fcd3 | 157 | TParticle* particle = pStack->Particle(thecontrib); |
158 | if (particle) { | |
159 | //PH the opposite should not happen | |
160 | Int_t code = particle->GetPdgCode(); | |
161 | Double_t charge = 0; | |
162 | if(particle->GetPDG()) charge=particle->GetPDG()->Charge(); | |
163 | AliDebug(1,Form(" charge of particle %f",charge)); | |
164 | if(code==50000050) iNckovs++; | |
165 | if(code==50000051) iNfeeds++; | |
166 | if(charge!=0) iNmips++; | |
167 | } | |
168 | } | |
e42a7b46 | 169 | } |
170 | ||
171 | pCluster->CFM(iNckovs,iNfeeds,iNmips); | |
172 | // | |
ed3ceb24 | 173 | delete [] pindex; |
998b831f | 174 | ToAliDebug(1,pCluster->Print()); |
175 | AliDebug(1,"Stop."); | |
3582c1f9 | 176 | }//FindClusterContribs() |
cbaf35fb | 177 | //__________________________________________________________________________________________________ |
9d6f9427 | 178 | void AliRICHClusterFinder::FormRawCluster(Int_t i, Int_t j) |
ed3ceb24 | 179 | { |
e42a7b46 | 180 | //Builds the raw cluster (before deconvolution). Starts from the first pad (i,j) then calls itself recursevly for all neighbours. |
0422a446 | 181 | AliDebug(1,Form("Start with digit(%i,%i) Q=%f",i,j,((AliRICHDigit*)fDigitMap->GetHit(i,j))->Qdc())); |
cbaf35fb | 182 | |
0fe8fa07 | 183 | fRawCluster.AddDigit((AliRICHDigit*) fDigitMap->GetHit(i,j));//take this pad in cluster |
e42a7b46 | 184 | fDigitMap->FlagHit(i,j);//flag this pad as taken |
cbaf35fb | 185 | |
186 | Int_t listX[4], listY[4]; // Now look recursively for all neighbours | |
e42a7b46 | 187 | for (Int_t iNei=0;iNei<R()->P()->PadNeighbours(i,j,listX,listY);iNei++) |
188 | if(fDigitMap->TestHit(listX[iNei],listY[iNei])==kUnused) FormRawCluster(listX[iNei],listY[iNei]); | |
3582c1f9 | 189 | }//FormRawCluster() |
cbaf35fb | 190 | //__________________________________________________________________________________________________ |
e42a7b46 | 191 | void AliRICHClusterFinder::FindLocalMaxima() |
192 | { | |
193 | //find number of local maxima in the current raw cluster and then calculates initial center of gravity | |
194 | fNlocals=0; | |
781ec278 | 195 | AliDebug(1,Form("Cluster size of the Raw cluster ---> %i",fRawCluster.Size())); |
e42a7b46 | 196 | for(Int_t iDig1=0;iDig1<fRawCluster.Size();iDig1++) { |
197 | Int_t iNotMax = 0; | |
0fe8fa07 | 198 | AliRICHDigit *pDig1 = (AliRICHDigit *)fRawCluster.Digits()->At(iDig1); |
781ec278 | 199 | if(!pDig1) {fNlocals=0;return;} |
e42a7b46 | 200 | TVector pad1 = pDig1->Pad(); |
0422a446 | 201 | Int_t padQ1 = (Int_t)(pDig1->Qdc()+0.1); |
202 | Int_t padC1 = pDig1->Cfm(); | |
e42a7b46 | 203 | for(Int_t iDig2=0;iDig2<fRawCluster.Size();iDig2++) { |
0fe8fa07 | 204 | AliRICHDigit *pDig2 = (AliRICHDigit *)fRawCluster.Digits()->At(iDig2); |
781ec278 | 205 | if(!pDig2) {fNlocals=0;return;} |
e42a7b46 | 206 | TVector pad2 = pDig2->Pad(); |
0422a446 | 207 | Int_t padQ2 = (Int_t)(pDig2->Qdc()+0.1); |
e42a7b46 | 208 | if(iDig1==iDig2) continue; |
209 | Int_t diffx = TMath::Sign(Int_t(pad1[0]-pad2[0]),1); | |
210 | Int_t diffy = TMath::Sign(Int_t(pad1[1]-pad2[1]),1); | |
211 | if((diffx+diffy)<=1) { | |
212 | if(padQ2>=padQ1) iNotMax++; | |
213 | } | |
214 | } | |
215 | if(iNotMax==0) { | |
8a3161ee | 216 | if (fNlocals<100) { |
217 | TVector2 x2=AliRICHParam::Pad2Loc(pad1); | |
218 | fLocalX[fNlocals]=x2.X();fLocalY[fNlocals]=x2.Y(); | |
219 | fLocalQ[fNlocals] = (Double_t)padQ1; | |
220 | fLocalC[fNlocals] = padC1; | |
221 | fNlocals++; | |
222 | } | |
e42a7b46 | 223 | } |
224 | } | |
781ec278 | 225 | AliDebug(1,Form("Number of local maxima found ---> %i",fNlocals)); |
e42a7b46 | 226 | fRawCluster.CoG(fNlocals); //first initial approximation of the CoG...to start minimization. |
227 | }//FindLocalMaxima() | |
cbaf35fb | 228 | //__________________________________________________________________________________________________ |
9d6f9427 | 229 | void AliRICHClusterFinder::WriteRawCluster() |
6865fb8d | 230 | { |
e42a7b46 | 231 | //Add the current raw cluster to the list of clusters |
998b831f | 232 | AliDebug(1,"Start."); |
cbaf35fb | 233 | |
e42a7b46 | 234 | FindClusterContribs(&fRawCluster); |
0fe8fa07 | 235 | R()->ClusterAdd(fRawCluster); |
e42a7b46 | 236 | |
998b831f | 237 | ToAliDebug(1,fRawCluster.Print()); AliDebug(1,"Stop."); |
cbaf35fb | 238 | }//WriteRawCluster() |
239 | //__________________________________________________________________________________________________ | |
6865fb8d | 240 | void AliRICHClusterFinder::WriteResolvedCluster() |
241 | { | |
e42a7b46 | 242 | //Add the current resolved cluster to the list of clusters |
998b831f | 243 | AliDebug(1,"Start."); |
6865fb8d | 244 | |
781ec278 | 245 | FindClusterContribs(&fResolvedCluster); |
0fe8fa07 | 246 | R()->ClusterAdd(fResolvedCluster); |
6865fb8d | 247 | |
998b831f | 248 | ToAliDebug(1,fResolvedCluster.Print()); AliDebug(1,"Stop."); |
6865fb8d | 249 | }//WriteResolvedCluster() |
250 | //__________________________________________________________________________________________________ | |
9d6f9427 | 251 | void AliRICHClusterFinder::FitCoG() |
e42a7b46 | 252 | { |
253 | //Fits cluster of size by the corresponding number of Mathieson shapes. | |
254 | //This methode is only invoked in case everything is ok to start deconvolution | |
998b831f | 255 | AliDebug(1,"Start with:"); ToAliDebug(1,fRawCluster.Print()); |
6865fb8d | 256 | |
0f72f306 | 257 | Double_t arglist; |
258 | Int_t ierflag = 0; | |
6865fb8d | 259 | |
781ec278 | 260 | AliDebug(1,Form("MINUIT Started with %i parameters and %i local maxima",3*fNlocals-1,fNlocals)); |
261 | ||
262 | // TMinuit *pMinuit = new TMinuit(3*fNlocals-1); | |
263 | TMinuit *pMinuit = new TMinuit(100); | |
0f72f306 | 264 | pMinuit->mninit(5,10,7); |
265 | ||
266 | arglist = -1; | |
267 | pMinuit->mnexcm("SET PRI",&arglist, 1, ierflag); | |
19dd5b2f | 268 | pMinuit->mnexcm("SET NOW",&arglist, 0, ierflag); |
9d6f9427 | 269 | |
9d6f9427 | 270 | TString chname; |
271 | Int_t ierflg; | |
272 | ||
273 | pMinuit->SetObjectFit((TObject*)this); | |
274 | pMinuit->SetFCN(RICHMinMathieson); | |
6865fb8d | 275 | |
276 | Double_t vstart,lower, upper; | |
77bc1a05 | 277 | Double_t stepX= 0.01; |
278 | Double_t stepY= 0.01; | |
279 | Double_t stepQ= 0.01; | |
6865fb8d | 280 | |
281 | for(Int_t i=0;i<fNlocals;i++) { | |
781ec278 | 282 | AliDebug(1,Form(" local minimum n. %i with Xstart %f and Ystart %f",i,fLocalX[i],fLocalY[i])); |
6865fb8d | 283 | vstart = fLocalX[i]; |
284 | lower = vstart - 2*AliRICHParam::PadSizeX(); | |
285 | upper = vstart + 2*AliRICHParam::PadSizeX(); | |
286 | pMinuit->mnparm(3*i ,Form("xCoG %i",i),vstart,stepX,lower,upper,ierflag); | |
781ec278 | 287 | AliDebug(1,Form("xCoG %i vstart %f lower %f upper %f ",i,vstart,lower,upper)); |
288 | ||
6865fb8d | 289 | vstart = fLocalY[i]; |
290 | lower = vstart - 2*AliRICHParam::PadSizeY(); | |
291 | upper = vstart + 2*AliRICHParam::PadSizeY(); | |
292 | pMinuit->mnparm(3*i+1,Form("yCoG %i",i),vstart,stepY,lower,upper,ierflag); | |
781ec278 | 293 | AliDebug(1,Form("yCoG %i vstart %f lower %f upper %f ",i,vstart,lower,upper)); |
6865fb8d | 294 | if(i==fNlocals-1) break; // last parameter is constrained |
295 | vstart = fLocalQ[i]/fRawCluster.Q(); | |
296 | lower = 0; | |
297 | upper = 1; | |
298 | pMinuit->mnparm(3*i+2,Form("qfrac %i",i),vstart,stepQ,lower,upper,ierflag); | |
781ec278 | 299 | AliDebug(1,Form("qfrac %i vstart %f lower %f upper %f ",i,vstart,lower,upper)); |
6865fb8d | 300 | } |
301 | ||
0422a446 | 302 | arglist = -1; pMinuit->mnexcm("SET NOGR",&arglist, 1,ierflag); |
303 | arglist = 1; pMinuit->mnexcm("SET ERR" ,&arglist, 1,ierflg); | |
304 | arglist = -1; pMinuit->mnexcm("SIMPLEX" ,&arglist, 0,ierflag); | |
9d6f9427 | 305 | pMinuit->mnexcm("MIGRAD",&arglist, 0, ierflag); |
781ec278 | 306 | // pMinuit->mnexcm("EXIT" ,&arglist, 0, ierflag); |
307 | ||
6865fb8d | 308 | Double_t xCoG[50],yCoG[50],qfracCoG[50]; |
9d6f9427 | 309 | Double_t eps, b1, b2; |
6865fb8d | 310 | |
311 | Double_t qfraclast=0; | |
312 | for(Int_t i=0;i<fNlocals;i++) { | |
313 | pMinuit->mnpout(3*i ,chname, xCoG[i], eps , b1, b2, ierflg); | |
314 | pMinuit->mnpout(3*i+1,chname, yCoG[i], eps , b1, b2, ierflg); | |
315 | if(i==fNlocals-1) break; | |
316 | pMinuit->mnpout(3*i+2,chname, qfracCoG[i], eps , b1, b2, ierflg); | |
317 | qfraclast+=qfracCoG[i]; | |
318 | } | |
319 | qfracCoG[fNlocals-1] = 1 - qfraclast; | |
781ec278 | 320 | |
9d6f9427 | 321 | delete pMinuit; |
6865fb8d | 322 | |
e42a7b46 | 323 | for(Int_t i=0;i<fNlocals;i++){//resolved positions loop |
6865fb8d | 324 | fResolvedCluster.Fill(&fRawCluster,xCoG[i],yCoG[i],qfracCoG[i],fLocalC[i]); |
6865fb8d | 325 | WriteResolvedCluster(); |
326 | } | |
781ec278 | 327 | |
328 | ||
998b831f | 329 | AliDebug(1,"Stop."); |
781ec278 | 330 | |
09c52ebc | 331 | }//FitCoG() |
9d6f9427 | 332 | //__________________________________________________________________________________________________ |
6865fb8d | 333 | void RICHMinMathieson(Int_t &npar, Double_t *, Double_t &chi2, Double_t *par, Int_t ) |
09c52ebc | 334 | { |
e42a7b46 | 335 | //Mathieson minimization function |
9d6f9427 | 336 | |
0fe8fa07 | 337 | AliRICHCluster *pRawCluster = ((AliRICHClusterFinder*)gMinuit->GetObjectFit())->GetRawCluster(); |
9d6f9427 | 338 | |
3582c1f9 | 339 | TVector2 centroid[50]; |
6865fb8d | 340 | Double_t q[50]; |
341 | Int_t nFunctions = (npar+1)/3; | |
342 | Double_t qfract = 0; | |
343 | for(Int_t i=0;i<nFunctions;i++) { | |
3582c1f9 | 344 | centroid[i].Set(par[3*i],par[3*i+1]); |
6865fb8d | 345 | if(i==nFunctions-1) break; |
346 | q[i]=par[3*i+2]; | |
347 | qfract+=q[i]; | |
348 | } | |
349 | q[nFunctions-1] = 1 - qfract; | |
350 | ||
9d6f9427 | 351 | chi2 = 0; |
352 | Int_t qtot = pRawCluster->Q(); | |
353 | for(Int_t i=0;i<pRawCluster->Size();i++) { | |
0fe8fa07 | 354 | TVector pad=((AliRICHDigit *)pRawCluster->Digits()->At(i))->Pad(); |
0422a446 | 355 | Double_t padQ = ((AliRICHDigit *)pRawCluster->Digits()->At(i))->Qdc(); |
6865fb8d | 356 | Double_t qfracpar=0; |
357 | for(Int_t j=0;j<nFunctions;j++) { | |
e42a7b46 | 358 | qfracpar += q[j]*AliRICHParam::FracQdc(centroid[j],pad); |
9d6f9427 | 359 | } |
6865fb8d | 360 | chi2 += TMath::Power((qtot*qfracpar-padQ),2)/padQ; |
6865fb8d | 361 | } |
9d6f9427 | 362 | }//RICHMinMathieson() |
e42a7b46 | 363 | //__________________________________________________________________________________________________ |