tmtt::DupFitTrkKiller Class Reference

#include <DupFitTrkKiller.h>

Public Types
enum	DupAlgoName { DupAlgoName::None = 0, DupAlgoName::Algo1 = 1, DupAlgoName::Algo2 = 2 }

Public Member Functions
	DupFitTrkKiller (const Settings *settings)
std::list< const L1fittedTrack * >	filter (const std::list< L1fittedTrack > &vecTracks) const

Private Member Functions
std::list< const L1fittedTrack * >	filterAlg1 (const std::list< L1fittedTrack > &tracks) const
std::list< const L1fittedTrack * >	filterAlg2 (const std::list< L1fittedTrack > &tracks) const
void	printDuplicateTracks (const std::list< const L1fittedTrack * > &tracks) const

Private Attributes
DupAlgoName	dupTrkAlg_
const Settings *	settings_

Detailed Description

Definition at line 19 of file DupFitTrkKiller.h.

Member Enumeration Documentation

DupAlgoName

enum tmtt::DupFitTrkKiller::DupAlgoName

strong

Enumerator
None
Algo1
Algo2

Definition at line 21 of file DupFitTrkKiller.h.

{ None = 0, Algo1 = 1, Algo2 = 2 };

Constructor & Destructor Documentation

DupFitTrkKiller()

tmtt::DupFitTrkKiller::DupFitTrkKiller

(

const Settings *

settings

)

Make available cfg parameters & specify which algorithm is to be used for duplicate track removal.

Definition at line 13 of file DupFitTrkKiller.cc.

      : settings_(settings), dupTrkAlg_(static_cast<DupAlgoName>(settings->dupTrkAlgFit())) {}

Member Function Documentation

filter()

list< const L1fittedTrack * > tmtt::DupFitTrkKiller::filter

(

const std::list< L1fittedTrack > &

vecTracks

)

const

Eliminate duplicate tracks from the input collection, and so return a reduced list of tracks.

Definition at line 18 of file DupFitTrkKiller.cc.

                                                                                               {
    if (dupTrkAlg_ == DupAlgoName::None) {
      // We are not running duplicate removal, so return original fitted track collection.
      list<const L1fittedTrack*> copyTracks;
      for (const L1fittedTrack& trk : vecTracks) {
        copyTracks.push_back(&trk);
      }
      return copyTracks;
 
    } else {
      // Choose which algorithm to run, based on parameter dupTrkAlg_.
      switch (dupTrkAlg_) {
        // Run filters that only work on fitted tracks.
        case DupAlgoName::Algo1:
          return filterAlg1(vecTracks);
          break;
        case DupAlgoName::Algo2:
          return filterAlg2(vecTracks);
          break;
        default:
          throw cms::Exception("BadConfig") << "KillDupTrks: Cfg option DupFitTrkAlg has invalid value.";
      }
    }
  }

References Algo1, Algo2, dupTrkAlg_, Exception, filterAlg1(), filterAlg2(), and None.

Referenced by tmtt::TMTrackProducer::produce().

filterAlg1()

list< const L1fittedTrack * > tmtt::DupFitTrkKiller::filterAlg1 ( const std::list< L1fittedTrack > &  tracks ) const

private

Duplicate removal algorithm that eliminates duplicates by requiring that the fitted (q/Pt, phi0) of the track correspond to the same HT cell in which the track was originally found by the HT.

