TrajectoryCleanerMerger Class Reference

#include <TrajectoryCleanerMerger.h>

Inheritance diagram for TrajectoryCleanerMerger:

Public Member Functions
virtual void	clean (TrajectoryPointerContainer &) const
void	clean (TrajectoryContainer &trajs) const
	TrajectoryCleanerMerger (const edm::ParameterSet &iConfig)
virtual	~TrajectoryCleanerMerger ()
Public Member Functions inherited from TrajectoryCleaner
	TrajectoryCleaner ()
	TrajectoryCleaner (edm::ParameterSet &iConfig)
virtual	~TrajectoryCleaner ()

Private Member Functions
int	getLayer (const DetId &id) const
void	reOrderMeasurements (Trajectory &traj) const
bool	sameSeed (const TrajectorySeed &s1, const TrajectorySeed &s2) const

Additional Inherited Members
Public Types inherited from TrajectoryCleaner
typedef TrackingComponentsRecord	Record
typedef std::vector< Trajectory >	TrajectoryContainer
typedef TrajectoryContainer::iterator	TrajectoryIterator
typedef std::vector< Trajectory * >	TrajectoryPointerContainer
typedef TrajectoryPointerContainer::iterator	TrajectoryPointerIterator

Detailed Description

Definition at line 6 of file TrajectoryCleanerMerger.h.

Constructor & Destructor Documentation

TrajectoryCleanerMerger::TrajectoryCleanerMerger ( const edm::ParameterSet &  iConfig )

inline

Definition at line 9 of file TrajectoryCleanerMerger.h.

{};

virtual TrajectoryCleanerMerger::~TrajectoryCleanerMerger ( )

inlinevirtual

Definition at line 10 of file TrajectoryCleanerMerger.h.

{};

Member Function Documentation

void TrajectoryCleanerMerger::clean ( TrajectoryPointerContainer &  ) const

virtual

Implements TrajectoryCleaner.

Definition at line 131 of file TrajectoryCleanerMerger.cc.

{
}

void TrajectoryCleanerMerger::clean ( TrajectoryContainer &  trajs ) const

virtual

Reimplemented from TrajectoryCleaner.

Definition at line 227 of file TrajectoryCleanerMerger.cc.

References benchmark_cfg::cerr, i, TrackingRecHit::isValid(), j, keep, python.multivaluedict::map(), match(), min, convertSQLiteXML::ok, and funct::true.

{
  if(trajs.size() == 0) return;

  // Fill the rechit map
  typedef std::map<const TransientTrackingRecHit*,
              std::vector<unsigned int>, HitComparator> RecHitMap; 
  RecHitMap recHitMap;

  std::vector<bool> keep(trajs.size(),true);

  for(unsigned int i = 0; i < trajs.size(); i++) 
  {
    std::vector<TrajectoryMeasurement> meas = trajs[i].measurements();

    for(std::vector<TrajectoryMeasurement>::iterator im = meas.begin();
                                                im!= meas.end(); im++)
      if(im->recHit()->isValid())
      {
        const TransientTrackingRecHit* recHit = &(*(im->recHit()));
        if(recHit->isValid())
          recHitMap[recHit].push_back(i);
      }
  }

  // Look at each track
  typedef std::map<unsigned int,int,less<unsigned int> > TrajMap;

  for(unsigned int i = 0; i < trajs.size(); i++)
  if(keep[i])
  {  
    TrajMap trajMap;
    std::vector<DetId> detIds;
    std::vector<int> detLayers;

    // Go trough all rechits of this track
    std::vector<TrajectoryMeasurement> meas = trajs[i].measurements();
    for(std::vector<TrajectoryMeasurement>::iterator im = meas.begin();
                                                im!= meas.end(); im++)
    {
      if(im->recHit()->isValid())
      {
        // Get trajs sharing this rechit
        const TransientTrackingRecHit* recHit = &(*(im->recHit()));
        const std::vector<unsigned int>& sharing(recHitMap[recHit]);

        for(std::vector<unsigned int>::const_iterator j = sharing.begin(); 
                                                 j!= sharing.end(); j++)
          if(i < *j) trajMap[*j]++;

        // Fill detLayers vector
        detIds.push_back(recHit->geographicalId());
        detLayers.push_back(getLayer(recHit->geographicalId()));
      }
    }

    // Check for trajs with shared rechits
    for(TrajMap::iterator sharing = trajMap.begin();
                          sharing!= trajMap.end(); sharing++)
    {
      unsigned int j = (*sharing).first;
      if(!keep[i] || !keep[j]) continue;

      // More than 50% shared
      if((*sharing).second > min(trajs[i].foundHits(),
                                 trajs[j].foundHits())/2)
      {
        if( sameSeed(trajs[i].seed(), trajs[j].seed()) )
        {
        bool hasCommonLayer = false;

/*
        std::vector<TrajectoryMeasurement> measi = trajs[i].measurements();
        std::vector<TrajectoryMeasurement> measj = trajs[j].measurements();
        for(std::vector<TrajectoryMeasurement>::iterator
              tmj = measj.begin(); tmj!= measj.end(); tmj++)
            if(find(measi.begin(), measi.end(), tmj) == measi.end())
            if(find(detLayers.begin(),detLayers.end(),
                    getLayer(tmj->recHit()->geographicalId()))
                                   != detLayers.end())
             hasCommonLayer = true;
*/

        if(hasCommonLayer == false)
        { // merge tracks, add separate hits of the second to the first one
        std::vector<TrajectoryMeasurement> measj = trajs[j].measurements();
        for(std::vector<TrajectoryMeasurement>::iterator
             tmj = measj.begin(); tmj!= measj.end(); tmj++)
        if(tmj->recHit()->isValid())
        {
          bool match = false;

          std::vector<TrajectoryMeasurement> measi = trajs[i].measurements();
          for(std::vector<TrajectoryMeasurement>::iterator
             tmi = measi.begin(); tmi!= measi.end(); tmi++)
          if(tmi->recHit()->isValid())
            if(!HitComparator()(&(*(tmi->recHit())),
                                &(*(tmj->recHit()))) &&
               !HitComparator()(&(*(tmj->recHit())),
                                &(*(tmi->recHit()))))
            { match = true ; break; }

          if(!match)
            trajs[i].push(*tmj);
        }

        // Remove second track
        keep[j] = false;
        }
        else
        {
          // remove track with higher impact / chi2
          if(trajs[i].chiSquared() < trajs[j].chiSquared())
            keep[j] = false;
          else
            keep[i] = false;
        }
        }
      }
    } 
  }

  // Final copy
  int ok = 0;
  for(unsigned int i = 0; i < trajs.size(); i++)
    if(keep[i])
    {
      reOrderMeasurements(trajs[i]);
      ok++;
    }
    else
      trajs[i].invalidate();

  std::cerr << " [TrajecCleaner] cleaned trajs : " << ok << "/" << trajs.size() <<
" (with " << trajs[0].measurements().size() << "/" << recHitMap.size() << " hits)" << std::endl;
}

