Spatial discrimination and classification maps (Q3727156)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3958465
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Spatial discrimination and classification maps |
scientific article; zbMATH DE number 3958465 |
Statements
Spatial discrimination and classification maps (English)
0 references
1984
0 references
classification
0 references
image analysis
0 references
maximum likelihood estimation
0 references
map
0 references
construction
0 references
remote sensing
0 references
spatial discrimination
0 references
satellite imagery
0 references
misclassification
0 references
Local spatial continuity
0 references
isotropic correlation function
0 references
Four-Adjacent-Point Window
0 references
Four-Corner-Points Window
0 references
All- Square-Points Window
0 references
allocation vectors
0 references
efficiency parameters
0 references
0 references
0 references
0 references
0.83051276
0 references
A method is given serving to classify each of the mn observations Z(x) - for example, satellite observations on a regular \(m\times n\) lattice consisting of the energy spectra - into one of several categories and thus to construct a ''map'' of the terrain. Following \textit{P. Switzer} [Extension of linear discrimination analysis for statistical classification of remotely served satellite imagery. J. Int. Assoc. Math. Geol. 12, 367-376 (1980)] the method utilizes besides the observations themselves also their neighbours, and thus the error of misclassification may be reduced. Local spatial continuity of the neighbourhood of each observation is assumed, i.e. if \(Z_ 0\) belongs to \(\Pi_ i\) then so does every \(Z_ j=Z_ 1,...,Z_ s\) of the neighbour points \(Q_ j\). It is also assumed that the observations Z(x) and Z(y) can be factorized as \(cov\{Z(x),Z(y)\}=\{\rho | x-y| \}\Lambda\) where \(\rho\) (\(\cdot)\) is the isotropic correlation function and \(\Lambda\) is the common covariance matrix of the k populations \(\Pi_ i\sim N(\mu_ i,\Lambda),\) \(i=1,...,k.\) For the two-dimensional problem three cases are considered: the Four- Adjacent-Point Window with \(Z_ 1,Z_ 2,Z_ 3,Z_ 4\), \(s=4\) (the Switzer's case), the Four-Corner-Points Window with \(Z_ 5,Z_ 6,Z_ 7,Z_ 8\), \(s=4\), and the All-Square-Points Window, \(s=8\). The coefficients of the allocation vectors for these three windows and the respective efficiency parameters are given. Some generalizations of this problem are discussed (in particular the choice of window size) in a more general form. Sample estimation of parameters when training data are used is also considered, and some numerical examples are given.
0 references