|
|
|
#include <RoadSearchTrackListCleaner.h>
Public Member Functions | |
| virtual void | produce (edm::Event &e, const edm::EventSetup &c) |
| RoadSearchTrackListCleaner (const edm::ParameterSet &conf) | |
| virtual | ~RoadSearchTrackListCleaner () |
Private Attributes | |
| edm::ParameterSet | conf_ |
Definition at line 28 of file RoadSearchTrackListCleaner.h.
| cms::RoadSearchTrackListCleaner::RoadSearchTrackListCleaner | ( | const edm::ParameterSet & | conf | ) | [explicit] |
Definition at line 46 of file RoadSearchTrackListCleaner.cc.
:
conf_(conf)
{
produces<reco::TrackCollection>();
// produces<reco::TrackExtraCollection>();
}
| cms::RoadSearchTrackListCleaner::~RoadSearchTrackListCleaner | ( | ) | [virtual] |
Definition at line 55 of file RoadSearchTrackListCleaner.cc.
{ }
| void cms::RoadSearchTrackListCleaner::produce | ( | edm::Event & | e, |
| const edm::EventSetup & | c | ||
| ) | [virtual] |
Implements edm::EDProducer.
Definition at line 58 of file RoadSearchTrackListCleaner.cc.
References conf_, edm::EventSetup::get(), edm::Event::getByLabel(), edm::ParameterSet::getParameter(), i, j, convertSQLitetoXML_cfg::output, edm::Handle< T >::product(), edm::Event::put(), reco::Track::setExtra(), and reco::TrackBase::setHitPattern().
{
// retrieve producer name of input SiStripRecHit2DCollection
std::string trackProducer = conf_.getParameter<std::string>("TrackProducer");
double maxNormalizedChisq = conf_.getParameter<double>("MaxNormalizedChisq");
double minPT = conf_.getParameter<double>("MinPT");
unsigned int minFound = (unsigned int)conf_.getParameter<int>("MinFound");
//
// extract tracker geometry
//
edm::ESHandle<TrackerGeometry> theG;
es.get<TrackerDigiGeometryRecord>().get(theG);
// using namespace reco;
// get Inputs
edm::Handle<reco::TrackCollection> trackCollection;
e.getByLabel(trackProducer, trackCollection);
const reco::TrackCollection tC = *(trackCollection.product());
//std::cout << "Reconstructed "<< tC.size() << " tracks" << std::endl ;
// Step B: create empty output collection
std::auto_ptr<reco::TrackCollection> output(new reco::TrackCollection);
//
// no input tracks
//
if ( tC.empty() ){
// LogDebug("RoadSearch") << "Found " << output.size() << " clouds.";
e.put(output);
return;
}
//
// quality cuts first
//
std::vector<int> selected; for (unsigned int i=0; i<tC.size(); ++i){selected.push_back(1);}
int i=-1;
for (reco::TrackCollection::const_iterator track=tC.begin(); track!=tC.end(); track++){
i++;
if ((short unsigned)track->ndof() < 1){
selected[i]=0;
//std::cout << "Track "<< i << " rejected in TrackListCleaner; ndof() < 1" << std::endl ;
continue;
}
if (track->normalizedChi2() > maxNormalizedChisq){
selected[i]=0;
//std::cout << "Track "<< i << " rejected in TrackListCleaner; normalizedChi2() > maxNormalizedChisq " << track->normalizedChi2() << " " << maxNormalizedChisq << std::endl ;
continue;
}
if (track->found() < minFound){
selected[i]=0;
//std::cout << "Track "<< i << " rejected in TrackListCleaner; found() < minFound " << track->found() << " " << minFound << std::endl ;
continue;
}
if (track->pt() < minPT){
selected[i]=0;
//std::cout << "Track "<< i << " rejected in TrackListCleaner; pt() < minPT " << track->pt() << " " << minPT << std::endl ;
continue;
}
}//end loop over tracks
//
// > 1 track - try merging
//
if ( 1<tC.size() ){
int i=-1;
for (reco::TrackCollection::const_iterator track=tC.begin(); track!=tC.end(); track++){
i++;
//std::cout << "Track number "<< i << std::endl ;
if (!selected[i])continue;
int j=-1;
for (reco::TrackCollection::const_iterator track2=tC.begin(); track2!=tC.end(); track2++){
j++;
if ((j<=i)||(!selected[j])||(!selected[i]))continue;
int noverlap=0;
for (trackingRecHit_iterator it = track->recHitsBegin(); it != track->recHitsEnd(); it++){
if ((*it)->isValid()){
for (trackingRecHit_iterator jt = track2->recHitsBegin(); jt != track2->recHitsEnd(); jt++){
if ((*jt)->isValid()){
if (((*it)->geographicalId()==(*jt)->geographicalId())&&((*it)->localPosition().x()==(*jt)->localPosition().x()))noverlap++;
}
}
}
}
float fi=float(noverlap)/float(track->recHitsSize()); float fj=float(noverlap)/float(track2->recHitsSize());
//std::cout << " trk1 trk2 nhits1 nhits2 nover " << i << " " << j << " " << track->recHitsSize() << " " << track2->recHitsSize() << " " << noverlap << " " << fi << " " << fj <<std::endl;
if ((fi>0.66)||(fj>0.66)){
if (fi<fj){
selected[j]=0;
//std::cout << " removing 2nd trk in pair " << std::endl;
}else{
if (fi>fj){
selected[i]=0;
//std::cout << " removing 1st trk in pair " << std::endl;
}else{
//std::cout << " removing worst chisq in pair " << std::endl;
if (track->chi2() > track2->chi2()){selected[i]=0;}else{selected[j]=0;}
}//end fi > or = fj
}//end fi < fj
}//end got a duplicate
}//end track2 loop
}//end track loop
}//end more than 1 track
//
// output selected tracks - if any
//
i=-1;
for (reco::TrackCollection::const_iterator track=tC.begin(); track!=tC.end(); track++){
i++; if (!selected[i])continue;
reco::Track * theTrack = new reco::Track(track->chi2(),
(short unsigned)track->ndof(),
track->innerPosition(),
track->innerMomentum(),
track->charge(),
track->innerStateCovariance());
//fill the TrackCollection
reco::TrackExtraRef theTrackExtraRef=track->extra();
theTrack->setExtra(theTrackExtraRef);
theTrack->setHitPattern((*theTrackExtraRef).recHits());
output->push_back(*theTrack);
delete theTrack;
}//end faux loop over tracks
e.put(output);
return;
}//end produce
Definition at line 39 of file RoadSearchTrackListCleaner.h.
Referenced by produce().
1.7.3