forked from marcelkunze/trackml
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTracker.cxx
executable file
·1782 lines (1466 loc) · 54.1 KB
/
Tracker.cxx
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
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// Neural Network based tracker
// M.Kunze, Heidelberg University, 2018
#include "Tracker.h"
#include "Reconstruction.h"
#include "PolarModule.h"
#include "Graph.h"
#include "parallel.h"
#ifdef USETMVA
#ifdef TMVAREADER
#include "TMVA/Tools.h"
#include "TMVA/Reader.h"
#endif
#include "TMVAClassification_MLP1.h"
#include "TMVAClassification_MLP2.h"
#include "TMVAClassification_MLP3.h"
#else
#include "XMLP.h"
#endif
#include <iostream>
#include <iomanip>
#include <fstream>
#include <sstream>
#include <set>
#include <algorithm>
#include <map>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <mutex>
#ifdef _WIN32
#include "direntwin32.h"
#else
#include <dirent.h>
#endif
using namespace std;
PolarModule *mod[LAYERS];
map<int, Detector> Tracker::detectors;
bool Tracker::eval;
bool Tracker::debug;
Graph<long long> Tracker::pgraph[NSLICES]; // graph to represent path information trained on slices
map<std::pair<int,int>, Graph<long long> > Tracker::tgraph; // graph to represent path information trained on individual tracks
#define PARALLEL_FOR_BEGIN(nb_elements) parallel_for(nb_elements, [&](int start, int end){ for(int i = start; i < end; ++i)
#define PARALLEL_FOR_END()},MULTITHREAD)
void process_mem_usage(double& vm_usage, double& resident_set);
Tracker::Tracker(int n,const char *datapath,const char *workpath) : filenum(n), dataPath(datapath), workPath(workpath), threshold1(THRESHOLD1), threshold2(THRESHOLD2), threshold3(THRESHOLD3), cscore(0.0)
{
static bool initialized(false);
#ifdef EVAL
eval = true;
#else
eval = false;
#endif
cout << endl << "Instantiate Tracker " << filenum << " Evaluation: " << eval << " Threaded: " << MULTITHREAD << endl;
cout << "datapath: " << dataPath << endl;
cout << "workpath: " << workPath << endl;
if (!initialized) {
cout << "PHIRESOLUTION " << Reconstruction::phiResolution() << endl;
cout << "THETARESOLUTION " << Reconstruction::thetaResolution() << endl;
cout << "SWEIGHT " << SWEIGHT << endl;
cout << "VERTEXCUTXY " << VERTEXCUTXY << endl;
cout << "VERTEXCUTZ " << VERTEXCUTZ << endl;
cout << "VERTEXCUT " << VERTEXCUT << endl;
string filename = workPath + "/detectors.csv";
readDetectors(filename.c_str());
cout << "Reading slice graphs from " << SLICEDIR << endl;
readSliceGraphs();
// Read tracking graphs
cout << "Reading tile graphs from " << TILESDIR << endl;
string dirname = workPath + "/" + TILESDIR;
readTileGraphs(dirname.c_str());
// Set up the neural networks
initNeuralNetworks();
initialized = true;
}
for (int i=0;i<MAXDIM;i++) {
assignment[i] = 0;
}
memoryFootprint();
}
Tracker::~Tracker()
{
cout << "Delete Tracker " << filenum << endl;
for (int i = 0; i < LAYERS; i++) {
if (mod[i] != NULL) {
delete mod[i];
mod[i] = NULL;
}
}
for (int i = 0; i < LAYERS; i++) {
}
}
// function to run the complete tracking algorithm
int* Tracker::findTracks(int step, const char *workpath)
{
cout << "findTracks working directory: " << workpath << endl;
workPath = workpath;
double accuracy = 0.0;
if (!eval) timer(-1);
long nhits(0), ncells(0);
nhits = initGraphData();
ncells = initHitDir();
cout << "initGraphData: " << nhits << " initHitDir: " << ncells << endl;
initPolarModule();
memoryFootprint();
// Instantiate reconstruction objects for parallel processing
static const int n = NTHREADS;
initRecoObjects(n);
// Generate a list of tasks
initTasks();
memoryFootprint();
vector<triple> pairs[n];
vector<triple> triples[n];
vector<vector<int> > path[n];
vector<vector<int> > paths;
static mutex mylock;
//for (int i=0;i<n;i++)
PARALLEL_FOR_BEGIN(n)
{
while (!tasks.empty()) {
// get a task from the stack (beware of race hazards)
mylock.lock();
if (tasks.empty()) break;
int task = tasks.top().first;
auto *g = tasks.top().second;
tasks.pop();
cout << "thread " << i << " task " << task << endl;
mylock.unlock();
// Find promising pairs
auto threadPairs = reco[i]->findCandidatesGraph(*g); // Pair candidates
auto threadTriples = reco[i]->findTriplesGraph(*g,threadPairs); // Extend pairs to triples
// Extend promising triples to paths
auto threadPath = reco[i]->findPaths(threadTriples);
// Add duplicates to paths
threadPath = reco[i]->addDuplicates(threadPath);
path[i].insert(path[i].end(),threadPath.begin(),threadPath.end());
if (!eval) {
pairs[i].insert(pairs[i].end(),threadPairs.begin(),threadPairs.end());
triples[i].insert(triples[i].end(),threadTriples.begin(),threadTriples.end());
}
}
// Assign tracks
path[i] = reco[i]->findAssignment(path[i],mod,1); // Trash=1 prunes junk tracks in the output (high numbers)
}
PARALLEL_FOR_END();
memoryFootprint();
// Accumulate the partial results
cout << "Accumulate the partial results" << endl;
paths.clear();
for (int i=0;i<n;i++) paths.insert(paths.end(),path[i].begin(),path[i].end());
long npaths = paths.size();
cout << npaths << " paths" << endl;
if (!eval) {
vector<triple> pairstotal;
for (int i=0;i<n;i++) pairstotal.insert(pairstotal.end(),pairs[i].begin(),pairs[i].end());
scorePairs(pairstotal);
vector<triple> triplestotal;
for (int i=0;i<n;i++) triplestotal.insert(triplestotal.end(),triples[i].begin(),triples[i].end());
scorePairs(triplestotal);
scoreTriples(triplestotal);
accuracy = scorePaths4(paths);
cscore = timer(accuracy);
}
// Find hit assignments to paths
for (int i=0;i<(int)hits.size();i++) assignment[i] = 0;
if (paths.size()==0) return assignment;
cout << "Find track assignment" << endl;
paths = reco[0]->findAssignment(paths,mod,1); // Trash=1 prunes junk tracks in the output (high numbers)
if (!eval) {
accuracy = scorePaths4(paths);
cscore = timer(accuracy);
}
map<int, int> assignment_part;
for (int k = 1; k < (int)paths.size(); k++)
for (int j : paths[k])
if (j > 0 && j < (int)hits.size())
assignment_part[j] = k;
for (pair<int, int> p : assignment_part)
assignment[p.first] = p.second;
map<int, int> map_assignment;
for (int i = 1; i < (int)hits.size(); i++)
if (assignment[i]) map_assignment[i] = assignment[i];
if (!eval) {
accuracy = scoreAssignment(map_assignment);
scoreAssignment2(map_assignment);
cscore = timer(accuracy);
}
cout << "Write out solution to submission" << filenum << ".csv" << endl;
writeSubmission(map_assignment,workpath,filenum);
// Clean up the reconstruction objects
for (int i=0;i<n;i++) delete reco[i];
memoryFootprint();
return assignment;
}
//Convert "dir" to polar (really cylindrical coordinates) coordinates, suffix p (as in "refp") usually means polar coodinates throughout the code
point topolar(const point&dir, const point&ref, const point&refp) {
return point(ref.x*dir.x+ref.y*dir.y, ref.x*dir.y-ref.y*dir.x, dir.z*refp.x);
}
// function to print memory consumption
void Tracker::memoryFootprint()
{
#ifdef MEMORY
double vm, rss;
process_mem_usage(vm, rss);
cout << "VM: " << vm << "; RSS: " << rss << " kb" << endl;
#endif
}
// Function to determine slice number for a hit
int Tracker::slice(int ai)
{
#ifdef OCTANTSLICES
point &p = hits[ai];
double x = p.x;
double y = p.y;
double z = p.z;
if (x >= 0 && y >= 0 && z >= 0)
return 0;
else if (x < 0 && y >= 0 && z >= 0)
return 1;
else if (x < 0 && y < 0 && z >= 0)
return 2;
else if (x >= 0 && y < 0 && z >= 0)
return 3;
else if (x >= 0 && y >= 0 && z < 0)
return 4;
else if (x < 0 && y >= 0 && z < 0)
return 5;
else if (x < 0 && y < 0 && z < 0)
return 6;
else
return 7;
#else
// spherical slices
int index = NSLICES*graphHash(ai).first/Reconstruction::phiResolution(); // phi slicing
//int index = NSLICES*graphHash(ai).second/THETARESOLUTION; // theta slicing
if (index>NSLICES-1) index = NSLICES-1;
if (index<0) index = 0;
return index;
#endif
}
// hash function to define a volume element for a hit
long long Tracker::voxel(int hitid) {
long l=metai[hitid];
long m=meta[hitid].z;
auto h = graphHash(hitid);
long long index = (((long)h.first)<<32) | (((long)h.second)<<24) | (l<<16) | m;
return index;
}
// hash function to define a graph for a hit
std::pair<int,int> Tracker::graphHash(int hitid) {
point pol = polar[hitid];
double rt = pol.x;
double ph = pol.y;
double z0 = pol.z;
double th = asinh(z0/rt); // slope (-4...+4)
int i1 = (int) (Reconstruction::phiResolution()*0.15*(M_PI+ph));
int i2 = (int) (Reconstruction::thetaResolution()*0.1*(5-th));
return make_pair(i1,i2);
}
// read tile graphs from a directory
void Tracker::readTileGraphs(const char *directory) {
DIR *dir;
struct dirent *ent;
string dirname(directory);
// read all files and fill graph
if ((dir = opendir(directory)) != NULL) {
while ((ent = readdir(dir)) != NULL) {
string file(ent->d_name);
if (file=="." || file=="..") continue;
int ph,th;
sscanf(ent->d_name,"%02d.%02d",&ph,&th);
pair<int,int> index = make_pair(ph,th);
string filename = dirname + "/" + file;
readGraph(filename.c_str(), tgraph[index]);
}
closedir (dir);
}
cout << "Reading " << tgraph.size() << " tracking graphs" << endl;
}
// generate PHIRESOLUTION.THETARESOLUTION tile graphs and write them to a directory
void Tracker::generateTileGraphs(const char *directory) {
for (auto &p : particles) {
if (p.hit.size()<3) continue;
int ai = p.hit[0];
pair<int,int> index = graphHash(ai);
long indexa,indexb;
int n = (int) p.hits-1;
for (int i=0;i<n;i++) {
int ai = p.hit[i];
int bi = p.hit[i+1];
int la = metai[ai];
int lb = metai[bi];
if (la==lb && i<(p.hits-2)) { // avoid double hit (same layer)
bi = p.hit[i+2];
lb = metai[bi];
}
indexa = voxel(ai);
indexb = voxel(bi);
if (la>lb) swap(indexa,indexb);
point &v = start_pos[truth_part[ai]];
float vz = v.z;
tgraph[index].add(indexa,indexb,vz);
}
}
cout << "Writing " << tgraph.size() << " tracking graphs" << endl;
for (auto &t : tgraph) {
pair<int,int> index = t.first;
char file[1000];
sprintf(file, "%s/%02d.%02d", directory, index.first,index.second);
writeGraph(file, t.second);
}
}
// initialize the ANNs
void Tracker::initNeuralNetworks()
{
string directory(string(workPath)+"/"+XMLPDIR+"/");
cout << "initNeuralNetworks: Reading networks from " << directory << endl;
cout << NETFILE1 << " " << NETFILE2 << " " << NETFILE3 << endl;
#ifdef USETMVA
// TMVA setup
#ifdef FOLDEDINPUT1
vector<string> inputVar1 = {"rz1","abs(abs(phi1)-1.57079632679)","abs(z1)","rz2","abs(abs(phi2)-1.57079632679)","abs(z2)","f0","f1"};
#else
vector<string> inputVar1 = {"rz1","phi1","z1","rz2","phi2","z2","f0","f1"};
#endif
#ifdef FOLDEDINPUT2
vector<string> inputVar2 = {"rz1","abs(abs(phi1)-1.57079632679)","abs(z1)","rz2","abs(abs(phi2)-1.57079632679)","abs(z2)","f0","f1","log(score)"};
#else
vector<string> inputVar2 = {"rz1","phi1","z1","rz2","phi2","z2","f0","f1","log(score)"};
#endif
#ifdef FOLDEDINPUT3
vector<string> inputVar3 = {"rz1","abs(abs(phi1)-1.57079632679)","abs(z1)","rz2","abs(abs(phi2)-1.57079632679)","abs(z2)","rz3","abs(abs(phi3)-1.57079632679)","abs(z3)","log(score)"};
#else
vector<string> inputVar3 = {"rz1","phi1","z1","rz2","phi2","z2","rz3","phi3","z3","log(score)"};
#endif
#ifdef TMVAREADER
string file1 = string(directory)+"/"+TMVAFILE1;
string file2 = string(directory)+"/"+TMVAFILE2;
string file3 = string(directory)+"/"+TMVAFILE3;
for (int i=0;i<NSLICES;i++) {
if (pgraph[i].getReader1()==NULL) pgraph[i].setReader1(new TMVA::Reader( "!Color:!Silent" ));
if (pgraph[i].getReader2()==NULL) pgraph[i].setReader2(new TMVA::Reader( "!Color:!Silent" ));
if (pgraph[i].getReader3()==NULL) pgraph[i].setReader3(new TMVA::Reader( "!Color:!Silent" ));
TMVA::Reader *reader1 = pgraph[i].getReader1();
float *x1 = pgraph[i].getX1();
for (int j=0;j<8;j++) {
reader1->AddVariable(inputVar1[j].c_str(),&x1[j]);
}
reader1->BookMVA("MLP method",file1.c_str());
TMVA::Reader *reader2 = pgraph[i].getReader2();
float *x2 = pgraph[i].getX2();
for (int j=0;j<9;j++) {
reader2->AddVariable(inputVar2[j].c_str(),&x2[j]);
}
reader2->BookMVA("MLP method",file2.c_str());
TMVA::Reader *reader3 = pgraph[i].getReader3();
float *x3 = pgraph[i].getX3();
for (int j=0;j<10;j++) {
reader3->AddVariable(inputVar3[j].c_str(),&x3[j]);
}
reader3->BookMVA("MLP method",file3.c_str());
}
for (auto &t : tgraph) {
auto &g = t.second;
if (g.getReader1()==NULL) g.setReader1(new TMVA::Reader( "!Color:!Silent" ));
if (g.getReader2()==NULL) g.setReader2(new TMVA::Reader( "!Color:!Silent" ));
if (g.getReader3()==NULL) g.setReader3(new TMVA::Reader( "!Color:!Silent" ));
TMVA::Reader *reader1 = g.getReader1();
float *x1 = g.getX1();
for (int j=0;j<8;j++) {
reader1->AddVariable(inputVar1[j].c_str(),&x1[j]);
}
reader1->BookMVA("MLP method",file1.c_str());
TMVA::Reader *reader2 = g.getReader2();
float *x2 = g.getX2();
for (int j=0;j<9;j++) {
reader2->AddVariable(inputVar2[j].c_str(),&x2[j]);
}
reader2->BookMVA("MLP method",file2.c_str());
TMVA::Reader *reader3 = g.getReader3();
float *x3 = g.getX3();
for (int j=0;j<10;j++) {
reader3->AddVariable(inputVar3[j].c_str(),&x3[j]);
}
reader3->BookMVA("MLP method",file3.c_str());
}
#endif
for (int i=0;i<NSLICES;i++) {
if (pgraph[i].getNet1()==NULL) pgraph[i].setNet1(new ReadMLP1(inputVar1));
if (pgraph[i].getNet2()==NULL) pgraph[i].setNet2(new ReadMLP2(inputVar2));
if (pgraph[i].getNet3()==NULL) pgraph[i].setNet3(new ReadMLP3(inputVar3));
}
for (auto &t : tgraph) {
auto &g = t.second;
if (g.getNet1()==NULL) g.setNet1(new ReadMLP1(inputVar1));
if (g.getNet2()==NULL) g.setNet2(new ReadMLP2(inputVar2));
if (g.getNet3()==NULL) g.setNet3(new ReadMLP3(inputVar3));
}
#else
for (int i=0;i<NSLICES;i++) {
string name1(NETFILE1);
string name2(NETFILE2);
string name3(NETFILE3);
if (pgraph[i].net1()==NULL) pgraph[i].setNet1(new XMLP((directory+name1).c_str()));
if (pgraph[i].net2()==NULL) pgraph[i].setNet2(new XMLP((directory+name2).c_str()));
if (pgraph[i].net3()==NULL) pgraph[i].setNet3(new XMLP((directory+name3).c_str()));
}
for (auto &t : tgraph) {
string netfile1(string(workPath)+"/"+XMLPDIR+"/"+NETFILE1);
string netfile2(string(workPath)+"/"+XMLPDIR+"/"+NETFILE2);
string netfile3(string(workPath)+"/"+XMLPDIR+"/"+NETFILE3);
auto &g = t.second;
if (g.net1()==NULL) g.setNet1(new XMLP(netfile1.c_str()));
if (g.net2()==NULL) g.setNet2(new XMLP(netfile2.c_str()));
if (g.net3()==NULL) g.setNet3(new XMLP(netfile3.c_str()));
}
#endif
}
void Tracker::initPolarModule() {
for (int i = 0; i < LAYERS; i++)
if (mod[i] == NULL) mod[i] = new PolarModule(i,this);
}
// generate a task list to be executed by the threads
void Tracker::initTasks()
{
#ifdef SLICES
// divide the threads into hemispheres
const int order16[16] = {0,8,1,9,2,10,3,11,4,12,5,13,6,14,7,15};
const int order8[8] = {0,4,1,5,2,6,3,7};
const int order6[6] = {0,3,1,4,2,5};
const int order4[4] = {0,2,1,3};
cout << "Perform tile tasks" << endl;
for (int i=0;i<NSLICES;i++) {
int n = i;
if (NSLICES==16)
n = order16[i];
if (NSLICES==8)
n = order8[i];
else if (NSLICES==6)
n = order6[i];
else if (NSLICES==4)
n = order4[i];
tasks.push(make_pair(n,&pgraph[n]));
}
#else
cout << "Perform " << tgraph.size() << "graph tasks" << endl;
int task(0);
for (auto &t : tgraph) {
Graph<long long> *g = &tgraph[t.first];
tasks[task%NTHREADS].push(make_pair(task++,g));
}
#endif
}
// Instantiate reconstruction objects for parallel processing
Reconstruction *Tracker::initRecoObjects(int n)
{
static const double t1offsets[15] = {0,0,0,0,0,0,0,0,-0.01,0.01,0.02,0.02,0,0,0};
static const double t2offsets[15] = {0,0,0,0,0,0,0,0,-0.01,0.01,0.02,0.02,0,0,0};
static const double t3offsets[15] = {0,0,0,0,0,0,0,0,-0.2,-0.1,-0.1,0,0,0,0};
threshold1 += t1offsets[(getNumberHits()/10000)%15]; // tune the nerual network cut wrt event size
threshold2 += t2offsets[(getNumberHits()/10000)%15]; // tune the nerual network cut wrt event size
threshold3 += t3offsets[(getNumberHits()/10000)%15]; // tune the nerual network cut wrt event size
cout << "initRecoObjects: Instantiate " << n << " reconstruction objects for parallel processing" << endl;
cout << "THRESHOLD1: " << threshold1 << " THRESHOLD2: " << threshold2 << " THRESHOLD3: " << threshold3 << endl;
for (int task=0;task<n;task++) {
reco[task] = new Reconstruction(filenum,workPath.c_str(),tgraph,hits,polar,meta,metai,metaz,layer,disc_z,hit_cells,hit_dir);
reco[task]->setThreshold1(threshold1);
reco[task]->setThreshold2(threshold2);
reco[task]->setThreshold3(threshold3);
}
return *reco;
}
//does hits a and b correspond to the same particle?
int Tracker::samepart(int a, int b) {
long long aa = truth_part[a];
long long bb = truth_part[b];
return aa==bb;//aa == bb && aa;
}
void Tracker::sortZ(vector<int> &hits)
{
std::sort(hits.begin(), hits.end(), [this](int a, int b) {return z_cmp(a, b); });
}
void Tracker::sortR(vector<int> &hits)
{
std::sort(hits.begin(), hits.end(), [this](int a, int b) {return r_cmp(a, b); });
}
void Tracker::sortDist(vector<int> &hits)
{
std::sort(hits.begin(), hits.end(), [this](int a, int b) {return dist_cmp(a, b); });
}
inline bool Tracker::z_cmp(const int &a, const int &b) {
return hits[a].z < hits[b].z;
}
inline bool Tracker::r_cmp(const int &a, const int &b) {
return hits[a].x*hits[a].x+hits[a].y*hits[a].y < hits[b].x*hits[b].x+hits[b].y*hits[b].y;
}
inline bool Tracker::dist_cmp(const int &a, const int &b) {
return hits[a].x*hits[a].x+hits[a].y*hits[a].y+hits[a].z*hits[a].z < hits[b].x*hits[b].x+hits[b].y*hits[b].y+hits[b].z*hits[b].z;
}
// Prepare the hits in modules
long Tracker::initGraphData()
{
long nhits = hits.size();
for (int i=0;i<NSLICES;i++) pgraph[i].clear();
for (auto &t : tgraph) t.second.clear();
long n(0);
for (int i=1; i<nhits; i++) {
if (assignment[i] != 0) continue; // Skip hits
int l = metai[i];
if (l<0 || l>=LAYERS) continue;
long long index = voxel(i);
int ti = slice(i);
pgraph[ti].data(index).push_back(i);
pgraph[ti].hash(l).insert(index);
pair<int,int> cindex = graphHash(i);
tgraph[cindex].data(index).push_back(i);
tgraph[cindex].hash(l).insert(index);
n++;
//if (verbose) cout << i << " " << l << " " << m << " " << index << endl;
}
return n;
}
#ifdef MEMORY
#include <iostream>
#include <fstream>
#include <unistd.h>
// check memory usage
void process_mem_usage(double& vm_usage, double& resident_set)
{
vm_usage = 0.0;
resident_set = 0.0;
// the two fields we want
unsigned long vsize;
long rss;
{
std::string ignore;
std::ifstream ifs("/proc/self/stat", std::ios_base::in);
ifs >> ignore >> ignore >> ignore >> ignore >> ignore >> ignore >> ignore >> ignore >> ignore >> ignore
>> ignore >> ignore >> ignore >> ignore >> ignore >> ignore >> ignore >> ignore >> ignore >> ignore
>> ignore >> ignore >> vsize >> rss;
}
long page_size_kb = sysconf(_SC_PAGE_SIZE) / 1024; // in case x86-64 is configured to use 2MB pages
vm_usage = vsize / 1024.0;
resident_set = rss * page_size_kb;
}
#else
void process_mem_usage(double& vm_usage, double& resident_set)
{}
#endif
#include <ctime>
#define MAX_TIME_PER_EVENT 600
#define ACCURACY_INF 0.5
// check execution time
double Tracker::timer(double accuracy_mean)
{
static clock_t c_start = clock();
double score = 0.0;
if (accuracy_mean < 0) {
c_start = clock();
}
else {
clock_t c_end = clock();
double time_elapsed_ms = 1000.0 * (c_end-c_start) / CLOCKS_PER_SEC;
double speed = log(1.0 + ( MAX_TIME_PER_EVENT / (time_elapsed_ms*0.001) ));
/*if (accuracy_mean>ACCURACY_INF)*/ score = sqrt(speed * pow((accuracy_mean - ACCURACY_INF),2));
cout << "CodaLab score: " << score << endl;
cout << "CPU time used: " << time_elapsed_ms << " ms" << endl;
}
return score;
}
// Print an integer hit id track vector
void Tracker::print(vector<int> const &input)
{
for (unsigned int i = 0; i < input.size(); i++) {
cout << input.at(i) << ' ';
}
cout << endl;
}
// Print an integer short hit id track vector
void Tracker::printshort(vector<int> const &input)
{
for (unsigned int i = 0; i < input.size(); i++) {
cout << shortid(input.at(i)) << ' ';
}
cout << endl;
}
// write the result file
void Tracker::writeSubmission(map<int, int>&assignment,string path=WORKPATH, int filenum=21100) {
char filename[1000];
sprintf(filename, "%s/submission%d.csv",path.c_str(),filenum);
FILE*fp = fopen(filename, "w");
if (!fp) {
cout << "Could not open " << filename << " for writing submission" << endl;
return;
}
fprintf(fp, "event_id,hit_id,track_id\n");
for (int i = 1; i < (int)hits.size(); i++) {
int a = 0;
if (assignment.count(i)) a = assignment[i];
fprintf(fp, "%d,%d,%d\n", filenum, i, a);
}
fclose(fp);
}
// Write graph data to file
void Tracker::writeGraph(const char *file, Graph<pair<int,int> > &g) {
string filename(file);
cout << "Writing graph data to " << filename << endl;
ofstream path(filename);
if (path.is_open()) {
path << g;
path.close();
}
else
cout << "Unable to open file " << filename << endl;
}
// Write graph data to file
void Tracker::writeGraph(const char *file, Graph<long long> &g) {
string filename(file);
cout << "Writing graph data to " << filename << endl;
ofstream path(filename);
if (path.is_open()) {
path << g;
path.close();
}
else
cout << "Unable to open file " << filename << endl;
}
// Read path data from file
void Tracker::readGraph(const char *file, Graph<pair<int,int> > &g) {
string filename(file);
//cout << "Reading graph data from " << filename << endl;
ifstream input;
input.open(filename);
if (!input.is_open()) {
cerr << "couldn't open " << filename << endl;
}
else {
input >> g;
input.close();
}
}
// Read path data from file
void Tracker::readGraph(const char *file, Graph<long long> &g) {
string filename(file);
//cout << "Reading graph data from " << filename << endl;
ifstream input;
input.open(filename);
if (!input.is_open()) {
cerr << "couldn't open " << filename << endl;
}
else {
input >> g;
input.close();
}
}
// Generate graphs to represent the track hits in a detector slice
void Tracker::generateSliceGraphs() {
int tracknumber = 1;
for (auto &track : truth_tracks) {
vector<int> &t = track.second;
if (t.size()==0) continue;
if (debug) cout << "Track " << tracknumber << ", size " << t.size() << " {" << shortid(t[0]) << "," << shortid(t[1]) << "}" << endl;
long previndex = voxel(t[0]);
long n = 0;
int ti = slice(t[0]);
for (auto &hit_id : t) {
long index = voxel(hit_id);
point &v = start_pos[truth_part[hit_id]];
float vz = v.z;
// Add the hit pair to the paths graph
pgraph[ti].add(previndex,index,vz); // forward direction, note z vertex
if (debug) cout << shortid(hit_id) << "={" << previndex << "," << index << "},";
previndex = index;
n++;
}
tracknumber++;
}
}
// read graphs to represent the track hits in a detector slice
void Tracker::readSliceGraphs()
{
for (int i=0;i<NSLICES;i++) {
stringstream ss;
ss << workPath << "/" << SLICEDIR << "/paths" << i << ".csv";
readGraph(ss.str().c_str(),pgraph[i]);
}
}
// write graphs to represent the track hits in a detector slice
void Tracker::writeSliceGraphs()
{
for (int i=0;i<NSLICES;i++) {
stringstream ss;
ss << workPath << "/" << SLICEDIR << "/paths" << i << ".csv";
writeGraph(ss.str().c_str(),pgraph[i]);
}
}
// The following code has been adopted from Johan Sokrates Wind's award winning trackml Kaggle contribution
//Contains functions to estimate score at different steps in the pipeline (assuming the remaining steps are done optimally)
double Tracker::scorePairs(vector<triple>&pairs) {
set<long long> found;
for (auto &p : pairs) {
if (samepart(get<0>(p),get<1>(p))) {
found.insert(truth_part[get<0>(p)]);
}
}
double score = 0;
for (long long p : found) {
score += part_weight[p];
}
cout << "Score: " << score << " from " << pairs.size() << " pairs" << endl;
return score;
}
double Tracker::scoreTriples(vector<triple>&triples) {
set<long long> found;
for (auto &t : triples) {
if (samepart(get<0>(t),get<1>(t)) && samepart(get<0>(t),get<2>(t))) {
found.insert(truth_part[get<0>(t)]);
}
}
double score = 0;
for (long long p : found) {
score += part_weight[p];
}
cout << "Score: " << score << " from " << triples.size() << " triples" << endl;
return score;
}
double Tracker::scorePaths4(vector<vector<int> > &paths) {
int total_length = 0;
map<long long, double> score_part;
for (auto &path : paths) {
total_length += path.size();
set<long long> done;
//int minmeta = 1e9;
//for (int i : path) minmeta = min(minmeta, metai[i]);
for (int i : path) {
if (i<0 || i>(int)hits.size()) continue;
long long part = truth_part[i];
if (done.count(part)) continue;
done.insert(part);
double w = 0;
for (int i : truth_tracks[part]) {
for (int j : path) {
if (j<0 || j>(int)hits.size()) continue;
if (truth_part[j] == part && metai[j] == metai[i] && point::dist(hits[i]-hits[j]) < 10) {
w += truth_weight[i];
break;
}
}
}
score_part[part] = max(score_part[part], w);
}
}
double score = 0;
for (auto &p : score_part) if (p.first) score += p.second;
cout << "Score: " << score << " from " << paths.size() << " paths with " << total_length << " hits" << endl;
return score;
}
double Tracker::scoreAssignment(map<int, int>&assignment) {
map<int, int> track_length;
for (auto &p : assignment)
track_length[p.second]++;
double score = 0, score2 = 0;
for (auto &it : truth_tracks) {
map<int, int> c;
for (int i : it.second)
if (assignment.count(i))
c[assignment[i]]++;
int pick = -1, maxlen = -1;
for (auto &p : c)
if (p.second*2 > maxlen && p.second*2 > track_length[p.first]) {
pick = p.first;
maxlen = p.second*2;
}
if (pick == -1) continue;
for (int i : it.second)
if (assignment[i] == pick) {
if (maxlen > (int)it.second.size()) score += truth_weight[i];
else score2 += truth_weight[i];
}
}
//"Final score: " should be the same as the official score (except for blacklisted electrons)
cout << "Final score: " << score << " from " << assignment.size() << " hits out of " << hits.size()-1 << endl;
cout << "Short score: " << score+score2 << " from " << assignment.size() << " hits out of " << hits.size()-1 << endl;
return score;
}
void Tracker::scoreAssignment2(map<int,int> &assignment) {
map<int, int> track_length;
for (auto &p : assignment)
track_length[p.second]++;
double score = 0, score2 = 0, score3 = 0, score4 = 0;
for (auto &it : truth_tracks) {
map<int, int> c;
for (int i : it.second) {
if (assignment.count(i))
c[assignment[i]]++;
}