FPGATrackSimOverlapRemovalTool Class Reference

Remove (mark) duplicate tracks This tool takes FPGATrackSimTrack as input and mark their status of passing/failing the overlap removal criteria. More...

#include <FPGATrackSimOverlapRemovalTool.h>

Inheritance diagram for FPGATrackSimOverlapRemovalTool:

Collaboration diagram for FPGATrackSimOverlapRemovalTool:

Public Member Functions
	FPGATrackSimOverlapRemovalTool (const std::string &, const std::string &, const IInterface *)
	FPGATrackSimOverlapRemovalTool ()=delete
StatusCode	initialize () override
StatusCode	runOverlapRemoval (std::vector< FPGATrackSimRoad > &roads)
StatusCode	runOverlapRemoval (std::vector< FPGATrackSimTrack > &tracks)
void	setDoSecondStage (bool v)
bool	getDoSecondStage () const
ORAlgo	getAlgorithm () const
StatusCode	removeOverlapping (FPGATrackSimTrack &track1, FPGATrackSimTrack &track2)
ServiceHandle< StoreGateSvc > &	evtStore ()
	The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.
const ServiceHandle< StoreGateSvc > &	detStore () const
	The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.
virtual StatusCode	sysInitialize () override
	Perform system initialization for an algorithm.
virtual StatusCode	sysStart () override
	Handle START transition.
virtual std::vector< Gaudi::DataHandle * >	inputHandles () const override
	Return this algorithm's input handles.
virtual std::vector< Gaudi::DataHandle * >	outputHandles () const override
	Return this algorithm's output handles.
Gaudi::Details::PropertyBase &	declareProperty (Gaudi::Property< T, V, H > &t)
void	updateVHKA (Gaudi::Details::PropertyBase &)
MsgStream &	msg () const
bool	msgLvl (const MSG::Level lvl) const

Static Public Member Functions
static bool	compareTrackQuality (const FPGATrackSimTrack &track1, const FPGATrackSimTrack &track2)

Protected Member Functions
void	renounceArray (SG::VarHandleKeyArray &handlesArray)
	remove all handles from I/O resolution
std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void >	renounce (T &h)
void	extraDeps_update_handler (Gaudi::Details::PropertyBase &ExtraDeps)
	Add StoreName to extra input/output deps as needed.

Private Types
typedef ServiceHandle< StoreGateSvc >	StoreGateSvc_t

Private Member Functions
StatusCode	runOverlapRemoval_fast (std::vector< FPGATrackSimTrack > &tracks)
StatusCode	runOverlapRemoval_v2 (std::vector< FPGATrackSimTrack > &tracks)
int	countOverlappingHits_v2 (const FPGATrackSimTrack &track1, const FPGATrackSimTrack &track2) const
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Static Private Member Functions
static bool	compareTrackQuality_v2 (const FPGATrackSimTrack &track1, const FPGATrackSimTrack &track2)
static int	countRealHits_v2 (const FPGATrackSimTrack &track)

Private Attributes
Gaudi::Property< bool >	m_do2ndStage { this, "DoSecondStage", false, "Do second stage of not?"}
Gaudi::Property< int >	m_NumOfHitPerGrouping { this, "NumOfHitPerGrouping", 5, "Number of hits pre grouping"}
Gaudi::Property< float >	m_minChi2 { this, "MinChi2", 40, "Minimum chi2 requirement for tracks being considered in OR"}
Gaudi::Property< bool >	m_roadSliceOR { this, "roadSliceOR", true, "Do slice-wise overlap removal for roads (Hough-only)"}
Gaudi::Property< int >	m_localMaxWindowSize { this, "localMaxWindowSize", 0, "Only create roads that are a local maximum within this window size. Set this to 0 to turn off local max filtering"}
Gaudi::Property< unsigned >	m_imageSize_x { this, "nBins_x", 0, "number of bins in, eg, phi_track"}
Gaudi::Property< unsigned >	m_imageSize_y { this, "nBins_y", 0, "number of bins in, eg, q/pT"}
Gaudi::Property< std::string >	m_algorithm { this, "ORAlgo", "Normal", "Overlap removal algorithm"}
Gaudi::Property< bool >	m_doFastOR { this, "doFastOR", false, "Use fast overlap removal algorithm instead of default"}
Gaudi::Property< bool >	m_compareAllHits {this, "compareAllHits", true, "Compare all hits to all other hits when comparing two tracks"}
Gaudi::Property< bool >	m_useV2OR {this, "useV2OR", true, "Use v2 overlap removal algorithm (worst-to-best sorting)"}
ToolHandle< GenericMonitoringTool >	m_monTool {this,"MonTool", "", "Monitoring tool"}
ORAlgo	m_algo {ORAlgo::Normal}
StoreGateSvc_t	m_evtStore
	Pointer to StoreGate (event store by default)
