lar_content::KinkSplittingAlgorithm Class Reference

KinkSplittingAlgorithm class. More...

#include "KinkSplittingAlgorithm.h"

Inheritance diagram for lar_content::KinkSplittingAlgorithm:

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

Protected Member Functions
virtual pandora::StatusCode	Run ()
pandora::StatusCode	RunUsingCurrentList () const
	Run the algorithm using the current cluster list as input. More...

Protected Attributes
unsigned int	m_slidingFitHalfWindow
float	m_minClusterLength

Private Member Functions
pandora::StatusCode	ReadSettings (const pandora::TiXmlHandle xmlHandle)
pandora::StatusCode	FindBestSplitPosition (const TwoDSlidingFitResult &slidingFitResult, pandora::CartesianVector &splitPosition) const
	Use sliding linear fit to identify the best split position. More...

Private Attributes
float	m_maxScatterRms
float	m_maxScatterCosTheta
float	m_maxSlidingCosTheta

Detailed Description

KinkSplittingAlgorithm class.

Definition at line 19 of file KinkSplittingAlgorithm.h.

Constructor & Destructor Documentation

lar_content::KinkSplittingAlgorithm::KinkSplittingAlgorithm

(

)

Default constructor.

Definition at line 18 of file KinkSplittingAlgorithm.cc.

                                               :
    m_maxScatterRms(0.2f),
    m_maxScatterCosTheta(0.905f),
    m_maxSlidingCosTheta(0.985f)
{
}

Member Function Documentation

StatusCode lar_content::KinkSplittingAlgorithm::FindBestSplitPosition ( const TwoDSlidingFitResult &  slidingFitResult, pandora::CartesianVector &  splitPosition  ) const

privatevirtual

Use sliding linear fit to identify the best split position.

Parameters

slidingFitResult	the input sliding fit result
splitPosition	the best split position

Returns

pandora::StatusCode

Implements lar_content::TwoDSlidingFitSplittingAlgorithm.

Definition at line 27 of file KinkSplittingAlgorithm.cc.

References f, lar_content::TwoDSlidingFitResult::GetFitRms(), lar_content::TwoDSlidingFitResult::GetGlobalFitDirection(), lar_content::TwoDSlidingFitResult::GetGlobalFitPosition(), lar_content::TwoDSlidingFitResult::GetL(), lar_content::TwoDSlidingFitResult::GetLayerFitHalfWindow(), lar_content::TwoDSlidingFitResult::GetLayerFitResultMap(), m_maxScatterCosTheta, m_maxScatterRms, m_maxSlidingCosTheta, and max.

{
    // Search for scatters by scanning over the layers in the sliding fit result
    const LayerFitResultMap &layerFitResultMap(slidingFitResult.GetLayerFitResultMap());
    const int minLayer(layerFitResultMap.begin()->first), maxLayer(layerFitResultMap.rbegin()->first);

    const int nLayersHalfWindow(slidingFitResult.GetLayerFitHalfWindow());
    const int nLayersSpanned(1 + maxLayer - minLayer);

    if (nLayersSpanned <= 2 * nLayersHalfWindow)
        return STATUS_CODE_NOT_FOUND;

    bool foundSplit(false);

    float bestCosTheta(1.f);

    for (LayerFitResultMap::const_iterator iter = layerFitResultMap.begin(), iterEnd = layerFitResultMap.end(); iter != iterEnd; ++iter)
    {
        const int iLayer(iter->first);

        const float rL(slidingFitResult.GetL(iLayer));
        const float rL1(slidingFitResult.GetL(iLayer - nLayersHalfWindow));
        const float rL2(slidingFitResult.GetL(iLayer + nLayersHalfWindow));

        CartesianVector centralPosition(0.f,0.f,0.f), firstDirection(0.f,0.f,0.f), secondDirection(0.f,0.f,0.f);

        if ((STATUS_CODE_SUCCESS != slidingFitResult.GetGlobalFitPosition(rL, centralPosition)) ||
            (STATUS_CODE_SUCCESS != slidingFitResult.GetGlobalFitDirection(rL1, firstDirection)) ||
            (STATUS_CODE_SUCCESS != slidingFitResult.GetGlobalFitDirection(rL2, secondDirection)))
        {
            continue;
        }

        const float cosTheta(firstDirection.GetDotProduct(secondDirection));
        const float rms1(slidingFitResult.GetFitRms(rL1));
        const float rms2(slidingFitResult.GetFitRms(rL2));
        const float rms(std::max(rms1, rms2));

        float rmsCut(m_maxScatterRms);

        if (cosTheta > m_maxScatterCosTheta)
        {
            rmsCut *= ((m_maxSlidingCosTheta > cosTheta) ? (m_maxSlidingCosTheta - cosTheta) /
                    (m_maxSlidingCosTheta - m_maxScatterCosTheta) : 0.f);
        }

        if (rms < rmsCut && cosTheta < bestCosTheta)
        {
            bestCosTheta = cosTheta;
            splitPosition = centralPosition;
            foundSplit = true;
        }
    }

    if (!foundSplit)
        return STATUS_CODE_NOT_FOUND;

    return STATUS_CODE_SUCCESS;
}

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

privatevirtual

Reimplemented from lar_content::TwoDSlidingFitSplittingAlgorithm.

Definition at line 89 of file KinkSplittingAlgorithm.cc.

