• Shuffle
    Toggle On
    Toggle Off
  • Alphabetize
    Toggle On
    Toggle Off
  • Front First
    Toggle On
    Toggle Off
  • Both Sides
    Toggle On
    Toggle Off
  • Read
    Toggle On
    Toggle Off
Reading...
Front

Card Range To Study

through

image

Play button

image

Play button

image

Progress

1/10

Click to flip

Use LEFT and RIGHT arrow keys to navigate between flashcards;

Use UP and DOWN arrow keys to flip the card;

H to show hint;

A reads text to speech;

10 Cards in this Set

  • Front
  • Back
Density Slicing
simple threshoold methood, anything below a certain number is one class and anything above a certain number is another class

simple but inaccurate
Minimum Distance
the mean of each class is found in n-dimensional space - the distance between each pixel and the classes means are found - the pixels are assigned to the class to whose mean they are closest

simple and no unclassified pixels but overly simplistic
nearest neighbor
calculate the distance from each pixel to each training pixel in dimesional space the class associated weith the nearest training pixel is the one to which the pixel is assigned

simple and no unclassfied pixels but overly simplistic
K-Nearest Neighbor
selects the K nearest training pixels - weights are assigned based on distance - the class with the greatest total weight is the one to which the pixel is assigned

accounts for diepersion, but reduces the effects of outlier training pixels
Parallelepiped
class means are found in n-dimensional space - class srandard deviations are found for each band - parallelepipeds are drawn about each class mean - pixels are assigned to the class whose parallelepiped they fall

pixels that are outside of all parallelepipeds are unclassified, parallelepipeds freuentyl overlap causing confusion
maximum likelihood
based on probability rather than distance - assumes normal distributionof pixel values, procedure is done without weights so the pixel has equal probablity of being assigned to each class

most widely used, no unclassified pixels
chain method
the distance in a 2D spectral plot between each pixel value and each cluster center is compared, of the distance < D the pixel is included, if the distance is > D then a new cluster is created

no advantages over ISODATA
Unserpervised
a statistical process automatically finds clusters of like pixels patterns, no training required,
class are idetified later, sometimes resullts are difficult to interpret
Supervised
you train the computer what a class looks like and the computer finds other pixels that are similiar
Training Data vs. Reference Data
training data are used to perform the image classification

reference data are used to assess the acuracy of the image classification and should be collected after the classification

you cannot use training dats as reference data - can be collected at the same time but they should be spatially autocorrelated - collected as near as possible as the image acquistion date