LSST Applications g00d0e8bbd7+8c5ae1fdc5,g013ef56533+603670b062,g083dd6704c+2e189452a7,g199a45376c+0ba108daf9,g1c5cce2383+bc9f6103a4,g1fd858c14a+cd69ed4fc1,g210f2d0738+c4742f2e9e,g262e1987ae+612fa42d85,g29ae962dfc+83d129e820,g2cef7863aa+aef1011c0b,g35bb328faa+8c5ae1fdc5,g3fd5ace14f+5eaa884f2a,g47891489e3+e32160a944,g53246c7159+8c5ae1fdc5,g5b326b94bb+dcc56af22d,g64539dfbff+c4742f2e9e,g67b6fd64d1+e32160a944,g74acd417e5+c122e1277d,g786e29fd12+668abc6043,g87389fa792+8856018cbb,g88cb488625+47d24e4084,g89139ef638+e32160a944,g8d7436a09f+d14b4ff40a,g8ea07a8fe4+b212507b11,g90f42f885a+e1755607f3,g97be763408+34be90ab8c,g98df359435+ec1fa61bf1,ga2180abaac+8c5ae1fdc5,ga9e74d7ce9+43ac651df0,gbf99507273+8c5ae1fdc5,gc2a301910b+c4742f2e9e,gca7fc764a6+e32160a944,gd7ef33dd92+e32160a944,gdab6d2f7ff+c122e1277d,gdb1e2cdc75+1b18322db8,ge410e46f29+e32160a944,ge41e95a9f2+c4742f2e9e,geaed405ab2+0d91c11c6d,w.2025.44
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