Line data Source code
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 : /* $Id$ */
17 :
18 : //-----------------------------------------------------------------------------
19 : /// \class AliMUONClusterFinderPeakCOG
20 : ///
21 : /// Clusterizer class based on simple peak finder
22 : ///
23 : /// Pre-clustering is handled by AliMUONPreClusterFinder
24 : /// From a precluster a pixel array is built, and its local maxima are used
25 : /// to get pads and compute pad center of gravity.
26 : ///
27 : /// \author Laurent Aphecetche (for the "new" C++ structure) and
28 : /// Alexander Zinchenko, JINR Dubna, for the hardcore of it ;-)
29 : //-----------------------------------------------------------------------------
30 :
31 : #include "AliMUONClusterFinderPeakCOG.h"
32 : #include "AliMUONCluster.h"
33 : #include "AliMUONPad.h"
34 :
35 : #include "AliMpPad.h"
36 : #include "AliMpVSegmentation.h"
37 : #include "AliMpEncodePair.h"
38 :
39 : #include "AliLog.h"
40 : #include "AliRunLoader.h"
41 : //#include "AliCodeTimer.h"
42 :
43 : #include <Riostream.h>
44 : #include <TH2.h>
45 : //#include <TCanvas.h>
46 : #include <TMath.h>
47 :
48 : using std::endl;
49 : using std::cout;
50 : /// \cond CLASSIMP
51 18 : ClassImp(AliMUONClusterFinderPeakCOG)
52 : /// \endcond
53 :
54 : const Double_t AliMUONClusterFinderPeakCOG::fgkZeroSuppression = 6; // average zero suppression value
55 : //const Double_t AliMUONClusterFinderMLEM::fgkDistancePrecision = 1e-6; // (cm) used to check overlaps and so on
56 : const Double_t AliMUONClusterFinderPeakCOG::fgkDistancePrecision = 1e-3; // (cm) used to check overlaps and so on
57 18 : const TVector2 AliMUONClusterFinderPeakCOG::fgkIncreaseSize(-AliMUONClusterFinderPeakCOG::fgkDistancePrecision,-AliMUONClusterFinderPeakCOG::fgkDistancePrecision);
58 18 : const TVector2 AliMUONClusterFinderPeakCOG::fgkDecreaseSize(AliMUONClusterFinderPeakCOG::fgkDistancePrecision,AliMUONClusterFinderPeakCOG::fgkDistancePrecision);
59 :
60 : // Status flags for pads
61 : const Int_t AliMUONClusterFinderPeakCOG::fgkZero = 0x0; ///< pad "basic" state
62 : const Int_t AliMUONClusterFinderPeakCOG::fgkMustKeep = 0x1; ///< do not kill (for pixels)
63 : const Int_t AliMUONClusterFinderPeakCOG::fgkUseForFit = 0x10; ///< should be used for fit
64 : const Int_t AliMUONClusterFinderPeakCOG::fgkOver = 0x100; ///< processing is over
65 : const Int_t AliMUONClusterFinderPeakCOG::fgkModified = 0x1000; ///< modified pad charge
66 : const Int_t AliMUONClusterFinderPeakCOG::fgkCoupled = 0x10000; ///< coupled pad
67 :
68 : //_____________________________________________________________________________
69 : AliMUONClusterFinderPeakCOG::AliMUONClusterFinderPeakCOG(Bool_t plot, AliMUONVClusterFinder* clusterFinder)
70 0 : : AliMUONVClusterFinder(),
71 0 : fPreClusterFinder(clusterFinder),
72 0 : fPreCluster(0x0),
73 0 : fClusterList(),
74 0 : fEventNumber(0),
75 0 : fDetElemId(-1),
76 0 : fClusterNumber(0),
77 0 : fHistAnode(0x0),
78 0 : fPixArray(new TObjArray(20)),
79 0 : fDebug(0),
80 0 : fPlot(plot),
81 0 : fNClusters(0),
82 0 : fNAddVirtualPads(0)
83 0 : {
84 : /// Constructor
85 :
86 0 : fkSegmentation[1] = fkSegmentation[0] = 0x0;
87 :
88 0 : if (fPlot) fDebug = 1;
89 0 : }
90 :
91 : //_____________________________________________________________________________
92 : AliMUONClusterFinderPeakCOG::~AliMUONClusterFinderPeakCOG()
93 0 : {
94 : /// Destructor
95 0 : delete fPixArray; fPixArray = 0;
96 0 : delete fPreClusterFinder;
97 0 : AliInfo(Form("Total clusters %d AddVirtualPad needed %d",
98 : fNClusters,fNAddVirtualPads));
99 0 : }
100 :
101 : //_____________________________________________________________________________
102 : Bool_t
103 : AliMUONClusterFinderPeakCOG::Prepare(Int_t detElemId, TObjArray* pads[2],
104 : const AliMpArea& area,
105 : const AliMpVSegmentation* seg[2])
106 : {
107 : /// Prepare for clustering
108 : // AliCodeTimerAuto("",0)
109 :
110 0 : for ( Int_t i = 0; i < 2; ++i )
111 : {
112 0 : fkSegmentation[i] = seg[i];
113 : }
114 :
115 : // Find out the DetElemId
116 0 : fDetElemId = detElemId;
117 :
118 : // find out current event number, and reset the cluster number
119 0 : AliRunLoader *runLoader = AliRunLoader::Instance();
120 0 : fEventNumber = runLoader ? runLoader->GetEventNumber() : 0;
121 0 : fClusterNumber = -1;
122 0 : fClusterList.Delete();
123 :
124 0 : AliDebug(3,Form("EVT %d DE %d",fEventNumber,fDetElemId));
125 :
126 0 : if ( fPreClusterFinder->NeedSegmentation() )
127 : {
128 0 : return fPreClusterFinder->Prepare(detElemId,pads,area,seg);
129 : }
130 : else
131 : {
132 0 : return fPreClusterFinder->Prepare(detElemId,pads,area);
133 : }
134 0 : }
135 :
136 : //_____________________________________________________________________________
137 : AliMUONCluster*
138 : AliMUONClusterFinderPeakCOG::NextCluster()
139 : {
140 : /// Return next cluster
141 : // AliCodeTimerAuto("",0)
142 :
143 : // if the list of clusters is not void, pick one from there
144 0 : TObject* o = fClusterList.At(++fClusterNumber);
145 0 : if ( o != 0x0 ) return static_cast<AliMUONCluster*>(o);
146 :
147 : //FIXME : at this point, must check whether we've used all the digits
148 : //from precluster : if not, let the preclustering know about those unused
149 : //digits, so it can reuse them
150 :
151 : // if the cluster list is exhausted, we need to go to the next
152 : // pre-cluster and treat it
153 :
154 0 : fClusterList.Delete(); // reset the list of clusters for this pre-cluster
155 0 : fClusterNumber = -1;
156 :
157 0 : fPreCluster = fPreClusterFinder->NextCluster();
158 :
159 0 : if (!fPreCluster)
160 : {
161 : // we are done
162 0 : return 0x0;
163 : }
164 :
165 0 : WorkOnPreCluster();
166 :
167 : // WorkOnPreCluster may have used only part of the pads, so we check that
168 : // now, and let the unused pads be reused by the preclustering...
169 :
170 0 : Int_t mult = fPreCluster->Multiplicity();
171 0 : for ( Int_t i = 0; i < mult; ++i )
172 : {
173 0 : AliMUONPad* pad = fPreCluster->Pad(i);
174 0 : if ( !pad->IsUsed() )
175 : {
176 0 : fPreClusterFinder->UsePad(*pad);
177 0 : }
178 : }
179 :
180 0 : return NextCluster();
181 0 : }
182 :
183 : //_____________________________________________________________________________
184 : Bool_t
185 : AliMUONClusterFinderPeakCOG::WorkOnPreCluster()
186 : {
187 : /// Starting from a precluster, builds a pixel array, and then
188 : /// extract clusters from this array
189 :
190 : // AliCodeTimerAuto("",0)
191 :
192 0 : if (fDebug) {
193 0 : cout << " *** Event # " << fEventNumber
194 0 : << " det. elem.: " << fDetElemId << endl;
195 0 : for (Int_t j = 0; j < fPreCluster->Multiplicity(); ++j) {
196 0 : AliMUONPad* pad = fPreCluster->Pad(j);
197 0 : printf(" bbb %3d %1d %8.4f %8.4f %8.4f %8.4f %6.1f %3d %3d %2d %1d %1d \n",
198 0 : j, pad->Cathode(), pad->Coord(0), pad->Coord(1), pad->DX()*2, pad->DY()*2,
199 0 : pad->Charge(), pad->Ix(), pad->Iy(), pad->Status(), pad->IsReal(), pad->IsSaturated());
200 : }
201 0 : }
202 :
203 0 : AliMUONCluster* cluster = CheckPrecluster(*fPreCluster);
204 0 : if (!cluster) return kFALSE;
205 :
206 0 : BuildPixArray(*cluster);
207 :
208 0 : if ( fPixArray->GetLast() < 0 )
209 : {
210 0 : AliDebug(1,"No pixel for the above cluster");
211 0 : delete cluster;
212 0 : return kFALSE;
213 : }
214 :
215 0 : Int_t nMax = 1, localMax[100], maxPos[100] = {0};
216 0 : Double_t maxVal[100];
217 :
218 0 : nMax = FindLocalMaxima(fPixArray, localMax, maxVal); // find local maxima
219 :
220 0 : if (nMax > 1) TMath::Sort(nMax, maxVal, maxPos, kTRUE); // in descending order
221 :
222 0 : for (Int_t i = 0; i < nMax; ++i)
223 : {
224 0 : FindCluster(*cluster,localMax, maxPos[i]);
225 : }
226 :
227 0 : delete cluster;
228 0 : if (fPlot == 0) {
229 0 : delete fHistAnode;
230 0 : fHistAnode = 0x0;
231 0 : }
232 : return kTRUE;
233 0 : }
234 :
235 : //_____________________________________________________________________________
236 : Bool_t
237 : AliMUONClusterFinderPeakCOG::Overlap(const AliMUONPad& pad, const AliMUONPad& pixel)
238 : {
239 : /// Check if the pad and the pixel overlaps
240 :
241 : // make a fake pad from the pixel
242 0 : AliMUONPad tmp(pad.DetElemId(),pad.Cathode(),pad.Ix(),pad.Iy(),
243 0 : pixel.Coord(0),pixel.Coord(1),
244 0 : pixel.Size(0),pixel.Size(1),0);
245 :
246 0 : return AliMUONPad::AreOverlapping(pad,tmp,fgkDecreaseSize);
247 0 : }
248 :
249 : //_____________________________________________________________________________
250 : AliMUONCluster*
251 : AliMUONClusterFinderPeakCOG::CheckPrecluster(const AliMUONCluster& origCluster)
252 : {
253 : /// Check precluster in order to attempt to simplify it (mostly for
254 : /// two-cathode preclusters)
255 :
256 : // AliCodeTimerAuto("",0)
257 :
258 : // Disregard small clusters (leftovers from splitting or noise)
259 0 : if ((origCluster.Multiplicity()==1 || origCluster.Multiplicity()==2) &&
260 0 : origCluster.Charge(0)+origCluster.Charge(1) < 1.525) // JC: adc -> fc
261 : {
262 0 : return 0x0;
263 : }
264 :
265 0 : AliMUONCluster* cluster = new AliMUONCluster(origCluster);
266 :
267 0 : AliDebug(2,"Start of CheckPreCluster=");
268 : //StdoutToAliDebug(2,cluster->Print("full"));
269 :
270 : AliMUONCluster* rv(0x0);
271 :
272 0 : if (cluster->Multiplicity(0) && cluster->Multiplicity(1))
273 : {
274 0 : rv = CheckPreclusterTwoCathodes(cluster);
275 0 : }
276 : else
277 : {
278 : rv = cluster;
279 : }
280 : return rv;
281 0 : }
282 :
283 : //_____________________________________________________________________________
284 : AliMUONCluster*
285 : AliMUONClusterFinderPeakCOG::CheckPreclusterTwoCathodes(AliMUONCluster* cluster)
286 : {
287 : /// Check two-cathode cluster
288 :
289 0 : Int_t npad = cluster->Multiplicity();
290 0 : Int_t* flags = new Int_t[npad];
291 0 : for (Int_t j = 0; j < npad; ++j) flags[j] = 0;
292 :
293 : // Check pad overlaps
294 0 : for ( Int_t i = 0; i < npad; ++i)
295 : {
296 0 : AliMUONPad* padi = cluster->Pad(i);
297 0 : if ( padi->Cathode() != 0 ) continue;
298 0 : for (Int_t j = i+1; j < npad; ++j)
299 : {
300 0 : AliMUONPad* padj = cluster->Pad(j);
301 0 : if ( padj->Cathode() != 1 ) continue;
302 0 : if ( !AliMUONPad::AreOverlapping(*padi,*padj,fgkDecreaseSize) ) continue;
303 0 : flags[i] = flags[j] = 1; // mark overlapped pads
304 0 : }
305 0 : }
306 :
307 : // Check if all pads overlap
308 : Int_t nFlags=0;
309 0 : for (Int_t i = 0; i < npad; ++i)
310 : {
311 0 : if (!flags[i]) ++nFlags;
312 : }
313 :
314 0 : if (nFlags > 0)
315 : {
316 : // not all pads overlap.
317 0 : if (fDebug) cout << " nFlags: " << nFlags << endl;
318 0 : TObjArray toBeRemoved;
319 0 : for (Int_t i = 0; i < npad; ++i)
320 : {
321 0 : AliMUONPad* pad = cluster->Pad(i);
322 0 : if (flags[i]) continue;
323 0 : Int_t cath = pad->Cathode();
324 0 : Int_t cath1 = TMath::Even(cath);
325 : // Check for edge effect (missing pads on the _other_ cathode)
326 0 : AliMpPad mpPad
327 0 : = fkSegmentation[cath1]->PadByPosition(pad->Position().X(),pad->Position().Y(),kFALSE);
328 0 : if (!mpPad.IsValid()) continue;
329 : //if (nFlags == 1 && pad->Charge() < fgkZeroSuppression * 3) continue;
330 0 : if (nFlags == 1 && pad->Charge() < 3.05) continue; // JC: adc -> fc
331 0 : AliDebug(2,Form("Releasing the following pad : de,cath,ix,iy %d,%d,%d,%d charge %e",
332 : fDetElemId,pad->Cathode(),pad->Ix(),pad->Iy(),pad->Charge()));
333 0 : toBeRemoved.AddLast(pad);
334 0 : fPreCluster->Pad(i)->Release();
335 0 : }
336 0 : Int_t nRemove = toBeRemoved.GetEntriesFast();
337 0 : for ( Int_t i = 0; i < nRemove; ++i )
338 : {
339 0 : cluster->RemovePad(static_cast<AliMUONPad*>(toBeRemoved.UncheckedAt(i)));
340 : }
341 0 : }
342 :
343 : // Check correlations of cathode charges
344 0 : if ( !cluster->IsSaturated() && cluster->ChargeAsymmetry() > 1 )
345 : {
346 : // big difference
347 0 : Int_t cathode = cluster->MaxRawChargeCathode();
348 : Int_t imin(-1);
349 : Int_t imax(-1);
350 : Double_t cmax(0);
351 : Double_t cmin(1E9);
352 :
353 : // get min and max pad charges on the cathode opposite to the
354 : // max pad (given by MaxRawChargeCathode())
355 : //
356 0 : Int_t mult = cluster->Multiplicity();
357 0 : for ( Int_t i = 0; i < mult; ++i )
358 : {
359 0 : AliMUONPad* pad = cluster->Pad(i);
360 0 : if ( pad->Cathode() != cathode || !pad->IsReal() )
361 : {
362 : // only consider pads in the opposite cathode, and
363 : // only consider real pads (i.e. exclude the virtual ones)
364 0 : continue;
365 : }
366 0 : if ( pad->Charge() < cmin )
367 : {
368 0 : cmin = pad->Charge();
369 : imin = i;
370 0 : if (imax < 0) {
371 : imax = imin;
372 : cmax = cmin;
373 0 : }
374 : }
375 0 : else if ( pad->Charge() > cmax )
376 : {
377 0 : cmax = pad->Charge();
378 : imax = i;
379 0 : }
380 0 : }
381 0 : AliDebug(2,Form("Pad imin,imax %d,%d cmin,cmax %e,%e",
382 : imin,imax,cmin,cmax));
383 : //
384 : // arrange pads according to their distance to the max, normalized
385 : // to the pad size
386 0 : Double_t* dist = new Double_t[mult];
387 : Double_t dxMin(1E9);
388 : Double_t dyMin(1E9);
389 : Double_t dmin(0);
390 :
391 0 : AliMUONPad* padmax = cluster->Pad(imax);
392 :
393 0 : for ( Int_t i = 0; i < mult; ++i )
394 : {
395 0 : dist[i] = 0.0;
396 0 : if ( i == imax) continue;
397 0 : AliMUONPad* pad = cluster->Pad(i);
398 0 : if ( pad->Cathode() != cathode || !pad->IsReal() ) continue;
399 0 : Double_t dx = (pad->X()-padmax->X())/padmax->DX()/2.0;
400 0 : Double_t dy = (pad->Y()-padmax->Y())/padmax->DY()/2.0;
401 0 : dist[i] = TMath::Sqrt(dx*dx+dy*dy);
402 0 : if ( i == imin )
403 : {
404 0 : dmin = dist[i] + 1E-3; // distance to the pad with minimum charge
405 : dxMin = dx;
406 : dyMin = dy;
407 0 : }
408 0 : }
409 :
410 0 : TMath::Sort(mult,dist,flags,kFALSE); // in ascending order
411 : Double_t xmax(-1), distPrev(999);
412 0 : TObjArray toBeRemoved;
413 :
414 0 : for ( Int_t i = 0; i < mult; ++i )
415 : {
416 0 : Int_t indx = flags[i];
417 0 : AliMUONPad* pad = cluster->Pad(indx);
418 0 : if ( pad->Cathode() != cathode || !pad->IsReal() ) continue;
419 0 : if ( dist[indx] > dmin )
420 : {
421 : // farther than the minimum pad
422 0 : Double_t dx = (pad->X()-padmax->X())/padmax->DX()/2.0;
423 0 : Double_t dy = (pad->Y()-padmax->Y())/padmax->DY()/2.0;
424 0 : dx *= dxMin;
425 0 : dy *= dyMin;
426 0 : if (dx >= 0 && dy >= 0) continue;
427 0 : if (TMath::Abs(dx) > TMath::Abs(dy) && dx >= 0) continue;
428 0 : if (TMath::Abs(dy) > TMath::Abs(dx) && dy >= 0) continue;
429 0 : }
430 0 : if (dist[indx] > distPrev + 1) break; // overstepping empty pads
431 0 : if ( pad->Charge() <= cmax || TMath::Abs(dist[indx]-xmax) < 1E-3 )
432 : {
433 : // release pad
434 0 : if (TMath::Abs(dist[indx]-xmax) < 1.e-3)
435 : {
436 0 : cmax = TMath::Max(pad->Charge(),cmax);
437 0 : }
438 : else
439 : {
440 : cmax = pad->Charge();
441 : }
442 0 : xmax = dist[indx];
443 : distPrev = dist[indx];
444 0 : AliDebug(2,Form("Releasing the following pad : de,cath,ix,iy %d,%d,%d,%d charge %e",
445 : fDetElemId,pad->Cathode(),pad->Ix(),pad->Iy(),
446 : pad->Charge()));
447 :
448 0 : toBeRemoved.AddLast(pad);
449 0 : fPreCluster->Pad(indx)->Release();
450 0 : }
451 0 : }
452 0 : Int_t nRemove = toBeRemoved.GetEntriesFast();
453 0 : for ( Int_t i = 0; i < nRemove; ++i )
454 : {
455 0 : cluster->RemovePad(static_cast<AliMUONPad*>(toBeRemoved.UncheckedAt(i)));
456 : }
457 0 : delete[] dist;
458 0 : } // if ( !cluster->IsSaturated() &&
459 :
460 0 : delete[] flags;
461 :
462 0 : AliDebug(2,"End of CheckPreClusterTwoCathodes=");
463 : //StdoutToAliDebug(2,cluster->Print("full"));
464 :
465 0 : return cluster;
466 0 : }
467 :
468 : //_____________________________________________________________________________
469 : void
470 : AliMUONClusterFinderPeakCOG::CheckOverlaps()
471 : {
472 : /// For debug only : check if some pixels overlap...
473 :
474 0 : Int_t nPix = fPixArray->GetLast()+1;
475 : Int_t dummy(0);
476 :
477 0 : for ( Int_t i = 0; i < nPix; ++i )
478 : {
479 0 : AliMUONPad* pixelI = Pixel(i);
480 0 : AliMUONPad pi(dummy,dummy,dummy,dummy,
481 0 : pixelI->Coord(0),pixelI->Coord(1),
482 0 : pixelI->Size(0),pixelI->Size(1),0.0);
483 :
484 0 : for ( Int_t j = i+1; j < nPix; ++j )
485 : {
486 0 : AliMUONPad* pixelJ = Pixel(j);
487 0 : AliMUONPad pj(dummy,dummy,dummy,dummy,
488 0 : pixelJ->Coord(0),pixelJ->Coord(1),
489 0 : pixelJ->Size(0),pixelJ->Size(1),0.0);
490 0 : AliMpArea area;
491 :
492 0 : if ( AliMUONPad::AreOverlapping(pi,pj,fgkDecreaseSize,area) )
493 : {
494 0 : AliInfo(Form("The following 2 pixels (%d and %d) overlap !",i,j));
495 : /*
496 : StdoutToAliInfo(pixelI->Print();
497 : cout << " Surface = " << pixelI->Size(0)*pixelI->Size(1)*4 << endl;
498 : pixelJ->Print();
499 : cout << " Surface = " << pixelJ->Size(0)*pixelJ->Size(1)*4 << endl;
500 : cout << " Area surface = " << area.Dimensions().X()*area.Dimensions().Y()*4 << endl;
501 : cout << "-------" << endl;
502 : );
503 : */
504 : }
505 0 : }
506 0 : }
507 0 : }
508 :
509 : //_____________________________________________________________________________
510 : void AliMUONClusterFinderPeakCOG::BuildPixArray(AliMUONCluster& cluster)
511 : {
512 : /// Build pixel array
513 :
514 0 : Int_t npad = cluster.Multiplicity();
515 0 : if (npad<=0)
516 : {
517 0 : AliWarning("Got no pad at all ?!");
518 0 : }
519 :
520 0 : fPixArray->Delete();
521 0 : BuildPixArrayOneCathode(cluster);
522 :
523 : // StdoutToAliDebug(2,cout << "End of BuildPixelArray:" << endl;
524 : // fPixArray->Print(););
525 : //CheckOverlaps();//FIXME : this is for debug only. Remove it.
526 0 : }
527 :
528 : //_____________________________________________________________________________
529 : void AliMUONClusterFinderPeakCOG::BuildPixArrayOneCathode(AliMUONCluster& cluster)
530 : {
531 : /// Build the pixel array
532 :
533 : // AliDebug(2,Form("cluster.Multiplicity=%d",cluster.Multiplicity()));
534 :
535 0 : TVector2 dim = cluster.MinPadDimensions (-1, kFALSE);
536 0 : Double_t width[2] = {dim.X(), dim.Y()}, xy0[2] = { 0.0, 0.0 };
537 0 : Int_t found[2] = {0}, mult = cluster.Multiplicity();
538 :
539 0 : for ( Int_t i = 0; i < mult; ++i) {
540 0 : AliMUONPad* pad = cluster.Pad(i);
541 0 : for (Int_t j = 0; j < 2; ++j) {
542 0 : if (found[j] == 0 && TMath::Abs(pad->Size(j)-width[j]) < fgkDistancePrecision) {
543 0 : xy0[j] = pad->Coord(j);
544 0 : found[j] = 1;
545 0 : }
546 : }
547 0 : if (found[0] && found[1]) break;
548 0 : }
549 :
550 0 : Double_t min[2], max[2];
551 : Int_t cath0 = 0, cath1 = 1;
552 0 : if (cluster.Multiplicity(0) == 0) cath0 = 1;
553 0 : else if (cluster.Multiplicity(1) == 0) cath1 = 0;
554 :
555 0 : Double_t leftDownX, leftDownY;
556 0 : cluster.Area(cath0).LeftDownCorner(leftDownX, leftDownY);
557 0 : Double_t rightUpX, rightUpY;
558 0 : cluster.Area(cath0).RightUpCorner(rightUpX, rightUpY);
559 0 : min[0] = leftDownX;
560 0 : min[1] = leftDownY;
561 0 : max[0] = rightUpX;
562 0 : max[1] = rightUpY;
563 0 : if (cath1 != cath0) {
564 0 : cluster.Area(cath1).LeftDownCorner(leftDownX, leftDownY);
565 0 : cluster.Area(cath1).RightUpCorner(rightUpX, rightUpY);
566 0 : min[0] = TMath::Max (min[0], leftDownX);
567 0 : min[1] = TMath::Max (min[1], leftDownY);
568 0 : max[0] = TMath::Min (max[0], rightUpX);
569 0 : max[1] = TMath::Min (max[1], rightUpY);
570 0 : }
571 :
572 : // Adjust limits
573 : //width[0] /= 2; width[1] /= 2; // just for check
574 0 : Int_t nbins[2];
575 0 : for (Int_t i = 0; i < 2; ++i) {
576 0 : Double_t dist = (min[i] - xy0[i]) / width[i] / 2;
577 0 : if (TMath::Abs(dist) < 1.e-6) dist = -1.e-6;
578 0 : min[i] = xy0[i] + (TMath::Nint(dist-TMath::Sign(1.e-6,dist))
579 0 : + TMath::Sign(0.5,dist)) * width[i] * 2;
580 0 : nbins[i] = TMath::Nint ((max[i] - min[i]) / width[i] / 2);
581 0 : if (nbins[i] == 0) ++nbins[i];
582 0 : max[i] = min[i] + nbins[i] * width[i] * 2;
583 : //cout << dist << " " << min[i] << " " << max[i] << " " << nbins[i] << endl;
584 : }
585 :
586 : // Book histogram
587 0 : TH2D *hist1 = new TH2D ("Grid", "", nbins[0], min[0], max[0], nbins[1], min[1], max[1]);
588 0 : TH2D *hist2 = new TH2D ("Entries", "", nbins[0], min[0], max[0], nbins[1], min[1], max[1]);
589 0 : TAxis *xaxis = hist1->GetXaxis();
590 0 : TAxis *yaxis = hist1->GetYaxis();
591 :
592 : // Fill histogram
593 0 : for ( Int_t i = 0; i < mult; ++i) {
594 0 : AliMUONPad* pad = cluster.Pad(i);
595 0 : Int_t ix0 = xaxis->FindBin(pad->X());
596 0 : Int_t iy0 = yaxis->FindBin(pad->Y());
597 0 : PadOverHist(0, ix0, iy0, pad, hist1, hist2);
598 : }
599 :
600 : // Store pixels
601 0 : for (Int_t i = 1; i <= nbins[0]; ++i) {
602 0 : Double_t x = xaxis->GetBinCenter(i);
603 0 : for (Int_t j = 1; j <= nbins[1]; ++j) {
604 0 : if (hist2->GetBinContent(hist2->GetBin(i,j)) < 0.01525) continue; // JC: adc -> fc
605 0 : if (cath0 != cath1) {
606 : // Two-sided cluster
607 0 : Double_t cont = hist2->GetBinContent(hist2->GetBin(i,j));
608 0 : if (cont < 999.) continue;
609 0 : if (cont-Int_t(cont/1000.)*1000. < 0.07625) continue; // JC: adc -> fc
610 0 : }
611 : //if (hist2->GetBinContent(hist2->GetBin(i,j)) < 1.1 && cluster.Multiplicity(0) &&
612 : // cluster.Multiplicity(1)) continue;
613 0 : Double_t y = yaxis->GetBinCenter(j);
614 0 : Double_t charge = hist1->GetBinContent(hist1->GetBin(i,j));
615 0 : AliMUONPad* pixPtr = new AliMUONPad(x, y, width[0], width[1], charge);
616 0 : fPixArray->Add(pixPtr);
617 0 : }
618 : }
619 : /*
620 : if (fPixArray->GetEntriesFast() == 1) {
621 : // Split pixel into 2
622 : AliMUONPad* pixPtr = static_cast<AliMUONPad*> (fPixArray->UncheckedAt(0));
623 : pixPtr->SetSize(0,width[0]/2.);
624 : pixPtr->Shift(0,-width[0]/4.);
625 : pixPtr = new AliMUONPad(pixPtr->X()+width[0], pixPtr->Y(), width[0]/2., width[1], pixPtr->Charge());
626 : fPixArray->Add(pixPtr);
627 : }
628 : */
629 : //fPixArray->Print();
630 0 : delete hist1;
631 0 : delete hist2;
632 0 : }
633 :
634 : //_____________________________________________________________________________
635 : void AliMUONClusterFinderPeakCOG::PadOverHist(Int_t idir, Int_t ix0, Int_t iy0, AliMUONPad *pad,
636 : TH2D *hist1, TH2D *hist2)
637 : {
638 : /// "Span" pad over histogram in the direction idir
639 :
640 0 : TAxis *axis = idir == 0 ? hist1->GetXaxis() : hist1->GetYaxis();
641 0 : Int_t nbins = axis->GetNbins(), cath = pad->Cathode();
642 0 : Double_t bin = axis->GetBinWidth(1), amask = TMath::Power(1000.,cath*1.);
643 :
644 0 : Int_t nbinPad = (Int_t)(pad->Size(idir)/bin*2+fgkDistancePrecision) + 1; // number of bins covered by pad
645 :
646 0 : for (Int_t i = 0; i < nbinPad; ++i) {
647 0 : Int_t ixy = idir == 0 ? ix0 + i : iy0 + i;
648 0 : if (ixy > nbins) break;
649 0 : Double_t lowEdge = axis->GetBinLowEdge(ixy);
650 0 : if (lowEdge + fgkDistancePrecision > pad->Coord(idir) + pad->Size(idir)) break;
651 0 : if (idir == 0) PadOverHist(1, ixy, iy0, pad, hist1, hist2); // span in the other direction
652 : else {
653 : // Fill histogram
654 0 : Double_t cont = pad->Charge();
655 0 : if (hist2->GetBinContent(hist2->GetBin(ix0, ixy)) > 0.01525) // JC: adc -> fc
656 0 : cont = TMath::Min (hist1->GetBinContent(hist1->GetBin(ix0, ixy)), cont)
657 0 : + TMath::Min (TMath::Max(hist1->GetBinContent(hist1->GetBin(ix0, ixy)),cont)*0.1, 1.525); // JC: adc -> fc
658 0 : hist1->SetBinContent(hist1->GetBin(ix0, ixy), cont);
659 0 : hist2->SetBinContent(hist2->GetBin(ix0, ixy), hist2->GetBinContent(hist2->GetBin(ix0, ixy))+amask);
660 : }
661 0 : }
662 :
663 0 : for (Int_t i = -1; i > -nbinPad; --i) {
664 0 : Int_t ixy = idir == 0 ? ix0 + i : iy0 + i;
665 0 : if (ixy < 1) break;
666 0 : Double_t upEdge = axis->GetBinUpEdge(ixy);
667 0 : if (upEdge - fgkDistancePrecision < pad->Coord(idir) - pad->Size(idir)) break;
668 0 : if (idir == 0) PadOverHist(1, ixy, iy0, pad, hist1, hist2); // span in the other direction
669 : else {
670 : // Fill histogram
671 0 : Double_t cont = pad->Charge();
672 0 : if (hist2->GetBinContent(hist2->GetBin(ix0, ixy)) > 0.01525) // JC: adc -> fc
673 0 : cont = TMath::Min (hist1->GetBinContent(hist1->GetBin(ix0, ixy)), cont)
674 0 : + TMath::Min (TMath::Max(hist1->GetBinContent(hist1->GetBin(ix0, ixy)),cont)*0.1,1.525); // JC: adc -> fc
675 0 : hist1->SetBinContent(hist1->GetBin(ix0, ixy), cont);
676 0 : hist2->SetBinContent( hist2->GetBin(ix0, ixy), hist2->GetBinContent(hist2->GetBin(ix0, ixy))+amask);
677 : }
678 0 : }
679 0 : }
680 :
681 : //_____________________________________________________________________________
682 : Int_t AliMUONClusterFinderPeakCOG::FindLocalMaxima(TObjArray *pixArray, Int_t *localMax, Double_t *maxVal)
683 : {
684 : /// Find local maxima in pixel space
685 :
686 0 : AliDebug(1,Form("nPix=%d",pixArray->GetLast()+1));
687 :
688 : //TH2D *hist = NULL;
689 : //delete ((TH2D*) gROOT->FindObject("anode"));
690 : //if (pixArray == fPixArray) hist = (TH2D*) gROOT->FindObject("anode");
691 : //else { hist = (TH2D*) gROOT->FindObject("anode1"); cout << hist << endl; }
692 : //if (hist) hist->Delete();
693 0 : delete fHistAnode;
694 :
695 0 : Double_t xylim[4] = {999, 999, 999, 999};
696 :
697 0 : Int_t nPix = pixArray->GetEntriesFast();
698 :
699 0 : if ( nPix <= 0 ) return 0;
700 :
701 : AliMUONPad *pixPtr = 0;
702 0 : for (Int_t ipix = 0; ipix < nPix; ++ipix) {
703 0 : pixPtr = (AliMUONPad*) pixArray->UncheckedAt(ipix);
704 0 : for (Int_t i = 0; i < 4; ++i)
705 0 : xylim[i] = TMath::Min (xylim[i], (i%2 ? -1 : 1)*pixPtr->Coord(i/2));
706 : }
707 0 : for (Int_t i = 0; i < 4; ++i) xylim[i] -= pixPtr->Size(i/2);
708 :
709 0 : Int_t nx = TMath::Nint ((-xylim[1]-xylim[0])/pixPtr->Size(0)/2);
710 0 : Int_t ny = TMath::Nint ((-xylim[3]-xylim[2])/pixPtr->Size(1)/2);
711 0 : if (pixArray == fPixArray) fHistAnode = new TH2D("anode","anode",nx,xylim[0],-xylim[1],ny,xylim[2],-xylim[3]);
712 0 : else fHistAnode = new TH2D("anode1","anode1",nx,xylim[0],-xylim[1],ny,xylim[2],-xylim[3]);
713 0 : for (Int_t ipix = 0; ipix < nPix; ++ipix) {
714 0 : pixPtr = (AliMUONPad*) pixArray->UncheckedAt(ipix);
715 0 : fHistAnode->Fill(pixPtr->Coord(0), pixPtr->Coord(1), pixPtr->Charge());
716 : }
717 : // if (fDraw && pixArray == fPixArray) fDraw->DrawHist("c2", hist);
718 :
719 0 : Int_t nMax = 0, indx, nxy = ny * nx;
720 0 : Int_t *isLocalMax = new Int_t[nxy];
721 0 : for (Int_t i = 0; i < nxy; ++i) isLocalMax[i] = 0;
722 :
723 0 : for (Int_t i = 1; i <= ny; ++i) {
724 0 : indx = (i-1) * nx;
725 0 : for (Int_t j = 1; j <= nx; ++j) {
726 0 : if (fHistAnode->GetBinContent(fHistAnode->GetBin(j,i)) < 0.07625) continue; // JC: adc -> fc
727 : //if (isLocalMax[indx+j-1] < 0) continue;
728 0 : if (isLocalMax[indx+j-1] != 0) continue;
729 0 : FlagLocalMax(fHistAnode, i, j, isLocalMax);
730 0 : }
731 : }
732 :
733 0 : for (Int_t i = 1; i <= ny; ++i) {
734 0 : indx = (i-1) * nx;
735 0 : for (Int_t j = 1; j <= nx; ++j) {
736 0 : if (isLocalMax[indx+j-1] > 0) {
737 0 : localMax[nMax] = indx + j - 1;
738 0 : maxVal[nMax++] = fHistAnode->GetBinContent(fHistAnode->GetBin(j,i));
739 0 : if (nMax > 99) break;
740 : }
741 : }
742 0 : if (nMax > 99) {
743 0 : AliError(" Too many local maxima !!!");
744 0 : break;
745 : }
746 : }
747 0 : if (fDebug) cout << " Local max: " << nMax << endl;
748 0 : delete [] isLocalMax;
749 : return nMax;
750 0 : }
751 :
752 : //_____________________________________________________________________________
753 : void AliMUONClusterFinderPeakCOG::FlagLocalMax(TH2D *hist, Int_t i, Int_t j, Int_t *isLocalMax)
754 : {
755 : /// Flag pixels (whether or not local maxima)
756 :
757 0 : Int_t nx = hist->GetNbinsX();
758 0 : Int_t ny = hist->GetNbinsY();
759 0 : Int_t cont = TMath::Nint (hist->GetBinContent(hist->GetBin(j,i)));
760 0 : Int_t cont1 = 0, indx = (i-1)*nx+j-1, indx1 = 0, indx2 = 0;
761 :
762 0 : Int_t ie = i + 2, je = j + 2;
763 0 : for (Int_t i1 = i-1; i1 < ie; ++i1) {
764 0 : if (i1 < 1 || i1 > ny) continue;
765 0 : indx1 = (i1 - 1) * nx;
766 0 : for (Int_t j1 = j-1; j1 < je; ++j1) {
767 0 : if (j1 < 1 || j1 > nx) continue;
768 0 : if (i == i1 && j == j1) continue;
769 0 : indx2 = indx1 + j1 - 1;
770 0 : cont1 = TMath::Nint (hist->GetBinContent(hist->GetBin(j1,i1)));
771 0 : if (cont < cont1) { isLocalMax[indx] = -1; return; }
772 0 : else if (cont > cont1) isLocalMax[indx2] = -1;
773 : else { // the same charge
774 0 : isLocalMax[indx] = 1;
775 0 : if (isLocalMax[indx2] == 0) {
776 0 : FlagLocalMax(hist, i1, j1, isLocalMax);
777 0 : if (isLocalMax[indx2] < 0) { isLocalMax[indx] = -1; return; }
778 0 : else isLocalMax[indx2] = -1;
779 0 : }
780 : }
781 : }
782 : }
783 0 : isLocalMax[indx] = 1; // local maximum
784 0 : }
785 :
786 : //_____________________________________________________________________________
787 : void AliMUONClusterFinderPeakCOG::FindCluster(AliMUONCluster& cluster,
788 : const Int_t *localMax, Int_t iMax)
789 : {
790 : /// Find pixel cluster around local maximum \a iMax and pick up pads
791 : /// overlapping with it
792 :
793 : //TH2D *hist = (TH2D*) gROOT->FindObject("anode");
794 : /* Just for check
795 : TCanvas* c = new TCanvas("Anode","Anode",800,600);
796 : c->cd();
797 : hist->Draw("lego1Fb"); // debug
798 : c->Update();
799 : Int_t tmp;
800 : cin >> tmp;
801 : */
802 0 : Int_t nx = fHistAnode->GetNbinsX();
803 : //Int_t ny = hist->GetNbinsY();
804 0 : Int_t ic = localMax[iMax] / nx + 1;
805 0 : Int_t jc = localMax[iMax] % nx + 1;
806 :
807 : // Get min pad dimensions for the precluster
808 : Int_t nSides = 2;
809 0 : if (cluster.Multiplicity(0) == 0 || cluster.Multiplicity(1) == 0) nSides = 1;
810 0 : TVector2 dim0 = cluster.MinPadDimensions(0, -1, kFALSE);
811 0 : TVector2 dim1 = cluster.MinPadDimensions(1, -1, kFALSE);
812 : //Double_t width[2][2] = {{dim0.X(), dim0.Y()},{dim1.X(),dim1.Y()}};
813 0 : Int_t nonb[2] = {1, 0}; // coordinate index vs cathode
814 0 : if (nSides == 1 || dim0.X() < dim1.X() - fgkDistancePrecision) {
815 0 : nonb[0] = 0;
816 0 : nonb[1] = 1;
817 0 : }
818 :
819 : // Drop all pixels from the array - pick up only the ones from the cluster
820 : //fPixArray->Delete();
821 :
822 0 : Double_t wx = fHistAnode->GetXaxis()->GetBinWidth(1)/2;
823 0 : Double_t wy = fHistAnode->GetYaxis()->GetBinWidth(1)/2;
824 0 : Double_t yc = fHistAnode->GetYaxis()->GetBinCenter(ic);
825 0 : Double_t xc = fHistAnode->GetXaxis()->GetBinCenter(jc);
826 0 : Double_t cont = fHistAnode->GetBinContent(fHistAnode->GetBin(jc,ic));
827 0 : AliMUONPad pixel(xc, yc, wx, wy, cont);
828 0 : if (fDebug) pixel.Print("full");
829 :
830 0 : Int_t npad = cluster.Multiplicity();
831 :
832 : // Pick up pads which overlap with the maximum pixel and find pads with the max signal
833 0 : Double_t qMax[2] = {0};
834 0 : AliMUONPad *matrix[2][3] = {{0x0,0x0,0x0},{0x0,0x0,0x0}};
835 0 : for (Int_t j = 0; j < npad; ++j)
836 : {
837 0 : AliMUONPad* pad = cluster.Pad(j);
838 0 : if ( Overlap(*pad,pixel) )
839 : {
840 0 : if (fDebug) { cout << j << " "; pad->Print("full"); }
841 0 : if (pad->Charge() > qMax[pad->Cathode()]) {
842 0 : qMax[pad->Cathode()] = pad->Charge();
843 0 : matrix[pad->Cathode()][1] = pad;
844 0 : if (nSides == 1) matrix[!pad->Cathode()][1] = pad;
845 : }
846 : }
847 : }
848 : //if (nSides == 2 && (matrix[0][1] == 0x0 || matrix[1][1] == 0x0)) return; // ???
849 :
850 : // Find neighbours of maxima to have 3 pads per direction (if possible)
851 0 : for (Int_t j = 0; j < npad; ++j)
852 : {
853 0 : AliMUONPad* pad = cluster.Pad(j);
854 0 : Int_t cath = pad->Cathode();
855 0 : if (pad == matrix[cath][1]) continue;
856 0 : Int_t nLoops = 3 - nSides;
857 :
858 0 : for (Int_t k = 0; k < nLoops; ++k) {
859 : Int_t cath1 = cath;
860 0 : if (k) cath1 = !cath;
861 :
862 : // Check the coordinate corresponding to the cathode (bending or non-bending case)
863 0 : Double_t dist = pad->Coord(nonb[cath1]) - matrix[cath][1]->Coord(nonb[cath1]);
864 0 : Double_t dir = TMath::Sign (1., dist);
865 0 : dist = TMath::Abs(dist) - pad->Size(nonb[cath1]) - matrix[cath][1]->Size(nonb[cath1]);
866 :
867 0 : if (TMath::Abs(dist) < fgkDistancePrecision) {
868 : // Check the other coordinate
869 0 : dist = pad->Coord(!nonb[cath1]) - matrix[cath1][1]->Coord(!nonb[cath1]);
870 0 : if (TMath::Abs(dist) >
871 0 : TMath::Max(pad->Size(!nonb[cath1]), matrix[cath1][1]->Size(!nonb[cath1])) - fgkDistancePrecision) break;
872 0 : Int_t idir = TMath::Nint (dir);
873 0 : if (matrix[cath1][1+idir] == 0x0) matrix[cath1][1+idir] = pad;
874 0 : else if (pad->Charge() > matrix[cath1][1+idir]->Charge()) matrix[cath1][1+idir] = pad; // diff. segmentation
875 : //cout << pad->Coord(nonb[cath1]) << " " << pad->Coord(!nonb[cath1]) << " " << pad->Size(nonb[cath1]) << " " << pad->Size(!nonb[cath1]) << " " << pad->Charge() << endl ;
876 : break;
877 : }
878 0 : }
879 0 : }
880 :
881 0 : Double_t coord[2] = {0.}, qAver = 0.;
882 0 : for (Int_t i = 0; i < 2; ++i) {
883 : Double_t q = 0.;
884 : Double_t coordQ = 0.;
885 0 : Int_t cath = matrix[i][1]->Cathode();
886 0 : if (i && nSides == 1) cath = !cath;
887 0 : for (Int_t j = 0; j < 3; ++j) {
888 0 : if (matrix[i][j] == 0x0) continue;
889 0 : Double_t dq = matrix[i][j]->Charge();
890 0 : q += dq;
891 0 : coordQ += dq * matrix[i][j]->Coord(nonb[cath]);
892 : //coordQ += (matrix[i][j]->Charge() * matrix[i][j]->Coord(nonb[cath]));
893 0 : }
894 0 : coord[cath] = coordQ / q;
895 0 : qAver = TMath::Max (qAver, q);
896 : }
897 :
898 : //qAver = TMath::Sqrt(qAver);
899 0 : if ( qAver >= 2.135 ) // JC: adc -> fc
900 : {
901 :
902 0 : AliMUONCluster* cluster1 = new AliMUONCluster(cluster);
903 :
904 0 : cluster1->SetCharge(qAver,qAver);
905 0 : if (nonb[0] == 1)
906 0 : cluster1->SetPosition(TVector2(coord[1],coord[0]),TVector2(0.,0.));
907 : else
908 0 : cluster1->SetPosition(TVector2(coord[0],coord[1]),TVector2(0.,0.));
909 :
910 0 : cluster1->SetChi2(0.);
911 :
912 : // FIXME: we miss some information in this cluster, as compared to
913 : // the original AddRawCluster code.
914 :
915 0 : AliDebug(2,Form("Adding RawCluster detElemId %4d mult %2d charge %5d (xl,yl)=(%9.6g,%9.6g)",
916 : fDetElemId,cluster1->Multiplicity(),(Int_t)cluster1->Charge(),
917 : cluster1->Position().X(),cluster1->Position().Y()));
918 :
919 0 : fClusterList.Add(cluster1);
920 0 : }
921 0 : }
922 :
923 : //_____________________________________________________________________________
924 : AliMUONClusterFinderPeakCOG&
925 : AliMUONClusterFinderPeakCOG::operator=(const AliMUONClusterFinderPeakCOG& rhs)
926 : {
927 : /// Protected assignement operator
928 :
929 0 : if (this == &rhs) return *this;
930 :
931 0 : AliFatal("Not implemented.");
932 :
933 0 : return *this;
934 0 : }
935 :
936 : //_____________________________________________________________________________
937 : void AliMUONClusterFinderPeakCOG::PadsInXandY(AliMUONCluster& cluster,
938 : Int_t &nInX, Int_t &nInY) const
939 : {
940 : /// Find number of pads in X and Y-directions (excluding virtual ones and
941 : /// overflows)
942 :
943 : //Int_t statusToTest = 1;
944 : Int_t statusToTest = fgkUseForFit;
945 :
946 : //if ( nInX < 0 ) statusToTest = 0;
947 0 : if ( nInX < 0 ) statusToTest = fgkZero;
948 :
949 : Bool_t mustMatch(kTRUE);
950 :
951 0 : Long_t cn = cluster.NofPads(statusToTest,mustMatch);
952 :
953 0 : nInX = AliMp::PairFirst(cn);
954 0 : nInY = AliMp::PairSecond(cn);
955 0 : }
956 :
957 : //_____________________________________________________________________________
958 : void AliMUONClusterFinderPeakCOG::RemovePixel(Int_t i)
959 : {
960 : /// Remove pixel at index i
961 0 : AliMUONPad* pixPtr = Pixel(i);
962 0 : fPixArray->RemoveAt(i);
963 0 : delete pixPtr;
964 0 : }
965 :
966 : //_____________________________________________________________________________
967 : AliMUONPad*
968 : AliMUONClusterFinderPeakCOG::Pixel(Int_t i) const
969 : {
970 : /// Returns pixel at index i
971 0 : return static_cast<AliMUONPad*>(fPixArray->UncheckedAt(i));
972 : }
973 :
974 : //_____________________________________________________________________________
975 : void
976 : AliMUONClusterFinderPeakCOG::Print(Option_t* what) const
977 : {
978 : /// printout
979 0 : TString swhat(what);
980 0 : swhat.ToLower();
981 0 : if ( swhat.Contains("precluster") )
982 : {
983 0 : if ( fPreCluster) fPreCluster->Print();
984 : }
985 0 : }
986 :
987 :
|
