RecoLocalMuon/DTSegment/src/DTCombinatorialPatternReco.cc - master - githubmirror/cmssw

RecoLocalMuon/DTSegment/src/DTCombinatorialPatternReco.cc
414 строк15 KB
Christopher Jones
Added esConsumes to code in RecoLocalMuon/DTSegment
08 сен 2021, 01:03
08 сен 2021, 01:0309f7c0b
/** \file
 *
 * \author Stefano Lacaprara - INFN Legnaro <stefano.lacaprara@pd.infn.it>
 * \author Riccardo Bellan - INFN TO <riccardo.bellan@cern.ch>
 */

/* This Class Header */
#include "RecoLocalMuon/DTSegment/src/DTCombinatorialPatternReco.h"

/* Collaborating Class Header */
#include "FWCore/Framework/interface/ESHandle.h"
#include "FWCore/Framework/interface/EventSetup.h"
#include "FWCore/Framework/interface/ConsumesCollector.h"
#include "DataFormats/Common/interface/OwnVector.h"
#include "DataFormats/GeometryVector/interface/GlobalPoint.h"
#include "Geometry/Records/interface/MuonGeometryRecord.h"
#include "Geometry/DTGeometry/interface/DTGeometry.h"
#include "Geometry/DTGeometry/interface/DTLayer.h"
#include "Geometry/DTGeometry/interface/DTSuperLayer.h"
#include "DataFormats/DTRecHit/interface/DTSLRecSegment2D.h"
#include "RecoLocalMuon/DTSegment/src/DTSegmentUpdator.h"
#include "RecoLocalMuon/DTSegment/src/DTSegmentCleaner.h"
#include "RecoLocalMuon/DTSegment/src/DTHitPairForFit.h"
#include "RecoLocalMuon/DTSegment/src/DTSegmentCand.h"

/* C++ Headers */
#include <iterator>
using namespace std;
#include "FWCore/ParameterSet/interface/ParameterSet.h"

/* ====================================================================== */

/// Constructor
DTCombinatorialPatternReco::DTCombinatorialPatternReco(const edm::ParameterSet& pset, edm::ConsumesCollector iCC)
    : DTRecSegment2DBaseAlgo(pset), theAlgoName("DTCombinatorialPatternReco"), theDTGeometryToken(iCC.esConsumes()) {
  theMaxAllowedHits = pset.getParameter<unsigned int>("MaxAllowedHits");  // 100
  theAlphaMaxTheta = pset.getParameter<double>("AlphaMaxTheta");          // 0.1 ;
  theAlphaMaxPhi = pset.getParameter<double>("AlphaMaxPhi");              // 1.0 ;
  debug = pset.getUntrackedParameter<bool>("debug");                      //true;
  theUpdator = new DTSegmentUpdator(pset, iCC);
  theCleaner = new DTSegmentCleaner(pset);
  string theHitAlgoName = pset.getParameter<string>("recAlgo");
  usePairs = !(theHitAlgoName == "DTNoDriftAlgo");
}

/// Destructor
DTCombinatorialPatternReco::~DTCombinatorialPatternReco() {
  delete theUpdator;
  delete theCleaner;
}

/* Operations */
edm::OwnVector<DTSLRecSegment2D> DTCombinatorialPatternReco::reconstruct(const DTSuperLayer* sl,
                                                                         const std::vector<DTRecHit1DPair>& pairs) {
  edm::OwnVector<DTSLRecSegment2D> result;
  vector<std::shared_ptr<DTHitPairForFit>> hitsForFit = initHits(sl, pairs);

  vector<DTSegmentCand*> candidates = buildSegments(sl, hitsForFit);

  vector<DTSegmentCand*>::const_iterator cand = candidates.begin();
  while (cand < candidates.end()) {
    DTSLRecSegment2D* segment = (**cand);

    theUpdator->update(segment, false);

    result.push_back(segment);

    if (debug) {
      cout << "Reconstructed 2D segments " << result.back() << endl;
    }

    delete *(cand++);  // delete the candidate!
  }

  return result;
}

void DTCombinatorialPatternReco::setES(const edm::EventSetup& setup) {
  // Get the DT Geometry
  theDTGeometry = setup.getHandle(theDTGeometryToken);
  theUpdator->setES(setup);
}

