final Flashcards

1
Q

What is an arbitrary or spatial profile?

A

graph across space of spectral profile (e.g. transect from inland marsh to middle of river)

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

Spectral profile

A

looks at individual point, or spectral signature for that pixel

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

Convolution filtering

A

window that moves over an image sequence and does a function on the pixels it encounters

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

NDVI

A

NIR-red / NIR + red

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

histogram matching

A

histogram matching tries match responses of classes

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

linear contrast enhancement or contrast stretching

A

expands the original digital values of the remotely sensed data into a new distribution

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

what would a filter look like that accentuates spacial variability?

A

a linear edge detector would have some negative and some positive values

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

principal component analysis

A

allows you take multiple bands, take the variability and store it in just a few bands. Output number of bands is the same but the crucial information is contained in the first few bands. Thus the benefit is that you can decrease the data dimensionality (number of bands)

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

data dimensionality

A

number of bands, size of your data defined by rows and columns.

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

“features” in image processing (different in GIS)

A

bands

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

What is the point of features selection

A

another way to get rid of data you don’t need. It’s determining which bands are the most important

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

NDVI stands for

A

Normalized Difference Vegetation Index

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

Tassled cap transformation

A

the first of the new axis becomes brightness (formed from soil line). the axis orthogonal to it is called greenness. Then wetness is sometimes the third axis

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

supervised vs. unsupervised

A

unsup clusters elements in the image that look similar. supervised always involves a training data set that you give the algorithm

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

cluster busing

A

something that is done in unsupervised classification. we take the classes that didn’t get classified and reclassify them

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

Why is it a good idea to used predefined classification schemes

A

a class scheme like USGA or Anderson is useful because it allows us to monitor the change over time if we have a classification scheme that stays consistent. also involves less work.

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

problems with extending spectral signatures through space and time

A

you’re telling the algorithm that forests look like this..that may work fine in one single image but the atmosphere information in different. sun was different.

18
Q

feature space

A

a graphical representation of the pixels by plotting 2 bands vs. each other (often looks like a tasseled cap)

19
Q

pros of parallelepiped

A

simple, makes a few assumptions about the character of the classes

20
Q

cons of parallelpiped

A

parallelelpipeds are rectangular, but spectral space is “diagonal” so classes may overlap

21
Q

minimum distance to mean

A

finds mean value of pixels of training sets in n-dimensional sapce. All pixels in image classified according to the class mean to which they are closest.

22
Q

pros of minimum distance

A

all regions of n-dimensional space are classified. Allows for diagonal boundaries (and hence no overlap of classes)

23
Q

cons of minimum distance

A

assumes that spectral variability is same in all directions, which is not the case

24
Q

maximum likelihood

A

assume multivariate normal distributions of pixels within classes. calculates the probability that the pixel is a member of that class. takes into account mean and covariance of training set. each pixel is assigned to the class for which it has the highest probability of membership

25
Q

pros of max like

A

most sophisticated; achieves good separation of classes

26
Q

cons of max like

A

requires strong training set to accurately describe mean and covariance structure of classes

27
Q

how do you choose locations fro training data?

A

make sure it’s representative spectrally of the classes you have. it may be that you need to come up with multiple types of forest if they are significantly different in their response.

28
Q

soft classification logic

A

outputs a probability that something is in a class

29
Q

ISODATA pros

A

very efficient at identifying spectral clusters within data

30
Q

how ISODATA works

A

algorithm that splits and merges clusters; user dines threshold values for parameters; computer runs algorithm through many iterations until threshold is reached.

31
Q

ISODATA uses _____ method

A

shortest distance to center

32
Q

(ISODATA) the _______ within each cluster and the distance between cluster centers is caluculated.

A

SD

33
Q

clusters are _____ if one or more SD is greater than the user defined threshold. clusters are ____ if the distance between them is less that the user-defined threshold.

A

split; merged

34
Q

expert system

A

tries to emulate the rules that a human expert would use

35
Q

knowledge base

A

the extraction of expert’s rules

36
Q

inference engine

A

uses rules of expert system

37
Q

5 change detection algorithms

A
Write Function Memory Insertion
image algebra (differencing, ratioing)
post classification comparison
38
Q

spectral angle difference

A

uses n-D angle to match pixels to reference spectra. the algorithm determines the spectral similarity between two spectra by calculating the angle between the spectra and treating them as vectors in a space with dimensionality equal to the number of bands.

39
Q

the only change detection algorithm that results in a to-from contingency table?

A

post classification change detection

40
Q

user’s accuracy is based on ____

A

the classification data (divide the number in the diagonal by the total classified in that catagory)