LSST Applications g013ef56533+d2224463a4,g199a45376c+0ba108daf9,g19c4beb06c+9f335b2115,g1fd858c14a+2459ca3e43,g210f2d0738+2d3d333a78,g262e1987ae+abbb004f04,g2825c19fe3+eedc38578d,g29ae962dfc+0cb55f06ef,g2cef7863aa+aef1011c0b,g35bb328faa+8c5ae1fdc5,g3fd5ace14f+19c3a54948,g47891489e3+501a489530,g4cdb532a89+a047e97985,g511e8cfd20+ce1f47b6d6,g53246c7159+8c5ae1fdc5,g54cd7ddccb+890c8e1e5d,g5fd55ab2c7+951cc3f256,g64539dfbff+2d3d333a78,g67b6fd64d1+501a489530,g67fd3c3899+2d3d333a78,g74acd417e5+0ea5dee12c,g786e29fd12+668abc6043,g87389fa792+8856018cbb,g89139ef638+501a489530,g8d7436a09f+5ea4c44d25,g8ea07a8fe4+81eaaadc04,g90f42f885a+34c0557caf,g9486f8a5af+165c016931,g97be763408+d5e351dcc8,gbf99507273+8c5ae1fdc5,gc2a301910b+2d3d333a78,gca7fc764a6+501a489530,gce8aa8abaa+8c5ae1fdc5,gd7ef33dd92+501a489530,gdab6d2f7ff+0ea5dee12c,ge410e46f29+501a489530,geaed405ab2+e3b4b2a692,gf9a733ac38+8c5ae1fdc5,w.2025.41
LSST Data Management Base Package
Loading...
Searching...
No Matches
CloughTocher2DInterpolatorUtils.cc
Go to the documentation of this file.
1// -*- LSST-C++ -*-
2/*
3 * This file is part of meas_algorithms.
4 *
5 * Developed for the LSST Data Management System.
6 * This product includes software developed by the LSST Project
7 * (https://www.lsst.org).
8 * See the COPYRIGHT file at the top-level directory of this distribution
9 * for details of code ownership.
10 *
11 * This program is free software: you can redistribute it and/or modify
12 * it under the terms of the GNU General Public License as published by
13 * the Free Software Foundation, either version 3 of the License, or
14 * (at your option) any later version.
15 *
16 * This program is distributed in the hope that it will be useful,
17 * but WITHOUT ANY WARRANTY; without even the implied warranty of
18 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
19 * GNU General Public License for more details.
20 *
21 * You should have received a copy of the GNU General Public License
22 * along with this program. If not, see <https://www.gnu.org/licenses/>.
23 */
24
31
35#include "lsst/geom/Point.h"
37
38namespace lsst {
39namespace meas {
40namespace algorithms {
41
42std::pair<ndarray::Array<float, 2, 2>, ndarray::Array<float, 2, 2>>
44 std::vector<std::string> const &maskPlanes,
45 int const buffer) {
46 auto bitMask = afw::image::Mask<>::getPlaneBitMask(maskPlanes);
47
48 auto badSpanSet = afw::geom::SpanSet::fromMask(
49 *mimage.getMask(), [bitMask](afw::image::MaskPixel pixel) { return bool(pixel & bitMask); });
50 ndarray::Array<float, 2, 2> badPixelArray = ndarray::allocate(badSpanSet->getArea(), 3);
51 badSpanSet->applyFunctor(
52 [](geom::Point2I pt, float &x, float &y, float &valueOut, float valueIn) {
53 x = pt.getX();
54 y = pt.getY();
55 valueOut = valueIn;
56 },
57 ndFlat(badPixelArray[ndarray::view()(0)].shallow()),
58 ndFlat(badPixelArray[ndarray::view()(1)].shallow()),
59 ndFlat(badPixelArray[ndarray::view()(2)].shallow()),
60 *mimage.getImage());
61
62 auto allSpanSet = badSpanSet->dilated(buffer, afw::geom::Stencil::BOX);
63 auto goodSpanSet = allSpanSet->intersectNot(*badSpanSet);
64 goodSpanSet = goodSpanSet->clippedTo(mimage.getBBox());
65
66 badSpanSet.reset();
67 allSpanSet.reset();
68
69 ndarray::Array<float, 2, 2> goodPixelArray = ndarray::allocate(goodSpanSet->getArea(), 3);
70 goodSpanSet->applyFunctor(
71 [](geom::Point2I pt, float &x, float &y, float &valueOut, float valueIn) {
72 x = pt.getX();
73 y = pt.getY();
74 valueOut = valueIn;
75 },
76 ndFlat(goodPixelArray[ndarray::view()(0)].shallow()),
77 ndFlat(goodPixelArray[ndarray::view()(1)].shallow()),
78 ndFlat(goodPixelArray[ndarray::view()(2)].shallow()),
79 *mimage.getImage());
80
81 goodSpanSet.reset();
82
83 return std::make_pair(badPixelArray, goodPixelArray);
84}
85
86void CloughTocher2DInterpolatorUtils::updateArrayFromImage(ndarray::Array<float, 2, 2> const &pixelArray,
88 afw::image::CheckIndices docheck(true);
89 auto x0 = image.getX0();
90 auto y0 = image.getY0();
91 for (auto row : pixelArray) {
92 int x = row[0] - x0;
93 int y = row[1] - y0;
94 row[2] = image(x, y, docheck);
95 }
96}
97
99 afw::image::Image<float> &image, ndarray::Array<float const, 2, 2> const &pixelArray) {
100 afw::image::CheckIndices docheck(true);
101 auto x0 = image.getX0();
102 auto y0 = image.getY0();
103 for (auto row : pixelArray) {
104 int x = row[0] - x0;
105 int y = row[1] - y0;
106 image(x, y, docheck) = row[2];
107 }
108}
109
110} // namespace algorithms
111} // namespace meas
112} // namespace lsst
Provide pixel-level utilities to support CloughTocher2DInterpolator.
static std::shared_ptr< geom::SpanSet > fromMask(image::Mask< T > const &mask, UnaryPredicate comparator=details::AnyBitSetFunctor< T >())
Create a SpanSet from a mask.
Definition SpanSet.h:644
A class used to request that array accesses be checked.
Definition ImageBase.h:74
A class to represent a 2-dimensional array of pixels.
Definition Image.h:51
Represent a 2-dimensional array of bitmask pixels.
Definition Mask.h:82
A class to manipulate images, masks, and variance as a single object.
Definition MaskedImage.h:74
lsst::geom::Box2I getBBox(ImageOrigin const origin=PARENT) const
MaskPtr getMask() const
Return a (shared_ptr to) the MaskedImage's mask.
ImagePtr getImage() const
Return a (shared_ptr to) the MaskedImage's image.
static void updateArrayFromImage(ndarray::Array< float, 2, 2 > const &pixelArray, afw::image::Image< PixelT > const &image)
Update the values (third column) of the pixelArray from the image.
static std::pair< ndarray::Array< float, 2, 2 >, ndarray::Array< float, 2, 2 > > findGoodPixelsAroundBadPixels(afw::image::MaskedImage< PixelT, afw::image::MaskPixel, afw::image::VariancePixel > const &mimage, std::vector< std::string > const &maskPlanes, int const buffer)
Find the positions of bad pixels as defined by the masks, and also find the location and pixel value ...
static void updateImageFromArray(afw::image::Image< PixelT > &image, ndarray::Array< float const, 2, 2 > const &pixelArray)
Update the pixel values of the image from the pixelArray.
T make_pair(T... args)
std::int32_t MaskPixel
default type for Masks and MaskedImage Masks
Point< int, 2 > Point2I
Definition Point.h:321