LSSTApplications  18.0.0+106,18.0.0+50,19.0.0,19.0.0+1,19.0.0+10,19.0.0+11,19.0.0+13,19.0.0+17,19.0.0+2,19.0.0-1-g20d9b18+6,19.0.0-1-g425ff20,19.0.0-1-g5549ca4,19.0.0-1-g580fafe+6,19.0.0-1-g6fe20d0+1,19.0.0-1-g7011481+9,19.0.0-1-g8c57eb9+6,19.0.0-1-gb5175dc+11,19.0.0-1-gdc0e4a7+9,19.0.0-1-ge272bc4+6,19.0.0-1-ge3aa853,19.0.0-10-g448f008b,19.0.0-12-g6990b2c,19.0.0-2-g0d9f9cd+11,19.0.0-2-g3d9e4fb2+11,19.0.0-2-g5037de4,19.0.0-2-gb96a1c4+3,19.0.0-2-gd955cfd+15,19.0.0-3-g2d13df8,19.0.0-3-g6f3c7dc,19.0.0-4-g725f80e+11,19.0.0-4-ga671dab3b+1,19.0.0-4-gad373c5+3,19.0.0-5-ga2acb9c+2,19.0.0-5-gfe96e6c+2,w.2020.01
LSSTDataManagementBasePackage
Interp.h
Go to the documentation of this file.
1 // -*- LSST-C++ -*-
2 
3 /*
4  * LSST Data Management System
5  * Copyright 2008-2015 LSST Corporation.
6  *
7  * This product includes software developed by the
8  * LSST Project (http://www.lsst.org/).
9  *
10  * This program is free software: you can redistribute it and/or modify
11  * it under the terms of the GNU General Public License as published by
12  * the Free Software Foundation, either version 3 of the License, or
13  * (at your option) any later version.
14  *
15  * This program is distributed in the hope that it will be useful,
16  * but WITHOUT ANY WARRANTY; without even the implied warranty of
17  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18  * GNU General Public License for more details.
19  *
20  * You should have received a copy of the LSST License Statement and
21  * the GNU General Public License along with this program. If not,
22  * see <http://www.lsstcorp.org/LegalNotices/>.
23  */
24 
25 #if !defined(LSST_MEAS_ALGORITHMS_INTERP_H)
26 #define LSST_MEAS_ALGORITHMS_INTERP_H
27 // Interpolate over defects in a MaskedImage
29 //
30 #include <limits>
31 #include <vector>
32 
33 #include "lsst/geom/Box.h"
34 #include "lsst/afw/image/Defect.h"
36 
37 namespace lsst {
38 namespace afw {
39 namespace detection {
40 
41 class Psf;
42 }
43 } // namespace afw
44 
45 namespace meas {
46 namespace algorithms {
47 namespace interp {
51 double const lpc_1_c1 = 0.7737;
52 double const lpc_1_c2 = -0.2737;
57 double const lpc_1s2_c1 = 0.7358;
58 double const lpc_1s2_c2 = -0.2358;
59 /*
60  * Used to debias min(x, y)
61  */
62 double const min2GaussianBias = -0.5641895835;
63 
64 template <typename MaskedImageT>
66  bool horizontal, double minval);
67 } // namespace interp
68 
73 public:
75 
77  LEFT = 1,
82  WIDE,
86  RIGHT
87  };
88 
89  enum { WIDE_DEFECT = 11 };
90 
91  explicit Defect(const geom::BoxI &bbox = geom::BoxI()
92  )
93  : afw::image::DefectBase(bbox), _pos(static_cast<DefectPosition>(0)), _type(0) {}
94  virtual ~Defect() {}
95 
97  unsigned int type
98  ) {
99  _pos = pos;
100  _type = type;
101  }
102 
103  unsigned int getType() const { return _type; }
104  DefectPosition getPos() const { return _pos; }
105 private:
106  DefectPosition _pos;
107  unsigned int _type;
108 };
109 
110 template <typename MaskedImageT>
111 void interpolateOverDefects(MaskedImageT &image, afw::detection::Psf const &psf,
112  std::vector<Defect::Ptr> &badList, double fallbackValue = 0.0,
113  bool useFallbackValueAtEdge = false);
114 
115 } // namespace algorithms
116 } // namespace meas
117 } // namespace lsst
118 
119 #endif
AmpInfoBoxKey bbox
Definition: Amplifier.cc:117
defect is wide at right boundary
Definition: Interp.h:85
defect is in middle, and wide
Definition: Interp.h:82
double const min2GaussianBias
Mean value of the minimum of two N(0,1) variates.
Definition: Interp.h:62
Encapsulate information about a bad portion of a detector.
Definition: Defect.h:41
int y
Definition: SpanSet.cc:49
defect is in middle of frame
Definition: Interp.h:80
defect is near right boundary
Definition: Interp.h:84
A base class for image defects.
table::Key< int > type
Definition: Detector.cc:163
defect is near right, and wide
Definition: Interp.h:83
DefectPosition getPos() const
Return the position of the defect.
Definition: Interp.h:104
defect is wide at left boundary
Definition: Interp.h:79
defect is near left, and wide
Definition: Interp.h:81
std::shared_ptr< Defect > Ptr
shared pointer to Defect
Definition: Interp.h:74
unsigned int getType() const
Return the defect&#39;s interpolation type.
Definition: Interp.h:103
double x
void classify(DefectPosition pos, unsigned int type)
Definition: Interp.h:96
STL class.
std::pair< bool, typename MaskedImageT::Image::Pixel > singlePixel(int x, int y, MaskedImageT const &image, bool horizontal, double minval)
Return a boolean status (true: interpolation is OK) and the interpolated value for a pixel...
Definition: Interp.cc:2125
defect is near left boundary
Definition: Interp.h:78
Backwards-compatibility support for depersisting the old Calib (FluxMag0/FluxMag0Err) objects...
A polymorphic base class for representing an image&#39;s Point Spread Function.
Definition: Psf.h:75
An integer coordinate rectangle.
Definition: Box.h:55
double const lpc_1s2_c1
LPC coefficients for sigma = 1/sqrt(2), S/N = infty.
Definition: Interp.h:57
void interpolateOverDefects(MaskedImageT &image, afw::detection::Psf const &psf, std::vector< Defect::Ptr > &badList, double fallbackValue=0.0, bool useFallbackValueAtEdge=false)
Process a set of known bad pixels in an image.
Definition: Interp.cc:2047
double const lpc_1_c1
LPC coefficients for sigma = 1, S/N = infty.
Definition: Interp.h:51
Encapsulate information about a bad portion of a detector.
Definition: Interp.h:72
Defect(const geom::BoxI &bbox=geom::BoxI())
Definition: Interp.h:91