Class representing a cluster candidate during simple clustering of the SVD. More...

#include <SimpleClusterCandidate.h>

Collaboration diagram for SimpleClusterCandidate:

[legend]

Public Member Functions
	SimpleClusterCandidate (VxdID vxdID, bool isUside, int sizeHeadTail, double cutSeed, double cutAdjacent, double cutSNR, int timeAlgorithm)
	Constructor to create an empty Cluster.

	SimpleClusterCandidate (VxdID vxdID, bool isUside, int sizeHeadTail, double cutSeed, double cutAdjacent, double cutSNR, int timeAlgorithm, const std::string &storeShaperDigitsName, const std::string &storeRecoDigitsName)
	You can specify the name of StoreArray<SVDShaperDigit> and StoreArray<SVDRecoDigit>

bool	add (VxdID vxdID, bool isUside, struct stripInCluster &aStrip)
	Add a Strip to the current cluster.

void	finalizeCluster ()
	compute the position, time and their error of the cluster

bool	isGoodCluster ()
	return true if the cluster candidate can be promoted to cluster

VxdID	getSensorID ()
	return the VxdID of the cluster sensor

bool	isUSide ()
	return true if the cluster is on the U/P side

float	getCharge () const
	return the charge of the cluster

float	getChargeError () const
	return the error of the charge of the cluster

float	getSeedCharge () const
	return the seed charge of the cluster

float	getTime () const
	return the time of the cluster depending on the m_timeAlgorithm

float	get6SampleCoGTime () const
	return the time of the cluster for the 6-sample CoG

float	get3SampleCoGRawTime () const
	return the raw time of the cluster for the 3-sample CoG

float	get3SampleELSRawTime () const
	return the raw time of the cluster for the 3-sample ELS

float	getTimeError () const
	return the error on the time of the cluster depending on the m_timeAlgorithm, implemented only for the 6-Sample CoG

float	get6SampleCoGTimeError () const
	return the time of the cluster for the 6-sample CoG

float	get3SampleCoGTimeError () const
	return the time of the cluster for the 3-sample CoG

float	get3SampleELSTimeError () const
	return the time of the cluster for the 3-sample ELS

Belle2::SVDShaperDigit::APVFloatSamples	getClsSamples () const
	returns the APVFloatSamples obtained summing sample-by-sample all the strips on the cluster

std::pair< int, std::vector< float > >	getMaxSum3Samples () const
	returns the float vector of clustered 3-samples selected by the MaxSum method with First Frame of the selection

int	getFirstFrame ()
	return the first frame always 0 if 6-Sample CoG

float	getPosition () const
	return the position of the cluster

float	getPositionError () const
	return the error on the position of the cluster

float	getSNR () const
	return the signal over noise ratio of the cluster