Definition at line 49 of file DupFitTrkKiller.cc.

                                                                                                {
    // Hard-wired options to play with.
    constexpr bool debug = false;
    constexpr bool doRecoveryStep = true;  // Do 2nd pass through rejected tracks to see if any should be rescued.
    constexpr bool reduceDups = true;      // Option attempting to reduce duplicate tracks during 2nd pass.
    constexpr bool memorizeAllHTcells =
        false;  // First pass stores in memory all cells that the HT found tracks in, not just those of tracks accepted by the first pass.
    constexpr bool doSectorCheck = false;  // Require fitted helix to lie within sector.
    constexpr bool usePtAndZ0Cuts = false;
    constexpr bool goOutsideArray = true;  // Also store in memory stubs outside the HT array during 2nd pass.
    constexpr bool limitDiff = true;       // Limit allowed diff. between HT & Fit cell to <= 1.
 
    if (debug && not tracks.empty())
      PrintL1trk() << "Start DupFitTrkKiller" << tracks.size();
 
    list<const L1fittedTrack*> tracksFiltered;
 
    // Make a first pass through the tracks, doing initial identification of duplicate tracks.
    // N.B. BY FILLING THIS WITH CELLS AROUND SELECTED TRACKS, RATHER THAN JUST THE CELL CONTAINING THE
    // TRACK, ONE CAN REDUCE THE DUPLICATE RATE FURTHER, AT COST TO EFFICIENCY.
    set<pair<unsigned int, unsigned int>> htCellUsed;
    list<const L1fittedTrack*> tracksRejected;
 
    // For checking if multiple tracks corresponding to same TP are accepted by duplicate removal.
    map<unsigned int, pair<unsigned int, unsigned int>> tpFound;
    map<unsigned int, unsigned int> tpFoundAtPass;
 
    for (const L1fittedTrack& trk : tracks) {
      // Only consider tracks whose fitted helix parameters are in the same sector as the HT originally used to find the track.
      if ((!doSectorCheck) || trk.consistentSector()) {
        if ((!usePtAndZ0Cuts) ||
            (std::abs(trk.z0()) < settings_->beamWindowZ() && trk.pt() > settings_->houghMinPt() - 0.2)) {
          // For debugging.
          const TP* tp = trk.matchedTP();
 
          // Check if this track's fitted (q/pt, phi0) helix parameters correspond to the same HT cell as the HT originally found the track in.
          bool consistentCell = trk.consistentHTcell();
          if (consistentCell) {
            // This track is probably not a duplicate, so keep & and store its HT cell location (which equals the HT cell corresponding to the fitted track).
            tracksFiltered.push_back(&trk);
            // Memorize HT cell location corresponding to this track (identical for HT track & fitted track).
            if (!memorizeAllHTcells) {
              pair<unsigned int, unsigned int> htCell = trk.cellLocationHT();
              htCellUsed.insert(htCell);
              if (trk.l1track3D()->mergedHTcell()) {
                // If this is a merged cell, block the other elements too, in case a track found by the HT in an unmerged cell
                // has a fitted cell there.
                pair<unsigned int, unsigned int> htCell10(htCell.first + 1, htCell.second);
                pair<unsigned int, unsigned int> htCell01(htCell.first, htCell.second + 1);
                pair<unsigned int, unsigned int> htCell11(htCell.first + 1, htCell.second + 1);
                htCellUsed.insert(htCell10);
                htCellUsed.insert(htCell01);
                htCellUsed.insert(htCell11);
              }
            }
 
            if (debug && tp != nullptr) {
              PrintL1trk() << "FIRST PASS: m=" << trk.cellLocationHT().first << "/" << trk.cellLocationFit().first
                           << " c=" << trk.cellLocationHT().second << "/" << trk.cellLocationFit().second
                           << " Delta(m,c)=(" << int(trk.cellLocationHT().first) - int(trk.cellLocationFit().first)
                           << "," << int(trk.cellLocationHT().second) - int(trk.cellLocationFit().second)
                           << ") pure=" << trk.purity() << " merged=" << trk.l1track3D()->mergedHTcell()
                           << " #layers=" << trk.l1track3D()->numLayers() << " tp=" << tp->index() << " dupCell=("
                           << tpFound[tp->index()].first << "," << tpFound[tp->index()].second
                           << ") dup=" << tpFoundAtPass[tp->index()];
              // If the following two variables are non-zero in printout, then track has already been found,
              // so we have mistakenly kept a duplicate.
              if (tpFound.find(tp->index()) != tpFound.end())
                tpFound[tp->index()] = trk.cellLocationFit();
              tpFoundAtPass[tp->index()] = 1;
            }
 
          } else {
            if (limitDiff) {
              const unsigned int maxDiff = 1;
              if (abs(int(trk.cellLocationHT().first) - int(trk.cellLocationFit().first)) <= int(maxDiff) &&
                  abs(int(trk.cellLocationHT().second) - int(trk.cellLocationFit().second)) <= int(maxDiff))
                tracksRejected.push_back(&trk);
            } else {
              tracksRejected.push_back(&trk);
            }
 
            if (debug && tp != nullptr) {
              PrintL1trk() << "FIRST REJECT: m=" << trk.cellLocationHT().first << "/" << trk.cellLocationFit().first
                           << " c=" << trk.cellLocationHT().second << "/" << trk.cellLocationFit().second
                           << " Delta(m,c)=(" << int(trk.cellLocationHT().first) - int(trk.cellLocationFit().first)
                           << "," << int(trk.cellLocationHT().second) - int(trk.cellLocationFit().second)
                           << ") pure=" << trk.purity() << " merged=" << trk.l1track3D()->mergedHTcell()
                           << " #layers=" << trk.l1track3D()->numLayers() << " tp=" << tp->index() << " dupCell=("
                           << tpFound[tp->index()].first << "," << tpFound[tp->index()].second
                           << ") dup=" << tpFoundAtPass[tp->index()];
            }
          }
          // Memorize HT cell location corresponding to this track, even if it was not accepted by first pass..
          if (memorizeAllHTcells) {
            pair<unsigned int, unsigned int> htCell =
                trk.cellLocationFit();  // Intentionally used fit instead of HT here.
            htCellUsed.insert(htCell);
            if (trk.l1track3D()->mergedHTcell()) {
              // If this is a merged cell, block the other elements too, in case a track found by the HT in an unmerged cell
              // has a fitted cell there.
              // N.B. NO GOOD REASON WHY "-1" IS NOT DONE HERE TOO. MIGHT REDUCE DUPLICATE RATE?
              pair<unsigned int, unsigned int> htCell10(htCell.first + 1, htCell.second);
              pair<unsigned int, unsigned int> htCell01(htCell.first, htCell.second + 1);
              pair<unsigned int, unsigned int> htCell11(htCell.first + 1, htCell.second + 1);
              htCellUsed.insert(htCell10);
              htCellUsed.insert(htCell01);
              htCellUsed.insert(htCell11);
            }
          }
        }
      }
    }
 
    if (doRecoveryStep) {
      // Making a second pass through the rejected tracks, checking if any should be rescued.
      for (const L1fittedTrack* trk : tracksRejected) {
        // Get location in HT array corresponding to fitted track helix parameters.
        pair<unsigned int, unsigned int> htCell = trk->cellLocationFit();
        // If this HT cell was not already memorized, rescue this track, since it is probably not a duplicate,
        // but just a track whose fitted helix parameters are a bit wierd for some reason.
        if (std::count(htCellUsed.begin(), htCellUsed.end(), htCell) == 0) {
          tracksFiltered.push_back(trk);  // Rescue track.
          // Optionally store cell location to avoid rescuing other tracks at the same location, which may be duplicates of this track.
          bool outsideCheck = (goOutsideArray || trk->pt() > settings_->houghMinPt());
          if (reduceDups && outsideCheck)
            htCellUsed.insert(htCell);
 
          // For debugging.
          const TP* tp = trk->matchedTP();
 
          if (debug && tp != nullptr) {
            PrintL1trk() << "SECOND PASS: m=" << trk->cellLocationHT().first << "/" << trk->cellLocationFit().first
                         << " c=" << trk->cellLocationHT().second << "/" << trk->cellLocationFit().second
                         << " Delta(m,c)=(" << int(trk->cellLocationHT().first) - int(trk->cellLocationFit().first)
                         << "," << int(trk->cellLocationHT().second) - int(trk->cellLocationFit().second)
                         << ") pure=" << trk->purity() << " merged=" << trk->l1track3D()->mergedHTcell()
                         << " #layers=" << trk->l1track3D()->numLayers() << " tp=" << tp->index() << " dupCell=("
                         << tpFound[tp->index()].first << "," << tpFound[tp->index()].second
                         << ") dup=" << tpFoundAtPass[tp->index()];
            if (tpFound.find(tp->index()) != tpFound.end())
              tpFound[tp->index()] = htCell;
            tpFoundAtPass[tp->index()] = 2;
          }
        }
      }
    }
 
    // Debug printout to identify duplicate tracks that survived.
    if (debug)
      this->printDuplicateTracks(tracksFiltered);
 
    return tracksFiltered;
  }