StoreGateSvc_t	m_detStore
	Pointer to StoreGate (detector store by default)
std::vector< SG::VarHandleKeyArray * >	m_vhka
bool	m_varHandleArraysDeclared

Detailed Description

Remove (mark) duplicate tracks This tool takes FPGATrackSimTrack as input and mark their status of passing/failing the overlap removal criteria.

Definition at line 35 of file FPGATrackSimOverlapRemovalTool.h.

Member Typedef Documentation

StoreGateSvc_t

typedef ServiceHandle<StoreGateSvc> AthCommonDataStore< AthCommonMsg< AlgTool > >::StoreGateSvc_t

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

FPGATrackSimOverlapRemovalTool() [1/2]

FPGATrackSimOverlapRemovalTool::FPGATrackSimOverlapRemovalTool	(	const std::string &	algname,
		const std::string &	name,
		const IInterface *	ifc )

Definition at line 14 of file FPGATrackSimOverlapRemovalTool.cxx.

                                                                                                                                     :
    AthAlgTool(algname, name, ifc)
{
}

FPGATrackSimOverlapRemovalTool() [2/2]

FPGATrackSimOverlapRemovalTool::FPGATrackSimOverlapRemovalTool ( )

delete

Member Function Documentation

compareTrackQuality()

bool FPGATrackSimOverlapRemovalTool::compareTrackQuality ( const FPGATrackSimTrack & track1, const FPGATrackSimTrack & track2 )

static

Definition at line 193 of file FPGATrackSimOverlapRemovalTool.cxx.

{
    std::vector<const FPGATrackSimHit*> hitsInTrack1;
    for ( auto& hit : track1.getFPGATrackSimHits()) {
        if (hit.isReal()) hitsInTrack1.push_back(&hit);
    }
 
    std::vector<const FPGATrackSimHit*> hitsInTrack2;
    for ( auto& hit: track2.getFPGATrackSimHits()){
        if (hit.isReal()) hitsInTrack2.push_back(&hit);
    }
 
    // If one track has more hits than the other, it's better.
    // Return true if track 2 is better than track 1.
    // Otherwise, decide based on chi2.
    bool goodOrder = true;
    if (hitsInTrack1.size() == hitsInTrack2.size()) {
      // Surprising number of cases where the chi2 is actually identical.
      // In these cases, let's default to the track ID number as the next most important property.
      // So put it higher since we are considering later tracks to be better.
      if (track1.getChi2ndof() == track2.getChi2ndof() && track1.getTrackID() < track2.getTrackID()) goodOrder = false; 
      // Now assuming they're different, we want them in decreasing chi2 order
      else if (track1.getChi2ndof() < track2.getChi2ndof()) goodOrder = false;
    } else if (hitsInTrack1.size() > hitsInTrack2.size()) {
      goodOrder = false;
    } 
 
    return goodOrder;
 
}

compareTrackQuality_v2()

bool FPGATrackSimOverlapRemovalTool::compareTrackQuality_v2 ( const FPGATrackSimTrack & track1, const FPGATrackSimTrack & track2 )

staticprivate

Definition at line 274 of file FPGATrackSimOverlapRemovalTool.cxx.

