LSST Applications g063fba187b+eddd1b24d7,g0f08755f38+4a855ab515,g1653933729+a8ce1bb630,g168dd56ebc+a8ce1bb630,g1a2382251a+062a45aee3,g1dcb35cd9c+45d3fa5522,g20f6ffc8e0+4a855ab515,g217e2c1bcf+f55e51b560,g28da252d5a+7d8e536cc7,g2bbee38e9b+2d92fc7d83,g2bc492864f+2d92fc7d83,g3156d2b45e+6e55a43351,g32e5bea42b+625186cc6b,g347aa1857d+2d92fc7d83,g35bb328faa+a8ce1bb630,g3a166c0a6a+2d92fc7d83,g3e281a1b8c+c5dd892a6c,g3e8969e208+a8ce1bb630,g414038480c+5927e1bc1e,g41af890bb2+1af189bab1,g7af13505b9+7b6a50a2f8,g80478fca09+6174b7f182,g82479be7b0+5b71efbaf0,g858d7b2824+4a855ab515,g9125e01d80+a8ce1bb630,ga5288a1d22+61618a97c4,gb58c049af0+d64f4d3760,gc28159a63d+2d92fc7d83,gc5452a3dca+f4add4ffd5,gcab2d0539d+d9f5af7f69,gcf0d15dbbd+6c7e0a19ec,gda6a2b7d83+6c7e0a19ec,gdaeeff99f8+1711a396fd,ge79ae78c31+2d92fc7d83,gef2f8181fd+55fff6f525,gf0baf85859+c1f95f4921,gfa517265be+4a855ab515,gfa999e8aa5+17cd334064,w.2024.51
LSST Data Management Base Package
Loading...
Searching...
No Matches
Classes | Functions
lsst.meas.algorithms.pcaPsfDeterminer Namespace Reference

Classes

class  PcaPsfDeterminerConfig
 
class  PcaPsfDeterminerTask
 

Functions

 numCandidatesToReject (numBadCandidates, numIter, totalIter)
 
 candidatesIter (psfCellSet, ignoreBad=True)
 

Function Documentation

◆ candidatesIter()

lsst.meas.algorithms.pcaPsfDeterminer.candidatesIter ( psfCellSet,
ignoreBad = True )
Generator for Psf candidates.

This allows two 'for' loops to be reduced to one.

Parameters
----------
psfCellSet : `lsst.afw.math.SpatialCellSet`
   SpatialCellSet of PSF candidates.
ignoreBad : `bool`, optional
   Ignore candidates flagged as BAD?

Yields
-------
cell : `lsst.afw.math.SpatialCell`
   A SpatialCell.
cand : `lsst.meas.algorithms.PsfCandidate`
  A PsfCandidate.

Definition at line 631 of file pcaPsfDeterminer.py.

631def candidatesIter(psfCellSet, ignoreBad=True):
632 """Generator for Psf candidates.
633
634 This allows two 'for' loops to be reduced to one.
635
636 Parameters
637 ----------
638 psfCellSet : `lsst.afw.math.SpatialCellSet`
639 SpatialCellSet of PSF candidates.
640 ignoreBad : `bool`, optional
641 Ignore candidates flagged as BAD?
642
643 Yields
644 -------
645 cell : `lsst.afw.math.SpatialCell`
646 A SpatialCell.
647 cand : `lsst.meas.algorithms.PsfCandidate`
648 A PsfCandidate.
649 """
650 for cell in psfCellSet.getCellList():
651 for cand in cell.begin(ignoreBad):
652 yield (cell, cand)
653
654

◆ numCandidatesToReject()

lsst.meas.algorithms.pcaPsfDeterminer.numCandidatesToReject ( numBadCandidates,
numIter,
totalIter )
Return the number of PSF candidates to be rejected.

The number of candidates being rejected on each iteration gradually
increases, so that on the Nth of M iterations we reject N/M of the bad
candidates.

Parameters
----------
numBadCandidates : `int`
    Number of bad candidates under consideration.

numIter : `int`
    The number of the current PSF iteration.

totalIter : `int`
    The total number of PSF iterations.

Returns
-------
return : `int`
    Number of candidates to reject.

Definition at line 43 of file pcaPsfDeterminer.py.

43def numCandidatesToReject(numBadCandidates, numIter, totalIter):
44 """Return the number of PSF candidates to be rejected.
45
46 The number of candidates being rejected on each iteration gradually
47 increases, so that on the Nth of M iterations we reject N/M of the bad
48 candidates.
49
50 Parameters
51 ----------
52 numBadCandidates : `int`
53 Number of bad candidates under consideration.
54
55 numIter : `int`
56 The number of the current PSF iteration.
57
58 totalIter : `int`
59 The total number of PSF iterations.
60
61 Returns
62 -------
63 return : `int`
64 Number of candidates to reject.
65 """
66 return int(numBadCandidates*(numIter + 1)//totalIter + 0.5)
67
68