#include <SplitShowersTool.h>

Inheritance diagram for lar_content::SplitShowersTool:

Public Member Functions
	SplitShowersTool ()
	Default constructor. More...

bool	Run (ThreeViewShowersAlgorithm *const pAlgorithm, TensorType &overlapTensor)
	Run the algorithm tool. More...

Private Member Functions
void	FindSplitShowers (ThreeViewShowersAlgorithm *const pAlgorithm, const TensorType &overlapTensor, ClusterMergeMap &clusterMergeMap) const
	Find split showers, using information from the overlap tensor. More...

bool	PassesElementCuts (TensorType::ElementList::const_iterator eIter, const pandora::ClusterSet &usedClusters) const
	Whether a provided (iterator to a) tensor element passes the selection cuts for undershoots identification. More...

void	SelectTensorElements (TensorType::ElementList::const_iterator eIter, const TensorType::ElementList &elementList, const pandora::ClusterSet &usedClusters, IteratorList &iteratorList) const
	Select elements representing possible components of interest due to undershoots in clustering. More...

void	FindShowerMerges (ThreeViewShowersAlgorithm *const pAlgorithm, const IteratorList &iteratorList, pandora::ClusterSet &usedClusters, ClusterMergeMap &clusterMergeMap) const
	Get cluster merges specific elements of the tensor. More...

bool	CheckClusterProximities (ThreeViewShowersAlgorithm *const pAlgorithm, const pandora::ClusterList &clusterList) const
	Check the clusters in a provided cluster list are in suitable proximity for merging. More...

bool	CheckClusterVertexRelations (ThreeViewShowersAlgorithm *const pAlgorithm, const pandora::ClusterList &clusterList) const
	Check the consistency of the clusters in a provided cluster list with the event vertex, if available. More...

bool	CheckClusterSplitPositions (ThreeViewShowersAlgorithm *const pAlgorithm, const pandora::ClusterList &clusterListU, const pandora::ClusterList &clusterListV, const pandora::ClusterList &clusterListW) const
	Check the consistency of the split positions in the provided u, v and w cluster lists. More...

void	GetSplitXDetails (ThreeViewShowersAlgorithm const pAlgorithm, const pandora::Cluster const pClusterA, const pandora::Cluster *const pClusterB, float &splitXPosition, float &overlapX) const
	Get the x coordinate representing the midpoint between two clusters (hypothesis: clusters represent a split shower) More...

void	SpecifyClusterMerges (ThreeViewShowersAlgorithm *const pAlgorithm, const pandora::ClusterList &clusterList, ClusterMergeMap &clusterMergeMap) const
	Populate the cluster merge map, based on the information contained in the provided cluster list. More...

bool	ApplyChanges (ThreeViewShowersAlgorithm *const pAlgorithm, const ClusterMergeMap &clusterMergeMap) const
	Apply the changes cached in a cluster merge map and update the tensor accordingly. More...

pandora::StatusCode	ReadSettings (const pandora::TiXmlHandle xmlHandle)

Private Attributes
unsigned int	m_nCommonClusters
	The number of common clusters. More...

float	m_minMatchedFraction
	The min matched sampling point fraction for use as a key tensor element. More...

unsigned int	m_minMatchedSamplingPoints
	The min number of matched sampling points for use as a key tensor element. More...

bool	m_checkClusterProximities
	Whether to check the proximities of the candidate split shower clusters. More...

float	m_maxClusterSeparation
	The maximum separation for clusters to be merged. More...

bool	m_checkClusterVertexRelations
	Whether to check the consistency of the clusters with the event vertex. More...

float	m_minVertexLongitudinalDistance
	Vertex association check: min longitudinal distance cut. More...

float	m_maxVertexLongitudinalDistance
	Vertex association check: max longitudinal distance cut. More...

float	m_maxVertexTransverseDistance
	Vertex association check: max transverse distance cut. More...

