Generating a series of fine spatial and temporal resolution land cover maps by fusing coarse spatial resolution remotely sensed images and fine spatial resolution land cover maps

Studies of land cover dynamics would benefit greatly from the generation of land cover maps at both fine spatial and temporal resolutions. Fine spatial resolution images are usually acquired relatively infrequently, whereas coarse spatial resolution images may be acquired with a high repetition rate but may not capture the spatial detail of the land cover mosaic of the region of interest. Traditional image spatial–temporal fusion methods focus on the blending of pixel spectra reflectance values and do not directly provide land cover maps or information on land cover dynamics. In this research, a novel Spatial–Temporal remotely sensed Images and land cover Maps Fusion Model (STIMFM) is proposed to produce land cover maps at both fine spatial and temporal resolutions using a series of coarse spatial resolution images together with a few fine spatial resolution land cover maps that pre- and post-date the series of coarse spatial resolution images. STIMFM integrates both the spatial and temporal dependences of fine spatial resolution pixels and outputs a series of fine spatial–temporal resolution land cover maps instead of reflectance images, which can be used directly for studies of land cover dynamics. Here, three experiments based on simulated and real remotely sensed images were undertaken to evaluate the STIMFM for studies of land cover change. These experiments included comparative assessment of methods based on single-date image such as the super-resolution approaches (e.g., pixel swapping-based super-resolution mapping) and the state-of-the-art spatial–temporal fusion approach that used the Enhanced Spatial and Temporal Adaptive Reflectance Fusion Model (ESTARFM) and the Flexible Spatiotemporal DAta Fusion model (FSDAF) to predict the fine-resolution images, in which the maximum likelihood classifier and the automated land cover updating approach based on integrated change detection and classification method were then applied to generate the fine-resolution land cover maps. Results show that the methods based on single-date image failed to predict the pixels of changed and unchanged land cover with high accuracy. The land cover maps that were obtained by classification of the reflectance images outputted from ESTARFM and FSDAF contained substantial misclassification, and the classification accuracy was lower for pixels of changed land cover than for pixels of unchanged land cover. In addition, STIMFM predicted fine spatial–temporal resolution land cover maps from a series of Landsat images and a few Google Earth images, to which ESTARFM and FSDAF that require correlation in reflectance bands in coarse and fine images cannot be applied. Notably, STIMFM generated higher accuracy for pixels of both changed and unchanged land cover in comparison with other methods

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

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

Dynamic Block-Based Parameter Estimation for MRF Classification of High-Resolution Images

International audienceA Markov random field is a graphical model that is commonly used to combine spectral information and spatial context into image classification problems. The contributions of the spatial versus spectral energies are typically defined by using a smoothing parameter, which is often set empirically. We propose a new framework to estimate the smoothing parameter. For this purpose, we introduce the new concepts of dynamic blocks and class label co-occurrence matrices. The estimation is then based on the analysis of the balance of spatial and spectral energies computed using the spatial class co-occurrence distribution and dynamic blocks. Moreover, we construct a new spatially weighted parameter to preserve the edges, based on the Canny edge detector. We evaluate the performance of the proposed method on three data sets: a multispectral DigitalGlobe WorldView-2 and two hyperspectral images, recorded by the AVIRIS and the ROSIS sensors, respectively. The experimental results show that the proposed method succeeds in estimating the optimal smoothing parameter and yields higher classification accuracies when compared to the state-of-the-art methods

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

Smoothing parameter estimation for Markov random field classification of non-Gaussian distribution image

International audienceIn the context of remote sensing image classification, Markov random fields (MRFs) have been used to combine both spectral and contextual information. The MRFs use a smoothing parameter to balance the contribution of the spectral versus spatial energies, which is often defined empirically. This paper proposes a framework to estimate the smoothing parameter using the probability estimates from support vector machines and the spatial class co-occurrence distribution. Furthermore, we construct a spatially weighted parameter to preserve the edges by using seven different edge detectors. The performance of the proposed methods is evaluated on two hyperspectral datasets recorded by the AVIRIS and ROSIS and a simulated ALOS PALSAR image. The experimental results demonstrated that the estimated smoothing parameter is optimal and produces a classified map with high accuracy. Moreover, we found that the Canny-based edge probability map preserved the contours better than others

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

Sub-pixel mapping with point constraints

Remote sensing images contain abundant land cover information. Due to the complex nature of land cover, however, mixed pixels exist widely in remote sensing images. Sub-pixel mapping (SPM) is a technique for predicting the spatial distribution of land cover classes within mixed pixels. As an ill-posed inverse problem, the uncertainty of prediction cannot be eliminated and hinders the production of accurate sub-pixel maps. In contrast to conventional methods that use continuous geospatial information (e.g., images) to enhance SPM, in this paper, a SPM method with point constraints into SPM is proposed. The method of fusing point constraints is implemented based on the pixel swapping algorithm (PSA) and utilizes the auxiliary point information to reduce the uncertainty in the SPM process and increase map accuracy. The point data are incorporated into both the initialization and optimization processes of PSA. Experiments were performed on three images to validate the proposed method. The influences of the performances were also investigated under different numbers of point data, different spatial characters of land cover and different zoom factors. The results show that by using the point data, the proposed SPM method can separate more small-sized targets from aggregated artifacts and the accuracies are increased obviously. The proposed method is also more accurate than the advanced radial basis function interpolation-based method. The advantage of using point data is more evident when the point data size and scale factor are large and the spatial autocorrelation of the land cover is small. As the amount of point data increases, however, the increase in accuracy becomes less noticeable. Furthermore, the SPM accuracy can still be increased even if the point data and coarse proportions contain errors. © 2020 Elsevier Inc

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