]>
Commit | Line | Data |
---|---|---|
e4f2f73d | 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 | // // | |
20 | // The TRD track seed // | |
21 | // // | |
22 | // Authors: // | |
23 | // Alex Bercuci <A.Bercuci@gsi.de> // | |
24 | // Markus Fasel <M.Fasel@gsi.de> // | |
25 | // // | |
26 | //////////////////////////////////////////////////////////////////////////// | |
27 | ||
28 | #include "TMath.h" | |
29 | #include "TLinearFitter.h" | |
eb38ed55 | 30 | #include "TClonesArray.h" // tmp |
31 | #include <TTreeStream.h> | |
e4f2f73d | 32 | |
33 | #include "AliLog.h" | |
34 | #include "AliMathBase.h" | |
35 | ||
36 | #include "AliTRDseedV1.h" | |
37 | #include "AliTRDcluster.h" | |
0906e73e | 38 | #include "AliTRDtrack.h" |
e4f2f73d | 39 | #include "AliTRDcalibDB.h" |
eb38ed55 | 40 | #include "AliTRDchamberTimeBin.h" |
41 | #include "AliTRDtrackingChamber.h" | |
42 | #include "AliTRDtrackerV1.h" | |
43 | #include "AliTRDReconstructor.h" | |
e4f2f73d | 44 | #include "AliTRDrecoParam.h" |
0906e73e | 45 | #include "AliTRDgeometry.h" |
46 | #include "Cal/AliTRDCalPID.h" | |
e4f2f73d | 47 | |
e4f2f73d | 48 | ClassImp(AliTRDseedV1) |
49 | ||
50 | //____________________________________________________________________ | |
eb38ed55 | 51 | AliTRDseedV1::AliTRDseedV1(Int_t plane) |
e4f2f73d | 52 | :AliTRDseed() |
eb38ed55 | 53 | ,fPlane(plane) |
0906e73e | 54 | ,fMom(0.) |
bcb6fb78 | 55 | ,fSnp(0.) |
56 | ,fTgl(0.) | |
57 | ,fdX(0.) | |
e4f2f73d | 58 | { |
59 | // | |
60 | // Constructor | |
61 | // | |
0906e73e | 62 | for(int islice=0; islice < knSlices; islice++) fdEdx[islice] = 0.; |
0906e73e | 63 | for(int ispec=0; ispec<AliPID::kSPECIES; ispec++) fProb[ispec] = -1.; |
e4f2f73d | 64 | } |
65 | ||
66 | //____________________________________________________________________ | |
0906e73e | 67 | AliTRDseedV1::AliTRDseedV1(const AliTRDseedV1 &ref) |
e4f2f73d | 68 | :AliTRDseed((AliTRDseed&)ref) |
0906e73e | 69 | ,fPlane(ref.fPlane) |
0906e73e | 70 | ,fMom(ref.fMom) |
bcb6fb78 | 71 | ,fSnp(ref.fSnp) |
72 | ,fTgl(ref.fTgl) | |
73 | ,fdX(ref.fdX) | |
e4f2f73d | 74 | { |
75 | // | |
76 | // Copy Constructor performing a deep copy | |
77 | // | |
78 | ||
79 | //AliInfo(""); | |
0906e73e | 80 | for(int islice=0; islice < knSlices; islice++) fdEdx[islice] = ref.fdEdx[islice]; |
0906e73e | 81 | for(int ispec=0; ispec<AliPID::kSPECIES; ispec++) fProb[ispec] = ref.fProb[ispec]; |
fbb2ea06 | 82 | } |
d9950a5a | 83 | |
0906e73e | 84 | |
e4f2f73d | 85 | //____________________________________________________________________ |
86 | AliTRDseedV1& AliTRDseedV1::operator=(const AliTRDseedV1 &ref) | |
87 | { | |
88 | // | |
89 | // Assignment Operator using the copy function | |
90 | // | |
91 | ||
92 | //AliInfo(""); | |
93 | if(this != &ref){ | |
94 | ref.Copy(*this); | |
95 | } | |
96 | return *this; | |
97 | ||
98 | } | |
99 | ||
100 | //____________________________________________________________________ | |
101 | AliTRDseedV1::~AliTRDseedV1() | |
102 | { | |
103 | // | |
104 | // Destructor. The RecoParam object belongs to the underlying tracker. | |
105 | // | |
106 | ||
107 | //AliInfo(Form("fOwner[%s]", fOwner?"YES":"NO")); | |
108 | ||
47d5d320 | 109 | if(IsOwner()) |
0906e73e | 110 | for(int itb=0; itb<knTimebins; itb++){ |
111 | if(!fClusters[itb]) continue; | |
112 | //AliInfo(Form("deleting c %p @ %d", fClusters[itb], itb)); | |
113 | delete fClusters[itb]; | |
114 | fClusters[itb] = 0x0; | |
115 | } | |
e4f2f73d | 116 | } |
117 | ||
118 | //____________________________________________________________________ | |
119 | void AliTRDseedV1::Copy(TObject &ref) const | |
120 | { | |
121 | // | |
122 | // Copy function | |
123 | // | |
124 | ||
125 | //AliInfo(""); | |
126 | AliTRDseedV1 &target = (AliTRDseedV1 &)ref; | |
127 | ||
0906e73e | 128 | target.fPlane = fPlane; |
129 | target.fMom = fMom; | |
bcb6fb78 | 130 | target.fSnp = fSnp; |
131 | target.fTgl = fTgl; | |
132 | target.fdX = fdX; | |
0906e73e | 133 | |
134 | for(int islice=0; islice < knSlices; islice++) target.fdEdx[islice] = fdEdx[islice]; | |
0906e73e | 135 | for(int ispec=0; ispec<AliPID::kSPECIES; ispec++) target.fProb[ispec] = fProb[ispec]; |
136 | ||
e4f2f73d | 137 | AliTRDseed::Copy(target); |
138 | } | |
139 | ||
0906e73e | 140 | |
141 | //____________________________________________________________ | |
142 | void AliTRDseedV1::Init(AliTRDtrack *track) | |
143 | { | |
144 | // Initialize this tracklet using the track information | |
145 | // | |
146 | // Parameters: | |
147 | // track - the TRD track used to initialize the tracklet | |
148 | // | |
149 | // Detailed description | |
150 | // The function sets the starting point and direction of the | |
151 | // tracklet according to the information from the TRD track. | |
152 | // | |
153 | // Caution | |
154 | // The TRD track has to be propagated to the beginning of the | |
155 | // chamber where the tracklet will be constructed | |
156 | // | |
157 | ||
158 | Double_t y, z; | |
159 | track->GetProlongation(fX0, y, z); | |
160 | fYref[0] = y; | |
33f721e9 | 161 | fYref[1] = track->GetSnp()/(1. - track->GetSnp()*track->GetSnp()); |
0906e73e | 162 | fZref[0] = z; |
33f721e9 | 163 | fZref[1] = track->GetTgl(); |
0906e73e | 164 | |
165 | //printf("Tracklet ref x[%7.3f] y[%7.3f] z[%7.3f], snp[%f] tgl[%f]\n", fX0, fYref[0], fZref[0], track->GetSnp(), track->GetTgl()); | |
166 | } | |
167 | ||
bcb6fb78 | 168 | |
169 | //____________________________________________________________________ | |
170 | void AliTRDseedV1::CookdEdx(Int_t nslices) | |
171 | { | |
172 | // Calculates average dE/dx for all slices and store them in the internal array fdEdx. | |
173 | // | |
174 | // Parameters: | |
175 | // nslices : number of slices for which dE/dx should be calculated | |
176 | // Output: | |
177 | // store results in the internal array fdEdx. This can be accessed with the method | |
178 | // AliTRDseedV1::GetdEdx() | |
179 | // | |
180 | // Detailed description | |
181 | // Calculates average dE/dx for all slices. Depending on the PID methode | |
182 | // the number of slices can be 3 (LQ) or 8(NN). | |
183 | // The calculation of dQ/dl are done using the tracklet fit results (see AliTRDseedV1::GetdQdl(Int_t)) i.e. | |
184 | // | |
185 | // dQ/dl = qc/(dx * sqrt(1 + dy/dx^2 + dz/dx^2)) | |
186 | // | |
187 | // The following effects are included in the calculation: | |
188 | // 1. calibration values for t0 and vdrift (using x coordinate to calculate slice) | |
189 | // 2. cluster sharing (optional see AliTRDrecoParam::SetClusterSharing()) | |
190 | // 3. cluster size | |
191 | // | |
192 | ||
193 | Int_t nclusters[knSlices]; | |
194 | for(int i=0; i<knSlices; i++){ | |
195 | fdEdx[i] = 0.; | |
196 | nclusters[i] = 0; | |
197 | } | |
198 | Float_t clength = (/*.5 * */AliTRDgeometry::AmThick() + AliTRDgeometry::DrThick()); | |
199 | ||
200 | AliTRDcluster *cluster = 0x0; | |
2985ffcb | 201 | for(int ic=0; ic<AliTRDtrackerV1::GetNTimeBins(); ic++){ |
bcb6fb78 | 202 | if(!(cluster = fClusters[ic])) continue; |
203 | Float_t x = cluster->GetX(); | |
204 | ||
205 | // Filter clusters for dE/dx calculation | |
206 | ||
207 | // 1.consider calibration effects for slice determination | |
208 | Int_t slice; | |
209 | if(cluster->IsInChamber()) slice = Int_t(TMath::Abs(fX0 - x) * nslices / clength); | |
210 | else slice = x < fX0 ? 0 : nslices-1; | |
211 | ||
212 | // 2. take sharing into account | |
213 | Float_t w = cluster->IsShared() ? .5 : 1.; | |
214 | ||
215 | // 3. take into account large clusters TODO | |
216 | //w *= c->GetNPads() > 3 ? .8 : 1.; | |
217 | ||
218 | //CHECK !!! | |
219 | fdEdx[slice] += w * GetdQdl(ic); //fdQdl[ic]; | |
220 | nclusters[slice]++; | |
221 | } // End of loop over clusters | |
222 | ||
223 | // calculate mean charge per slice | |
10f75631 | 224 | for(int is=0; is<nslices; is++){ |
225 | if(nclusters[is]) fdEdx[is] /= nclusters[is]; | |
226 | } | |
bcb6fb78 | 227 | } |
228 | ||
229 | //____________________________________________________________________ | |
230 | Float_t AliTRDseedV1::GetdQdl(Int_t ic) const | |
231 | { | |
10f75631 | 232 | return fClusters[ic] ? TMath::Abs(fClusters[ic]->GetQ()) /fdX / TMath::Sqrt(1. + fYfit[1]*fYfit[1] + fZref[1]*fZref[1]) : 0.; |
bcb6fb78 | 233 | } |
234 | ||
0906e73e | 235 | //____________________________________________________________________ |
236 | Double_t* AliTRDseedV1::GetProbability() | |
237 | { | |
238 | // Fill probability array for tracklet from the DB. | |
239 | // | |
240 | // Parameters | |
241 | // | |
242 | // Output | |
243 | // returns pointer to the probability array and 0x0 if missing DB access | |
244 | // | |
245 | // Detailed description | |
246 | ||
247 | ||
248 | // retrive calibration db | |
249 | AliTRDcalibDB *calibration = AliTRDcalibDB::Instance(); | |
250 | if (!calibration) { | |
251 | AliError("No access to calibration data"); | |
252 | return 0x0; | |
253 | } | |
254 | ||
255 | // Retrieve the CDB container class with the parametric detector response | |
eb38ed55 | 256 | const AliTRDCalPID *pd = calibration->GetPIDObject(AliTRDReconstructor::RecoParam()->GetPIDMethod()); |
0906e73e | 257 | if (!pd) { |
258 | AliError("No access to AliTRDCalPID object"); | |
259 | return 0x0; | |
260 | } | |
10f75631 | 261 | //AliInfo(Form("Method[%d] : %s", AliTRDReconstructor::RecoParam()->GetPIDMethod(), pd->IsA()->GetName())); |
262 | ||
0906e73e | 263 | // calculate tracklet length TO DO |
264 | Float_t length = (AliTRDgeometry::AmThick() + AliTRDgeometry::DrThick()); | |
265 | /// TMath::Sqrt((1.0 - fSnp[iPlane]*fSnp[iPlane]) / (1.0 + fTgl[iPlane]*fTgl[iPlane])); | |
266 | ||
267 | //calculate dE/dx | |
eb38ed55 | 268 | CookdEdx(AliTRDReconstructor::RecoParam()->GetNdEdxSlices()); |
0906e73e | 269 | |
270 | // Sets the a priori probabilities | |
271 | for(int ispec=0; ispec<AliPID::kSPECIES; ispec++) { | |
272 | fProb[ispec] = pd->GetProbability(ispec, fMom, &fdEdx[0], length, fPlane); | |
273 | } | |
274 | ||
275 | return &fProb[0]; | |
276 | } | |
277 | ||
e4f2f73d | 278 | //____________________________________________________________________ |
279 | Float_t AliTRDseedV1::GetQuality(Bool_t kZcorr) const | |
280 | { | |
281 | // | |
282 | // Returns a quality measurement of the current seed | |
283 | // | |
284 | ||
285 | Float_t zcorr = kZcorr ? fTilt * (fZProb - fZref[0]) : 0.; | |
eb38ed55 | 286 | return |
287 | .5 * TMath::Abs(18.0 - fN2) | |
e4f2f73d | 288 | + 10.* TMath::Abs(fYfit[1] - fYref[1]) |
eb38ed55 | 289 | + 5. * TMath::Abs(fYfit[0] - fYref[0] + zcorr) |
e4f2f73d | 290 | + 2. * TMath::Abs(fMeanz - fZref[0]) / fPadLength; |
291 | } | |
292 | ||
0906e73e | 293 | //____________________________________________________________________ |
294 | void AliTRDseedV1::GetCovAt(Double_t /*x*/, Double_t *cov) const | |
295 | { | |
296 | // Computes covariance in the y-z plane at radial point x | |
297 | ||
eb38ed55 | 298 | Int_t ic = 0; while (!fClusters[ic]) ic++; |
299 | AliTRDcalibDB *fCalib = AliTRDcalibDB::Instance(); | |
300 | Double_t exB = fCalib->GetOmegaTau(fCalib->GetVdriftAverage(fClusters[ic]->GetDetector()), -AliTracker::GetBz()*0.1); | |
301 | ||
302 | Double_t sy2 = fSigmaY2*fSigmaY2 + .2*(fYfit[1]-exB)*(fYfit[1]-exB); | |
0906e73e | 303 | Double_t sz2 = fPadLength/12.; |
304 | ||
eb38ed55 | 305 | |
0906e73e | 306 | //printf("Yfit[1] %f sy20 %f SigmaY2 %f\n", fYfit[1], sy20, fSigmaY2); |
307 | ||
308 | cov[0] = sy2; | |
309 | cov[1] = fTilt*(sy2-sz2); | |
310 | cov[2] = sz2; | |
311 | } | |
312 | ||
0906e73e | 313 | |
314 | //____________________________________________________________________ | |
315 | void AliTRDseedV1::SetOwner(Bool_t own) | |
316 | { | |
317 | //AliInfo(Form("own [%s] fOwner[%s]", own?"YES":"NO", fOwner?"YES":"NO")); | |
318 | ||
319 | if(own){ | |
320 | for(int ic=0; ic<knTimebins; ic++){ | |
321 | if(!fClusters[ic]) continue; | |
322 | fClusters[ic] = new AliTRDcluster(*fClusters[ic]); | |
323 | } | |
47d5d320 | 324 | SetBit(1); |
0906e73e | 325 | } else { |
47d5d320 | 326 | if(IsOwner()){ |
0906e73e | 327 | for(int ic=0; ic<knTimebins; ic++){ |
328 | if(!fClusters[ic]) continue; | |
329 | delete fClusters[ic]; | |
330 | //fClusters[ic] = tracker->GetClusters(index) TODO | |
331 | } | |
332 | } | |
47d5d320 | 333 | SetBit(1, kFALSE); |
0906e73e | 334 | } |
335 | } | |
336 | ||
e4f2f73d | 337 | //____________________________________________________________________ |
eb38ed55 | 338 | Bool_t AliTRDseedV1::AttachClustersIter(AliTRDtrackingChamber *chamber, Float_t quality, Bool_t kZcorr, AliTRDcluster *c) |
e4f2f73d | 339 | { |
340 | // | |
341 | // Iterative process to register clusters to the seed. | |
342 | // In iteration 0 we try only one pad-row and if quality not | |
343 | // sufficient we try 2 pad-rows (about 5% of tracks cross 2 pad-rows) | |
344 | // | |
eb38ed55 | 345 | // debug level 7 |
346 | // | |
e4f2f73d | 347 | |
eb38ed55 | 348 | if(!AliTRDReconstructor::RecoParam()){ |
e4f2f73d | 349 | AliError("Seed can not be used without a valid RecoParam."); |
350 | return kFALSE; | |
351 | } | |
0906e73e | 352 | |
eb38ed55 | 353 | AliTRDchamberTimeBin *layer = 0x0; |
354 | if(AliTRDReconstructor::StreamLevel()>=7 && c){ | |
355 | TClonesArray clusters("AliTRDcluster", 24); | |
356 | clusters.SetOwner(kTRUE); | |
357 | AliTRDcluster *cc = 0x0; | |
358 | Int_t det=-1, ncl, ncls = 0; | |
2985ffcb | 359 | for (Int_t iTime = 0; iTime < AliTRDtrackerV1::GetNTimeBins(); iTime++) { |
eb38ed55 | 360 | if(!(layer = chamber->GetTB(iTime))) continue; |
361 | if(!(ncl = Int_t(*layer))) continue; | |
362 | for(int ic=0; ic<ncl; ic++){ | |
363 | cc = (*layer)[ic]; | |
364 | det = cc->GetDetector(); | |
365 | new(clusters[ncls++]) AliTRDcluster(*cc); | |
366 | } | |
367 | } | |
368 | AliInfo(Form("N clusters[%d] = %d", fPlane, ncls)); | |
369 | ||
370 | Int_t ref = c ? 1 : 0; | |
371 | TTreeSRedirector &cstreamer = *AliTRDtrackerV1::DebugStreamer(); | |
372 | cstreamer << "AttachClustersIter" | |
373 | << "det=" << det | |
374 | << "ref=" << ref | |
375 | << "clusters.=" << &clusters | |
376 | << "tracklet.=" << this | |
377 | << "cl.=" << c | |
378 | << "\n"; | |
379 | } | |
0906e73e | 380 | |
e4f2f73d | 381 | Float_t tquality; |
eb38ed55 | 382 | Double_t kroady = AliTRDReconstructor::RecoParam()->GetRoad1y(); |
e4f2f73d | 383 | Double_t kroadz = fPadLength * .5 + 1.; |
384 | ||
385 | // initialize configuration parameters | |
386 | Float_t zcorr = kZcorr ? fTilt * (fZProb - fZref[0]) : 0.; | |
387 | Int_t niter = kZcorr ? 1 : 2; | |
388 | ||
389 | Double_t yexp, zexp; | |
390 | Int_t ncl = 0; | |
391 | // start seed update | |
392 | for (Int_t iter = 0; iter < niter; iter++) { | |
e4f2f73d | 393 | ncl = 0; |
2985ffcb | 394 | for (Int_t iTime = 0; iTime < AliTRDtrackerV1::GetNTimeBins(); iTime++) { |
eb38ed55 | 395 | if(!(layer = chamber->GetTB(iTime))) continue; |
396 | if(!Int_t(*layer)) continue; | |
397 | ||
e4f2f73d | 398 | // define searching configuration |
eb38ed55 | 399 | Double_t dxlayer = layer->GetX() - fX0; |
e4f2f73d | 400 | if(c){ |
401 | zexp = c->GetZ(); | |
402 | //Try 2 pad-rows in second iteration | |
403 | if (iter > 0) { | |
404 | zexp = fZref[0] + fZref[1] * dxlayer - zcorr; | |
405 | if (zexp > c->GetZ()) zexp = c->GetZ() + fPadLength*0.5; | |
406 | if (zexp < c->GetZ()) zexp = c->GetZ() - fPadLength*0.5; | |
407 | } | |
eb38ed55 | 408 | } else zexp = fZref[0] + (kZcorr ? fZref[1] * dxlayer : 0.); |
e4f2f73d | 409 | yexp = fYref[0] + fYref[1] * dxlayer - zcorr; |
bcb6fb78 | 410 | |
411 | // Get and register cluster | |
eb38ed55 | 412 | Int_t index = layer->SearchNearestCluster(yexp, zexp, kroady, kroadz); |
e4f2f73d | 413 | if (index < 0) continue; |
eb38ed55 | 414 | AliTRDcluster *cl = (*layer)[index]; |
e4f2f73d | 415 | |
eb38ed55 | 416 | fIndexes[iTime] = layer->GetGlobalIndex(index); |
e4f2f73d | 417 | fClusters[iTime] = cl; |
e4f2f73d | 418 | fY[iTime] = cl->GetY(); |
419 | fZ[iTime] = cl->GetZ(); | |
e4f2f73d | 420 | ncl++; |
421 | } | |
eb38ed55 | 422 | if(AliTRDReconstructor::StreamLevel()>=7) AliInfo(Form("iter = %d ncl [%d] = %d", iter, fPlane, ncl)); |
bcb6fb78 | 423 | |
eb38ed55 | 424 | if(ncl>1){ |
bcb6fb78 | 425 | // calculate length of the time bin (calibration aware) |
426 | Int_t irp = 0; Float_t x[2]; Int_t tb[2]; | |
2985ffcb | 427 | for (Int_t iTime = 0; iTime < AliTRDtrackerV1::GetNTimeBins(); iTime++) { |
bcb6fb78 | 428 | if(!fClusters[iTime]) continue; |
429 | x[irp] = fClusters[iTime]->GetX(); | |
430 | tb[irp] = iTime; | |
431 | irp++; | |
432 | if(irp==2) break; | |
433 | } | |
434 | fdX = (x[1] - x[0]) / (tb[0] - tb[1]); | |
435 | ||
436 | // update X0 from the clusters (calibration/alignment aware) | |
2985ffcb | 437 | for (Int_t iTime = 0; iTime < AliTRDtrackerV1::GetNTimeBins(); iTime++) { |
eb38ed55 | 438 | if(!(layer = chamber->GetTB(iTime))) continue; |
439 | if(!layer->IsT0()) continue; | |
bcb6fb78 | 440 | if(fClusters[iTime]){ |
441 | fX0 = fClusters[iTime]->GetX(); | |
442 | break; | |
443 | } else { // we have to infere the position of the anode wire from the other clusters | |
2985ffcb | 444 | for (Int_t jTime = iTime+1; jTime < AliTRDtrackerV1::GetNTimeBins(); jTime++) { |
bcb6fb78 | 445 | if(!fClusters[jTime]) continue; |
446 | fX0 = fClusters[jTime]->GetX() + fdX * (jTime - iTime); | |
447 | } | |
448 | break; | |
449 | } | |
450 | } | |
451 | ||
452 | // update YZ reference point | |
453 | // TODO | |
454 | ||
455 | // update x reference positions (calibration/alignment aware) | |
2985ffcb | 456 | for (Int_t iTime = 0; iTime < AliTRDtrackerV1::GetNTimeBins(); iTime++) { |
bcb6fb78 | 457 | if(!fClusters[iTime]) continue; |
458 | fX[iTime] = fClusters[iTime]->GetX() - fX0; | |
459 | } | |
460 | ||
461 | AliTRDseed::Update(); | |
462 | } | |
eb38ed55 | 463 | if(AliTRDReconstructor::StreamLevel()>=7) AliInfo(Form("iter = %d nclFit [%d] = %d", iter, fPlane, fN2)); |
bcb6fb78 | 464 | |
e4f2f73d | 465 | if(IsOK()){ |
466 | tquality = GetQuality(kZcorr); | |
467 | if(tquality < quality) break; | |
468 | else quality = tquality; | |
469 | } | |
470 | kroadz *= 2.; | |
471 | } // Loop: iter | |
472 | if (!IsOK()) return kFALSE; | |
473 | ||
474 | CookLabels(); | |
475 | UpdateUsed(); | |
476 | return kTRUE; | |
477 | } | |
478 | ||
479 | //____________________________________________________________________ | |
eb38ed55 | 480 | Bool_t AliTRDseedV1::AttachClusters(AliTRDtrackingChamber *chamber |
0906e73e | 481 | ,Bool_t kZcorr) |
e4f2f73d | 482 | { |
483 | // | |
484 | // Projective algorithm to attach clusters to seeding tracklets | |
485 | // | |
486 | // Parameters | |
487 | // | |
488 | // Output | |
489 | // | |
490 | // Detailed description | |
491 | // 1. Collapse x coordinate for the full detector plane | |
492 | // 2. truncated mean on y (r-phi) direction | |
493 | // 3. purge clusters | |
494 | // 4. truncated mean on z direction | |
495 | // 5. purge clusters | |
496 | // 6. fit tracklet | |
497 | // | |
498 | ||
eb38ed55 | 499 | if(!AliTRDReconstructor::RecoParam()){ |
e4f2f73d | 500 | AliError("Seed can not be used without a valid RecoParam."); |
501 | return kFALSE; | |
502 | } | |
503 | ||
0906e73e | 504 | const Int_t kClusterCandidates = 2 * knTimebins; |
e4f2f73d | 505 | |
506 | //define roads | |
eb38ed55 | 507 | Double_t kroady = AliTRDReconstructor::RecoParam()->GetRoad1y(); |
e4f2f73d | 508 | Double_t kroadz = fPadLength * 1.5 + 1.; |
509 | // correction to y for the tilting angle | |
510 | Float_t zcorr = kZcorr ? fTilt * (fZProb - fZref[0]) : 0.; | |
511 | ||
512 | // working variables | |
513 | AliTRDcluster *clusters[kClusterCandidates]; | |
0906e73e | 514 | Double_t cond[4], yexp[knTimebins], zexp[knTimebins], |
e4f2f73d | 515 | yres[kClusterCandidates], zres[kClusterCandidates]; |
0906e73e | 516 | Int_t ncl, *index = 0x0, tboundary[knTimebins]; |
e4f2f73d | 517 | |
518 | // Do cluster projection | |
eb38ed55 | 519 | AliTRDchamberTimeBin *layer = 0x0; |
e4f2f73d | 520 | Int_t nYclusters = 0; Bool_t kEXIT = kFALSE; |
2985ffcb | 521 | for (Int_t iTime = 0; iTime < AliTRDtrackerV1::GetNTimeBins(); iTime++) { |
eb38ed55 | 522 | if(!(layer = chamber->GetTB(iTime))) continue; |
523 | if(!Int_t(*layer)) continue; | |
524 | ||
525 | fX[iTime] = layer->GetX() - fX0; | |
e4f2f73d | 526 | zexp[iTime] = fZref[0] + fZref[1] * fX[iTime]; |
527 | yexp[iTime] = fYref[0] + fYref[1] * fX[iTime] - zcorr; | |
528 | ||
529 | // build condition and process clusters | |
530 | cond[0] = yexp[iTime] - kroady; cond[1] = yexp[iTime] + kroady; | |
531 | cond[2] = zexp[iTime] - kroadz; cond[3] = zexp[iTime] + kroadz; | |
eb38ed55 | 532 | layer->GetClusters(cond, index, ncl); |
e4f2f73d | 533 | for(Int_t ic = 0; ic<ncl; ic++){ |
eb38ed55 | 534 | AliTRDcluster *c = layer->GetCluster(index[ic]); |
e4f2f73d | 535 | clusters[nYclusters] = c; |
536 | yres[nYclusters++] = c->GetY() - yexp[iTime]; | |
537 | if(nYclusters >= kClusterCandidates) { | |
538 | AliWarning(Form("Cluster candidates reached limit %d. Some may be lost.", kClusterCandidates)); | |
539 | kEXIT = kTRUE; | |
540 | break; | |
541 | } | |
542 | } | |
543 | tboundary[iTime] = nYclusters; | |
544 | if(kEXIT) break; | |
545 | } | |
546 | ||
547 | // Evaluate truncated mean on the y direction | |
548 | Double_t mean, sigma; | |
549 | AliMathBase::EvaluateUni(nYclusters, yres, mean, sigma, Int_t(nYclusters*.8)-2); | |
eb38ed55 | 550 | // purge cluster candidates |
e4f2f73d | 551 | Int_t nZclusters = 0; |
552 | for(Int_t ic = 0; ic<nYclusters; ic++){ | |
553 | if(yres[ic] - mean > 4. * sigma){ | |
554 | clusters[ic] = 0x0; | |
555 | continue; | |
556 | } | |
557 | zres[nZclusters++] = clusters[ic]->GetZ() - zexp[clusters[ic]->GetLocalTimeBin()]; | |
558 | } | |
559 | ||
560 | // Evaluate truncated mean on the z direction | |
561 | AliMathBase::EvaluateUni(nZclusters, zres, mean, sigma, Int_t(nZclusters*.8)-2); | |
eb38ed55 | 562 | // purge cluster candidates |
e4f2f73d | 563 | for(Int_t ic = 0; ic<nZclusters; ic++){ |
564 | if(zres[ic] - mean > 4. * sigma){ | |
565 | clusters[ic] = 0x0; | |
566 | continue; | |
567 | } | |
568 | } | |
569 | ||
570 | ||
571 | // Select only one cluster/TimeBin | |
572 | Int_t lastCluster = 0; | |
573 | fN2 = 0; | |
2985ffcb | 574 | for (Int_t iTime = 0; iTime < AliTRDtrackerV1::GetNTimeBins(); iTime++) { |
e4f2f73d | 575 | ncl = tboundary[iTime] - lastCluster; |
576 | if(!ncl) continue; | |
eb38ed55 | 577 | Int_t iptr = lastCluster; |
578 | if(ncl > 1){ | |
579 | Float_t dold = 9999.; | |
e4f2f73d | 580 | for(int ic=lastCluster; ic<tboundary[iTime]; ic++){ |
581 | if(!clusters[ic]) continue; | |
582 | Float_t y = yexp[iTime] - clusters[ic]->GetY(); | |
583 | Float_t z = zexp[iTime] - clusters[ic]->GetZ(); | |
584 | Float_t d = y * y + z * z; | |
585 | if(d > dold) continue; | |
586 | dold = d; | |
587 | iptr = ic; | |
588 | } | |
e4f2f73d | 589 | } |
eb38ed55 | 590 | fIndexes[iTime] = chamber->GetTB(iTime)->GetGlobalIndex(iptr); |
591 | fClusters[iTime] = clusters[iptr]; | |
592 | fY[iTime] = clusters[iptr]->GetY(); | |
593 | fZ[iTime] = clusters[iptr]->GetZ(); | |
0906e73e | 594 | lastCluster = tboundary[iTime]; |
e4f2f73d | 595 | fN2++; |
596 | } | |
597 | ||
598 | // number of minimum numbers of clusters expected for the tracklet | |
2985ffcb | 599 | Int_t kClmin = Int_t(AliTRDReconstructor::RecoParam()->GetFindableClusters()*AliTRDtrackerV1::GetNTimeBins()); |
e4f2f73d | 600 | if (fN2 < kClmin){ |
601 | AliWarning(Form("Not enough clusters to fit the tracklet %d [%d].", fN2, kClmin)); | |
602 | fN2 = 0; | |
603 | return kFALSE; | |
604 | } | |
0906e73e | 605 | |
606 | // update used clusters | |
607 | fNUsed = 0; | |
2985ffcb | 608 | for (Int_t iTime = 0; iTime < AliTRDtrackerV1::GetNTimeBins(); iTime++) { |
0906e73e | 609 | if(!fClusters[iTime]) continue; |
610 | if((fClusters[iTime]->IsUsed())) fNUsed++; | |
611 | } | |
612 | ||
613 | if (fN2-fNUsed < kClmin){ | |
614 | AliWarning(Form("Too many clusters already in use %d (from %d).", fNUsed, fN2)); | |
615 | fN2 = 0; | |
616 | return kFALSE; | |
617 | } | |
e4f2f73d | 618 | |
e4f2f73d | 619 | return kTRUE; |
620 | } | |
621 | ||
622 | //____________________________________________________________________ | |
0906e73e | 623 | Bool_t AliTRDseedV1::Fit() |
e4f2f73d | 624 | { |
625 | // | |
626 | // Linear fit of the tracklet | |
627 | // | |
628 | // Parameters : | |
629 | // | |
630 | // Output : | |
631 | // True if successful | |
632 | // | |
633 | // Detailed description | |
634 | // 2. Check if tracklet crosses pad row boundary | |
635 | // 1. Calculate residuals in the y (r-phi) direction | |
636 | // 3. Do a Least Square Fit to the data | |
637 | // | |
638 | ||
47d5d320 | 639 | const Int_t kClmin = 8; |
640 | const Int_t kNtb = AliTRDtrackerV1::GetNTimeBins(); | |
8acca6a3 | 641 | AliTRDtrackerV1::AliTRDLeastSquare fitterY, fitterZ; |
47d5d320 | 642 | |
643 | // convertion factor from square to gauss distribution for sigma | |
644 | Double_t convert = 1./TMath::Sqrt(12.); | |
645 | ||
646 | // book cluster information | |
8acca6a3 | 647 | Double_t xc[knTimebins+1], yc[knTimebins], zc[knTimebins+1], sy[knTimebins], sz[knTimebins+1]; |
47d5d320 | 648 | Int_t zRow[knTimebins]; |
649 | AliTRDcluster *c = 0x0; | |
650 | Int_t nc = 0; | |
651 | for (Int_t ic=0; ic<kNtb; ic++) { | |
652 | zRow[ic] = -1; | |
653 | xc[ic] = -1.; | |
654 | yc[ic] = 999.; | |
655 | zc[ic] = 999.; | |
656 | sy[ic] = 0.; | |
657 | sz[ic] = 0.; | |
658 | if(!(c = fClusters[ic])) continue; | |
659 | if(!c->IsInChamber()) continue; | |
660 | Float_t w = 1.; | |
661 | if(c->GetNPads()>4) w = .5; | |
662 | if(c->GetNPads()>5) w = .2; | |
663 | zRow[nc] = c->GetPadRow(); | |
664 | xc[nc] = fX0 - c->GetX(); | |
665 | yc[nc] = c->GetY(); | |
666 | zc[nc] = c->GetZ(); | |
667 | sy[ic] = w; // all clusters have the same sigma | |
668 | sz[ic] = fPadLength*convert; | |
8acca6a3 | 669 | fitterZ.AddPoint(&xc[ic], zc[ic], sz[ic]); |
47d5d320 | 670 | nc++; |
671 | } | |
672 | // to few clusters | |
673 | if (nc < kClmin) return kFALSE; | |
674 | ||
e4f2f73d | 675 | |
47d5d320 | 676 | Int_t zN[2*35]; |
677 | Int_t nz = AliTRDtrackerV1::Freq(nc, zRow, zN, kFALSE); | |
678 | // more than one pad row crossing | |
679 | if(nz>2) return kFALSE; | |
e4f2f73d | 680 | |
47d5d320 | 681 | // estimate reference parameter at average x |
682 | Double_t y0 = fYref[0]; | |
683 | Double_t dydx = fYref[1]; | |
684 | Double_t dzdx = fZref[1]; | |
685 | zc[nc] = fZref[0]; | |
686 | ||
687 | // determine z offset of the fit | |
688 | Int_t nchanges = 0, nCross = 0; | |
689 | if(nz==2){ // tracklet is crossing pad row | |
690 | // Find the break time allowing one chage on pad-rows | |
691 | // with maximal number of accepted clusters | |
692 | Int_t padRef = zRow[0]; | |
693 | for (Int_t ic=1; ic<nc; ic++) { | |
694 | if(zRow[ic] == padRef) continue; | |
695 | ||
696 | // debug | |
697 | if(zRow[ic-1] == zRow[ic]){ | |
698 | printf("ERROR in pad row change!!!\n"); | |
699 | } | |
700 | ||
701 | // evaluate parameters of the crossing point | |
702 | Float_t sx = (xc[ic-1] - xc[ic])*convert; | |
703 | xc[nc] = .5 * (xc[ic-1] + xc[ic]); | |
704 | zc[nc] = .5 * (zc[ic-1] + zc[ic]); | |
705 | sz[nc] = TMath::Max(dzdx * sx, .01); | |
706 | dzdx = zc[ic-1] > zc[ic] ? 1. : -1.; | |
707 | padRef = zRow[ic]; | |
708 | nCross = ic; | |
709 | nchanges++; | |
710 | } | |
e4f2f73d | 711 | } |
712 | ||
47d5d320 | 713 | // condition on nCross and reset nchanges TODO |
714 | ||
47d5d320 | 715 | if(nchanges==1){ |
716 | if(dzdx * fZref[1] < 0.){ | |
717 | AliInfo("tracklet direction does not correspond to the track direction. TODO."); | |
718 | } | |
719 | SetBit(2, kTRUE); // mark pad row crossing | |
720 | fCross[0] = xc[nc]; fCross[2] = zc[nc]; fCross[3] = sz[nc]; | |
8acca6a3 | 721 | fitterZ.AddPoint(&xc[nc], zc[nc], sz[nc]); |
722 | fitterZ.Eval(); | |
723 | dzdx = fZref[1]; // we don't trust Parameter[1] ??; | |
724 | zc[nc] = fitterZ.GetFunctionParameter(0); | |
47d5d320 | 725 | } else if(nchanges > 1){ // debug |
726 | AliInfo("ERROR in n changes!!!"); | |
e4f2f73d | 727 | return kFALSE; |
728 | } | |
47d5d320 | 729 | |
730 | ||
731 | // estimate deviation from reference direction | |
732 | dzdx *= fTilt; | |
733 | for (Int_t ic=0; ic<nc; ic++) { | |
734 | yc[ic] -= y0 + xc[ic]*(dydx + dzdx) + fTilt * (zc[ic] - zc[nc]); | |
8acca6a3 | 735 | fitterY.AddPoint(&xc[ic], yc[ic], sy[ic]); |
e4f2f73d | 736 | } |
8acca6a3 | 737 | fitterY.Eval(); |
738 | fYfit[0] = y0+fitterY.GetFunctionParameter(0); | |
739 | fYfit[1] = dydx+fitterY.GetFunctionParameter(1); | |
47d5d320 | 740 | if(nchanges) fCross[1] = fYfit[0] + fCross[0] * fYfit[1]; |
e4f2f73d | 741 | |
47d5d320 | 742 | // printf("\nnz = %d\n", nz); |
743 | // for(int ic=0; ic<35; ic++) printf("%d row[%d]\n", ic, zRow[ic]); | |
744 | // | |
745 | // for(int ic=0; ic<nz; ic++) printf("%d n[%d]\n", ic, zN[ic]); | |
e4f2f73d | 746 | |
747 | return kTRUE; | |
748 | } | |
749 | ||
47d5d320 | 750 | //___________________________________________________________________ |
751 | void AliTRDseedV1::Draw(Option_t*) | |
752 | { | |
753 | } | |
e4f2f73d | 754 | |
755 | //___________________________________________________________________ | |
47d5d320 | 756 | void AliTRDseedV1::Print(Option_t*) const |
e4f2f73d | 757 | { |
758 | // | |
759 | // Printing the seedstatus | |
760 | // | |
761 | ||
e4f2f73d | 762 | printf("Seed status :\n"); |
763 | printf(" fTilt = %f\n", fTilt); | |
764 | printf(" fPadLength = %f\n", fPadLength); | |
765 | printf(" fX0 = %f\n", fX0); | |
2985ffcb | 766 | for(int ic=0; ic<AliTRDtrackerV1::GetNTimeBins(); ic++) { |
e4f2f73d | 767 | const Char_t *isUsable = fUsable[ic]?"Yes":"No"; |
0906e73e | 768 | printf(" %d X[%f] Y[%f] Z[%f] Indexes[%d] clusters[%p] usable[%s]\n" |
e4f2f73d | 769 | , ic |
770 | , fX[ic] | |
771 | , fY[ic] | |
772 | , fZ[ic] | |
773 | , fIndexes[ic] | |
0906e73e | 774 | , ((void*) fClusters[ic]) |
e4f2f73d | 775 | , isUsable); |
776 | } | |
777 | ||
778 | printf(" fYref[0] =%f fYref[1] =%f\n", fYref[0], fYref[1]); | |
779 | printf(" fZref[0] =%f fZref[1] =%f\n", fZref[0], fZref[1]); | |
780 | printf(" fYfit[0] =%f fYfit[1] =%f\n", fYfit[0], fYfit[1]); | |
781 | printf(" fYfitR[0]=%f fYfitR[1]=%f\n", fYfitR[0], fYfitR[1]); | |
782 | printf(" fZfit[0] =%f fZfit[1] =%f\n", fZfit[0], fZfit[1]); | |
783 | printf(" fZfitR[0]=%f fZfitR[1]=%f\n", fZfitR[0], fZfitR[1]); | |
784 | printf(" fSigmaY =%f\n", fSigmaY); | |
785 | printf(" fSigmaY2=%f\n", fSigmaY2); | |
786 | printf(" fMeanz =%f\n", fMeanz); | |
787 | printf(" fZProb =%f\n", fZProb); | |
788 | printf(" fLabels[0]=%d fLabels[1]=%d\n", fLabels[0], fLabels[1]); | |
789 | printf(" fN =%d\n", fN); | |
790 | printf(" fN2 =%d (>8 isOK)\n",fN2); | |
791 | printf(" fNUsed =%d\n", fNUsed); | |
792 | printf(" fFreq =%d\n", fFreq); | |
793 | printf(" fNChange=%d\n", fNChange); | |
794 | printf(" fMPads =%f\n", fMPads); | |
795 | ||
796 | printf(" fC =%f\n", fC); | |
797 | printf(" fCC =%f\n",fCC); | |
798 | printf(" fChi2 =%f\n", fChi2); | |
799 | printf(" fChi2Z =%f\n", fChi2Z); | |
e4f2f73d | 800 | } |
47d5d320 | 801 |