int TrajectoryCleanerMerger::getLayer ( const DetId &  id ) const

private

Definition at line 196 of file TrajectoryCleanerMerger.cc.

References PXFDetId::disk(), PXBDetId::ladder(), PXBDetId::layer(), TOBDetId::layer(), TIBDetId::layer(), TOBDetId::module(), TIBDetId::module(), PXFDetId::panel(), evf::utils::pid, PixelSubdetector::PixelBarrel, PixelSubdetector::PixelEndcap, TIDDetId::ring(), TECDetId::ring(), StripSubdetector::TEC, StripSubdetector::TIB, StripSubdetector::TID, StripSubdetector::TOB, TIDDetId::wheel(), and TECDetId::wheel().

{
  // PXB layer, ladder -> (layer - 1)<<2 + (ladder-1)%2
  // PXF disk , panel
  // TIB layer, module 
  // TOB layer, module
  // TID wheel, ring
  // TEC wheel, ring

  if(id.subdetId() == (unsigned int) PixelSubdetector::PixelBarrel)
  { PXBDetId pid(id); return (100 * id.subdetId()+ ((pid.layer() - 1)<<1) + (pid.ladder() - 1)%2); }

  if(id.subdetId() == (unsigned int) PixelSubdetector::PixelEndcap)
  { PXFDetId pid(id); return (100 * id.subdetId()+ ((pid.disk()  - 1)<<1) + (pid.panel()  - 1)%2); }

  if(id.subdetId() == StripSubdetector::TIB)
  { TIBDetId pid(id); return (100 * id.subdetId()+ ((pid.layer() - 1)<<1) + (pid.module() - 1)%2); }
  if(id.subdetId() == StripSubdetector::TOB)
  { TOBDetId pid(id); return (100 * id.subdetId()+ ((pid.layer() - 1)<<1) + (pid.module() - 1)%2); }

  if(id.subdetId() == StripSubdetector::TID)
  { TIDDetId pid(id); return (100 * id.subdetId()+ ((pid.wheel() - 1)<<1) + (pid.ring()   - 1)%2); }
  if(id.subdetId() == StripSubdetector::TEC)
  { TECDetId pid(id); return (100 * id.subdetId()+ ((pid.wheel() - 1)<<1) + (pid.ring()   - 1)%2); }

  return 0;
}

void TrajectoryCleanerMerger::reOrderMeasurements ( Trajectory &  traj ) const

private

Definition at line 136 of file TrajectoryCleanerMerger.cc.

References i, Trajectory::measurements(), Trajectory::pop(), Trajectory::push(), and std::swap().

{
  std::vector<TrajectoryMeasurement> meas_ = traj.measurements();
  std::vector<TrajectoryMeasurement> meas;

  for(std::vector<TrajectoryMeasurement>::iterator
       im = meas_.begin();
       im!= meas_.end(); im++)
    if(im->recHit()->isValid())
       meas.push_back(*im);

  bool changed;

  do
  {
    changed = false;

    for(std::vector<TrajectoryMeasurement>::iterator im = meas.begin();
                                                im!= meas.end()-1; im++)
    if(    (*im).recHit()->globalPosition().mag2() >
       (*(im+1)).recHit()->globalPosition().mag2() + 1e-6)
    {
      swap(*im,*(im+1));
      changed = true;
    }
  }
  while(changed);

  for(unsigned int i = 0 ; i < meas.size(); i++)
     traj.pop();

  for(std::vector<TrajectoryMeasurement>::iterator im = meas.begin();
                                              im!= meas.end(); im++)
    traj.push(*im);
}

bool TrajectoryCleanerMerger::sameSeed ( const TrajectorySeed &  s1, const TrajectorySeed &  s2  ) const

private

Definition at line 172 of file TrajectoryCleanerMerger.cc.

References TrackingRecHit::all, TrajectorySeed::nHits(), and TrajectorySeed::recHits().

{
  if(s1.nHits() != s2.nHits()) return false;

  TrajectorySeed::range r1 = s1.recHits();
  TrajectorySeed::range r2 = s2.recHits();

  TrajectorySeed::const_iterator h1 = r1.first;
  TrajectorySeed::const_iterator h2 = r2.first;

  do
  {
    if(!(h1->sharesInput(&(*h2),TrackingRecHit::all)))
      return false;

    h1++; h2++;
  }
  while(h1 != s1.recHits().second && 
        h2 != s2.recHits().second);

  return true;
}