vector<std::shared_ptr<DTHitPairForFit>> DTCombinatorialPatternReco::initHits(const DTSuperLayer* sl,
                                                                              const std::vector<DTRecHit1DPair>& hits) {
  vector<std::shared_ptr<DTHitPairForFit>> result;
  for (vector<DTRecHit1DPair>::const_iterator hit = hits.begin(); hit != hits.end(); ++hit) {
    result.push_back(std::make_shared<DTHitPairForFit>(*hit, *sl, theDTGeometry));
  }
  return result;
}

vector<DTSegmentCand*> DTCombinatorialPatternReco::buildSegments(
    const DTSuperLayer* sl, const std::vector<std::shared_ptr<DTHitPairForFit>>& hits) {
  // clear the patterns tried
  if (debug) {
    cout << "theTriedPattern.size is " << theTriedPattern.size() << "\n";
  }
  theTriedPattern.clear();

  typedef vector<std::shared_ptr<DTHitPairForFit>> hitCont;
  typedef hitCont::const_iterator hitIter;
  vector<DTSegmentCand*> result;

  if (debug) {
    cout << "buildSegments: " << sl->id() << " nHits " << hits.size() << endl;
    for (vector<std::shared_ptr<DTHitPairForFit>>::const_iterator hit = hits.begin(); hit != hits.end(); ++hit)
      cout << **hit << endl;
  }

  // 10-Mar-2004 SL
  // put a protection against heavily populated chambers, for which the segment
  // building could lead to infinite memory usage...
  if (hits.size() > theMaxAllowedHits) {
    if (debug) {
      cout << "Warning: this SuperLayer " << sl->id() << " has too many hits : " << hits.size() << " max allowed is "
           << theMaxAllowedHits << endl;
      cout << "Skipping segment reconstruction... " << endl;
    }
    return result;
  }

  /// get two hits in different layers and see if there are other / hits
  //  compatible with them
  for (hitCont::const_iterator firstHit = hits.begin(); firstHit != hits.end(); ++firstHit) {
    for (hitCont::const_reverse_iterator lastHit = hits.rbegin(); (*lastHit) != (*firstHit); ++lastHit) {
      //if ( (*lastHit)->id().layerId() == (*firstHit)->id().layerId() ) continue; // hits must be in different layers!
      // hits must nor in the same nor in adiacent layers
      if (fabs((*lastHit)->id().layerId() - (*firstHit)->id().layerId()) <= 1)
        continue;
      if (debug) {
        cout << "Selected these two hits pair " << endl;
        cout << "First " << *(*firstHit) << " Layer Id: " << (*firstHit)->id().layerId() << endl;
        cout << "Last " << *(*lastHit) << " Layer Id: " << (*lastHit)->id().layerId() << endl;
      }

      GlobalPoint IP;
      float DAlphaMax;
      if ((sl->id()).superlayer() == 2)  // Theta SL
        DAlphaMax = theAlphaMaxTheta;
      else  // Phi SL
        DAlphaMax = theAlphaMaxPhi;

      DTEnums::DTCellSide codes[2] = {DTEnums::Right, DTEnums::Left};
      for (int firstLR = 0; firstLR < 2; ++firstLR) {
        for (int lastLR = 0; lastLR < 2; ++lastLR) {
          // TODO move the global transformation in the DTHitPairForFit class
          // when it will be moved I will able to remove the sl from the input parameter
          GlobalPoint gposFirst = sl->toGlobal((*firstHit)->localPosition(codes[firstLR]));
          GlobalPoint gposLast = sl->toGlobal((*lastHit)->localPosition(codes[lastLR]));

          GlobalVector gvec = gposLast - gposFirst;
          GlobalVector gvecIP = gposLast - IP;

          // difference in angle measured
          float DAlpha = fabs(gvec.theta() - gvecIP.theta());

          // cout << "DAlpha " << DAlpha << endl;
          if (DAlpha < DAlphaMax) {
            // create a segment hypotesis
            // I don't need a true segment, just direction and position
            LocalPoint posIni = (*firstHit)->localPosition(codes[firstLR]);
            LocalVector dirIni = ((*lastHit)->localPosition(codes[lastLR]) - posIni).unit();

            // search for other compatible hits, with or without the L/R solved
            vector<DTSegmentCand::AssPoint> assHits = findCompatibleHits(posIni, dirIni, hits);
            if (debug)
              cout << "compatible hits " << assHits.size() << endl;

            // get the best segment with these hits: it's just one!
            // (is it correct?)
            DTSegmentCand* seg = buildBestSegment(assHits, sl);

            if (seg) {
              if (debug)
                cout << "segment " << *seg << endl;

              // check if the chi2 and #hits are ok
              if (!seg->good()) {
                delete seg;
              } else {
                // remove duplicated segments (I know, would be better to do it before the
                // fit...)
                if (checkDoubleCandidates(result, seg)) {
                  // add to the vector of hypotesis
                  result.push_back(seg);
                  if (debug)
                    cout << "result is now " << result.size() << endl;
                } else {  // delete it!
                  delete seg;
                  if (debug)
                    cout << "already existing" << endl;
                }
              }
            }
          }
        }
      }
    }
  }
  if (debug) {
    for (vector<DTSegmentCand*>::const_iterator seg = result.begin(); seg != result.end(); ++seg)
      cout << *(*seg) << endl;
  }

  // now I have a couple of segment hypotesis, should check for ghost
  result = theCleaner->clean(result);
  if (debug) {
    cout << "result no ghost  " << result.size() << endl;
    for (vector<DTSegmentCand*>::const_iterator seg = result.begin(); seg != result.end(); ++seg)
      cout << *(*seg) << endl;
  }

  return result;
}

