Classification Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

Segmentation with classification

A
  • classifiers estimate likelihood functions from samples
  • classification with known number of classes and class boundaries (Thresholding)
  • classification with known number of classes (Gaussian mixture models, k-means clustering)
  • classification without prior knowledge (Mean-shift clustering, self-organizing maps)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

segmentation by classification

A
  • 2-class problem: object class, background class

- optimal solution minimizes wrong assignments of voxels v to classes c0 and cb

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

gaussian mixture models

A
  • applied if intensity distribution is combination of different distributions
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Expectation Maximization

A
  • assume K classes is known
    1. E-step: compute estimates p_ij for intensity samples Ij belonging to class i
    1. M-step: compute new parameters (mean, variance,, ) of classes
  • local optimum, need to have good starting points for mean, variance,…
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

K-Means Clustering

A
  • optimal selection of cluster centers and assignment to classes (cluster centers recomputed after each sample assignment)
    + fast convergence
    + can be used as preprocessing step for segmentation
  • strongly depends on init (trail and error)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Mean Shift Clustering

A
  • ## attempts to find all possible cluster centers in feature space
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Mean Shift Clustering

A
  • attempts to find all possible cluster centers in feature space
  • basic assumptions: each cluster pdf has only one maximum; combining pf in mixture function preserrves the maxima
  • Algorithm: for each location in feature space find next local maximum with gradien ascent algorithm; if local maximum has no cluster label, assign new label to maximum, add location to cluster
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

SLIC - Simple Linear Iterative Clustering

A
  • supervoxels are group of voxels that share common features
  • supervoxels are generated by clustering basedn on intensity similarity and distance
  • supervoxel intensity is mean of voxels in corresponding region
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Kohonens Self-organizing maps

A
  • unsupervised learning with neural networks

- similar to mean shift clustering in attemt to cluster based in inherent attributes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly