/
MkStdSeqs.cc
771 lines (654 loc) · 30.2 KB
/
MkStdSeqs.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
#include "RecoTracker/MkFitCore/interface/cms_common_macros.h"
#include "RecoTracker/MkFitCMS/interface/MkStdSeqs.h"
#include "RecoTracker/MkFitCore/interface/HitStructures.h"
#include "RecoTracker/MkFitCore/interface/IterationConfig.h"
#include "RecoTracker/MkFitCore/interface/MkJob.h"
#include "RecoTracker/MkFitCore/interface/TrackStructures.h"
#include "RecoTracker/MkFitCore/interface/binnor.h"
#include "oneapi/tbb/parallel_for.h"
namespace mkfit {
namespace StdSeq {
//=========================================================================
// Hit processing
//=========================================================================
void loadDeads(EventOfHits &eoh, const std::vector<DeadVec> &deadvectors) {
for (size_t il = 0; il < deadvectors.size(); il++) {
eoh.suckInDeads(int(il), deadvectors[il]);
}
}
// Loading hits in CMSSW from two "large multi-layer vectors".
// orig_hitvectors[0] - pixels,
// orig_hitvectors[1] - strips.
void cmssw_LoadHits_Begin(EventOfHits &eoh, const std::vector<const HitVec *> &orig_hitvectors) {
eoh.reset();
for (int i = 0; i < eoh.nLayers(); ++i) {
auto &&l = eoh[i];
l.beginRegistrationOfHits(*orig_hitvectors[l.is_pixel() ? 0 : 1]);
}
}
// Loop with LayerOfHits::registerHit(int idx) - it takes Hit out of original HitVec to
// extract phi, r/z, and calculate qphifines
//
// Something like what is done in MkFitInputConverter::convertHits
//
// Problem is I don't know layers for each large-vector;
// Also, layer is calculated for each detset when looping over the HitCollection
void cmssw_LoadHits_End(EventOfHits &eoh) {
for (int i = 0; i < eoh.nLayers(); ++i) {
auto &&l = eoh[i];
l.endRegistrationOfHits(false);
}
}
//=========================================================================
// Hit-index mapping / remapping
//=========================================================================
void cmssw_Map_TrackHitIndices(const EventOfHits &eoh, TrackVec &seeds) {
for (auto &&track : seeds) {
for (int i = 0; i < track.nTotalHits(); ++i) {
const int hitidx = track.getHitIdx(i);
const int hitlyr = track.getHitLyr(i);
if (hitidx >= 0) {
const auto &loh = eoh[hitlyr];
track.setHitIdx(i, loh.getHitIndexFromOriginal(hitidx));
}
}
}
}
void cmssw_ReMap_TrackHitIndices(const EventOfHits &eoh, TrackVec &out_tracks) {
for (auto &&track : out_tracks) {
for (int i = 0; i < track.nTotalHits(); ++i) {
const int hitidx = track.getHitIdx(i);
const int hitlyr = track.getHitLyr(i);
if (hitidx >= 0) {
const auto &loh = eoh[hitlyr];
track.setHitIdx(i, loh.getOriginalHitIndex(hitidx));
}
}
}
}
//=========================================================================
// Seed cleaning (multi-iter)
//=========================================================================
int clean_cms_seedtracks_iter(TrackVec &seeds, const IterationConfig &itrcfg, const BeamSpot &bspot) {
using Algo = TrackBase::TrackAlgorithm;
const float etamax_brl = Config::c_etamax_brl;
const float dpt_common = Config::c_dpt_common;
const float dzmax_bh = itrcfg.sc_dzmax_bh;
const float drmax_bh = itrcfg.sc_drmax_bh;
const float dzmax_eh = itrcfg.sc_dzmax_eh;
const float drmax_eh = itrcfg.sc_drmax_eh;
const float dzmax_bl = itrcfg.sc_dzmax_bl;
const float drmax_bl = itrcfg.sc_drmax_bl;
const float dzmax_el = itrcfg.sc_dzmax_el;
const float drmax_el = itrcfg.sc_drmax_el;
const float ptmin_hpt = itrcfg.sc_ptthr_hpt;
const float dzmax2_inv_bh = 1.f / (dzmax_bh * dzmax_bh);
const float drmax2_inv_bh = 1.f / (drmax_bh * drmax_bh);
const float dzmax2_inv_eh = 1.f / (dzmax_eh * dzmax_eh);
const float drmax2_inv_eh = 1.f / (drmax_eh * drmax_eh);
const float dzmax2_inv_bl = 1.f / (dzmax_bl * dzmax_bl);
const float drmax2_inv_bl = 1.f / (drmax_bl * drmax_bl);
const float dzmax2_inv_el = 1.f / (dzmax_el * dzmax_el);
const float drmax2_inv_el = 1.f / (drmax_el * drmax_el);
// Merge hits from overlapping seeds?
// For now always true, we require extra hits after seed,
// except for lowPtQuadStep, where we only merge hits for seeds at low pT and large pseudo-rapidity
const bool merge_hits = true; // itrcfg.merge_seed_hits_during_cleaning();
const float ptmax_merge_lowPtQuad = 0.2;
const float etamin_merge_lowPtQuad = 1.5;
if (seeds.empty())
return 0;
const int ns = seeds.size();
#ifdef DEBUG
std::cout << "before seed cleaning " << seeds.size() << std::endl;
#endif
TrackVec cleanSeedTracks;
cleanSeedTracks.reserve(ns);
std::vector<bool> writetrack(ns, true);
const float invR1GeV = 1.f / Config::track1GeVradius;
std::vector<int> nHits(ns);
std::vector<int> charge(ns);
std::vector<float> oldPhi(ns);
std::vector<float> pos2(ns);
std::vector<float> eta(ns);
std::vector<float> ctheta(ns);
std::vector<float> invptq(ns);
std::vector<float> pt(ns);
std::vector<float> x(ns);
std::vector<float> y(ns);
std::vector<float> z(ns);
std::vector<float> d0(ns);
int i1, i2; //for the sorting
axis_pow2_u1<float, unsigned short, 16, 8> ax_phi(-Const::PI, Const::PI);
axis<float, unsigned short, 8, 8> ax_eta(-3.0, 3.0, 30u);
binnor<unsigned int, decltype(ax_phi), decltype(ax_eta), 24, 8> phi_eta_binnor(ax_phi, ax_eta);
phi_eta_binnor.begin_registration(ns);
for (int ts = 0; ts < ns; ts++) {
const Track &tk = seeds[ts];
nHits[ts] = tk.nFoundHits();
charge[ts] = tk.charge();
oldPhi[ts] = tk.momPhi();
pos2[ts] = std::pow(tk.x(), 2) + std::pow(tk.y(), 2);
eta[ts] = tk.momEta();
ctheta[ts] = 1.f / std::tan(tk.theta());
invptq[ts] = tk.charge() * tk.invpT();
pt[ts] = tk.pT();
x[ts] = tk.x();
y[ts] = tk.y();
z[ts] = tk.z();
d0[ts] = tk.d0BeamSpot(bspot.x, bspot.y);
phi_eta_binnor.register_entry_safe(oldPhi[ts], eta[ts]);
// If one is sure values are *within* axis ranges: b.register_entry(oldPhi[ts], eta[ts]);
}
phi_eta_binnor.finalize_registration();
for (int sorted_ts = 0; sorted_ts < ns; sorted_ts++) {
int ts = phi_eta_binnor.m_ranks[sorted_ts];
if (not writetrack[ts])
continue; // Note: this speed up prevents transitive masking (possibly marginal gain).
const float oldPhi1 = oldPhi[ts];
const float pos2_first = pos2[ts];
const float eta1 = eta[ts];
const float pt1 = pt[ts];
const float invptq_first = invptq[ts];
// To study some more details -- need EventOfHits for this
int n_ovlp_hits_added = 0;
auto phi_rng = ax_phi.from_R_rdr_to_N_bins(oldPhi[ts], 0.08f);
auto eta_rng = ax_eta.from_R_rdr_to_N_bins(eta[ts], .1f);
for (auto i_phi = phi_rng.begin; i_phi != phi_rng.end; i_phi = ax_phi.next_N_bin(i_phi)) {
for (auto i_eta = eta_rng.begin; i_eta != eta_rng.end; i_eta = ax_eta.next_N_bin(i_eta)) {
const auto cbin = phi_eta_binnor.get_content(i_phi, i_eta);
for (auto i = cbin.first; i < cbin.end(); ++i) {
int tss = phi_eta_binnor.m_ranks[i];
if (not writetrack[ts])
continue;
if (not writetrack[tss])
continue;
if (tss == ts)
continue;
const float pt2 = pt[tss];
// Always require charge consistency. If different charge is assigned, do not remove seed-track
if (charge[tss] != charge[ts])
continue;
const float thisDPt = std::abs(pt2 - pt1);
// Require pT consistency between seeds. If dpT is large, do not remove seed-track.
if (thisDPt > dpt_common * pt1)
continue;
const float eta2 = eta[tss];
const float deta2 = std::pow(eta1 - eta2, 2);
const float oldPhi2 = oldPhi[tss];
const float pos2_second = pos2[tss];
const float thisDXYSign05 = pos2_second > pos2_first ? -0.5f : 0.5f;
const float thisDXY = thisDXYSign05 * sqrt(std::pow(x[ts] - x[tss], 2) + std::pow(y[ts] - y[tss], 2));
const float invptq_second = invptq[tss];
const float newPhi1 = oldPhi1 - thisDXY * invR1GeV * invptq_first;
const float newPhi2 = oldPhi2 + thisDXY * invR1GeV * invptq_second;
const float dphi = cdist(std::abs(newPhi1 - newPhi2));
const float dr2 = deta2 + dphi * dphi;
const float thisDZ = z[ts] - z[tss] - thisDXY * (ctheta[ts] + ctheta[tss]);
const float dz2 = thisDZ * thisDZ;
// Reject tracks within dR-dz elliptical window.
// Adaptive thresholds, based on observation that duplicates are more abundant at large pseudo-rapidity and low track pT
bool overlapping = false;
if (std::abs(eta1) < etamax_brl) {
if (pt1 > ptmin_hpt) {
if (dz2 * dzmax2_inv_bh + dr2 * drmax2_inv_bh < 1.0f)
overlapping = true;
} else {
if (dz2 * dzmax2_inv_bl + dr2 * drmax2_inv_bl < 1.0f)
overlapping = true;
}
} else {
if (pt1 > ptmin_hpt) {
if (dz2 * dzmax2_inv_eh + dr2 * drmax2_inv_eh < 1.0f)
overlapping = true;
} else {
if (dz2 * dzmax2_inv_el + dr2 * drmax2_inv_el < 1.0f)
overlapping = true;
}
}
if (overlapping) {
//Mark tss as a duplicate
i1 = ts;
i2 = tss;
if (d0[tss] > d0[ts])
writetrack[tss] = false;
else {
writetrack[ts] = false;
i2 = ts;
i1 = tss;
}
// Add hits from tk2 to the seed we are keeping.
// NOTE: We have a limit in Track::Status for the number of seed hits.
// There is a check at entry and after adding of a new hit.
Track &tk = seeds[i1];
if (merge_hits && tk.nTotalHits() < Track::Status::kMaxSeedHits &&
(Algo(itrcfg.m_track_algorithm) != Algo::lowPtQuadStep ||
(pt1 < ptmax_merge_lowPtQuad && std::abs(eta1) > etamin_merge_lowPtQuad))) {
const Track &tk2 = seeds[i2];
//We are not actually fitting to the extra hits; use chi2 of 0
float fakeChi2 = 0.0;
for (int j = 0; j < tk2.nTotalHits(); ++j) {
int hitidx = tk2.getHitIdx(j);
int hitlyr = tk2.getHitLyr(j);
if (hitidx >= 0) {
bool unique = true;
for (int i = 0; i < tk.nTotalHits(); ++i) {
if ((hitidx == tk.getHitIdx(i)) && (hitlyr == tk.getHitLyr(i))) {
unique = false;
break;
}
}
if (unique) {
tk.addHitIdx(tk2.getHitIdx(j), tk2.getHitLyr(j), fakeChi2);
++n_ovlp_hits_added;
if (tk.nTotalHits() >= Track::Status::kMaxSeedHits)
break;
}
}
}
}
if (n_ovlp_hits_added > 0)
tk.sortHitsByLayer();
}
} //end of inner loop over tss
} //eta bin
} //phi bin
if (writetrack[ts]) {
cleanSeedTracks.emplace_back(seeds[ts]);
}
}
seeds.swap(cleanSeedTracks);
#ifdef DEBUG
{
const int ns2 = seeds.size();
printf("Number of CMS seeds before %d --> after %d cleaning\n", ns, ns2);
for (int it = 0; it < ns2; it++) {
const Track &ss = seeds[it];
printf(" %3i q=%+i pT=%7.3f eta=% 7.3f nHits=%i label=% i\n",
it,
ss.charge(),
ss.pT(),
ss.momEta(),
ss.nFoundHits(),
ss.label());
}
}
#endif
#ifdef DEBUG
std::cout << "AFTER seed cleaning " << seeds.size() << std::endl;
#endif
return seeds.size();
}
namespace {
CMS_SA_ALLOW struct register_seed_cleaners {
register_seed_cleaners() {
IterationConfig::register_seed_cleaner("phase1:default", clean_cms_seedtracks_iter);
}
} rsc_instance;
} // namespace
//=========================================================================
// Duplicate cleaning
//=========================================================================
void remove_duplicates(TrackVec &tracks) {
tracks.erase(std::remove_if(tracks.begin(), tracks.end(), [](auto track) { return track.getDuplicateValue(); }),
tracks.end());
}
void clean_duplicates(TrackVec &tracks, const IterationConfig &) {
const auto ntracks = tracks.size();
float eta1, phi1, pt1, deta, dphi, dr2;
if (ntracks == 0) {
return;
}
for (auto itrack = 0U; itrack < ntracks - 1; itrack++) {
auto &track = tracks[itrack];
eta1 = track.momEta();
phi1 = track.momPhi();
pt1 = track.pT();
for (auto jtrack = itrack + 1; jtrack < ntracks; jtrack++) {
auto &track2 = tracks[jtrack];
if (track.label() == track2.label())
continue;
if (track.algoint() != track2.algoint())
continue;
deta = std::abs(track2.momEta() - eta1);
if (deta > Config::maxdEta)
continue;
dphi = std::abs(squashPhiMinimal(phi1 - track2.momPhi()));
if (dphi > Config::maxdPhi)
continue;
float maxdR = Config::maxdR;
float maxdRSquared = maxdR * maxdR;
if (std::abs(eta1) > 2.5f)
maxdRSquared *= 16.0f;
else if (std::abs(eta1) > 1.44f)
maxdRSquared *= 9.0f;
dr2 = dphi * dphi + deta * deta;
if (dr2 < maxdRSquared) {
//Keep track with best score
if (track.score() > track2.score())
track2.setDuplicateValue(true);
else
track.setDuplicateValue(true);
continue;
} else {
if (pt1 == 0)
continue;
if (track2.pT() == 0)
continue;
if (std::abs((1 / track2.pT()) - (1 / pt1)) < Config::maxdPt) {
if (Config::useHitsForDuplicates) {
float numHitsShared = 0;
for (int ihit2 = 0; ihit2 < track2.nTotalHits(); ihit2++) {
const int hitidx2 = track2.getHitIdx(ihit2);
const int hitlyr2 = track2.getHitLyr(ihit2);
if (hitidx2 >= 0) {
auto const it = std::find_if(track.beginHitsOnTrack(),
track.endHitsOnTrack(),
[&hitidx2, &hitlyr2](const HitOnTrack &element) {
return (element.index == hitidx2 && element.layer == hitlyr2);
});
if (it != track.endHitsOnTrack())
numHitsShared++;
}
}
float fracHitsShared = numHitsShared / std::min(track.nFoundHits(), track2.nFoundHits());
//Only remove one of the tracks if they share at least X% of the hits (denominator is the shorter track)
if (fracHitsShared < Config::minFracHitsShared)
continue;
}
//Keep track with best score
if (track.score() > track2.score())
track2.setDuplicateValue(true);
else
track.setDuplicateValue(true);
} //end of if dPt
} //end of else
} //end of loop over track2
} //end of loop over track1
remove_duplicates(tracks);
}
//=========================================================================
// SHARED HITS DUPLICATE CLEANING
//=========================================================================
void clean_duplicates_sharedhits(TrackVec &tracks, const IterationConfig &itconf) {
const float fraction = itconf.dc_fracSharedHits;
const auto ntracks = tracks.size();
std::vector<float> ctheta(ntracks);
std::multimap<int, int> hitMap;
for (auto itrack = 0U; itrack < ntracks; itrack++) {
auto &trk = tracks[itrack];
ctheta[itrack] = 1.f / std::tan(trk.theta());
for (int i = 0; i < trk.nTotalHits(); ++i) {
if (trk.getHitIdx(i) < 0)
continue;
int a = trk.getHitLyr(i);
int b = trk.getHitIdx(i);
hitMap.insert(std::make_pair(b * 1000 + a, i > 0 ? itrack : -itrack)); //negative for first hit in trk
}
}
for (auto itrack = 0U; itrack < ntracks; itrack++) {
auto &trk = tracks[itrack];
auto phi1 = trk.momPhi();
auto ctheta1 = ctheta[itrack];
std::map<int, int> sharingMap;
for (int i = 0; i < trk.nTotalHits(); ++i) {
if (trk.getHitIdx(i) < 0)
continue;
int a = trk.getHitLyr(i);
int b = trk.getHitIdx(i);
auto range = hitMap.equal_range(b * 1000 + a);
for (auto it = range.first; it != range.second; ++it) {
if (std::abs(it->second) >= (int)itrack)
continue; // don't check your own hits (==) nor sym. checks (>)
if (i == 0 && it->second < 0)
continue; // shared first - first is not counted
sharingMap[std::abs(it->second)]++;
}
}
for (const auto &elem : sharingMap) {
auto &track2 = tracks[elem.first];
// broad dctheta-dphi compatibility checks; keep mostly to preserve consistency with old results
auto dctheta = std::abs(ctheta[elem.first] - ctheta1);
if (dctheta > 1.)
continue;
auto dphi = std::abs(squashPhiMinimal(phi1 - track2.momPhi()));
if (dphi > 1.)
continue;
if (elem.second >= std::min(trk.nFoundHits(), track2.nFoundHits()) * fraction) {
if (trk.score() > track2.score())
track2.setDuplicateValue(true);
else
trk.setDuplicateValue(true);
}
} // end sharing hits loop
} // end trk loop
remove_duplicates(tracks);
}
void clean_duplicates_sharedhits_pixelseed(TrackVec &tracks, const IterationConfig &itconf) {
const float fraction = itconf.dc_fracSharedHits;
const float drth_central = itconf.dc_drth_central;
const float drth_obarrel = itconf.dc_drth_obarrel;
const float drth_forward = itconf.dc_drth_forward;
const auto ntracks = tracks.size();
std::vector<float> ctheta(ntracks);
for (auto itrack = 0U; itrack < ntracks; itrack++) {
auto &trk = tracks[itrack];
ctheta[itrack] = 1.f / std::tan(trk.theta());
}
float phi1, invpt1, dctheta, ctheta1, dphi, dr2;
for (auto itrack = 0U; itrack < ntracks; itrack++) {
auto &trk = tracks[itrack];
phi1 = trk.momPhi();
invpt1 = trk.invpT();
ctheta1 = ctheta[itrack];
for (auto jtrack = itrack + 1; jtrack < ntracks; jtrack++) {
auto &track2 = tracks[jtrack];
if (trk.label() == track2.label())
continue;
dctheta = std::abs(ctheta[jtrack] - ctheta1);
if (dctheta > Config::maxdcth)
continue;
dphi = std::abs(squashPhiMinimal(phi1 - track2.momPhi()));
if (dphi > Config::maxdphi)
continue;
float maxdRSquared = drth_central * drth_central;
if (std::abs(ctheta1) > Config::maxcth_fw)
maxdRSquared = drth_forward * drth_forward;
else if (std::abs(ctheta1) > Config::maxcth_ob)
maxdRSquared = drth_obarrel * drth_obarrel;
dr2 = dphi * dphi + dctheta * dctheta;
if (dr2 < maxdRSquared) {
//Keep track with best score
if (trk.score() > track2.score())
track2.setDuplicateValue(true);
else
trk.setDuplicateValue(true);
continue;
}
if (std::abs(track2.invpT() - invpt1) > Config::maxd1pt)
continue;
auto sharedCount = 0;
auto sharedFirst = 0;
const auto minFoundHits = std::min(trk.nFoundHits(), track2.nFoundHits());
for (int i = 0; i < trk.nTotalHits(); ++i) {
if (trk.getHitIdx(i) < 0)
continue;
const int a = trk.getHitLyr(i);
const int b = trk.getHitIdx(i);
for (int j = 0; j < track2.nTotalHits(); ++j) {
if (track2.getHitIdx(j) < 0)
continue;
const int c = track2.getHitLyr(j);
const int d = track2.getHitIdx(j);
//this is to count once shared matched hits (may be done more properly...)
if (a == c && b == d)
sharedCount += 1;
if (j == 0 && i == 0 && a == c && b == d)
sharedFirst += 1;
if ((sharedCount - sharedFirst) >= ((minFoundHits - sharedFirst) * fraction))
continue;
}
if ((sharedCount - sharedFirst) >= ((minFoundHits - sharedFirst) * fraction))
continue;
}
//selection here - 11percent fraction of shared hits to label a duplicate
if ((sharedCount - sharedFirst) >= ((minFoundHits - sharedFirst) * fraction)) {
if (trk.score() > track2.score())
track2.setDuplicateValue(true);
else
trk.setDuplicateValue(true);
}
}
} //end loop one over tracks
remove_duplicates(tracks);
}
namespace {
CMS_SA_ALLOW struct register_duplicate_cleaners {
register_duplicate_cleaners() {
IterationConfig::register_duplicate_cleaner("phase1:clean_duplicates", clean_duplicates);
IterationConfig::register_duplicate_cleaner("phase1:clean_duplicates_sharedhits",
clean_duplicates_sharedhits);
IterationConfig::register_duplicate_cleaner("phase1:clean_duplicates_sharedhits_pixelseed",
clean_duplicates_sharedhits_pixelseed);
}
} rdc_instance;
} // namespace
//=========================================================================
// Quality filters
//=========================================================================
// quality filter for n hits with seed hit "penalty" for strip-based seeds
// this implicitly separates triplets and doublet seeds with glued layers
template <class TRACK>
bool qfilter_n_hits(const TRACK &t, const MkJob &j) {
int seedHits = t.getNSeedHits();
int seedReduction = (seedHits <= 5) ? 2 : 3;
return t.nFoundHits() - seedReduction >= j.params_cur().minHitsQF;
}
// simple hit-count quality filter; used with pixel-based seeds
template <class TRACK>
bool qfilter_n_hits_pixseed(const TRACK &t, const MkJob &j) {
return t.nFoundHits() >= j.params_cur().minHitsQF;
}
// layer-dependent quality filter
// includes ad hoc tuning for phase-1
template <class TRACK>
bool qfilter_n_layers(const TRACK &t, const MkJob &j) {
const BeamSpot &bspot = j.m_beam_spot;
const TrackerInfo &trk_inf = j.m_trk_info;
int enhits = t.nHitsByTypeEncoded(trk_inf);
int npixhits = t.nPixelDecoded(enhits);
int enlyrs = t.nLayersByTypeEncoded(trk_inf);
int npixlyrs = t.nPixelDecoded(enlyrs);
int nmatlyrs = t.nTotMatchDecoded(enlyrs);
int llyr = t.getLastFoundHitLyr();
int lplyr = t.getLastFoundPixelHitLyr();
float invpt = t.invpT();
// based on fr and eff vs pt (convert to native invpt)
float invptmin = 1.43; // min 1/pT (=1/0.7) for full filter on (npixhits<=3 .or. npixlyrs<=3)
float d0BS = t.d0BeamSpot(bspot.x, bspot.y);
float d0_max = 0.1; // 1 mm, max for somewhat prompt
// next-to-outermost pixel layers (almost): BPIX3 or FPIX1
bool endsInsidePix = (llyr == 2 || llyr == 18 || llyr == 45);
// not last pixel layers: BPIX[123] or FPIX[12]
bool lastInsidePix = ((0 <= lplyr && lplyr < 3) || (18 <= lplyr && lplyr < 20) || (45 <= lplyr && lplyr < 47));
// reject short tracks missing last pixel layer except for prompt-looking
return !(((npixhits <= 3 || npixlyrs <= 3) && endsInsidePix &&
(invpt < invptmin || (invpt >= invptmin && std::abs(d0BS) > d0_max))) ||
((npixlyrs <= 3 && nmatlyrs <= 6) && lastInsidePix && llyr != lplyr && std::abs(d0BS) > d0_max));
}
/// quality filter tuned for pixelLess iteration during forward search
// includes ad hoc tuning for phase-1
template <class TRACK>
bool qfilter_pixelLessFwd(const TRACK &t, const MkJob &j) {
const BeamSpot &bspot = j.m_beam_spot;
const TrackerInfo &tk_info = j.m_trk_info;
float d0BS = t.d0BeamSpot(bspot.x, bspot.y);
float d0_max = 0.05; // 0.5 mm, max for somewhat prompt
int encoded;
encoded = t.nLayersByTypeEncoded(tk_info);
int nLyrs = t.nTotMatchDecoded(encoded);
encoded = t.nHitsByTypeEncoded(tk_info);
int nHits = t.nTotMatchDecoded(encoded);
// to subtract stereo seed layers to count just r-phi seed layers (better pt err)
int seedReduction = (t.getNSeedHits() <= 5) ? 2 : 3;
// based on fr and eff vs pt and eta (convert to native invpt and theta)
float invpt = t.invpT();
float invptmin = 1.11; // =1/0.9
float thetasym = std::abs(t.theta() - Const::PIOver2);
float thetasymmin = 1.11; // -> |eta|=1.45
// accept longer tracks, reject too short and displaced
return (((t.nFoundHits() - seedReduction >= 4 && invpt < invptmin) ||
(t.nFoundHits() - seedReduction >= 3 && invpt > invptmin && thetasym <= thetasymmin) ||
(t.nFoundHits() - seedReduction >= 4 && invpt > invptmin && thetasym > thetasymmin)) &&
!((nLyrs <= 4 || nHits <= 4) && std::abs(d0BS) > d0_max && invpt < invptmin));
}
/// quality filter tuned for pixelLess iteration during backward search
// includes ad hoc tuning for phase-1
template <class TRACK>
bool qfilter_pixelLessBkwd(const TRACK &t, const MkJob &j) {
const BeamSpot &bspot = j.m_beam_spot;
const TrackerInfo &tk_info = j.m_trk_info;
float d0BS = t.d0BeamSpot(bspot.x, bspot.y);
float d0_max = 0.1; // 1 mm
int encoded;
encoded = t.nLayersByTypeEncoded(tk_info);
int nLyrs = t.nTotMatchDecoded(encoded);
encoded = t.nHitsByTypeEncoded(tk_info);
int nHits = t.nTotMatchDecoded(encoded);
// based on fr and eff vs pt and eta (convert to native invpt and theta)
float invpt = t.invpT();
float invptmin = 1.11; // =1/0.9
float thetasym = std::abs(t.theta() - Const::PIOver2);
float thetasymmin_l = 0.80; // -> |eta|=0.9
float thetasymmin_h = 1.11; // -> |eta|=1.45
// reject too short or too displaced tracks
return !(
((nLyrs <= 3 || nHits <= 3)) ||
((nLyrs <= 4 || nHits <= 4) && (invpt < invptmin || (thetasym > thetasymmin_l && std::abs(d0BS) > d0_max))) ||
((nLyrs <= 5 || nHits <= 5) && (invpt > invptmin && thetasym > thetasymmin_h && std::abs(d0BS) > d0_max)));
}
namespace {
CMS_SA_ALLOW struct register_quality_filters {
register_quality_filters() {
IterationConfig::register_candidate_filter("phase1:qfilter_n_hits", qfilter_n_hits<TrackCand>);
IterationConfig::register_candidate_filter("phase1:qfilter_n_hits_pixseed",
qfilter_n_hits_pixseed<TrackCand>);
IterationConfig::register_candidate_filter("phase1:qfilter_n_layers", qfilter_n_layers<TrackCand>);
IterationConfig::register_candidate_filter("phase1:qfilter_pixelLessFwd", qfilter_pixelLessFwd<TrackCand>);
IterationConfig::register_candidate_filter("phase1:qfilter_pixelLessBkwd", qfilter_pixelLessBkwd<TrackCand>);
}
} rqf_instance;
} // namespace
//=========================================================================
// Track scoring
//=========================================================================
float trackScoreDefault(const int nfoundhits,
const int ntailholes,
const int noverlaphits,
const int nmisshits,
const float chi2,
const float pt,
const bool inFindCandidates) {
float maxBonus = 8.0;
float bonus = Config::validHitSlope_ * nfoundhits + Config::validHitBonus_;
float penalty = Config::missingHitPenalty_;
float tailPenalty = Config::tailMissingHitPenalty_;
float overlapBonus = Config::overlapHitBonus_;
if (pt < 0.9) {
penalty *= inFindCandidates ? 1.7f : 1.5f;
bonus = std::min(bonus * (inFindCandidates ? 0.9f : 1.0f), maxBonus);
}
float score =
bonus * nfoundhits + overlapBonus * noverlaphits - penalty * nmisshits - tailPenalty * ntailholes - chi2;
return score;
}
namespace {
CMS_SA_ALLOW struct register_track_scorers {
register_track_scorers() {
IterationConfig::register_track_scorer("default", trackScoreDefault);
IterationConfig::register_track_scorer("phase1:default", trackScoreDefault);
}
} rts_instance;
} // namespace
} // namespace StdSeq
} // namespace mkfit