int	size () const
	return the cluster size (number of strips of the cluster

const std::vector< stripInCluster >	getStripsInCluster () const
	returns the vector of the strips in the cluster

Protected Attributes
bool	m_stopCreationCluster = false
	cluster is not good if something goes wrong

VxdID	m_vxdID
	VxdID of the cluster.

bool	m_isUside
	side of the cluster

int	m_sizeHeadTail
	number of strips after which we switch from COG to HeadTail estimation of the position

double	m_cutSeed
	SNR above which the strip can be considered as seed.

double	m_cutAdjacent
	SNR above which the strip can be considered for clustering.

double	m_cutCluster
	SNR above which the cluster is ok.

int	m_timeAlgorithm = 0
	selects the algorithm to compute the cluster tim 0 = 6-sample CoG (default) 1 = 3-sample CoG 2 = 3-sample ELS

float	m_charge
	Charge of the cluster.

float	m_chargeError
	Error on Charge of the cluster.

float	m_seedCharge
	Seed Charge of the cluster.

float	m_6SampleTime
	Time of the cluster computed with the 6-sample CoG.

float	m_6SampleTimeError
	Error on Time of the cluster computed with the 6-sample CoG (not implemented yet)

float	m_position
	Position of the cluster.

float	m_positionError
	Error on Position of the cluster.

float	m_SNR
	SNR of the cluster.

float	m_seedSNR
	SNR of the seed strip.

int	m_seedIndex
	SVDRecoDigit index of the seed strip of the cluster.

std::vector< stripInCluster >	m_strips
	first frame selected with the max-sum algorithm

std::string	m_storeShaperDigitsName
	Name of the collection to use for the SVDShaperDigits.

std::string	m_storeRecoDigitsName
	Name of the collection to use for the SVDRecoDigits.

Detailed Description

Class representing a cluster candidate during simple clustering of the SVD.

Definition at line 40 of file SimpleClusterCandidate.h.

Constructor & Destructor Documentation

◆ SimpleClusterCandidate() [1/2]

SimpleClusterCandidate	(	VxdID	vxdID,
		bool	isUside,
		int	sizeHeadTail,
		double	cutSeed,
		double	cutAdjacent,
		double	cutSNR,
		int	timeAlgorithm
	)

Constructor to create an empty Cluster.

Definition at line 30 of file SimpleClusterCandidate.cc.

      : m_vxdID(vxdID)
      , m_isUside(isUside)
      , m_sizeHeadTail(sizeHeadTail)
      , m_cutSeed(cutSeed)
      , m_cutAdjacent(cutAdjacent)
      , m_cutCluster(cutCluster)
      , m_timeAlgorithm(timeAlgorithm)
      , m_charge(0)
      , m_chargeError(0)
      , m_seedCharge(0)
      , m_6SampleTime(0)
      , m_6SampleTimeError(0)
      , m_position(0)
      , m_positionError(0)
      , m_SNR(0)
      , m_seedSNR(0)
      , m_seedIndex(-1)
      , m_strips(4)
      , m_storeShaperDigitsName("SVDShaperDigits")
      , m_storeRecoDigitsName("SVDRecoDigits")
    {m_strips.clear();};

◆ SimpleClusterCandidate() [2/2]

SimpleClusterCandidate	(	VxdID	vxdID,
		bool	isUside,
		int	sizeHeadTail,
		double	cutSeed,
		double	cutAdjacent,
		double	cutSNR,
		int	timeAlgorithm,
		const std::string &	storeShaperDigitsName,
		const std::string &	storeRecoDigitsName
	)

You can specify the name of StoreArray<SVDShaperDigit> and StoreArray<SVDRecoDigit>

which are needed to get clustered samples.

Definition at line 54 of file SimpleClusterCandidate.cc.

      : m_vxdID(vxdID)
      , m_isUside(isUside)
      , m_sizeHeadTail(sizeHeadTail)
      , m_cutSeed(cutSeed)
      , m_cutAdjacent(cutAdjacent)
      , m_cutCluster(cutCluster)
      , m_timeAlgorithm(timeAlgorithm)
      , m_charge(0)
      , m_chargeError(0)
      , m_seedCharge(0)
      , m_6SampleTime(0)
      , m_6SampleTimeError(0)
      , m_position(0)
      , m_positionError(0)
      , m_SNR(0)
      , m_seedSNR(0)
      , m_seedIndex(-1)
      , m_strips(4)
      , m_storeShaperDigitsName(storeShaperDigitsName)
      , m_storeRecoDigitsName(storeRecoDigitsName)
    {m_strips.clear();};

Member Function Documentation

◆ add()

bool add	(	VxdID	vxdID,
		bool	isUside,
		struct stripInCluster &	aStrip
	)

Add a Strip to the current cluster.

Update the cluster seed seed.

Parameters

vxdID	sensorID
isUside	is u
aStrip	to add to the cluster

Returns: true if the strip is on the expected side and sensor and it's next to the last strip added to the cluster candidate

Definition at line 78 of file SimpleClusterCandidate.cc.

    {
 
      bool added = false;
 
      //do not add if you are on the wrong sensor or side
      if ((m_vxdID != vxdID) || (m_isUside != isUside))
        return false;
 
      //add if it's the first strip
      if (m_strips.size() == 0)
        added = true;
 
      //add if it adjacent to the last strip added
      //(we assume that SVDRecoDigits are ordered)
      if ((m_strips.size() > 0 && (aStrip.cellID == m_strips.at(m_strips.size() - 1).cellID + 1)))
        added  = true;
 
      //add it to the vector od strips, update the seed charge and index:
      if (added) {
        m_strips.push_back(aStrip);
 
        if (aStrip.charge > m_seedCharge) {
          m_seedCharge = aStrip.charge;
          m_seedSNR = aStrip.charge / aStrip.noise;
          m_seedIndex = m_strips.size() - 1;
        }
      }
      return added;
 
    };

◆ finalizeCluster()

void finalizeCluster ( )

compute the position, time and their error of the cluster

Definition at line 110 of file SimpleClusterCandidate.cc.

    {
 
      m_stopCreationCluster = false;
 
      const VXD::GeoCache& geo = VXD::GeoCache::getInstance();
      const VXD::SensorInfoBase& info = geo.getSensorInfo(m_vxdID);
 
      double pitch = m_isUside ? info.getUPitch() : info.getVPitch();
 
      int maxStripCellID = m_strips.at(m_strips.size() - 1).cellID;
      double maxStripCharge = m_strips.at(m_strips.size() - 1).charge;
      int minStripCellID = m_strips.at(0).cellID;
      double minStripCharge = m_strips.at(0).charge;
 
      int clusterSize = m_strips.size();
 
      double weightSum = 0;
      double noise = 0;
      for (auto aStrip : m_strips) {
        double stripPos = m_isUside ? info.getUCellPosition(aStrip.cellID) : info.getVCellPosition(aStrip.cellID);
        m_position += stripPos * aStrip.charge;
        m_charge += aStrip.charge;
        m_6SampleTime += aStrip.time * aStrip.charge;
 
        float tmp_sigmaSquared = aStrip.timeError * aStrip.timeError;
        weightSum +=  tmp_sigmaSquared;
        //FIXME: use error to weight the time of each strip in the cluster
        // it seems to yield a worst resolution vs EventT0 and an additional 1 ns bias
        //  m_6SampleTime += aStrip.time / tmp_sigmaSquared;
        // additional change also below: m_6SampleTime /= weightSum instead of m_6SampleTime/=m_charge
        noise += aStrip.noise * aStrip.noise;
      }
 
      if ((m_charge == 0) || (noise == 0)) {
        m_stopCreationCluster = true;
        return;
      }
 
      noise = sqrt(noise);
      m_6SampleTime /= m_charge;
      //      m_6SampleTime /= weightSum;
      m_6SampleTimeError = 1. / TMath::Sqrt(weightSum);
      m_SNR = m_charge / noise;
 
 
      if (clusterSize < m_sizeHeadTail) { // COG, size = 1 or 2
        m_position /= m_charge;
        // Compute position error
        if (clusterSize == 1) {
          // Add a strip charge equal to the zero-suppression threshold to compute the error
          double phantomCharge = m_cutAdjacent * m_strips.at(0).noise;
          m_positionError = pitch * phantomCharge / (m_charge + phantomCharge);
        } else {
          double a = m_cutAdjacent;
          if (m_strips.at(0).noise == 0) {
            m_stopCreationCluster = true;
            return;
          }
          double sn = m_charge / m_strips.at(0).noise;
          if (sn == 0) {
            m_stopCreationCluster = true;
            return;
          }
          m_positionError = a * pitch / sn;
        }
      } else { // Head-tail
        double centreCharge = (m_charge - minStripCharge - maxStripCharge) / (clusterSize - 2);
        if (centreCharge == 0) {
          m_stopCreationCluster = true;
          return;
        }
 
        minStripCharge = (minStripCharge < centreCharge) ? minStripCharge : centreCharge;
        maxStripCharge = (maxStripCharge < centreCharge) ? maxStripCharge : centreCharge;
        double minPos = m_isUside ? info.getUCellPosition(minStripCellID) : info.getVCellPosition(minStripCellID);
        double maxPos = m_isUside ? info.getUCellPosition(maxStripCellID) : info.getVCellPosition(maxStripCellID);
        m_position = 0.5 * (minPos + maxPos + (maxStripCharge - minStripCharge) / centreCharge * pitch);
 
        double sn = centreCharge / m_cutAdjacent / noise;
        // Rough estimates of Landau noise
        double landauHead = minStripCharge / centreCharge;
        double landauTail = maxStripCharge / centreCharge;
        m_positionError = 0.5 * pitch * sqrt(1.0 / sn / sn +
                                             0.5 * landauHead * landauHead +
                                             0.5 * landauTail * landauTail);
      }
 
      //Lorentz shift correction - PATCHED
      //NOTE: layer 3 is upside down with respect to L4,5,6 in the real data (real SVD), but _not_ in the simulation. We need to change the sign of the Lorentz correction on L3 only if reconstructing data, i.e. if Environment::Instance().isMC() is FALSE.
      const SensorInfo& sensorInfo = dynamic_cast<const SensorInfo&>(VXD::GeoCache::get(m_vxdID));
 
      bool isMC = Environment::Instance().isMC();
 
      if ((m_vxdID.getLayerNumber() == 3) && ! isMC)
        m_position += sensorInfo.getLorentzShift(m_isUside, m_position);
      else
        m_position -= sensorInfo.getLorentzShift(m_isUside, m_position);
 
    };

◆ get3SampleCoGRawTime()

float get3SampleCoGRawTime ( ) const

return the raw time of the cluster for the 3-sample CoG

Definition at line 258 of file SimpleClusterCandidate.cc.

    {
 
      //take the MaxSum 3 samples
      std::vector<float> clustered3s = getMaxSum3Samples().second;
      auto begin = clustered3s.begin();
      const auto end = clustered3s.end();
 
      //calculate 'raw' CoG3 hit-time
      constexpr auto stepSize = 16000. / 509; //APV25 clock period = 31.4 ns
      auto retval = 0., norm = 0.;
      for (auto step = 0.; begin != end; ++begin, step += stepSize) {
        norm += static_cast<double>(*begin);
        retval += static_cast<double>(*begin) * step;
      }
      float rawtime = retval / norm;
 
      return rawtime;
    }

◆ get3SampleCoGTimeError()

float get3SampleCoGTimeError ( ) const

return the time of the cluster for the 3-sample CoG

Definition at line 297 of file SimpleClusterCandidate.cc.

    {
 
      //no obvious way to compute the error yet
      return 6;
    }

◆ get3SampleELSRawTime()

float get3SampleELSRawTime ( ) const

return the raw time of the cluster for the 3-sample ELS

Definition at line 278 of file SimpleClusterCandidate.cc.

    {
 
      //take the MaxSum 3 samples
      std::vector<float> clustered3s = getMaxSum3Samples().second;
      const auto begin = clustered3s.begin();
 
      //calculate 'raw' ELS hit-time
      constexpr auto stepSize = 16000. / 509; //APV25 clock period = 31.4 ns
      constexpr auto tau = 55;//ELS time constant, default55
      auto num = 2 * stepSize * std::exp(-4 * stepSize / tau) + std::exp(-2 * stepSize / tau) * stepSize / 2 * (*begin - std::exp(
                   -2 * stepSize / tau) * (*(begin + 2))) / (*begin + std::exp(-stepSize / tau) * (*(begin + 1)) / 2);
      auto denom = 1 - std::exp(-4 * stepSize / tau) - (1 + std::exp(-2 * stepSize / tau) / 2) * (*begin - std::exp(
                     -2 * stepSize / tau) * (*(begin + 2))) / (*begin + std::exp(-stepSize / tau) * (*(begin + 1)) / 2);
      float rawtime = - num / denom;
 
      return rawtime;
 
    }

◆ get3SampleELSTimeError()

float get3SampleELSTimeError ( ) const

return the time of the cluster for the 3-sample ELS

Definition at line 304 of file SimpleClusterCandidate.cc.

    {
 
      //no obvious way to compute the error yet
      return 6;
    }

◆ get6SampleCoGTime()

float get6SampleCoGTime ( ) const

inline

return the time of the cluster for the 6-sample CoG

Definition at line 107 of file SimpleClusterCandidate.h.

107{ return m_6SampleTime; }

◆ get6SampleCoGTimeError()

float get6SampleCoGTimeError ( ) const

inline

return the time of the cluster for the 6-sample CoG

Definition at line 125 of file SimpleClusterCandidate.h.

125{ return m_6SampleTimeError; }

◆ getCharge()

float getCharge ( ) const

inline

return the charge of the cluster

Definition at line 88 of file SimpleClusterCandidate.h.

88{ return m_charge; }

◆ getChargeError()

float getChargeError ( ) const

inline

return the error of the charge of the cluster

Definition at line 93 of file SimpleClusterCandidate.h.

93{ return m_chargeError; }

◆ getClsSamples()

Belle2::SVDShaperDigit::APVFloatSamples getClsSamples ( ) const

returns the APVFloatSamples obtained summing sample-by-sample all the strips on the cluster

Definition at line 312 of file SimpleClusterCandidate.cc.

    {
 
      if (m_strips.size() == 0)
        B2ERROR(" you are asking fo the cluster samples for a cluster candidate with no strips, it make no sense to ask for the cluster time!");
 
      //steps:
      //1.loop on m_strips
      //2. access the index of the recodigit from the element of m_strip
      //3. get the shaperdigit related to the recodigit of index recoDigitIndex
      //4. sum each sample for each strip accessed in the loop
      //5. you are done
 
      Belle2::SVDShaperDigit::APVFloatSamples returnSamples = {0, 0, 0, 0, 0, 0};
      //FIXME: the name of the StoreArray of RecoDigits and ShaperDigits
      // must be taken from the SimpleClusterizer.
      const StoreArray<SVDRecoDigit> m_storeRecoDigits(m_storeRecoDigitsName.c_str());
      for (auto istrip : m_strips) {
        const SVDShaperDigit* shaperdigit = m_storeRecoDigits[istrip.recoDigitIndex]->getRelatedTo<SVDShaperDigit>
                                            (m_storeShaperDigitsName.c_str());
        if (!shaperdigit) B2ERROR("No shaperdigit for strip!?");
        Belle2::SVDShaperDigit::APVFloatSamples APVsamples = shaperdigit->getSamples();
        for (int iSample = 0; iSample < static_cast<int>(APVsamples.size()); ++iSample)
          returnSamples.at(iSample) += APVsamples.at(iSample);
      }
 
      return returnSamples;
    }

◆ getFirstFrame()

int getFirstFrame ( )

inline

return the first frame always 0 if 6-Sample CoG

Definition at line 152 of file SimpleClusterCandidate.h.

      {
        if (m_timeAlgorithm == 0)
          return 0;
        return getMaxSum3Samples().first;
      }

◆ getMaxSum3Samples()

std::pair< int, std::vector< float > > getMaxSum3Samples ( ) const

returns the float vector of clustered 3-samples selected by the MaxSum method with First Frame of the selection

Definition at line 341 of file SimpleClusterCandidate.cc.

    {
 
      //take the cluster samples
      Belle2::SVDShaperDigit::APVFloatSamples clsSamples = getClsSamples();
 
      //Max Sum selection
      if (clsSamples.size() < 3) B2ERROR("APV25 samples less than 3!?");
      std::vector<float> Sum2bin(clsSamples.size() - 1, 0);
      for (int iBin = 0; iBin < static_cast<int>(clsSamples.size()) - 1; ++iBin)
        Sum2bin.at(iBin) = clsSamples.at(iBin) + clsSamples.at(iBin + 1);
      auto itSum = std::max_element(std::begin(Sum2bin), std::end(Sum2bin));
      int ctrFrame = std::distance(std::begin(Sum2bin), itSum);
      if (ctrFrame == 0) ctrFrame = 1;
      std::vector<float> clustered3s = {clsSamples.at(ctrFrame - 1), clsSamples.at(ctrFrame), clsSamples.at(ctrFrame + 1)};
 
      return std::make_pair(ctrFrame - 1, clustered3s);
 
    }

◆ getPosition()

float getPosition ( ) const

inline

return the position of the cluster

Definition at line 162 of file SimpleClusterCandidate.h.

162{ return m_position; }

◆ getPositionError()

float getPositionError ( ) const

inline

return the error on the position of the cluster

Definition at line 167 of file SimpleClusterCandidate.h.

167{ return m_positionError; }

◆ getSeedCharge()

float getSeedCharge ( ) const

inline

return the seed charge of the cluster

Definition at line 98 of file SimpleClusterCandidate.h.

98{ return m_seedCharge; }

◆ getSensorID()

VxdID getSensorID ( )

inline

return the VxdID of the cluster sensor

Definition at line 78 of file SimpleClusterCandidate.h.

78{return m_vxdID;}

◆ getSNR()

float getSNR ( ) const

inline

return the signal over noise ratio of the cluster

Definition at line 172 of file SimpleClusterCandidate.h.

172{ return m_SNR; }

◆ getStripsInCluster()

const std::vector< stripInCluster > getStripsInCluster ( ) const

inline

returns the vector of the strips in the cluster

Definition at line 180 of file SimpleClusterCandidate.h.

180{ return m_strips; };

◆ getTime()

float getTime ( ) const

return the time of the cluster depending on the m_timeAlgorithm

Definition at line 228 of file SimpleClusterCandidate.cc.

    {
 
      if (m_timeAlgorithm == 0)
        return get6SampleCoGTime();
      else if (m_timeAlgorithm == 1)
        return get3SampleCoGRawTime();
      else if (m_timeAlgorithm == 2)
        return get3SampleELSRawTime();
      else {
        B2FATAL("unrecognized timeAlgorithm, please check the input parameter and select a value among {0 (6-sample CoG), 1 (3-sample CoG), 2 (3-sample ELS)} to select the algorithm that you want to reconstruct the cluster time");
        return 0;
      }
    }

◆ getTimeError()

float getTimeError ( ) const

return the error on the time of the cluster depending on the m_timeAlgorithm, implemented only for the 6-Sample CoG

Definition at line 243 of file SimpleClusterCandidate.cc.

    {
 
      if (m_timeAlgorithm == 0)
        return get6SampleCoGTimeError();
      else if (m_timeAlgorithm == 1)
        return get3SampleCoGTimeError();
      else if (m_timeAlgorithm == 2)
        return get3SampleELSTimeError();
      else {
        B2FATAL("unrecognized timeAlgorithm, please check the input parameter and select a value among {0 (6-sample CoG), 1 (3-sample CoG), 2 (3-sample ELS)} to select the algorithm that you want to reconstruct the cluster time");
        return 0;
      }
    }

◆ isGoodCluster()

bool isGoodCluster ( )

return true if the cluster candidate can be promoted to cluster

Definition at line 211 of file SimpleClusterCandidate.cc.

    {
 
      bool isGood = false;
 
      if (m_stopCreationCluster) {
        B2WARNING("Something is wrong in the cluster creation, this cluster will not be created!");
        return false;
      }
 
      if (m_seedCharge > 0 && m_seedSNR >= m_cutSeed && m_SNR >= m_cutCluster)
        isGood = true;
 
      return isGood;
    };

◆ isUSide()

bool isUSide ( )

inline

return true if the cluster is on the U/P side

Definition at line 83 of file SimpleClusterCandidate.h.

83{return m_isUside;}

◆ size()

int size ( ) const

inline

return the cluster size (number of strips of the cluster

Definition at line 177 of file SimpleClusterCandidate.h.

177{ return m_strips.size(); }

Member Data Documentation

◆ m_6SampleTime

float m_6SampleTime

protected

Time of the cluster computed with the 6-sample CoG.

Definition at line 222 of file SimpleClusterCandidate.h.

◆ m_6SampleTimeError

float m_6SampleTimeError

protected

Error on Time of the cluster computed with the 6-sample CoG (not implemented yet)

Definition at line 225 of file SimpleClusterCandidate.h.

◆ m_charge

float m_charge

protected

Charge of the cluster.

Definition at line 213 of file SimpleClusterCandidate.h.

◆ m_chargeError

float m_chargeError

protected

Error on Charge of the cluster.

Definition at line 216 of file SimpleClusterCandidate.h.

◆ m_cutAdjacent

double m_cutAdjacent

protected

SNR above which the strip can be considered for clustering.

Definition at line 200 of file SimpleClusterCandidate.h.

◆ m_cutCluster

double m_cutCluster

protected

SNR above which the cluster is ok.

Definition at line 203 of file SimpleClusterCandidate.h.

◆ m_cutSeed

double m_cutSeed

protected

SNR above which the strip can be considered as seed.

Definition at line 197 of file SimpleClusterCandidate.h.

◆ m_isUside

bool m_isUside

protected

side of the cluster

Definition at line 191 of file SimpleClusterCandidate.h.

◆ m_position

float m_position

protected

Position of the cluster.

Definition at line 228 of file SimpleClusterCandidate.h.

◆ m_positionError

float m_positionError

protected

Error on Position of the cluster.

Definition at line 231 of file SimpleClusterCandidate.h.

◆ m_seedCharge

float m_seedCharge

protected

Seed Charge of the cluster.

Definition at line 219 of file SimpleClusterCandidate.h.

◆ m_seedIndex

int m_seedIndex

protected

SVDRecoDigit index of the seed strip of the cluster.

Definition at line 240 of file SimpleClusterCandidate.h.

◆ m_seedSNR

float m_seedSNR

protected

SNR of the seed strip.

Definition at line 237 of file SimpleClusterCandidate.h.

◆ m_sizeHeadTail

int m_sizeHeadTail

protected

number of strips after which we switch from COG to HeadTail estimation of the position

Definition at line 194 of file SimpleClusterCandidate.h.

◆ m_SNR

float m_SNR

protected

SNR of the cluster.

Definition at line 234 of file SimpleClusterCandidate.h.

◆ m_stopCreationCluster

bool m_stopCreationCluster = false

protected

cluster is not good if something goes wrong

Definition at line 185 of file SimpleClusterCandidate.h.

◆ m_storeRecoDigitsName

std::string m_storeRecoDigitsName

protected

Name of the collection to use for the SVDRecoDigits.

Definition at line 252 of file SimpleClusterCandidate.h.

◆ m_storeShaperDigitsName

std::string m_storeShaperDigitsName

protected

Name of the collection to use for the SVDShaperDigits.

Definition at line 249 of file SimpleClusterCandidate.h.

◆ m_strips

std::vector<stripInCluster> m_strips

protected

first frame selected with the max-sum algorithm

vector containing the strips in the cluster

Definition at line 246 of file SimpleClusterCandidate.h.

◆ m_timeAlgorithm

int m_timeAlgorithm = 0

protected

selects the algorithm to compute the cluster tim 0 = 6-sample CoG (default) 1 = 3-sample CoG 2 = 3-sample ELS

Definition at line 210 of file SimpleClusterCandidate.h.

◆ m_vxdID

VxdID m_vxdID

protected

VxdID of the cluster.

Definition at line 188 of file SimpleClusterCandidate.h.

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

svd/reconstruction/include/SimpleClusterCandidate.h
svd/reconstruction/src/SimpleClusterCandidate.cc

Public Member Functions

Protected Attributes

Detailed Description

Constructor & Destructor Documentation

◆ SimpleClusterCandidate() [1/2]

◆ SimpleClusterCandidate() [2/2]

Member Function Documentation

◆ add()

◆ finalizeCluster()

◆ get3SampleCoGRawTime()

◆ get3SampleCoGTimeError()

◆ get3SampleELSRawTime()

◆ get3SampleELSTimeError()

◆ get6SampleCoGTime()

◆ get6SampleCoGTimeError()

◆ getCharge()

◆ getChargeError()

◆ getClsSamples()

◆ getFirstFrame()

◆ getMaxSum3Samples()

◆ getPosition()

◆ getPositionError()

◆ getSeedCharge()

◆ getSensorID()

◆ getSNR()

◆ getStripsInCluster()

◆ getTime()

◆ getTimeError()

◆ isGoodCluster()

◆ isUSide()

◆ size()

Member Data Documentation

◆ m_6SampleTime

◆ m_6SampleTimeError

◆ m_charge

◆ m_chargeError

◆ m_cutAdjacent

◆ m_cutCluster

◆ m_cutSeed

◆ m_isUside

◆ m_position

◆ m_positionError

◆ m_seedCharge

◆ m_seedIndex

◆ m_seedSNR

◆ m_sizeHeadTail

◆ m_SNR

◆ m_stopCreationCluster

◆ m_storeRecoDigitsName

◆ m_storeShaperDigitsName

◆ m_strips

◆ m_timeAlgorithm

◆ m_vxdID