Lec 10 - Information Extraction Flashcards

1
Q

Purposes of Image Extraction (4)

A

(1) Categorizing data
(2) Data simplification
(3) Data interpretation
(4) Mapping

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

Overall objective of classification

A

Automatically categorize all pixels in an image into land cover classes or themes

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

Selection of Classification (3)

A

(1) The nature of the data being analyzed
(2) The computational resources available
(3) The intended application of the classified data

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

Pattern Recognitions (3)

A

(1) Spatial pattern recognition
(2) Spectral pattern recognition
(3) Temporal pattern recognition

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

Use spatial context to distinguish between different classes

A

Spatial Pattern Recognition

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

Most widely-used pattern recognition that distinguish between different land cover classes from differences in the spectral reflectance

A

Spectral Pattern Recognition

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

The ability to distinguish patterns based on spectral or spatial considerations that may vary over the year

A

Temporal Pattern Recognition

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

Land Cover Mapping and Applications of Remote Sensing

A

(1) Understanding of the type and amount of land cover in an area is an important characteristic
(2) Remote sensing has become a powerful tool for land cover identification and classification
(3) The investment in the development of this technology has contributed to Precision Agriculture

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

Steps in Thematic Information Extraction from Satellite Images

A

(1) Definition of the mapping approach
(2) Geographical stratification
(3) Image segmentation (for object-oriented classification)
(4) Feature Identification and Selection
(5) Classification

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

The unit to which the classification algorithms will be applied.

A

Spatial unit of analysis

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

The study area is divided into smaller areas (strata) so that each strata can be processed independently

A

Geographical stratification

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

The division of an image into spatially continuous, disjoint and homogenous regions

A

Image segmentation

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

The manipulation and selection of features are used to reduce the number of features without sacrificing accuracy

A

Feature Identification and Selection

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

The process of partitioning an image data set into a discrete number of classes in accordance with specific criteria that are based, in part, on the individual image point data values (recognize patterns).

A

Classification

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

This depends on the type of information you want to extract from the original data. May simply represent areas that look different to the computer or may be associated with known features on the ground.

A

Classes

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

Types of Classification (based on type of learning

A

(1) Supervised
(2) Unsupervised
(3) Hybrid

17
Q

Type of classification that requires “training pixels”, pixels where both the spectral values and the class is known.

A

Supervised

18
Q

Type of classification where no extraneous data is used: classes are determined purely on difference in spectral values.

A

Unsupervised

19
Q

Use unsupervised and supervised classification together

20
Q

Supervised Classification Steps

A

(1) Training stage
(2) Classification stage
(3) Output stage

21
Q

Pixel observations from training sites are plotted on scatter diagrams and are used as a basis of setting up the statistical parameters used to classify pixels outside these sites.

A

Classification stage

22
Q

This type of classifier determines the mean value (DN) of each class in each band, and then assigns unknown pixels to classes whose means are most similar to the value of the unknown pixel.

A

Minimum Distance to Means

23
Q

Benefit of Minimum Distance to Means

A

This method is quite computationally efficient since it is mathematically simple, which made it a good choice before the advent of modern computers.

24
Q

Drawback of Minimum Distance to Means

A

Insensitive to different degrees of variance in spectral response data

25
The most powerful classifier in common use. A statistical decision rule that examines the probability function of a pixel for each of the classes, and assigns the pixel to the class with the highest probability.
Maximum Likelihood
26
Benefit of Maximum Likelihood
Takes variation in spectral response into consideration
27
Drawback of Maximum Likelihood
Computationally intensive; multimodal or non-normally distributed classes require extra care when training the classifier, if high accuracy is to be achieved
28
This works by delineating the boundaries of a training class using straight lines.
Parallelepiped
29
Benefit of Parallelepiped
This method is computationally fast, simple to train and use
30
Drawbacks of Parallelepiped
Using straight lines to delineate the classes limits the method's effectiveness. Also, having pixels classified as unknown may be undesirable for some applications
31
It is based on correlations (statistics) between variables by which different patterns can be identified and analyzed.
Mahalanobis Distance
32
Any individual pixel is compared to each discrete cluster to see which one it is closest to.
Unsupervised Classification
33
Advantage of Unsupervised Classification
No extensive prior knowledge required opportunities of human error minimized unique classes recognized as distinct units
34
Disadvantage of Unsupervised Classification
Limited control over classes and identities
35
A more sophisticated version of the K-Means classifier which allows classes to be created and destroyed.
Iterative self-organizing data analysis (ISODATA)
36
Each point has a degree of belonging to clusters (fuzzy logic) rather than belonging completely to just one cluster.
Fuzzy C Means