vector<DTSegmentCand::AssPoint> DTCombinatorialPatternReco::findCompatibleHits(
    const LocalPoint& posIni, const LocalVector& dirIni, const vector<std::shared_ptr<DTHitPairForFit>>& hits) {
  if (debug)
    cout << "Pos: " << posIni << " Dir: " << dirIni << endl;
  vector<DTSegmentCand::AssPoint> result;

  // counter to early-avoid double counting in hits pattern
  TriedPattern tried;
  int nCompatibleHits = 0;

  typedef vector<std::shared_ptr<DTHitPairForFit>> hitCont;
  typedef hitCont::const_iterator hitIter;
  for (hitIter hit = hits.begin(); hit != hits.end(); ++hit) {
    pair<bool, bool> isCompatible = (*hit)->isCompatible(posIni, dirIni);
    if (debug)
      cout << "isCompatible " << isCompatible.first << " " << isCompatible.second << endl;

    // if only one of the two is compatible, then the LR is assigned,
    // otherwise is undefined

    DTEnums::DTCellSide lrcode;
    if (isCompatible.first && isCompatible.second) {
      usePairs ? lrcode = DTEnums::undefLR : lrcode = DTEnums::Left;  // if not usePairs then only use single side
      tried.push_back(3);
      nCompatibleHits++;
    } else if (isCompatible.first) {
      lrcode = DTEnums::Left;
      tried.push_back(2);
      nCompatibleHits++;
    } else if (isCompatible.second) {
      lrcode = DTEnums::Right;
      tried.push_back(1);
      nCompatibleHits++;
    } else {
      tried.push_back(0);
      continue;  // neither is compatible
    }
    result.push_back(DTSegmentCand::AssPoint(*hit, lrcode));
  }

  // check if too few associated hits or pattern already tried
  // TODO: two different if for nCompatibleHits < 3 =>printout and find ->
  // printour
  if (nCompatibleHits < 3) {
    if (debug) {
      cout << "Less than 3 hits ";
      copy(tried.begin(), tried.end(), ostream_iterator<int>(std::cout));
      cout << endl;
    }
    // No need to insert into the list of patterns, as you will never search for it.
    //theTriedPattern.insert(tried);
  } else {
    // try to insert, return bool if already there
    bool isnew = theTriedPattern.insert(tried).second;
    if (isnew) {
      if (debug) {
        cout << "NOT Already tried ";
        copy(tried.begin(), tried.end(), ostream_iterator<int>(std::cout));
        cout << endl;
      }
    } else {
      if (debug) {
        cout << "Already tried ";
        copy(tried.begin(), tried.end(), ostream_iterator<int>(std::cout));
        cout << endl;
      }
      // empty the result vector
      result.clear();
    }
  }
  return result;
}

