LSST Applications  21.0.0-172-gfb10e10a+18fedfabac,22.0.0+297cba6710,22.0.0+80564b0ff1,22.0.0+8d77f4f51a,22.0.0+a28f4c53b1,22.0.0+dcf3732eb2,22.0.1-1-g7d6de66+2a20fdde0d,22.0.1-1-g8e32f31+297cba6710,22.0.1-1-geca5380+7fa3b7d9b6,22.0.1-12-g44dc1dc+2a20fdde0d,22.0.1-15-g6a90155+515f58c32b,22.0.1-16-g9282f48+790f5f2caa,22.0.1-2-g92698f7+dcf3732eb2,22.0.1-2-ga9b0f51+7fa3b7d9b6,22.0.1-2-gd1925c9+bf4f0e694f,22.0.1-24-g1ad7a390+a9625a72a8,22.0.1-25-g5bf6245+3ad8ecd50b,22.0.1-25-gb120d7b+8b5510f75f,22.0.1-27-g97737f7+2a20fdde0d,22.0.1-32-gf62ce7b1+aa4237961e,22.0.1-4-g0b3f228+2a20fdde0d,22.0.1-4-g243d05b+871c1b8305,22.0.1-4-g3a563be+32dcf1063f,22.0.1-4-g44f2e3d+9e4ab0f4fa,22.0.1-42-gca6935d93+ba5e5ca3eb,22.0.1-5-g15c806e+85460ae5f3,22.0.1-5-g58711c4+611d128589,22.0.1-5-g75bb458+99c117b92f,22.0.1-6-g1c63a23+7fa3b7d9b6,22.0.1-6-g50866e6+84ff5a128b,22.0.1-6-g8d3140d+720564cf76,22.0.1-6-gd805d02+cc5644f571,22.0.1-8-ge5750ce+85460ae5f3,master-g6e05de7fdc+babf819c66,master-g99da0e417a+8d77f4f51a,w.2021.48
LSST Data Management Base Package
BuildSingleKernelVisitor.h
Go to the documentation of this file.
1 // -*- lsst-c++ -*-
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 
24 namespace lsst {
25 namespace ip {
26 namespace diffim {
27 namespace detail {
28 
29  template<typename PixelT>
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 
61  private:
62  lsst::afw::math::KernelList const _basisList;
64  Eigen::MatrixXd const _hMat;
65  ImageStatistics<PixelT> _imstats;
66  bool _skipBuilt;
67  int _nRejected;
68  int _nProcessed;
69  bool _useRegularization;
70 
71  bool _useCoreStats;
72  int _coreRadius;
73  };
74 
75  template<typename PixelT>
78  lsst::afw::math::KernelList const& basisList,
80  ) {
81 
83  new BuildSingleKernelVisitor<PixelT>(basisList, ps)
84  );
85  }
86 
87  template<typename PixelT>
90  lsst::afw::math::KernelList const& basisList,
92  Eigen::MatrixXd const & hMat
93  ) {
94 
96  new BuildSingleKernelVisitor<PixelT>(basisList, ps, hMat)
97  );
98  }
99 
100 }}}} // end of namespace lsst::ip::diffim::detail
101 
102 #endif
Image Subtraction helper functions.
A class to manipulate images, masks, and variance as a single object.
Definition: MaskedImage.h:73
Base class for candidate objects in a SpatialCell.
Definition: SpatialCell.h:70
Class for storing generic metadata.
Definition: PropertySet.h:66
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< BuildSingleKernelVisitor< PixelT > > makeBuildSingleKernelVisitor(lsst::afw::math::KernelList const &basisList, lsst::daf::base::PropertySet const &ps)
A base class for image defects.