LSST Applications g180d380827+770a9040cc,g2079a07aa2+86d27d4dc4,g2305ad1205+09cfdadad9,g2bbee38e9b+c6a8a0fb72,g337abbeb29+c6a8a0fb72,g33d1c0ed96+c6a8a0fb72,g3a166c0a6a+c6a8a0fb72,g3ddfee87b4+1ea5e09c42,g48712c4677+7e2ea9cd42,g487adcacf7+301d09421d,g50ff169b8f+96c6868917,g52b1c1532d+585e252eca,g591dd9f2cf+96fcb956a6,g64a986408d+23540ee355,g858d7b2824+23540ee355,g864b0138d7+aa38e45daa,g95921f966b+d83dc58ecd,g991b906543+23540ee355,g99cad8db69+7f13b58a93,g9c22b2923f+e2510deafe,g9ddcbc5298+9a081db1e4,ga1e77700b3+03d07e1c1f,gb0e22166c9+60f28cb32d,gb23b769143+23540ee355,gba4ed39666+c2a2e4ac27,gbb8dafda3b+49e7449578,gbd998247f1+585e252eca,gc120e1dc64+1bbfa184e1,gc28159a63d+c6a8a0fb72,gc3e9b769f7+385ea95214,gcf0d15dbbd+1ea5e09c42,gdaeeff99f8+f9a426f77a,ge6526c86ff+1bccc98490,ge79ae78c31+c6a8a0fb72,gee10cc3b42+585e252eca,w.2024.18
LSST Data Management Base Package
Loading...
Searching...
No Matches
MatchSrcToCatalogue.cc
Go to the documentation of this file.
1// -*- LSST-C++ -*-
2
3/*
4 * LSST Data Management System
5 * Copyright 2008, 2009, 2010 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
26#include "lsst/geom/Angle.h"
28
29namespace lsst {
30namespace meas {
31namespace astrom {
32namespace sip {
33
57
60 if (dist <= 0) {
61 throw LSST_EXCEPT(pex::exceptions::InvalidParameterError, "Distance must be > 0");
62 }
63 _dist = dist;
64}
65
68
70void MatchSrcToCatalogue::setImgSrcSet(afw::table::SourceCatalog const& srcSet) { _imgSet = srcSet; }
71
72void MatchSrcToCatalogue::setCatSrcSet(afw::table::SimpleCatalog const& srcSet) { _catSet = srcSet; }
73
75 if (!_imgSet.getTable()->getCentroidSlot().isValid()) {
77 "SourceTable passed to MatchSrcToCatalogue does not have its centroid slot set.");
78 }
79
80 for (afw::table::SourceCatalog::const_iterator i = _imgSet.begin(); i != _imgSet.end(); ++i) {
81 i->updateCoord(*_wcs);
82 }
83
84 _match = afw::table::matchRaDec(_catSet, _imgSet, _dist);
85
86 _removeOneToMany();
87 _removeManyToOne();
88}
89
93void MatchSrcToCatalogue::_removeOneToMany() {
94 std::size_t size = _match.size();
95 for (std::size_t i = 0; i < size; ++i) {
96 for (std::size_t j = i + 1; j < size; ++j) {
97 // If the same Source appears twice keep the one with the smaller separation from its match
98 if (_match[i].first == _match[j].first) {
99 // Keep the one with the shorter match distance, and disgard the other
100 if (_match[i].distance < _match[j].distance) {
101 _match.erase(_match.begin() + j);
102 size--;
103 j--;
104 } else {
105 _match.erase(_match.begin() + i);
106 size--;
107 i--;
108 break;
109 }
110 }
111 }
112 }
113}
114
117void MatchSrcToCatalogue::_removeManyToOne() {
118 std::size_t size = _match.size();
119 for (std::size_t i = 0; i < size; ++i) {
120 for (std::size_t j = i + 1; j < size; ++j) {
121 // If the same Source appears twice
122 if (_match[i].second == _match[j].second) {
123 // Keep the one with the shorter match distance, and disgard the other
124 if (_match[i].distance < _match[j].distance) {
125 _match.erase(_match.begin() + j);
126 size--;
127 j--;
128 } else {
129 _match.erase(_match.begin() + i);
130 size--;
131 i--;
132 break;
133 }
134 }
135 }
136 }
137}
138
143
144} // namespace sip
145} // namespace astrom
146} // namespace meas
147} // namespace lsst
#define LSST_EXCEPT(type,...)
Create an exception with a given type.
Definition Exception.h:48
table::Key< table::Array< std::uint8_t > > wcs
Definition SkyWcs.cc:66
T begin(T... args)
Custom catalog class for record/table subclasses that are guaranteed to have an ID,...
typename Base::const_iterator const_iterator
A class representing an angle.
Definition Angle.h:128
void setWcs(std::shared_ptr< afw::geom::SkyWcs const > wcs)
Set a different Wcs solution.
afw::table::ReferenceMatchVector getMatches()
void setDist(geom::Angle dist)
Set a new value for the maximum allowed distance between two matching objects (in ra/dec space)
MatchSrcToCatalogue(afw::table::SimpleCatalog const &catSet, afw::table::SourceCatalog const &imgSet, std::shared_ptr< afw::geom::SkyWcs const > wcs, geom::Angle dist)
Create a list of common objects from a catalogue and an image.
void setCatSrcSet(afw::table::SimpleCatalog const &catSet)
void setImgSrcSet(afw::table::SourceCatalog const &srcSet)
sourceSet is a vector of pointers to Sources.
Reports invalid arguments.
Definition Runtime.h:66
Reports errors in the logical structure of the program.
Definition Runtime.h:46
T erase(T... args)
std::vector< Match< typename Cat1::Record, typename Cat2::Record > > matchRaDec(Cat1 const &cat1, Cat2 const &cat2, lsst::geom::Angle radius, MatchControl const &mc=MatchControl())
Compute all tuples (s1,s2,d) where s1 belings to cat1, s2 belongs to cat2 and d, the distance between...
Definition Match.cc:158
T size(T... args)