A specific threshold-based pixel clustering algorithm. More...

#include <PixelThresholdClusterizerForBricked.h>

Inheritance diagram for PixelThresholdClusterizerForBricked:

Public Member Functions
void	clusterizeDetUnit (const edm::DetSet< PixelDigi > &input, const PixelGeomDetUnit pixDet, const TrackerTopology tTopo, const std::vector< short > &badChannels, edmNew::DetSetVector< SiPixelCluster >::FastFiller &output) override

void	clusterizeDetUnit (const edmNew::DetSet< SiPixelCluster > &input, const PixelGeomDetUnit pixDet, const TrackerTopology tTopo, const std::vector< short > &badChannels, edmNew::DetSetVector< SiPixelCluster >::FastFiller &output) override

	PixelThresholdClusterizerForBricked (edm::ParameterSet const &conf)

	~PixelThresholdClusterizerForBricked () override

Public Member Functions inherited from PixelThresholdClusterizer
	PixelThresholdClusterizer (edm::ParameterSet const &conf)

	~PixelThresholdClusterizer () override

Public Member Functions inherited from PixelClusterizerBase
void	setSiPixelGainCalibrationService (SiPixelGainCalibrationServiceBase *in)

virtual	~PixelClusterizerBase ()

Private Member Functions
template<typename T >
void	clusterizeDetUnitT (const T &input, const PixelGeomDetUnit pixDet, const TrackerTopology tTopo, const std::vector< short > &badChannels, edmNew::DetSetVector< SiPixelCluster >::FastFiller &output)
	Cluster pixels. This method operates on a matrix of pixels and finds the largest contiguous cluster around each seed pixel. Input and output data stored in DetSet. More...

SiPixelCluster	make_cluster_bricked (const SiPixelCluster::PixelPos &pix, edmNew::DetSetVector< SiPixelCluster >::FastFiller &output, bool isbarrel)
	The actual clustering algorithm: group the neighboring pixels around the seed. More...

Additional Inherited Members
Public Types inherited from PixelClusterizerBase
typedef edmNew::DetSet < SiPixelCluster > ::const_iterator	ClusterIterator

typedef edm::DetSet< PixelDigi > ::const_iterator	DigiIterator

Static Public Member Functions inherited from PixelThresholdClusterizer
static void	fillPSetDescription (edm::ParameterSetDescription &desc)

Protected Member Functions inherited from PixelThresholdClusterizer
int	calibrate (int adc, int col, int row)

void	clear_buffer (DigiIterator begin, DigiIterator end)
	Clear the internal buffer array. More...

void	clear_buffer (ClusterIterator begin, ClusterIterator end)

template<typename T >
void	clusterizeDetUnitT (const T &input, const PixelGeomDetUnit pixDet, const TrackerTopology tTopo, const std::vector< short > &badChannels, edmNew::DetSetVector< SiPixelCluster >::FastFiller &output)
	Cluster pixels. This method operates on a matrix of pixels and finds the largest contiguous cluster around each seed pixel. Input and output data stored in DetSet. More...

void	copy_to_buffer (DigiIterator begin, DigiIterator end)
	Copy adc counts from PixelDigis into the buffer, identify seeds. More...

void	copy_to_buffer (ClusterIterator begin, ClusterIterator end)

SiPixelCluster	make_cluster (const SiPixelCluster::PixelPos &pix, edmNew::DetSetVector< SiPixelCluster >::FastFiller &output)
	The actual clustering algorithm: group the neighboring pixels around the seed. More...

bool	setup (const PixelGeomDetUnit *pixDet)
	Private helper methods: More...

Protected Attributes inherited from PixelThresholdClusterizer
const bool	doMissCalibrate

const bool	doPhase2Calibration

const bool	doSplitClusters

SiPixelArrayBuffer	theBuffer
	Data storage. More...

std::vector< SiPixelCluster >	theClusters

const int	theClusterThreshold

const int	theClusterThreshold_L1

float	theClusterThresholdInNoiseUnits

const int	theConversionFactor

const int	theConversionFactor_L1

uint32_t	theDetid

const double	theElectronPerADCGain

std::vector< bool >	theFakePixels

int	theLayer

int	theNumOfCols

int	theNumOfRows
	Geometry-related information. More...

const int	theOffset

const int	theOffset_L1

const double	thePhase2DigiBaseline