{
    // Count real hits in each track
    int nHits1 = countRealHits_v2(track1);
    int nHits2 = countRealHits_v2(track2);
 
    // Sort worst to best: fewer hits is worse, higher chi2 is worse
    // Return true if track1 should come before track2 (i.e., track1 is worse)
 
    // First compare number of hits
    if (nHits1 != nHits2) {
      return nHits1 < nHits2;  // Fewer hits = worse
    }
    
    // Same number of hits: compare chi2 (higher is worse)
    float chi2_1 = track1.getChi2ndof();
    float chi2_2 = track2.getChi2ndof();
    
    // Then compare chi2
    if (std::abs(chi2_1 - chi2_2) > std::numeric_limits<float>::epsilon()) {
      return chi2_1 > chi2_2;  // Higher chi2 = worse
    }
    
    // Tie-breaker:
    // in case of same number of hits and same chi2, use track ID (higher ID = worse)
    return track1.getTrackID() > track2.getTrackID();
}

countOverlappingHits_v2()

int FPGATrackSimOverlapRemovalTool::countOverlappingHits_v2 ( const FPGATrackSimTrack & track1, const FPGATrackSimTrack & track2 ) const

private

Definition at line 311 of file FPGATrackSimOverlapRemovalTool.cxx.

{
    // Use the existing functions from FPGATrackSimHoughFunctions
    if (m_compareAllHits) {
        return findNCommonHitsGlobal(track1, track2);
    } else {
        return findNCommonHits(track1, track2);
    }
}

countRealHits_v2()

int FPGATrackSimOverlapRemovalTool::countRealHits_v2 ( const FPGATrackSimTrack & track )

staticprivate

Definition at line 302 of file FPGATrackSimOverlapRemovalTool.cxx.

{
    int nHits = 0;
    for (const auto& hit : track.getFPGATrackSimHits()) {
        if (hit.isReal()) nHits++;
    }
    return nHits;
}

declareGaudiProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< AlgTool > >::declareGaudiProperty ( Gaudi::Property< T, V, H > & hndl, const SG::VarHandleKeyType &  )

inlineprivateinherited

specialization for handling Gaudi::Property<SG::VarHandleKey>

Definition at line 156 of file AthCommonDataStore.h.

  {
    return *AthCommonDataStore<PBASE>::declareProperty(hndl.name(),
                                                       hndl.value(), 
                                                       hndl.documentation());
 
  }

declareProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< AlgTool > >::declareProperty ( Gaudi::Property< T, V, H > & t )

inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

                                                                     {
    typedef typename SG::HandleClassifier<T>::type htype;
    return AthCommonDataStore<PBASE>::declareGaudiProperty(t, htype());
  }

detStore()

const ServiceHandle< StoreGateSvc > & AthCommonDataStore< AthCommonMsg< AlgTool > >::detStore ( ) const

inlineinherited

The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.

Definition at line 95 of file AthCommonDataStore.h.

{ return m_detStore; }

evtStore()

ServiceHandle< StoreGateSvc > & AthCommonDataStore< AthCommonMsg< AlgTool > >::evtStore ( )

inlineinherited

The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.

Definition at line 85 of file AthCommonDataStore.h.

{ return m_evtStore; }

extraDeps_update_handler()

void AthCommonDataStore< AthCommonMsg< AlgTool > >::extraDeps_update_handler ( Gaudi::Details::PropertyBase & ExtraDeps )

protectedinherited

Add StoreName to extra input/output deps as needed.

use the logic of the VarHandleKey to parse the DataObjID keys supplied via the ExtraInputs and ExtraOuputs Properties to add the StoreName if it's not explicitly given

getAlgorithm()

ORAlgo FPGATrackSimOverlapRemovalTool::getAlgorithm ( ) const

inline

Definition at line 51 of file FPGATrackSimOverlapRemovalTool.h.

{return m_algo;}

getDoSecondStage()

bool FPGATrackSimOverlapRemovalTool::getDoSecondStage ( ) const

inline

Definition at line 50 of file FPGATrackSimOverlapRemovalTool.h.

{ return m_do2ndStage; }

initialize()

StatusCode FPGATrackSimOverlapRemovalTool::initialize ( )

override

Definition at line 19 of file FPGATrackSimOverlapRemovalTool.cxx.

