LSST Applications g042eb84c57+730a74494b,g04e9c324dd+8c5ae1fdc5,g134cb467dc+1f1e3e7524,g199a45376c+0ba108daf9,g1fd858c14a+fa7d31856b,g210f2d0738+f66ac109ec,g262e1987ae+83a3acc0e5,g29ae962dfc+d856a2cb1f,g2cef7863aa+aef1011c0b,g35bb328faa+8c5ae1fdc5,g3fd5ace14f+a1e0c9f713,g47891489e3+0d594cb711,g4d44eb3520+c57ec8f3ed,g4d7b6aa1c5+f66ac109ec,g53246c7159+8c5ae1fdc5,g56a1a4eaf3+fd7ad03fde,g64539dfbff+f66ac109ec,g67b6fd64d1+0d594cb711,g67fd3c3899+f66ac109ec,g6985122a63+0d594cb711,g74acd417e5+3098891321,g786e29fd12+668abc6043,g81db2e9a8d+98e2ab9f28,g87389fa792+8856018cbb,g89139ef638+0d594cb711,g8d7436a09f+80fda9ce03,g8ea07a8fe4+760ca7c3fc,g90f42f885a+033b1d468d,g97be763408+a8a29bda4b,g99822b682c+e3ec3c61f9,g9d5c6a246b+0d5dac0c3d,ga41d0fce20+9243b26dd2,gbf99507273+8c5ae1fdc5,gd7ef33dd92+0d594cb711,gdab6d2f7ff+3098891321,ge410e46f29+0d594cb711,geaed405ab2+c4bbc419c6,gf9a733ac38+8c5ae1fdc5,w.2025.38
LSST Data Management Base Package
Loading...
Searching...
No Matches
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