const int	thePhase2KinkADC

const int	thePhase2ReadoutMode

const int	thePixelThreshold

float	thePixelThresholdInNoiseUnits
	Clustering-related quantities: More...

std::vector < SiPixelCluster::PixelPos >	theSeeds

const int	theSeedThreshold

float	theSeedThresholdInNoiseUnits

Protected Attributes inherited from PixelClusterizerBase
SiPixelGainCalibrationServiceBase *	theSiPixelGainCalibrationService_

Detailed Description

A specific threshold-based pixel clustering algorithm.

An explicit threshold-based clustering algorithm.

Same logic as the base class PixelThresholdClusterizer but specialized for bricked pixels topology

A threshold-based clustering algorithm which clusters SiPixelDigis into SiPixelClusters for each DetUnit. The algorithm is straightforward and purely topological: the clustering process starts with seed pixels and continues by adding adjacent pixels above the pixel threshold. Once the cluster is made, it has to be above the cluster threshold as well.

The clusterization is performed on a matrix with size equal to the size of the pixel detector, each cell containing the ADC count of the corresponding pixel. The matrix is reset after each clusterization.

The search starts from seed pixels, i.e. pixels with sufficiently large amplitudes, found at the time of filling of the matrix and stored in a

At this point the noise and dead channels are ignored, but soon they won't be.

SiPixelCluster contains a barrycenter, but it should be noted that that information is largely useless. One must use a PositionEstimator class to compute the RecHit position and its error for every given cluster.

Author: Largely copied from NewPixelClusterizer in ORCA written by Danek Kotlinski (PSI). Ported to CMSSW by Petar Maksimovic (JHU). DetSetVector data container implemented by V.Chiochia (Uni Zurich)

Sets the PixelArrayBuffer dimensions and pixel thresholds. Makes clusters and stores them in theCache if the option useCache has been set.

Definition at line 46 of file PixelThresholdClusterizerForBricked.h.

Constructor & Destructor Documentation

PixelThresholdClusterizerForBricked::PixelThresholdClusterizerForBricked ( edm::ParameterSet const & conf )

Constructor: Initilize the buffer to hold pixels from a detector module. This is a vector of 44k ints, stays valid all the time.

Definition at line 29 of file PixelThresholdClusterizerForBricked.cc.

30 : PixelThresholdClusterizer(conf) {}

PixelThresholdClusterizer::PixelThresholdClusterizer

PixelThresholdClusterizer(edm::ParameterSet const &conf)

Definition: PixelThresholdClusterizer.cc:43

PixelThresholdClusterizerForBricked::~PixelThresholdClusterizerForBricked ( )

override

Definition at line 32 of file PixelThresholdClusterizerForBricked.cc.

32 {}

Member Function Documentation

void PixelThresholdClusterizerForBricked::clusterizeDetUnit	(	const edm::DetSet< PixelDigi > &	input,
		const PixelGeomDetUnit *	pixDet,
		const TrackerTopology *	tTopo,
		const std::vector< short > &	badChannels,
		edmNew::DetSetVector< SiPixelCluster >::FastFiller &	output
	)

inlineoverridevirtual

Reimplemented from PixelThresholdClusterizer.

Definition at line 52 of file PixelThresholdClusterizerForBricked.h.

References PixelThresholdClusterizer::clusterizeDetUnitT().

                                                                                         {
     clusterizeDetUnitT(input, pixDet, tTopo, badChannels, output);
   }

void PixelThresholdClusterizerForBricked::clusterizeDetUnit	(	const edmNew::DetSet< SiPixelCluster > &	input,
		const PixelGeomDetUnit *	pixDet,
		const TrackerTopology *	tTopo,
		const std::vector< short > &	badChannels,
		edmNew::DetSetVector< SiPixelCluster >::FastFiller &	output
	)

inlineoverridevirtual

Reimplemented from PixelThresholdClusterizer.

Definition at line 59 of file PixelThresholdClusterizerForBricked.h.

References PixelThresholdClusterizer::clusterizeDetUnitT().

                                                                                         {
     clusterizeDetUnitT(input, pixDet, tTopo, badChannels, output);
   }

template<typename T >

void PixelThresholdClusterizerForBricked::clusterizeDetUnitT	(	const T &	input,
		const PixelGeomDetUnit *	pixDet,
		const TrackerTopology *	tTopo,
		const std::vector< short > &	badChannels,
		edmNew::DetSetVector< SiPixelCluster >::FastFiller &	output
	)

