Reducing the impacts of intra-class spectral variability on the accuracy of soft classification and super-resolution mapping of shoreline

The main objective of this research is to assess the impact of intra-class spectral variation on the accuracy of soft classification and super-resolution mapping. The accuracy of both analyses was negatively related to the degree of intra-class spectral variation, but the effect could be reduced through use of spectral sub-classes. The latter is illustrated in mapping the shoreline at a sub-pixel scale from Landsat ETM+ data. Reducing the degree of intra-class spectral variation increased the accuracy of soft classification, with the correlation between predicted and actual class coverage rising from 0.87 to 0.94, and super-resolution mapping, with the RMSE in shoreline location decreasing from 41.13 m to 35.22 m

Optimizing hopfield neural network for super-resolution mapping

Remote sensing is a potential source of information of land covers on the surface of the Earth. Different types of remote sensing images offer different spatial resolution quality. High resolution images contain rich information, but they are expensive, while low resolution image are less detail but they are cheap. Super-resolution mapping (SRM) technique is used to enhance the spatial resolution of the low resolution image in order to produce land cover mapping with high accuracy. The mapping technique is crucial to differentiate land cover classes. Hopfield neural network (HNN) is a popular approach in SRM. Currently, numerical implementation of HNN uses ordinary differential equation (ODE) calculated with traditional Euler method. Although producing satisfactory accuracy, Euler method is considered slow especially when dealing with large data like remote sensing image. Therefore, in this paper several advanced numerical methods are applied to the formulation of the ODE in SRM in order to speed up the iterative procedure of SRM. These methods are an improved Euler, Runge-Kutta, and Adams-Moulton. Four classes of land covers such as vegetation, water bodies, roads, and buildings are used in this work. Results of traditional Euler produces mapping accuracy of 85.18% computed in 1000 iterations within 220-1020 seconds. Improved Euler method produces accuracy of 86.63% computed in a range of 60-620 iterations within 20-500 seconds. Runge-Kutta method produces accuracy of 86.63% computed in a range of 70-600 iterations within 20-400 seconds. Adams-Moulton method produces accuracy of 86.64% in a range of 40-320 iterations within 10-150 seconds

Improving super-resolution mapping through combining multiple super-resolution land-cover maps

Super-resolution mapping (SRM) is an ill-posed problem, and different SRM algorithms may generate non-identical fine spatial resolution land-cover maps (sub-pixel maps) from the same input coarse spatial resolution image. The output sub-pixels maps may each have differing strengths and weaknesses. A multiple SRM (M-SRM) method that combines the sub-pixel maps obtained from a set of SRM analyses, obtained from a single or multiple set of algorithms, is proposed in this study. Plurality voting, which selects the class with the most votes, is used to label each sub-pixel. In this study, three popular SRM algorithms, namely, the pixel swapping algorithm (PSA), the Hopfield neural network (HNN) algorithm, and Markov random field (MRF) based algorithm, were used. The proposed M-SRM algorithm was validated using two data sets: a simulated multi-spectral image and an airborne visible/infrared imaging spectrometer (AVIRIS) hyperspectral image. Results show that the highest overall accuracies were obtained by M-SRM in all experiments. For example, in the AVIRIS image experiment, the highest overall accuracies of PSA, HNN and MRF were 88.89%, 93.81% and 82.70% respectively, and increased to 95.06%, 95.37% and 85.56% respectively for M-SRM obtained from the multiple PSA, HNN and MRF analyses

Spatiotemporal subpixel mapping of time-series images

Land cover/land use (LCLU) information extraction from multitemporal sequences of remote sensing imagery is becoming increasingly important. Mixed pixels are a common problem in Landsat and MODIS images that are used widely for LCLU monitoring. Recently developed subpixel mapping (SPM) techniques can extract LCLU information at the subpixel level by dividing mixed pixels into subpixels to which hard classes are then allocated. However, SPM has rarely been studied for time-series images (TSIs). In this paper, a spatiotemporal SPM approach was proposed for SPM of TSIs. In contrast to conventional spatial dependence-based SPM methods, the proposed approach considers simultaneously spatial and temporal dependences, with the former considering the correlation of subpixel classes within each image and the latter considering the correlation of subpixel classes between images in a temporal sequence. The proposed approach was developed assuming the availability of one fine spatial resolution map which exists among the TSIs. The SPM of TSIs is formulated as a constrained optimization problem. Under the coherence constraint imposed by the coarse LCLU proportions, the objective is to maximize the spatiotemporal dependence, which is defined by blending both spatial and temporal dependences. Experiments on three data sets showed that the proposed approach can provide more accurate subpixel resolution TSIs than conventional SPM methods. The SPM results obtained from the TSIs provide an excellent opportunity for LCLU dynamic monitoring and change detection at a finer spatial resolution than the available coarse spatial resolution TSIs

Downscaling Gridded DEMs Using the Hopfield Neural Network

