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 // Implementation of the TPC clusterer
21 // Origin: Marian Ivanov
22 //-------------------------------------------------------
24 #include "AliTPCclustererMI.h"
25 #include "AliTPCclusterMI.h"
26 #include <TObjArray.h>
28 #include "AliTPCClustersArray.h"
29 #include "AliTPCClustersRow.h"
30 #include "AliDigits.h"
31 #include "AliSimDigits.h"
32 #include "AliTPCParam.h"
36 ClassImp(AliTPCclustererMI)
40 AliTPCclustererMI::AliTPCclustererMI()
45 void AliTPCclustererMI::SetInput(TTree * tree)
48 // set input tree with digits
51 if (!fInput->GetBranch("Segment")){
52 cerr<<"AliTPC::Digits2Clusters(): no porper input tree !\n";
58 void AliTPCclustererMI::SetOutput(TTree * tree)
63 AliTPCClustersRow clrow;
64 AliTPCClustersRow *pclrow=&clrow;
65 clrow.SetClass("AliTPCclusterMI");
66 clrow.SetArray(1); // to make Clones array
67 fOutput->Branch("Segment","AliTPCClustersRow",&pclrow,32000,200);
71 Float_t AliTPCclustererMI::GetSigmaY2(Int_t iz){
72 // sigma y2 = in digits - we don't know the angle
73 Float_t z = iz*fParam->GetZWidth();
74 Float_t sd2 = (z*fParam->GetDiffL()*fParam->GetDiffL())/
75 (fPadWidth*fPadWidth);
77 Float_t res = sd2+sres;
82 Float_t AliTPCclustererMI::GetSigmaZ2(Int_t iz){
83 //sigma z2 = in digits - angle estimated supposing vertex constraint
84 Float_t z = iz*fZWidth;
85 Float_t sd2 = (z*fParam->GetDiffL()*fParam->GetDiffL())/(fZWidth*fZWidth);
86 Float_t angular = fPadLength*(fParam->GetZLength()-z)/(fRx*fZWidth);
89 Float_t sres = fParam->GetZSigma()/fZWidth;
91 Float_t res = angular +sd2+sres;
95 void AliTPCclustererMI::MakeCluster(Int_t k,Int_t max,Int_t *bins, UInt_t m,
98 Int_t i0=k/max; //central pad
99 Int_t j0=k%max; //central time bin
101 // set pointers to data
102 //Int_t dummy[5] ={0,0,0,0,0};
103 Int_t * matrix[5]; //5x5 matrix with digits - indexing i = 0 ..4 j = -2..2
104 Int_t * resmatrix[5];
105 for (Int_t di=-2;di<=2;di++){
106 matrix[di+2] = &bins[k+di*max];
107 resmatrix[di+2] = &fResBins[k+di*max];
109 //build matrix with virtual charge
110 Float_t sigmay2= GetSigmaY2(j0);
111 Float_t sigmaz2= GetSigmaZ2(j0);
113 Float_t vmatrix[5][5];
114 vmatrix[2][2] = matrix[2][0];
116 c.SetMax(Short_t(vmatrix[2][2])); // write maximal amplitude
117 for (Int_t di =-1;di <=1;di++)
118 for (Int_t dj =-1;dj <=1;dj++){
119 Float_t amp = matrix[di+2][dj];
120 if ( (amp<2) && (fLoop<2)){
121 // if under threshold - calculate virtual charge
122 Float_t ratio = TMath::Exp(-1.2*TMath::Abs(di)/sigmay2)*TMath::Exp(-1.2*TMath::Abs(dj)/sigmaz2);
123 amp = ((matrix[2][0]-2)*(matrix[2][0]-2)/(matrix[-di+2][-dj]+2))*ratio;
125 vmatrix[2+di][2+dj]=amp;
126 vmatrix[2+2*di][2+2*dj]=0;
129 vmatrix[2+2*di][2+dj] =0;
130 vmatrix[2+di][2+2*dj] =0;
135 //if small amplitude - below 2 x threshold - don't consider other one
136 vmatrix[2+di][2+dj]=amp;
137 vmatrix[2+2*di][2+2*dj]=0; // don't take to the account next bin
140 vmatrix[2+2*di][2+dj] =0;
141 vmatrix[2+di][2+2*dj] =0;
145 //if bigger then take everything
146 vmatrix[2+di][2+dj]=amp;
147 vmatrix[2+2*di][2+2*dj]= matrix[2*di+2][2*dj] ;
150 vmatrix[2+2*di][2+dj] = matrix[2*di+2][dj];
151 vmatrix[2+di][2+2*dj] = matrix[2+di][dj*2];
163 for (Int_t i=-2;i<=2;i++)
164 for (Int_t j=-2;j<=2;j++){
165 Float_t amp = vmatrix[i+2][j+2];
174 Float_t meani = sumiw/sumw;
175 Float_t mi2 = sumi2w/sumw-meani*meani;
176 Float_t meanj = sumjw/sumw;
177 Float_t mj2 = sumj2w/sumw-meanj*meanj;
179 Float_t ry = mi2/sigmay2;
180 Float_t rz = mj2/sigmaz2;
183 if ( ( (ry<0.6) || (rz<0.6) ) && fLoop==2) return;
184 if ( (ry <1.2) && (rz<1.2) ) {
185 //if cluster looks like expected
186 //+1.2 deviation from expected sigma accepted
187 // c.fMax = FitMax(vmatrix,meani,meanj,TMath::Sqrt(sigmay2),TMath::Sqrt(sigmaz2));
191 //set cluster parameters
193 c.SetY(meani*fPadWidth);
194 c.SetZ(meanj*fZWidth);
198 //remove cluster data from data
199 for (Int_t di=-2;di<=2;di++)
200 for (Int_t dj=-2;dj<=2;dj++){
201 resmatrix[di+2][dj] -= Int_t(vmatrix[di+2][dj+2]);
202 if (resmatrix[di+2][dj]<0) resmatrix[di+2][dj]=0;
208 //unfolding when neccessary
211 Int_t * matrix2[7]; //7x7 matrix with digits - indexing i = 0 ..6 j = -3..3
212 Int_t dummy[7]={0,0,0,0,0,0};
213 for (Int_t di=-3;di<=3;di++){
214 matrix2[di+3] = &bins[k+di*max];
215 if ((k+di*max)<3) matrix2[di+3] = &dummy[3];
216 if ((k+di*max)>fMaxBin-3) matrix2[di+3] = &dummy[3];
218 Float_t vmatrix2[5][5];
221 UnfoldCluster(matrix2,vmatrix2,meani,meanj,sumu,overlap);
223 // c.fMax = FitMax(vmatrix2,meani,meanj,TMath::Sqrt(sigmay2),TMath::Sqrt(sigmaz2));
226 //set cluster parameters
228 c.SetY(meani*fPadWidth);
229 c.SetZ(meanj*fZWidth);
232 c.SetType(Char_t(overlap)+1);
239 printf("%f\t%f\n", vmatrix2[2][2], vmatrix[2][2]);
244 void AliTPCclustererMI::UnfoldCluster(Int_t * matrix2[7], Float_t recmatrix[5][5], Float_t & meani, Float_t & meanj,
245 Float_t & sumu, Float_t & overlap )
248 //unfold cluster from input matrix
249 //data corresponding to cluster writen in recmatrix
250 //output meani and meanj
252 //take separatelly y and z
254 Float_t sum3i[7] = {0,0,0,0,0,0,0};
255 Float_t sum3j[7] = {0,0,0,0,0,0,0};
257 for (Int_t k =0;k<7;k++)
258 for (Int_t l = -1; l<=1;l++){
259 sum3i[k]+=matrix2[k][l];
260 sum3j[k]+=matrix2[l+3][k-3];
262 Float_t mratio[3][3]={{1,1,1},{1,1,1},{1,1,1}};
265 Float_t sum3wi = 0; //charge minus overlap
266 Float_t sum3wio = 0; //full charge
267 Float_t sum3iw = 0; //sum for mean value
268 for (Int_t dk=-1;dk<=1;dk++){
269 sum3wio+=sum3i[dk+3];
275 if ( ( ((sum3i[dk+3]+3)/(sum3i[3]-3))+1 < (sum3i[2*dk+3]-3)/(sum3i[dk+3]+3))||
276 sum3i[dk+3]<=sum3i[2*dk+3] && sum3i[dk+3]>2 ){
277 Float_t xm2 = sum3i[-dk+3];
278 Float_t xm1 = sum3i[+3];
279 Float_t x1 = sum3i[2*dk+3];
280 Float_t x2 = sum3i[3*dk+3];
281 Float_t w11 = TMath::Max(4.*xm1-xm2,0.000001);
282 Float_t w12 = TMath::Max(4 *x1 -x2,0.);
283 ratio = w11/(w11+w12);
284 for (Int_t dl=-1;dl<=1;dl++)
285 mratio[dk+1][dl+1] *= ratio;
287 Float_t amp = sum3i[dk+3]*ratio;
292 meani = sum3iw/sum3wi;
293 Float_t overlapi = (sum3wio-sum3wi)/sum3wio;
298 Float_t sum3wj = 0; //charge minus overlap
299 Float_t sum3wjo = 0; //full charge
300 Float_t sum3jw = 0; //sum for mean value
301 for (Int_t dk=-1;dk<=1;dk++){
302 sum3wjo+=sum3j[dk+3];
308 if ( ( ((sum3j[dk+3]+3)/(sum3j[3]-3))+1 < (sum3j[2*dk+3]-3)/(sum3j[dk+3]+3)) ||
309 (sum3j[dk+3]<=sum3j[2*dk+3] && sum3j[dk+3]>2)){
310 Float_t xm2 = sum3j[-dk+3];
311 Float_t xm1 = sum3j[+3];
312 Float_t x1 = sum3j[2*dk+3];
313 Float_t x2 = sum3j[3*dk+3];
314 Float_t w11 = TMath::Max(4.*xm1-xm2,0.000001);
315 Float_t w12 = TMath::Max(4 *x1 -x2,0.);
316 ratio = w11/(w11+w12);
317 for (Int_t dl=-1;dl<=1;dl++)
318 mratio[dl+1][dk+1] *= ratio;
320 Float_t amp = sum3j[dk+3]*ratio;
325 meanj = sum3jw/sum3wj;
326 Float_t overlapj = (sum3wjo-sum3wj)/sum3wjo;
327 overlap = Int_t(100*TMath::Max(overlapi,overlapj)+3);
328 sumu = (sum3wj+sum3wi)/2.;
331 //if not overlap detected remove everything
332 for (Int_t di =-2; di<=2;di++)
333 for (Int_t dj =-2; dj<=2;dj++){
334 recmatrix[di+2][dj+2] = matrix2[3+di][dj];
338 for (Int_t di =-1; di<=1;di++)
339 for (Int_t dj =-1; dj<=1;dj++){
341 if (mratio[di+1][dj+1]==1){
342 recmatrix[di+2][dj+2] = matrix2[3+di][dj];
343 if (TMath::Abs(di)+TMath::Abs(dj)>1){
344 recmatrix[2*di+2][dj+2] = matrix2[3+2*di][dj];
345 recmatrix[di+2][2*dj+2] = matrix2[3+di][2*dj];
347 recmatrix[2*di+2][2*dj+2] = matrix2[3+2*di][2*dj];
351 //if we have overlap in direction
352 recmatrix[di+2][dj+2] = mratio[di+1][dj+1]* matrix2[3+di][dj];
353 if (TMath::Abs(di)+TMath::Abs(dj)>1){
354 ratio = TMath::Min(recmatrix[di+2][dj+2]/(matrix2[3+0*di][1*dj]+1),1.);
355 recmatrix[2*di+2][dj+2] = ratio*recmatrix[di+2][dj+2];
357 ratio = TMath::Min(recmatrix[di+2][dj+2]/(matrix2[3+1*di][0*dj]+1),1.);
358 recmatrix[di+2][2*dj+2] = ratio*recmatrix[di+2][dj+2];
361 ratio = recmatrix[di+2][dj+2]/matrix2[3][0];
362 recmatrix[2*di+2][2*dj+2] = ratio*recmatrix[di+2][dj+2];
368 printf("%f\n", recmatrix[2][2]);
372 Float_t AliTPCclustererMI::FitMax(Float_t vmatrix[5][5], Float_t y, Float_t z, Float_t sigmay, Float_t sigmaz)
379 for (Int_t di = -1;di<=1;di++)
380 for (Int_t dj = -1;dj<=1;dj++){
381 if (vmatrix[2+di][2+dj]>2){
382 Float_t teor = TMath::Gaus(di,y,sigmay*1.2)*TMath::Gaus(dj,z,sigmaz*1.2);
383 sumteor += teor*vmatrix[2+di][2+dj];
384 sumamp += vmatrix[2+di][2+dj]*vmatrix[2+di][2+dj];
387 Float_t max = sumamp/sumteor;
391 void AliTPCclustererMI::AddCluster(AliTPCclusterMI &c){
393 // transform cluster to the global coordinata
394 // add the cluster to the array
396 Float_t meani = c.GetY()/fPadWidth;
397 Float_t meanj = c.GetZ()/fZWidth;
399 Int_t ki = TMath::Nint(meani-3);
401 if (ki>=fMaxPad) ki = fMaxPad-1;
402 Int_t kj = TMath::Nint(meanj-3);
404 if (kj>=fMaxTime-3) kj=fMaxTime-4;
405 // ki and kj shifted to "real" coordinata
406 c.SetLabel(fRowDig->GetTrackIDFast(kj,ki,0)-2,0);
407 c.SetLabel(fRowDig->GetTrackIDFast(kj,ki,1)-2,1);
408 c.SetLabel(fRowDig->GetTrackIDFast(kj,ki,2)-2,2);
411 Float_t s2 = c.GetSigmaY2();
412 Float_t w=fParam->GetPadPitchWidth(fSector);
414 c.SetSigmaY2(s2*w*w);
417 c.SetSigmaZ2(s2*w*w);
418 c.SetY((meani - 2.5 - 0.5*fMaxPad)*fParam->GetPadPitchWidth(fSector));
419 c.SetZ(fZWidth*(meanj-3));
420 c.SetZ(c.GetZ() - 3.*fParam->GetZSigma()); // PASA delay
421 c.SetZ(fSign*(fParam->GetZLength() - c.GetZ()));
423 if (ki<=1 || ki>=fMaxPad-1 || kj==1 || kj==fMaxTime-2) {
424 //c.SetSigmaY2(c.GetSigmaY2()*25.);
425 //c.SetSigmaZ2(c.GetSigmaZ2()*4.);
426 c.SetType(-(c.GetType()+3)); //edge clusters
428 if (fLoop==2) c.SetType(100);
430 TClonesArray * arr = fRowCl->GetArray();
431 AliTPCclusterMI * cl = new ((*arr)[fNcluster]) AliTPCclusterMI(c);
437 //_____________________________________________________________________________
438 void AliTPCclustererMI::Digits2Clusters(const AliTPCParam *par, Int_t eventn)
440 //-----------------------------------------------------------------
441 // This is a simple cluster finder.
442 //-----------------------------------------------------------------
443 TDirectory *savedir=gDirectory;
446 cerr<<"AliTPC::Digits2Clusters(): input tree not initialised !\n";
451 cerr<<"AliTPC::Digits2Clusters(): output tree not initialised !\n";
455 AliSimDigits digarr, *dummy=&digarr;
457 fInput->GetBranch("Segment")->SetAddress(&dummy);
458 Stat_t nentries = fInput->GetEntries();
460 fMaxTime=par->GetMaxTBin()+6; // add 3 virtual time bins before and 3 after
463 ((AliTPCParam*)par)->Write(par->GetTitle());
467 for (Int_t n=0; n<nentries; n++) {
470 if (!par->AdjustSectorRow(digarr.GetID(),fSector,row)) {
471 cerr<<"AliTPC warning: invalid segment ID ! "<<digarr.GetID()<<endl;
475 AliTPCClustersRow *clrow= new AliTPCClustersRow();
477 clrow->SetClass("AliTPCclusterMI");
480 clrow->SetID(digarr.GetID());
481 fOutput->GetBranch("Segment")->SetAddress(&clrow);
482 fRx=par->GetPadRowRadii(fSector,row);
485 const Int_t kNIS=par->GetNInnerSector(), kNOS=par->GetNOuterSector();
486 fZWidth = fParam->GetZWidth();
487 if (fSector < kNIS) {
488 fMaxPad = par->GetNPadsLow(row);
489 fSign = (fSector < kNIS/2) ? 1 : -1;
490 fPadLength = par->GetPadPitchLength(fSector,row);
491 fPadWidth = par->GetPadPitchWidth();
493 fMaxPad = par->GetNPadsUp(row);
494 fSign = ((fSector-kNIS) < kNOS/2) ? 1 : -1;
495 fPadLength = par->GetPadPitchLength(fSector,row);
496 fPadWidth = par->GetPadPitchWidth();
500 fMaxBin=fMaxTime*(fMaxPad+6); // add 3 virtual pads before and 3 after
501 fBins =new Int_t[fMaxBin];
502 fResBins =new Int_t[fMaxBin]; //fBins with residuals after 1 finder loop
503 memset(fBins,0,sizeof(Int_t)*fMaxBin);
505 if (digarr.First()) //MI change
507 Short_t dig=digarr.CurrentDigit();
508 if (dig<=par->GetZeroSup()) continue;
509 Int_t j=digarr.CurrentRow()+3, i=digarr.CurrentColumn()+3;
510 fBins[i*fMaxTime+j]=dig;
511 } while (digarr.Next());
512 digarr.ExpandTrackBuffer();
514 //add virtual charge at the edge
515 for (Int_t i=0; i<fMaxTime; i++){
516 Float_t amp1 = fBins[i+3*fMaxTime];
519 Float_t amp2 = fBins[i+4*fMaxTime];
520 if (amp2==0) amp2=0.5;
521 Float_t sigma2 = GetSigmaY2(i);
522 amp0 = (amp1*amp1/amp2)*TMath::Exp(-1./sigma2);
523 if (gDebug>4) printf("\n%f\n",amp0);
525 fBins[i+2*fMaxTime] = Int_t(amp0);
527 amp1 = fBins[(fMaxPad+2)*fMaxTime+i];
529 Float_t amp2 = fBins[i+(fMaxPad+1)*fMaxTime];
530 if (amp2==0) amp2=0.5;
531 Float_t sigma2 = GetSigmaY2(i);
532 amp0 = (amp1*amp1/amp2)*TMath::Exp(-1./sigma2);
533 if (gDebug>4) printf("\n%f\n",amp0);
535 fBins[(fMaxPad+3)*fMaxTime+i] = Int_t(amp0);
538 memcpy(fResBins,fBins, fMaxBin*2);
541 //first loop - for "gold cluster"
543 Int_t *b=&fBins[-1]+2*fMaxTime;
544 Int_t crtime = (fParam->GetZLength()-1.05*fRx)/fZWidth-5;
546 for (Int_t i=2*fMaxTime; i<fMaxBin-2*fMaxTime; i++) {
548 if (*b<8) continue; //threshold form maxima
549 if (i%fMaxTime<crtime) {
550 Int_t delta = -(i%fMaxTime)+crtime;
556 if (!IsMaximum(*b,fMaxTime,b)) continue;
559 MakeCluster(i, fMaxTime, fBins, dummy,c);
562 //memcpy(fBins,fResBins, fMaxBin*2);
563 //second loop - for rest cluster
566 b=&fResBins[-1]+2*fMaxTime;
567 for (Int_t i=2*fMaxTime; i<fMaxBin-2*fMaxTime; i++) {
569 if (*b<25) continue; // bigger threshold for maxima
570 if (!IsMaximum(*b,fMaxTime,b)) continue;
573 MakeCluster(i, fMaxTime, fResBins, dummy,c);
580 nclusters+=fNcluster;
584 cerr<<"Number of found clusters : "<<nclusters<<" \n";