private

Cluster pixels. This method operates on a matrix of pixels and finds the largest contiguous cluster around each seed pixel. Input and output data stored in DetSet.

Definition at line 42 of file PixelThresholdClusterizerForBricked.cc.

                                                                                                                    {
   typename T::const_iterator begin = input.begin();
   typename T::const_iterator end = input.end();
 
   edm::LogInfo("PixelThresholdClusterizerForBricked::clusterizeDetUnitT()");
 
   // this should never happen and the raw2digi does not create empty detsets
   if (begin == end) {
     edm::LogError("PixelThresholdClusterizerForBricked")
         << "@SUB=PixelThresholdClusterizerForBricked::clusterizeDetUnitT()"
         << " No digis to clusterize";
   }
 
   //  Set up the clusterization on this DetId.
   if (!setup(pixDet))
     return;
 
   theDetid = input.detId();
 
   bool isBarrel = (DetId(theDetid).subdetId() == PixelSubdetector::PixelBarrel);
   // Set separate cluster threshold for L1 (needed for phase1)
   auto clusterThreshold = theClusterThreshold;
   theLayer = (DetId(theDetid).subdetId() == 1) ? tTopo->pxbLayer(theDetid) : 0;
   if (theLayer == 1)
     clusterThreshold = theClusterThreshold_L1;
 
   //  Copy PixelDigis to the buffer array; select the seed pixels
   //  on the way, and store them in theSeeds.
   if (end > begin)
     copy_to_buffer(begin, end);
 
   assert(output.empty());
   //  Loop over all seeds.  TO DO: wouldn't using iterators be faster?
   for (unsigned int i = 0; i < theSeeds.size(); i++) {
     // Gavril : The charge of seeds that were already inlcuded in clusters is set to 1 electron
     // so we don't want to call "make_cluster" for these cases
     if (theBuffer(theSeeds[i]) >= theSeedThreshold) {  // Is this seed still valid?
       //  Make a cluster around this seed
       SiPixelCluster cluster;
       if ((&pixDet->specificTopology())->isBricked()) {
         cluster = make_cluster_bricked(theSeeds[i], output, isBarrel);
       } else {
         cluster = make_cluster(theSeeds[i], output);
       }
 
       //  Check if the cluster is above threshold
       // (TO DO: one is signed, other unsigned, gcc warns...)
       if (cluster.charge() >= clusterThreshold) {
         // sort by row (x)
         output.push_back(std::move(cluster));
         std::push_heap(output.begin(), output.end(), [](SiPixelCluster const& cl1, SiPixelCluster const& cl2) {
           return cl1.minPixelRow() < cl2.minPixelRow();
         });
       }
     }
   }
   // sort by row (x)   maybe sorting the seed would suffice....
   std::sort_heap(output.begin(), output.end(), [](SiPixelCluster const& cl1, SiPixelCluster const& cl2) {
     return cl1.minPixelRow() < cl2.minPixelRow();
   });
 
   // Erase the seeds.
   theSeeds.clear();
 
   //  Need to clean unused pixels from the buffer array.
   clear_buffer(begin, end);
 
   theFakePixels.clear();
 }

SiPixelCluster PixelThresholdClusterizerForBricked::make_cluster_bricked	(	const SiPixelCluster::PixelPos &	pix,
		edmNew::DetSetVector< SiPixelCluster >::FastFiller &	output,
		bool	isbarrel
	)

private

The actual clustering algorithm: group the neighboring pixels around the seed.

Definition at line 119 of file PixelThresholdClusterizerForBricked.cc.