float	m_vertexAngularAllowance
	Vertex association check: pointing angular allowance in degrees. More...

unsigned int	m_maxVertexAssociations
	The maximum number of vertex associations for clusters to be merged. More...

bool	m_checkClusterSplitPositions
	Whether to check the cluster split positions, if there are splits in multiple views. More...

float	m_vetoMergeXDifference
	The x distance between split positions in two views below which may refuse a merge. More...

float	m_vetoMergeXOverlap
	The x overlap between candidate cluster sliding fits below which may refuse a merge. More...

Additional Inherited Members
Public Types inherited from lar_content::ShowerTensorTool
typedef ThreeViewShowersAlgorithm::MatchingType::TensorType	TensorType

typedef std::vector < TensorType::ElementList::const_iterator >	IteratorList

Detailed Description

SplitShowersTool class.

Definition at line 19 of file SplitShowersTool.h.

Constructor & Destructor Documentation

lar_content::SplitShowersTool::SplitShowersTool ( )

Default constructor.

Definition at line 24 of file SplitShowersTool.cc.

                                    :
     m_nCommonClusters(2),
     m_minMatchedFraction(0.25f),
     m_minMatchedSamplingPoints(40),
     m_checkClusterProximities(true),
     m_maxClusterSeparation(25.f),
     m_checkClusterVertexRelations(true),
     m_minVertexLongitudinalDistance(-2.5f),
     m_maxVertexLongitudinalDistance(20.f),
     m_maxVertexTransverseDistance(1.5f),
     m_vertexAngularAllowance(3.f),
     m_maxVertexAssociations(1),
     m_checkClusterSplitPositions(false),
     m_vetoMergeXDifference(2.f),
     m_vetoMergeXOverlap(2.f)
 {
 }

Member Function Documentation

bool lar_content::SplitShowersTool::ApplyChanges	(	ThreeViewShowersAlgorithm *const	pAlgorithm,
		const ClusterMergeMap &	clusterMergeMap
	)		const

private

Apply the changes cached in a cluster merge map and update the tensor accordingly.

Parameters

pAlgorithm	address of the calling algorithm
clusterMergeMap	the cluster merge map

Returns: whether changes to the tensor have been made

Definition at line 366 of file SplitShowersTool.cc.

 {
     ClusterMergeMap consolidatedMergeMap;
 
     ClusterList clusterList;
     for (const auto &mapEntry : clusterMergeMap)
         clusterList.push_back(mapEntry.first);
     clusterList.sort(LArClusterHelper::SortByNHits);
 
     for (const Cluster *const pParentCluster : clusterList)
     {
         const ClusterList &daughterClusters(clusterMergeMap.at(pParentCluster));
 
         for (const Cluster *const pDaughterCluster : daughterClusters)
         {
             if (consolidatedMergeMap.count(pDaughterCluster))
                 throw StatusCodeException(STATUS_CODE_FAILURE);
         }
 
         ClusterList &targetClusterList(consolidatedMergeMap[pParentCluster]);
         targetClusterList.insert(targetClusterList.end(), daughterClusters.begin(), daughterClusters.end());
     }
 
     return pAlgorithm->MakeClusterMerges(consolidatedMergeMap);
 }

bool lar_content::SplitShowersTool::CheckClusterProximities	(	ThreeViewShowersAlgorithm *const	pAlgorithm,
		const pandora::ClusterList &	clusterList
	)		const

private

Check the clusters in a provided cluster list are in suitable proximity for merging.

Parameters

pAlgorithm	address of the calling algorithm
clusterList	the cluster list

