---

TrajectoryCleanerBySharedHits Class Reference

A concrete TrajectoryCleaner that considers two trajectories to be mutually exclusive if they share more than some fraction of their hits. More...

#include <TrackingTools/TrajectoryCleaning/interface/TrajectoryCleanerBySharedHits.h>

Inheritance diagram for TrajectoryCleanerBySharedHits:

List of all members.

Public Types
typedef std::vector< Trajectory * >	TrajectoryPointerContainer
Public Member Functions
virtual void	clean (TrajectoryPointerContainer &) const
	TrajectoryCleanerBySharedHits ()
virtual	~TrajectoryCleanerBySharedHits ()

---

Detailed Description

A concrete TrajectoryCleaner that considers two trajectories to be mutually exclusive if they share more than some fraction of their hits.

The "best" trajectory of each set of mutually exclusive ones is kept, the others are eliminated. The goodness of a track is defined in terms of Chi^2, number of reconstructed hits, and number of lost hits.

Definition at line 16 of file TrajectoryCleanerBySharedHits.h.

---

Member Typedef Documentation

typedef std::vector<Trajectory*> TrajectoryCleanerBySharedHits::TrajectoryPointerContainer

Reimplemented from TrajectoryCleaner.

Definition at line 20 of file TrajectoryCleanerBySharedHits.h.

---

Constructor & Destructor Documentation

TrajectoryCleanerBySharedHits::TrajectoryCleanerBySharedHits

(

)

[inline]

Definition at line 22 of file TrajectoryCleanerBySharedHits.h.

{};

virtual TrajectoryCleanerBySharedHits::~TrajectoryCleanerBySharedHits

(

)

[inline, virtual]

Definition at line 23 of file TrajectoryCleanerBySharedHits.h.

{};

---

Member Function Documentation

void TrajectoryCleanerBySharedHits::clean

(

TrajectoryPointerContainer &

tc

)

const [virtual]

Implements TrajectoryCleaner.

Definition at line 9 of file TrajectoryCleanerBySharedHits.cc.

References Trajectory::invalidate(), TrackingRecHit::isValid(), it, and min.

Referenced by RoadSearchTrackCandidateMakerAlgorithm::PrepareTrackCandidates(), RoadSearchTrackCandidateMakerAlgorithm::run(), OutInConversionTrackFinder::tracks(), and InOutConversionTrackFinder::tracks().

{
  typedef vector<Trajectory*>::iterator TI;
  typedef map<const TransientTrackingRecHit*,vector<TI>,RecHitComparatorByPosition> RecHitMap; 
  typedef map<Trajectory*,int,less<Trajectory*> > TrajMap;  // for each Trajectory it stores the number of shared hits
  RecHitMap theRecHitMap;

  // start filling theRecHit
  for (TrajectoryCleaner::TrajectoryPointerIterator
         it = tc.begin(); it != tc.end(); it++) {
    Trajectory::DataContainer pd = (*it)->data();
    for (Trajectory::DataContainer::iterator im = pd.begin();
         im != pd.end(); im++) {
      //RC const TransientTrackingRecHit* theRecHit = ((*im).recHit());
      const TransientTrackingRecHit* theRecHit = &(*(*im).recHit());
      if (theRecHit->isValid())
        theRecHitMap[theRecHit].push_back(it);
    }
  }
  // end filling theRecHit

  // for each trajectory fill theTrajMap

  for (TrajectoryCleaner::TrajectoryPointerIterator
         itt = tc.begin(); itt != tc.end(); itt++) {
    if((*itt)->isValid()){  
      TrajMap theTrajMap;
      Trajectory::DataContainer pd = (*itt)->data();
      for (Trajectory::DataContainer::iterator im = pd.begin();
           im != pd.end(); im++) {
        //RC const TransientTrackingRecHit* theRecHit = ((*im).recHit());
        const TransientTrackingRecHit* theRecHit = &(*(*im).recHit());
        if (theRecHit->isValid()) {
          const vector<TI>& hitTrajectories( theRecHitMap[theRecHit]);
          for (vector<TI>::const_iterator ivec=hitTrajectories.begin(); 
               ivec!=hitTrajectories.end(); ivec++) {
            if (*ivec != itt){
              if ((**ivec)->isValid()){
                theTrajMap[**ivec]++;
              }
            }
          }
        }
      }
      //end filling theTrajMap

      // check for duplicated tracks
      if(!theTrajMap.empty() > 0){
        for(TrajMap::iterator imapp = theTrajMap.begin(); 
            imapp != theTrajMap.end(); imapp++){
          //          int nhit1 = (*itt).data().size();
          //          int nhit2 = (*imapp).first->data().size();
          int nhit1 = (*itt)->foundHits();
          int nhit2 = (*imapp).first->foundHits();
          if((*imapp).second >= min(nhit1, nhit2)/2){
            Trajectory* badtraj;
            if (nhit1 != nhit2)
              // select the shortest trajectory
              badtraj = (nhit1 > nhit2) ?
                (*imapp).first : *itt;
            else
              // select the trajectory with less chi squared
              badtraj = ((*imapp).first->chiSquared() > (*itt)->chiSquared()) ?
                (*imapp).first : *itt;
            badtraj->invalidate();  // invalidate this trajectory
          }
        }
      } 
    }
  }

}

---

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

• TrackingTools/TrajectoryCleaning/interface/TrajectoryCleanerBySharedHits.h
• TrackingTools/TrajectoryCleaning/src/TrajectoryCleanerBySharedHits.cc

---