Software and instructions for kNN applications in forest resources description and estimation.
2001-06
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Software and instructions for kNN applications in forest resources description and estimation.
Authors
Published Date
2001-06
Publisher
University of Minnesota
Type
Report
Abstract
Keywords
Description
The k-nearest neighbors (kNN) method has proven to be a very useful technique to
classify and propagate forest field plot information through the landscape. This
classification and estimation process reproduces the covariance structure of the observed data and retains the full range of variability inherent in the sample. The applications described here are for use with Landsat TM satellite imagery and USDA Forest Service
Forest Inventory and Analysis (FIA) data for Minnesota. However, these applications
can be readily adapted to other imagery and forest inventory data formats. The software
provides a range of statistical and map analysis and output.
Related to
Replaces
License
Series/Report Number
152
Funding information
Research supported by NASA, the USDA Forest Service, the National Council on Air and Stream Improvement, the University of Minnesota’s College of Natural Resources and Minnesota Agricultural Experiment Station.
Isbn identifier
Doi identifier
Previously Published Citation
Other identifiers
Suggested citation
Haapanen, Reija; Ek, Alan R.. (2001). Software and instructions for kNN applications in forest resources description and estimation.. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/37198.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.