lsst.afw.detection::FootprintMerge Class Reference

Public Types
typedef FootprintMergeList::KeyTuple	KeyTuple
typedef FootprintMergeList::FilterMap	FilterMap

Public Member Functions
	FootprintMerge (boost::shared_ptr< Footprint > footprint, boost::shared_ptr< afw::table::SourceTable > sourceTable, boost::shared_ptr< PeakTable > peakTable, afw::table::SchemaMapper const &peakSchemaMapper, KeyTuple const &keys)
bool	overlaps (Footprint const &rhs) const
void	add (boost::shared_ptr< Footprint > footprint, afw::table::SchemaMapper const &peakSchemaMapper, KeyTuple const &keys, float minNewPeakDist=-1., float maxSamePeakDist=-1.)
void	add (FootprintMerge const &other, FilterMap const &keys, float minNewPeakDist=-1., float maxSamePeakDist=-1.)
afw::geom::Box2I	getBBox () const
boost::shared_ptr< Footprint >	getMergedFootprint () const
boost::shared_ptr < afw::table::SourceRecord >	getSource () const

Private Member Functions
bool	_addSpans (boost::shared_ptr< Footprint > footprint)
void	_addPeaks (PeakCatalog const &otherPeaks, afw::table::SchemaMapper const *peakSchemaMapper, KeyTuple const *keys, float minNewPeakDist, float maxSamePeakDist)

Private Attributes
std::vector< boost::shared_ptr < Footprint > >	_footprints
boost::shared_ptr < afw::table::SourceRecord >	_source

Detailed Description

Definition at line 47 of file FootprintMerge.cc.

Member Typedef Documentation

typedef FootprintMergeList::FilterMap lsst.afw.detection::FootprintMerge::FilterMap

Definition at line 51 of file FootprintMerge.cc.

typedef FootprintMergeList::KeyTuple lsst.afw.detection::FootprintMerge::KeyTuple

Definition at line 50 of file FootprintMerge.cc.

Constructor & Destructor Documentation

lsst.afw.detection::FootprintMerge::FootprintMerge ( boost::shared_ptr< Footprint >  footprint, boost::shared_ptr< afw::table::SourceTable >  sourceTable, boost::shared_ptr< PeakTable >  peakTable, afw::table::SchemaMapper const &  peakSchemaMapper, KeyTuple const &  keys  )

inlineexplicit

Definition at line 53 of file FootprintMerge.cc.

      :
        _footprints(1, footprint),
        _source(sourceTable->makeRecord())
    {
        PTR(Footprint) newFootprint = boost::make_shared<Footprint>(*footprint);

        _source->set(keys.footprint, true);
        // Replace all the Peaks in the merged Footprint with new ones that include the origin flags
        newFootprint->getPeaks() = PeakCatalog(peakTable);
        for (
            PeakCatalog::iterator iter = footprint->getPeaks().begin();
            iter != footprint->getPeaks().end();
            ++iter
        ) {
            PTR(PeakRecord) newPeak = peakTable->copyRecord(*iter, peakSchemaMapper);
            newPeak->set(keys.peak, true);
            newFootprint->getPeaks().push_back(newPeak);
        }
        _source->setFootprint(newFootprint);
    }

Member Function Documentation

void lsst.afw.detection::FootprintMerge::_addPeaks ( PeakCatalog const &  otherPeaks, afw::table::SchemaMapper const *  peakSchemaMapper, KeyTuple const *  keys, float  minNewPeakDist, float  maxSamePeakDist  )

inlineprivate

Definition at line 159 of file FootprintMerge.cc.

      {
        if (minNewPeakDist < 0 && maxSamePeakDist < 0) return;

        PeakCatalog & currentPeaks = getMergedFootprint()->getPeaks();
        PTR(PeakRecord) nearestPeak;
        // Create new list of peaks
        PeakCatalog newPeaks(currentPeaks.getTable());
        float minNewPeakDist2 = minNewPeakDist*minNewPeakDist;
        float maxSamePeakDist2 = maxSamePeakDist*maxSamePeakDist;
        for (PeakCatalog::const_iterator otherIter = otherPeaks.begin();
             otherIter != otherPeaks.end(); ++otherIter) {

            float minDist2 = std::numeric_limits<float>::infinity();

            for (PeakCatalog::const_iterator currentIter = currentPeaks.begin();
                 currentIter != currentPeaks.end(); ++currentIter) {
                float dist2 = otherIter->getI().distanceSquared(currentIter->getI());

                if (dist2 < minDist2) {
                    minDist2 = dist2;
                    nearestPeak = currentIter;
                }
            }

            if (minDist2 < maxSamePeakDist2 && nearestPeak && keys && maxSamePeakDist > 0) {
                nearestPeak->set(keys->peak, true);
            } else if (minDist2 > minNewPeakDist2 && !(minNewPeakDist < 0)) {
                if (peakSchemaMapper) {
                    PTR(PeakRecord) newPeak = newPeaks.addNew();
                    newPeak->assign(*otherIter, *peakSchemaMapper);
                    newPeak->set(keys->peak, true);
                } else {
                    newPeaks.push_back(otherIter);
                }
            }

        }

        getMergedFootprint()->getPeaks().insert(
            getMergedFootprint()->getPeaks().end(),
            newPeaks.begin(), newPeaks.end(),
            true // deep-copy
        );
    }

bool lsst.afw.detection::FootprintMerge::_addSpans ( boost::shared_ptr< Footprint >  footprint )

inlineprivate

Definition at line 151 of file FootprintMerge.cc.

                                             {
        FootprintSet fpSet = mergeFootprintPair(*getMergedFootprint(), *footprint);
        if (fpSet.getFootprints()->size() != 1u) return false;
        getMergedFootprint()->_bbox.include(footprint->getBBox());
        getMergedFootprint()->getSpans().swap(fpSet.getFootprints()->front()->getSpans());
        return true;
    }

void lsst.afw.detection::FootprintMerge::add ( boost::shared_ptr< Footprint >  footprint, afw::table::SchemaMapper const &  peakSchemaMapper, KeyTuple const &  keys, float  minNewPeakDist = -1., float  maxSamePeakDist = -1.  )

inline

Definition at line 100 of file FootprintMerge.cc.

      {
        if (_addSpans(footprint)) {
            _footprints.push_back(footprint);
            _source->set(keys.footprint, true);
            _addPeaks(footprint->getPeaks(), &peakSchemaMapper, &keys, minNewPeakDist, maxSamePeakDist);
        }
    }

void lsst.afw.detection::FootprintMerge::add ( FootprintMerge const &  other, FilterMap const &  keys, float  minNewPeakDist = -1., float  maxSamePeakDist = -1.  )

inline

Definition at line 123 of file FootprintMerge.cc.

          {
        if (_addSpans(other.getMergedFootprint())) {
            _footprints.insert(_footprints.end(), other._footprints.begin(), other._footprints.end());
            // Set source flags to the OR of the flags of the two inputs
            for (FilterMap::const_iterator i = keys.begin(); i != keys.end(); ++i) {
                afw::table::Key<afw::table::Flag> const & flagKey = i->second.footprint;
                _source->set(flagKey, _source->get(flagKey) || other._source->get(flagKey));
            }
            _addPeaks(other.getMergedFootprint()->getPeaks(), NULL, NULL, minNewPeakDist, maxSamePeakDist);
        }
    }

afw::geom::Box2I lsst.afw.detection::FootprintMerge::getBBox ( ) const

inline

Definition at line 141 of file FootprintMerge.cc.

{ return getMergedFootprint()->getBBox(); }

boost::shared_ptr< Footprint > lsst.afw.detection::FootprintMerge::getMergedFootprint ( ) const

inline

Definition at line 143 of file FootprintMerge.cc.

{ return _source->getFootprint(); }

boost::shared_ptr< afw::table::SourceRecord > lsst.afw.detection::FootprintMerge::getSource ( ) const

inline

Definition at line 145 of file FootprintMerge.cc.

{ return _source; }

bool lsst.afw.detection::FootprintMerge::overlaps ( Footprint const &  rhs ) const

inline

Definition at line 87 of file FootprintMerge.cc.

                                              {
        return mergeFootprintPair(*getMergedFootprint(), rhs).getFootprints()->size() == 1u;
    }

Member Data Documentation

std::vector<boost::shared_ptr< Footprint > > lsst.afw.detection::FootprintMerge::_footprints

private

Definition at line 210 of file FootprintMerge.cc.

boost::shared_ptr< afw::table::SourceRecord > lsst.afw.detection::FootprintMerge::_source

private

Definition at line 211 of file FootprintMerge.cc.

---

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

• /home/lsstsw/stack/Linux64/afw/11.0.rc2+4/src/detection/FootprintMerge.cc