References m_maxScatterCosTheta, m_maxScatterRms, m_maxSlidingCosTheta, and lar_content::TwoDSlidingFitSplittingAlgorithm::ReadSettings().

{
    PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
        "MaxScatterRms", m_maxScatterRms));

    PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
        "MaxScatterCosTheta", m_maxScatterCosTheta));

    PANDORA_RETURN_RESULT_IF_AND_IF(STATUS_CODE_SUCCESS, STATUS_CODE_NOT_FOUND, !=, XmlHelper::ReadValue(xmlHandle,
        "MaxSlidingCosTeta", m_maxSlidingCosTheta));

    return TwoDSlidingFitSplittingAlgorithm::ReadSettings(xmlHandle);
}

StatusCode lar_content::ClusterSplittingAlgorithm::Run ( )

protectedvirtualinherited

Definition at line 20 of file ClusterSplittingAlgorithm.cc.

{
    if (m_inputClusterListNames.empty())
        return this->RunUsingCurrentList();

    std::string originalListName;
    PANDORA_RETURN_RESULT_IF(STATUS_CODE_SUCCESS, !=, PandoraContentApi::GetCurrentListName<Cluster>(*this, originalListName));

    for (const std::string &clusterListName : m_inputClusterListNames)
    {
        const StatusCode listChangeStatusCode(PandoraContentApi::ReplaceCurrentList<Cluster>(*this, clusterListName));

        if (STATUS_CODE_NOT_FOUND == listChangeStatusCode)
        {
            if (PandoraContentApi::GetSettings(*this)->ShouldDisplayAlgorithmInfo())
                std::cout << "ClusterSplittingAlgorithm: cluster list not found " << clusterListName << std::endl;

            continue;
        }

        if (STATUS_CODE_SUCCESS != listChangeStatusCode)
            return listChangeStatusCode;

        PANDORA_RETURN_RESULT_IF(STATUS_CODE_SUCCESS, !=, this->RunUsingCurrentList());
    }

    PANDORA_RETURN_RESULT_IF(STATUS_CODE_SUCCESS, !=, PandoraContentApi::ReplaceCurrentList<Cluster>(*this, originalListName));
    return STATUS_CODE_SUCCESS;
}

StatusCode lar_content::ClusterSplittingAlgorithm::RunUsingCurrentList ( ) const

protectedinherited

Run the algorithm using the current cluster list as input.

Definition at line 52 of file ClusterSplittingAlgorithm.cc.

{
    const ClusterList *pClusterList = NULL;
    PANDORA_RETURN_RESULT_IF(STATUS_CODE_SUCCESS, !=, PandoraContentApi::GetCurrentList(*this, pClusterList));

    ClusterList internalClusterList(pClusterList->begin(), pClusterList->end());
    internalClusterList.sort(LArClusterHelper::SortByNHits);

    for (ClusterList::iterator iter = internalClusterList.begin(); iter != internalClusterList.end(); ++iter)
    {
        const Cluster *const pCluster = *iter;
        ClusterList clusterSplittingList;

        if (STATUS_CODE_SUCCESS != this->SplitCluster(pCluster, clusterSplittingList))
            continue;

        internalClusterList.splice(internalClusterList.end(), clusterSplittingList);
        *iter = NULL;
    }

    return STATUS_CODE_SUCCESS;
}

Member Data Documentation

float lar_content::KinkSplittingAlgorithm::m_maxScatterCosTheta

private

Definition at line 41 of file KinkSplittingAlgorithm.h.

Referenced by FindBestSplitPosition(), and ReadSettings().

float lar_content::KinkSplittingAlgorithm::m_maxScatterRms

private

Definition at line 40 of file KinkSplittingAlgorithm.h.

Referenced by FindBestSplitPosition(), and ReadSettings().

float lar_content::KinkSplittingAlgorithm::m_maxSlidingCosTheta

private

Definition at line 42 of file KinkSplittingAlgorithm.h.

Referenced by FindBestSplitPosition(), and ReadSettings().

float lar_content::TwoDSlidingFitSplittingAlgorithm::m_minClusterLength

protectedinherited

Definition at line 44 of file TwoDSlidingFitSplittingAlgorithm.h.

Referenced by lar_content::TwoDSlidingFitSplittingAlgorithm::ReadSettings(), lar_content::TwoDSlidingFitSplittingAlgorithm::TwoDSlidingFitSplittingAlgorithm(), and lar_content::VertexSplittingAlgorithm::VertexSplittingAlgorithm().

unsigned int lar_content::TwoDSlidingFitSplittingAlgorithm::m_slidingFitHalfWindow

protectedinherited

Definition at line 43 of file TwoDSlidingFitSplittingAlgorithm.h.

Referenced by lar_content::TwoDSlidingFitSplittingAlgorithm::ReadSettings(), and lar_content::TwoDSlidingFitSplittingAlgorithm::TwoDSlidingFitSplittingAlgorithm().

---

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

• /cvmfs/larsoft.opensciencegrid.org/products/larpandoracontent/v03_14_03/source/larpandoracontent/LArTwoDReco/LArClusterSplitting/KinkSplittingAlgorithm.h
• /cvmfs/larsoft.opensciencegrid.org/products/larpandoracontent/v03_14_03/source/larpandoracontent/LArTwoDReco/LArClusterSplitting/KinkSplittingAlgorithm.cc