LSST Applications  21.0.0+04719a4bac,21.0.0-1-ga51b5d4+f5e6047307,21.0.0-11-g2b59f77+a9c1acf22d,21.0.0-11-ga42c5b2+86977b0b17,21.0.0-12-gf4ce030+76814010d2,21.0.0-13-g1721dae+760e7a6536,21.0.0-13-g3a573fe+768d78a30a,21.0.0-15-g5a7caf0+f21cbc5713,21.0.0-16-g0fb55c1+b60e2d390c,21.0.0-19-g4cded4ca+71a93a33c0,21.0.0-2-g103fe59+bb20972958,21.0.0-2-g45278ab+04719a4bac,21.0.0-2-g5242d73+3ad5d60fb1,21.0.0-2-g7f82c8f+8babb168e8,21.0.0-2-g8f08a60+06509c8b61,21.0.0-2-g8faa9b5+616205b9df,21.0.0-2-ga326454+8babb168e8,21.0.0-2-gde069b7+5e4aea9c2f,21.0.0-2-gecfae73+1d3a86e577,21.0.0-2-gfc62afb+3ad5d60fb1,21.0.0-25-g1d57be3cd+e73869a214,21.0.0-3-g357aad2+ed88757d29,21.0.0-3-g4a4ce7f+3ad5d60fb1,21.0.0-3-g4be5c26+3ad5d60fb1,21.0.0-3-g65f322c+e0b24896a3,21.0.0-3-g7d9da8d+616205b9df,21.0.0-3-ge02ed75+a9c1acf22d,21.0.0-4-g591bb35+a9c1acf22d,21.0.0-4-g65b4814+b60e2d390c,21.0.0-4-gccdca77+0de219a2bc,21.0.0-4-ge8a399c+6c55c39e83,21.0.0-5-gd00fb1e+05fce91b99,21.0.0-6-gc675373+3ad5d60fb1,21.0.0-64-g1122c245+4fb2b8f86e,21.0.0-7-g04766d7+cd19d05db2,21.0.0-7-gdf92d54+04719a4bac,21.0.0-8-g5674e7b+d1bd76f71f,master-gac4afde19b+a9c1acf22d,w.2021.13
LSST Data Management Base Package
StarMatch.cc
Go to the documentation of this file.
1 // -*- LSST-C++ -*-
2 /*
3  * This file is part of jointcal.
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 
25 #include <iostream>
26 #include <fstream>
27 #include <iomanip>
28 
31 #include "lsst/jointcal/BaseStar.h"
32 #include "algorithm" // for copy
33 
34 /* TO DO:
35  think about imposing a maximum number of matches that may
36  be discarded in Cleanup.
37 */
38 
39 namespace lsst {
40 namespace jointcal {
41 
42 static double sq(double x) { return x * x; }
43 
45  FatPoint tr;
46  transform.transformPosAndErrors(point1, tr);
47  double vxx = tr.vx + point2.vx;
48  double vyy = tr.vy + point2.vy;
49  double vxy = tr.vxy + point2.vxy;
50  double det = vxx * vyy - vxy * vxy;
51  return (vyy * sq(tr.x - point2.x) + vxx * sq(tr.y - point2.y) -
52  2 * vxy * (tr.x - point2.x) * (tr.y - point2.y)) /
53  det;
54 }
55 
56 std::ostream &operator<<(std::ostream &stream, const StarMatch &match) {
57  stream << match.point1.x << ' ' << match.point1.y << ' ' << match.point2.x << ' ' << match.point2.y << ' '
58  << match.distance << std::endl;
59  return stream;
60 }
61 
62 std::ostream &operator<<(std::ostream &stream, const StarMatchList &starMatchList) {
63  stream << " number of elements " << starMatchList.size() << std::endl;
64  copy(starMatchList.begin(), starMatchList.end(), std::ostream_iterator<StarMatch>(stream));
65  return stream;
66 }
67 
68 static std::unique_ptr<double[]> chi2_array(const StarMatchList &starMatchList,
69  const AstrometryTransform &transform) {
70  unsigned s = starMatchList.size();
71  auto res = std::unique_ptr<double[]>(new double[s]);
72  unsigned count = 0;
73  for (auto const &it : starMatchList) res[count++] = it.computeChi2(transform);
74  return res;
75 }
76 
77 static unsigned chi2_cleanup(StarMatchList &starMatchList, const double chi2Cut,
78  const AstrometryTransform &transform) {
79  unsigned erased = starMatchList.removeAmbiguities(transform);
80  for (auto smi = starMatchList.begin(); smi != starMatchList.end();) {
81  if (smi->chi2 > chi2Cut) {
82  smi = starMatchList.erase(smi);
83  erased++;
84  } else
85  ++smi;
86  }
87  return erased;
88 }
89 
94 void StarMatchList::refineTransform(double nSigmas) {
95  double cut;
96  unsigned nremoved;
97  if (!_transform) _transform.reset(new AstrometryTransformLinear);
98  do {
99  int nused = size();
100  if (nused <= 2) {
101  _chi2 = -1;
102  break;
103  }
104  _chi2 = _transform->fit(*this);
105  /* convention of the fitted routines :
106  - chi2 = 0 means zero degrees of freedom
107  (this was not enforced in AstrometryTransform{Lin,Quad,Cub} ...)
108  - chi2 = -1 means ndof <0 (and hence no possible fit)
109  --> in either case, refinement is over
110  The fact that chi2 = 0 was not enforced when necessary means
111  that in this (rare) case, we were discarding matches at random....
112  With AstrometryTransformPolynomial::fit, this is no longer the case.
113  */
114  if (_chi2 <= 0) return;
115  unsigned npair = int(size());
116  if (npair == 0) break; // should never happen
117 
118  // compute some chi2 statistics
119  std::unique_ptr<double[]> chi2_array(new double[npair]);
120  unsigned count = 0;
121  for (auto &starMatch : *this)
122  chi2_array[count++] = starMatch.chi2 = starMatch.computeChi2(*_transform);
123 
124  std::sort(chi2_array.get(), chi2_array.get() + npair);
125  double median = (npair & 1) ? chi2_array[npair / 2]
126  : (chi2_array[npair / 2 - 1] + chi2_array[npair / 2]) * 0.5;
127 
128  // discard outliers : the cut is understood as a "distance" cut
129  cut = sq(nSigmas) * median;
130  nremoved = chi2_cleanup(*this, cut, *_transform);
131  } while (nremoved);
132  _dist2 = computeDist2(*this, *_transform);
133 }
134 
135 /* not very robust : assumes that we went through Refine just before... */
137  int deno = (2. * size() - _transform->getNpar());
138  return (deno > 0) ? sqrt(_dist2 / deno) : -1; // is -1 a good idea?
139 }
140 
142  for (auto &smi : *this) smi.setDistance(transform); // c'est compact
143 }
144 
146  if (!which) return 0;
148  int initial_count = size();
149  if (which & 1) {
151  unique(sameStar1);
152  }
153  if (which & 2) {
155  unique(sameStar2);
156  }
157  return (initial_count - size());
158 }
159 
161  if (order == 0)
162  setTransform(std::make_shared<AstrometryTransformLinearShift>());
163  else if (order == 1)
164  setTransform(std::make_shared<AstrometryTransformLinear>());
165  else
167  // might consider throwing if order does not make sense (e.g. >10)
168  _order = order;
169 }
170 
171 /* This routine should operate on a copy : refineTransform
172  might shorten the list */
173 /* it is not const although it tries not to change anything */
175  if (!_transform) return nullptr;
176 
177  auto old_transform = _transform->clone();
178  double old_chi2 = _chi2;
179 
180  swap();
181  setTransformOrder(_order);
182  refineTransform(3.); // keep same order
183  auto inverted_transform = _transform->clone();
184  setTransform(old_transform.get());
185  swap();
186  _chi2 = old_chi2;
187 
188  return inverted_transform;
189 }
190 
191 void StarMatchList::cutTail(int nKeep) {
192  iterator si;
193  int count = 0;
194  for (si = begin(); si != end() && count < nKeep; ++count, ++si)
195  ;
196  erase(si, end());
197 }
198 
200  for (auto &starMatch : *this) {
201  starMatch.swap();
202  }
203 }
204 
205 int StarMatchList::recoveredNumber(double mindist) const {
206  int n = 0;
208  for (auto const &starMatch : *this) {
209  if (starMatch.computeDistance(identity) < mindist) n++;
210  }
211  return (n);
212 }
213 
214 void StarMatchList::applyTransform(StarMatchList &transformed, const AstrometryTransform *priorTransform,
215  const AstrometryTransform *posteriorTransform) const {
216  transformed.clear();
218  const AstrometryTransform &T1 = (priorTransform) ? *priorTransform : id;
219  const AstrometryTransform &T2 = (posteriorTransform) ? *posteriorTransform : id;
220 
221  for (auto const &starMatch : *this) {
222  FatPoint p1;
223  T1.transformPosAndErrors(starMatch.point1, p1);
224  FatPoint p2;
225  T2.transformPosAndErrors(starMatch.point2, p2);
226  transformed.push_back(StarMatch(p1, p2, starMatch.s1, starMatch.s2));
227  }
228 }
229 
231  stream << " ================================================================" << std::endl
232  << " Transformation between lists of order " << getTransformOrder() << std::endl
233  << *_transform //<< endl
234  << " Chi2 = " << getChi2() << " Residual = " << computeResidual() << std::endl
235  << " Number in the list = " << size() << std::endl
236  << " ================================================================" << std::endl;
237 }
238 
239 double computeDist2(const StarMatchList &starMatchList, const AstrometryTransform &transform) {
240  double dist2 = 0;
241  for (auto const &starMatch : starMatchList)
242  dist2 += transform.apply(starMatch.point1).computeDist2(starMatch.point2);
243  return dist2;
244 }
245 
246 double computeChi2(const StarMatchList &starMatchList, const AstrometryTransform &transform) {
247  unsigned s = starMatchList.size();
248  std::unique_ptr<double[]> chi2s(chi2_array(starMatchList, transform));
249  double chi2 = 0;
250  for (unsigned k = 0; k < s; ++k) chi2 += chi2s[k];
251  return chi2;
252 }
253 } // namespace jointcal
254 } // namespace lsst
double x
table::Key< int > id
Definition: Detector.cc:162
pairs of points
table::Key< int > transform
T begin(T... args)
a virtual (interface) class for geometric transformations.
virtual void transformPosAndErrors(const FatPoint &in, FatPoint &out) const
A do-nothing transformation. It anyway has dummy routines to mimick a AstrometryTransform.
implements the linear transformations (6 real coefficients).
A Point with uncertainties.
Definition: FatPoint.h:34
double x
coordinate
Definition: Point.h:41
A hanger for star associations.
Definition: StarMatch.h:54
double computeChi2(const AstrometryTransform &transform) const
returns the chi2 (using errors in the FatPoint's)
Definition: StarMatch.cc:44
FatPoint point2
2 points
Definition: StarMatch.h:60
std::unique_ptr< AstrometryTransform > inverseTransform()
returns the inverse transform (swap, fit(refineTransform) , and swap).
Definition: StarMatch.cc:174
void setDistance(const AstrometryTransform &transform)
Sets the distance (residual) field of all std::list elements. Mandatory before sorting on distances.
Definition: StarMatch.cc:141
void printTransform(std::ostream &stream=std::cout) const
print the matching transformation quality (transform, chi2, residual)
Definition: StarMatch.cc:230
void swap()
swaps elements 1 and 2 of each starmatch in std::list.
Definition: StarMatch.cc:199
double getChi2() const
access to the chi2 of the last call to refineTransform.
Definition: StarMatch.h:170
int getTransformOrder() const
returns the order of the used transform
Definition: StarMatch.h:173
void setTransform(const AstrometryTransform *transform)
sets a transform between the 2 std::lists and deletes the previous or default one....
Definition: StarMatch.h:187
int recoveredNumber(double mindist) const
count the number of elements for which distance is < mindist
Definition: StarMatch.cc:205
void setTransformOrder(int order)
set transform according to the given order.
Definition: StarMatch.cc:160
double computeResidual() const
returns the average 1d Residual (last call to refineTransform)
Definition: StarMatch.cc:136
unsigned removeAmbiguities(const AstrometryTransform &transform, int which=3)
cleans up the std::list of pairs for pairs that share one of their stars, keeping the closest one.
Definition: StarMatch.cc:145
void cutTail(int nKeep)
deletes the tail of the match std::list
Definition: StarMatch.cc:191
void applyTransform(StarMatchList &transformed, const AstrometryTransform *priorTransform, const AstrometryTransform *posteriorTransform=nullptr) const
enables to get a transformed StarMatchList.
Definition: StarMatch.cc:214
void refineTransform(double nSigmas)
removes pairs beyond nSigmas in distance (where the sigma scale is set by the fit) and iterates until...
Definition: StarMatch.cc:94
T clear(T... args)
T copy(T... args)
T count(T... args)
T end(T... args)
T endl(T... args)
StarMatch erase(StarMatch ... args)
bool compareStar1(const StarMatch &one, const StarMatch &two)
Definition: StarMatch.h:115
bool sameStar2(const StarMatch &one, const StarMatch &two)
Definition: StarMatch.h:125
bool sameStar1(const StarMatch &one, const StarMatch &two)
Definition: StarMatch.h:119
bool compareStar2(const StarMatch &one, const StarMatch &two)
Definition: StarMatch.h:121
double computeDist2(const StarMatchList &S, const AstrometryTransform &transform)
sum of distance squared
Definition: StarMatch.cc:239
std::ostream & operator<<(std::ostream &stream, AstrometryMapping const &mapping)
double computeChi2(const StarMatchList &L, const AstrometryTransform &transform)
the actual chi2
Definition: StarMatch.cc:246
A base class for image defects.
T push_back(T... args)
T size(T... args)
T sort(T... args)
T sqrt(T... args)
StarMatch unique(StarMatch ... args)