Run Particle Clustering » History » Version 1
Anke Mulder, 05/18/2010 02:09 PM
1 | 1 | Anke Mulder | h1. Run Particle Clustering |
---|---|---|---|
2 | |||
3 | After interimage variance analysis and data reduction procedures done via feature analysis, particles are ordered and summed according to their relative similarity (proximity in reduced multidimensional image point space). Traditional methods include k-means and hierarchical ascendant classification (Frank et al _Journal of Microscopy_ |
||
4 | |||
5 | h2. Feature Analysis Procedures |
||
6 | |||
7 | # [[Spider Coran Classification]] |
||
8 | # [[Xmipp Kerden Self-Organizing Map]] |
||
9 | # [[Xmipp Rotational Kerden Self-Organizing Map]] |
||
10 | |||
11 | |||
12 | |||
13 | |||
14 | ______ |
||
15 | |||
16 | [[Run_Alignment|<Run Alignment]] | [[Run Particle Clustering|Run Particle Clustering >]] |
||
17 | |||
18 | ______ |