Definition at line 221 of file SplitShowersTool.cc.

 {
     if (1 == clusterList.size())
         return true;
 
     if (2 != clusterList.size())
         throw StatusCodeException(STATUS_CODE_FAILURE);
 
     const Cluster *const pCluster1(*(clusterList.begin()));
     const Cluster *const pCluster2(*(++(clusterList.begin())));
 
     const float outer12(LArClusterHelper::GetClosestDistance(pCluster1->GetCentroid(pCluster1->GetOuterPseudoLayer()), pCluster2));
     const float outer21(LArClusterHelper::GetClosestDistance(pCluster2->GetCentroid(pCluster2->GetOuterPseudoLayer()), pCluster1));
     const float inner12(LArClusterHelper::GetClosestDistance(pCluster1->GetCentroid(pCluster1->GetInnerPseudoLayer()), pCluster2));
     const float inner21(LArClusterHelper::GetClosestDistance(pCluster2->GetCentroid(pCluster2->GetInnerPseudoLayer()), pCluster1));
 
     if ((outer12 > m_maxClusterSeparation) && (outer21 > m_maxClusterSeparation) && (inner12 > m_maxClusterSeparation) && (inner21 > m_maxClusterSeparation))
         return false;
 
     return true;
 }

bool lar_content::SplitShowersTool::CheckClusterSplitPositions	(	ThreeViewShowersAlgorithm *const	pAlgorithm,
		const pandora::ClusterList &	clusterListU,
		const pandora::ClusterList &	clusterListV,
		const pandora::ClusterList &	clusterListW
	)		const

private

Check the consistency of the split positions in the provided u, v and w cluster lists.

Parameters

pAlgorithm	address of the calling algorithm
clusterListU	the u cluster list
clusterListV	the v cluster list
clusterListW	the w cluster list

Definition at line 288 of file SplitShowersTool.cc.

 {
     const unsigned int nClustersU(clusterListU.size()), nClustersV(clusterListV.size()), nClustersW(clusterListW.size());
     const unsigned int nClustersProduct(nClustersU * nClustersV * nClustersW);
 
     if (2 == nClustersProduct)
         return true;
 
     const ClusterList &clusterList1((1 == nClustersU) ? clusterListV : clusterListU);
     const ClusterList &clusterList2((1 == nClustersU) ? clusterListW : (1 == nClustersV) ? clusterListW : clusterListV);
 
     if ((2 != clusterList1.size()) || (2 != clusterList2.size()))
         throw StatusCodeException(STATUS_CODE_FAILURE);
 
     float splitXPosition1(0.f), overlapX1(0.f);
     this->GetSplitXDetails(pAlgorithm, *(clusterList1.begin()), *(++(clusterList1.begin())), splitXPosition1, overlapX1);
 
     float splitXPosition2(0.f), overlapX2(0.f);
     this->GetSplitXDetails(pAlgorithm, *(clusterList2.begin()), *(++(clusterList2.begin())), splitXPosition2, overlapX2);
 
     if ((std::fabs(splitXPosition1 - splitXPosition2) < m_vetoMergeXDifference) && (overlapX1 < m_vetoMergeXOverlap) && (overlapX2 < m_vetoMergeXOverlap))
         return false;
 
     return true;
 }

bool lar_content::SplitShowersTool::CheckClusterVertexRelations	(	ThreeViewShowersAlgorithm *const	pAlgorithm,
		const pandora::ClusterList &	clusterList
	)		const

private

Check the consistency of the clusters in a provided cluster list with the event vertex, if available.

Parameters

pAlgorithm	address of the calling algorithm
clusterList	the cluster list

Definition at line 245 of file SplitShowersTool.cc.

 {
     const VertexList *pVertexList(NULL);
     PANDORA_RETURN_RESULT_IF(STATUS_CODE_SUCCESS, !=, PandoraContentApi::GetCurrentList(*pAlgorithm, pVertexList));
     const Vertex *const pVertex(
         ((pVertexList->size() == 1) && (VERTEX_3D == (*(pVertexList->begin()))->GetVertexType())) ? *(pVertexList->begin()) : NULL);
 
     if (NULL == pVertex)
         return true;
 
     unsigned int nVertexAssociations(0);
 
     for (ClusterList::const_iterator iter = clusterList.begin(), iterEnd = clusterList.end(); iter != iterEnd; ++iter)
     {
         try
         {
             const HitType hitType(LArClusterHelper::GetClusterHitType(*iter));
             const CartesianVector vertex2D(LArGeometryHelper::ProjectPosition(this->GetPandora(), pVertex->GetPosition(), hitType));
             const LArPointingCluster pointingCluster(pAlgorithm->GetCachedSlidingFitResult(*iter).GetShowerFitResult());
 
             if (LArPointingClusterHelper::IsNode(vertex2D, pointingCluster.GetInnerVertex(), m_minVertexLongitudinalDistance, m_maxVertexTransverseDistance) ||
                 LArPointingClusterHelper::IsNode(vertex2D, pointingCluster.GetOuterVertex(), m_minVertexLongitudinalDistance, m_maxVertexTransverseDistance) ||
                 LArPointingClusterHelper::IsEmission(vertex2D, pointingCluster.GetInnerVertex(), m_minVertexLongitudinalDistance,
                     m_maxVertexLongitudinalDistance, m_maxVertexTransverseDistance, m_vertexAngularAllowance) ||
                 LArPointingClusterHelper::IsEmission(vertex2D, pointingCluster.GetOuterVertex(), m_minVertexLongitudinalDistance,
                     m_maxVertexLongitudinalDistance, m_maxVertexTransverseDistance, m_vertexAngularAllowance))
             {
                 ++nVertexAssociations;
             }
         }
         catch (StatusCodeException &)
         {
         }
     }
 
     if (nVertexAssociations > m_maxVertexAssociations)
         return false;
 
     return true;
 }

void lar_content::SplitShowersTool::FindShowerMerges	(	ThreeViewShowersAlgorithm *const	pAlgorithm,
		const IteratorList &	iteratorList,
		pandora::ClusterSet &	usedClusters,
		ClusterMergeMap &	clusterMergeMap
	)		const

private

Get cluster merges specific elements of the tensor.

Parameters

pAlgorithm	address of the calling algorithm
iteratorList	list of iterators to relevant tensor elements
usedClusters	the list of used clusters
clusterMergeMap	to be populated with cluster merges

Definition at line 149 of file SplitShowersTool.cc.

 {
     for (IteratorList::const_iterator iIter1 = iteratorList.begin(), iIter1End = iteratorList.end(); iIter1 != iIter1End; ++iIter1)
     {
         for (IteratorList::const_iterator iIter2 = iIter1; iIter2 != iIter1End; ++iIter2)
         {
             try
             {
                 if (iIter1 == iIter2)
                     continue;
 
                 const TensorType::Element &element1(*(*iIter1));
                 const TensorType::Element &element2(*(*iIter2));
 
                 ClusterList clusterListU(1, element1.GetClusterU());
                 if (element1.GetClusterU() != element2.GetClusterU())
                     clusterListU.push_back(element2.GetClusterU());
 
                 ClusterList clusterListV(1, element1.GetClusterV());
                 if (element1.GetClusterV() != element2.GetClusterV())
                     clusterListV.push_back(element2.GetClusterV());
 
                 ClusterList clusterListW(1, element1.GetClusterW());
                 if (element1.GetClusterW() != element2.GetClusterW())
                     clusterListW.push_back(element2.GetClusterW());
 
                 const unsigned int nClustersU(clusterListU.size()), nClustersV(clusterListV.size()), nClustersW(clusterListW.size());
                 const unsigned int nClustersProduct(nClustersU * nClustersV * nClustersW);
 
                 if (((1 == m_nCommonClusters) && (4 != nClustersProduct)) || ((2 == m_nCommonClusters) && (2 != nClustersProduct)))
                     throw StatusCodeException(STATUS_CODE_FAILURE);
 
                 if ((1 == m_nCommonClusters) && !((2 == nClustersU) || (2 == nClustersV) || (2 == nClustersW)))
                     throw StatusCodeException(STATUS_CODE_FAILURE);
 
                 if (m_checkClusterProximities &&
                     (!this->CheckClusterProximities(pAlgorithm, clusterListU) || !this->CheckClusterProximities(pAlgorithm, clusterListV) ||
                         !this->CheckClusterProximities(pAlgorithm, clusterListW)))
                 {
                     continue;
                 }
 
                 if (m_checkClusterVertexRelations && (!this->CheckClusterVertexRelations(pAlgorithm, clusterListU) ||
                                                          !this->CheckClusterVertexRelations(pAlgorithm, clusterListV) ||
                                                          !this->CheckClusterVertexRelations(pAlgorithm, clusterListW)))
                 {
                     continue;
                 }
 
                 if (m_checkClusterSplitPositions && !this->CheckClusterSplitPositions(pAlgorithm, clusterListU, clusterListV, clusterListW))
                 {
                     continue;
                 }
 
                 this->SpecifyClusterMerges(pAlgorithm, clusterListU, clusterMergeMap);
                 this->SpecifyClusterMerges(pAlgorithm, clusterListV, clusterMergeMap);
                 this->SpecifyClusterMerges(pAlgorithm, clusterListW, clusterMergeMap);
 
                 usedClusters.insert(clusterListU.begin(), clusterListU.end());
                 usedClusters.insert(clusterListV.begin(), clusterListV.end());
                 usedClusters.insert(clusterListW.begin(), clusterListW.end());
             }
             catch (StatusCodeException &)
             {
             }
         }
     }
 }

void lar_content::SplitShowersTool::FindSplitShowers	(	ThreeViewShowersAlgorithm *const	pAlgorithm,
		const TensorType &	overlapTensor,
		ClusterMergeMap &	clusterMergeMap
	)		const

private

Find split showers, using information from the overlap tensor.

Parameters

pAlgorithm	address of the calling algorithm
overlapTensor	the overlap tensor
clusterMergeMap	to receive the list of cluster merges

Definition at line 57 of file SplitShowersTool.cc.

 {
     ClusterSet usedClusters;
     ClusterVector sortedKeyClusters;
     overlapTensor.GetSortedKeyClusters(sortedKeyClusters);
 
     for (const Cluster *const pKeyCluster : sortedKeyClusters)
     {
         if (!pKeyCluster->IsAvailable())
             continue;
 
         unsigned int nU(0), nV(0), nW(0);
         TensorType::ElementList elementList;
         overlapTensor.GetConnectedElements(pKeyCluster, true, elementList, nU, nV, nW);
 
         if (nU * nV * nW < 2)
             continue;
 
         for (TensorType::ElementList::const_iterator eIter = elementList.begin(); eIter != elementList.end(); ++eIter)
         {
             if (!this->PassesElementCuts(eIter, usedClusters))
                 continue;
 
             IteratorList iteratorList;
             this->SelectTensorElements(eIter, elementList, usedClusters, iteratorList);
 
             if (iteratorList.size() < 2)
                 continue;
 
             this->FindShowerMerges(pAlgorithm, iteratorList, usedClusters, clusterMergeMap);
         }
     }
 }

void lar_content::SplitShowersTool::GetSplitXDetails	(	ThreeViewShowersAlgorithm *const	pAlgorithm,
		const pandora::Cluster *const	pClusterA,
		const pandora::Cluster *const	pClusterB,
		float &	splitXPosition,
		float &	overlapX
	)		const

private

Get the x coordinate representing the midpoint between two clusters (hypothesis: clusters represent a split shower)

Parameters

pAlgorithm	address of the calling algorithm
pClusterA	the address of cluster A
pClusterB	the address of cluster B
splitXPosition	to receive the split position estimate
overlapX	to receive the overlap estimate

