]>
Commit | Line | Data |
---|---|---|
d3da6dc4 | 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 | ||
76fd1a96 | 16 | #include <TVirtualFitter.h> //Solve() |
d3da6dc4 | 17 | #include <TMinuit.h> //Solve() |
18 | #include <TClonesArray.h> //Solve() | |
d1bf51e1 | 19 | #include <TMarker.h> //Draw() |
27311693 | 20 | |
76fd1a96 | 21 | #include "AliLog.h" //FitFunc() |
22 | ||
23 | #include "AliHMPIDCluster.h" //class header | |
24 | ||
69ed32de | 25 | Bool_t AliHMPIDCluster::fgDoCorrSin=kTRUE; |
27311693 | 26 | |
d3da6dc4 | 27 | ClassImp(AliHMPIDCluster) |
76fd1a96 | 28 | |
d3da6dc4 | 29 | //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ |
30 | void AliHMPIDCluster::CoG() | |
31 | { | |
32 | // Calculates naive cluster position as a center of gravity of its digits. | |
33 | // Arguments: none | |
d1bf51e1 | 34 | // Returns: none |
e4a3eae8 | 35 | Int_t minPadX=999,minPadY=999,maxPadX=-1,maxPadY=-1; //for box finding |
36 | if(fDigs==0) return; //no digits in this cluster | |
37 | fX=fY=fQRaw=0; //init summable parameters | |
38 | Int_t maxQpad=-1,maxQ=-1; //to calculate the pad with the highest charge | |
aa85549f | 39 | AliHMPIDDigit *pDig=0x0; |
e4a3eae8 | 40 | for(Int_t iDig=0;iDig<fDigs->GetEntriesFast();iDig++){ //digits loop |
41 | pDig=(AliHMPIDDigit*)fDigs->At(iDig); //get pointer to next digit | |
42 | ||
43 | if(pDig->PadPcX() > maxPadX) maxPadX = pDig->PadPcX(); // find the minimum box that contain the cluster MaxX | |
44 | if(pDig->PadPcY() > maxPadY) maxPadY = pDig->PadPcY(); // MaxY | |
45 | if(pDig->PadPcX() < minPadX) minPadX = pDig->PadPcX(); // MinX | |
46 | if(pDig->PadPcY() < minPadY) minPadY = pDig->PadPcY(); // MinY | |
47 | ||
48 | Float_t q=pDig->Q(); //get QDC | |
49 | fX += pDig->LorsX()*q;fY +=pDig->LorsY()*q; //add digit center weighted by QDC | |
50 | fQRaw+=q; //increment total charge | |
51 | if(q>maxQ) {maxQpad = pDig->Pad();maxQ=(Int_t)q;} // to find pad with highest charge | |
d3da6dc4 | 52 | }//digits loop |
e4a3eae8 | 53 | |
54 | fBox=(maxPadX-minPadX+1)*100+maxPadY-minPadY+1; // dimension of the box: format Xdim*100+Ydim | |
55 | ||
56 | if ( fQRaw != 0 ) fX/=fQRaw;fY/=fQRaw; //final center of gravity | |
27311693 | 57 | |
69ed32de | 58 | if(fDigs->GetEntriesFast()>1&&fgDoCorrSin)CorrSin(); //correct it by sinoid |
e4a3eae8 | 59 | |
c5c19d6a | 60 | fQ = fQRaw; // Before starting fit procedure, Q and QRaw must be equal |
61 | fCh=pDig->Ch(); //initialize chamber number | |
62 | fMaxQpad = maxQpad; fMaxQ=maxQ; //store max charge pad to the field | |
63 | fChi2=0; // no Chi2 to find | |
64 | fNlocMax=0; // proper status from this method | |
d3da6dc4 | 65 | fSt=kCoG; |
66 | }//CoG() | |
67 | //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ | |
68 | void AliHMPIDCluster::CorrSin() | |
69 | { | |
70 | // Correction of cluster x position due to sinoid, see HMPID TDR page 30 | |
71 | // Arguments: none | |
72 | // Returns: none | |
1d4857c5 | 73 | Int_t pc,px,py; |
ae5a42aa | 74 | AliHMPIDParam::Lors2Pad(fX,fY,pc,px,py); //tmp digit to get it center |
75 | Float_t x=fX-AliHMPIDParam::LorsX(pc,px); //diff between cluster x and center of the pad contaning this cluster | |
d3da6dc4 | 76 | fX+=3.31267e-2*TMath::Sin(2*TMath::Pi()/0.8*x)-2.66575e-3*TMath::Sin(4*TMath::Pi()/0.8*x)+2.80553e-3*TMath::Sin(6*TMath::Pi()/0.8*x)+0.0070; |
77 | } | |
78 | //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ | |
d1bf51e1 | 79 | void AliHMPIDCluster::Draw(Option_t*) |
80 | { | |
a1d55ff3 | 81 | TMarker *pMark=new TMarker(X(),Y(),5); pMark->SetUniqueID(fSt);pMark->SetMarkerColor(kBlue); pMark->Draw(); |
d1bf51e1 | 82 | } |
83 | //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ | |
557ca324 | 84 | void AliHMPIDCluster::FitFunc(Int_t &iNpars, Double_t* deriv, Double_t &chi2, Double_t *par, Int_t iflag) |
d3da6dc4 | 85 | { |
86 | // Cluster fit function | |
87 | // par[0]=x par[1]=y par[2]=q for the first Mathieson shape | |
88 | // par[3]=x par[4]=y par[5]=q for the second Mathieson shape and so on up to iNpars/3 Mathieson shapes | |
76fd1a96 | 89 | // For each pad of the cluster calculates the difference between actual pad charge and the charge induced to this pad by all Mathieson distributions |
d3da6dc4 | 90 | // Then the chi2 is calculated as the sum of this value squared for all pad in the cluster. |
91 | // Arguments: iNpars - number of parameters which is number of local maxima of cluster * 3 | |
92 | // chi2 - function result to be minimised | |
93 | // par - parameters array of size iNpars | |
94 | // Returns: none | |
76fd1a96 | 95 | |
96 | AliHMPIDCluster *pClu=(AliHMPIDCluster*)TVirtualFitter::GetFitter()->GetObjectFit(); | |
97 | ||
98 | Int_t nPads = pClu->Size(); | |
76fd1a96 | 99 | |
d3da6dc4 | 100 | chi2 = 0; |
76fd1a96 | 101 | |
102 | Int_t iNshape = iNpars/3; | |
103 | ||
76fd1a96 | 104 | for(Int_t i=0;i<nPads;i++){ //loop on all pads of the cluster |
105 | Double_t dQpadMath = 0; | |
106 | for(Int_t j=0;j<iNshape;j++){ //Mathiesons loop as all of them may contribute to this pad | |
107 | Double_t fracMathi = pClu->Dig(i)->IntMathieson(par[3*j],par[3*j+1]); | |
108 | dQpadMath+=par[3*j+2]*fracMathi; // par[3*j+2] is charge par[3*j] is x par[3*j+1] is y of current Mathieson | |
76fd1a96 | 109 | } |
110 | if(dQpadMath>0 && pClu->Dig(i)->Q()>0) { | |
111 | chi2 +=TMath::Power((pClu->Dig(i)->Q()-dQpadMath),2)/pClu->Dig(i)->Q(); //chi2 function to be minimized | |
112 | } | |
113 | } | |
557ca324 | 114 | //---calculate gradients... |
115 | if(iflag==2) { | |
116 | Double_t **derivPart; | |
117 | ||
118 | derivPart = new Double_t*[iNpars]; | |
119 | ||
120 | for(Int_t j=0;j<iNpars;j++){ | |
121 | deriv[j] = 0; | |
122 | derivPart[j] = new Double_t[nPads]; | |
123 | for(Int_t i=0;i<nPads;i++){ | |
124 | derivPart[j][i] = 0; | |
125 | } | |
126 | } | |
127 | ||
128 | for(Int_t i=0;i<nPads;i++){ //loop on all pads of the cluster | |
129 | for(Int_t j=0;j<iNshape;j++){ //Mathiesons loop as all of them may contribute to this pad | |
130 | Double_t fracMathi = pClu->Dig(i)->IntMathieson(par[3*j],par[3*j+1]); | |
131 | derivPart[3*j ][i] += par[3*j+2]*(pClu->Dig(i)->Mathieson(par[3*j]-pClu->Dig(i)->LorsX()-0.5*AliHMPIDParam::SizePadX())- | |
132 | pClu->Dig(i)->Mathieson(par[3*j]-pClu->Dig(i)->LorsX()+0.5*AliHMPIDParam::SizePadX()))* | |
133 | pClu->Dig(i)->IntPartMathi(par[3*j+1],2); | |
134 | derivPart[3*j+1][i] += par[3*j+2]*(pClu->Dig(i)->Mathieson(par[3*j+1]-pClu->Dig(i)->LorsY()-0.5*AliHMPIDParam::SizePadY())- | |
135 | pClu->Dig(i)->Mathieson(par[3*j+1]-pClu->Dig(i)->LorsY()+0.5*AliHMPIDParam::SizePadY()))* | |
136 | pClu->Dig(i)->IntPartMathi(par[3*j],1); | |
137 | derivPart[3*j+2][i] += fracMathi; | |
138 | } | |
139 | } | |
140 | //loop on all pads of the cluster | |
141 | for(Int_t i=0;i<nPads;i++){ //loop on all pads of the cluster | |
142 | Double_t dQpadMath = 0; //pad charge collector | |
143 | for(Int_t j=0;j<iNshape;j++){ //Mathiesons loop as all of them may contribute to this pad | |
144 | Double_t fracMathi = pClu->Dig(i)->IntMathieson(par[3*j],par[3*j+1]); | |
145 | dQpadMath+=par[3*j+2]*fracMathi; | |
146 | if(dQpadMath>0 && pClu->Dig(i)->Q()>0) { | |
147 | deriv[3*j] += 2/pClu->Dig(i)->Q()*(pClu->Dig(i)->Q()-dQpadMath)*derivPart[3*j ][i]; | |
148 | deriv[3*j+1] += 2/pClu->Dig(i)->Q()*(pClu->Dig(i)->Q()-dQpadMath)*derivPart[3*j+1][i]; | |
149 | deriv[3*j+2] += 2/pClu->Dig(i)->Q()*(pClu->Dig(i)->Q()-dQpadMath)*derivPart[3*j+2][i]; | |
150 | } | |
76fd1a96 | 151 | } |
d3da6dc4 | 152 | } |
557ca324 | 153 | //delete array... |
154 | for(Int_t i=0;i<iNpars;i++) delete [] derivPart[i]; delete [] derivPart; | |
76fd1a96 | 155 | } |
557ca324 | 156 | //---gradient calculations ended |
76fd1a96 | 157 | |
d3da6dc4 | 158 | }//FitFunction() |
159 | //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ | |
160 | void AliHMPIDCluster::Print(Option_t* opt)const | |
161 | { | |
162 | //Print current cluster | |
163 | const char *status=0; | |
164 | switch(fSt){ | |
d1bf51e1 | 165 | case kFrm : status="formed " ;break; |
166 | case kUnf : status="unfolded (fit)" ;break; | |
167 | case kCoG : status="coged " ;break; | |
168 | case kLo1 : status="locmax 1 (fit)" ;break; | |
d1bf51e1 | 169 | case kMax : status="exceeded (cog)" ;break; |
170 | case kNot : status="not done (cog)" ;break; | |
171 | case kEmp : status="empty " ;break; | |
172 | case kEdg : status="edge (fit)" ;break; | |
173 | case kSi1 : status="size 1 (cog)" ;break; | |
174 | case kNoLoc: status="no LocMax(fit)" ;break; | |
c5c19d6a | 175 | case kAbn : status="Abnormal fit " ;break; |
d1bf51e1 | 176 | |
177 | default: status="??????" ;break; | |
d3da6dc4 | 178 | } |
e4a3eae8 | 179 | Double_t ratio=0; |
180 | if(Q()>0&&QRaw()>0) ratio = Q()/QRaw()*100; | |
1d4857c5 | 181 | Printf("%sCLU: ch=%i (%7.3f,%7.3f) Q=%8.3f Qraw=%8.3f(%3.0f%%) Size=%2i DimBox=%i LocMax=%i Chi2=%7.3f %s", |
1006986d | 182 | opt,Ch(),X(),Y(),Q(),QRaw(),ratio,Size(),fBox,fNlocMax,fChi2,status); |
d1bf51e1 | 183 | if(fDigs) fDigs->Print(); |
d3da6dc4 | 184 | }//Print() |
185 | //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ | |
186 | Int_t AliHMPIDCluster::Solve(TClonesArray *pCluLst,Bool_t isTryUnfold) | |
187 | { | |
188 | //This methode is invoked when the cluster is formed to solve it. Solve the cluster means to try to unfold the cluster | |
189 | //into the local maxima number of clusters. This methode is invoked by AliHMPIDRconstructor::Dig2Clu() on cluster by cluster basis. | |
190 | //At this point, cluster contains a list of digits, cluster charge and size is precalculated in AddDigit(), position is preset to (-1,-1) in ctor, | |
191 | //status is preset to kFormed in AddDigit(), chamber-sector info is preseted to actual values in AddDigit() | |
192 | //Method first finds number of local maxima and if it's more then one tries to unfold this cluster into local maxima number of clusters | |
193 | //Arguments: pCluLst - cluster list pointer where to add new cluster(s) | |
194 | // isTryUnfold - flag to switch on/off unfolding | |
195 | // Returns: number of local maxima of original cluster | |
76fd1a96 | 196 | const Int_t kMaxLocMax=6; //max allowed number of loc max for fitting |
197 | // | |
198 | CoG(); //First calculate CoG for the given cluster | |
e4a3eae8 | 199 | Int_t iCluCnt=pCluLst->GetEntriesFast(); //get current number of clusters already stored in the list by previous operations |
200 | if(isTryUnfold==kFALSE || Size()==1) { //if cluster contains single pad there is no way to improve the knowledge | |
d1bf51e1 | 201 | (isTryUnfold)?fSt=kSi1:fSt=kNot; |
202 | new ((*pCluLst)[iCluCnt++]) AliHMPIDCluster(*this); //add this raw cluster | |
203 | return 1; | |
204 | } | |
76fd1a96 | 205 | |
206 | //Phase 0. Initialise Fitter | |
207 | Double_t arglist[10]; | |
208 | Int_t ierflg = 0; | |
209 | TVirtualFitter *fitter = TVirtualFitter::Fitter(this,3*6); //initialize Fitter | |
210 | ||
211 | arglist[0] = -1; | |
212 | ierflg = fitter->ExecuteCommand("SET PRI", arglist, 1); // no printout | |
213 | ierflg = fitter->ExecuteCommand("SET NOW", arglist, 0); //no warning messages | |
214 | arglist[0] = 1; | |
215 | ierflg = fitter->ExecuteCommand("SET GRA", arglist, 1); //force Fitter to use my gradient | |
216 | ||
217 | fitter->SetFCN(AliHMPIDCluster::FitFunc); | |
218 | ||
219 | // arglist[0] = 1; | |
220 | // ierflg = fitter->ExecuteCommand("SET ERR", arglist ,1); | |
221 | ||
222 | // Set starting values and step sizes for parameters | |
223 | ||
d1bf51e1 | 224 | //Phase 1. Find number of local maxima. Strategy is to check if the current pad has QDC more then all neigbours. Also find the box contaning the cluster |
225 | fNlocMax=0; | |
e4a3eae8 | 226 | |
76fd1a96 | 227 | for(Int_t iDig1=0;iDig1<Size();iDig1++) { //first digits loop |
228 | ||
e4a3eae8 | 229 | AliHMPIDDigit *pDig1 = Dig(iDig1); //take next digit |
c5c19d6a | 230 | Int_t iCnt = 0; //counts how many neighbouring pads has QDC more then current one |
76fd1a96 | 231 | |
d1bf51e1 | 232 | for(Int_t iDig2=0;iDig2<Size();iDig2++) { //loop on all digits again |
76fd1a96 | 233 | |
d1bf51e1 | 234 | if(iDig1==iDig2) continue; //the same digit, no need to compare |
d3da6dc4 | 235 | AliHMPIDDigit *pDig2 = Dig(iDig2); //take second digit to compare with the first one |
da08475b | 236 | Int_t dist = TMath::Sign(Int_t(pDig1->PadChX()-pDig2->PadChX()),1)+TMath::Sign(Int_t(pDig1->PadChY()-pDig2->PadChY()),1);//distance between pads |
d1bf51e1 | 237 | if(dist==1) //means dig2 is a neighbour of dig1 |
c5c19d6a | 238 | if(pDig2->Q()>=pDig1->Q()) iCnt++; //count number of pads with Q more then Q of current pad |
76fd1a96 | 239 | |
d3da6dc4 | 240 | }//second digits loop |
76fd1a96 | 241 | |
c5c19d6a | 242 | if(iCnt==0&&fNlocMax<kMaxLocMax){ //this pad has Q more then any neighbour so it's local maximum |
76fd1a96 | 243 | |
c5c19d6a | 244 | Double_t xStart=pDig1->LorsX();Double_t yStart=pDig1->LorsY(); |
ae5a42aa | 245 | Double_t xMin=xStart-AliHMPIDParam::SizePadX(); |
246 | Double_t xMax=xStart+AliHMPIDParam::SizePadX(); | |
247 | Double_t yMin=yStart-AliHMPIDParam::SizePadY(); | |
248 | Double_t yMax=yStart+AliHMPIDParam::SizePadY(); | |
76fd1a96 | 249 | |
250 | ierflg = fitter->SetParameter(3*fNlocMax ,Form("x%i",fNlocMax),xStart,0.1,xMin,xMax); // X,Y,Q initial values of the loc max pad | |
251 | ierflg = fitter->SetParameter(3*fNlocMax+1,Form("y%i",fNlocMax),yStart,0.1,yMin,yMax); // X, Y constrained to be near the loc max | |
252 | ierflg = fitter->SetParameter(3*fNlocMax+2,Form("q%i",fNlocMax),pDig1->Q(),0.1,0,100000); // Q constrained to be positive | |
253 | ||
d1bf51e1 | 254 | fNlocMax++; |
76fd1a96 | 255 | |
d3da6dc4 | 256 | }//if this pad is local maximum |
257 | }//first digits loop | |
d1bf51e1 | 258 | |
d3da6dc4 | 259 | //Phase 2. Fit loc max number of Mathiesons or add this current cluster to the list |
e4a3eae8 | 260 | // case 1 -> no loc max found |
76fd1a96 | 261 | if ( fNlocMax == 0) { // case of no local maxima found: pads with same charge... |
262 | ||
263 | ierflg = fitter->SetParameter(3*fNlocMax ,Form("x%i",fNlocMax),fX,0.1,0,0); // Init values taken from CoG() -> fX,fY,fQRaw | |
264 | ierflg = fitter->SetParameter(3*fNlocMax+1,Form("y%i",fNlocMax),fY,0.1,0,0); // | |
265 | ierflg = fitter->SetParameter(3*fNlocMax+2,Form("q%i",fNlocMax),fQRaw,0.1,0,100000); // | |
266 | ||
d1bf51e1 | 267 | fNlocMax = 1; |
268 | fSt=kNoLoc; | |
269 | } | |
e4a3eae8 | 270 | |
271 | // case 2 -> loc max found. Check # of loc maxima | |
76fd1a96 | 272 | if ( fNlocMax >= kMaxLocMax) { // if # of local maxima exceeds kMaxLocMax... |
273 | fSt = kMax; new ((*pCluLst)[iCluCnt++]) AliHMPIDCluster(*this); //...add this raw cluster | |
274 | } else { //or resonable number of local maxima to fit and user requested it | |
275 | // Now ready for minimization step | |
276 | arglist[0] = 500; //number of steps and sigma on pads charges | |
277 | arglist[1] = 1.; // | |
278 | ||
279 | ierflg = fitter->ExecuteCommand("SIMPLEX",arglist,2); //start fitting with Simplex | |
280 | if (!ierflg) | |
281 | fitter->ExecuteCommand("MIGRAD" ,arglist,2); //fitting improved by Migrad | |
282 | if(ierflg) { | |
c5c19d6a | 283 | Double_t strategy=2; |
76fd1a96 | 284 | ierflg = fitter->ExecuteCommand("SET STR",&strategy,1); //change level of strategy |
285 | if(!ierflg) { | |
286 | ierflg = fitter->ExecuteCommand("SIMPLEX",arglist,2); //start fitting with Simplex | |
287 | if (!ierflg) | |
288 | fitter->ExecuteCommand("MIGRAD" ,arglist,2); //fitting improved by Migrad | |
c5c19d6a | 289 | } |
290 | } | |
76fd1a96 | 291 | if(ierflg) fSt=kAbn; //no convergence of the fit... |
292 | Double_t dummy; char sName[80]; //vars to get results from Minuit | |
293 | Double_t edm, errdef; | |
294 | Int_t nvpar, nparx; | |
295 | ||
e4a3eae8 | 296 | for(Int_t i=0;i<fNlocMax;i++){ //store the local maxima parameters |
76fd1a96 | 297 | fitter->GetParameter(3*i ,sName, fX, fErrX , dummy, dummy); // X |
298 | fitter->GetParameter(3*i+1 ,sName, fY, fErrY , dummy, dummy); // Y | |
299 | fitter->GetParameter(3*i+2 ,sName, fQ, fErrQ , dummy, dummy); // Q | |
300 | fitter->GetStats(fChi2, edm, errdef, nvpar, nparx); //get fit infos | |
c5c19d6a | 301 | if(fSt!=kAbn) { |
76fd1a96 | 302 | if(fNlocMax!=1)fSt=kUnf; // if unfolded |
303 | if(fNlocMax==1&&fSt!=kNoLoc) fSt=kLo1; // if only 1 loc max | |
304 | if ( !IsInPc()) fSt = kEdg; // if Out of Pc | |
305 | if(fSt==kNoLoc) fNlocMax=0; // if with no loc max (pads with same charge..) | |
c5c19d6a | 306 | } |
e4a3eae8 | 307 | new ((*pCluLst)[iCluCnt++]) AliHMPIDCluster(*this); //add new unfolded cluster |
308 | } | |
309 | } | |
d1bf51e1 | 310 | |
e4a3eae8 | 311 | return fNlocMax; |
312 | ||
d3da6dc4 | 313 | }//Solve() |
314 | //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ |