LSSTApplications  17.0+11,17.0+34,17.0+56,17.0+57,17.0+59,17.0+7,17.0-1-g377950a+33,17.0.1-1-g114240f+2,17.0.1-1-g4d4fbc4+28,17.0.1-1-g55520dc+49,17.0.1-1-g5f4ed7e+52,17.0.1-1-g6dd7d69+17,17.0.1-1-g8de6c91+11,17.0.1-1-gb9095d2+7,17.0.1-1-ge9fec5e+5,17.0.1-1-gf4e0155+55,17.0.1-1-gfc65f5f+50,17.0.1-1-gfc6fb1f+20,17.0.1-10-g87f9f3f+1,17.0.1-11-ge9de802+16,17.0.1-16-ga14f7d5c+4,17.0.1-17-gc79d625+1,17.0.1-17-gdae4c4a+8,17.0.1-2-g26618f5+29,17.0.1-2-g54f2ebc+9,17.0.1-2-gf403422+1,17.0.1-20-g2ca2f74+6,17.0.1-23-gf3eadeb7+1,17.0.1-3-g7e86b59+39,17.0.1-3-gb5ca14a,17.0.1-3-gd08d533+40,17.0.1-30-g596af8797,17.0.1-4-g59d126d+4,17.0.1-4-gc69c472+5,17.0.1-6-g5afd9b9+4,17.0.1-7-g35889ee+1,17.0.1-7-gc7c8782+18,17.0.1-9-gc4bbfb2+3,w.2019.22
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 
lsst::meas::algorithms.pcaPsfDeterminer.candidatesIter
def candidatesIter(psfCellSet, ignoreBad=True)
Definition: pcaPsfDeterminer.py:651

◆ 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 
lsst::meas::algorithms.pcaPsfDeterminer.numCandidatesToReject
def numCandidatesToReject(numBadCandidates, numIter, totalIter)
Definition: pcaPsfDeterminer.py:44
Generated on Sat Jun 8 2019 08:10:11 for LSSTApplications by   doxygen 1.8.13