Definition at line 317 of file SplitShowersTool.cc.

 {
     const TwoDSlidingFitResult &fitResultA(pAlgorithm->GetCachedSlidingFitResult(pClusterA).GetShowerFitResult());
     const TwoDSlidingFitResult &fitResultB(pAlgorithm->GetCachedSlidingFitResult(pClusterB).GetShowerFitResult());
 
     const float minXA(std::min(fitResultA.GetGlobalMinLayerPosition().GetX(), fitResultA.GetGlobalMaxLayerPosition().GetX()));
     const float maxXA(std::max(fitResultA.GetGlobalMinLayerPosition().GetX(), fitResultA.GetGlobalMaxLayerPosition().GetX()));
     const float minXB(std::min(fitResultB.GetGlobalMinLayerPosition().GetX(), fitResultB.GetGlobalMaxLayerPosition().GetX()));
     const float maxXB(std::max(fitResultB.GetGlobalMinLayerPosition().GetX(), fitResultB.GetGlobalMaxLayerPosition().GetX()));
 
     FloatVector floatVector;
     floatVector.push_back(minXA);
     floatVector.push_back(maxXA);
     floatVector.push_back(minXB);
     floatVector.push_back(maxXB);
     std::sort(floatVector.begin(), floatVector.end());
 
     if (4 != floatVector.size())
         throw StatusCodeException(STATUS_CODE_FAILURE);
 
     splitXPosition = 0.5f * (floatVector.at(1) + floatVector.at(2));
     overlapX = std::max(0.f, std::min(maxXA, maxXB) - std::max(minXA, minXB));
 }

bool lar_content::SplitShowersTool::PassesElementCuts	(	TensorType::ElementList::const_iterator	eIter,
		const pandora::ClusterSet &	usedClusters
	)		const

private

Whether a provided (iterator to a) tensor element passes the selection cuts for undershoots identification.

Parameters

eIter	the iterator to the tensor element
usedClusters	the list of used clusters

Definition at line 93 of file SplitShowersTool.cc.

 {
     if (usedClusters.count(eIter->GetClusterU()) || usedClusters.count(eIter->GetClusterV()) || usedClusters.count(eIter->GetClusterW()))
         return false;
 
     if (eIter->GetOverlapResult().GetMatchedFraction() < m_minMatchedFraction)
         return false;
 
     if (eIter->GetOverlapResult().GetNMatchedSamplingPoints() < m_minMatchedSamplingPoints)
         return false;
 
     return true;
 }

StatusCode lar_content::SplitShowersTool::ReadSettings ( const pandora::TiXmlHandle xmlHandle )

private

Definition at line 394 of file SplitShowersTool.cc.

 {
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle, "NCommonClusters", m_nCommonClusters));
 
     if ((1 != m_nCommonClusters) && (2 != m_nCommonClusters))
     {
         std::cout << "SplitShowersTool: NCommonClusters must be set to either 1 or 2 (provided: " << m_nCommonClusters << ") " << std::endl;
         return STATUS_CODE_INVALID_PARAMETER;
     }
 
     PANDORA_RETURN_RESULT_IF_AND_IF(
         STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle, "MinMatchedFraction", m_minMatchedFraction));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=,
         XmlHelper::ReadValue(xmlHandle, "MinMatchedSamplingPoints", m_minMatchedSamplingPoints));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=,
         XmlHelper::ReadValue(xmlHandle, "CheckClusterProximities", m_checkClusterProximities));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(
         STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle, "MaxClusterSeparation", m_maxClusterSeparation));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=,
         XmlHelper::ReadValue(xmlHandle, "CheckClusterVertexRelations", m_checkClusterVertexRelations));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=,
         XmlHelper::ReadValue(xmlHandle, "MinVertexLongitudinalDistance", m_minVertexLongitudinalDistance));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=,
         XmlHelper::ReadValue(xmlHandle, "MaxVertexLongitudinalDistance", m_maxVertexLongitudinalDistance));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=,
         XmlHelper::ReadValue(xmlHandle, "MaxVertexTransverseDistance", m_maxVertexTransverseDistance));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(
         STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle, "VertexAngularAllowance", m_vertexAngularAllowance));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(
         STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle, "MaxVertexAssociations", m_maxVertexAssociations));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=,
         XmlHelper::ReadValue(xmlHandle, "CheckClusterSplitPositions", m_checkClusterSplitPositions));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(
         STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle, "VetoMergeXDifference", m_vetoMergeXDifference));
 
     PANDORA_RETURN_RESULT_IF_AND_IF(
         STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle, "VetoMergeXOverlap", m_vetoMergeXOverlap));
 
     return STATUS_CODE_SUCCESS;
 }

