LSST Applications g00d0e8bbd7+edbf708997,g03191d30f7+9ce8016dbd,g1955dfad08+0bd186d245,g199a45376c+5137f08352,g1fd858c14a+a888a50aa2,g262e1987ae+45f9aba685,g29ae962dfc+1c7d47a24f,g2cef7863aa+73c82f25e4,g35bb328faa+edbf708997,g3fd5ace14f+eed17d2c67,g47891489e3+6dc8069a4c,g53246c7159+edbf708997,g64539dfbff+c4107e45b5,g67b6fd64d1+6dc8069a4c,g74acd417e5+f452e9c21a,g786e29fd12+af89c03590,g7ae74a0b1c+a25e60b391,g7aefaa3e3d+2025e9ce17,g7cc15d900a+2d158402f9,g87389fa792+a4172ec7da,g89139ef638+6dc8069a4c,g8d4809ba88+c4107e45b5,g8d7436a09f+e96c132b44,g8ea07a8fe4+db21c37724,g98df359435+aae6d409c1,ga2180abaac+edbf708997,gac66b60396+966efe6077,gb632fb1845+88945a90f8,gbaa8f7a6c5+38b34f4976,gbf99507273+edbf708997,gca7fc764a6+6dc8069a4c,gd7ef33dd92+6dc8069a4c,gda68eeecaf+7d1e613a8d,gdab6d2f7ff+f452e9c21a,gdbb4c4dda9+c4107e45b5,ge410e46f29+6dc8069a4c,ge41e95a9f2+c4107e45b5,geaed405ab2+e194be0d2b,w.2025.47
LSST Data Management Base Package
Loading...
Searching...
No Matches
BuildSingleKernelVisitor.h
Go to the documentation of this file.
1// -*- lsst-c++ -*-
11
12#ifndef LSST_IP_DIFFIM_BUILDSINGLEKERNELVISITOR_H
13#define LSST_IP_DIFFIM_BUILDSINGLEKERNELVISITOR_H
14
15#include <memory>
16
17#include "lsst/afw/image.h"
18#include "lsst/afw/math.h"
19
21
23
24namespace lsst {
25namespace ip {
26namespace diffim {
27namespace detail {
28
29 template<typename PixelT>
31 typedef lsst::afw::image::MaskedImage<PixelT> MaskedImageT;
32 public:
34
36 lsst::afw::math::KernelList const& basisList,
38 );
40 lsst::afw::math::KernelList const& basisList,
42 Eigen::MatrixXd const& hMat
43 );
45
46 /*
47 Don't reprocess candidate if its already been build. The use
48 case for this functionality is : when iterating over all Cells
49 and rejecting bad Kernels, we need to re-visit *all* Cells to
50 build the next candidate in the list. Without this flag we would
51 unncessarily re-build all the good Kernels.
52 */
53 void setSkipBuilt(bool skip) {_skipBuilt = skip;}
54
55 int getNRejected() {return _nRejected;}
56 int getNProcessed() {return _nProcessed;}
57 void reset() {_nRejected = 0; _nProcessed = 0;}
58
60 bool getSkipBuilt() { return _skipBuilt; }
61 bool getUseRegularization() { return _useRegularization; }
62 bool getUseCoreStats() { return _useCoreStats; }
63 int getCoreRadius() { return _coreRadius; }
64
66
67 private:
68 lsst::afw::math::KernelList const _basisList;
70 Eigen::MatrixXd const _hMat;
72 bool _skipBuilt;
73 int _nRejected;
74 int _nProcessed;
75 bool _useRegularization;
76
77 bool _useCoreStats;
78 int _coreRadius;
79 };
80
81 template<typename PixelT>
92
93 template<typename PixelT>
96 lsst::afw::math::KernelList const& basisList,
98 Eigen::MatrixXd const & hMat
99 ) {
100
102 new BuildSingleKernelVisitor<PixelT>(basisList, ps, hMat)
103 );
104 }
105
106}}}} // end of namespace lsst::ip::diffim::detail
107
108#endif
Image Subtraction helper functions.
A class to manipulate images, masks, and variance as a single object.
Definition MaskedImage.h:74
Base class for candidate objects in a SpatialCell.
Definition SpatialCell.h:70
Class for storing generic metadata.
Definition PropertySet.h:67
std::shared_ptr< PropertySet > Ptr
Definition PropertySet.h:70
Class to calculate difference image statistics.
Builds the convolution kernel for a given candidate.
void processCandidate(lsst::afw::math::SpatialCellCandidate *candidate)
BuildSingleKernelVisitor(lsst::afw::math::KernelList const &basisList, lsst::daf::base::PropertySet const &ps)
std::shared_ptr< BuildSingleKernelVisitor< PixelT > > Ptr
std::shared_ptr< lsst::daf::base::PropertySet > getPropertySet()
std::vector< std::shared_ptr< Kernel > > KernelList
Definition Kernel.h:462
std::shared_ptr< BuildSingleKernelVisitor< PixelT > > makeBuildSingleKernelVisitor(lsst::afw::math::KernelList const &basisList, lsst::daf::base::PropertySet const &ps)