LSST Applications g042eb84c57+730a74494b,g04e9c324dd+8c5ae1fdc5,g134cb467dc+1f1e3e7524,g199a45376c+0ba108daf9,g1fd858c14a+fa7d31856b,g210f2d0738+f66ac109ec,g262e1987ae+83a3acc0e5,g29ae962dfc+d856a2cb1f,g2cef7863aa+aef1011c0b,g35bb328faa+8c5ae1fdc5,g3fd5ace14f+a1e0c9f713,g47891489e3+0d594cb711,g4d44eb3520+c57ec8f3ed,g4d7b6aa1c5+f66ac109ec,g53246c7159+8c5ae1fdc5,g56a1a4eaf3+fd7ad03fde,g64539dfbff+f66ac109ec,g67b6fd64d1+0d594cb711,g67fd3c3899+f66ac109ec,g6985122a63+0d594cb711,g74acd417e5+3098891321,g786e29fd12+668abc6043,g81db2e9a8d+98e2ab9f28,g87389fa792+8856018cbb,g89139ef638+0d594cb711,g8d7436a09f+80fda9ce03,g8ea07a8fe4+760ca7c3fc,g90f42f885a+033b1d468d,g97be763408+a8a29bda4b,g99822b682c+e3ec3c61f9,g9d5c6a246b+0d5dac0c3d,ga41d0fce20+9243b26dd2,gbf99507273+8c5ae1fdc5,gd7ef33dd92+0d594cb711,gdab6d2f7ff+3098891321,ge410e46f29+0d594cb711,geaed405ab2+c4bbc419c6,gf9a733ac38+8c5ae1fdc5,w.2025.38
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)