Referenced by clusterizeDetUnitT().

                                                                                                             {
   //First we acquire the seeds for the clusters
   int seed_adc;
   stack<SiPixelCluster::PixelPos, vector<SiPixelCluster::PixelPos> > dead_pixel_stack;
 
   //The individual modules have been loaded into a buffer.
   //After each pixel has been considered by the clusterizer, we set the adc count to 1
   //to mark that we have already considered it.
   //The only difference between dead/noisy pixels and standard ones is that for dead/noisy pixels,
   //We consider the charge of the pixel to always be zero.
 
   seed_adc = theBuffer(pix.row(), pix.col());
   theBuffer.set_adc(pix, 1);
 
   AccretionCluster acluster;
   acluster.add(pix, seed_adc);
 
   //Here we search all pixels adjacent to all pixels in the cluster.
   bool dead_flag = false;
   while (!acluster.empty()) {
     //This is the standard algorithm to find and add a pixel
     auto curInd = acluster.top();
     acluster.pop();
 
     for (auto r = std::max(0, int(acluster.x[curInd]) - 1); r < std::min(int(acluster.x[curInd]) + 2, theBuffer.rows());
          ++r) {
       int LowerAccLimity = 0;
       int UpperAccLimity = 0;
 
       if (r % 2 == int(acluster.x[curInd]) % 2) {
         LowerAccLimity = std::max(0, int(acluster.y[curInd]) - 1);
         UpperAccLimity = std::min(int(acluster.y[curInd]) + 2, theBuffer.columns());
       }
 
       else {
         int parity_curr = int(acluster.x[curInd]) % 2;
         int parity_hit = r % 2;
 
         LowerAccLimity = std::max(0, int(acluster.y[curInd]) - parity_hit);
         UpperAccLimity = std::min(int(acluster.y[curInd]) + parity_curr + 1, theBuffer.columns());
       }
 
       /*
     for (auto c = std::max(0, int(acluster.y[curInd]) - 1);
     c < std::min(int(acluster.y[curInd]) + 2, theBuffer.columns());
     ++c)
       */
       for (auto c = LowerAccLimity; c < UpperAccLimity; ++c) {
         if (theBuffer(r, c) >= thePixelThreshold) {
           SiPixelCluster::PixelPos newpix(r, c);
           if (!acluster.add(newpix, theBuffer(r, c)))
             goto endClus;
           if (isbarrel)
             edm::LogInfo("make_cluster_bricked()") << "add" << r << c << theBuffer(r, c);
           theBuffer.set_adc(newpix, 1);
           //std::cout<<"col "<<c<<" row "<<r<<std::endl;
         }
       }
     }
 
   }  // while accretion
 endClus:
   SiPixelCluster cluster(acluster.isize, acluster.adc, acluster.x, acluster.y, acluster.xmin, acluster.ymin);
   //Here we split the cluster, if the flag to do so is set and we have found a dead or noisy pixel.
 
   if (dead_flag && doSplitClusters) {
     // Set separate cluster threshold for L1 (needed for phase1)
     auto clusterThreshold = theClusterThreshold;
     if (theLayer == 1)
       clusterThreshold = theClusterThreshold_L1;
 
     //Set the first cluster equal to the existing cluster.
     SiPixelCluster first_cluster = cluster;
     bool have_second_cluster = false;
     while (!dead_pixel_stack.empty()) {
       //consider each found dead pixel
       SiPixelCluster::PixelPos deadpix = dead_pixel_stack.top();
       dead_pixel_stack.pop();
       theBuffer.set_adc(deadpix, 1);
 
       //Clusterize the split cluster using the dead pixel as a seed
       SiPixelCluster second_cluster = make_cluster_bricked(deadpix, output, isbarrel);
 
       //If both clusters would normally have been found by the clusterizer, put them into output
       if (second_cluster.charge() >= clusterThreshold && first_cluster.charge() >= clusterThreshold) {
         output.push_back(second_cluster);
         have_second_cluster = true;
       }
 
       //We also want to keep the merged cluster in data and let the RecHit algorithm decide which set to keep
       //This loop adds the second cluster to the first.
       const std::vector<SiPixelCluster::Pixel>& branch_pixels = second_cluster.pixels();
       for (unsigned int i = 0; i < branch_pixels.size(); i++) {
         int temp_x = branch_pixels[i].x;
         int temp_y = branch_pixels[i].y;
         int temp_adc = branch_pixels[i].adc;
         SiPixelCluster::PixelPos newpix(temp_x, temp_y);
         cluster.add(newpix, temp_adc);
       }
     }
 
     //Remember to also add the first cluster if we added the second one.
     if (first_cluster.charge() >= clusterThreshold && have_second_cluster) {
       output.push_back(first_cluster);
       std::push_heap(output.begin(), output.end(), [](SiPixelCluster const& cl1, SiPixelCluster const& cl2) {
         return cl1.minPixelRow() < cl2.minPixelRow();
       });
     }
   }
 
   return cluster;
 }

Public Member Functions

Private Member Functions

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

Member Function Documentation