References funct::abs(), tmtt::Settings::beamWindowZ(), submitPVResolutionJobs::count, debug, tmtt::Settings::houghMinPt(), createfilelist::int, reco::castor::maxDiff(), printDuplicateTracks(), settings_, cmsswSequenceInfo::tp, and tracks.

Referenced by filter().

filterAlg2()

list< const L1fittedTrack * > tmtt::DupFitTrkKiller::filterAlg2 ( const std::list< L1fittedTrack > &  tracks ) const

private

Duplicate removal algorithm that eliminates duplicates
by requiring that no two tracks should have fitted (q/Pt, phi0) that correspond to the same HT cell. If they do, then only the first to arrive is kept.

Definition at line 210 of file DupFitTrkKiller.cc.

                                                                                                {
    // Hard-wired options to play with.
    const bool debug = false;
 
    if (debug && not tracks.empty())
      PrintL1trk() << "START " << tracks.size();
 
    list<const L1fittedTrack*> tracksFiltered;
    set<pair<unsigned int, unsigned int>> htCellUsed;
 
    for (const L1fittedTrack& trk : tracks) {
      // Get location in HT array corresponding to fitted track helix parameters.
      pair<unsigned int, unsigned int> htCell = trk.cellLocationFit();
      // If this HT cell was not already memorized, rescue this track, since it is probably not a duplicate,
      // but just a track whose fitted helix parameters are a bit wierd for some reason.
      if (std::count(htCellUsed.begin(), htCellUsed.end(), htCell) == 0) {
        tracksFiltered.push_back(&trk);  // Rescue track.
        // Store cell location to avoid rescuing other tracks at the same location, which may be duplicates of this track.
        htCellUsed.insert(htCell);
        if (debug) {
          const TP* tp = trk.matchedTP();
          int tpIndex = (tp != nullptr) ? tp->index() : -999;
          PrintL1trk() << "ALG51: m=" << trk.cellLocationHT().first << "/" << trk.cellLocationFit().first
                       << " c=" << trk.cellLocationHT().second << "/" << trk.cellLocationFit().second
                       << " tp=" << tpIndex << " pure=" << trk.purity();
        }
      }
    }
 
    // Debug printout to identify duplicate tracks that survived.
    if (debug)
      this->printDuplicateTracks(tracksFiltered);
 
    return tracksFiltered;
  }

