Escolar Documentos
Profissional Documentos
Cultura Documentos
bandpass filters
o subdivide the EM spectrum of the pixel into discrete wavelength bands or
channels
each pixel in the image is one wavelength band
each image comprises one channel of all the pixels a multi-banded
image
each band can be placed in either the red, green or blue channel of a
remote sensing software package
FWHM
example: sunlight reflected off a green leaf
produced a spectrum which contains info on the amount and type of
chlorophyll pigments
spectrum is continuous (many points)
but a 3-band satellite instrument is only able to detect energy over 3
discrete wavelength regions
produces a 3-point spectrum (multi-spectral instrument)
another instrument may have hundreds of channels in this wavelength
region (hyper-spectral instrument)
o the analysis of the spectrum tells you something about the surface material
talked about this last week
much more detail on this later in the course
IV. Atmosphere
atmospheric window: regions that are not blocked by the Earth's atmospheric
gases and dust/particulates
o have high atmospheric transmission and low absorption
o H2O, CO2 and O3 are the main gas species that absorb photons in the VIS -
TIR
o even within the atmospheric windows, the energy is interacting with gases
and particulates
path radiance: any energy contributed by interactions with the atmosphere prior
to detection
o energy at sensor = path radiance + ground radiance
o non-selective scattering
caused by particles much larger than the wavelength
example: water vapor, ice crystals
o translates to:
cross-track scanner
o rotation or "back and forth" motion of the foreoptics
o scans each ground resolution cell (pixel) one by one
along-track scanner
o multiple cross-track detectors (no scanning motion)
o positives: dwell time increases. Why?
in the dwell time equation, the denominator = 1.0 since the line width is in
effect the cross track width of the pixel
equation reduces to:
dwell time = (down-track pixel size / orbital velocity)
dwell time = 4.0 x 10 -3 sec/pixel (for the above example)
o negatives: large arrays are difficult to fabricate (TM would require 6200
elements), failure of one element produces a loss/miscalibration of an entire
column of data (see below)
whisk-broom scanner
o combination of a cross-track scanner and a push-broom scanner
o scan with a small line array of detectors
o positives: longer dwell time (several lines per scan motion)
if all detectors are the same wavelength
same dwell time as the cross-track scanner if each detector was tuned to
a different wavelength
o negatives: different response sensitivities in each detector can cause striping
in the image (see above)
multispectral scanners
o thus far, we have looked at scanners with just one spectral band
o how do we add multiple wavelength observations?
o add cross-track scanning with a line array
o different than a whisk-broom
there, the scanning is done with a line array of the same wavelength
here, the scanning is performed with a line array of detectors at different
wavelengths
negatives: short dwell time again, spacecraft movement, planet rotation
causes imprecise alignment
1 |X|
2 |X| scan direction
3 |X|
flight direction
2 solutions:
1. push-broom scanning with a 2-D array
flight direction
1 2 3 n
|X| |X| |X| |X|
|X| |X| |X| |X| scan direction
|X| |X| |X| |X|
flight direction
VI. Basics of digital image processing
so far, we have looked at basic image theory
o color, pixels, image formation, etc.
o gaussian stretch
fit of the histogram to a gaussian distribution
the "tightness" of the curve is determined by the value of gamma
unsupervised classifications
limitation - all unsupervised classifications may produce non-intuitive
classes
user must still interpret the results
k-means approximation
algorithm locates a number of data clusters and their centers
computes statistically significant number of classes
iso-approximation
users seeds the algorithm with some number of data clusters
k-means is performed
supervised classifications
minimum distance (to means)
simplest method
determines the distance to the mean value (in n dimensional
space) of each class and assigns unknown pixels to the class with
a mean closest to that pixel
limitation - ignores the shape (variance) of the data cloud
can cause errors if an unknown pixel lies near/within one class, but
is closer to the mean of another class
maximum likelihood
more complex method
creates an n-dimensional parallelepiped or ellipsoid around each
class
statistically determines whether an unknown pixel falls within the
ellipsoid
generally, the most accurate method of classification
limitations - long computer run time, requires a large number of
pixels to accurately define your classes
accuracy assessment
user validation and check of the classification accuracy is critical
without it, the results of the classification could be wildly incorrect
check can be performed via field work, use of higher spatial
resolution imagery, or other (non-raster) datasets