{
  ATH_MSG_INFO( "FPGATrackSimOverlapRemovalTool::initialize()" );
 
  if (!m_monTool.empty()) ATH_CHECK(m_monTool.retrieve());
 
  // Check road OR
  if (m_localMaxWindowSize && !m_roadSliceOR)
      ATH_MSG_WARNING("LocalMaxOR only being run per hough slice (i.e. this tool does nothing) since roadSliceOR is turned off");
 
 
  //  Setup OR algorithm
  if(m_algorithm == "Normal") m_algo=ORAlgo::Normal;
  else if(m_algorithm == "Invert") m_algo=ORAlgo::InvertGrouping;
  else
  {
    ATH_MSG_ERROR("initialize(): OR algorithm doesn't exist. ");
    return StatusCode::FAILURE;
  }
  ATH_MSG_DEBUG("Overlap removal algorithm is "<<m_algorithm.value());
 
  return StatusCode::SUCCESS;
}

inputHandles()

virtual std::vector< Gaudi::DataHandle * > AthCommonDataStore< AthCommonMsg< AlgTool > >::inputHandles ( ) const

overridevirtualinherited

Return this algorithm's input handles.

We override this to include handle instances from key arrays if they have not yet been declared. See comments on updateVHKA.

msg()

MsgStream & AthCommonMsg< AlgTool >::msg ( ) const

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                {
    return this->msgStream();
  }

msgLvl()

bool AthCommonMsg< AlgTool >::msgLvl ( const MSG::Level lvl ) const

inlineinherited

Definition at line 30 of file AthCommonMsg.h.

                                               {
    return this->msgLevel(lvl);
  }

outputHandles()

virtual std::vector< Gaudi::DataHandle * > AthCommonDataStore< AthCommonMsg< AlgTool > >::outputHandles ( ) const

overridevirtualinherited

Return this algorithm's output handles.

We override this to include handle instances from key arrays if they have not yet been declared. See comments on updateVHKA.

removeOverlapping()

StatusCode FPGATrackSimOverlapRemovalTool::removeOverlapping	(	FPGATrackSimTrack &	track1,
		FPGATrackSimTrack &	track2 )

Definition at line 120 of file FPGATrackSimOverlapRemovalTool.cxx.

                                                                                                                   {
 
    // Hit comparison
    struct HitCompare {
        bool operator()(const FPGATrackSimHit* a, const FPGATrackSimHit* b) const { 
            auto hash_a = a->getIdentifierHash();
            auto hash_b = b->getIdentifierHash();
            if ( hash_a == hash_b ) {
                auto phi_a = a->getPhiIndex();
                auto phi_b = b->getPhiIndex();
                if ( phi_a == phi_b ) {
                    auto eta_a = a->getEtaIndex();
                    auto eta_b = b->getEtaIndex();
                    if ( eta_a == eta_b) {
                        auto layer_a = a->getPhysLayer();
                        auto layer_b = b->getPhysLayer();
                        return layer_a < layer_b;
                    }
                    return eta_a < eta_b;
                }
                return phi_a < phi_b;
            }
            return hash_a <  hash_b; 
        }
    };
 
    std::set<const FPGATrackSimHit*, HitCompare > hitsInTrack1;
    for ( auto& hit : track1.getFPGATrackSimHits()) {
        if (hit.isReal()) hitsInTrack1.insert(&hit);
    }
 
    std::set<const FPGATrackSimHit*, HitCompare> hitsInTrack2;
    for ( auto& hit: track2.getFPGATrackSimHits()){
        if (hit.isReal()) hitsInTrack2.insert(&hit);
    }
 
    std::vector<const FPGATrackSimHit*> sharedHits;    
    std::set_intersection( hitsInTrack1.begin(), hitsInTrack1.end(), 
                         hitsInTrack2.begin(), hitsInTrack2.end(), 
                         std::back_inserter(sharedHits), 
                         HitCompare() );
 
    // Number of real hits in track 1, number of real hits in track 2, number of shared hits, number of non-shared hits (?)
    int nHitsInTrack1 = hitsInTrack1.size();
    int nHitsInTrack2 = hitsInTrack2.size();
    int nSharedHits = sharedHits.size();
    // Original version seems to be only track 1; I want to compare each pair only once so
    // let's make this the most conservative option (i.e. smallest number) ?
    int nonOverlappingHits = std::min(nHitsInTrack1 - nSharedHits, nHitsInTrack2 - nSharedHits);
 
    // Now check if these pass our criteria for overlapping. If not, just return.
    if(getAlgorithm() == ORAlgo::Normal) {
      // Here decision is based on number of overlapping hits.
      // Consider these overlapping if they share >= m_NumOfHitPerGrouping
      if(nSharedHits < m_NumOfHitPerGrouping) return StatusCode::SUCCESS;
 
    } else if(getAlgorithm() == ORAlgo::InvertGrouping) {
      // This is the opposite: duplicates of number of unique hits is <= m_NumOfHitPerGrouping.
      if(nonOverlappingHits > m_NumOfHitPerGrouping) return StatusCode::SUCCESS;
 
    } else {
      // Unknown.
      return StatusCode::FAILURE;
    }
 
    // Made it here: these tracks are overlapping. 
    // But we already sorted them such that track 2 is the one
    // we want to keep, so we can just set track 1 to be removed.
    track1.setPassedOR(0);
 
    return StatusCode::SUCCESS;
}

