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 **************************************************************************/
18 #include "AliMUONClusterFinderVS.h"
19 #include "AliMUONDigit.h"
20 #include "AliMUONRawCluster.h"
21 #include "AliSegmentation.h"
22 #include "AliMUONResponse.h"
23 #include "AliMUONClusterInput.h"
24 #include "AliMUONHitMapA1.h"
33 #include <TPostScript.h>
38 #include <Riostream.h>
40 //_____________________________________________________________________
41 // This function is minimized in the double-Mathieson fit
42 void fcnS2(Int_t &npar, Double_t *gin, Double_t &f, Double_t *par, Int_t iflag);
43 void fcnS1(Int_t &npar, Double_t *gin, Double_t &f, Double_t *par, Int_t iflag);
44 void fcnCombiS1(Int_t &npar, Double_t *gin, Double_t &f, Double_t *par, Int_t iflag);
45 void fcnCombiS2(Int_t &npar, Double_t *gin, Double_t &f, Double_t *par, Int_t iflag);
47 ClassImp(AliMUONClusterFinderVS)
49 AliMUONClusterFinderVS::AliMUONClusterFinderVS()
51 // Default constructor
52 fInput=AliMUONClusterInput::Instance();
55 fTrack[0]=fTrack[1]=-1;
56 fDebugLevel = 0; // make silent default
57 fGhostChi2Cut = 1e6; // nothing done by default
60 for(Int_t i=0; i<100; i++) {
61 for (Int_t j=0; j<2; j++) {
67 AliMUONClusterFinderVS::AliMUONClusterFinderVS(const AliMUONClusterFinderVS & clusterFinder):TObject(clusterFinder)
69 // Dummy copy Constructor
73 void AliMUONClusterFinderVS::Decluster(AliMUONRawCluster *cluster)
75 // Decluster by local maxima
76 SplitByLocalMaxima(cluster);
79 void AliMUONClusterFinderVS::SplitByLocalMaxima(AliMUONRawCluster *c)
81 // Split complex cluster by local maxima
84 fInput->SetCluster(c);
86 fMul[0]=c->fMultiplicity[0];
87 fMul[1]=c->fMultiplicity[1];
90 // dump digit information into arrays
95 for (cath=0; cath<2; cath++) {
97 for (i=0; i<fMul[cath]; i++)
100 fDig[i][cath]=fInput->Digit(cath, c->fIndexMap[i][cath]);
102 fIx[i][cath]= fDig[i][cath]->PadX();
103 fIy[i][cath]= fDig[i][cath]->PadY();
105 fQ[i][cath] = fDig[i][cath]->Signal();
106 // pad centre coordinates
108 GetPadC(fIx[i][cath], fIy[i][cath], fX[i][cath], fY[i][cath], fZ[i][cath]);
109 } // loop over cluster digits
110 } // loop over cathodes
116 // Initialise and perform mathieson fits
117 Float_t chi2, oldchi2;
118 // ++++++++++++++++++*************+++++++++++++++++++++
119 // (1) No more than one local maximum per cathode plane
120 // +++++++++++++++++++++++++++++++*************++++++++
121 if ((fNLocal[0]==1 && (fNLocal[1]==0 || fNLocal[1]==1)) ||
122 (fNLocal[0]==0 && fNLocal[1]==1)) {
123 // Perform combined single Mathieson fit
124 // Initial values for coordinates (x,y)
126 // One local maximum on cathodes 1 and 2 (X->cathode 2, Y->cathode 1)
127 if (fNLocal[0]==1 && fNLocal[1]==1) {
130 // One local maximum on cathode 1 (X,Y->cathode 1)
131 } else if (fNLocal[0]==1) {
134 // One local maximum on cathode 2 (X,Y->cathode 2)
140 fprintf(stderr,"\n cas (1) CombiSingleMathiesonFit(c)\n");
141 chi2=CombiSingleMathiesonFit(c);
142 // Int_t ndf = fgNbins[0]+fgNbins[1]-2;
143 // Float_t prob = TMath::Prob(Double_t(chi2),ndf);
144 // prob1->Fill(prob);
145 // chi2_1->Fill(chi2);
148 fprintf(stderr," chi2 %f ",chi2);
158 c->fX[0]=fSeg[0]->GetAnod(c->fX[0]);
159 c->fX[1]=fSeg[1]->GetAnod(c->fX[1]);
161 // If reasonable chi^2 add result to the list of rawclusters
164 // If not try combined double Mathieson Fit
166 fprintf(stderr," MAUVAIS CHI2 !!!\n");
167 if (fNLocal[0]==1 && fNLocal[1]==1) {
168 fXInit[0]=fX[fIndLocal[0][1]][1];
169 fYInit[0]=fY[fIndLocal[0][0]][0];
170 fXInit[1]=fX[fIndLocal[0][1]][1];
171 fYInit[1]=fY[fIndLocal[0][0]][0];
172 } else if (fNLocal[0]==1) {
173 fXInit[0]=fX[fIndLocal[0][0]][0];
174 fYInit[0]=fY[fIndLocal[0][0]][0];
175 fXInit[1]=fX[fIndLocal[0][0]][0];
176 fYInit[1]=fY[fIndLocal[0][0]][0];
178 fXInit[0]=fX[fIndLocal[0][1]][1];
179 fYInit[0]=fY[fIndLocal[0][1]][1];
180 fXInit[1]=fX[fIndLocal[0][1]][1];
181 fYInit[1]=fY[fIndLocal[0][1]][1];
184 // Initial value for charge ratios
188 fprintf(stderr,"\n cas (1) CombiDoubleMathiesonFit(c)\n");
189 chi2=CombiDoubleMathiesonFit(c);
190 // Int_t ndf = fgNbins[0]+fgNbins[1]-6;
191 // Float_t prob = TMath::Prob(chi2,ndf);
192 // prob2->Fill(prob);
193 // chi2_2->Fill(chi2);
195 // Was this any better ??
196 fprintf(stderr," Old and new chi2 %f %f ", oldchi2, chi2);
197 if (fFitStat!=0 && chi2>0 && (2.*chi2 < oldchi2)) {
198 fprintf(stderr," Split\n");
199 // Split cluster into two according to fit result
202 fprintf(stderr," Don't Split\n");
208 // +++++++++++++++++++++++++++++++++++++++
209 // (2) Two local maxima per cathode plane
210 // +++++++++++++++++++++++++++++++++++++++
211 } else if (fNLocal[0]==2 && fNLocal[1]==2) {
213 // Let's look for ghosts first
215 Float_t xm[4][2], ym[4][2];
216 Float_t dpx, dpy, dx, dy;
217 Int_t ixm[4][2], iym[4][2];
218 Int_t isec, im1, im2, ico;
220 // Form the 2x2 combinations
221 // 0-0, 0-1, 1-0, 1-1
223 for (im1=0; im1<2; im1++) {
224 for (im2=0; im2<2; im2++) {
225 xm[ico][0]=fX[fIndLocal[im1][0]][0];
226 ym[ico][0]=fY[fIndLocal[im1][0]][0];
227 xm[ico][1]=fX[fIndLocal[im2][1]][1];
228 ym[ico][1]=fY[fIndLocal[im2][1]][1];
230 ixm[ico][0]=fIx[fIndLocal[im1][0]][0];
231 iym[ico][0]=fIy[fIndLocal[im1][0]][0];
232 ixm[ico][1]=fIx[fIndLocal[im2][1]][1];
233 iym[ico][1]=fIy[fIndLocal[im2][1]][1];
237 // ico = 0 : first local maximum on cathodes 1 and 2
238 // ico = 1 : fisrt local maximum on cathode 1 and second on cathode 2
239 // ico = 2 : second local maximum on cathode 1 and first on cathode 1
240 // ico = 3 : second local maximum on cathodes 1 and 2
242 // Analyse the combinations and keep those that are possible !
243 // For each combination check consistency in x and y
246 Float_t dr[4] = {1.e4, 1.e4, 1.e4, 1.e4};
249 // In case of staggering maxima are displaced by exactly half the pad-size in y.
250 // We have to take into account the numerical precision in the consistency check;
253 for (ico=0; ico<4; ico++) {
254 accepted[ico]=kFALSE;
255 // cathode one: x-coordinate
256 isec=fSeg[0]->Sector(ixm[ico][0], iym[ico][0]);
257 dpx=fSeg[0]->Dpx(isec)/2.;
258 dx=TMath::Abs(xm[ico][0]-xm[ico][1]);
259 // cathode two: y-coordinate
260 isec=fSeg[1]->Sector(ixm[ico][1], iym[ico][1]);
261 dpy=fSeg[1]->Dpy(isec)/2.;
262 dy=TMath::Abs(ym[ico][0]-ym[ico][1]);
264 printf("\n %i %f %f %f %f %f %f \n", ico, ym[ico][0], ym[ico][1], dy, dpy, dx, dpx );
265 if ((dx <= dpx) && (dy <= dpy+eps)) {
268 dr[ico] = TMath::Sqrt(dx*dx+dy*dy);
272 accepted[ico]=kFALSE;
275 printf("\n iacc= %d:\n", iacc);
277 if (accepted[0] && accepted[1]) {
278 if (dr[0] >= dr[1]) {
285 if (accepted[2] && accepted[3]) {
286 if (dr[2] >= dr[3]) {
293 // eliminate one candidate
297 for (ico=0; ico<4; ico++) {
298 if (accepted[ico] && dr[ico] > drmax) {
304 accepted[icobad] = kFALSE;
310 printf("\n iacc= %d:\n", iacc);
313 fprintf(stderr,"\n iacc=2: No problem ! \n");
314 } else if (iacc==4) {
315 fprintf(stderr,"\n iacc=4: Ok, but ghost problem !!! \n");
316 } else if (iacc==0) {
317 fprintf(stderr,"\n iacc=0: I don't know what to do with this !!!!!!!!! \n");
321 // Initial value for charge ratios
322 fQrInit[0]=Float_t(fQ[fIndLocal[0][0]][0])/
323 Float_t(fQ[fIndLocal[0][0]][0]+fQ[fIndLocal[1][0]][0]);
324 fQrInit[1]=Float_t(fQ[fIndLocal[0][1]][1])/
325 Float_t(fQ[fIndLocal[0][1]][1]+fQ[fIndLocal[1][1]][1]);
327 // ******* iacc = 0 *******
328 // No combinations found between the 2 cathodes
329 // We keep the center of gravity of the cluster
334 // ******* iacc = 1 *******
335 // Only one combination found between the 2 cathodes
337 // Initial values for the 2 maxima (x,y)
339 // 1 maximum is initialised with the maximum of the combination found (X->cathode 2, Y->cathode 1)
340 // 1 maximum is initialised with the other maximum of the first cathode
342 fprintf(stderr,"ico=0\n");
347 } else if (accepted[1]){
348 fprintf(stderr,"ico=1\n");
353 } else if (accepted[2]){
354 fprintf(stderr,"ico=2\n");
359 } else if (accepted[3]){
360 fprintf(stderr,"ico=3\n");
367 fprintf(stderr,"\n cas (2) CombiDoubleMathiesonFit(c)\n");
368 chi2=CombiDoubleMathiesonFit(c);
369 // Int_t ndf = fgNbins[0]+fgNbins[1]-6;
370 // Float_t prob = TMath::Prob(chi2,ndf);
371 // prob2->Fill(prob);
372 // chi2_2->Fill(chi2);
374 fprintf(stderr," chi2 %f\n",chi2);
376 // If reasonable chi^2 add result to the list of rawclusters
381 // 1 maximum is initialised with the maximum of the combination found (X->cathode 2, Y->cathode 1)
382 // 1 maximum is initialised with the other maximum of the second cathode
384 fprintf(stderr,"ico=0\n");
389 } else if (accepted[1]){
390 fprintf(stderr,"ico=1\n");
395 } else if (accepted[2]){
396 fprintf(stderr,"ico=2\n");
401 } else if (accepted[3]){
402 fprintf(stderr,"ico=3\n");
409 fprintf(stderr,"\n cas (2) CombiDoubleMathiesonFit(c)\n");
410 chi2=CombiDoubleMathiesonFit(c);
411 // Int_t ndf = fgNbins[0]+fgNbins[1]-6;
412 // Float_t prob = TMath::Prob(chi2,ndf);
413 // prob2->Fill(prob);
414 // chi2_2->Fill(chi2);
416 fprintf(stderr," chi2 %f\n",chi2);
418 // If reasonable chi^2 add result to the list of rawclusters
422 //We keep only the combination found (X->cathode 2, Y->cathode 1)
423 for (Int_t ico=0; ico<2; ico++) {
425 AliMUONRawCluster cnew;
427 for (cath=0; cath<2; cath++) {
428 cnew.fX[cath]=Float_t(xm[ico][1]);
429 cnew.fY[cath]=Float_t(ym[ico][0]);
430 cnew.fZ[cath]=fZPlane;
432 cnew.fMultiplicity[cath]=c->fMultiplicity[cath];
433 for (i=0; i<fMul[cath]; i++) {
434 cnew.fIndexMap[i][cath]=c->fIndexMap[i][cath];
435 fSeg[cath]->SetPad(fIx[i][cath], fIy[i][cath]);
437 fprintf(stderr,"\nRawCluster %d cath %d\n",ico,cath);
438 fprintf(stderr,"mult_av %d\n",c->fMultiplicity[cath]);
439 FillCluster(&cnew,cath);
441 cnew.fClusterType=cnew.PhysicsContribution();
450 // ******* iacc = 2 *******
451 // Two combinations found between the 2 cathodes
453 // Was the same maximum taken twice
454 if ((accepted[0]&&accepted[1]) || (accepted[2]&&accepted[3])) {
455 fprintf(stderr,"\n Maximum taken twice !!!\n");
457 // Have a try !! with that
458 if (accepted[0]&&accepted[3]) {
470 fprintf(stderr,"\n cas (2) CombiDoubleMathiesonFit(c)\n");
471 chi2=CombiDoubleMathiesonFit(c);
472 // Int_t ndf = fgNbins[0]+fgNbins[1]-6;
473 // Float_t prob = TMath::Prob(chi2,ndf);
474 // prob2->Fill(prob);
475 // chi2_2->Fill(chi2);
479 // No ghosts ! No Problems ! - Perform one fit only !
480 if (accepted[0]&&accepted[3]) {
492 fprintf(stderr,"\n cas (2) CombiDoubleMathiesonFit(c)\n");
493 chi2=CombiDoubleMathiesonFit(c);
494 // Int_t ndf = fgNbins[0]+fgNbins[1]-6;
495 // Float_t prob = TMath::Prob(chi2,ndf);
496 // prob2->Fill(prob);
497 // chi2_2->Fill(chi2);
499 fprintf(stderr," chi2 %f\n",chi2);
503 // ******* iacc = 4 *******
504 // Four combinations found between the 2 cathodes
506 } else if (iacc==4) {
507 // Perform fits for the two possibilities !!
508 // Accept if charges are compatible on both cathodes
509 // If none are compatible, keep everything
515 fprintf(stderr,"\n cas (2) CombiDoubleMathiesonFit(c)\n");
516 chi2=CombiDoubleMathiesonFit(c);
517 // Int_t ndf = fgNbins[0]+fgNbins[1]-6;
518 // Float_t prob = TMath::Prob(chi2,ndf);
519 // prob2->Fill(prob);
520 // chi2_2->Fill(chi2);
522 fprintf(stderr," chi2 %f\n",chi2);
523 // store results of fit and postpone decision
524 Double_t sXFit[2],sYFit[2],sQrFit[2];
526 for (Int_t i=0;i<2;i++) {
537 fprintf(stderr,"\n cas (2) CombiDoubleMathiesonFit(c)\n");
538 chi2=CombiDoubleMathiesonFit(c);
539 // ndf = fgNbins[0]+fgNbins[1]-6;
540 // prob = TMath::Prob(chi2,ndf);
541 // prob2->Fill(prob);
542 // chi2_2->Fill(chi2);
544 fprintf(stderr," chi2 %f\n",chi2);
545 // We have all informations to perform the decision
546 // Compute the chi2 for the 2 possibilities
547 Float_t chi2fi,chi2si,chi2f,chi2s;
549 chi2f = (TMath::Log(fInput->TotalCharge(0)*fQrFit[0]
550 / (fInput->TotalCharge(1)*fQrFit[1]) )
551 / fInput->Response()->ChargeCorrel() );
553 chi2fi = (TMath::Log(fInput->TotalCharge(0)*(1-fQrFit[0])
554 / (fInput->TotalCharge(1)*(1-fQrFit[1])) )
555 / fInput->Response()->ChargeCorrel() );
556 chi2f += chi2fi*chi2fi;
558 chi2s = (TMath::Log(fInput->TotalCharge(0)*sQrFit[0]
559 / (fInput->TotalCharge(1)*sQrFit[1]) )
560 / fInput->Response()->ChargeCorrel() );
562 chi2si = (TMath::Log(fInput->TotalCharge(0)*(1-sQrFit[0])
563 / (fInput->TotalCharge(1)*(1-sQrFit[1])) )
564 / fInput->Response()->ChargeCorrel() );
565 chi2s += chi2si*chi2si;
567 // usefull to store the charge matching chi2 in the cluster
568 // fChi2[0]=sChi2[1]=chi2f;
569 // fChi2[1]=sChi2[0]=chi2s;
571 if (chi2f<=fGhostChi2Cut && chi2s<=fGhostChi2Cut)
573 if (chi2f>fGhostChi2Cut && chi2s>fGhostChi2Cut) {
579 if (chi2f<=fGhostChi2Cut)
581 if (chi2s<=fGhostChi2Cut) {
582 // retreive saved values
583 for (Int_t i=0;i<2;i++) {
594 } else if (fNLocal[0]==2 && fNLocal[1]==1) {
595 // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
596 // (3) Two local maxima on cathode 1 and one maximum on cathode 2
597 // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
599 Float_t xm[4][2], ym[4][2];
600 Float_t dpx, dpy, dx, dy;
601 Int_t ixm[4][2], iym[4][2];
602 Int_t isec, im1, ico;
604 // Form the 2x2 combinations
605 // 0-0, 0-1, 1-0, 1-1
607 for (im1=0; im1<2; im1++) {
608 xm[ico][0]=fX[fIndLocal[im1][0]][0];
609 ym[ico][0]=fY[fIndLocal[im1][0]][0];
610 xm[ico][1]=fX[fIndLocal[0][1]][1];
611 ym[ico][1]=fY[fIndLocal[0][1]][1];
613 ixm[ico][0]=fIx[fIndLocal[im1][0]][0];
614 iym[ico][0]=fIy[fIndLocal[im1][0]][0];
615 ixm[ico][1]=fIx[fIndLocal[0][1]][1];
616 iym[ico][1]=fIy[fIndLocal[0][1]][1];
619 // ico = 0 : first local maximum on cathodes 1 and 2
620 // ico = 1 : second local maximum on cathode 1 and first on cathode 2
622 // Analyse the combinations and keep those that are possible !
623 // For each combination check consistency in x and y
627 // In case of staggering maxima are displaced by exactly half the pad-size in y.
628 // We have to take into account the numerical precision in the consistency check;
632 for (ico=0; ico<2; ico++) {
633 accepted[ico]=kFALSE;
634 isec=fSeg[0]->Sector(ixm[ico][0], iym[ico][0]);
635 dpx=fSeg[0]->Dpx(isec)/2.;
636 dx=TMath::Abs(xm[ico][0]-xm[ico][1]);
637 isec=fSeg[1]->Sector(ixm[ico][1], iym[ico][1]);
638 dpy=fSeg[1]->Dpy(isec)/2.;
639 dy=TMath::Abs(ym[ico][0]-ym[ico][1]);
641 printf("\n %i %f %f %f %f \n", ico, ym[ico][0], ym[ico][1], dy, dpy );
642 if ((dx <= dpx) && (dy <= dpy+eps)) {
648 accepted[ico]=kFALSE;
656 // Initial value for charge ratios
657 fQrInit[0]=Float_t(fQ[fIndLocal[0][0]][0])/
658 Float_t(fQ[fIndLocal[0][0]][0]+fQ[fIndLocal[1][0]][0]);
659 fQrInit[1]=fQrInit[0];
661 if (accepted[0] && accepted[1]) {
663 fXInit[0]=0.5*(xm[0][1]+xm[0][0]);
665 fXInit[1]=0.5*(xm[0][1]+xm[1][0]);
669 chi23=CombiDoubleMathiesonFit(c);
678 } else if (accepted[0]) {
683 chi21=CombiDoubleMathiesonFit(c);
684 // Int_t ndf = fgNbins[0]+fgNbins[1]-6;
685 // Float_t prob = TMath::Prob(chi2,ndf);
686 // prob2->Fill(prob);
687 // chi2_2->Fill(chi21);
689 fprintf(stderr," chi2 %f\n",chi21);
690 if (chi21<10) Split(c);
691 } else if (accepted[1]) {
696 chi22=CombiDoubleMathiesonFit(c);
697 // Int_t ndf = fgNbins[0]+fgNbins[1]-6;
698 // Float_t prob = TMath::Prob(chi2,ndf);
699 // prob2->Fill(prob);
700 // chi2_2->Fill(chi22);
702 fprintf(stderr," chi2 %f\n",chi22);
703 if (chi22<10) Split(c);
706 if (chi21 > 10 && chi22 > 10 && chi23 > 10) {
707 // We keep only the combination found (X->cathode 2, Y->cathode 1)
708 for (Int_t ico=0; ico<2; ico++) {
710 AliMUONRawCluster cnew;
712 for (cath=0; cath<2; cath++) {
713 cnew.fX[cath]=Float_t(xm[ico][1]);
714 cnew.fY[cath]=Float_t(ym[ico][0]);
715 cnew.fZ[cath]=fZPlane;
716 cnew.fMultiplicity[cath]=c->fMultiplicity[cath];
717 for (i=0; i<fMul[cath]; i++) {
718 cnew.fIndexMap[i][cath]=c->fIndexMap[i][cath];
719 fSeg[cath]->SetPad(fIx[i][cath], fIy[i][cath]);
721 fprintf(stderr,"\nRawCluster %d cath %d\n",ico,cath);
722 fprintf(stderr,"mult_av %d\n",c->fMultiplicity[cath]);
723 FillCluster(&cnew,cath);
725 cnew.fClusterType=cnew.PhysicsContribution();
732 // +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
733 // (3') One local maximum on cathode 1 and two maxima on cathode 2
734 // +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
735 } else if (fNLocal[0]==1 && fNLocal[1]==2) {
736 Float_t xm[4][2], ym[4][2];
737 Float_t dpx, dpy, dx, dy;
738 Int_t ixm[4][2], iym[4][2];
739 Int_t isec, im1, ico;
741 // Form the 2x2 combinations
742 // 0-0, 0-1, 1-0, 1-1
744 for (im1=0; im1<2; im1++) {
745 xm[ico][0]=fX[fIndLocal[0][0]][0];
746 ym[ico][0]=fY[fIndLocal[0][0]][0];
747 xm[ico][1]=fX[fIndLocal[im1][1]][1];
748 ym[ico][1]=fY[fIndLocal[im1][1]][1];
750 ixm[ico][0]=fIx[fIndLocal[0][0]][0];
751 iym[ico][0]=fIy[fIndLocal[0][0]][0];
752 ixm[ico][1]=fIx[fIndLocal[im1][1]][1];
753 iym[ico][1]=fIy[fIndLocal[im1][1]][1];
756 // ico = 0 : first local maximum on cathodes 1 and 2
757 // ico = 1 : first local maximum on cathode 1 and second on cathode 2
759 // Analyse the combinations and keep those that are possible !
760 // For each combination check consistency in x and y
764 // In case of staggering maxima are displaced by exactly half the pad-size in y.
765 // We have to take into account the numerical precision in the consistency check;
769 for (ico=0; ico<2; ico++) {
770 accepted[ico]=kFALSE;
771 isec=fSeg[0]->Sector(ixm[ico][0], iym[ico][0]);
772 dpx=fSeg[0]->Dpx(isec)/2.;
773 dx=TMath::Abs(xm[ico][0]-xm[ico][1]);
774 isec=fSeg[1]->Sector(ixm[ico][1], iym[ico][1]);
775 dpy=fSeg[1]->Dpy(isec)/2.;
776 dy=TMath::Abs(ym[ico][0]-ym[ico][1]);
778 printf("\n %i %f %f %f %f \n", ico, ym[ico][0], ym[ico][1], dy, dpy );
779 if ((dx <= dpx) && (dy <= dpy+eps)) {
782 fprintf(stderr,"ico %d\n",ico);
786 accepted[ico]=kFALSE;
794 fQrInit[1]=Float_t(fQ[fIndLocal[0][1]][1])/
795 Float_t(fQ[fIndLocal[0][1]][1]+fQ[fIndLocal[1][1]][1]);
797 fQrInit[0]=fQrInit[1];
800 if (accepted[0] && accepted[1]) {
802 fYInit[0]=0.5*(ym[0][0]+ym[0][1]);
804 fYInit[1]=0.5*(ym[0][0]+ym[1][1]);
807 chi23=CombiDoubleMathiesonFit(c);
816 } else if (accepted[0]) {
821 chi21=CombiDoubleMathiesonFit(c);
822 // Int_t ndf = fgNbins[0]+fgNbins[1]-6;
823 // Float_t prob = TMath::Prob(chi2,ndf);
824 // prob2->Fill(prob);
825 // chi2_2->Fill(chi21);
827 fprintf(stderr," chi2 %f\n",chi21);
828 if (chi21<10) Split(c);
829 } else if (accepted[1]) {
834 chi22=CombiDoubleMathiesonFit(c);
835 // Int_t ndf = fgNbins[0]+fgNbins[1]-6;
836 // Float_t prob = TMath::Prob(chi2,ndf);
837 // prob2->Fill(prob);
838 // chi2_2->Fill(chi22);
840 fprintf(stderr," chi2 %f\n",chi22);
841 if (chi22<10) Split(c);
844 if (chi21 > 10 && chi22 > 10 && chi23 > 10) {
845 //We keep only the combination found (X->cathode 2, Y->cathode 1)
846 for (Int_t ico=0; ico<2; ico++) {
848 AliMUONRawCluster cnew;
850 for (cath=0; cath<2; cath++) {
851 cnew.fX[cath]=Float_t(xm[ico][1]);
852 cnew.fY[cath]=Float_t(ym[ico][0]);
853 cnew.fZ[cath]=fZPlane;
854 cnew.fMultiplicity[cath]=c->fMultiplicity[cath];
855 for (i=0; i<fMul[cath]; i++) {
856 cnew.fIndexMap[i][cath]=c->fIndexMap[i][cath];
857 fSeg[cath]->SetPad(fIx[i][cath], fIy[i][cath]);
859 fprintf(stderr,"\nRawCluster %d cath %d\n",ico,cath);
860 fprintf(stderr,"mult_av %d\n",c->fMultiplicity[cath]);
861 FillCluster(&cnew,cath);
863 cnew.fClusterType=cnew.PhysicsContribution();
870 // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
871 // (4) At least three local maxima on cathode 1 or on cathode 2
872 // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
873 } else if (fNLocal[0]>2 || fNLocal[1]>2) {
874 Int_t param = fNLocal[0]*fNLocal[1];
877 Float_t ** xm = new Float_t * [param];
878 for (ii=0; ii<param; ii++) xm[ii]=new Float_t [2];
879 Float_t ** ym = new Float_t * [param];
880 for (ii=0; ii<param; ii++) ym[ii]=new Float_t [2];
881 Int_t ** ixm = new Int_t * [param];
882 for (ii=0; ii<param; ii++) ixm[ii]=new Int_t [2];
883 Int_t ** iym = new Int_t * [param];
884 for (ii=0; ii<param; ii++) iym[ii]=new Int_t [2];
887 Float_t dpx, dpy, dx, dy;
890 for (Int_t im1=0; im1<fNLocal[0]; im1++) {
891 for (Int_t im2=0; im2<fNLocal[1]; im2++) {
892 xm[ico][0]=fX[fIndLocal[im1][0]][0];
893 ym[ico][0]=fY[fIndLocal[im1][0]][0];
894 xm[ico][1]=fX[fIndLocal[im2][1]][1];
895 ym[ico][1]=fY[fIndLocal[im2][1]][1];
897 ixm[ico][0]=fIx[fIndLocal[im1][0]][0];
898 iym[ico][0]=fIy[fIndLocal[im1][0]][0];
899 ixm[ico][1]=fIx[fIndLocal[im2][1]][1];
900 iym[ico][1]=fIy[fIndLocal[im2][1]][1];
907 fprintf(stderr,"nIco %d\n",nIco);
908 for (ico=0; ico<nIco; ico++) {
910 fprintf(stderr,"ico = %d\n",ico);
911 isec=fSeg[0]->Sector(ixm[ico][0], iym[ico][0]);
912 dpx=fSeg[0]->Dpx(isec)/2.;
913 dx=TMath::Abs(xm[ico][0]-xm[ico][1]);
914 isec=fSeg[1]->Sector(ixm[ico][1], iym[ico][1]);
915 dpy=fSeg[1]->Dpy(isec)/2.;
916 dy=TMath::Abs(ym[ico][0]-ym[ico][1]);
918 fprintf(stderr,"dx %f dpx %f dy %f dpy %f\n",dx,dpx,dy,dpy);
919 fprintf(stderr," X %f Y %f\n",xm[ico][1],ym[ico][0]);
921 if ((dx <= dpx) && (dy <= dpy)) {
923 fprintf(stderr,"ok\n");
925 AliMUONRawCluster cnew;
926 for (cath=0; cath<2; cath++) {
927 cnew.fX[cath]=Float_t(xm[ico][1]);
928 cnew.fY[cath]=Float_t(ym[ico][0]);
929 cnew.fZ[cath]=fZPlane;
930 cnew.fMultiplicity[cath]=c->fMultiplicity[cath];
931 for (i=0; i<fMul[cath]; i++) {
932 cnew.fIndexMap[i][cath]=c->fIndexMap[i][cath];
933 fSeg[cath]->SetPad(fIx[i][cath], fIy[i][cath]);
935 FillCluster(&cnew,cath);
937 cnew.fClusterType=cnew.PhysicsContribution();
949 void AliMUONClusterFinderVS::FindLocalMaxima(AliMUONRawCluster* /*c*/)
951 // Find all local maxima of a cluster
953 printf("\n Find Local maxima !");
957 Int_t cath, cath1; // loops over cathodes
958 Int_t i; // loops over digits
959 Int_t j; // loops over cathodes
963 // counters for number of local maxima
964 fNLocal[0]=fNLocal[1]=0;
965 // flags digits as local maximum
966 Bool_t isLocal[100][2];
967 for (i=0; i<100;i++) {
968 isLocal[i][0]=isLocal[i][1]=kFALSE;
970 // number of next neighbours and arrays to store them
973 // loop over cathodes
974 for (cath=0; cath<2; cath++) {
975 // loop over cluster digits
976 for (i=0; i<fMul[cath]; i++) {
977 // get neighbours for that digit and assume that it is local maximum
978 fSeg[cath]->Neighbours(fIx[i][cath], fIy[i][cath], &nn, x, y);
979 isLocal[i][cath]=kTRUE;
980 Int_t isec= fSeg[cath]->Sector(fIx[i][cath], fIy[i][cath]);
981 Float_t a0 = fSeg[cath]->Dpx(isec)*fSeg[cath]->Dpy(isec);
982 // loop over next neighbours, if at least one neighbour has higher charger assumption
983 // digit is not local maximum
984 for (j=0; j<nn; j++) {
985 if (fHitMap[cath]->TestHit(x[j], y[j])==kEmpty) continue;
986 digt=(AliMUONDigit*) fHitMap[cath]->GetHit(x[j], y[j]);
987 isec=fSeg[cath]->Sector(x[j], y[j]);
988 Float_t a1 = fSeg[cath]->Dpx(isec)*fSeg[cath]->Dpy(isec);
989 if (digt->Signal()/a1 > fQ[i][cath]/a0) {
990 isLocal[i][cath]=kFALSE;
993 // handle special case of neighbouring pads with equal signal
994 } else if (digt->Signal() == fQ[i][cath]) {
995 if (fNLocal[cath]>0) {
996 for (Int_t k=0; k<fNLocal[cath]; k++) {
997 if (x[j]==fIx[fIndLocal[k][cath]][cath]
998 && y[j]==fIy[fIndLocal[k][cath]][cath])
1000 isLocal[i][cath]=kFALSE;
1002 } // loop over local maxima
1003 } // are there already local maxima
1005 } // loop over next neighbours
1006 if (isLocal[i][cath]) {
1007 fIndLocal[fNLocal[cath]][cath]=i;
1010 } // loop over all digits
1011 } // loop over cathodes
1014 printf("\n Found %d %d %d %d local Maxima\n",
1015 fNLocal[0], fNLocal[1], fMul[0], fMul[1]);
1016 fprintf(stderr,"\n Cathode 1 local Maxima %d Multiplicite %d\n",fNLocal[0], fMul[0]);
1017 fprintf(stderr," Cathode 2 local Maxima %d Multiplicite %d\n",fNLocal[1], fMul[1]);
1023 if (fNLocal[1]==2 && (fNLocal[0]==1 || fNLocal[0]==0)) {
1024 Int_t iback=fNLocal[0];
1026 // Two local maxima on cathode 2 and one maximum on cathode 1
1027 // Look for local maxima considering up and down neighbours on the 1st cathode only
1029 // Loop over cluster digits
1033 for (i=0; i<fMul[cath]; i++) {
1034 isec=fSeg[cath]->Sector(fIx[i][cath],fIy[i][cath]);
1035 dpy=fSeg[cath]->Dpy(isec);
1036 dpx=fSeg[cath]->Dpx(isec);
1037 if (isLocal[i][cath]) continue;
1038 // Pad position should be consistent with position of local maxima on the opposite cathode
1039 if ((TMath::Abs(fX[i][cath]-fX[fIndLocal[0][cath1]][cath1]) > dpx/2.) &&
1040 (TMath::Abs(fX[i][cath]-fX[fIndLocal[1][cath1]][cath1]) > dpx/2.))
1043 // get neighbours for that digit and assume that it is local maximum
1044 isLocal[i][cath]=kTRUE;
1045 // compare signal to that on the two neighbours on the left and on the right
1046 // iNN counts the number of neighbours with signal, it should be 1 or 2
1050 ->FirstPad(fX[i][cath], fY[i][cath], fZPlane, 0., dpy);
1056 ix = fSeg[cath]->Ix();
1057 iy = fSeg[cath]->Iy();
1058 // skip the current pad
1059 if (iy == fIy[i][cath]) continue;
1061 if (fHitMap[cath]->TestHit(ix, iy)!=kEmpty) {
1063 digt=(AliMUONDigit*) fHitMap[cath]->GetHit(ix,iy);
1064 if (digt->Signal() > fQ[i][cath]) isLocal[i][cath]=kFALSE;
1066 } // Loop over pad neighbours in y
1067 if (isLocal[i][cath] && iNN>0) {
1068 fIndLocal[fNLocal[cath]][cath]=i;
1071 } // loop over all digits
1072 // if one additional maximum has been found we are happy
1073 // if more maxima have been found restore the previous situation
1076 "\n New search gives %d local maxima for cathode 1 \n",
1079 " %d local maxima for cathode 2 \n",
1082 if (fNLocal[cath]>2) {
1083 fNLocal[cath]=iback;
1086 } // 1,2 local maxima
1088 if (fNLocal[0]==2 && (fNLocal[1]==1 || fNLocal[1]==0)) {
1089 Int_t iback=fNLocal[1];
1091 // Two local maxima on cathode 1 and one maximum on cathode 2
1092 // Look for local maxima considering left and right neighbours on the 2nd cathode only
1095 Float_t eps = 1.e-5;
1098 // Loop over cluster digits
1099 for (i=0; i<fMul[cath]; i++) {
1100 isec=fSeg[cath]->Sector(fIx[i][cath],fIy[i][cath]);
1101 dpx=fSeg[cath]->Dpx(isec);
1102 dpy=fSeg[cath]->Dpy(isec);
1103 if (isLocal[i][cath]) continue;
1104 // Pad position should be consistent with position of local maxima on the opposite cathode
1105 if ((TMath::Abs(fY[i][cath]-fY[fIndLocal[0][cath1]][cath1]) > dpy/2.+eps) &&
1106 (TMath::Abs(fY[i][cath]-fY[fIndLocal[1][cath1]][cath1]) > dpy/2.+eps))
1110 // get neighbours for that digit and assume that it is local maximum
1111 isLocal[i][cath]=kTRUE;
1112 // compare signal to that on the two neighbours on the left and on the right
1114 // iNN counts the number of neighbours with signal, it should be 1 or 2
1117 ->FirstPad(fX[i][cath], fY[i][cath], fZPlane, dpx, 0.);
1124 ix = fSeg[cath]->Ix();
1125 iy = fSeg[cath]->Iy();
1127 // skip the current pad
1128 if (ix == fIx[i][cath]) continue;
1130 if (fHitMap[cath]->TestHit(ix, iy)!=kEmpty) {
1132 digt=(AliMUONDigit*) fHitMap[cath]->GetHit(ix,iy);
1133 if (digt->Signal() > fQ[i][cath]) isLocal[i][cath]=kFALSE;
1135 } // Loop over pad neighbours in x
1136 if (isLocal[i][cath] && iNN>0) {
1137 fIndLocal[fNLocal[cath]][cath]=i;
1140 } // loop over all digits
1141 // if one additional maximum has been found we are happy
1142 // if more maxima have been found restore the previous situation
1144 fprintf(stderr,"\n New search gives %d local maxima for cathode 1 \n",fNLocal[0]);
1145 fprintf(stderr,"\n %d local maxima for cathode 2 \n",fNLocal[1]);
1146 printf("\n New search gives %d %d \n",fNLocal[0],fNLocal[1]);
1148 if (fNLocal[cath]>2) {
1149 fNLocal[cath]=iback;
1151 } // 2,1 local maxima
1155 void AliMUONClusterFinderVS::FillCluster(AliMUONRawCluster* c, Int_t flag, Int_t cath)
1158 // Completes cluster information starting from list of digits
1165 c->fPeakSignal[cath]=c->fPeakSignal[0];
1167 c->fPeakSignal[cath]=0;
1178 fprintf(stderr,"\n fPeakSignal %d\n",c->fPeakSignal[cath]);
1179 for (Int_t i=0; i<c->fMultiplicity[cath]; i++)
1181 dig= fInput->Digit(cath,c->fIndexMap[i][cath]);
1182 ix=dig->PadX()+c->fOffsetMap[i][cath];
1184 Int_t q=dig->Signal();
1185 if (!flag) q=Int_t(q*c->fContMap[i][cath]);
1186 // fprintf(stderr,"q %d c->fPeakSignal[ %d ] %d\n",q,cath,c->fPeakSignal[cath]);
1187 if (dig->Physics() >= dig->Signal()) {
1188 c->fPhysicsMap[i]=2;
1189 } else if (dig->Physics() == 0) {
1190 c->fPhysicsMap[i]=0;
1191 } else c->fPhysicsMap[i]=1;
1195 fprintf(stderr,"q %d c->fPeakSignal[cath] %d\n",q,c->fPeakSignal[cath]);
1196 // peak signal and track list
1197 if (q>c->fPeakSignal[cath]) {
1198 c->fPeakSignal[cath]=q;
1199 c->fTracks[0]=dig->Hit();
1200 c->fTracks[1]=dig->Track(0);
1201 c->fTracks[2]=dig->Track(1);
1202 // fprintf(stderr," c->fTracks[0] %d c->fTracks[1] %d\n",dig->fHit,dig->fTracks[0]);
1206 fSeg[cath]->GetPadC(ix, iy, x, y, z);
1211 } // loop over digits
1213 fprintf(stderr," fin du cluster c\n");
1217 c->fX[cath]/=c->fQ[cath];
1219 c->fX[cath]=fSeg[cath]->GetAnod(c->fX[cath]);
1220 c->fY[cath]/=c->fQ[cath];
1222 // apply correction to the coordinate along the anode wire
1226 fSeg[cath]->GetPadI(x, y, fZPlane, ix, iy);
1227 fSeg[cath]->GetPadC(ix, iy, x, y, z);
1228 Int_t isec=fSeg[cath]->Sector(ix,iy);
1229 TF1* cogCorr = fSeg[cath]->CorrFunc(isec-1);
1232 Float_t yOnPad=(c->fY[cath]-y)/fSeg[cath]->Dpy(isec);
1233 c->fY[cath]=c->fY[cath]-cogCorr->Eval(yOnPad, 0, 0);
1238 void AliMUONClusterFinderVS::FillCluster(AliMUONRawCluster* c, Int_t cath)
1241 // Completes cluster information starting from list of digits
1251 Float_t xpad, ypad, zpad;
1254 for (Int_t i=0; i<c->fMultiplicity[cath]; i++)
1256 dig = fInput->Digit(cath,c->fIndexMap[i][cath]);
1258 GetPadC(dig->PadX(),dig->PadY(),xpad,ypad, zpad);
1260 fprintf(stderr,"x %f y %f cx %f cy %f\n",xpad,ypad,c->fX[0],c->fY[0]);
1261 dx = xpad - c->fX[0];
1262 dy = ypad - c->fY[0];
1263 dr = TMath::Sqrt(dx*dx+dy*dy);
1268 fprintf(stderr," dr %f\n",dr);
1269 Int_t q=dig->Signal();
1270 if (dig->Physics() >= dig->Signal()) {
1271 c->fPhysicsMap[i]=2;
1272 } else if (dig->Physics() == 0) {
1273 c->fPhysicsMap[i]=0;
1274 } else c->fPhysicsMap[i]=1;
1275 c->fPeakSignal[cath]=q;
1276 c->fTracks[0]=dig->Hit();
1277 c->fTracks[1]=dig->Track(0);
1278 c->fTracks[2]=dig->Track(1);
1280 fprintf(stderr," c->fTracks[0] %d c->fTracks[1] %d\n",dig->Hit(),
1284 } // loop over digits
1286 // apply correction to the coordinate along the anode wire
1288 c->fX[cath]=fSeg[cath]->GetAnod(c->fX[cath]);
1291 void AliMUONClusterFinderVS::FindCluster(Int_t i, Int_t j, Int_t cath, AliMUONRawCluster &c){
1295 // Find a super cluster on both cathodes
1298 // Add i,j as element of the cluster
1301 Int_t idx = fHitMap[cath]->GetHitIndex(i,j);
1302 AliMUONDigit* dig = (AliMUONDigit*) fHitMap[cath]->GetHit(i,j);
1303 Int_t q=dig->Signal();
1304 Int_t theX=dig->PadX();
1305 Int_t theY=dig->PadY();
1307 if (q > TMath::Abs(c.fPeakSignal[0]) && q > TMath::Abs(c.fPeakSignal[1])) {
1308 c.fPeakSignal[cath]=q;
1309 c.fTracks[0]=dig->Hit();
1310 c.fTracks[1]=dig->Track(0);
1311 c.fTracks[2]=dig->Track(1);
1315 // Make sure that list of digits is ordered
1317 Int_t mu=c.fMultiplicity[cath];
1318 c.fIndexMap[mu][cath]=idx;
1320 if (dig->Physics() >= dig->Signal()) {
1321 c.fPhysicsMap[mu]=2;
1322 } else if (dig->Physics() == 0) {
1323 c.fPhysicsMap[mu]=0;
1324 } else c.fPhysicsMap[mu]=1;
1328 for (Int_t ind = mu-1; ind >= 0; ind--) {
1329 Int_t ist=(c.fIndexMap)[ind][cath];
1330 Int_t ql=fInput->Digit(cath, ist)->Signal();
1331 Int_t ix=fInput->Digit(cath, ist)->PadX();
1332 Int_t iy=fInput->Digit(cath, ist)->PadY();
1334 if (q>ql || (q==ql && theX > ix && theY < iy)) {
1335 c.fIndexMap[ind][cath]=idx;
1336 c.fIndexMap[ind+1][cath]=ist;
1344 c.fMultiplicity[cath]++;
1345 if (c.fMultiplicity[cath] >= 50 ) {
1346 printf("FindCluster - multiplicity >50 %d \n",c.fMultiplicity[0]);
1347 c.fMultiplicity[cath]=49;
1350 // Prepare center of gravity calculation
1352 fSeg[cath]->GetPadC(i, j, x, y, z);
1358 // Flag hit as "taken"
1359 fHitMap[cath]->FlagHit(i,j);
1361 // Now look recursively for all neighbours and pad hit on opposite cathode
1363 // Loop over neighbours
1367 Int_t xList[10], yList[10];
1368 fSeg[cath]->Neighbours(i,j,&nn,xList,yList);
1369 for (Int_t in=0; in<nn; in++) {
1373 if (fHitMap[cath]->TestHit(ix,iy)==kUnused) {
1375 printf("\n Neighbours %d %d %d", cath, ix, iy);
1376 FindCluster(ix, iy, cath, c);
1381 Int_t iXopp[50], iYopp[50];
1383 // Neighbours on opposite cathode
1384 // Take into account that several pads can overlap with the present pad
1385 Int_t isec=fSeg[cath]->Sector(i,j);
1391 dx = (fSeg[cath]->Dpx(isec))/2.;
1396 dy = (fSeg[cath]->Dpy(isec))/2;
1398 // loop over pad neighbours on opposite cathode
1399 for (fSeg[iop]->FirstPad(x, y, fZPlane, dx, dy);
1400 fSeg[iop]->MorePads();
1401 fSeg[iop]->NextPad())
1404 ix = fSeg[iop]->Ix(); iy = fSeg[iop]->Iy();
1405 if (fDebugLevel > 1)
1406 printf("\n ix, iy: %f %f %f %d %d %d", x,y,z,ix, iy, fSector);
1407 if (fHitMap[iop]->TestHit(ix,iy)==kUnused){
1410 if (fDebugLevel > 1)
1411 printf("\n Opposite %d %d %d", iop, ix, iy);
1414 } // Loop over pad neighbours
1415 // This had to go outside the loop since recursive calls inside the iterator are not possible
1418 for (jopp=0; jopp<nOpp; jopp++) {
1419 if (fHitMap[iop]->TestHit(iXopp[jopp],iYopp[jopp]) == kUnused)
1420 FindCluster(iXopp[jopp], iYopp[jopp], iop, c);
1424 //_____________________________________________________________________________
1426 void AliMUONClusterFinderVS::FindRawClusters()
1429 // MUON cluster finder from digits -- finds neighbours on both cathodes and
1430 // fills the tree with raw clusters
1433 // Return if no input datad available
1434 if (!fInput->NDigits(0) && !fInput->NDigits(1)) return;
1436 fSeg[0] = fInput->Segmentation(0);
1437 fSeg[1] = fInput->Segmentation(1);
1439 fHitMap[0] = new AliMUONHitMapA1(fSeg[0], fInput->Digits(0));
1440 fHitMap[1] = new AliMUONHitMapA1(fSeg[1], fInput->Digits(1));
1448 fHitMap[0]->FillHits();
1449 fHitMap[1]->FillHits();
1451 // Outer Loop over Cathodes
1452 for (cath=0; cath<2; cath++) {
1453 for (ndig=0; ndig<fInput->NDigits(cath); ndig++) {
1454 dig = fInput->Digit(cath, ndig);
1455 Int_t i=dig->PadX();
1456 Int_t j=dig->PadY();
1457 if (fHitMap[cath]->TestHit(i,j)==kUsed ||fHitMap[0]->TestHit(i,j)==kEmpty) {
1462 fprintf(stderr,"\n CATHODE %d CLUSTER %d\n",cath,ncls);
1463 AliMUONRawCluster c;
1464 c.fMultiplicity[0]=0;
1465 c.fMultiplicity[1]=0;
1466 c.fPeakSignal[cath]=dig->Signal();
1467 c.fTracks[0]=dig->Hit();
1468 c.fTracks[1]=dig->Track(0);
1469 c.fTracks[2]=dig->Track(1);
1470 // tag the beginning of cluster list in a raw cluster
1473 fSeg[cath]->GetPadC(i,j,xcu, ycu, fZPlane);
1474 fSector= fSeg[cath]->Sector(i,j)/100;
1476 printf("\n New Seed %d %d ", i,j);
1479 FindCluster(i,j,cath,c);
1480 // ^^^^^^^^^^^^^^^^^^^^^^^^
1481 // center of gravity
1482 if (c.fX[0]!=0.) c.fX[0] /= c.fQ[0];
1484 c.fX[0]=fSeg[0]->GetAnod(c.fX[0]);
1485 if (c.fY[0]!=0.) c.fY[0] /= c.fQ[0];
1487 if(c.fQ[1]!=0.) c.fX[1] /= c.fQ[1];
1490 c.fX[1]=fSeg[0]->GetAnod(c.fX[1]);
1491 if(c.fQ[1]!=0.) c.fY[1] /= c.fQ[1];
1497 fprintf(stderr,"\n Cathode 1 multiplicite %d X(CG) %f Y(CG) %f\n",
1498 c.fMultiplicity[0],c.fX[0],c.fY[0]);
1499 fprintf(stderr," Cathode 2 multiplicite %d X(CG) %f Y(CG) %f\n",
1500 c.fMultiplicity[1],c.fX[1],c.fY[1]);
1502 // Analyse cluster and decluster if necessary
1505 c.fNcluster[1]=fNRawClusters;
1506 c.fClusterType=c.PhysicsContribution();
1513 // reset Cluster object
1514 { // begin local scope
1515 for (int k=0;k<c.fMultiplicity[0];k++) c.fIndexMap[k][0]=0;
1516 } // end local scope
1518 { // begin local scope
1519 for (int k=0;k<c.fMultiplicity[1];k++) c.fIndexMap[k][1]=0;
1520 } // end local scope
1522 c.fMultiplicity[0]=c.fMultiplicity[0]=0;
1526 } // end loop cathodes
1531 Float_t AliMUONClusterFinderVS::SingleMathiesonFit(AliMUONRawCluster *c, Int_t cath)
1533 // Performs a single Mathieson fit on one cathode
1535 AliMUONClusterInput& clusterInput = *(AliMUONClusterInput::Instance());
1537 clusterInput.Fitter()->SetFCN(fcnS1);
1538 clusterInput.Fitter()->mninit(2,10,7);
1539 Double_t arglist[20];
1542 // Set starting values
1543 static Double_t vstart[2];
1548 // lower and upper limits
1549 static Double_t lower[2], upper[2];
1551 fSeg[cath]->GetPadI(c->fX[cath], c->fY[cath], fZPlane, ix, iy);
1552 Int_t isec=fSeg[cath]->Sector(ix, iy);
1553 lower[0]=vstart[0]-fSeg[cath]->Dpx(isec)/2;
1554 lower[1]=vstart[1]-fSeg[cath]->Dpy(isec)/2;
1556 upper[0]=lower[0]+fSeg[cath]->Dpx(isec);
1557 upper[1]=lower[1]+fSeg[cath]->Dpy(isec);
1560 static Double_t step[2]={0.0005, 0.0005};
1562 clusterInput.Fitter()->mnparm(0,"x1",vstart[0],step[0],lower[0],upper[0],ierflag);
1563 clusterInput.Fitter()->mnparm(1,"y1",vstart[1],step[1],lower[1],upper[1],ierflag);
1564 // ready for minimisation
1565 clusterInput.Fitter()->SetPrintLevel(-1+fDebugLevel);
1567 clusterInput.Fitter()->mnexcm("SET NOW", arglist, 0, ierflag);
1568 clusterInput.Fitter()->mnexcm("SET OUT", arglist, 0, ierflag);
1572 clusterInput.Fitter()->mnexcm("SET NOGR", arglist, 0, ierflag);
1573 clusterInput.Fitter()->mnexcm("MIGRAD", arglist, 0, ierflag);
1574 clusterInput.Fitter()->mnexcm("EXIT" , arglist, 0, ierflag);
1575 Double_t fmin, fedm, errdef;
1576 Int_t npari, nparx, istat;
1578 clusterInput.Fitter()->mnstat(fmin, fedm, errdef, npari, nparx, istat);
1582 // Get fitted parameters
1583 Double_t xrec, yrec;
1585 Double_t epxz, b1, b2;
1587 clusterInput.Fitter()->mnpout(0, chname, xrec, epxz, b1, b2, ierflg);
1588 clusterInput.Fitter()->mnpout(1, chname, yrec, epxz, b1, b2, ierflg);
1594 Float_t AliMUONClusterFinderVS::CombiSingleMathiesonFit(AliMUONRawCluster * /*c*/)
1596 // Perform combined Mathieson fit on both cathode planes
1598 AliMUONClusterInput& clusterInput = *(AliMUONClusterInput::Instance());
1599 clusterInput.Fitter()->SetFCN(fcnCombiS1);
1600 clusterInput.Fitter()->mninit(2,10,7);
1601 Double_t arglist[20];
1604 static Double_t vstart[2];
1605 vstart[0]=fXInit[0];
1606 vstart[1]=fYInit[0];
1609 // lower and upper limits
1610 static Float_t lower[2], upper[2];
1612 fSeg[0]->GetPadI(fXInit[0], fYInit[0], fZPlane, ix, iy);
1613 isec=fSeg[0]->Sector(ix, iy);
1614 Float_t dpy=fSeg[0]->Dpy(isec);
1615 fSeg[1]->GetPadI(fXInit[0], fYInit[0], fZPlane, ix, iy);
1616 isec=fSeg[1]->Sector(ix, iy);
1617 Float_t dpx=fSeg[1]->Dpx(isec);
1620 Float_t xdum, ydum, zdum;
1622 // Find save upper and lower limits
1626 for (fSeg[1]->FirstPad(fXInit[0], fYInit[0], fZPlane, dpx, 0.);
1627 fSeg[1]->MorePads(); fSeg[1]->NextPad())
1629 ix=fSeg[1]->Ix(); iy=fSeg[1]->Iy();
1630 fSeg[1]->GetPadC(ix,iy, upper[0], ydum, zdum);
1631 if (icount ==0) lower[0]=upper[0];
1635 if (lower[0]>upper[0]) {xdum=lower[0]; lower[0]=upper[0]; upper[0]=xdum;}
1639 printf("\n single y %f %f", fXInit[0], fYInit[0]);
1641 for (fSeg[0]->FirstPad(fXInit[0], fYInit[0], fZPlane, 0., dpy);
1642 fSeg[0]->MorePads(); fSeg[0]->NextPad())
1644 ix=fSeg[0]->Ix(); iy=fSeg[0]->Iy();
1645 fSeg[0]->GetPadC(ix,iy,xdum,upper[1],zdum);
1646 if (icount ==0) lower[1]=upper[1];
1649 printf("\n upper lower %d %f %f", icount, upper[1], lower[1]);
1652 if (lower[1]>upper[1]) {xdum=lower[1]; lower[1]=upper[1]; upper[1]=xdum;}
1655 static Double_t step[2]={0.00001, 0.0001};
1657 clusterInput.Fitter()->mnparm(0,"x1",vstart[0],step[0],lower[0],upper[0],ierflag);
1658 clusterInput.Fitter()->mnparm(1,"y1",vstart[1],step[1],lower[1],upper[1],ierflag);
1659 // ready for minimisation
1660 clusterInput.Fitter()->SetPrintLevel(-1+fDebugLevel);
1662 clusterInput.Fitter()->mnexcm("SET NOW", arglist, 0, ierflag);
1663 clusterInput.Fitter()->mnexcm("SET OUT", arglist, 0, ierflag);
1667 clusterInput.Fitter()->mnexcm("SET NOGR", arglist, 0, ierflag);
1668 clusterInput.Fitter()->mnexcm("MIGRAD", arglist, 0, ierflag);
1669 clusterInput.Fitter()->mnexcm("EXIT" , arglist, 0, ierflag);
1670 Double_t fmin, fedm, errdef;
1671 Int_t npari, nparx, istat;
1673 clusterInput.Fitter()->mnstat(fmin, fedm, errdef, npari, nparx, istat);
1677 // Get fitted parameters
1678 Double_t xrec, yrec;
1680 Double_t epxz, b1, b2;
1682 clusterInput.Fitter()->mnpout(0, chname, xrec, epxz, b1, b2, ierflg);
1683 clusterInput.Fitter()->mnpout(1, chname, yrec, epxz, b1, b2, ierflg);
1689 Bool_t AliMUONClusterFinderVS::DoubleMathiesonFit(AliMUONRawCluster * /*c*/, Int_t cath)
1691 // Performs a double Mathieson fit on one cathode
1695 // Initialise global variables for fit
1696 AliMUONClusterInput& clusterInput = *(AliMUONClusterInput::Instance());
1697 clusterInput.Fitter()->SetFCN(fcnS2);
1698 clusterInput.Fitter()->mninit(5,10,7);
1699 Double_t arglist[20];
1702 // Set starting values
1703 static Double_t vstart[5];
1704 vstart[0]=fX[fIndLocal[0][cath]][cath];
1705 vstart[1]=fY[fIndLocal[0][cath]][cath];
1706 vstart[2]=fX[fIndLocal[1][cath]][cath];
1707 vstart[3]=fY[fIndLocal[1][cath]][cath];
1708 vstart[4]=Float_t(fQ[fIndLocal[0][cath]][cath])/
1709 Float_t(fQ[fIndLocal[0][cath]][cath]+fQ[fIndLocal[1][cath]][cath]);
1710 // lower and upper limits
1711 static Float_t lower[5], upper[5];
1712 Int_t isec=fSeg[cath]->Sector(fIx[fIndLocal[0][cath]][cath], fIy[fIndLocal[0][cath]][cath]);
1713 lower[0]=vstart[0]-fSeg[cath]->Dpx(isec);
1714 lower[1]=vstart[1]-fSeg[cath]->Dpy(isec);
1716 upper[0]=lower[0]+2.*fSeg[cath]->Dpx(isec);
1717 upper[1]=lower[1]+2.*fSeg[cath]->Dpy(isec);
1719 isec=fSeg[cath]->Sector(fIx[fIndLocal[1][cath]][cath], fIy[fIndLocal[1][cath]][cath]);
1720 lower[2]=vstart[2]-fSeg[cath]->Dpx(isec)/2;
1721 lower[3]=vstart[3]-fSeg[cath]->Dpy(isec)/2;
1723 upper[2]=lower[2]+fSeg[cath]->Dpx(isec);
1724 upper[3]=lower[3]+fSeg[cath]->Dpy(isec);
1729 static Double_t step[5]={0.0005, 0.0005, 0.0005, 0.0005, 0.0001};
1731 clusterInput.Fitter()->mnparm(0,"x1",vstart[0],step[0],lower[0],upper[0],ierflag);
1732 clusterInput.Fitter()->mnparm(1,"y1",vstart[1],step[1],lower[1],upper[1],ierflag);
1733 clusterInput.Fitter()->mnparm(2,"x2",vstart[2],step[2],lower[2],upper[2],ierflag);
1734 clusterInput.Fitter()->mnparm(3,"y2",vstart[3],step[3],lower[3],upper[3],ierflag);
1735 clusterInput.Fitter()->mnparm(4,"a0",vstart[4],step[4],lower[4],upper[4],ierflag);
1736 // ready for minimisation
1737 clusterInput.Fitter()->SetPrintLevel(-1+fDebugLevel);
1739 clusterInput.Fitter()->mnexcm("SET NOW", arglist, 0, ierflag);
1740 clusterInput.Fitter()->mnexcm("SET OUT", arglist, 0, ierflag);
1744 clusterInput.Fitter()->mnexcm("SET NOGR", arglist, 0, ierflag);
1745 clusterInput.Fitter()->mnexcm("MIGRAD", arglist, 0, ierflag);
1746 clusterInput.Fitter()->mnexcm("EXIT" , arglist, 0, ierflag);
1747 // Get fitted parameters
1748 Double_t xrec[2], yrec[2], qfrac;
1750 Double_t epxz, b1, b2;
1752 clusterInput.Fitter()->mnpout(0, chname, xrec[0], epxz, b1, b2, ierflg);
1753 clusterInput.Fitter()->mnpout(1, chname, yrec[0], epxz, b1, b2, ierflg);
1754 clusterInput.Fitter()->mnpout(2, chname, xrec[1], epxz, b1, b2, ierflg);
1755 clusterInput.Fitter()->mnpout(3, chname, yrec[1], epxz, b1, b2, ierflg);
1756 clusterInput.Fitter()->mnpout(4, chname, qfrac, epxz, b1, b2, ierflg);
1758 Double_t fmin, fedm, errdef;
1759 Int_t npari, nparx, istat;
1761 clusterInput.Fitter()->mnstat(fmin, fedm, errdef, npari, nparx, istat);
1766 Float_t AliMUONClusterFinderVS::CombiDoubleMathiesonFit(AliMUONRawCluster * /*c*/)
1769 // Perform combined double Mathieson fit on both cathode planes
1771 AliMUONClusterInput& clusterInput = *(AliMUONClusterInput::Instance());
1772 clusterInput.Fitter()->SetFCN(fcnCombiS2);
1773 clusterInput.Fitter()->mninit(6,10,7);
1774 Double_t arglist[20];
1777 // Set starting values
1778 static Double_t vstart[6];
1779 vstart[0]=fXInit[0];
1780 vstart[1]=fYInit[0];
1781 vstart[2]=fXInit[1];
1782 vstart[3]=fYInit[1];
1783 vstart[4]=fQrInit[0];
1784 vstart[5]=fQrInit[1];
1785 // lower and upper limits
1786 static Float_t lower[6], upper[6];
1790 fSeg[1]->GetPadI(fXInit[0], fYInit[0], fZPlane, ix, iy);
1791 isec=fSeg[1]->Sector(ix, iy);
1792 dpx=fSeg[1]->Dpx(isec);
1794 fSeg[0]->GetPadI(fXInit[0], fYInit[0], fZPlane, ix, iy);
1795 isec=fSeg[0]->Sector(ix, iy);
1796 dpy=fSeg[0]->Dpy(isec);
1800 Float_t xdum, ydum, zdum;
1802 printf("\n Cluster Finder: %f %f %f %f ", fXInit[0], fXInit[1],fYInit[0], fYInit[1] );
1804 // Find save upper and lower limits
1807 for (fSeg[1]->FirstPad(fXInit[0], fYInit[0], fZPlane, dpx, 0.);
1808 fSeg[1]->MorePads(); fSeg[1]->NextPad())
1810 ix=fSeg[1]->Ix(); iy=fSeg[1]->Iy();
1811 // if (fHitMap[1]->TestHit(ix, iy) == kEmpty) continue;
1812 fSeg[1]->GetPadC(ix,iy,upper[0],ydum,zdum);
1813 if (icount ==0) lower[0]=upper[0];
1816 if (lower[0]>upper[0]) {xdum=lower[0]; lower[0]=upper[0]; upper[0]=xdum;}
1817 // vstart[0] = 0.5*(lower[0]+upper[0]);
1822 for (fSeg[0]->FirstPad(fXInit[0], fYInit[0], fZPlane, 0., dpy);
1823 fSeg[0]->MorePads(); fSeg[0]->NextPad())
1825 ix=fSeg[0]->Ix(); iy=fSeg[0]->Iy();
1826 // if (fHitMap[0]->TestHit(ix, iy) == kEmpty) continue;
1827 fSeg[0]->GetPadC(ix,iy,xdum,upper[1],zdum);
1828 if (icount ==0) lower[1]=upper[1];
1832 if (lower[1]>upper[1]) {xdum=lower[1]; lower[1]=upper[1]; upper[1]=xdum;}
1833 // vstart[1] = 0.5*(lower[1]+upper[1]);
1836 fSeg[1]->GetPadI(fXInit[1], fYInit[1], fZPlane, ix, iy);
1837 isec=fSeg[1]->Sector(ix, iy);
1838 dpx=fSeg[1]->Dpx(isec);
1839 fSeg[0]->GetPadI(fXInit[1], fYInit[1], fZPlane, ix, iy);
1840 isec=fSeg[0]->Sector(ix, iy);
1841 dpy=fSeg[0]->Dpy(isec);
1844 // Find save upper and lower limits
1848 for (fSeg[1]->FirstPad(fXInit[1], fYInit[1], fZPlane, dpx, 0);
1849 fSeg[1]->MorePads(); fSeg[1]->NextPad())
1851 ix=fSeg[1]->Ix(); iy=fSeg[1]->Iy();
1852 // if (fHitMap[1]->TestHit(ix, iy) == kEmpty) continue;
1853 fSeg[1]->GetPadC(ix,iy,upper[2],ydum,zdum);
1854 if (icount ==0) lower[2]=upper[2];
1857 if (lower[2]>upper[2]) {xdum=lower[2]; lower[2]=upper[2]; upper[2]=xdum;}
1858 // vstart[2] = 0.5*(lower[2]+upper[2]);
1862 for (fSeg[0]->FirstPad(fXInit[1], fYInit[1], fZPlane, 0, dpy);
1863 fSeg[0]-> MorePads(); fSeg[0]->NextPad())
1865 ix=fSeg[0]->Ix(); iy=fSeg[0]->Iy();
1866 // if (fHitMap[0]->TestHit(ix, iy) != kEmpty) continue;
1868 fSeg[0]->GetPadC(ix,iy,xdum,upper[3],zdum);
1869 if (icount ==0) lower[3]=upper[3];
1873 if (lower[3]>upper[3]) {xdum=lower[3]; lower[3]=upper[3]; upper[3]=xdum;}
1875 // vstart[3] = 0.5*(lower[3]+upper[3]);
1883 static Double_t step[6]={0.0005, 0.0005, 0.0005, 0.0005, 0.001, 0.001};
1884 clusterInput.Fitter()->mnparm(0,"x1",vstart[0],step[0],lower[0],upper[0],ierflag);
1885 clusterInput.Fitter()->mnparm(1,"y1",vstart[1],step[1],lower[1],upper[1],ierflag);
1886 clusterInput.Fitter()->mnparm(2,"x2",vstart[2],step[2],lower[2],upper[2],ierflag);
1887 clusterInput.Fitter()->mnparm(3,"y2",vstart[3],step[3],lower[3],upper[3],ierflag);
1888 clusterInput.Fitter()->mnparm(4,"a0",vstart[4],step[4],lower[4],upper[4],ierflag);
1889 clusterInput.Fitter()->mnparm(5,"a1",vstart[5],step[5],lower[5],upper[5],ierflag);
1890 // ready for minimisation
1891 clusterInput.Fitter()->SetPrintLevel(-1+fDebugLevel);
1893 clusterInput.Fitter()->mnexcm("SET NOW", arglist, 0, ierflag);
1894 clusterInput.Fitter()->mnexcm("SET OUT", arglist, 0, ierflag);
1898 clusterInput.Fitter()->mnexcm("SET NOGR", arglist, 0, ierflag);
1899 clusterInput.Fitter()->mnexcm("MIGRAD", arglist, 0, ierflag);
1900 clusterInput.Fitter()->mnexcm("EXIT" , arglist, 0, ierflag);
1901 // Get fitted parameters
1903 Double_t epxz, b1, b2;
1905 clusterInput.Fitter()->mnpout(0, chname, fXFit[0], epxz, b1, b2, ierflg);
1906 clusterInput.Fitter()->mnpout(1, chname, fYFit[0], epxz, b1, b2, ierflg);
1907 clusterInput.Fitter()->mnpout(2, chname, fXFit[1], epxz, b1, b2, ierflg);
1908 clusterInput.Fitter()->mnpout(3, chname, fYFit[1], epxz, b1, b2, ierflg);
1909 clusterInput.Fitter()->mnpout(4, chname, fQrFit[0], epxz, b1, b2, ierflg);
1910 clusterInput.Fitter()->mnpout(5, chname, fQrFit[1], epxz, b1, b2, ierflg);
1912 Double_t fmin, fedm, errdef;
1913 Int_t npari, nparx, istat;
1915 clusterInput.Fitter()->mnstat(fmin, fedm, errdef, npari, nparx, istat);
1923 void AliMUONClusterFinderVS::Split(AliMUONRawCluster* c)
1926 // One cluster for each maximum
1929 AliMUONClusterInput& clusterInput = *(AliMUONClusterInput::Instance());
1930 for (j=0; j<2; j++) {
1931 AliMUONRawCluster cnew;
1932 cnew.fGhost=c->fGhost;
1933 for (cath=0; cath<2; cath++) {
1934 cnew.fChi2[cath]=fChi2[0];
1935 // ?? why not cnew.fChi2[cath]=fChi2[cath];
1938 cnew.fNcluster[0]=-1;
1939 cnew.fNcluster[1]=fNRawClusters;
1941 cnew.fNcluster[0]=fNPeaks;
1942 cnew.fNcluster[1]=0;
1944 cnew.fMultiplicity[cath]=0;
1945 cnew.fX[cath]=Float_t(fXFit[j]);
1946 cnew.fY[cath]=Float_t(fYFit[j]);
1947 cnew.fZ[cath]=fZPlane;
1949 cnew.fQ[cath]=Int_t(clusterInput.TotalCharge(cath)*fQrFit[cath]);
1951 cnew.fQ[cath]=Int_t(clusterInput.TotalCharge(cath)*(1-fQrFit[cath]));
1953 fSeg[cath]->SetHit(fXFit[j],fYFit[j],fZPlane);
1954 for (i=0; i<fMul[cath]; i++) {
1955 cnew.fIndexMap[cnew.fMultiplicity[cath]][cath]=
1956 c->fIndexMap[i][cath];
1957 fSeg[cath]->SetPad(fIx[i][cath], fIy[i][cath]);
1958 Float_t q1=fInput->Response()->IntXY(fSeg[cath]);
1959 cnew.fContMap[i][cath]
1960 =(q1*Float_t(cnew.fQ[cath]))/Float_t(fQ[i][cath]);
1961 cnew.fMultiplicity[cath]++;
1963 FillCluster(&cnew,0,cath);
1966 cnew.fClusterType=cnew.PhysicsContribution();
1967 if (cnew.fQ[0]>0 && cnew.fQ[1]>0) AddRawCluster(cnew);
1974 // Minimisation functions
1976 void fcnS1(Int_t & /*npar*/, Double_t * /*gin*/, Double_t &f, Double_t *par, Int_t /*iflag*/)
1978 AliMUONClusterInput& clusterInput = *(AliMUONClusterInput::Instance());
1985 for (i=0; i<clusterInput.Nmul(0); i++) {
1986 Float_t q0=clusterInput.Charge(i,0);
1987 Float_t q1=clusterInput.DiscrChargeS1(i,par);
1996 void fcnCombiS1(Int_t & /*npar*/, Double_t * /*gin*/, Double_t &f, Double_t *par, Int_t /*iflag*/)
1998 AliMUONClusterInput& clusterInput = *(AliMUONClusterInput::Instance());
2005 for (cath=0; cath<2; cath++) {
2006 for (i=0; i<clusterInput.Nmul(cath); i++) {
2007 Float_t q0=clusterInput.Charge(i,cath);
2008 Float_t q1=clusterInput.DiscrChargeCombiS1(i,par,cath);
2019 void fcnS2(Int_t & /*npar*/, Double_t * /*gin*/, Double_t &f, Double_t *par, Int_t /*iflag*/)
2021 AliMUONClusterInput& clusterInput = *(AliMUONClusterInput::Instance());
2028 for (i=0; i<clusterInput.Nmul(0); i++) {
2030 Float_t q0=clusterInput.Charge(i,0);
2031 Float_t q1=clusterInput.DiscrChargeS2(i,par);
2041 void fcnCombiS2(Int_t & /*npar*/, Double_t * /*gin*/, Double_t &f, Double_t *par, Int_t /*iflag*/)
2043 AliMUONClusterInput& clusterInput = *(AliMUONClusterInput::Instance());
2049 for (cath=0; cath<2; cath++) {
2050 for (i=0; i<clusterInput.Nmul(cath); i++) {
2051 Float_t q0=clusterInput.Charge(i,cath);
2052 Float_t q1=clusterInput.DiscrChargeCombiS2(i,par,cath);
2062 void AliMUONClusterFinderVS::AddRawCluster(const AliMUONRawCluster c)
2065 // Add a raw cluster copy to the list
2067 AliMUON *pMUON=(AliMUON*)gAlice->GetModule("MUON");
2068 pMUON->GetMUONData()->AddRawCluster(fInput->Chamber(),c);
2071 fprintf(stderr,"\nfNRawClusters %d\n",fNRawClusters);
2074 Bool_t AliMUONClusterFinderVS::TestTrack(Int_t t) {
2075 // Test if track was user selected
2076 if (fTrack[0]==-1 || fTrack[1]==-1) {
2078 } else if (t==fTrack[0] || t==fTrack[1]) {
2085 AliMUONClusterFinderVS& AliMUONClusterFinderVS
2086 ::operator = (const AliMUONClusterFinderVS& /*rhs*/)
2088 // Dummy assignment operator