References submitPVResolutionJobs::count, debug, printDuplicateTracks(), cmsswSequenceInfo::tp, and tracks.

Referenced by filter().

printDuplicateTracks()

void tmtt::DupFitTrkKiller::printDuplicateTracks ( const std::list< const L1fittedTrack * > &  tracks ) const

private

Definition at line 247 of file DupFitTrkKiller.cc.

                                                                                           {
    map<const TP*, list<const L1fittedTrack*>> tpMap;
    for (const L1fittedTrack* trk : tracks) {
      const TP* tp = trk->matchedTP();
      if (tp != nullptr) {
        tpMap[tp].push_back(trk);
      }
    }
    for (const auto& p : tpMap) {
      const TP* tp = p.first;
      const list<const L1fittedTrack*> vecTrk = p.second;
      if (vecTrk.size() > 1) {
        for (const L1fittedTrack* trk : vecTrk) {
          PrintL1trk() << "  MESS UP : m=" << trk->cellLocationHT().first << "/" << trk->cellLocationFit().first
                       << " c=" << trk->cellLocationHT().second << "/" << trk->cellLocationFit().second
                       << " tp=" << tp->index() << " tp_pt=" << tp->pt() << " fit_pt=" << trk->pt()
                       << " pure=" << trk->purity();
          PrintL1trk() << "     stubs = ";
          for (const Stub* s : trk->stubs())
            PrintL1trk() << s->index() << " ";
          PrintL1trk();
        }
      }
    }
    if (not tracks.empty())
      PrintL1trk() << "FOUND " << tracks.size();
  }

References AlCaHLTBitMon_ParallelJobs::p, alignCSCRings::s, cmsswSequenceInfo::tp, and tracks.

Referenced by filterAlg1(), and filterAlg2().

Member Data Documentation

dupTrkAlg_

DupAlgoName tmtt::DupFitTrkKiller::dupTrkAlg_

private

Definition at line 53 of file DupFitTrkKiller.h.

Referenced by filter().

settings_

const Settings* tmtt::DupFitTrkKiller::settings_

private

Definition at line 52 of file DupFitTrkKiller.h.

Referenced by filterAlg1().