i.gensigset.html 7.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235
  1. <h2>DESCRIPTION</h2>
  2. <em>i.gensigset</em>
  3. is a non-interactive method for generating input into
  4. <em><a href="i.smap.html">i.smap</a>.</em>
  5. It is used as the first pass in the a two-pass
  6. classification process. It reads a raster map layer,
  7. called the training map, which has some of the pixels or
  8. regions already classified. <em>i.gensigset</em> will then
  9. extract spectral signatures from an image based on the
  10. classification of the pixels in the training map and make
  11. these signatures available to
  12. <em><a href="i.smap.html">i.smap</a>.</em>
  13. <p>
  14. The user would then execute the GRASS program <em>
  15. <a href="i.smap.html">i.smap</a></em> to create the
  16. final classified map.
  17. <h2>OPTIONS</h2>
  18. <h3>Parameters</h3>
  19. <dl>
  20. <dt><b>trainingmap=</b><em>name</em>
  21. <dd>ground truth training map
  22. <p>
  23. This raster layer, supplied as input by the user, has some
  24. of its pixels already classified, and the rest (probably
  25. most) of the pixels unclassified. Classified means that
  26. the pixel has a non-zero value and unclassified means that
  27. the pixel has a zero value.
  28. <p>
  29. This map must be prepared by the user in advance by using
  30. a combination of
  31. <em><a href="wxGUI.vdigit.html">wxGUI vector digitizer</a></em>
  32. and
  33. <em><a href="v.to.rast.html">v.to.rast</a></em>,
  34. or some other import/developement process (e.g.,
  35. <em><a href="v.transects.html">v.transects</a>)</em>
  36. to define the areas representative of the classes in the image.
  37. <p>
  38. At present, there is no fully-interactive tool specifically
  39. designed for producing this layer.
  40. <dt><b>group=</b><em>name</em>
  41. <dd>imagery group
  42. <p>
  43. This is the name of the group that contains the band files
  44. which comprise the image to be analyzed. The
  45. <em><a href="i.group.html">i.group</a></em>
  46. command is used to construct groups of raster layers which
  47. comprise an image.
  48. <p>
  49. <dt><b>subgroup=</b><em>name</em>
  50. <dd>subgroup containing image files
  51. <p>
  52. This names the subgroup within the group that selects a
  53. subset of the bands to be analyzed. The
  54. <em><a href="i.group.html">i.group</a></em>
  55. command is also used to prepare this subgroup. The
  56. subgroup mechanism allows the user to select a subset of
  57. all the band files that form an image.
  58. <dt><b>signaturefile=</b><em>name</em>
  59. <dd>resultant signature file
  60. <p>
  61. This is the resultant signature file (containing the means
  62. and covariance matrices) for each class in the training map
  63. that is associated with the band files in the subgroup
  64. selected.
  65. <p>
  66. <dt><b>maxsig=</b><em>value</em>
  67. <dd>maximum number of sub-signatures in any class
  68. <br>
  69. default: 5
  70. <p>
  71. The spectral signatures which are produced by this program
  72. are "mixed" signatures (see <a href="#notes">NOTES</a>).
  73. Each signature contains one or more subsignatures
  74. (represeting subclasses). The algorithm in this program
  75. starts with a maximum number of subclasses and reduces this
  76. number to a minimal number of subclasses which are
  77. spectrally distinct. The user has the option to set this
  78. starting value with this option.
  79. </dl>
  80. <h2>INTERACTIVE MODE</h2>
  81. If none of the arguments are specified on the command line,
  82. <em>i.gensigset</em> will interactively prompt for the
  83. names of these maps and files.
  84. <p>
  85. It should be noted that interactive mode here only means
  86. interactive prompting for maps and files. It does not mean
  87. visualization of the signatures that result from the
  88. process.
  89. <p>
  90. <A NAME="notes"></a><h2>NOTES</h2>
  91. The algorithm in <em>i.gensigset</em> determines the
  92. parameters of a spectral class model known as a Gaussian
  93. mixture distribution. The parameters are estimated using
  94. multispectral image data and a training map which labels
  95. the class of a subset of the image pixels. The mixture
  96. class parameters are stored as a class signature which can
  97. be used for subsequent segmentation (i.e., classification)
  98. of the multispectral image.
  99. <p>
  100. The Gaussian mixture class is a useful model because it can
  101. be used to describe the behavior of an information class
  102. which contains pixels with a variety of distinct spectral
  103. characteristics. For example, forest, grasslands or urban
  104. areas are examples of information classes that a user may
  105. wish to separate in an image. However, each of these
  106. information classes may contain subclasses each with its
  107. own distinctive spectral characteristic. For example, a
  108. forest may contain a variety of different tree species each
  109. with its own spectral behavior.
  110. <p>
  111. The objective of mixture classes is to improve segmentation
  112. performance by modeling each information class as a
  113. probabilistic mixture with a variety of subclasses. The
  114. mixture class model also removes the need to perform an
  115. initial unsupervised segmentation for the purposes of
  116. identifying these subclasses. However, if misclassified
  117. samples are used in the training process, these erroneous
  118. samples may be grouped as a separate undesired subclass.
  119. Therefore, care should be taken to provided accurate
  120. training data.
  121. <p>
  122. This clustering algorithm estimates both the number of
  123. distinct subclasses in each class, and the spectral mean
  124. and covariance for each subclass. The number of subclasses
  125. is estimated using Rissanen's minimum description length
  126. (MDL) criteria
  127. [<a href="#rissanen83">1</a>].
  128. This criteria attempts to determine
  129. the number of subclasses which "best" describe the data.
  130. The approximate maximum likelihood estimates of the mean
  131. and covariance of the subclasses are computed using the
  132. expectation maximization (EM) algorithm
  133. [<a href="#dempster77">2</a>,<a href="#redner84">3</a>].
  134. <h2>WARNINGS</h2>
  135. If warnings like this occur, reducing the remaining classes to 0:
  136. <div class="code"><pre>
  137. ...
  138. WARNING: Removed a singular subsignature number 1 (4 remain)
  139. WARNING: Removed a singular subsignature number 1 (3 remain)
  140. WARNING: Removed a singular subsignature number 1 (2 remain)
  141. WARNING: Removed a singular subsignature number 1 (1 remain)
  142. WARNING: Unreliable clustering. Try a smaller initial number of clusters
  143. WARNING: Removed a singular subsignature number 1 (-1 remain)
  144. WARNING: Unreliable clustering. Try a smaller initial number of clusters
  145. Number of subclasses is 0
  146. </pre></div>
  147. then the user should check for:
  148. <ul>
  149. <li>the range of the input data should be between 0 and 100 or 255 but not
  150. between 0.0 and 1.0 (<em>r.info</em> and <em>r.univar</em> show the range)</li>
  151. <li>the training areas need to contain a sufficient amount of pixels</li>
  152. </ul>
  153. <h2>REFERENCES</h2>
  154. <ul>
  155. <li><A NAME="rissanen83">J. Rissanen,</a>
  156. "A Universal Prior for Integers and Estimation by Minimum Description Length,"
  157. <em>Annals of Statistics,</em> vol. 11, no. 2, pp. 417-431, 1983.</li>
  158. <li><A NAME="dempster77">A. Dempster, N. Laird and D. Rubin,</a>
  159. "Maximum Likelihood from Incomplete Data via the EM Algorithm,"
  160. <em>J. Roy. Statist. Soc. B,</em> vol. 39, no. 1, pp. 1-38, 1977.</li>
  161. <li><A NAME="redner84">E. Redner and H. Walker,</a>
  162. "Mixture Densities, Maximum Likelihood and the EM Algorithm,"
  163. <em>SIAM Review,</em> vol. 26, no. 2, April 1984.</li>
  164. </ul>
  165. <h2>SEE ALSO</h2>
  166. <em>
  167. <a href="i.group.html">i.group</a>,
  168. <a href="i.smap.html">i.smap</a>,
  169. <a href="r.info.html">r.info</a>,
  170. <a href="r.univar.html">r.univar</a>,
  171. <a href="wxGUI.vdigit.html">wxGUI vector digitizer</a>
  172. </em>
  173. <h2>AUTHORS</h2>
  174. Charles Bouman,
  175. School of Electrical Engineering, Purdue University
  176. <br>
  177. Michael Shapiro,
  178. U.S.Army Construction Engineering Research Laboratory
  179. <p><i>Last changed: $Date$</i>