A new Hopfield neural network (HNN) model for downscaling a digital elevation model in grid form (gridded DEM) is proposed. The HNN downscaling model works by minimizing the local semivariance as a goal, and by matching the original coarse spatial resolution elevation value as a constraint. The HNN model is defined such that each pixel of the original coarse DEM is divided into f × f subpixels, represented as network neurons. The elevation of each subpixel is then derived iteratively (i.e., optimized) based on minimizing the local semivariance under the coarse elevation constraint. The proposed HNN model was tested against three commonly applied alternative benchmark methods (bilinear resampling, bicubic and Kriging resampling methods) via an experiment using both degraded and sampled datasets at 20-, 60-, and 90-m spatial resolutions. For this task, a simple linear activation function was used in the HNN model. Evaluation of the proposed model was accomplished comprehensively with visual and quantitative assessments against the benchmarks. Visual assessment was based on direct comparison of the same topographic features in different downscaled images, scatterplots, and DEM profiles. Quantitative assessment was based on commonly used parameters for DEM accuracy assessment such as the root mean square error, linear regression parameters m and b, and the correlation coefficient R. Both visual and quantitative assessments revealed the much greater accuracy of the HNN model for increasing the grid density of gridded DEMs

The effect of the point spread function on sub-pixel mapping

Abstract Sub-pixel mapping (SPM) is a process for predicting spatially the land cover classes within mixed pixels. In existing SPM methods, the effect of point spread function (PSF) has seldom been considered. In this paper, a generic SPM method is developed to consider the PSF effect in SPM and, thereby, to increase prediction accuracy. We first demonstrate that the spectral unmixing predictions (i.e., coarse land cover proportions used as input for SPM) are a convolution of not only sub-pixels within the coarse pixel, but also sub-pixels from neighboring coarse pixels. Based on this finding, a new SPM method based on optimization is developed which recognizes the optimal solution as the one that when convolved with the PSF, is the same as the input coarse land cover proportion. Experimental results on three separate datasets show that the SPM accuracy can be increased by considering the PSF effect

The effect of the point spread function on sub-pixel mapping

Abstract Sub-pixel mapping (SPM) is a process for predicting spatially the land cover classes within mixed pixels. In existing SPM methods, the effect of point spread function (PSF) has seldom been considered. In this paper, a generic SPM method is developed to consider the PSF effect in SPM and, thereby, to increase prediction accuracy. We first demonstrate that the spectral unmixing predictions (i.e., coarse land cover proportions used as input for SPM) are a convolution of not only sub-pixels within the coarse pixel, but also sub-pixels from neighboring coarse pixels. Based on this finding, a new SPM method based on optimization is developed which recognizes the optimal solution as the one that when convolved with the PSF, is the same as the input coarse land cover proportion. Experimental results on three separate datasets show that the SPM accuracy can be increased by considering the PSF effect

An iterative interpolation deconvolution algorithm for superresolution land cover mapping

Super-resolution mapping (SRM) is a method to produce a fine spatial resolution land cover map from coarse spatial resolution remotely sensed imagery. A popular approach for SRM is a two-step algorithm, which first increases the spatial resolution of coarse fraction images by interpolation, and then determines class labels of fine resolution pixels using the maximum a posteriori (MAP) principle. By constructing a new image formation process that establishes the relationship between observed coarse resolution fraction images and the latent fine resolution land cover map, it is found that the MAP principle only matches with area-to-point interpolation algorithms, and should be replaced by de-convolution if an area-to-area interpolation algorithm is to be applied. A novel iterative interpolation de-convolution (IID) SRM algorithm is proposed. The IID algorithm first interpolates coarse resolution fraction images with an area-to-area interpolation algorithm, and produces an initial fine resolution land cover map by de-convolution. The fine spatial resolution land cover map is then updated by re-convolution, back-projection and de-convolution iteratively until the final result is produced. The IID algorithm was evaluated with simulated shapes, simulated multi-spectral images, and degraded Landsat images, including comparison against three widely used SRM algorithms: pixel swapping, bilinear interpolation, and Hopfield neural network. Results show that the IID algorithm can reduce the impact of fraction errors, and can preserve the patch continuity and the patch boundary smoothness, simultaneously. Moreover, the IID algorithm produced fine resolution land cover maps with higher accuracies than those produced by other SRM algorithms

Valuing map validation: the need for rigorous land cover map accuracy assessment in economic valuations of ecosystem services

Valuations of ecosystem services often use data on land cover class areal extent. Area estimates from land cover maps may be biased by misclassification error resulting in flawed assessments and inaccurate valuations. Adjustment for misclassification error is possible for maps subjected to a rigorous validation program including an accuracy assessment. Unfortunately, validation is rare and/or poorly undertaken as often not regarded as a high priority. The benefit of map validation and hence its value is indicated with two maps. The International Geosphere Biosphere Programme’s DISCover map was used to estimate wetland value globally. The latter changed from US$1.92 trillion yr-1 to US$2.79 trillion yr-1 when adjusted for misclassification bias. For the conterminous USA, ecosystem services value based on six land cover classes from the National Land Cover Database (2006) changed from US$1118 billion yr-1 to US$600 billion yr-1 after adjustment for misclassification bias. The effect of error-adjustment on the valuations indicates the value of map validation to rigorous evidence-based science and policy work in relation to aspects of natural capital. The benefit arising from validation was orders of magnitude larger than mapping costs and it is argued that validation should be a high priority in mapping programs and inform valuations