renounce()

std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void > AthCommonDataStore< AthCommonMsg< AlgTool > >::renounce ( T & h )

inlineprotectedinherited

Definition at line 380 of file AthCommonDataStore.h.

  {
    h.renounce();
    PBASE::renounce (h);
  }

renounceArray()

void AthCommonDataStore< AthCommonMsg< AlgTool > >::renounceArray ( SG::VarHandleKeyArray & handlesArray )

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

                                                          {
    handlesArray.renounce();
  }

runOverlapRemoval() [1/2]

StatusCode FPGATrackSimOverlapRemovalTool::runOverlapRemoval

(

std::vector< FPGATrackSimRoad > &

roads

)

Definition at line 66 of file FPGATrackSimOverlapRemovalTool.cxx.

{
    if (roads.empty()) return StatusCode::SUCCESS;
 
    if (!m_roadSliceOR) return StatusCode::SUCCESS;
    size_t in = roads.size();
 
    // Hough image
    vector2D<FPGATrackSimRoad*> acc(m_imageSize_y, m_imageSize_x);
 
    // Slice-wise duplicate removal: accept only one road (with most hits) per bin
    for (auto &r: roads)
    {
        FPGATrackSimRoad* & old = acc(r.getYBin(), r.getXBin());
        if (!old) old = new FPGATrackSimRoad (r);
        else if (r.getNHitLayers() > old->getNHitLayers()) *old = r;
        else if (r.getNHitLayers() == old->getNHitLayers() && r.getNHits() > old->getNHits()) *old = r;
    }
 
    // Reformat to vector
    roads.clear();
    for (unsigned y = 0; y < m_imageSize_y; y++)
      for (unsigned x = 0; x < m_imageSize_x; x++)
        if (FPGATrackSimRoad *tempPtr = acc(y, x); tempPtr && isLocalMax(acc, x, y, m_localMaxWindowSize)/*All-slices local max*/) {
          roads.emplace_back(*tempPtr);
          acc(y, x) = nullptr;
        }
        else {
          delete acc(y,x);
          acc(y,x) = nullptr;
        }
 
    ATH_MSG_DEBUG("Input: " << in << " Output: " << roads.size());
    return StatusCode::SUCCESS;
}

runOverlapRemoval() [2/2]

StatusCode FPGATrackSimOverlapRemovalTool::runOverlapRemoval

(

std::vector< FPGATrackSimTrack > &

tracks

)

Definition at line 102 of file FPGATrackSimOverlapRemovalTool.cxx.

{
 
  // Do fast OR instead of requested
  if (m_doFastOR) return runOverlapRemoval_fast(tracks);
 
  // Otherwise, proceed
  ATH_MSG_DEBUG("Beginning runOverlapRemoval()");
 
  ATH_MSG_DEBUG("Tracks in event: " << tracks.size());
 
 
  if (m_useV2OR)
    return runOverlapRemoval_v2(tracks);
  return ::runOverlapRemoval(tracks, m_minChi2.value(), m_NumOfHitPerGrouping, getAlgorithm(), m_monTool, m_compareAllHits);
}

