LSSTApplications
10.0-2-g4f67435,11.0.rc2+1,11.0.rc2+12,11.0.rc2+3,11.0.rc2+4,11.0.rc2+5,11.0.rc2+6,11.0.rc2+7,11.0.rc2+8
LSSTDataManagementBasePackage
|
Classes | |
class | ObjectSizeStarSelectorConfig |
class | EventHandler |
class | ObjectSizeStarSelector |
A measurePsfTask star selector. More... | |
Functions | |
def | _assignClusters |
def | _kcenters |
def | _improveCluster |
def | plot |
Variables | |
fig = None | |
pyplot = None | |
|
private |
Return a vector of centerIds based on their distance to the centers
Definition at line 130 of file objectSizeStarSelector.py.
|
private |
Improve our estimate of one of the clusters (clusterNum) by sigma-clipping around its median
Definition at line 185 of file objectSizeStarSelector.py.
|
private |
A classic k-means algorithm, clustering yvec into nCluster clusters Return the set of centres, and the cluster ID for each of the points If useMedian is true, use the median of the cluster as its centre, rather than the traditional mean Serge Monkewitz points out that there other (maybe smarter) ways of seeding the means: "e.g. why not use the Forgy or random partition initialization methods" however, the approach adopted here seems to work well for the particular sorts of things we're clustering in this application
Definition at line 150 of file objectSizeStarSelector.py.
def lsst.meas.algorithms.objectSizeStarSelector.plot | ( | mag, | |
width, | |||
centers, | |||
clusterId, | |||
marker = "o" , |
|||
markersize = 2 , |
|||
markeredgewidth = 0 , |
|||
ltype = '-' , |
|||
clear = True |
|||
) |
Definition at line 218 of file objectSizeStarSelector.py.
lsst.meas.algorithms.objectSizeStarSelector.fig = None |
Definition at line 27 of file objectSizeStarSelector.py.
lsst.meas.algorithms.objectSizeStarSelector.pyplot = None |
Definition at line 29 of file objectSizeStarSelector.py.