]>
Commit | Line | Data |
---|---|---|
73042f01 | 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 | ||
88cb7938 | 16 | /* $Id$ */ |
73042f01 | 17 | |
18 | //------------------------------------------------------- | |
19 | // Implementation of the TPC clusterer | |
20 | // | |
21 | // Origin: Jouri Belikov, CERN, Jouri.Belikov@cern.ch | |
22 | //------------------------------------------------------- | |
23 | ||
24 | #include "AliTPCclusterer.h" | |
25 | #include "AliTPCcluster.h" | |
26 | #include <TObjArray.h> | |
27 | #include <TFile.h> | |
73042f01 | 28 | #include "AliDigits.h" |
29 | #include "AliSimDigits.h" | |
30 | #include "AliTPCParam.h" | |
d7cbafb5 | 31 | #include "AliTPCClustersRow.h" |
c3c63118 | 32 | #include <TTree.h> |
c630aafd | 33 | |
34 | ClassImp(AliTPCclusterer) | |
35 | ||
36 | AliTPCclusterer::AliTPCclusterer(const AliTPCParam *par) { | |
37 | //------------------------------------------------------- | |
38 | // The main constructor | |
39 | //------------------------------------------------------- | |
d7cbafb5 | 40 | fPar=par; |
c630aafd | 41 | } |
73042f01 | 42 | |
43 | void AliTPCclusterer::FindPeaks(Int_t k,Int_t max, | |
44 | AliBin *b,Int_t *idx,UInt_t *msk,Int_t& n) { | |
45 | //find local maxima | |
46 | if (n<31) | |
47 | if (IsMaximum(k,max,b)) { | |
48 | idx[n]=k; msk[n]=(2<<n); | |
49 | n++; | |
50 | } | |
51 | b[k].SetMask(0); | |
52 | if (b[k-max].GetMask()&1) FindPeaks(k-max,max,b,idx,msk,n); | |
53 | if (b[k-1 ].GetMask()&1) FindPeaks(k-1 ,max,b,idx,msk,n); | |
54 | if (b[k+max].GetMask()&1) FindPeaks(k+max,max,b,idx,msk,n); | |
55 | if (b[k+1 ].GetMask()&1) FindPeaks(k+1 ,max,b,idx,msk,n); | |
56 | } | |
57 | ||
58 | void AliTPCclusterer::MarkPeak(Int_t k, Int_t max, AliBin *bins, UInt_t m) { | |
59 | //mark this peak | |
60 | UShort_t q=bins[k].GetQ(); | |
61 | ||
62 | bins[k].SetMask(bins[k].GetMask()|m); | |
63 | ||
64 | if (bins[k-max].GetQ() <= q) | |
65 | if ((bins[k-max].GetMask()&m) == 0) MarkPeak(k-max,max,bins,m); | |
66 | if (bins[k-1 ].GetQ() <= q) | |
67 | if ((bins[k-1 ].GetMask()&m) == 0) MarkPeak(k-1 ,max,bins,m); | |
68 | if (bins[k+max].GetQ() <= q) | |
69 | if ((bins[k+max].GetMask()&m) == 0) MarkPeak(k+max,max,bins,m); | |
70 | if (bins[k+1 ].GetQ() <= q) | |
71 | if ((bins[k+1 ].GetMask()&m) == 0) MarkPeak(k+1 ,max,bins,m); | |
72 | } | |
73 | ||
74 | void AliTPCclusterer::MakeCluster(Int_t k,Int_t max,AliBin *bins,UInt_t m, | |
75 | AliTPCcluster &c) { | |
76 | //make cluster using digits of this peak | |
77 | Float_t q=(Float_t)bins[k].GetQ(); | |
78 | Int_t i=k/max, j=k-i*max; | |
79 | ||
80 | c.SetQ(c.GetQ()+q); | |
81 | c.SetY(c.GetY()+i*q); | |
82 | c.SetZ(c.GetZ()+j*q); | |
83 | c.SetSigmaY2(c.GetSigmaY2()+i*i*q); | |
84 | c.SetSigmaZ2(c.GetSigmaZ2()+j*j*q); | |
85 | ||
86 | bins[k].SetMask(0xFFFFFFFE); | |
87 | ||
88 | if (bins[k-max].GetMask() == m) MakeCluster(k-max,max,bins,m,c); | |
89 | if (bins[k-1 ].GetMask() == m) MakeCluster(k-1 ,max,bins,m,c); | |
90 | if (bins[k+max].GetMask() == m) MakeCluster(k+max,max,bins,m,c); | |
91 | if (bins[k+1 ].GetMask() == m) MakeCluster(k+1 ,max,bins,m,c); | |
92 | } | |
93 | ||
94 | //_____________________________________________________________________________ | |
c630aafd | 95 | Int_t AliTPCclusterer::Digits2Clusters(TTree *dTree, TTree *cTree) { |
73042f01 | 96 | //----------------------------------------------------------------- |
97 | // This is a simple cluster finder. | |
98 | //----------------------------------------------------------------- | |
c630aafd | 99 | TBranch *branch=dTree->GetBranch("Segment"); |
100 | if (!branch) { | |
101 | Error("Digits2Cluster","Can't get the branch !"); | |
102 | return 1; | |
6e4d905e | 103 | } |
73042f01 | 104 | AliSimDigits digarr, *dummy=&digarr; |
c630aafd | 105 | branch->SetAddress(&dummy); |
88cb7938 | 106 | |
d7cbafb5 | 107 | AliTPCClustersRow ddd,*clrow=&ddd; |
108 | clrow->SetClass("AliTPCcluster"); clrow->SetArray(1); | |
109 | cTree->Branch("Segment","AliTPCClustersRow",&clrow,32000,200); | |
afc42102 | 110 | |
d7cbafb5 | 111 | const Int_t kMAXZ=fPar->GetMaxTBin()+2; |
afc42102 | 112 | |
73042f01 | 113 | Int_t nclusters=0; |
114 | ||
c630aafd | 115 | Int_t nentries = (Int_t)dTree->GetEntries(); |
116 | for (Int_t n=0; n<nentries; n++) { | |
88cb7938 | 117 | |
73042f01 | 118 | Int_t sec, row; |
c630aafd | 119 | dTree->GetEvent(n); |
88cb7938 | 120 | |
d7cbafb5 | 121 | if (!fPar->AdjustSectorRow(digarr.GetID(),sec,row)) { |
c630aafd | 122 | Error("Digits2Clusters","!nvalid segment ID ! %d",digarr.GetID()); |
73042f01 | 123 | continue; |
124 | } | |
125 | ||
d7cbafb5 | 126 | clrow=new AliTPCClustersRow(); |
127 | ||
128 | clrow->SetClass("AliTPCcluster"); clrow->SetArray(1); | |
129 | clrow->SetID(digarr.GetID()); | |
73042f01 | 130 | |
d7cbafb5 | 131 | cTree->GetBranch("Segment")->SetAddress(&clrow); |
132 | ||
133 | Float_t rx=fPar->GetPadRowRadii(sec,row); | |
73042f01 | 134 | |
135 | Int_t npads, sign; | |
136 | { | |
d7cbafb5 | 137 | const Int_t kNIS=fPar->GetNInnerSector(), kNOS=fPar->GetNOuterSector(); |
73042f01 | 138 | if (sec < kNIS) { |
d7cbafb5 | 139 | npads = fPar->GetNPadsLow(row); |
73042f01 | 140 | sign = (sec < kNIS/2) ? 1 : -1; |
141 | } else { | |
d7cbafb5 | 142 | npads = fPar->GetNPadsUp(row); |
73042f01 | 143 | sign = ((sec-kNIS) < kNOS/2) ? 1 : -1; |
144 | } | |
145 | } | |
146 | ||
147 | const Int_t kMAXBIN=kMAXZ*(npads+2); | |
148 | AliBin *bins=new AliBin[kMAXBIN]; | |
149 | for (Int_t ii=0;ii<kMAXBIN;ii++) { | |
150 | bins[ii].SetQ(0); bins[ii].SetMask(0xFFFFFFFE); | |
151 | } | |
152 | ||
153 | digarr.First(); | |
154 | do { | |
155 | Short_t dig=digarr.CurrentDigit(); | |
d7cbafb5 | 156 | if (dig<=fPar->GetZeroSup()) continue; |
73042f01 | 157 | Int_t j=digarr.CurrentRow()+1, i=digarr.CurrentColumn()+1; |
158 | bins[i*kMAXZ+j].SetQ(dig); | |
159 | bins[i*kMAXZ+j].SetMask(1); | |
160 | } while (digarr.Next()); | |
161 | ||
162 | Int_t ncl=0; | |
163 | for (Int_t i=0; i<kMAXBIN; i++) { | |
164 | if ((bins[i].GetMask()&1) == 0) continue; | |
165 | Int_t idx[32]; UInt_t msk[32]; Int_t npeaks=0; | |
166 | FindPeaks(i, kMAXZ, bins, idx, msk, npeaks); | |
167 | ||
168 | if (npeaks>30) continue; | |
169 | ||
170 | Int_t k,l; | |
171 | for (k=0; k<npeaks-1; k++){//mark adjacent peaks | |
172 | if (idx[k] < 0) continue; //this peak is already removed | |
173 | for (l=k+1; l<npeaks; l++) { | |
174 | if (idx[l] < 0) continue; //this peak is already removed | |
175 | Int_t ki=idx[k]/kMAXZ, kj=idx[k] - ki*kMAXZ; | |
176 | Int_t li=idx[l]/kMAXZ, lj=idx[l] - li*kMAXZ; | |
177 | Int_t di=TMath::Abs(ki - li); | |
178 | Int_t dj=TMath::Abs(kj - lj); | |
179 | if (di>1 || dj>1) continue; | |
180 | if (bins[idx[k]].GetQ() > bins[idx[l]].GetQ()) { | |
181 | msk[l]=msk[k]; | |
182 | idx[l]*=-1; | |
183 | } else { | |
184 | msk[k]=msk[l]; | |
185 | idx[k]*=-1; | |
186 | break; | |
187 | } | |
188 | } | |
189 | } | |
190 | ||
191 | for (k=0; k<npeaks; k++) { | |
192 | MarkPeak(TMath::Abs(idx[k]), kMAXZ, bins, msk[k]); | |
193 | } | |
194 | ||
195 | for (k=0; k<npeaks; k++) { | |
196 | if (idx[k] < 0) continue; //removed peak | |
197 | AliTPCcluster c; | |
198 | MakeCluster(idx[k], kMAXZ, bins, msk[k], c); | |
199 | if (c.GetQ() < 5) continue; //noise cluster | |
200 | c.SetY(c.GetY()/c.GetQ()); | |
201 | c.SetZ(c.GetZ()/c.GetQ()); | |
202 | ||
203 | Float_t s2 = c.GetSigmaY2()/c.GetQ() - c.GetY()*c.GetY(); | |
d7cbafb5 | 204 | Float_t w=fPar->GetPadPitchWidth(sec); |
73042f01 | 205 | c.SetSigmaY2((s2 + 1./12.)*w*w); |
206 | if (s2 != 0.) { | |
207 | c.SetSigmaY2(c.GetSigmaY2()*0.108); | |
d7cbafb5 | 208 | if (sec<fPar->GetNInnerSector()) c.SetSigmaY2(c.GetSigmaY2()*2.07); |
73042f01 | 209 | } |
210 | ||
211 | s2 = c.GetSigmaZ2()/c.GetQ() - c.GetZ()*c.GetZ(); | |
d7cbafb5 | 212 | w=fPar->GetZWidth(); |
73042f01 | 213 | c.SetSigmaZ2((s2 + 1./12.)*w*w); |
214 | if (s2 != 0.) { | |
215 | c.SetSigmaZ2(c.GetSigmaZ2()*0.169); | |
d7cbafb5 | 216 | if (sec<fPar->GetNInnerSector()) c.SetSigmaZ2(c.GetSigmaZ2()*1.77); |
73042f01 | 217 | } |
218 | ||
d7cbafb5 | 219 | c.SetY((c.GetY() - 0.5 - 0.5*npads)*fPar->GetPadPitchWidth(sec)); |
220 | c.SetZ(fPar->GetZWidth()*(c.GetZ()-1)); | |
221 | c.SetZ(c.GetZ() - 3.*fPar->GetZSigma()); // PASA delay | |
222 | c.SetZ(sign*(fPar->GetZLength() - c.GetZ())); | |
73042f01 | 223 | |
224 | if (rx<230./250.*TMath::Abs(c.GetZ())) continue; | |
225 | ||
226 | Int_t ki=idx[k]/kMAXZ, kj=idx[k] - ki*kMAXZ; | |
227 | c.SetLabel(digarr.GetTrackID(kj-1,ki-1,0),0); | |
228 | c.SetLabel(digarr.GetTrackID(kj-1,ki-1,1),1); | |
229 | c.SetLabel(digarr.GetTrackID(kj-1,ki-1,2),2); | |
230 | ||
231 | c.SetQ(bins[idx[k]].GetQ()); | |
232 | ||
233 | if (ki==1 || ki==npads || kj==1 || kj==kMAXZ-2) { | |
234 | c.SetSigmaY2(c.GetSigmaY2()*25.); | |
235 | c.SetSigmaZ2(c.GetSigmaZ2()*4.); | |
236 | } | |
237 | clrow->InsertCluster(&c); ncl++; | |
238 | } | |
239 | } | |
d7cbafb5 | 240 | cTree->Fill(); |
241 | ||
242 | delete clrow; | |
73042f01 | 243 | |
244 | nclusters+=ncl; | |
245 | ||
246 | delete[] bins; | |
247 | } | |
248 | ||
c630aafd | 249 | Info("Digits2Cluster","Number of found clusters : %d",nclusters); |
f38c8ae5 | 250 | |
c630aafd | 251 | return 0; |
73042f01 | 252 | } |
253 |