runOverlapRemoval_fast()

StatusCode FPGATrackSimOverlapRemovalTool::runOverlapRemoval_fast ( std::vector< FPGATrackSimTrack > & tracks )

private

Definition at line 224 of file FPGATrackSimOverlapRemovalTool.cxx.

{
  ATH_MSG_DEBUG("Beginning fast overlap removal");
 
  // Sort tracks in order of increasing quality. 
  // This way, once a track has been eliminated in a comparison, we don't
  // need to check it against any other tracks - they will always be
  // better than it.
  std::sort(std::begin(tracks), 
            std::end(tracks), 
            compareTrackQuality); 
 
  // Now compare every pair of tracks.
  // Set passedOR to 0 for the worst one (first one)
  // if they are found to overlap.
  for (unsigned int i=0; i < tracks.size(); i++) {
 
    // Skip track i if bad chi2.
    if (tracks.at(i).getChi2ndof() > m_minChi2.value()) {
      tracks.at(i).setPassedOR(0);
      continue;
    }
 
    // Now check against all other tracks.
    for (unsigned int j=i+1; j< tracks.size(); j++) {
 
      // Uniquely comparing tracks i and j here.
 
      // If have set track i to 0 in a previous comparison, 
      // no need to look at it any more - we're done with it.
      if (!tracks.at(i).passedOR()) break;      
 
      // Ignore j if its chi2 is bad.
      if (tracks.at(j).getChi2ndof() > m_minChi2.value()) tracks.at(j).setPassedOR(0);
 
      // If we just set track j to zero for bad chi2,
      // no need to do the comparison.
      if (!tracks.at(j).passedOR()) continue;      
 
      // If we're still here, two at least semi-decent tracks.
      // Compare them and remove one if necessary.
      ATH_CHECK(removeOverlapping(tracks.at(i),tracks.at(j))); 
 
    }
  }
 
  return StatusCode::SUCCESS;
}

runOverlapRemoval_v2()

StatusCode FPGATrackSimOverlapRemovalTool::runOverlapRemoval_v2 ( std::vector< FPGATrackSimTrack > & tracks )

private

Definition at line 321 of file FPGATrackSimOverlapRemovalTool.cxx.

{
  ATH_MSG_DEBUG("Beginning v2 overlap removal on " << tracks.size() << " tracks");
 
  // First pass: mark tracks with bad chi2
  for (auto& track : tracks) {
    if (track.getChi2ndof() > m_minChi2.value()) {
      track.setPassedOR(0);
    }
  }
 
  // Sort tracks from worst to best quality using v2 comparison
  // After sorting: index 0 = worst track (fewest hits, highest chi2)
  //                last index = best track (most hits, lowest chi2)
  std::sort(tracks.begin(), tracks.end(), compareTrackQuality_v2);
 
  // Process from worst to best
  // For each track at index i, compare with better tracks (j > i)
  // If overlap found, mark track i as rejected and move to next
  for (size_t i = 0; i < tracks.size(); i++) {
    
    // Skip if already rejected (bad chi2 or previous overlap)
    if (!tracks[i].passedOR()) continue;
 
    // Compare with all better tracks (j > i)
    for (size_t j = i + 1; j < tracks.size(); j++) {
      
      // Skip if track j already rejected
      if (!tracks[j].passedOR()) continue;
 
      // Count overlapping hits
      int nOverlapping = countOverlappingHits_v2(tracks[i], tracks[j]);
 
      // Check if tracks overlap based on algorithm
      bool isOverlap = false;
      if (m_algo == ORAlgo::Normal) {
        isOverlap = (nOverlapping >= m_NumOfHitPerGrouping);
      } else if (m_algo == ORAlgo::InvertGrouping) {
        // For InvertGrouping: overlap if non-overlapping hits <= threshold
        int nHits_i = countRealHits_v2(tracks[i]);
        int nHits_j = countRealHits_v2(tracks[j]);
        int nonOverlapping = std::min(nHits_i - nOverlapping, nHits_j - nOverlapping);
        isOverlap = (nonOverlapping <= m_NumOfHitPerGrouping);
      }
 
      if (isOverlap) {
        // Track i overlaps with better track j -> reject track i
        tracks[i].setPassedOR(0);
        ATH_MSG_DEBUG("Track " << i << " rejected due to overlap with better track " << j);
        
        // No need to compare track i with any more tracks
        break;
      }
    }
  }
 
  // Count survivors for monitoring
  int nSurvivors = 0;
  for (const auto& track : tracks) {
    if (track.passedOR()) nSurvivors++;
  }
  ATH_MSG_DEBUG("V2 OR complete: " << nSurvivors << " tracks surviving out of " << tracks.size());
 
  return StatusCode::SUCCESS;
}

