]>
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 | ||
16 | #include "AliHMPIDCluster.h" //class header | |
17 | #include <TMinuit.h> //Solve() | |
18 | #include <TClonesArray.h> //Solve() | |
d1bf51e1 | 19 | #include <TMarker.h> //Draw() |
d3da6dc4 | 20 | ClassImp(AliHMPIDCluster) |
21 | //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ | |
22 | void AliHMPIDCluster::CoG() | |
23 | { | |
24 | // Calculates naive cluster position as a center of gravity of its digits. | |
25 | // Arguments: none | |
d1bf51e1 | 26 | // Returns: none |
e4a3eae8 | 27 | Int_t minPadX=999,minPadY=999,maxPadX=-1,maxPadY=-1; //for box finding |
28 | if(fDigs==0) return; //no digits in this cluster | |
29 | fX=fY=fQRaw=0; //init summable parameters | |
30 | Int_t maxQpad=-1,maxQ=-1; //to calculate the pad with the highest charge | |
d1bf51e1 | 31 | AliHMPIDDigit *pDig; |
e4a3eae8 | 32 | for(Int_t iDig=0;iDig<fDigs->GetEntriesFast();iDig++){ //digits loop |
33 | pDig=(AliHMPIDDigit*)fDigs->At(iDig); //get pointer to next digit | |
34 | ||
35 | if(pDig->PadPcX() > maxPadX) maxPadX = pDig->PadPcX(); // find the minimum box that contain the cluster MaxX | |
36 | if(pDig->PadPcY() > maxPadY) maxPadY = pDig->PadPcY(); // MaxY | |
37 | if(pDig->PadPcX() < minPadX) minPadX = pDig->PadPcX(); // MinX | |
38 | if(pDig->PadPcY() < minPadY) minPadY = pDig->PadPcY(); // MinY | |
39 | ||
40 | Float_t q=pDig->Q(); //get QDC | |
41 | fX += pDig->LorsX()*q;fY +=pDig->LorsY()*q; //add digit center weighted by QDC | |
42 | fQRaw+=q; //increment total charge | |
43 | if(q>maxQ) {maxQpad = pDig->Pad();maxQ=(Int_t)q;} // to find pad with highest charge | |
d3da6dc4 | 44 | }//digits loop |
e4a3eae8 | 45 | |
46 | fBox=(maxPadX-minPadX+1)*100+maxPadY-minPadY+1; // dimension of the box: format Xdim*100+Ydim | |
47 | ||
48 | if ( fQRaw != 0 ) fX/=fQRaw;fY/=fQRaw; //final center of gravity | |
d3da6dc4 | 49 | |
d1bf51e1 | 50 | |
e4a3eae8 | 51 | CorrSin(); //correct it by sinoid |
52 | ||
53 | fQ = fQRaw; // Before starting fit procedure, Q and QRaw must be equal | |
54 | fCh=pDig->Ch(); //initialize chamber number | |
55 | fMaxQpad = maxQpad; fMaxQ=maxQ; //store max charge pad to the field | |
56 | fChi2=0; // no Chi2 to find | |
57 | fNlocMax=0; // no maxima to find | |
d3da6dc4 | 58 | fSt=kCoG; |
59 | }//CoG() | |
60 | //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ | |
61 | void AliHMPIDCluster::CorrSin() | |
62 | { | |
63 | // Correction of cluster x position due to sinoid, see HMPID TDR page 30 | |
64 | // Arguments: none | |
65 | // Returns: none | |
1d4857c5 | 66 | Int_t pc,px,py; |
67 | AliHMPIDDigit::Lors2Pad(fX,fY,pc,px,py); //tmp digit to get it center | |
68 | Float_t x=fX-AliHMPIDDigit::LorsX(pc,px); //diff between cluster x and center of the pad contaning this cluster | |
d3da6dc4 | 69 | 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; |
70 | } | |
71 | //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ | |
d1bf51e1 | 72 | void AliHMPIDCluster::Draw(Option_t*) |
73 | { | |
74 | TMarker *pMark=new TMarker(X(),Y(),5); pMark->SetMarkerColor(kBlue); pMark->Draw(); | |
75 | } | |
76 | //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ | |
d3da6dc4 | 77 | void AliHMPIDCluster::FitFunc(Int_t &iNpars, Double_t *, Double_t &chi2, Double_t *par, Int_t ) |
78 | { | |
79 | // Cluster fit function | |
80 | // par[0]=x par[1]=y par[2]=q for the first Mathieson shape | |
81 | // par[3]=x par[4]=y par[5]=q for the second Mathieson shape and so on up to iNpars/3 Mathieson shapes | |
82 | // For each pad of the cluster calculates the difference between actual pad charge and the charge induced to this pad by all Mathieson distributions | |
83 | // Then the chi2 is calculated as the sum of this value squared for all pad in the cluster. | |
84 | // Arguments: iNpars - number of parameters which is number of local maxima of cluster * 3 | |
85 | // chi2 - function result to be minimised | |
86 | // par - parameters array of size iNpars | |
87 | // Returns: none | |
88 | AliHMPIDCluster *pClu=(AliHMPIDCluster*)gMinuit->GetObjectFit(); | |
89 | Int_t iNshape = iNpars/3; | |
90 | ||
91 | chi2 = 0; | |
e4a3eae8 | 92 | for(Int_t i=0;i<pClu->Size();i++){ //loop on all pads of the cluster |
93 | Double_t dQpadMath = 0; //pad charge collector | |
94 | for(Int_t j=0;j<iNshape;j++){ //Mathiesons loop as all of them may contribute to this pad | |
95 | dQpadMath+=par[3*j+2]*pClu->Dig(i)->Mathieson(par[3*j],par[3*j+1]); // par[3*j+2] is charge par[3*j] is x par[3*j+1] is y of current Mathieson | |
d3da6dc4 | 96 | } |
e4a3eae8 | 97 | if(dQpadMath>0)chi2 +=TMath::Power((pClu->Dig(i)->Q()-dQpadMath),2)/dQpadMath; // |
98 | } //loop on all pads of the cluster | |
d3da6dc4 | 99 | }//FitFunction() |
100 | //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ | |
101 | void AliHMPIDCluster::Print(Option_t* opt)const | |
102 | { | |
103 | //Print current cluster | |
104 | const char *status=0; | |
105 | switch(fSt){ | |
d1bf51e1 | 106 | case kFrm : status="formed " ;break; |
107 | case kUnf : status="unfolded (fit)" ;break; | |
108 | case kCoG : status="coged " ;break; | |
109 | case kLo1 : status="locmax 1 (fit)" ;break; | |
d1bf51e1 | 110 | case kMax : status="exceeded (cog)" ;break; |
111 | case kNot : status="not done (cog)" ;break; | |
112 | case kEmp : status="empty " ;break; | |
113 | case kEdg : status="edge (fit)" ;break; | |
114 | case kSi1 : status="size 1 (cog)" ;break; | |
115 | case kNoLoc: status="no LocMax(fit)" ;break; | |
116 | ||
117 | default: status="??????" ;break; | |
d3da6dc4 | 118 | } |
e4a3eae8 | 119 | Double_t ratio=0; |
120 | if(Q()>0&&QRaw()>0) ratio = Q()/QRaw()*100; | |
1d4857c5 | 121 | 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", |
e4a3eae8 | 122 | opt,X(),Y(),Q(),QRaw(),ratio,Ch(),Size(),fBox,fNlocMax,fChi2,status); |
d1bf51e1 | 123 | if(fDigs) fDigs->Print(); |
d3da6dc4 | 124 | }//Print() |
125 | //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ | |
126 | Int_t AliHMPIDCluster::Solve(TClonesArray *pCluLst,Bool_t isTryUnfold) | |
127 | { | |
128 | //This methode is invoked when the cluster is formed to solve it. Solve the cluster means to try to unfold the cluster | |
129 | //into the local maxima number of clusters. This methode is invoked by AliHMPIDRconstructor::Dig2Clu() on cluster by cluster basis. | |
130 | //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, | |
131 | //status is preset to kFormed in AddDigit(), chamber-sector info is preseted to actual values in AddDigit() | |
132 | //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 | |
133 | //Arguments: pCluLst - cluster list pointer where to add new cluster(s) | |
134 | // isTryUnfold - flag to switch on/off unfolding | |
135 | // Returns: number of local maxima of original cluster | |
d1bf51e1 | 136 | CoG(); |
e4a3eae8 | 137 | Int_t iCluCnt=pCluLst->GetEntriesFast(); //get current number of clusters already stored in the list by previous operations |
138 | if(isTryUnfold==kFALSE || Size()==1) { //if cluster contains single pad there is no way to improve the knowledge | |
d1bf51e1 | 139 | (isTryUnfold)?fSt=kSi1:fSt=kNot; |
140 | new ((*pCluLst)[iCluCnt++]) AliHMPIDCluster(*this); //add this raw cluster | |
141 | return 1; | |
142 | } | |
d3da6dc4 | 143 | //Phase 0. Initialise TMinuit |
e4a3eae8 | 144 | const Int_t kMaxLocMax=6; //max allowed number of loc max for fitting |
145 | TMinuit *pMinuit = new TMinuit(3*kMaxLocMax); //init MINUIT with this number of parameters (3 params per mathieson) | |
146 | pMinuit->SetObjectFit((TObject*)this); pMinuit->SetFCN(AliHMPIDCluster::FitFunc); //set fit function | |
147 | Double_t aArg=-1; Int_t iErrFlg; //tmp vars for TMinuit | |
148 | pMinuit->mnexcm("SET PRI",&aArg,1,iErrFlg); //suspend all printout from TMinuit | |
149 | pMinuit->mnexcm("SET NOW",&aArg,0,iErrFlg); //suspend all warning printout from TMinuit | |
d1bf51e1 | 150 | //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 |
151 | fNlocMax=0; | |
e4a3eae8 | 152 | |
153 | for(Int_t iDig1=0;iDig1<Size();iDig1++) { //first digits loop | |
154 | AliHMPIDDigit *pDig1 = Dig(iDig1); //take next digit | |
d1bf51e1 | 155 | Int_t iHowManyMoreCnt = 0; //counts how many neighbouring pads has QDC more then current one |
156 | for(Int_t iDig2=0;iDig2<Size();iDig2++) { //loop on all digits again | |
157 | if(iDig1==iDig2) continue; //the same digit, no need to compare | |
d3da6dc4 | 158 | AliHMPIDDigit *pDig2 = Dig(iDig2); //take second digit to compare with the first one |
da08475b | 159 | 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 | 160 | if(dist==1) //means dig2 is a neighbour of dig1 |
161 | if(pDig2->Q()>=pDig1->Q()) iHowManyMoreCnt++; //count number of pads with Q more then Q of current pad | |
d3da6dc4 | 162 | }//second digits loop |
e4a3eae8 | 163 | if(iHowManyMoreCnt==0&&fNlocMax<kMaxLocMax){ //this pad has Q more then any neighbour so it's local maximum |
164 | pMinuit->mnparm(3*fNlocMax ,Form("x%i",fNlocMax),pDig1->LorsX(),0.1,0,0,iErrFlg); // X,Y,Q initial values of the loc max pad w | |
165 | pMinuit->mnparm(3*fNlocMax+1,Form("y%i",fNlocMax),pDig1->LorsY(),0.1,0,0,iErrFlg); // | |
166 | pMinuit->mnparm(3*fNlocMax+2,Form("q%i",fNlocMax),pDig1->Q(),0.1,0,100000,iErrFlg);// constrained to be positive | |
d1bf51e1 | 167 | fNlocMax++; |
d3da6dc4 | 168 | }//if this pad is local maximum |
169 | }//first digits loop | |
d1bf51e1 | 170 | |
d3da6dc4 | 171 | //Phase 2. Fit loc max number of Mathiesons or add this current cluster to the list |
e4a3eae8 | 172 | // case 1 -> no loc max found |
173 | if ( fNlocMax == 0) { // case of no local maxima found: pads with same charge... | |
174 | pMinuit->mnparm(3*fNlocMax ,Form("x%i",fNlocMax),fX,0.1,0,0,iErrFlg); // Init values taken from CoG() -> fX,fY,fQRaw | |
175 | pMinuit->mnparm(3*fNlocMax+1,Form("y%i",fNlocMax),fY,0.1,0,0,iErrFlg); // | |
176 | pMinuit->mnparm(3*fNlocMax+2,Form("q%i",fNlocMax),fQRaw,0.1,0,100000,iErrFlg); // | |
d1bf51e1 | 177 | fNlocMax = 1; |
178 | fSt=kNoLoc; | |
179 | } | |
e4a3eae8 | 180 | |
181 | // case 2 -> loc max found. Check # of loc maxima | |
182 | if ( fNlocMax >= kMaxLocMax) // if # of local maxima exceeds kMaxLocMax... | |
d1bf51e1 | 183 | { |
e4a3eae8 | 184 | fSt = kMax; new ((*pCluLst)[iCluCnt++]) AliHMPIDCluster(*this); //...add this raw cluster |
185 | } //or... | |
186 | else{ //...resonable number of local maxima to fit and user requested it | |
187 | Double_t arglist[10];arglist[0] = 10000;arglist[1] = 1.; //number of steps and sigma on pads charges | |
188 | pMinuit->mnexcm("SIMPLEX" ,arglist,2,iErrFlg); //start fitting with Simplex | |
189 | pMinuit->mnexcm("MIGRAD" ,arglist,2,iErrFlg); //fitting improved by Migrad | |
d1bf51e1 | 190 | |
e4a3eae8 | 191 | Double_t dummy; TString sName; //vars to get results from Minuit |
192 | for(Int_t i=0;i<fNlocMax;i++){ //store the local maxima parameters | |
193 | pMinuit->mnpout(3*i ,sName, fX, fErrX , dummy, dummy, iErrFlg); // X | |
194 | pMinuit->mnpout(3*i+1 ,sName, fY, fErrY , dummy, dummy, iErrFlg); // Y | |
195 | pMinuit->mnpout(3*i+2 ,sName, fQ, fErrQ , dummy, dummy, iErrFlg); // Q | |
196 | pMinuit->mnstat(fChi2,dummy,dummy,iErrFlg,iErrFlg,iErrFlg); // Chi2 of the fit | |
d1bf51e1 | 197 | |
e4a3eae8 | 198 | if(fNlocMax!=1)fSt=kUnf; // |
199 | if(fNlocMax==1&&fSt!=kNoLoc) fSt=kLo1; // | |
200 | if ( !IsInPc()) fSt = kEdg; // | |
201 | if(fSt==kNoLoc) fNlocMax=0; // | |
202 | new ((*pCluLst)[iCluCnt++]) AliHMPIDCluster(*this); //add new unfolded cluster | |
203 | } | |
204 | } | |
d1bf51e1 | 205 | |
e4a3eae8 | 206 | delete pMinuit; |
207 | return fNlocMax; | |
208 | ||
d3da6dc4 | 209 | }//Solve() |
210 | //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ |