Process the event and put new data products into it.
31 {
32 auto start = std::chrono::high_resolution_clock::now();
33
35 clearProcessor();
36
37
39 ldmx::EcalGeometry::CONDITIONS_OBJECT_NAME);
40
41
43 ecal_collection_name_, ecal_pass_name_);
45 mip_collection_name_, mip_pass_name_);
46 std::vector<XYCoords> ele_trajectory, photon_trajectory,
47 ele_trajectory_at_target;
48 std::vector<ldmx::HitData> tracking_hit_list;
49 ldmx_log(trace) << "EcalMipTrackingProcessor::produce() called";
50 ele_trajectory = ecal_trajectory_info.getEleTrajectory();
51 photon_trajectory = ecal_trajectory_info.getPhotonTrajectory();
52 tracking_hit_list = ecal_trajectory_info.getTrackingHitList();
53 n_readout_hits_ = ecal_veto_result.getNReadoutHits();
54 nevents_++;
55
56
57
58
59
60
61
62
63
64
65 ROOT::Math::XYZVector e_traj_start;
66 ROOT::Math::XYZVector e_traj_end;
67 ROOT::Math::XYZVector p_traj_start;
68 ROOT::Math::XYZVector p_traj_end;
69 if (!ele_trajectory.empty() && !photon_trajectory.empty()) {
70
71
72 e_traj_start.SetXYZ(ele_trajectory[0].first, ele_trajectory[0].second,
74 e_traj_end.SetXYZ(ele_trajectory[(n_ecal_layers_ - 1)].first,
75 ele_trajectory[(n_ecal_layers_ - 1)].second,
77 p_traj_start.SetXYZ(photon_trajectory[0].first, photon_trajectory[0].second,
79 p_traj_end.SetXYZ(photon_trajectory[(n_ecal_layers_ - 1)].first,
80 photon_trajectory[(n_ecal_layers_ - 1)].second,
82 } else {
83
84
86 e_traj_end = ROOT::Math::XYZVector(
88 p_traj_start =
90 p_traj_end = ROOT::Math::XYZVector(
92 }
93
94
95
96
98
99
100 ldmx_log(trace) << "Finding first near photon layer_";
101 if (!photon_trajectory.empty()) {
102 for (std::vector<ldmx::HitData>::iterator it = tracking_hit_list.begin();
103 it != tracking_hit_list.end(); ++it) {
104 float eh_dist =
105 sqrt(pow((*it).pos_.X() - photon_trajectory[(*it).layer_].first, 2) +
106 pow((*it).pos_.Y() - photon_trajectory[(*it).layer_].second, 2));
107
108 if (eh_dist < 8.7) {
112 }
113 }
114 }
116 }
117
118
119 ROOT::Math::XYZVector g_toe = (e_traj_start - p_traj_start).Unit();
120
121 ROOT::Math::XYZVector origin = p_traj_start + 0.5 * 8.7 * g_toe;
122 ldmx_log(trace) << "Origin of photon territory: " << origin.X() << ", "
123 << origin.Y() << ", " << origin.Z();
124 if (!ele_trajectory.empty()) {
125 for (auto &hit_data : tracking_hit_list) {
126 ROOT::Math::XYZVector hit_pos = hit_data.pos_;
127 ROOT::Math::XYZVector hit_prime = hit_pos - origin;
128 if (hit_prime.Dot(g_toe) <= 0) {
130 }
131 }
133 } else {
135 }
136
137
138
139
140 std::sort(
141 tracking_hit_list.begin(), tracking_hit_list.end(),
143
144
145
146
147 std::vector<std::vector<ldmx::HitData>> track_list;
148
149
150
151 ldmx_log(trace) << "====== Tracking hit list (original) length "
152 << tracking_hit_list.size() << " ======";
153 for (int i = 0; i < tracking_hit_list.size(); i++) {
154 ldmx_log(trace) << "[" << tracking_hit_list[i].pos_.X() << ", "
155 << tracking_hit_list[i].pos_.Y() << ", "
156 << tracking_hit_list[i].layer_ << "], ";
157 }
158 ldmx_log(trace) << "====== END OF Tracking hit list ======";
159
160
161
163 for (int i_hit = 0; i_hit < tracking_hit_list.size(); i_hit++) {
164
165 int track[34];
166 int current_hit{i_hit};
167 int track_len{1};
168
169 track[0] = i_hit;
170
171
172
173
174
175 int j_hit = i_hit;
176 while (j_hit < tracking_hit_list.size()) {
177 if ((tracking_hit_list[j_hit].layer_ ==
178 tracking_hit_list[current_hit].layer_ - 1 ||
179 tracking_hit_list[j_hit].layer_ ==
180 tracking_hit_list[current_hit].layer_ - 2) &&
181 std::abs(tracking_hit_list[j_hit].pos_.X() -
182 tracking_hit_list[current_hit].pos_.X()) <=
183 0.5 * cell_width &&
184 std::abs(tracking_hit_list[j_hit].pos_.Y() -
185 tracking_hit_list[current_hit].pos_.Y()) <=
186 0.5 * cell_width) {
187 track[track_len] = j_hit;
188 track_len++;
189 current_hit = j_hit;
190 }
191 j_hit++;
192 }
193
194
195 if (track_len < 2) continue;
197 tracking_hit_list[track[0]].pos_,
198 tracking_hit_list[track[track_len - 1]].pos_, e_traj_start, e_traj_end);
200 tracking_hit_list[track[0]].pos_,
201 tracking_hit_list[track[track_len - 1]].pos_, p_traj_start, p_traj_end);
202
203
204 if (closest_p > cell_width and closest_e < 2 * cell_width) continue;
205 if (track_len < 4 and closest_e > closest_p) continue;
206
207 ldmx_log(debug) << "====== After rejection for MIP tracking ======";
208 ldmx_log(debug) << "current hit: [" << tracking_hit_list[i_hit].pos_.X()
209 << ", " << tracking_hit_list[i_hit].pos_.Y() << ", "
210 << tracking_hit_list[i_hit].layer_ << "]";
211
212 for (int k = 0; k < track_len; k++) {
213 ldmx_log(debug) << "track[" << k << "] position = ["
214 << tracking_hit_list[track[k]].pos_.X() << ", "
215 << tracking_hit_list[track[k]].pos_.Y() << ", "
216 << tracking_hit_list[track[k]].layer_ << "]";
217 }
218
219
220
221 if (track_len >= 2) {
222 std::vector<ldmx::HitData> temp_track_list;
223 int n_remove = 0;
224 for (int k_hit = 0; k_hit < track_len; k_hit++) {
225 temp_track_list.push_back(tracking_hit_list[track[k_hit] - n_remove]);
226 tracking_hit_list.erase(tracking_hit_list.begin() + track[k_hit] -
227 n_remove);
228 n_remove++;
229 }
230
231
232 ldmx_log(trace) << "====== Tracking hit list (after erase) length "
233 << tracking_hit_list.size() << " ======";
234 for (int i = 0; i < tracking_hit_list.size(); i++) {
235 ldmx_log(trace) << "[" << tracking_hit_list[i].pos_.X() << ", "
236 << tracking_hit_list[i].pos_.Y() << ", "
237 << tracking_hit_list[i].layer_ << "] ";
238 }
239 ldmx_log(trace) << "====== END OF Tracking hit list ======";
240
241 track_list.push_back(temp_track_list);
242
243
244
245 i_hit--;
246 }
247 }
248
249 ldmx_log(debug) << "Straight tracks found (before merge): "
250 << track_list.size();
251
252 for (int i_track = 0; i_track < track_list.size(); i_track++) {
253 ldmx_log(trace) << "Track " << i_track << ":";
254 for (int i_hit = 0; i_hit < track_list[i_track].size(); i_hit++) {
255 ldmx_log(trace) << " Hit " << i_hit << ": ["
256 << track_list[i_track][i_hit].pos_.X() << ", "
257 << track_list[i_track][i_hit].pos_.Y() << ", "
258 << track_list[i_track][i_hit].layer_ << "]" << std::endl;
259 }
260 }
261
262
263
264
265 ldmx_log(debug) << "Beginning track merging using " << track_list.size()
266 << " tracks";
267
268 for (int track_i = 0; track_i < track_list.size(); track_i++) {
269
270
271 std::vector<ldmx::HitData> base_track = track_list[track_i];
273 base_track.back();
274 ldmx_log(trace) << " Considering track " << track_i;
275 for (int track_j = track_i + 1; track_j < track_list.size(); track_j++) {
276 std::vector<ldmx::HitData> checking_track = track_list[track_j];
278
279 if ((head_hitdata.layer_ == tail_hitdata.layer_ + 1 ||
280 head_hitdata.layer_ == tail_hitdata.layer_ + 2) &&
281 pow(pow(head_hitdata.pos_.X() - tail_hitdata.pos_.X(), 2) +
282 pow(head_hitdata.pos_.Y() - tail_hitdata.pos_.Y(), 2),
283 0.5) <= cell_width) {
284
285
286
287 ldmx_log(trace) << " ** Compatible track found at index_ "
288 << track_j;
289 ldmx_log(trace) << " Tail xylayer: " << head_hitdata.pos_.X() << ","
290 << head_hitdata.pos_.Y() << "," << head_hitdata.layer_;
291 ldmx_log(trace) << " Head xylayer: " << tail_hitdata.pos_.X() << ","
292 << tail_hitdata.pos_.Y() << "," << tail_hitdata.layer_;
293 for (int hit_k = 0; hit_k < checking_track.size(); hit_k++) {
294 base_track.push_back(track_list[track_j][hit_k]);
295 }
296 track_list[track_i] = base_track;
297 track_list.erase(track_list.begin() + track_j);
298 break;
299 }
300 }
301 }
303
304 ldmx_log(debug) << "Straight tracks found (after merge): "
306 for (int track_i = 0; track_i < track_list.size(); track_i++) {
307 ldmx_log(debug) << "Track " << track_i << ":";
308 for (int hit_i = 0; hit_i < track_list[track_i].size(); hit_i++) {
309 ldmx_log(debug) << " Hit " << hit_i << ": ["
310 << track_list[track_i][hit_i].pos_.X() << ", "
311 << track_list[track_i][hit_i].pos_.Y() << ", "
312 << track_list[track_i][hit_i].layer_ << "]";
313 }
314 }
315
316 auto straight_tracks = std::chrono::high_resolution_clock::now();
317 profiling_map_["straight_tracks"] +=
318 std::chrono::duration<double, std::milli>(straight_tracks - start)
319 .count();
320
321
322 ldmx_log(info) << "Finding linreg tracks from a total of "
323 << tracking_hit_list.size() << " hits using a radius of "
324 << linreg_radius_ << " mm";
325
326 for (int i_hit = 0; i_hit < 0; i_hit++) {
327
328
329 std::vector<int> hits_in_region;
330 TMatrixD vm(3, 3);
331 TMatrixD hdt(3, 3);
332 ROOT::Math::XYZVector slope_vec;
333 ROOT::Math::XYZVector h_mean;
334 ROOT::Math::XYZVector h_point;
335 float r_corr_best{0.0};
336
337 int hit_nums[3];
338
339 int best_hit_nums[3];
340
341 hits_in_region.push_back(i_hit);
342
343 for (int j_hit = 0; j_hit < tracking_hit_list.size(); j_hit++) {
344
345 if (tracking_hit_list[i_hit].pos_.Z() ==
346 tracking_hit_list[j_hit].pos_.Z()) {
347 continue;
348 }
349 float dist_to_hit =
350 (tracking_hit_list[i_hit].pos_ - tracking_hit_list[j_hit].pos_).R();
351
352
353
354 if (dist_to_hit <= 2 * linreg_radius_) {
355 hits_in_region.push_back(j_hit);
356 }
357 }
358
359 bool best_lin_reg_found{false};
360
361 ldmx_log(debug) << "There are " << hits_in_region.size()
362 << " hits within a radius of " << linreg_radius_ << " mm";
363
364
365 hit_nums[0] = i_hit;
366 for (int j_hit_in_reg = 1; j_hit_in_reg < hits_in_region.size() - 1;
367 j_hit_in_reg++) {
368
369 if (hits_in_region.size() < 3) break;
370 hit_nums[1] = hits_in_region[j_hit_in_reg];
371 for (int k_hit_reg = j_hit_in_reg + 1; k_hit_reg < hits_in_region.size();
372 k_hit_reg++) {
373 hit_nums[2] = hits_in_region[k_hit_reg];
374 const auto &p0 = tracking_hit_list[hit_nums[0]].pos_;
375 const auto &p1 = tracking_hit_list[hit_nums[1]].pos_;
376 const auto &p2 = tracking_hit_list[hit_nums[2]].pos_;
377
378 h_mean = (p0 + p1 + p2) / 3.0;
379
380 double p_arr[3][3] = {{p0.X(), p0.Y(), p0.Z()},
381 {p1.X(), p1.Y(), p1.Z()},
382 {p2.X(), p2.Y(), p2.Z()}};
383
384
385 double mean_arr[3] = {(p0.X() + p1.X() + p2.X()) / 3.0,
386 (p0.Y() + p1.Y() + p2.Y()) / 3.0,
387 (p0.Z() + p1.Z() + p2.Z()) / 3.0};
388
389 for (int h_ind = 0; h_ind < 3; ++h_ind) {
390 for (int l_ind = 0; l_ind < 3; ++l_ind) {
391 hdt(h_ind, l_ind) = p_arr[h_ind][l_ind] - mean_arr[l_ind];
392 }
393 }
394
395
396
397 double determinant =
398 hdt(0, 0) * (hdt(1, 1) * hdt(2, 2) - hdt(1, 2) * hdt(2, 1)) -
399 hdt(0, 1) * (hdt(1, 0) * hdt(2, 2) - hdt(1, 2) * hdt(2, 0)) +
400 hdt(0, 2) * (hdt(1, 0) * hdt(2, 1) - hdt(1, 1) * hdt(2, 0));
401
402 if (determinant == 0) continue;
403
404 TDecompSVD svd_obj(hdt);
405 bool decomposed = svd_obj.Decompose();
406 if (!decomposed) continue;
407
408
409 vm = svd_obj.GetV();
410 slope_vec.SetX(vm[0][0]);
411 slope_vec.SetY(vm[0][1]);
412 slope_vec.SetZ(vm[0][2]);
413
414 h_point = slope_vec + h_mean;
415
416
417
418 float closest_e =
420 float closest_p =
422
423
424 if (closest_p > cell_width or closest_e < 1.5 * cell_width) continue;
425
426
427 float vrnc = (tracking_hit_list[hit_nums[0]].pos_ - h_mean).R() +
428 (tracking_hit_list[hit_nums[1]].pos_ - h_mean).R() +
429 (tracking_hit_list[hit_nums[2]].pos_ - h_mean).R();
430
432 h_mean, h_point) +
434 h_mean, h_point) +
436 h_mean, h_point);
437 float r_corr = 1 - sumerr / vrnc;
438
439
440
441 if (r_corr > r_corr_best and r_corr > .6) {
442 r_corr_best = r_corr;
443
444 best_lin_reg_found = true;
445 for (int k = 0; k < 3; k++) {
446 best_hit_nums[k] = hit_nums[k];
447 }
448 }
449 }
450 }
451
452
453 if (!best_lin_reg_found) continue;
454
457 for (int final_hit_index = 0; final_hit_index < 3; final_hit_index++) {
458 ldmx_log(debug)
459 << " Hit " << final_hit_index << " ["
460 << tracking_hit_list[best_hit_nums[final_hit_index]].pos_.X() << ", "
461 << tracking_hit_list[best_hit_nums[final_hit_index]].pos_.Y() << ", "
462 << tracking_hit_list[best_hit_nums[final_hit_index]].pos_.Z() << "] ";
463 }
464
465
466 for (int l_hit = 0; l_hit < 3; l_hit++) {
467 tracking_hit_list.erase(tracking_hit_list.begin() + best_hit_nums[l_hit]);
468 }
469 i_hit--;
470 }
473 << " lin-reg tracks";
474
475 auto linreg_tracks = std::chrono::high_resolution_clock::now();
476 profiling_map_["linreg_tracks"] +=
477 std::chrono::duration<double, std::milli>(linreg_tracks - straight_tracks)
478 .count();
479
483
484 event.add(mip_result_name_, mip_result);
485
486 auto end = std::chrono::high_resolution_clock::now();
487 auto time_diff = end - start;
488 processing_time_ +=
489 std::chrono::duration<double, std::milli>(time_diff).count();
490}
float distPtToLine(ROOT::Math::XYZVector h1, ROOT::Math::XYZVector p1, ROOT::Math::XYZVector p2)
Return the minimum distance between the point h1 and the line passing through points p1 and p2.
float distTwoLines(ROOT::Math::XYZVector v1, ROOT::Math::XYZVector v2, ROOT::Math::XYZVector w1, ROOT::Math::XYZVector w2)
Returns the distance between the lines v and w, with v defined to pass through the points (v1,...
const ldmx::EcalGeometry * geometry_
handle to current geometry (to share with member functions)
const T & getCondition(const std::string &condition_name)
Access a conditions object for the current event.
double getZPosition(int layer) const
Get the z-coordinate given the layer id.
double getCellMaxR() const
Get the center-to-corner radius of the cell hexagons.