LSSTApplications  17.0+50,17.0+84,17.0+9,18.0.0+14,18.0.0+2,18.0.0+30,18.0.0+4,18.0.0+9,18.0.0-2-ge43143a+4,18.1.0-1-g0001055,18.1.0-1-g0896a44+6,18.1.0-1-g1349e88+4,18.1.0-1-g2505f39+3,18.1.0-1-g380d4d4+4,18.1.0-1-g5e4b7ea,18.1.0-1-g85f8cd4+3,18.1.0-1-g9a6769a+2,18.1.0-1-ga1a4c1a+2,18.1.0-1-gc037db8,18.1.0-1-gd55f500+1,18.1.0-1-ge10677a+3,18.1.0-10-g73b8679e+7,18.1.0-11-g311e899+3,18.1.0-12-g0d73a3591,18.1.0-12-gc95f69a+3,18.1.0-2-g000ad9a+3,18.1.0-2-g31c43f9+3,18.1.0-2-g9c63283+4,18.1.0-2-gdf0b915+4,18.1.0-2-gf03bb23,18.1.0-3-g2e29e3d+6,18.1.0-3-g52aa583+2,18.1.0-3-g9cb968e+3,18.1.0-4-gd2e8982+6,18.1.0-5-g510c42a+3,18.1.0-5-gaeab27e+4,18.1.0-6-gdda7f3e+6,18.1.0-7-g89824ecc+4,w.2019.32
LSSTDataManagementBasePackage
Classes | Functions
lsst.meas.algorithms.pcaPsfDeterminer Namespace Reference

Classes

class  PcaPsfDeterminerConfig
 
class  PcaPsfDeterminerTask
 

Functions

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

Function Documentation

◆ candidatesIter()

def 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 651 of file pcaPsfDeterminer.py.

651 def candidatesIter(psfCellSet, ignoreBad=True):
652  """Generator for Psf candidates.
653 
654  This allows two 'for' loops to be reduced to one.
655 
656  Parameters
657  ----------
658  psfCellSet : `lsst.afw.math.SpatialCellSet`
659  SpatialCellSet of PSF candidates.
660  ignoreBad : `bool`, optional
661  Ignore candidates flagged as BAD?
662 
663  Yields
664  -------
665  cell : `lsst.afw.math.SpatialCell`
666  A SpatialCell.
667  cand : `lsst.meas.algorithms.PsfCandidate`
668  A PsfCandidate.
669  """
670  for cell in psfCellSet.getCellList():
671  for cand in cell.begin(ignoreBad):
672  yield (cell, cand)
673 
674 
675 psfDeterminerRegistry.register("pca", PcaPsfDeterminerTask)
676 
def candidatesIter(psfCellSet, ignoreBad=True)

◆ numCandidatesToReject()

def 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 44 of file pcaPsfDeterminer.py.

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