HoughSeedFinderAlg.cxx File Reference

Implementation of the Seed Finder Algorithm based on a Hough Transform. More...

#include "larreco/RecoAlg/Cluster3DAlgs/HoughSeedFinderAlg.h"
#include "art/Framework/Services/Registry/ServiceHandle.h"
#include "larcore/Geometry/Geometry.h"
#include "lardataobj/RecoBase/Seed.h"
#include "TCanvas.h"
#include "TDecompSVD.h"
#include "TFrame.h"
#include "TH2D.h"
#include "TMatrixD.h"
#include "TVectorD.h"
#include <memory>

Go to the source code of this file.

Classes
class	lar_cluster3d::AccumulatorValues
class	lar_cluster3d::HoughSeedFinderAlg::AccumulatorBin
class	lar_cluster3d::HoughSeedFinderAlg::SortHoughClusterList
struct	lar_cluster3d::HoughSeedFinderAlg::SortBinIndexList
struct	lar_cluster3d::Hit3DSetCompare
class	lar_cluster3d::OrderHitsAlongWire
struct	lar_cluster3d::OrderBestPlanes

Namespaces
	lar_cluster3d

Typedefs
typedef std::vector< AccumulatorValues >	lar_cluster3d::AccumulatorValuesVec

Functions
bool	lar_cluster3d::Hit3DCompare (const reco::ClusterHit3D *left, const reco::ClusterHit3D *right)

Detailed Description

Implementation of the Seed Finder Algorithm based on a Hough Transform.

The intent of this algorithm is to take an input list of 3D space points and from those to find candidate track start points and directions. It does so by first performing a Principal Components Analysis of the input 3D hits and then projects them to the plane of largest spread. A standard Hough Transform method is then applied to attempt to identify straight line segments which can be used as seeds to the kalman filter tracker.

Definition in file HoughSeedFinderAlg.cxx.