bool lar_content::SplitShowersTool::Run	(	ThreeViewShowersAlgorithm *const	pAlgorithm,
		TensorType &	overlapTensor
	)

virtual

Run the algorithm tool.

Parameters

pAlgorithm	address of the calling algorithm
overlapTensor	the overlap tensor

Returns: whether changes have been made by the tool

Implements lar_content::ShowerTensorTool.

Definition at line 44 of file SplitShowersTool.cc.

 {
     if (PandoraContentApi::GetSettings(*pAlgorithm)->ShouldDisplayAlgorithmInfo())
         std::cout << "----> Running Algorithm Tool: " << this->GetInstanceName() << ", " << this->GetType() << std::endl;
 
     ClusterMergeMap clusterMergeMap;
     this->FindSplitShowers(pAlgorithm, overlapTensor, clusterMergeMap);
 
     return this->ApplyChanges(pAlgorithm, clusterMergeMap);
 }

void lar_content::SplitShowersTool::SelectTensorElements	(	TensorType::ElementList::const_iterator	eIter,
		const TensorType::ElementList &	elementList,
		const pandora::ClusterSet &	usedClusters,
		IteratorList &	iteratorList
	)		const

private

Select elements representing possible components of interest due to undershoots in clustering.

Parameters

eIter	iterator to a candidate element
elementList	the provided element list
usedClusters	the list of used clusters
iteratorList	to receive a list of iterators to relevant elements

Definition at line 109 of file SplitShowersTool.cc.

 {
     iteratorList.push_back(eIter);
 
     for (TensorType::ElementList::const_iterator eIter2 = elementList.begin(); eIter2 != elementList.end(); ++eIter2)
     {
         if (eIter == eIter2)
             continue;
 
         if (!this->PassesElementCuts(eIter2, usedClusters))
             continue;
 
         for (IteratorList::const_iterator iIter = iteratorList.begin(); iIter != iteratorList.end(); ++iIter)
         {
             if ((*iIter) == eIter2)
                 continue;
 
             unsigned int nMatchedClusters(0);
 
             if ((*iIter)->GetClusterU() == eIter2->GetClusterU())
                 ++nMatchedClusters;
 
             if ((*iIter)->GetClusterV() == eIter2->GetClusterV())
                 ++nMatchedClusters;
 
             if ((*iIter)->GetClusterW() == eIter2->GetClusterW())
                 ++nMatchedClusters;
 
             if (m_nCommonClusters == nMatchedClusters)
             {
                 iteratorList.push_back(eIter2);
                 return;
             }
         }
     }
 }

void lar_content::SplitShowersTool::SpecifyClusterMerges	(	ThreeViewShowersAlgorithm *const	pAlgorithm,
		const pandora::ClusterList &	clusterList,
		ClusterMergeMap &	clusterMergeMap
	)		const

private

Populate the cluster merge map, based on the information contained in the provided cluster list.

Parameters

pAlgorithm	address of the calling algorithm
clusterList	the cluster list
clusterMergeMap	to receive the populated cluster merge map

