SeedFinderProcessor.cxx

#include "Tracking/Reco/SeedFinderProcessor.h"
 
#include "Acts/Definitions/TrackParametrization.hpp"
#include "Acts/Seeding/EstimateTrackParamsFromSeed.hpp"
#include "Eigen/Dense"
#include "Tracking/Sim/TrackingUtils.h"
 
/* This processor takes in input a set of 3D space points and builds seedTracks
 * using the ACTS algorithm which is based on the ATLAS 3-space point conformal
 * fit.
 *
 */
 
using Eigen::MatrixXd;
using Eigen::VectorXd;
 
namespace tracking {
namespace reco {
 
SeedFinderProcessor::SeedFinderProcessor(const std::string& name,
                                         framework::Process& process)
    : TrackingGeometryUser(name, process) {
  // TODO REMOVE FROM DEFAULT
  /*
  outputFile_ = new TFile("seeder.root", "RECREATE");
  outputTree_ = new TTree("seeder", "seeder");
 
  outputTree_->Branch("nevents", &nevents_);
  outputTree_->Branch("xhit", &xhit_);
  outputTree_->Branch("yhit", &yhit_);
  outputTree_->Branch("zhit", &zhit_);
 
  outputTree_->Branch("b0", &b0_);
  outputTree_->Branch("b1", &b1_);
  outputTree_->Branch("b2", &b2_);
  outputTree_->Branch("b3", &b3_);
  outputTree_->Branch("b4", &b4_);
  */
}
 
SeedFinderProcessor::~SeedFinderProcessor() {}
 
void SeedFinderProcessor::onProcessStart() {
  truthMatchingTool_ = std::make_shared<tracking::sim::TruthMatchingTool>();
}
 
void SeedFinderProcessor::configure(framework::config::Parameters& parameters) {
  // Output seed name
  out_seed_collection_ = parameters.getParameter<std::string>(
      "out_seed_collection", getName() + "SeedTracks");
 
  // Input strip hits
  input_hits_collection_ = parameters.getParameter<std::string>(
      "input_hits_collection", "TaggerSimHits");
 
  // Tagger tracks - only for Recoil Seed finding
  tagger_trks_collection_ = parameters.getParameter<std::string>(
      "tagger_trks_collection", "TaggerTracks");
 
  perigee_location_ = parameters.getParameter<std::vector<double>>(
      "perigee_location", {-700, 0., 0.});
  pmin_ =
      parameters.getParameter<double>("pmin", 0.05 * Acts::UnitConstants::GeV);
  pmax_ = parameters.getParameter<double>("pmax", 8 * Acts::UnitConstants::GeV);
  d0max_ =
      parameters.getParameter<double>("d0max", -15. * Acts::UnitConstants::mm);
  d0min_ =
      parameters.getParameter<double>("d0min", -45. * Acts::UnitConstants::mm);
  z0max_ =
      parameters.getParameter<double>("z0max", 60. * Acts::UnitConstants::mm);
 
  phicut_ = parameters.getParameter<double>("phicut", 0.1);
  thetacut_ = parameters.getParameter<double>("thetacut", 0.2);
 
  loc0cut_ = parameters.getParameter<double>("loc0cut", 0.1);
  loc1cut_ = parameters.getParameter<double>("loc1cut", 0.3);
 
  strategies_ = parameters.getParameter<std::vector<std::string>>(
      "strategies", {"0,1,2,3,4"});
 
  inflate_factors_ = parameters.getParameter<std::vector<double>>(
      "inflate_factors", {10., 10., 10., 10., 10., 10.});
 
  bfield_ = parameters.getParameter<double>("bfield", 1.5);
}
 
void SeedFinderProcessor::produce(framework::Event& event) {
  // tg is unused, should it be? FIXME
  // const auto& tg{geometry()};
  auto start = std::chrono::high_resolution_clock::now();
  ldmx::Tracks seed_tracks;
 
  nevents_++;
 
  // check if SimParticleMap is available for truth matching
  std::map<int, ldmx::SimParticle> particleMap;
 
  const std::vector<ldmx::Measurement> measurements =
      event.getCollection<ldmx::Measurement>(input_hits_collection_);
 
  std::vector<ldmx::Track> tagger_tracks;
  if (event.exists(tagger_trks_collection_)) {
    tagger_tracks = event.getCollection<ldmx::Track>(tagger_trks_collection_);
  }
 
  // Create an unbound surface at the target
  std::shared_ptr<Acts::Surface> tgt_surf =
      tracking::sim::utils::unboundSurface(0.);
 
  // Create the pseudomeasurements at the target
 
  ldmx::Measurements target_pseudo_meas;
 
  for (auto tagtrk : tagger_tracks) {
    auto ts = tagtrk.getTrackState(ldmx::TrackStateType::AtTarget);
 
    // The covariance matrix passed to the pseudo measurement is considered as
    // uncorrelated. This is an approx that considers that loc-u and loc-v from
    // the track have small correlation.
 
    if (ts.has_value()) {
      auto trackState = ts.value();
 
      Acts::BoundSquareMatrix cov =
          tracking::sim::utils::unpackCov(trackState.cov);
      double locu = trackState.params[0];
      double locv = trackState.params[1];
      double covuu =
          cov(Acts::BoundIndices::eBoundLoc0, Acts::BoundIndices::eBoundLoc0);
      double covvv =
          cov(Acts::BoundIndices::eBoundLoc1, Acts::BoundIndices::eBoundLoc1);
 
      ldmx::Measurement pseudo_meas;
      pseudo_meas.setLocalPosition(locu, locv);
      Acts::Vector3 dummy{0., 0., 0.};
      Acts::Vector2 local_pos{locu, locv};
      Acts::Vector3 global_pos =
          tgt_surf->localToGlobal(geometry_context(), local_pos, dummy);
 
      pseudo_meas.setGlobalPosition(global_pos(0), global_pos(1),
                                    global_pos(2));
      pseudo_meas.setTime(0.);
      pseudo_meas.setLocalCovariance(covuu, covvv);
 
      target_pseudo_meas.push_back(pseudo_meas);
    }
  }
 
  if (event.exists("SimParticles")) {
    particleMap = event.getMap<int, ldmx::SimParticle>("SimParticles");
    truthMatchingTool_->setup(particleMap, measurements);
  }
 
  ldmx_log(debug) << "Preparing the strategies";
 
  groups_map.clear();
  //  set the seeding strategy
  //  strategy is a list of layers from which to  make the seed
  //  this must include 5 layers; layer numbering starts at 0.
  //  std::vector<int> strategy = {9,10,11,12,13};
  std::vector<int> strategy = {0, 1, 2, 3, 4};
  bool success = GroupStrips(measurements, strategy);
  if (success) FindSeedsFromMap(seed_tracks, target_pseudo_meas);
 
  //  currently, we only use a single strategy but eventually
  //  we will use more.  Below is an example of how to add them
  /*
  groups_map.clear();
  strategy = {9,10,11,12,13};
  success = GroupStrips(measurements,strategy);
  if (success)
    FindSeedsFromMap(seed_tracks, target_pseudo_meas);
  */
 
  groups_map.clear();
  // outputTree_->Fill();
  ntracks_ += seed_tracks.size();
  event.add(out_seed_collection_, seed_tracks);
 
  auto end = std::chrono::high_resolution_clock::now();
 
  // long long microseconds =
  // std::chrono::duration_cast<std::chrono::microseconds>(end-start).count();
 
  auto diff = end - start;
  processing_time_ += std::chrono::duration<double, std::milli>(diff).count();
 
  // Seed finding using 2D Hits
  //  - The hits should keep track if they are already associated to a track or
  //  not. This can be used for subsequent passes of seed-finding
 
  // This should go into a digitization producer, which takes care of producing
  // measurements from:
  //  - raw hits in data
  //  - sim hits in MC
  // Step 0: Get the sim hits and project them on the surfaces to mimic 2d hits
  // Step 1: Smear the hits and associate an uncertainty to those measurements.
 
  xhit_.clear();
  yhit_.clear();
  zhit_.clear();
 
  b0_.clear();
  b1_.clear();
  b2_.clear();
  b3_.clear();
  b4_.clear();
 
}  // produce
 
// Seed finder from Robert's in HPS
// https://github.com/JeffersonLab/hps-java/blob/47712878302eb0c0374d077a208a6f8f0e2c3dc6/tracking/src/main/java/org/hps/recon/tracking/kalman/SeedTrack.java
// Adapted to possible 3D hit points.
 
// yOrigin is the location along the beam about which we fit the seed helix
// perigee_location is where the track parameters will be extracted
 
// while this takes in a target measurement (from tagger, this is pmeas_tgt)
// this code doesn't do anything with it yet.
 
ldmx::Track SeedFinderProcessor::SeedTracker(
    const ldmx::Measurements& vmeas, double xOrigin,
    const Acts::Vector3& perigee_location,
    const ldmx::Measurements& pmeas_tgt) {
  // Fit a straight line in the non-bending plane and a parabola in the bending
  // plane
 
  // Each measurement is treated as a 3D point, where the v direction is in the
  // center of the strip with sigma equal to the length of the strip / sqrt(12).
  // In this way it's easier to incorporate the tagger track extrapolation to
  // the fit
 
  Acts::ActsMatrix<5, 5> A = Acts::ActsMatrix<5, 5>::Zero();
  Acts::ActsVector<5> Y = Acts::ActsVector<5>::Zero();
 
  for (auto meas : vmeas) {
    double xmeas = meas.getGlobalPosition()[0] - xOrigin;
 
    // Get the surface
    const Acts::Surface* hit_surface = geometry().getSurface(meas.getLayerID());
 
    // Get the global to local transformation
    auto rot = hit_surface->transform(geometry_context()).rotation();
    auto tr = hit_surface->transform(geometry_context()).translation();
 
    auto rotl2g = rot.transpose();
 
    // Only for saving purposes
    Acts::Vector2 loc{meas.getLocalPosition()[0], 0.};
 
    xhit_.push_back(xmeas);
    yhit_.push_back(meas.getGlobalPosition()[1]);
    zhit_.push_back(meas.getGlobalPosition()[2]);
 
    Acts::ActsMatrix<2, 5> A_i;
 
    A_i(0, 0) = rotl2g(0, 1);
    A_i(0, 1) = rotl2g(0, 1) * xmeas;
    A_i(0, 2) = rotl2g(0, 1) * xmeas * xmeas;
    A_i(0, 3) = rotl2g(0, 2);
    A_i(0, 4) = rotl2g(0, 2) * xmeas;
 
    A_i(1, 0) = rotl2g(1, 1);
    A_i(1, 1) = rotl2g(1, 1) * xmeas;
    A_i(1, 2) = rotl2g(1, 1) * xmeas * xmeas;
    A_i(1, 3) = rotl2g(1, 2);
    A_i(1, 4) = rotl2g(1, 2) * xmeas;
 
    // Fill the yprime vector
    Acts::Vector2 offset = (rot.transpose() * tr).topRows<2>();
    Acts::Vector2 xoffset = {rotl2g(0, 0) * xmeas, rotl2g(1, 0) * xmeas};
 
    loc(0) = meas.getLocalPosition()[0];
    loc(1) = 0.;
    double uError = sqrt(vmeas[0].getLocalCovariance()[0]);
 
    // TODO Fix vError for measurements
    double vError = 40. / sqrt(12);
 
    Acts::ActsMatrix<2, 2> W_i =
        Acts::ActsMatrix<2, 2>::Zero();  // weight matrix
 
    W_i(0, 0) = 1. / (uError * uError);
    W_i(1, 1) = 1. / (vError * vError);
 
    Acts::Vector2 Yprime_i = loc + offset - xoffset;
    Y += (A_i.transpose()) * W_i * Yprime_i;
 
    Acts::ActsMatrix<2, 5> WA_i = (W_i * A_i);
    A += A_i.transpose() * WA_i;
  }
 
  Acts::ActsVector<5> B;
  B = A.inverse() * Y;
 
  b0_.push_back(B(0));
  b1_.push_back(B(1));
  b2_.push_back(B(2));
  b3_.push_back(B(3));
  b4_.push_back(B(4));
 
  // Acts::ActsVector<5> hlx = Acts::ActsVector<5>::Zero();
  Acts::ActsVector<3> ref{0., 0., 0.};
 
  double relativePerigeeX = perigee_location(0) - xOrigin;
 
  std::shared_ptr<const Acts::PerigeeSurface> seed_perigee =
      Acts::Surface::makeShared<Acts::PerigeeSurface>(Acts::Vector3(
          relativePerigeeX, perigee_location(1), perigee_location(2)));
 
  // in mm
  Acts::Vector3 seed_pos{relativePerigeeX,
                         B(0) + B(1) * relativePerigeeX +
                             B(2) * relativePerigeeX * relativePerigeeX,
                         B(3) + B(4) * relativePerigeeX};
  Acts::Vector3 dir{1, B(1) + 2 * B(2) * relativePerigeeX, B(4)};
  dir /= dir.norm();
 
  // Momentum at xmeas
  double p =
      0.3 * bfield_ * (1. / (2. * abs(B(2)))) * 0.001;  // R in meters, p in GeV
  // std::cout<<"Momentum "<< p*dir << std::endl;
 
  // Convert it to MeV since that's what TrackUtils assumes
  Acts::Vector3 seed_mom = p * dir / Acts::UnitConstants::MeV;
  Acts::ActsScalar q =
      B(2) < 0 ? -1 * Acts::UnitConstants::e : +1 * Acts::UnitConstants::e;
 
  // Linear intersection with the perigee line. TODO:: Use propagator instead
  // Project the position on the surface.
  // This is mainly necessary for the perigee surface, where
  // the mean might not fulfill the perigee condition.
 
  // mg  Aug 2024 .. interect has changed, but just remove boundary check
  //  and change intersection to intersections
  //   auto intersection =
  //     (*seed_perigee).intersect(geometry_context(), seed_pos, dir, false);
 
  // Acts::FreeVector seed_free = tracking::sim::utils::toFreeParameters(
  //     intersection.intersection.position, seed_mom, q);
 
  auto intersection =
      (*seed_perigee).intersect(geometry_context(), seed_pos, dir);
 
  Acts::FreeVector seed_free = tracking::sim::utils::toFreeParameters(
      intersection.intersections()[0].position(), seed_mom, q);
 
  auto bound_params = Acts::transformFreeToBoundParameters(
                          seed_free, *seed_perigee, geometry_context())
                          .value();
 
  ldmx_log(debug) << "bound parameters at perigee location" << std::endl
                  << bound_params;
 
  Acts::BoundVector stddev;
  // sigma set to 75% of momentum
  double sigma_p = 0.75 * p * Acts::UnitConstants::GeV;
  stddev[Acts::eBoundLoc0] =
      inflate_factors_[Acts::eBoundLoc0] * 2 * Acts::UnitConstants::mm;
  stddev[Acts::eBoundLoc1] =
      inflate_factors_[Acts::eBoundLoc1] * 5 * Acts::UnitConstants::mm;
  stddev[Acts::eBoundPhi] =
      inflate_factors_[Acts::eBoundPhi] * 5 * Acts::UnitConstants::degree;
  stddev[Acts::eBoundTheta] =
      inflate_factors_[Acts::eBoundTheta] * 5 * Acts::UnitConstants::degree;
  stddev[Acts::eBoundQOverP] =
      inflate_factors_[Acts::eBoundQOverP] * (1. / p) * (1. / p) * sigma_p;
  stddev[Acts::eBoundTime] =
      inflate_factors_[Acts::eBoundTime] * 1000 * Acts::UnitConstants::ns;
 
  ldmx_log(debug)
      << "Making covariance matrix as diagonal matrix with inflated terms";
  Acts::BoundSquareMatrix bound_cov = stddev.cwiseProduct(stddev).asDiagonal();
 
  ldmx_log(debug) << "...now putting together the seed track ...";
 
  ldmx::Track trk = ldmx::Track();
  trk.setPerigeeLocation(perigee_location(0), perigee_location(1),
                         perigee_location(2));
  trk.setChi2(0.);
  trk.setNhits(5);
  trk.setNdf(0);
  trk.setNsharedHits(0);
  std::vector<double> v_seed_params(
      (bound_params).data(),
      bound_params.data() + bound_params.rows() * bound_params.cols());
  std::vector<double> v_seed_cov;
  tracking::sim::utils::flatCov(bound_cov, v_seed_cov);
  trk.setPerigeeParameters(v_seed_params);
  trk.setPerigeeCov(v_seed_cov);
 
  // Store the global position and momentum at the perigee
  // TODO:: The eFreePos0 is wrong due to the linear intersection.
  // YZ are ~ correct
  trk.setPosition(seed_free[Acts::eFreePos0], seed_free[Acts::eFreePos1],
                  seed_free[Acts::eFreePos2]);
  trk.setMomentum(seed_free[Acts::eFreeDir0], seed_free[Acts::eFreeDir1],
                  seed_free[Acts::eFreeDir2]);
 
  ldmx_log(debug)
      << "...making the ParticleHypothesis ...assume electron for now";
  auto partHypo{Acts::SinglyChargedParticleHypothesis::electron()};
 
  ldmx_log(debug) << "Making BoundTrackParameters seedParameters";
  Acts::BoundTrackParameters seedParameters(
      seed_perigee, std::move(bound_params), bound_cov, partHypo);
 
  ldmx_log(debug) << "Returning seed track";
  return trk;
}
 
void SeedFinderProcessor::onProcessEnd() {
  // outputFile_->cd();
  // outputTree_->Write();
  // outputFile_->Close();
  ldmx_log(info) << "AVG Time/Event: " << std::fixed << std::setprecision(1)
                 << processing_time_ / nevents_ << " ms";
  ldmx_log(info) << "Total Seeds/Events: " << ntracks_ << "/" << nevents_;
  ldmx_log(info) << "Seeds discarded due to multiple hits on layers "
                 << ndoubles_;
  ldmx_log(info) << "not enough seed points " << nmissing_;
  ldmx_log(info) << " nfailpmin=" << nfailpmin_;
  ldmx_log(info) << "   nfailpmax=" << nfailpmax_;
  ldmx_log(info) << "   nfaild0max=" << nfaild0max_;
  ldmx_log(info) << "   nfaild0min=" << nfaild0min_;
  ldmx_log(info) << "   nfailphicut=" << nfailphi_;
  ldmx_log(info) << "   nfailthetacut=" << nfailtheta_;
  ldmx_log(info) << "   nfailz0max=" << nfailz0max_;
}
 
// Given a strategy, group the hits according to some options
// Not a good algorithm. The best would be to organize all the hits in sensors
// *first* then only select the hits that we are interested into. TODO!
 
bool SeedFinderProcessor::GroupStrips(
    const std::vector<ldmx::Measurement>& measurements,
    const std::vector<int> strategy) {
  //    std::cout<<"Using stratedy"<<std::endl;
  // for (auto& e : strategy) {
  //  std::cout<<e<<" ";
  //}
  // std::cout<<std::endl;
 
  for (auto& meas : measurements) {
    ldmx_log(debug) << meas;
 
    if (std::find(strategy.begin(), strategy.end(), meas.getLayer()) !=
        strategy.end()) {
      ldmx_log(debug) << "Adding measurement from layer = " << meas.getLayer();
      groups_map[meas.getLayer()].push_back(&meas);
    }
 
  }  // loop meas
 
  if (groups_map.size() < 5)
    return false;
  else
    return true;
}
 
// For each strategy, form all the possible combinatorics and form a seedTrack
// for each of those This will reshuffle all points. (issue?) Will sort the
// meas_for_seed vector
 
void SeedFinderProcessor::FindSeedsFromMap(ldmx::Tracks& seeds,
                                           const ldmx::Measurements& pmeas) {
  std::map<int, std::vector<const ldmx::Measurement*>>::iterator groups_iter =
      groups_map.begin();
  // Vector of iterators
  constexpr size_t K = 5;
  std::vector<std::vector<const ldmx::Measurement*>::iterator> it;
  it.reserve(K);
 
  unsigned int ikey = 0;
  for (auto& key : groups_map) {
    it[ikey] = key.second.begin();
    ikey++;
  }
 
  // K vectors in an array v[0],v[1].... v[K-1]
 
  while (it[0] != groups_iter->second.end()) {
    // process the pointed-to elements
 
    /*
      for (int j=0; j<K; j++) {
      const ldmx::Measurement* meas = (*(it[j]));
      std::cout<<meas->getGlobalPosition()[0]<<","
      <<meas->getGlobalPosition()[1]<<","
      <<meas->getGlobalPosition()[2]<<","<<std::endl;
      }
    */
 
    std::vector<ldmx::Measurement> meas_for_seeds;
    meas_for_seeds.reserve(5);
 
    ldmx_log(debug) << " Grouping ";
 
    for (int j = 0; j < K; j++) {
      const ldmx::Measurement* meas = (*(it[j]));
      meas_for_seeds.push_back(*meas);
    }
 
    std::sort(meas_for_seeds.begin(), meas_for_seeds.end(),
              [](const ldmx::Measurement& m1, const ldmx::Measurement& m2) {
                return m1.getGlobalPosition()[0] < m2.getGlobalPosition()[0];
              });
 
    if (meas_for_seeds.size() < 5) {
      nmissing_++;
      return;
    }
 
    ldmx_log(debug) << "making seedTrack";
 
    Acts::Vector3 perigee{perigee_location_[0], perigee_location_[1],
                          perigee_location_[2]};
 
    ldmx::Track seedTrack =
        SeedTracker(meas_for_seeds, meas_for_seeds.at(2).getGlobalPosition()[0],
                    perigee, pmeas);
 
    bool fail = false;
 
    // Remove failed fits
    if (1. / abs(seedTrack.getQoP()) < pmin_) {
      nfailpmin_++;
      fail = true;
    } else if (1. / abs(seedTrack.getQoP()) > pmax_) {
      nfailpmax_++;
      fail = true;
    }
 
    // Remove large part of fake tracks and duplicates with the following cuts
    // for various compatibility checks.
 
    else if (abs(seedTrack.getZ0()) > z0max_) {
      nfailz0max_++;
      fail = true;
    } else if (seedTrack.getD0() < d0min_) {
      nfaild0min_++;
      fail = true;
    } else if (seedTrack.getD0() > d0max_) {
      nfaild0max_++;
      fail = true;
    } else if (abs(seedTrack.getPhi()) > phicut_) {
      fail = true;
      nfailphi_++;
    } else if (abs(seedTrack.getTheta() - piover2_) > thetacut_) {
      fail = true;
      nfailtheta_++;
    }
 
    // If I didn't use the target pseudo measurements in the track finding
    // I can use them for compatibility with the tagger track
 
    // TODO this should protect against running this check on tagger seeder.
    // This is true only if this seeder is not run twice on the tagger after
    // already having tagger tracks available.
    if (pmeas.size() > 0) {
      // I can have multiple target pseudo measurements
      // A seed is rejected if it is found incompatible with all the target
      // extrapolations
 
      // This is set but unused, eventually we will use tagger track position at
      // target to inform recoil tracking bool tgt_compatible = false;
      for (auto tgt_pseudomeas : pmeas) {
        // The d0/z0 are in a frame with the same orientation of the target
        // surface
        double delta_loc0 =
            seedTrack.getD0() - tgt_pseudomeas.getLocalPosition()[0];
        double delta_loc1 =
            seedTrack.getZ0() - tgt_pseudomeas.getLocalPosition()[1];
 
        if (abs(delta_loc0) < loc0cut_ && abs(delta_loc1) < loc1cut_) {
          // found at least 1 compatible target location
          // tgt_compatible = true;
          break;
        }
      }
    }  // pmeas > 0
 
    if (!fail) {
      if (truthMatchingTool_->configured()) {
        auto truthInfo = truthMatchingTool_->TruthMatch(meas_for_seeds);
        seedTrack.setTrackID(truthInfo.trackID);
        seedTrack.setPdgID(truthInfo.pdgID);
        seedTrack.setTruthProb(truthInfo.truthProb);
      }
 
      seeds.push_back(seedTrack);
    }
 
    else {
      b0_.pop_back();
      b1_.pop_back();
      b2_.pop_back();
      b3_.pop_back();
      b4_.pop_back();
    }
 
    // Go to next combination
    ldmx_log(debug) << "Go to the next combination";
 
    ++it[K - 1];
    for (int i = K - 1;
         (i > 0) && (it[i] == (std::next(groups_iter, i))->second.end()); --i) {
      it[i] = std::next(groups_iter, i)->second.begin();
      ++it[i - 1];
    }
  }
}  // find seeds
 
}  // namespace reco
}  // namespace tracking
 
DECLARE_PRODUCER_NS(tracking::reco, SeedFinderProcessor)