| dc.contributor.author | Schwartz, David Michael | |
| dc.description.abstract | High-resolution spectral images and digital elevation models are widely available. With this quantity of data, it is imperative to develop fast algorithms to extract information. We present a Python library that implements a set of algorithms for aggregating data within sliding windows. The algorithms have O(log(n)) time complexity and maintain the original image resolution. They are vectorized and written with NumPy to create fast code with C-like performance. The library offers several analysis procedures, architected such that additional procedures utilizing sliding windows can easily be added. Slope, aspect, and curvature analyses exist for digital elevation models. Fractal dimensions and correlation analyses are also present to be used on a range of different images. The software architecture of the library is outlined and motivated. It includes visualized comparisons of analyses and unit testing. Testing procedures are implemented using analytical results from Wolfram Mathematica combined with brute-force algorithms. | en_US |
| dc.publisher | North Dakota State University | en_US |
| dc.rights | NDSU policy 190.6.2 | en_US |
| dc.title | Development and Validation of a Library for Iterative Window-Based Processing of Geospatial Data | en_US |
| dc.type | Thesis | en_US |
| dc.date.accessioned | 2022-05-25T16:19:53Z | |
| dc.date.available | 2022-05-25T16:19:53Z | |
| dc.date.issued | 2021 | |
| dc.identifier.uri | https://hdl.handle.net/10365/32580 | |
| dc.subject | analysis | en_US |
| dc.subject | geospatial | en_US |
| dc.subject | library | en_US |
| dc.subject | Python | en_US |
| dc.subject | raster | en_US |
| dc.subject | software | en_US |
| dc.rights.uri | https://www.ndsu.edu/fileadmin/policy/190.pdf | en_US |
| ndsu.degree | Master of Science (MS) | en_US |
| ndsu.college | Engineering | en_US |
| ndsu.department | Computer Science | en_US |
| ndsu.program | Computer Science | en_US |
| ndsu.advisor | Denton, Anne | |