setDoSecondStage()

void FPGATrackSimOverlapRemovalTool::setDoSecondStage ( bool v )

inline

Definition at line 49 of file FPGATrackSimOverlapRemovalTool.h.

{ m_do2ndStage = v; }

sysInitialize()

virtual StatusCode AthCommonDataStore< AthCommonMsg< AlgTool > >::sysInitialize ( )

overridevirtualinherited

Perform system initialization for an algorithm.

We override this to declare all the elements of handle key arrays at the end of initialization. See comments on updateVHKA.

Reimplemented in asg::AsgMetadataTool, AthCheckedComponent< AthAlgTool >, AthCheckedComponent<::AthAlgTool >, and DerivationFramework::CfAthAlgTool.

sysStart()

virtual StatusCode AthCommonDataStore< AthCommonMsg< AlgTool > >::sysStart ( )

overridevirtualinherited

Handle START transition.

We override this in order to make sure that conditions handle keys can cache a pointer to the conditions container.

updateVHKA()

void AthCommonDataStore< AthCommonMsg< AlgTool > >::updateVHKA ( Gaudi::Details::PropertyBase & )

inlineinherited

Definition at line 308 of file AthCommonDataStore.h.

                                               {
    // debug() << "updateVHKA for property " << p.name() << " " << p.toString() 
    //         << "  size: " << m_vhka.size() << endmsg;
    for (auto &a : m_vhka) {
      std::vector<SG::VarHandleKey*> keys = a->keys();
      for (auto k : keys) {
        k->setOwner(this);
      }
    }
  }

Member Data Documentation

m_algo

ORAlgo FPGATrackSimOverlapRemovalTool::m_algo {ORAlgo::Normal}

private

Definition at line 73 of file FPGATrackSimOverlapRemovalTool.h.

{ORAlgo::Normal};       //  Internal ORAlgo enum for faster compare

m_algorithm

Gaudi::Property<std::string> FPGATrackSimOverlapRemovalTool::m_algorithm { this, "ORAlgo", "Normal", "Overlap removal algorithm"}

private

Definition at line 67 of file FPGATrackSimOverlapRemovalTool.h.

{ this, "ORAlgo", "Normal", "Overlap removal algorithm"};

m_compareAllHits

Gaudi::Property<bool> FPGATrackSimOverlapRemovalTool::m_compareAllHits {this, "compareAllHits", true, "Compare all hits to all other hits when comparing two tracks"}

private

Definition at line 69 of file FPGATrackSimOverlapRemovalTool.h.

{this, "compareAllHits", true, "Compare all hits to all other hits when comparing two tracks"};

m_detStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< AlgTool > >::m_detStore

privateinherited

Pointer to StoreGate (detector store by default)

Definition at line 393 of file AthCommonDataStore.h.

m_do2ndStage

Gaudi::Property<bool> FPGATrackSimOverlapRemovalTool::m_do2ndStage { this, "DoSecondStage", false, "Do second stage of not?"}

private

Definition at line 60 of file FPGATrackSimOverlapRemovalTool.h.

{ this, "DoSecondStage", false, "Do second stage of not?"};

m_doFastOR