Definition at line 344 of file SplitShowersTool.cc.

 {
     if (1 == clusterList.size())
         return;
 
     if (2 != clusterList.size())
         throw StatusCodeException(STATUS_CODE_FAILURE);
 
     const Cluster *const pClusterA(*(clusterList.begin())), *const pClusterB(*(++(clusterList.begin())));
     const TwoDSlidingFitResult &fitResultA(pAlgorithm->GetCachedSlidingFitResult(pClusterA).GetShowerFitResult());
     const TwoDSlidingFitResult &fitResultB(pAlgorithm->GetCachedSlidingFitResult(pClusterB).GetShowerFitResult());
 
     const float minXA(std::min(fitResultA.GetGlobalMinLayerPosition().GetX(), fitResultA.GetGlobalMaxLayerPosition().GetX()));
     const float minXB(std::min(fitResultB.GetGlobalMinLayerPosition().GetX(), fitResultB.GetGlobalMaxLayerPosition().GetX()));
 
     const Cluster *const pLowXCluster((minXA < minXB) ? pClusterA : pClusterB);
     const Cluster *const pHighXCluster((minXA < minXB) ? pClusterB : pClusterA);
     clusterMergeMap[pLowXCluster].push_back(pHighXCluster);
 }

Member Data Documentation

bool lar_content::SplitShowersTool::m_checkClusterProximities

private

Whether to check the proximities of the candidate split shower clusters.

Definition at line 133 of file SplitShowersTool.h.

bool lar_content::SplitShowersTool::m_checkClusterSplitPositions

private

Whether to check the cluster split positions, if there are splits in multiple views.

Definition at line 143 of file SplitShowersTool.h.

bool lar_content::SplitShowersTool::m_checkClusterVertexRelations

private

Whether to check the consistency of the clusters with the event vertex.

Definition at line 136 of file SplitShowersTool.h.

float lar_content::SplitShowersTool::m_maxClusterSeparation

private

The maximum separation for clusters to be merged.

Definition at line 134 of file SplitShowersTool.h.

unsigned int lar_content::SplitShowersTool::m_maxVertexAssociations

private

The maximum number of vertex associations for clusters to be merged.

Definition at line 141 of file SplitShowersTool.h.

float lar_content::SplitShowersTool::m_maxVertexLongitudinalDistance

private

Vertex association check: max longitudinal distance cut.

Definition at line 138 of file SplitShowersTool.h.

float lar_content::SplitShowersTool::m_maxVertexTransverseDistance

private

Vertex association check: max transverse distance cut.

Definition at line 139 of file SplitShowersTool.h.

float lar_content::SplitShowersTool::m_minMatchedFraction

private

The min matched sampling point fraction for use as a key tensor element.

Definition at line 130 of file SplitShowersTool.h.

unsigned int lar_content::SplitShowersTool::m_minMatchedSamplingPoints

private

The min number of matched sampling points for use as a key tensor element.

Definition at line 131 of file SplitShowersTool.h.

float lar_content::SplitShowersTool::m_minVertexLongitudinalDistance

private

Vertex association check: min longitudinal distance cut.

Definition at line 137 of file SplitShowersTool.h.

unsigned int lar_content::SplitShowersTool::m_nCommonClusters

private

The number of common clusters.

Definition at line 129 of file SplitShowersTool.h.

float lar_content::SplitShowersTool::m_vertexAngularAllowance

private

Vertex association check: pointing angular allowance in degrees.

Definition at line 140 of file SplitShowersTool.h.

float lar_content::SplitShowersTool::m_vetoMergeXDifference

private

The x distance between split positions in two views below which may refuse a merge.

Definition at line 144 of file SplitShowersTool.h.

float lar_content::SplitShowersTool::m_vetoMergeXOverlap

private

The x overlap between candidate cluster sliding fits below which may refuse a merge.

Definition at line 145 of file SplitShowersTool.h.

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

Public Member Functions

Private Member Functions

Private Attributes

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

Member Function Documentation

Member Data Documentation