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 //-----------------------------------------------------------------------------
19 /// \class AliMUONClusterSplitterMLEM
21 /// Splitter class for the MLEM algorithm. Performs fitting procedure
22 /// with up to 3 hit candidates and tries to split clusters if the number
23 /// of candidates exceeds 3.
25 /// \author Laurent Aphecetche (for the "new" C++ structure) and
26 /// Alexander Zinchenko, JINR Dubna, for the hardcore of it ;-)
27 //-----------------------------------------------------------------------------
29 #include "AliMUONClusterSplitterMLEM.h"
30 #include "AliMUONClusterFinderMLEM.h" // for status flag constants
32 #include "AliMUONCluster.h"
33 #include "AliMUONPad.h"
34 #include "AliMUONPad.h"
35 #include "AliMUONConstants.h"
36 #include "AliMpDEManager.h"
37 #include "AliMUONMathieson.h"
39 #include "AliMpEncodePair.h"
43 #include <TClonesArray.h>
47 #include <TObjArray.h>
49 #include <Riostream.h>
52 ClassImp(AliMUONClusterSplitterMLEM)
55 //const Double_t AliMUONClusterSplitterMLEM::fgkCouplMin = 1.e-3; // threshold on coupling
56 const Double_t AliMUONClusterSplitterMLEM::fgkCouplMin = 1.e-2; // threshold on coupling
58 //_____________________________________________________________________________
59 AliMUONClusterSplitterMLEM::AliMUONClusterSplitterMLEM(Int_t detElemId,
64 fDetElemId(detElemId),
72 AliMq::Station12Type stationType = AliMpDEManager::GetStation12Type(fDetElemId);
74 Float_t kx3 = AliMUONConstants::SqrtKx3();
75 Float_t ky3 = AliMUONConstants::SqrtKy3();
76 Float_t pitch = AliMUONConstants::Pitch();
78 if ( stationType == AliMq::kStation1 )
80 kx3 = AliMUONConstants::SqrtKx3St1();
81 ky3 = AliMUONConstants::SqrtKy3St1();
82 pitch = AliMUONConstants::PitchSt1();
85 fMathieson = new AliMUONMathieson;
87 fMathieson->SetPitch(pitch);
88 fMathieson->SetSqrtKx3AndDeriveKx2Kx4(kx3);
89 fMathieson->SetSqrtKy3AndDeriveKy2Ky4(ky3);
93 //_____________________________________________________________________________
94 AliMUONClusterSplitterMLEM::~AliMUONClusterSplitterMLEM()
101 //_____________________________________________________________________________
103 AliMUONClusterSplitterMLEM::AddBin(TH2 *mlem,
104 Int_t ic, Int_t jc, Int_t mode,
105 Bool_t *used, TObjArray *pix)
107 /// Add a bin to the cluster
109 Int_t nx = mlem->GetNbinsX();
110 Int_t ny = mlem->GetNbinsY();
111 Double_t cont1, cont = mlem->GetCellContent(jc,ic);
112 AliMUONPad *pixPtr = 0;
114 Int_t ie = TMath::Min(ic+1,ny), je = TMath::Min(jc+1,nx);
115 for (Int_t i = TMath::Max(ic-1,1); i <= ie; ++i) {
116 for (Int_t j = TMath::Max(jc-1,1); j <= je; ++j) {
117 if (i != ic && j != jc) continue;
118 if (used[(i-1)*nx+j-1]) continue;
119 cont1 = mlem->GetCellContent(j,i);
120 if (mode && cont1 > cont) continue;
121 used[(i-1)*nx+j-1] = kTRUE;
122 if (cont1 < 0.5) continue;
123 if (pix) pix->Add(BinToPix(mlem,j,i));
125 pixPtr = new AliMUONPad (mlem->GetXaxis()->GetBinCenter(j),
126 mlem->GetYaxis()->GetBinCenter(i), 0, 0, cont1);
127 fPixArray->Add(pixPtr);
129 AddBin(mlem, i, j, mode, used, pix); // recursive call
134 //_____________________________________________________________________________
136 AliMUONClusterSplitterMLEM::AddCluster(Int_t ic, Int_t nclust,
138 Bool_t *used, Int_t *clustNumb, Int_t &nCoupled)
140 /// Add a cluster to the group of coupled clusters
142 for (Int_t i = 0; i < nclust; ++i) {
143 if (used[i]) continue;
144 if (aijcluclu(i,ic) < fgkCouplMin) continue;
146 clustNumb[nCoupled++] = i;
147 AddCluster(i, nclust, aijcluclu, used, clustNumb, nCoupled);
151 //_____________________________________________________________________________
153 AliMUONClusterSplitterMLEM::BinToPix(TH2 *mlem,
156 /// Translate histogram bin to pixel
158 Double_t yc = mlem->GetYaxis()->GetBinCenter(ic);
159 Double_t xc = mlem->GetXaxis()->GetBinCenter(jc);
161 Int_t nPix = fPixArray->GetEntriesFast();
162 AliMUONPad *pixPtr = NULL;
164 // Compare pixel and bin positions
165 for (Int_t i = 0; i < nPix; ++i) {
166 pixPtr = (AliMUONPad*) fPixArray->UncheckedAt(i);
167 if (pixPtr->Charge() < 0.5) continue;
168 if (TMath::Abs(pixPtr->Coord(0)-xc)<1.e-4 && TMath::Abs(pixPtr->Coord(1)-yc)<1.e-4)
170 //return (TObject*) pixPtr;
174 AliError(Form(" Something wrong ??? %f %f ", xc, yc));
178 //_____________________________________________________________________________
180 AliMUONClusterSplitterMLEM::ChargeIntegration(Double_t x, Double_t y,
181 const AliMUONPad& pad)
183 /// Compute the Mathieson integral on pad area, assuming the center
184 /// of the Mathieson is at (x,y)
186 TVector2 lowerLeft(TVector2(x,y)-pad.Position()-pad.Dimensions());
187 TVector2 upperRight(lowerLeft + pad.Dimensions()*2.0);
189 return fMathieson->IntXY(lowerLeft.X(),lowerLeft.Y(),
190 upperRight.X(),upperRight.Y());
193 //_____________________________________________________________________________
195 AliMUONClusterSplitterMLEM::Fcn1(const AliMUONCluster& cluster,
196 Int_t & /*fNpar*/, Double_t * /*gin*/,
197 Double_t &f, Double_t *par, Int_t iflag)
199 /// Computes the functional to be minimized
202 Double_t charge, delta, coef=0, chi2=0, qTot = 0;
203 static Double_t qAver = 0;
205 Int_t mult = cluster.Multiplicity(), iend = fNpar / 3;
206 for (Int_t j = 0; j < mult; ++j)
208 AliMUONPad* pad = cluster.Pad(j);
209 //if ( pad->Status() !=1 || pad->IsSaturated() ) continue;
210 if ( pad->Status() != AliMUONClusterFinderMLEM::GetUseForFitFlag()) continue;
212 if ( pad->IsReal() ) npads++; // exclude virtual pads
213 qTot += pad->Charge();
216 for (Int_t i = 0; i <= iend; ++i)
220 coef = Param2Coef(i, coef, par);
221 charge += ChargeIntegration(par[indx],par[indx+1],*pad) * coef;
224 delta = charge - pad->Charge();
226 delta /= pad->Charge();
229 if (iflag == 0) qAver = qTot / npads;
233 //_____________________________________________________________________________
234 Double_t AliMUONClusterSplitterMLEM::Param2Coef(Int_t icand, Double_t coef, Double_t *par)
236 /// Extract hit contribution scale factor from fit parameters
238 if (fNpar == 2) return 1.;
239 if (fNpar == 5) return icand==0 ? par[2] : TMath::Max(1.-par[2],0.);
240 if (icand == 0) return par[2];
241 if (icand == 1) return TMath::Max((1.-par[2])*par[5], 0.);
242 return TMath::Max(1.-par[2]-coef,0.);
245 //_____________________________________________________________________________
247 AliMUONClusterSplitterMLEM::Fit(const AliMUONCluster& cluster,
248 Int_t iSimple, Int_t nfit,
249 Int_t *clustFit, TObjArray **clusters,
251 TObjArray& clusterList, TH2 *mlem)
253 /// Steering function and fitting procedure for the fit of pad charge distribution
255 // AliDebug(2,Form("iSimple=%d nfit=%d",iSimple,nfit));
257 Double_t xmin = mlem->GetXaxis()->GetXmin() - mlem->GetXaxis()->GetBinWidth(1);
258 Double_t xmax = mlem->GetXaxis()->GetXmax() + mlem->GetXaxis()->GetBinWidth(1);
259 Double_t ymin = mlem->GetYaxis()->GetXmin() - mlem->GetYaxis()->GetBinWidth(1);
260 Double_t ymax = mlem->GetYaxis()->GetXmax() + mlem->GetYaxis()->GetBinWidth(1);
261 Double_t xPad = 0, yPad = 99999;
263 // Number of pads to use and number of virtual pads
264 Int_t npads = 0, nVirtual = 0, nfit0 = nfit;
265 //cluster.Print("full");
266 Int_t mult = cluster.Multiplicity();
267 for (Int_t i = 0; i < mult; ++i )
269 AliMUONPad* pad = cluster.Pad(i);
270 if ( !pad->IsReal() ) ++nVirtual;
271 //if ( pad->Status() !=1 || pad->IsSaturated() ) continue;
272 if ( pad->Status() != AliMUONClusterFinderMLEM::GetUseForFitFlag() ) continue;
283 if (pad->DY() < pad->DX() )
298 if (npads < 2) return 0;
300 // FIXME : AliWarning("Reconnect the following code for hit/track passing ?");
302 // Int_t tracks[3] = {-1, -1, -1};
306 AliMUONDigit *mdig = 0;
307 for (Int_t cath=0; cath<2; cath++) {
308 for (Int_t i=0; i<fnPads[0]+fnPads[1]; i++) {
309 if (fPadIJ[0][i] != cath) continue;
310 if (fPadIJ[1][i] != 1) continue;
311 if (fXyq[3][i] < 0) continue; // exclude virtual pads
312 digit = TMath::Nint (fXyq[5][i]);
313 if (digit >= 0) mdig = fInput->Digit(cath,digit);
314 else mdig = fInput->Digit(TMath::Even(cath),-digit-1);
315 //if (!mdig) mdig = fInput->Digit(TMath::Even(cath),digit);
316 if (!mdig) continue; // protection for cluster display
317 if (mdig->Hit() >= 0) {
319 tracks[0] = mdig->Hit();
320 tracks[1] = mdig->Track(0);
321 } else if (mdig->Track(0) < tracks[1]) {
322 tracks[0] = mdig->Hit();
323 tracks[1] = mdig->Track(0);
326 if (mdig->Track(1) >= 0 && mdig->Track(1) != tracks[1]) {
327 if (tracks[2] < 0) tracks[2] = mdig->Track(1);
328 else tracks[2] = TMath::Min (tracks[2], mdig->Track(1));
331 } // for (Int_t cath=0;
334 // Get number of pads in X and Y
335 //const Int_t kStatusToTest(1);
336 const Int_t kStatusToTest(AliMUONClusterFinderMLEM::GetUseForFitFlag());
338 Long_t nofPads = cluster.NofPads(kStatusToTest);
339 Int_t nInX = AliMp::PairFirst(nofPads);
340 Int_t nInY = AliMp::PairSecond(nofPads);
344 for (Int_t j = 0; j < cluster.Multiplicity(); ++j) {
345 AliMUONPad *pad = cluster.Pad(j);
346 //if (pad->Status() == 1 && !pad->IsSaturated()) npadOK++;
347 if (pad->Status() == AliMUONClusterFinderMLEM::GetUseForFitFlag() && !pad->IsSaturated()) npadOK++;
349 cout << " Number of pads to fit: " << npadOK << endl;
350 cout << " nInX and Y: " << nInX << " " << nInY << endl;
354 nfitMax = TMath::Min (nfitMax, (npads + 1) / 3);
356 if (((nInX < 3) && (nInY < 3)) || ((nInX == 3) && (nInY < 3)) || ((nInX < 3) && (nInY == 3))) nfitMax = 1; // not enough pads in each direction
358 if (nfit > nfitMax) nfit = nfitMax;
360 // Take cluster maxima as fitting seeds
364 Double_t cont, cmax = 0, xseed = 0, yseed = 0, errOk[8], qq = 0;
365 Double_t xyseed[3][2], qseed[3], xyCand[3][2] = {{0},{0}}, sigCand[3][2] = {{0},{0}};
367 for (Int_t ifit = 1; ifit <= nfit0; ++ifit)
370 pix = clusters[clustFit[ifit-1]];
371 npxclu = pix->GetEntriesFast();
373 for (Int_t clu = 0; clu < npxclu; ++clu)
375 pixPtr = (AliMUONPad*) pix->UncheckedAt(clu);
376 cont = pixPtr->Charge();
381 xseed = pixPtr->Coord(0);
382 yseed = pixPtr->Coord(1);
385 xyCand[0][0] += pixPtr->Coord(0) * cont;
386 xyCand[0][1] += pixPtr->Coord(1) * cont;
387 sigCand[0][0] += pixPtr->Coord(0) * pixPtr->Coord(0) * cont;
388 sigCand[0][1] += pixPtr->Coord(1) * pixPtr->Coord(1) * cont;
390 xyseed[ifit-1][0] = xseed;
391 xyseed[ifit-1][1] = yseed;
392 qseed[ifit-1] = cmax;
393 } // for (Int_t ifit=1;
395 xyCand[0][0] /= qq; // <x>
396 xyCand[0][1] /= qq; // <y>
397 sigCand[0][0] = sigCand[0][0]/qq - xyCand[0][0]*xyCand[0][0]; // <x^2> - <x>^2
398 sigCand[0][0] = sigCand[0][0] > 0 ? TMath::Sqrt (sigCand[0][0]) : 0;
399 sigCand[0][1] = sigCand[0][1]/qq - xyCand[0][1]*xyCand[0][1]; // <y^2> - <y>^2
400 sigCand[0][1] = sigCand[0][1] > 0 ? TMath::Sqrt (sigCand[0][1]) : 0;
401 if (fDebug) cout << xyCand[0][0] << " " << xyCand[0][1] << " " << sigCand[0][0] << " " << sigCand[0][1] << endl;
403 Int_t nDof, maxSeed[3];//, nMax = 0;
405 TMath::Sort(nfit0, qseed, maxSeed, kTRUE); // in decreasing order
407 Double_t step[3]={0.01,0.002,0.02}, fmin, chi2o = 9999, chi2n;
408 Double_t *gin = 0, func0, func1, param[8], step0[8];
409 Double_t param0[2][8]={{0},{0}}, deriv[2][8]={{0},{0}};
410 Double_t shift[8], stepMax, derMax, parmin[8], parmax[8], func2[2], shift0;
411 Double_t delta[8], scMax, dder[8], estim, shiftSave = 0;
412 Int_t min, max, nCall = 0, nLoop, idMax = 0, iestMax = 0, nFail;
413 Double_t rad, dist[3] = {0};
415 // Try to fit with one-track hypothesis, then 2-track. If chi2/dof is
416 // lower, try 3-track (if number of pads is sufficient).
417 Int_t iflag = 0; // for the first call of fcn1
418 for (Int_t iseed = 0; iseed < nfit; ++iseed)
421 Int_t memory[8] = {0};
424 for (Int_t j = 0; j < fNpar; ++j)
435 param[fNpar] = xyCand[0][0]; // take COG
439 param[fNpar] = xyseed[maxSeed[iseed]][0];
440 //param[fNpar] = fNpar==0 ? -16.1651 : -15.2761;
442 parmin[fNpar] = xmin;
443 parmax[fNpar++] = xmax;
446 param[fNpar] = xyCand[0][1]; // take COG
450 param[fNpar] = xyseed[maxSeed[iseed]][1];
451 //param[fNpar] = fNpar==1 ? -15.1737 : -15.8487;
453 parmin[fNpar] = ymin;
454 parmax[fNpar++] = ymax;
456 for (Int_t j = 0; j < fNpar; ++j)
458 step0[j] = shift[j] = step[j%3];
463 for (Int_t j = 0; j < fNpar; ++j)
469 for (Int_t j = 0; j < fNpar; ++j) cout << param[j] << " ";
474 min = nLoop = 1; stepMax = func2[1] = derMax = 999999; nFail = 0;
479 Fcn1(cluster,fNpar, gin, func0, param, iflag); nCall++;
481 //cout << " Func: " << func0 << endl;
484 for (Int_t j = 0; j < fNpar; ++j)
486 param0[max][j] = param[j];
488 param[j] += delta[j] / 10;
489 if (j > 0) param[j-1] -= delta[j-1] / 10;
490 Fcn1(cluster,fNpar, gin, func1, param, iflag); nCall++;
491 deriv[max][j] = (func1 - func0) / delta[j] * 10; // first derivative
492 //cout << j << " " << deriv[max][j] << endl;
493 dder[j] = param0[0][j] != param0[1][j] ? (deriv[0][j] - deriv[1][j]) /
494 (param0[0][j] - param0[1][j]) : 0; // second derivative
496 param[fNpar-1] -= delta[fNpar-1] / 10;
497 if (nCall > 2000) break;
499 min = func2[0] < func2[1] ? 0 : 1;
500 nFail = min == max ? 0 : nFail + 1;
502 stepMax = derMax = estim = 0;
503 for (Int_t j = 0; j < fNpar; ++j)
505 // Estimated distance to minimum
509 shift[j] = TMath::Sign (step0[j], -deriv[max][j]); // first step
511 else if (TMath::Abs(deriv[0][j]) < 1.e-3 && TMath::Abs(deriv[1][j]) < 1.e-3)
515 else if (((deriv[min][j]*deriv[!min][j] > 0) && (TMath::Abs(deriv[min][j]) > TMath::Abs(deriv[!min][j])))
516 || (TMath::Abs(deriv[0][j]-deriv[1][j]) < 1.e-3) || (TMath::Abs(dder[j]) < 1.e-6))
518 shift[j] = -TMath::Sign (shift[j], (func2[0]-func2[1]) * (param0[0][j]-param0[1][j]));
530 shift[j] = dder[j] != 0 ? -deriv[min][j] / dder[j] : 0;
534 Double_t es = TMath::Abs(shift[j]) / step0[j];
542 if (TMath::Abs(shift[j])/step0[j] > 10) shift[j] = TMath::Sign(10.,shift[j]) * step0[j]; //
544 // Failed to improve minimum
548 param[j] = param0[min][j];
549 if (TMath::Abs(shift[j]+shift0) > 0.1*step0[j])
551 shift[j] = (shift[j] + shift0) / 2;
560 if (TMath::Abs(shift[j]*deriv[min][j]) > func2[min])
562 shift[j] = TMath::Sign (func2[min]/deriv[min][j], shift[j]);
565 // Introduce step relaxation factor
568 scMax = 1 + 4 / TMath::Max(nLoop/2.,1.);
569 if (TMath::Abs(shift0) > 0 && TMath::Abs(shift[j]/shift0) > scMax)
571 shift[j] = TMath::Sign (shift0*scMax, shift[j]);
574 param[j] += shift[j];
575 // Check parameter limits
576 if (param[j] < parmin[j])
578 shift[j] = parmin[j] - param[j];
579 param[j] = parmin[j];
581 else if (param[j] > parmax[j])
583 shift[j] = parmax[j] - param[j];
584 param[j] = parmax[j];
586 //cout << " xxx " << j << " " << shift[j] << " " << param[j] << endl;
587 stepMax = TMath::Max (stepMax, TMath::Abs(shift[j]/step0[j]));
588 if (TMath::Abs(deriv[min][j]) > derMax)
591 derMax = TMath::Abs (deriv[min][j]);
593 } // for (Int_t j=0; j<fNpar;
595 if (((estim < 1) && (derMax < 2)) || nLoop > 150) break; // minimum was found
599 // Check for small step
600 if (shift[idMax] == 0)
602 shift[idMax] = step0[idMax]/10;
603 param[idMax] += shift[idMax];
607 if (!memory[idMax] && derMax > 0.5 && nLoop > 10)
609 if (dder[idMax] != 0 && TMath::Abs(deriv[min][idMax]/dder[idMax]/shift[idMax]) > 10)
611 if (min == max) dder[idMax] = -dder[idMax];
612 shift[idMax] = -deriv[min][idMax] / dder[idMax] / 10;
613 param[idMax] += shift[idMax];
614 stepMax = TMath::Max (stepMax, TMath::Abs(shift[idMax])/step0[idMax]);
615 if (min == max) shiftSave = shift[idMax];
619 param[idMax] -= shift[idMax];
620 shift[idMax] = 4 * shiftSave * (gRandom->Rndm(0) - 0.5);
621 param[idMax] += shift[idMax];
628 nDof = npads - fNpar + nVirtual;
631 if (fDebug) cout << " Chi2 " << chi2n << " " << fNpar << endl;
633 //if (fNpar > 2) cout << param0[min][fNpar-3] << " " << chi2n * (1+TMath::Min(1-param0[min][fNpar-3],0.25)) << endl;
634 //if (chi2n*1.2+1.e-6 > chi2o )
635 if (fNpar > 2 && (chi2n > chi2o || ((iseed == nfit-1)
636 && (chi2n * (1+TMath::Min(1-param0[min][fNpar-3],0.25)) > chi2o))))
637 { fNpar -= 3; break; }
639 // Save parameters and errors
642 // One pad per direction
643 //for (Int_t i=0; i<fNpar; ++i) if (i == 0 || i == 2 || i == 5) param0[min][i] = xPad;
644 for (Int_t i=0; i<fNpar; ++i) if (i == 0 || i == 2 || i == 5)
645 param0[min][i] = xyCand[0][0];
648 // One pad per direction
649 //for (Int_t i=0; i<fNpar; ++i) if (i == 1 || i == 3 || i == 6) param0[min][i] = yPad;
650 for (Int_t i=0; i<fNpar; ++i) if (i == 1 || i == 3 || i == 6)
651 param0[min][i] = xyCand[0][1];
656 // Find distance to the nearest neighbour
657 dist[0] = dist[1] = TMath::Sqrt ((param0[min][0]-param0[min][2])*
658 (param0[min][0]-param0[min][2])
659 +(param0[min][1]-param0[min][3])*
660 (param0[min][1]-param0[min][3]));
662 dist[2] = TMath::Sqrt ((param0[min][0]-param0[min][5])*
663 (param0[min][0]-param0[min][5])
664 +(param0[min][1]-param0[min][6])*
665 (param0[min][1]-param0[min][6]));
666 rad = TMath::Sqrt ((param0[min][2]-param0[min][5])*
667 (param0[min][2]-param0[min][5])
668 +(param0[min][3]-param0[min][6])*
669 (param0[min][3]-param0[min][6]));
670 if (dist[2] < dist[0]) dist[0] = dist[2];
671 if (rad < dist[1]) dist[1] = rad;
672 if (rad < dist[2]) dist[2] = rad;
674 cout << dist[0] << " " << dist[1] << " " << dist[2] << endl;
675 if (dist[TMath::LocMin(iseed+1,dist)] < 1.) { fNpar -= 3; break; }
679 for (Int_t i = 0; i < fNpar; ++i) {
680 parOk[i] = param0[min][i];
684 parOk[i] = TMath::Max (parOk[i], parmin[i]);
685 parOk[i] = TMath::Min (parOk[i], parmax[i]);
689 if (fmin < 0.1) break; // !!!???
690 } // for (Int_t iseed=0;
693 for (Int_t i=0; i<fNpar; ++i) {
694 if (i == 4 || i == 7) {
695 if ((i == 7) || ((i == 4) && (fNpar < 7))) cout << parOk[i] << endl;
696 else cout << parOk[i] * (1-parOk[7]) << endl;
699 cout << parOk[i] << " " << errOk[i] << endl;
702 nfit = (fNpar + 1) / 3;
703 dist[0] = dist[1] = dist[2] = 0;
706 // Find distance to the nearest neighbour
707 dist[0] = dist[1] = TMath::Sqrt ((parOk[0]-parOk[2])*
709 +(parOk[1]-parOk[3])*
710 (parOk[1]-parOk[3]));
712 dist[2] = TMath::Sqrt ((parOk[0]-parOk[5])*
714 +(parOk[1]-parOk[6])*
715 (parOk[1]-parOk[6]));
716 rad = TMath::Sqrt ((parOk[2]-parOk[5])*
718 +(parOk[3]-parOk[6])*
719 (parOk[3]-parOk[6]));
720 if (dist[2] < dist[0]) dist[0] = dist[2];
721 if (rad < dist[1]) dist[1] = rad;
722 if (rad < dist[2]) dist[2] = rad;
729 if (iSimple) fnCoupled = 0;
730 for (Int_t j = 0; j < nfit; ++j) {
732 coef = Param2Coef(j, coef, parOk);
734 //void AliMUONClusterFinderMLEM::AddRawCluster(Double_t x, Double_t y,
735 // Double_t qTot, Double_t fmin,
736 // Int_t nfit, Int_t *tracks,
737 // Double_t /*sigx*/,
738 // Double_t /*sigy*/,
739 // Double_t /*dist*/)
741 if ( coef*fQtot >= 14 )
743 //AZ AliMUONCluster* cluster1 = new AliMUONCluster();
744 AliMUONCluster* cluster1 = new AliMUONCluster(cluster);
746 cluster1->SetCharge(coef*fQtot,coef*fQtot);
747 cluster1->SetPosition(TVector2(parOk[indx],parOk[indx+1]),TVector2(sigCand[0][0],sigCand[0][1]));
748 cluster1->SetChi2(dist[TMath::LocMin(nfit,dist)]);
750 // FIXME: we miss some information in this cluster, as compared to
751 // the original AddRawCluster code.
753 AliDebug(2,Form("Adding RawCluster detElemId %4d mult %2d charge %5d (xl,yl)=(%9.6g,%9.6g)",
754 fDetElemId,cluster1->Multiplicity(),(Int_t)cluster1->Charge(),
755 cluster1->Position().X(),cluster1->Position().Y()));
757 clusterList.Add(cluster1);
759 // AddRawCluster (parOk[indx], // double x
760 // parOk[indx+1], // double y
761 // coef*qTot, // double charge
762 // errOk[indx], // double fmin
763 // nfit0+10*nfit+100*nMax+10000*fnCoupled, // int nfit
764 // tracks, // int* tracks
765 // sigCand[0][0], // double sigx
766 // sigCand[0][1], // double sigy
767 // dist[TMath::LocMin(nfit,dist)] // double dist
774 //_____________________________________________________________________________
776 AliMUONClusterSplitterMLEM::Split(const AliMUONCluster& cluster,
777 TH2 *mlem, Double_t *coef,
778 TObjArray& clusterList)
780 /// The main steering function to work with clusters of pixels in anode
781 /// plane (find clusters, decouple them from each other, merge them (if
782 /// necessary), pick up coupled pads, call the fitting function)
784 Int_t nx = mlem->GetNbinsX();
785 Int_t ny = mlem->GetNbinsY();
786 Int_t nPix = fPixArray->GetEntriesFast();
789 Int_t nclust = 0, indx, indx1, nxy = ny * nx;
790 Bool_t *used = new Bool_t[nxy];
792 for (Int_t j = 0; j < nxy; ++j) used[j] = kFALSE;
794 TObjArray *clusters[200]={0};
797 // Find clusters of histogram bins (easier to work in 2-D space)
798 for (Int_t i = 1; i <= ny; ++i)
800 for (Int_t j = 1; j <= nx; ++j)
802 indx = (i-1)*nx + j - 1;
803 if (used[indx]) continue;
804 cont = mlem->GetCellContent(j,i);
805 if (cont < 0.5) continue;
806 pix = new TObjArray(20);
808 pix->Add(BinToPix(mlem,j,i));
809 AddBin(mlem, i, j, 0, used, pix); // recursive call
810 if (nclust >= 200) AliFatal(" Too many clusters !!!");
811 clusters[nclust++] = pix;
812 } // for (Int_t j=1; j<=nx; j++) {
813 } // for (Int_t i=1; i<=ny;
814 if (fDebug) cout << nclust << endl;
817 // Compute couplings between clusters and clusters to pads
818 Int_t npad = cluster.Multiplicity();
820 // Exclude pads with overflows
822 for (Int_t j = 0; j < npad; ++j)
824 AliMUONPad* pad = cluster.Pad(j);
825 if ( pad->IsSaturated() )
836 // Compute couplings of clusters to pads (including overflows)
837 TMatrixD aijclupad(nclust,npad);
840 for (Int_t iclust = 0; iclust < nclust; ++iclust)
842 pix = clusters[iclust];
843 npxclu = pix->GetEntriesFast();
844 for (Int_t i = 0; i < npxclu; ++i)
846 indx = fPixArray->IndexOf(pix->UncheckedAt(i));
847 for (Int_t j = 0; j < npad; ++j)
849 //AliMUONPad* pad = cluster.Pad(j);
850 //if ( pad->Status() < 0 && pad->Status() != -5) continue;
851 if (coef[j*nPix+indx] < fgkCouplMin) continue;
852 aijclupad(iclust,j) += coef[j*nPix+indx];
857 // Compute couplings between clusters (exclude overflows)
858 TMatrixD aijcluclu(nclust,nclust);
860 for (Int_t iclust = 0; iclust < nclust; ++iclust)
862 for (Int_t j = 0; j < npad; ++j)
865 //if ( cluster.Pad(j)->Status() < 0) continue;
866 if ( cluster.Pad(j)->IsSaturated()) continue;
867 if (aijclupad(iclust,j) < fgkCouplMin) continue;
868 for (Int_t iclust1=iclust+1; iclust1<nclust; iclust1++)
870 if (aijclupad(iclust1,j) < fgkCouplMin) continue;
871 aijcluclu(iclust,iclust1) +=
872 TMath::Sqrt (aijclupad(iclust,j)*aijclupad(iclust1,j));
876 for (Int_t iclust = 0; iclust < nclust; ++iclust)
878 for (Int_t iclust1 = iclust+1; iclust1 < nclust; ++iclust1)
880 aijcluclu(iclust1,iclust) = aijcluclu(iclust,iclust1);
884 if (fDebug && nclust > 1) aijcluclu.Print();
886 // Find groups of coupled clusters
887 used = new Bool_t[nclust];
888 for (Int_t j = 0; j < nclust; ++j) used[j] = kFALSE;
890 Int_t *clustNumb = new Int_t[nclust];
891 Int_t nCoupled, nForFit, minGroup[3], clustFit[3], nfit = 0;
893 Double_t parOk[8] = {0}; //AZ
895 for (Int_t igroup = 0; igroup < nclust; ++igroup)
897 if (used[igroup]) continue;
898 used[igroup] = kTRUE;
899 clustNumb[0] = igroup;
901 // Find group of coupled clusters
902 AddCluster(igroup, nclust, aijcluclu, used, clustNumb, nCoupled); // recursive
905 cout << " nCoupled: " << nCoupled << endl;
906 for (Int_t i=0; i<nCoupled; ++i) cout << clustNumb[i] << " "; cout << endl;
909 fnCoupled = nCoupled;
916 for (Int_t i = 0; i < nCoupled; ++i) clustFit[i] = clustNumb[i];
920 // Too many coupled clusters to fit - try to decouple them
921 // Find the lowest coupling of 1, 2, min(3,nLinks/2) pixels with
922 // all the others in the group
923 for (Int_t j = 0; j < 3; ++j) minGroup[j] = -1;
924 Double_t coupl = MinGroupCoupl(nCoupled, clustNumb, aijcluclu, minGroup);
926 // Flag clusters for fit
928 while (minGroup[nForFit] >= 0 && nForFit < 3)
930 if (fDebug) cout << clustNumb[minGroup[nForFit]] << " ";
931 clustFit[nForFit] = clustNumb[minGroup[nForFit]];
932 clustNumb[minGroup[nForFit]] -= 999;
935 if (fDebug) cout << " nForFit " << nForFit << " " << coupl << endl;
938 // Select pads for fit.
939 if (SelectPad(cluster,nCoupled, nForFit, clustNumb, clustFit, aijclupad) < 3 && nCoupled > 1)
942 for (Int_t j = 0; j < npad; ++j)
944 AliMUONPad* pad = cluster.Pad(j);
945 //if ( pad->Status()==1 ) pad->SetStatus(0);
946 //if ( pad->Status()==-9) pad->SetStatus(-5);
947 if ( pad->Status() == AliMUONClusterFinderMLEM::GetUseForFitFlag() ||
948 pad->Status() == AliMUONClusterFinderMLEM::GetCoupledFlag())
949 pad->SetStatus(AliMUONClusterFinderMLEM::GetZeroFlag());
951 // Merge the failed cluster candidates (with too few pads to fit) with
952 // the one with the strongest coupling
953 Merge(cluster,nForFit, nCoupled, clustNumb, clustFit, clusters, aijcluclu, aijclupad);
958 nfit = Fit(cluster,0, nForFit, clustFit, clusters, parOk, clusterList, mlem);
960 //cout << " (nfit == 0) " << fNpar << " " << cluster.Multiplicity() << endl;
961 fNpar = 0; // should be 0 by itself but just in case ...
965 // Subtract the fitted charges from pads with strong coupling and/or
966 // return pads for further use
967 UpdatePads(cluster,nfit, parOk);
970 for (Int_t j = 0; j < npad; ++j)
972 AliMUONPad* pad = cluster.Pad(j);
973 //if ( pad->Status()==1 ) pad->SetStatus(-2);
974 //if ( pad->Status()==-9) pad->SetStatus(-5);
975 if ( pad->Status() == AliMUONClusterFinderMLEM::GetUseForFitFlag() )
976 pad->SetStatus(AliMUONClusterFinderMLEM::GetModifiedFlag());
979 // Sort the clusters (move to the right the used ones)
980 Int_t beg = 0, end = nCoupled - 1;
983 if (clustNumb[beg] >= 0) { ++beg; continue; }
984 for (Int_t j = end; j > beg; --j)
986 if (clustNumb[j] < 0) continue;
988 indx = clustNumb[beg];
989 clustNumb[beg] = clustNumb[j];
999 // Remove couplings of used clusters
1000 for (Int_t iclust = nCoupled; iclust < nCoupled+nForFit; ++iclust)
1002 indx = clustNumb[iclust] + 999;
1003 for (Int_t iclust1 = 0; iclust1 < nCoupled; ++iclust1)
1005 indx1 = clustNumb[iclust1];
1006 aijcluclu(indx,indx1) = aijcluclu(indx1,indx) = 0;
1010 // Update the remaining clusters couplings (subtract couplings from
1011 // the used pads) - overflows excluded
1012 for (Int_t j = 0; j < npad; ++j)
1014 AliMUONPad* pad = cluster.Pad(j);
1015 //if ( pad->Status() != -2) continue;
1016 if ( pad->Status() != AliMUONClusterFinderMLEM::GetModifiedFlag()) continue;
1017 for (Int_t iclust=0; iclust<nCoupled; ++iclust)
1019 indx = clustNumb[iclust];
1020 if (aijclupad(indx,j) < fgkCouplMin) continue;
1021 for (Int_t iclust1 = iclust+1; iclust1 < nCoupled; ++iclust1)
1023 indx1 = clustNumb[iclust1];
1024 if (aijclupad(indx1,j) < fgkCouplMin) continue;
1026 aijcluclu(indx,indx1) -=
1027 TMath::Sqrt (aijclupad(indx,j)*aijclupad(indx1,j));
1028 aijcluclu(indx1,indx) = aijcluclu(indx,indx1);
1031 //pad->SetStatus(-8);
1032 pad->SetStatus(AliMUONClusterFinderMLEM::GetOverFlag());
1033 } // for (Int_t j=0; j<npad;
1034 } // if (nCoupled > 3)
1035 } // while (nCoupled > 0)
1036 } // for (Int_t igroup=0; igroup<nclust;
1038 for (Int_t iclust = 0; iclust < nclust; ++iclust)
1040 pix = clusters[iclust];
1044 delete [] clustNumb;
1049 //_____________________________________________________________________________
1051 AliMUONClusterSplitterMLEM::Merge(const AliMUONCluster& cluster,
1052 Int_t nForFit, Int_t nCoupled,
1053 Int_t *clustNumb, Int_t *clustFit,
1054 TObjArray **clusters,
1055 TMatrixD& aijcluclu, TMatrixD& aijclupad)
1057 /// Merge the group of clusters with the one having the strongest coupling with them
1059 Int_t indx, indx1, npxclu, npxclu1, imax=0;
1060 TObjArray *pix, *pix1;
1063 for (Int_t icl = 0; icl < nForFit; ++icl)
1065 indx = clustFit[icl];
1066 pix = clusters[indx];
1067 npxclu = pix->GetEntriesFast();
1069 for (Int_t icl1 = 0; icl1 < nCoupled; ++icl1)
1071 indx1 = clustNumb[icl1];
1072 if (indx1 < 0) continue;
1073 if ( aijcluclu(indx,indx1) > couplMax)
1075 couplMax = aijcluclu(indx,indx1);
1078 } // for (Int_t icl1=0;
1080 pix1 = clusters[imax];
1081 npxclu1 = pix1->GetEntriesFast();
1083 for (Int_t i = 0; i < npxclu; ++i)
1085 pix1->Add(pix->UncheckedAt(i));
1089 //Add cluster-to-cluster couplings
1090 for (Int_t icl1 = 0; icl1 < nCoupled; ++icl1)
1092 indx1 = clustNumb[icl1];
1093 if (indx1 < 0 || indx1 == imax) continue;
1094 aijcluclu(indx1,imax) += aijcluclu(indx,indx1);
1095 aijcluclu(imax,indx1) = aijcluclu(indx1,imax);
1097 aijcluclu(indx,imax) = aijcluclu(imax,indx) = 0;
1099 //Add cluster-to-pad couplings
1100 Int_t mult = cluster.Multiplicity();
1101 for (Int_t j = 0; j < mult; ++j)
1103 AliMUONPad* pad = cluster.Pad(j);
1104 //if ( pad->Status() < 0 && pad->Status() != -5 ) continue;// exclude used pads
1105 if ( pad->Status() != AliMUONClusterFinderMLEM::GetZeroFlag()) continue;// exclude used pads
1106 aijclupad(imax,j) += aijclupad(indx,j);
1107 aijclupad(indx,j) = 0;
1109 } // for (Int_t icl=0; icl<nForFit;
1113 //_____________________________________________________________________________
1115 AliMUONClusterSplitterMLEM::MinGroupCoupl(Int_t nCoupled, Int_t *clustNumb,
1116 TMatrixD& aijcluclu, Int_t *minGroup)
1118 /// Find group of clusters with minimum coupling to all the others
1120 Int_t i123max = TMath::Min(3,nCoupled/2);
1121 Int_t indx, indx1, indx2, indx3, nTot = 0;
1122 Double_t *coupl1 = 0, *coupl2 = 0, *coupl3 = 0;
1124 for (Int_t i123 = 1; i123 <= i123max; ++i123) {
1127 coupl1 = new Double_t [nCoupled];
1128 for (Int_t i = 0; i < nCoupled; ++i) coupl1[i] = 0;
1130 else if (i123 == 2) {
1131 nTot = nCoupled*nCoupled;
1132 coupl2 = new Double_t [nTot];
1133 for (Int_t i = 0; i < nTot; ++i) coupl2[i] = 9999;
1135 nTot = nTot*nCoupled;
1136 coupl3 = new Double_t [nTot];
1137 for (Int_t i = 0; i < nTot; ++i) coupl3[i] = 9999;
1140 for (Int_t i = 0; i < nCoupled; ++i) {
1141 indx1 = clustNumb[i];
1142 for (Int_t j = i+1; j < nCoupled; ++j) {
1143 indx2 = clustNumb[j];
1145 coupl1[i] += aijcluclu(indx1,indx2);
1146 coupl1[j] += aijcluclu(indx1,indx2);
1148 else if (i123 == 2) {
1149 indx = i*nCoupled + j;
1150 coupl2[indx] = coupl1[i] + coupl1[j];
1151 coupl2[indx] -= 2 * (aijcluclu(indx1,indx2));
1153 for (Int_t k = j+1; k < nCoupled; ++k) {
1154 indx3 = clustNumb[k];
1155 indx = i*nCoupled*nCoupled + j*nCoupled + k;
1156 coupl3[indx] = coupl2[i*nCoupled+j] + coupl1[k];
1157 coupl3[indx] -= 2 * (aijcluclu(indx1,indx3)+aijcluclu(indx2,indx3));
1160 } // for (Int_t j=i+1;
1161 } // for (Int_t i=0;
1162 } // for (Int_t i123=1;
1164 // Find minimum coupling
1165 Double_t couplMin = 9999;
1168 for (Int_t i123 = 1; i123 <= i123max; ++i123) {
1170 locMin = TMath::LocMin(nCoupled, coupl1);
1171 couplMin = coupl1[locMin];
1172 minGroup[0] = locMin;
1175 else if (i123 == 2) {
1176 locMin = TMath::LocMin(nCoupled*nCoupled, coupl2);
1177 if (coupl2[locMin] < couplMin) {
1178 couplMin = coupl2[locMin];
1179 minGroup[0] = locMin/nCoupled;
1180 minGroup[1] = locMin%nCoupled;
1184 locMin = TMath::LocMin(nTot, coupl3);
1185 if (coupl3[locMin] < couplMin) {
1186 couplMin = coupl3[locMin];
1187 minGroup[0] = locMin/nCoupled/nCoupled;
1188 minGroup[1] = locMin%(nCoupled*nCoupled)/nCoupled;
1189 minGroup[2] = locMin%nCoupled;
1193 } // for (Int_t i123=1;
1197 //_____________________________________________________________________________
1199 AliMUONClusterSplitterMLEM::SelectPad(const AliMUONCluster& cluster,
1200 Int_t nCoupled, Int_t nForFit,
1201 Int_t *clustNumb, Int_t *clustFit,
1202 TMatrixD& aijclupad)
1204 /// Select pads for fit. If too many coupled clusters, find pads giving
1205 /// the strongest coupling with the rest of clusters and exclude them from the fit.
1207 Int_t npad = cluster.Multiplicity();
1208 Double_t *padpix = 0;
1212 padpix = new Double_t[npad];
1213 for (Int_t i = 0; i < npad; ++i) padpix[i] = 0.;
1216 Int_t nOK = 0, indx, indx1;
1217 for (Int_t iclust = 0; iclust < nForFit; ++iclust)
1219 indx = clustFit[iclust];
1220 for (Int_t j = 0; j < npad; ++j)
1222 if ( aijclupad(indx,j) < fgkCouplMin) continue;
1223 AliMUONPad* pad = cluster.Pad(j);
1225 if ( pad->Status() == -5 ) pad->SetStatus(-9); // flag overflow
1226 if ( pad->Status() < 0 ) continue; // exclude overflows and used pads
1227 if ( !pad->Status() )
1230 ++nOK; // pad to be used in fit
1233 if ( pad->Status() != AliMUONClusterFinderMLEM::GetZeroFlag()
1234 || pad->IsSaturated() ) continue; // used pads and overflows
1235 pad->SetStatus(AliMUONClusterFinderMLEM::GetUseForFitFlag());
1236 ++nOK; // pad to be used in fit
1240 // Check other clusters
1241 for (Int_t iclust1 = 0; iclust1 < nCoupled; ++iclust1)
1243 indx1 = clustNumb[iclust1];
1244 if (indx1 < 0) continue;
1245 if ( aijclupad(indx1,j) < fgkCouplMin ) continue;
1246 padpix[j] += aijclupad(indx1,j);
1248 } // if (nCoupled > 3)
1249 } // for (Int_t j=0; j<npad;
1250 } // for (Int_t iclust=0; iclust<nForFit
1251 if (nCoupled < 4) return nOK;
1254 for (Int_t j = 0; j < npad; ++j)
1256 if (padpix[j] < fgkCouplMin) continue;
1258 //cluster.Pad(j)->SetStatus(-1); // exclude pads with strong coupling to the other clusters
1259 cluster.Pad(j)->SetStatus(AliMUONClusterFinderMLEM::GetCoupledFlag()); // exclude pads with strong coupling to the other clusters
1266 //_____________________________________________________________________________
1268 AliMUONClusterSplitterMLEM::UpdatePads(const AliMUONCluster& cluster,
1269 Int_t /*nfit*/, Double_t *par)
1271 /// Subtract the fitted charges from pads with strong coupling
1273 Int_t indx, mult = cluster.Multiplicity(), iend = fNpar/3;
1274 Double_t charge, coef=0;
1276 for (Int_t j = 0; j < mult; ++j)
1278 AliMUONPad* pad = cluster.Pad(j);
1279 //if ( pad->Status() != -1 ) continue;
1280 if ( pad->Status() != AliMUONClusterFinderMLEM::GetCoupledFlag() ) continue;
1284 for (Int_t i = 0; i <= iend; ++i)
1288 coef = Param2Coef(i, coef, par);
1289 charge += ChargeIntegration(par[indx],par[indx+1],*pad) * coef;
1292 pad->SetCharge(pad->Charge()-charge);
1293 } // if (fNpar != 0)
1295 //if (pad->Charge() > 6 /*fgkZeroSuppression*/) pad->SetStatus(0);
1296 if (pad->Charge() > 6 /*fgkZeroSuppression*/) pad->SetStatus(AliMUONClusterFinderMLEM::GetZeroFlag());
1297 // return pad for further using // FIXME: remove usage of zerosuppression here
1298 else pad->SetStatus(AliMUONClusterFinderMLEM::GetOverFlag()); // do not use anymore
1300 } // for (Int_t j=0;