DTSegmentCand* DTCombinatorialPatternReco::buildBestSegment(std::vector<DTSegmentCand::AssPoint>& hits,
                                                            const DTSuperLayer* sl) {
  if (hits.size() < 3) {
    //cout << "buildBestSegment: hits " << hits.size()<< endl;
    return nullptr;  // a least 3 point
  }

  // hits with defined LR
  vector<DTSegmentCand::AssPoint> points;

  // without: I store both L and R, a deque since I need front insertion and
  // deletion
  deque<std::shared_ptr<DTHitPairForFit>> pointsNoLR;

  // first add only the hits with LR assigned
  for (vector<DTSegmentCand::AssPoint>::const_iterator hit = hits.begin(); hit != hits.end(); ++hit) {
    if ((*hit).second != DTEnums::undefLR) {
      points.push_back(*hit);
    } else {  // then also for the undef'd one
      pointsNoLR.push_back((*hit).first);
    }
  }

  if (debug) {
    cout << "points " << points.size() << endl;
    cout << "pointsNoLR " << pointsNoLR.size() << endl;
  }

  // build all possible candidates using L/R ambiguity
  vector<DTSegmentCand*> candidates;

  buildPointsCollection(points, pointsNoLR, candidates, sl);

  if (debug)
    cout << "candidates " << candidates.size() << endl;

  // so now I have build a given number of segments, I should find the best one,
  // by #hits and chi2.
  vector<DTSegmentCand*>::const_iterator bestCandIter = candidates.end();
  double minChi2 = 999999.;
  unsigned int maxNumHits = 0;
  for (vector<DTSegmentCand*>::const_iterator iter = candidates.begin(); iter != candidates.end(); ++iter) {
    if ((*iter)->nHits() == maxNumHits && (*iter)->chi2() < minChi2) {
      minChi2 = (*iter)->chi2();
      bestCandIter = iter;
    } else if ((*iter)->nHits() > maxNumHits) {
      maxNumHits = (*iter)->nHits();
      minChi2 = (*iter)->chi2();
      bestCandIter = iter;
    }
  }

  // delete all candidates but the best one!
  for (vector<DTSegmentCand*>::iterator iter = candidates.begin(); iter != candidates.end(); ++iter)
    if (iter != bestCandIter)
      delete *iter;

  // return the best candate if any
  if (bestCandIter != candidates.end()) {
    return (*bestCandIter);
  }
  return nullptr;
}

void DTCombinatorialPatternReco::buildPointsCollection(vector<DTSegmentCand::AssPoint>& points,
                                                       deque<std::shared_ptr<DTHitPairForFit>>& pointsNoLR,
                                                       vector<DTSegmentCand*>& candidates,
                                                       const DTSuperLayer* sl) {
  if (debug) {
    cout << "buildPointsCollection " << endl;
    cout << "points: " << points.size() << " NOLR: " << pointsNoLR.size() << endl;
  }
  if (!pointsNoLR.empty()) {  // still unassociated points!
    std::shared_ptr<DTHitPairForFit> unassHit = pointsNoLR.front();
    // try with the right
    if (debug)
      cout << "Right hit" << endl;
    points.push_back(DTSegmentCand::AssPoint(unassHit, DTEnums::Right));
    pointsNoLR.pop_front();
    buildPointsCollection(points, pointsNoLR, candidates, sl);
    pointsNoLR.push_front((unassHit));
    points.pop_back();

    // try with the left
    if (debug)
      cout << "Left hit" << endl;
    points.push_back(DTSegmentCand::AssPoint(unassHit, DTEnums::Left));
    pointsNoLR.pop_front();
    buildPointsCollection(points, pointsNoLR, candidates, sl);
    pointsNoLR.push_front((unassHit));
    points.pop_back();
  } else {  // all associated

    if (debug) {
      cout << "The Hits were" << endl;
      copy(points.begin(), points.end(), ostream_iterator<DTSegmentCand::AssPoint>(std::cout));
      cout << "----" << endl;
      cout << "All associated " << endl;
    }
    DTSegmentCand::AssPointCont pointsSet;

    // for (vector<DTSegmentCand::AssPoint>::const_iterator point=points.begin();
    //      point!=points.end(); ++point)
    pointsSet.insert(points.begin(), points.end());

    if (debug) {
      cout << "The Hits are" << endl;
      copy(pointsSet.begin(), pointsSet.end(), ostream_iterator<DTSegmentCand::AssPoint>(std::cout));
      cout << "----" << endl;
    }

    DTSegmentCand* newCand = new DTSegmentCand(pointsSet, sl);
    if (theUpdator->fit(newCand, false, false))
      candidates.push_back(newCand);
    else
      delete newCand;  // bad seg, too few hits
  }
}

bool DTCombinatorialPatternReco::checkDoubleCandidates(vector<DTSegmentCand*>& cands, DTSegmentCand* seg) {
  for (vector<DTSegmentCand*>::iterator cand = cands.begin(); cand != cands.end(); ++cand)
    if (*(*cand) == *seg)
      return false;
  return true;
}