Gaudi::Property<bool> FPGATrackSimOverlapRemovalTool::m_doFastOR { this, "doFastOR", false, "Use fast overlap removal algorithm instead of default"}

private

Definition at line 68 of file FPGATrackSimOverlapRemovalTool.h.

{ this, "doFastOR", false, "Use fast overlap removal algorithm instead of default"};

m_evtStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< AlgTool > >::m_evtStore

privateinherited

Pointer to StoreGate (event store by default)

Definition at line 390 of file AthCommonDataStore.h.

m_imageSize_x

Gaudi::Property<unsigned> FPGATrackSimOverlapRemovalTool::m_imageSize_x { this, "nBins_x", 0, "number of bins in, eg, phi_track"}

private

Definition at line 65 of file FPGATrackSimOverlapRemovalTool.h.

{ this, "nBins_x", 0, "number of bins in, eg, phi_track"};

m_imageSize_y

Gaudi::Property<unsigned> FPGATrackSimOverlapRemovalTool::m_imageSize_y { this, "nBins_y", 0, "number of bins in, eg, q/pT"}

private

Definition at line 66 of file FPGATrackSimOverlapRemovalTool.h.

{ this, "nBins_y", 0, "number of bins in, eg, q/pT"};

m_localMaxWindowSize

Gaudi::Property<int> FPGATrackSimOverlapRemovalTool::m_localMaxWindowSize { this, "localMaxWindowSize", 0, "Only create roads that are a local maximum within this window size. Set this to 0 to turn off local max filtering"}

private

Definition at line 64 of file FPGATrackSimOverlapRemovalTool.h.

{ this, "localMaxWindowSize", 0, "Only create roads that are a local maximum within this window size. Set this to 0 to turn off local max filtering"};

m_minChi2

Gaudi::Property<float> FPGATrackSimOverlapRemovalTool::m_minChi2 { this, "MinChi2", 40, "Minimum chi2 requirement for tracks being considered in OR"}

private

Definition at line 62 of file FPGATrackSimOverlapRemovalTool.h.

{ this, "MinChi2", 40, "Minimum chi2 requirement for tracks being considered in OR"};

m_monTool

ToolHandle<GenericMonitoringTool> FPGATrackSimOverlapRemovalTool::m_monTool {this,"MonTool", "", "Monitoring tool"}

private

Definition at line 71 of file FPGATrackSimOverlapRemovalTool.h.

{this,"MonTool", "", "Monitoring tool"};

m_NumOfHitPerGrouping

Gaudi::Property<int> FPGATrackSimOverlapRemovalTool::m_NumOfHitPerGrouping { this, "NumOfHitPerGrouping", 5, "Number of hits pre grouping"}

private

Definition at line 61 of file FPGATrackSimOverlapRemovalTool.h.

{ this, "NumOfHitPerGrouping", 5, "Number of hits pre grouping"};

m_roadSliceOR

Gaudi::Property<bool> FPGATrackSimOverlapRemovalTool::m_roadSliceOR { this, "roadSliceOR", true, "Do slice-wise overlap removal for roads (Hough-only)"}

private

Definition at line 63 of file FPGATrackSimOverlapRemovalTool.h.

{ this, "roadSliceOR", true, "Do slice-wise overlap removal for roads (Hough-only)"};

m_useV2OR

Gaudi::Property<bool> FPGATrackSimOverlapRemovalTool::m_useV2OR {this, "useV2OR", true, "Use v2 overlap removal algorithm (worst-to-best sorting)"}

private

Definition at line 70 of file FPGATrackSimOverlapRemovalTool.h.

{this, "useV2OR", true, "Use v2 overlap removal algorithm (worst-to-best sorting)"};

m_varHandleArraysDeclared

bool AthCommonDataStore< AthCommonMsg< AlgTool > >::m_varHandleArraysDeclared

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

m_vhka

std::vector<SG::VarHandleKeyArray*> AthCommonDataStore< AthCommonMsg< AlgTool > >::m_vhka

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

---

The documentation for this class was generated from the following files:

• FPGATrackSimOverlapRemovalTool.h
• FPGATrackSimOverlapRemovalTool.cxx