-
Notifications
You must be signed in to change notification settings - Fork 0
/
floodingFilter.cpp
1366 lines (1080 loc) · 47.3 KB
/
floodingFilter.cpp
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
/*************************************
* Author: S. Gazagnes *
*************************************/
#include <iostream>
#include <set>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <fstream>
#include <vector>
#include <string>
#include <chrono>
#include<unistd.h>
// Root headers
#include "TFile.h"
#include "TNtuple.h"
#include "TStopwatch.h"
#include "TH1.h"
// Local headers
#include "auxfunctions.h"
#include "gridNode.h"
#include "CoordGrid.h"
#include "CollectSttMvdPoints.h"
#include "hitcoordinate.h"
#include "error.h"
#include "logc.h"
#include "phconnect.h"
#include "phfitting.h"
#include "phmerging.h"
#include "phzinterp.h"
// DEBUG AND STORE definitions
#define EVALUATE_ERROR 1
#define READ_GRID_FROM_FILE 0
#define DO_RECONSTRUCTION 1
#define DO_CONNECT 1
#define DO_FITTING 1
#define DO_MERGING 1
#define DO_ZRECONS 1
#define WRITE_CONNECTED_COMPONENTS 1
#define INCLUDE_MVD_INOUTPUT_TRACK 0
#define WRITE_CONNECTED_COMPONENTS_JSON 0
#define WRITE_CM_ASCII_FILE 0
#define WRITE_TIME_ASCII_FILE 1
#define WRITE_LIST_RECO_ID 0
void floodingFilter(std::string const &OutFileName,int firstEvt, int lastEvt)
{
/* Files and Tuples definitions */
// File and structure to hold the output coordinates.
TFile OutputFile(OutFileName.c_str(), "RECREATE", "Outputfile created by floodingFilter macro", 9);
// Collected coordinates for tracks.
TNtuple GridCoordNtuple("CoordCollected" , "Collected Coordinates in x y plane", "x:y:z:x_Det:y_Det:z_Det");
// Ntuple to hold Global Error values
std::string GlobalErrorPars = "evtID:nMC:nReco:Error_underMerge:Error_overMerge:TotalError";
GlobalErrorPars += ":Error_underMergeNorm:Error_overMergeNorm:TotalErrorNorm";
TNtuple GlobalErrorNtuple("GlobalEvtError","Segmentation error values", GlobalErrorPars.c_str());
// NTuple to hold error per MC track
std::string PerMCTrkErrPars = "evtID:Complex:Mismatched:MatchIdx:MCLength:RecoLength:InterLength:UnionLength";
PerMCTrkErrPars += ":F1score:MeanDiffX:MeanDiffY:MeanDiffZ";
TNtuple ErrorPerMCTrackNtuple("PerMCTrackError", "Per track values of error", PerMCTrkErrPars.c_str());
//NTuple to hold curvature/momentum parameters per pair of MC and Reco track
std::string CurvTrkPars = "evtID:MC_px:MC_py:MC_pz:MC_r1:MC_r2";
CurvTrkPars+= ":tr_rIsoRand:tr_rIsoRand16:tr_rIsoRand84:tr_rAnc:tr_rPts:tr_scattAngle";
TNtuple CurvPerTrackNtuple("PerTrackCurv", "Per track values of circle fit and MC momentum", CurvTrkPars.c_str());
// NTuple to hold panda error metric per reco track
std::string PerRecoTrkErrPars = "evtID:Rank:Clone";
TNtuple ErrorPerRecoTrackNtuple("PerRecoTrackError", "Per track values of error", PerRecoTrkErrPars.c_str());
//NTuple to hold coordinates differences between MC and Reco
std::string DiffTrkPars = "disx:disy:disz";
TNtuple CoordDiffPerTrackNtuple("CoordDiffPerTrackError", "Per track values of coordinates errors",
DiffTrkPars.c_str());
// NTuple to hold the coordinates of all reco'd tracks.
std::string ConnCompPar = "EvtNum:CompNum:bestIdx:tubeId:x:y:z:r:thetaDeg:x_Det:y_Det:z_Det";
TNtuple ConnectedCoord ("ConnectedComponents", "Connected component Coordinates", ConnCompPar.c_str());
// NTuple to hold the coordinates of the anchors of the reco'd tracks.
std::string AnchorCCPar = "EvtNum:CompNum:x_Det:y_Det:z_Det";
TNtuple AnchorCCCoord ("ConnectedComponentsAnchors", "Connected component anchors Coordinates",
AnchorCCPar.c_str());
// NTuple to Hold number of components per event
TNtuple ComponentPerEvt ("ComponentPerEvt", "Component per event","evtNum:numComponents");
// Ntuple to hold MC tubes IDS and track number
TNtuple MCDetID("MCDetID", "MC track detectors per event","evtNum:MCtrkID:detID");
TNtuple RecoDetID("RecoDetID", "Reco'd track detectors per event","evtNum:RecotrkID:detID");
// Setting verbosity level, put 1 for the debug you want
// {error,time,info,collect,grid,connect,fit,merge,trkz,trkerror}
// examples: {0,0,0,0,0,0,0,0,1,1}{1,1,1,0,0,0,0,0,0,0};
bool v[10] = {0,0,0,0,0,0,0,0,0,1};
set_verbosity(v);
// Reading the parameters of given simulations
char *SimName = "../rootfiles/evtcomplete20000";
// geo 2 1572086365
// geo 1 1583944737
// Muon_z0 1611761510
// Muon_z30 1611844116
// Muon_z120 1611844771
// 20000: 1614788215
// 20000B15: 1618615353
// Muon B1 1619780508
// Beam 3 1619749644
// Read all data directly from sim, digi and parameter files
std::vector < GridNode > DetectorNodes;
std::vector < std::vector<HitCoordinate*>* >* HitsData =
CollectSttMvdPoints(DetectorNodes, SimName, OutputFile, 1614788215, firstEvt, lastEvt);
std::vector< std::vector < MCTrackObject* >* > *MCTracks = MCTrackPoints(*HitsData);
// Write event info to output
WriteEventPlotsToFile( (*HitsData), OutputFile);
// Create an empty grid object and init it for STT
CoordGrid GridStruct;
GridStruct.Initialize(DetectorNodes);
GridStruct.CorrectLayerLimit();
TNtuple Layers("LayerLimits","Layer Limits.","x:y:det_z:z");
TNtuple Sections("SectionsLimits","Section Limits.","x:y:det_z:z");
// Isolate Sector and Layer Limits
GridStruct.isolateSectorAndLayerLimits(Sections, Layers);
Sections.Write();
Layers.Write();
// Write Original grid setup to root file
TNtuple* OrigGrid = GridToNtuple(DetectorNodes, "OrigGridCoord");
OrigGrid->SetMarkerStyle(7);
OrigGrid->SetMarkerSize(0.3);
OrigGrid->SetMarkerColor(17);
OrigGrid->Write();
// Fix some neighbors before extending to Virtual Node
GridStruct.fixNeighboring();
// Extend grid with Virtual Nodes
std::vector < GridNode > VNodesLayer;
std::vector < GridNode > VNodesSector;
GridStruct.AddVirtualNodes(VNodesLayer, VNodesSector);
// Old extension for intersector Nodes: Compute_Virtual_InterSector_Nodes(gr, 6,VNodes);
TNtuple* virtualTubesLayer = GridToNtuple(VNodesLayer, "VirtualNodesLayer");
TNtuple* virtualTubesSector = GridToNtuple(VNodesSector, "VirtualNodesSector");
virtualTubesLayer->SetMarkerStyle(8);
virtualTubesLayer->SetMarkerSize(0.2);
virtualTubesLayer->SetMarkerColor(kMagenta);
virtualTubesLayer->Write();
virtualTubesSector->SetMarkerStyle(8);
virtualTubesSector->SetMarkerSize(0.2);
virtualTubesSector->SetMarkerColor(kCyan);
virtualTubesSector->Write();
dbggrid("Extending the grid by %d virtual nodes between the layers.", VNodesLayer.size());
dbggrid("Extending the grid by %d virtual nodes between the sectors.", VNodesSector.size());
GridStruct.ExtendedGrid(VNodesLayer);
GridStruct.ExtendedGrid(VNodesSector);
// Fix some neighbors after extending to Virtual Node
GridStruct.fixNeighboring();
// Write extended grid
TNtuple* extendedGrid = GridToNtuple(GridStruct.m_grid, "ExtendedGrid");
extendedGrid->SetMarkerStyle(7);//8
extendedGrid->SetMarkerSize(0.3);
extendedGrid->SetMarkerColor(17);//41
extendedGrid->Write();
dbggrid("Total number of tubes after extension = %d", GridStruct.GetNumNodes());
// Clean up
delete OrigGrid;
delete virtualTubesLayer;
delete virtualTubesSector;
delete extendedGrid;
VNodesLayer.clear();
VNodesSector.clear();
// Finding total number of events collected
unsigned int totalnumEvt = HitsData->size();
info("We have %u event(s) to process", totalnumEvt);
// Start the timer.
auto TimeAll = std::chrono::high_resolution_clock::now();
double RecTotalTime = 0;
/* +++++++++++++++++++++++++++++++++++++++ */
/* ++++++++ Start reconstruction +++++++++ */
/* +++++++++++++++++++++++++++++++++++++++ */
TStopwatch timer;
#if(DO_RECONSTRUCTION == 1)
timer.Start();
int lastevtID = -1;
int nEvtProc = 0;
int nTrkProc = 0;
int nTrk5hitsProc = 0;
int nHitsProc = 0;
// Open file to write timings
#if (WRITE_TIME_ASCII_FILE > 0)
std::string header = "evt,trks,hits,filltime,contime,fittime,mergtime,ztime,tottime\n";
std::ofstream TimeTxtFile;
TimeTxtFile.open ("Timeperevent.csv");
if (TimeTxtFile.is_open())
TimeTxtFile << header;
#endif
#if (WRITE_LIST_RECO_ID > 0)
std::string MCheader = "evt,trkid,detid\n";
std::ofstream MCOutTxtFile;
MCOutTxtFile.open ("MCTrackIDList.csv");
if (MCOutTxtFile.is_open())
MCOutTxtFile << MCheader;
std::string Recoheader = "evt,trkid,detid\n";
std::ofstream RecOutTxtFile;
RecOutTxtFile.open ("RecoTrackIDList.csv");
if (RecOutTxtFile.is_open())
RecOutTxtFile << Recoheader;
#endif
// Checking that the event has enough number of hits to process (5 minimum)
for(size_t evt = 0; evt < HitsData->size(); ++evt) {
int totHits = 0;
std::set<int> nIndTubes;
for(size_t i = 0; i < MCTracks->at(evt)->size(); ++i) {
MCTrackObject const *MCtrack = MCTracks->at(evt)->at(i);
std::set<int> MCSttComp((MCtrack->m_STT_Component).begin(), (MCtrack->m_STT_Component).end());
nIndTubes.insert(MCSttComp.begin(), MCSttComp.end());
}
totHits = nIndTubes.size();
if(totHits == 0){ //
info("This event did not contain any tracks");
continue;
} else if( totHits < 5){
info("This event contains only %d hits, skip", totHits);
continue;
} else {
info("Processing event: %d", evt);
nHitsProc += totHits;
nTrkProc += MCTracks->at(evt)->size();
for(size_t i = 0; i < MCTracks->at(evt)->size(); ++i) {
MCTrackObject const *MCtrack = MCTracks->at(evt)->at(i);
std::set<int> MCSttComp((MCtrack->m_STT_Component).begin(), (MCtrack->m_STT_Component).end());
if(MCtrack->m_STT_Component.size()>5){ // Only considering MC tracks with >5 hits
nTrk5hitsProc++;
}
}
nIndTubes.clear();
nEvtProc++;
lastevtID = evt;
}
//Starting Evt clock
auto TimeEvt = std::chrono::high_resolution_clock::now();
double FillingTime;
double ConnectTime;
double FittingTime;
double MergingTime;
double zRecTime;
double EvtTotalTime;
int nSTTHits = (int) totHits;
int nMCTracks = (int) MCTracks->at(evt)->size();
// Filling the grid
if(HitsData->at(evt))
GridStruct.FillGrid(*(HitsData->at(evt)));
auto TimeNow = std::chrono::high_resolution_clock::now();
FillingTime = std::chrono::duration<double>(TimeNow - TimeEvt).count();
timing("Time elapsed to fill the grid: %.6lf s", FillingTime);
std::vector< GridNode > &DetGridCopy = GridStruct.m_grid; // Copying the grid to avoid re-init for each event
std::vector< GridNode > DetGrid(DetGridCopy); // Starting from a fresh already init grid :)
std::vector< std::set<int>* >* RecoTrackListDetID = 0; // Vector of reconstruction tracks
RecoTrackListDetID = new std::vector< std::set<int>* >();
int nTubesFired = 0;
std::vector<pair<int, unsigned short>> ListActiveTubes;
std::vector<pair<int, unsigned short>> ListPrioTubes;
std::vector<pair<int, unsigned short>> ListOtherTubes;
std::set<int>::iterator it = GridStruct.m_STT_idx.begin();
while (it != GridStruct.m_STT_idx.end()) {
int Idx = *it;
GridNode &CurNode = DetGrid[Idx-1];
it++;
for ( size_t i = 0; i < CurNode.m_neighbors.size() ; ){
int NeighTubeIdx = CurNode.m_neighbors[i];
if(DetGrid[NeighTubeIdx-1].m_type == GridNode::VIRTUAL_NODE){
int nID = DetGrid[NeighTubeIdx-1].m_neighbors[0] == Idx?
DetGrid[NeighTubeIdx-1].m_neighbors[1] : DetGrid[NeighTubeIdx-1].m_neighbors[0];
GridNode const &First = DetGrid[nID-1];
if(First.m_active)
DetGrid[NeighTubeIdx-1].m_active = true;
else{
(CurNode.m_neighbors).erase((CurNode.m_neighbors).begin()+i);
continue;
}
} else if(!DetGrid[NeighTubeIdx-1].m_active){
(CurNode.m_neighbors).erase((CurNode.m_neighbors).begin()+i);
continue;
}
i++;
} // End For CurNode neighbors
if(CurNode.m_LayerLimit == 1 )
ListPrioTubes.push_back(make_pair(Idx, (unsigned short) CurNode.m_neighbors.size()));
else if (CurNode.m_neighbors.size() == 1)
ListOtherTubes.push_back(make_pair(Idx, (unsigned short) CurNode.m_neighbors.size()));
else
ListActiveTubes.push_back(make_pair(Idx, (unsigned short) CurNode.m_neighbors.size()));
nTubesFired++;
} // End while GridStruct
dbgconnect("Found %d active detectors (%d with virtuals)",ListActiveTubes.size(), nTubesFired);
sort(ListPrioTubes.begin(), ListPrioTubes.end(), sortbysec);
ListActiveTubes.insert( ListActiveTubes.begin(), ListOtherTubes.begin(), ListOtherTubes.end() );
ListActiveTubes.insert( ListActiveTubes.begin(), ListPrioTubes.begin(), ListPrioTubes.end() );
ListPrioTubes.clear();
ListOtherTubes.clear();
std::vector< int > ListComplexTracks;
#if(EVALUATE_ERROR == 1)
ComplexTracks(GridStruct, MCTracks->at(evt), &ListComplexTracks);
#endif
std::vector < PathCandidate* > RecoTracks;
int candidateId = 0;
char *visited = (char *) calloc(DetGrid.size()+1, sizeof(char));
/* ++++++++++++++++++++++++++++++++++++++++++++++++++++ */
/* First Reconstruction Phase: Connect */
/* ++++++++++++++++++++++++++++++++++++++++++++++++++++ */
#if(DO_CONNECT == 1)
info("First phase: finding obvious tracklets");
findEasyTracks (GridStruct, DetGrid, RecoTracks, ListActiveTubes, visited, &candidateId);
TimeNow = std::chrono::high_resolution_clock::now();
ConnectTime = std::chrono::duration<double>( TimeNow - TimeEvt ).count() - FillingTime;
timing("Time elapsed in connect phase: %.6lf s", ConnectTime);
if(RecoTracks.size() > 0)
dbgconnect("We found %d RecoTracks", candidateId);
size_t OldnTubes = ListActiveTubes.size();
for(unsigned int n = 0; n < ListActiveTubes.size();) {
if(visited[ListActiveTubes[n].first] == 1){
ListActiveTubes.erase(ListActiveTubes.begin() + n);
continue;
}
n++;
}
dbgconnect("We matched %lu detectors (remaining %lu)",
OldnTubes-ListActiveTubes.size(), ListActiveTubes.size());
std::sort(RecoTracks.begin(), RecoTracks.end(), compareTwoPathsLength);
#endif
/* ++++++++++++++++++++++++++++++++++++++++++++++++++++ */
/* First Reconstruction Phase: Fitting */
/* ++++++++++++++++++++++++++++++++++++++++++++++++++++ */
#if(DO_FITTING)
// Array to store the IDs of tracks to be merged
int **TrackIDToMerge = (int **) calloc(RecoTracks.size(), sizeof(int*));
for (size_t i = 0; i < RecoTracks.size(); i++)
TrackIDToMerge[i] = (int *) calloc(RecoTracks.size(), sizeof(int));
info("Second phase: fitting to find complex tracks");
fittingPhase(GridStruct, DetGrid, RecoTracks, ListActiveTubes, visited, TrackIDToMerge);
OldnTubes = ListActiveTubes.size();
for(size_t n = 0; n < ListActiveTubes.size(); ++n) {
if(visited[ListActiveTubes[n].first] == 1){
ListActiveTubes.erase(ListActiveTubes.begin() + n);
n--;
}
}
dbgfit("We matched %lu detectors (remaining %lu)",
OldnTubes-ListActiveTubes.size(), ListActiveTubes.size());
TimeNow = std::chrono::high_resolution_clock::now();
FittingTime = std::chrono::duration<double>( TimeNow - TimeEvt ).count() - ConnectTime - FillingTime;
timing("Time elapsed in fitting phase: %.6lf s", FittingTime);
// Trying to connect remaining nodes if possible FIXME because I'm a mess
sort( ListActiveTubes.begin(), ListActiveTubes.end() );
for(size_t n = 0; n < ListActiveTubes.size(); ++n) {
std::vector<int> SameLayerTubes;
std::vector<int> OtherLayerTubes;
int TubeID = ListActiveTubes[n].first;
if(visited[TubeID])
continue;
GridNode &ThisTube = DetGrid[TubeID-1];
bool AreAllVisited = true;
for(size_t m = 0; m < ThisTube.m_neighbors.size(); m++){
int NeighTubeID = ThisTube.m_neighbors[m];
GridNode &NeighTube = DetGrid[NeighTubeID-1];
if(NeighTube.m_type == GridNode::VIRTUAL_NODE)
continue;
if(!visited[NeighTubeID]){
AreAllVisited = false;
} else if(visited[NeighTubeID] == 1){
if(NeighTube.m_Layer == ThisTube.m_Layer){
if(std::find(SameLayerTubes.begin(), SameLayerTubes.end(), NeighTubeID) == SameLayerTubes.end())
SameLayerTubes.push_back(NeighTubeID);
} else{
if(std::find(OtherLayerTubes.begin(), OtherLayerTubes.end(), NeighTubeID) == OtherLayerTubes.end())
OtherLayerTubes.push_back(NeighTubeID);
}
}
} // End For tube neighbors
if(SameLayerTubes.size() > 0){
GridNode &NeighTube = DetGrid[SameLayerTubes[0]-1];
int TrackToMerge = NeighTube.m_cm[0];
const auto p = std::find_if(RecoTracks.begin(), RecoTracks.end(),
[TrackToMerge](const PathCandidate *obj){ return obj->m_id == TrackToMerge; } );
PathCandidate &neighCand = *(*p); // The CC that the node belongs to
//Find where the node is in the list of the other CC
std::vector<int>::iterator it = std::find((neighCand.m_memberList)->begin(),
(neighCand.m_memberList)->end(),
NeighTube.m_detID);
neighCand.insertNewNode(GridStruct, DetGrid, &ThisTube, it);
visited[TubeID] = 1;
} else if(AreAllVisited && OtherLayerTubes.size() > 0){
std::vector<int> PotTrackList;
for(size_t m = 0; m < OtherLayerTubes.size(); m++){
GridNode &NeighTube = DetGrid[OtherLayerTubes[m]-1];
if(std::find(PotTrackList.begin(), PotTrackList.end(), NeighTube.m_cm[0]) == PotTrackList.end()){
PotTrackList.push_back(NeighTube.m_cm[0]);
}
}
if(PotTrackList.size() == 0){
int TrackToMerge = PotTrackList[0];
const auto p = std::find_if(RecoTracks.begin(), RecoTracks.end(),
[TrackToMerge](const PathCandidate *obj){ return obj->m_id == TrackToMerge;});
PathCandidate &neighCand = *(*p); // The PotTrackList that the node belongs to
//Find where the node is in the list of the other PotTrackList
std::vector<int>::iterator it = std::find((neighCand.m_memberList)->begin(),
(neighCand.m_memberList)->end(), OtherLayerTubes[0]);
neighCand.insertNewNode(GridStruct, DetGrid, &ThisTube, it);
visited[TubeID] = 1;
}
} // End IF ELSE IF same Layer size
} // End For List Active Tubes
for(size_t n = 0; n < ListActiveTubes.size(); ++n) {
if(visited[ListActiveTubes[n].first] == 1){
ListActiveTubes.erase(ListActiveTubes.begin() + n);
n--;
}
}
// Connecting to the tracklets under certain conditions (FIXME ALSO I'm extremely brutal)
for(size_t n = 0; n < ListActiveTubes.size(); ++n) {
std::vector<int> SameLayerTubes;
std::vector<int> OtherLayerTubes;
std::vector<int> TubesConnect;
std::vector<GridNode*> inQueue;
int TubeID = ListActiveTubes[n].first;
if(visited[TubeID])
continue;
GridNode &ThisTube = DetGrid[TubeID-1];
TubesConnect.push_back(TubeID);
visited[TubeID] = 3;
for(size_t m = 0; m < ThisTube.m_neighbors.size(); m++){
int NeighTubeID = ThisTube.m_neighbors[m];
GridNode &NeighTube = DetGrid[NeighTubeID-1];
if(NeighTube.m_type == GridNode::VIRTUAL_NODE)
continue;
if(!visited[NeighTubeID]){
TubesConnect.push_back(NeighTubeID);
inQueue.push_back(&NeighTube);
visited[NeighTubeID] = 3;
}
}
while(inQueue.size()>0){
GridNode *cur = inQueue.back();
inQueue.pop_back();
for(size_t m = 0; m < cur->m_neighbors.size(); m++){
int NeighTubeID = cur->m_neighbors[m];
GridNode &NeighTube = DetGrid[NeighTubeID-1];
if(NeighTube.m_type == GridNode::VIRTUAL_NODE)
continue;
if(!visited[NeighTubeID]){
TubesConnect.push_back(NeighTubeID);
inQueue.push_back(&NeighTube);
visited[NeighTubeID] = 3;
}/* else if(visited[NeighTubeID] == 1){
//info("Neigh %d is TubesConnect to PotTrackList %d",NeighTubeID, NeighTube.m_cm[0]);
}*/
}
}
if(TubesConnect.size() > 5){
sort( TubesConnect.begin(), TubesConnect.end() );
PathCandidate *cand = new PathCandidate();// Create a new tracklet candidate
cand->m_id = (candidateId)++;// tracklet id
int prevLayer = -1;
std::vector<int> virt;
for(size_t m = 0; m < TubesConnect.size(); m++){
int curId = TubesConnect[m];
GridNode *addNode = &DetGrid[curId-1];
if(virt.size() > 0 && addNode->m_Layer != prevLayer){
addNodesToCand (GridStruct, DetGrid, *cand, visited, virt);
}
visited[curId] = 1;
cand->insertNewNode(GridStruct, DetGrid, addNode, cand->m_memberList->end());
for(size_t p = 0; p < addNode->m_neighbors.size(); p++){
int NeighTubeID = addNode->m_neighbors[p];
GridNode &NeighTube = DetGrid[NeighTubeID-1];
if(NeighTube.m_type == GridNode::VIRTUAL_NODE)
virt.push_back(NeighTubeID);
}
prevLayer = addNode->m_Layer;
}
int firstId = cand->m_tailNode;
int lastId = cand->m_headNode;
GridNode &firstNode = DetGrid[firstId-1];
GridNode &lastNode = DetGrid[lastId-1];
if((firstNode.m_LayerLimit == 1 && lastNode.m_LayerLimit == 1)){
cand->m_finished = FINISHED;
} else {
cand->m_finished = ONGOING;
}
RecoTracks.push_back(cand);
}
/// FIX THIS PART (CODE still works well without it)
/*else {
info("we found %d nodes TubesConnect, not enough for a new cand, let's just connect to closest PotTrackList", TubesConnect.size());
for(size_t m = 0; m < TubesConnect.size(); m++){
info("node %d", TubesConnect[m]);
float mindist = 10000;
int goodcc = -1;
int goodNeigh = -1;
int curId = TubesConnect[m];
GridNode &addNode = DetGrid[gr.Find(curId)];
for(size_t p = 0; p < addNode.m_neighbors.size(); p++){
int NeighTubeID = addNode.m_neighbors[p];
GridNode &NeighTube = DetGrid[gr.Find(NeighTubeID)];
if(NeighTube.m_type == GridNode::VIRTUAL_NODE || visited[NeighTubeID] != 1)
continue;
double currDist = distanceBetweenTube(addNode, NeighTube);
if(currDist < mindist){
goodcc = NeighTube.m_cm[0];
goodNeigh = NeighTubeID;
mindist=currDist;
}
}
info("Best match is %d with PotTrackList %d", goodNeigh, goodcc);
const auto p = std::find_if(RecoTracks.begin(), RecoTracks.end(),
[goodcc](const PathCandidate *obj){ return obj->m_id==goodcc;});
PathCandidate &neighCand = *(*p); // The PotTrackList that the node belongs to
//Find where the node is in the list of the other PotTrackList
std::vector<int>::iterator it = std::find((neighCand.m_memberList)->begin(),
(neighCand.m_memberList)->end(), goodNeigh);
neighCand.insertNewNode(gr, DetGrid, &addNode, it);
visited[TubeID] = 1;
}
}
}*/
// SameLayerTubes.clear();
// OtherLayerTubes.clear();
// TubesConnect.clear();
}
dbgfit("Ended the connecttion of remaining nodes");
std::sort(RecoTracks.begin(), RecoTracks.end(), compareTwoPathsLength);
using nodeDist = std::pair<int, float>;
for(unsigned int l = 0; l < RecoTracks.size(); l++){
PathCandidate &curCand = *(RecoTracks[l]);
if(curCand.m_finished > 2) //!curCand.m_isValid ||
continue;
GridNode &firstNode = DetGrid[curCand.m_tailNode-1];
GridNode &lastNode = DetGrid[curCand.m_headNode-1];
dbgmerge("NEW Tracklet %d is unfinished, firstNode %d, lastNode %d",
curCand.m_id, firstNode.m_detID, lastNode.m_detID);
if(!(firstNode.m_LayerLimit == 1 || curCand.m_toMergeTail.size()> 0 || firstNode.m_neighbors.size() > 0)) {
dbgmerge("Let's look into tail direction, with the %lu tracklets found previously", RecoTracks.size());
std::vector<nodeDist> toCheck;
for(unsigned int n = 0; n < RecoTracks.size(); ++n) {
PathCandidate &testCand = *(RecoTracks[n]);
if (testCand.m_finished == 3 || n == l) continue;
GridNode checkNode;
if(labs((int) firstNode.m_detID - testCand.m_tailNode)
< labs((int) firstNode.m_detID - testCand.m_headNode)){
checkNode = DetGrid[testCand.m_tailNode-1];
}else{
checkNode = DetGrid[testCand.m_headNode-1];
}
if(labs((int) checkNode.m_Sector - firstNode.m_Sector) > 1)
continue;
dbgmerge("Testing with node %d from tracklet %d",checkNode.m_detID, testCand.m_id);
double currDist = sqrt(pow(firstNode.m_x- checkNode.m_x,2) +pow(firstNode.m_y- checkNode.m_y,2)) ;
dbgmerge("Distance %lf", currDist);
if(currDist < 6.){ // Empirical Criterion
toCheck.push_back(make_pair(checkNode.m_detID,currDist));
} else
dbgmerge("Too far, no possible merging");
}
dbgmerge("Checking now \n");
if(toCheck.size() > 0){
std::sort(toCheck.begin(), toCheck.end(), [](nodeDist const &a, nodeDist const &b) {
return a.second < b.second; });
for(size_t i = 0; i < MIN(toCheck.size(),5); i++){
GridNode &check = DetGrid[toCheck[i].first-1];
int TrackToMerge = check.m_cm[0];
const auto p = std::find_if(RecoTracks.begin(), RecoTracks.end(),
[TrackToMerge](const PathCandidate *obj){ return obj->m_id == TrackToMerge; } );
PathCandidate &testCand = *(*p); // The PotTrackList that the node belongs to
dbgmerge("Check PotTrackList %d", TrackToMerge);
int caseMerge = 0;
int offAnc = 0;
if(check.m_detID == testCand.m_tailNode && testCand.m_toMergeTail.size() == 0){
dbgmerge("Possibility in tail, testing angle");
offAnc = 0;
caseMerge = 0;
GridNode &prevAnc = curCand.m_anchors[1];
dbgmerge("PrevAncho %d, %f, %f", prevAnc.m_detID,prevAnc.m_xDet, prevAnc.m_yDet);
dbgmerge("Next neigh Anc %d, %f, %f", testCand.m_anchors[offAnc].m_detID,
testCand.m_anchors[offAnc].m_xDet, testCand.m_anchors[offAnc].m_yDet);
float angle_xy = returnAngle(prevAnc.m_xDet, firstNode.m_xDet, testCand.m_anchors[offAnc].m_xDet,
prevAnc.m_yDet, firstNode.m_yDet, testCand.m_anchors[offAnc].m_yDet);
dbgmerge("Angle xy with track %f", angle_xy);
//# dot product between [x1, y1] and [x2, y2]
float dot = (firstNode.m_xDet - prevAnc.m_xDet)*
(testCand.m_anchors[offAnc+1].m_xDet - testCand.m_anchors[offAnc].m_xDet) +
(firstNode.m_yDet - prevAnc.m_yDet)*
(testCand.m_anchors[offAnc+1].m_yDet - testCand.m_anchors[offAnc].m_yDet);
//x1*y2 - y1*x2 // # determinant
float det = (firstNode.m_xDet - prevAnc.m_xDet)*
(testCand.m_anchors[offAnc+1].m_yDet - testCand.m_anchors[offAnc].m_yDet) -
(firstNode.m_yDet - prevAnc.m_yDet)*
(testCand.m_anchors[offAnc+1].m_xDet - testCand.m_anchors[offAnc].m_xDet);
float angle = atan2(det, dot)* 180 / 3.14;
dbgmerge("Vector Angle xy with track %f", angle);
if(fabs(angle) < 70){
dbgmerge("We should merge %d and %d \n", curCand.m_id, testCand.m_id);
curCand.m_toMergeTail.push_back(TrackToMerge);
testCand.m_toMergeTail.push_back(curCand.m_id);
// TrackIDToMerge[curCand.m_id][TrackToMerge] = caseMerge;
curCand.m_finished = 2;
testCand.m_finished = 2;
break;
}
} else if(check.m_detID == testCand.m_headNode && testCand.m_toMergeHead.size() == 0){
dbgmerge("Possibility in head, testing angle");
offAnc = testCand.m_anchors.size()-1;
caseMerge = 1;
GridNode &prevAnc = curCand.m_anchors[1];
dbgmerge("PrevAncho %d, %f, %f", prevAnc.m_detID,prevAnc.m_xDet, prevAnc.m_yDet);
dbgmerge("Next neigh Anc %d, %f, %f", testCand.m_anchors[offAnc].m_detID,
testCand.m_anchors[offAnc].m_xDet, testCand.m_anchors[offAnc].m_yDet);
float angle_xy = returnAngle(prevAnc.m_xDet, firstNode.m_xDet, testCand.m_anchors[offAnc].m_xDet,
prevAnc.m_yDet, firstNode.m_yDet, testCand.m_anchors[offAnc].m_yDet);
dbgmerge("Angle xy with track %f", angle_xy);
float dot = (firstNode.m_xDet - prevAnc.m_xDet)*
(testCand.m_anchors[offAnc-1].m_xDet - testCand.m_anchors[offAnc].m_xDet) +
(firstNode.m_yDet - prevAnc.m_yDet)*
(testCand.m_anchors[offAnc-1].m_yDet - testCand.m_anchors[offAnc].m_yDet);
float det = (firstNode.m_xDet - prevAnc.m_xDet)*
(testCand.m_anchors[offAnc-1].m_yDet - testCand.m_anchors[offAnc].m_yDet) -
(firstNode.m_yDet - prevAnc.m_yDet)*
(testCand.m_anchors[offAnc-1].m_xDet - testCand.m_anchors[offAnc].m_xDet);
float angle = atan2(det, dot)* 180 / 3.14;
if(fabs(angle) < 70){
dbgmerge("We should merge %d and %d \n", curCand.m_id, testCand.m_id);
curCand.m_toMergeTail.push_back(TrackToMerge);
testCand.m_toMergeHead.push_back(curCand.m_id);
// TrackIDToMerge[curCand.m_id][TrackToMerge] = caseMerge;
curCand.m_finished = 2;
testCand.m_finished = 2;
break;
}
}
}
} else {
dbgmerge("No good candidate found");
}
}
if(!(lastNode.m_LayerLimit == 1 || curCand.m_toMergeHead.size()> 0 || lastNode.m_neighbors.size() > 0)) {
dbgmerge("Let's look into head direction, with the %lu RecoTracks we found previously", RecoTracks.size());
std::vector<nodeDist> toCheck;
for(unsigned int n = 0; n < RecoTracks.size(); ++n) {
PathCandidate &testCand = *(RecoTracks[n]);
if (testCand.m_finished == 3 || n == l) continue;
GridNode checkNode;
if(labs((int) lastNode.m_detID - testCand.m_tailNode) <
labs((int) lastNode.m_detID - testCand.m_headNode)){
checkNode = DetGrid[testCand.m_tailNode-1];
}else{
checkNode = DetGrid[testCand.m_headNode-1];
}
dbgmerge("Testing with node %d from tracklet %d",checkNode.m_detID, testCand.m_id);
double currDist = sqrt(pow(lastNode.m_x- checkNode.m_x,2) + pow(lastNode.m_y- checkNode.m_y,2));
if(labs((int) checkNode.m_Sector - lastNode.m_Sector) > 1 &&
labs((int) checkNode.m_Sector - lastNode.m_Sector) != 5 )
continue;
dbgmerge("Distance %lf", currDist);
if(currDist < (double) 6.)
toCheck.push_back(make_pair(checkNode.m_detID,currDist));
else
dbgmerge("Too far, no possible merging");
}
if(toCheck.size() > 0){
std::sort(toCheck.begin(), toCheck.end(), [](nodeDist const &a, nodeDist const &b) {
return a.second < b.second; });
for(size_t i = 0; i < MIN(toCheck.size(),5); i++){
GridNode &check = DetGrid[GridStruct.Find(toCheck[i].first)];
int TrackToMerge = check.m_cm[0];
const auto p = std::find_if(RecoTracks.begin(), RecoTracks.end(),
[TrackToMerge](const PathCandidate *obj){ return obj->m_id == TrackToMerge; } );
dbgmerge("Check PotTrackList %d", TrackToMerge);
PathCandidate &testCand = *(*p); // The PotTrackList that the node belongs to
int caseMerge = 0;
int offAnc = 0;
if(check.m_detID == testCand.m_tailNode && testCand.m_toMergeTail.size() == 0){
dbgmerge("Possibility in tail, testing angle");
offAnc = 0;
caseMerge = 2;
GridNode &prevAnc = curCand.m_anchors[curCand.m_anchors.size()-2];
dbgmerge("PrevAncho %d, %f, %f", prevAnc.m_detID,prevAnc.m_xDet, prevAnc.m_yDet);
dbgmerge("Next neigh Anc %d, %f, %f", testCand.m_anchors[offAnc].m_detID,
testCand.m_anchors[offAnc].m_xDet, testCand.m_anchors[offAnc].m_yDet);
float angle_xy = returnAngle(prevAnc.m_xDet, lastNode.m_xDet, testCand.m_anchors[offAnc].m_xDet,
prevAnc.m_yDet, lastNode.m_yDet, testCand.m_anchors[offAnc].m_yDet);
dbgmerge("Angle xy with track %f", angle_xy);
float dot = (lastNode.m_xDet - prevAnc.m_xDet)
*(testCand.m_anchors[offAnc+1].m_xDet - testCand.m_anchors[offAnc].m_xDet) +
(lastNode.m_yDet - prevAnc.m_yDet)*
(testCand.m_anchors[offAnc+1].m_yDet - testCand.m_anchors[offAnc].m_yDet);
float det = (lastNode.m_xDet - prevAnc.m_xDet)*
(testCand.m_anchors[offAnc+1].m_yDet - testCand.m_anchors[offAnc].m_yDet) -
(lastNode.m_yDet - prevAnc.m_yDet)*
(testCand.m_anchors[offAnc+1].m_xDet - testCand.m_anchors[offAnc].m_xDet);
float angle = atan2(det, dot)* 180 / 3.14;
dbgmerge("Vector Angle xy with track %f", angle);
if(fabs(angle) < 70){
dbgmerge("We should merge %d and %d \n", curCand.m_id, testCand.m_id);
curCand.m_toMergeHead.push_back(TrackToMerge);
testCand.m_toMergeTail.push_back(curCand.m_id);
//TrackIDToMerge[curCand.m_id][TrackToMerge] = caseMerge;
curCand.m_finished = 2;
testCand.m_finished = 2;
break;
}
} else if(check.m_detID == testCand.m_headNode && testCand.m_toMergeHead.size() == 0){
dbgmerge("Possibility in head, testing angle");
offAnc = testCand.m_anchors.size()-1;
caseMerge = 1;
GridNode &prevAnc = curCand.m_anchors[curCand.m_anchors.size()-2];
dbgmerge("PrevAncho %d, %f, %f", prevAnc.m_detID,prevAnc.m_xDet, prevAnc.m_yDet);
dbgmerge("Next neigh Anc %d, %f, %f", testCand.m_anchors[offAnc].m_detID,
testCand.m_anchors[offAnc].m_xDet, testCand.m_anchors[offAnc].m_yDet);
float angle_xy = returnAngle(prevAnc.m_xDet, lastNode.m_xDet, testCand.m_anchors[offAnc].m_xDet,
prevAnc.m_yDet, lastNode.m_yDet, testCand.m_anchors[offAnc].m_yDet);
dbgmerge("Angle xy with track %f", angle_xy);
float dot = (lastNode.m_xDet - prevAnc.m_xDet)*
(testCand.m_anchors[offAnc-1].m_xDet - testCand.m_anchors[offAnc].m_xDet) +
(lastNode.m_yDet - prevAnc.m_yDet)*
(testCand.m_anchors[offAnc-1].m_yDet - testCand.m_anchors[offAnc].m_yDet);
float det = (lastNode.m_xDet - prevAnc.m_xDet)*
(testCand.m_anchors[offAnc-1].m_yDet - testCand.m_anchors[offAnc].m_yDet) -
(lastNode.m_yDet - prevAnc.m_yDet)*
(testCand.m_anchors[offAnc-1].m_xDet - testCand.m_anchors[offAnc].m_xDet);
float angle = atan2(det, dot)* 180 / 3.14;
dbgmerge("Vector Angle xy with track %f", angle);
if(fabs(angle) < 70){
dbgmerge("We should merge %d and %d \n", curCand.m_id, testCand.m_id);
curCand.m_toMergeHead.push_back(TrackToMerge);
testCand.m_toMergeHead.push_back(curCand.m_id);
//TrackIDToMerge[curCand.m_id][TrackToMerge] = caseMerge;
curCand.m_finished = 2;
testCand.m_finished = 2;
break;
}
}
}
} else {
dbgmerge("No good candidate found");
}
}
}
#endif // IF FITTING TRUE
/* ++++++++++++++++++++++++++++++++++++++++++++++++++++ */
/* Third Reconstruction Phase: Merging */
/* ++++++++++++++++++++++++++++++++++++++++++++++++++++ */
#if(DO_MERGING)
info("Third phase: merging tracks");
for(unsigned int l = 0; l < RecoTracks.size(); l++){
PathCandidate &curCand = *(RecoTracks[l]);
curCand.m_isValid =false;
}
dbgmerge("Starting Merging phase\n");
mergeTracks (GridStruct, DetGrid, RecoTracks, &candidateId);
TimeNow = std::chrono::high_resolution_clock::now();
MergingTime = std::chrono::duration<double>(TimeNow - TimeEvt ).count() -
FittingTime - ConnectTime - FillingTime;
for(unsigned int l = 0; l < RecoTracks.size(); l++){
PathCandidate &curCand = *(RecoTracks[l]);
if(!curCand.m_isValid){
RecoTracks.erase(RecoTracks.begin() + l);
l--;
continue;
}
}
for(unsigned int l = 0; l < RecoTracks.size(); l++){
PathCandidate &curCand = *(RecoTracks[l]);
std::vector<int> curTrk( *(curCand.m_memberList));
std::sort(curTrk.begin(), curTrk.end());
std::vector<int>::iterator it;
it = remove_if(curTrk.begin(), curTrk.end(), bind2nd(greater<int>(), GridStruct.firstVirtIdx-1));
curTrk.erase(it,curTrk.end());
for(unsigned int m = l+1; m < RecoTracks.size(); m++){
PathCandidate &testCand = *(RecoTracks[m]);
std::vector<int> testTrk (*(testCand.m_memberList));
std::sort(testTrk.begin(), testTrk.end());
it = remove_if(testTrk.begin(), testTrk.end(), bind2nd(greater<int>(), GridStruct.firstVirtIdx-1));
testTrk.erase(it,testTrk.end());
std::vector<int> IntersectionList( (curTrk.size() + testTrk.size()), 0 );
std::vector<int>::iterator it2;
// std::vector<int> IntersectionList( (Cur_Comp_list.size() + MCSttComp.size()), 0 );
it2 = std::set_intersection(curTrk.begin(), curTrk.end(),
testTrk.begin(), testTrk.end(),
IntersectionList.begin());
IntersectionList.resize(it2 - IntersectionList.begin());
if((float) IntersectionList.size() > 0.66* MIN(curTrk.size(), testTrk.size())){
//error("Track %d and track %d, length %ld and %ld, intersection %ld", l,m,curTrk.size(), testTrk.size(), IntersectionList.size());
if(curTrk.size() < testTrk.size()){
RecoTracks.erase(RecoTracks.begin() + l);
l--;
break;