Search

Optical earth observation satellite sensors often provide a coarse spatial resolution (CR) multispectral (MS) image together with a fine spatial resolution (FR) panchromatic (PAN) image. Pansharpening is a technique applied to such satellite sensor images to generate an FR MS image by injecting spatial detail taken from the FR PAN image while simultaneously preserving the spectral information of MS image. Pansharpening methods are mostly applied on a per-pixel basis and use the PAN image to extract spatial detail. However, many land cover objects in FR satellite sensor images are not illustrated as independent pixels, but as many spatially aggregated pixels that contain important semantic information. In this article, an object-based pansharpening approach, termed object-based area-to-point regression kriging (OATPRK), is proposed. OATPRK aims to fuse the MS and PAN images at the object-based scale and, thus, takes advantage of both the unified spectral information within the CR MS images and the spatial detail of the FR PAN image. OATPRK is composed of three stages: image segmentation, object-based regression, and residual downscaling. Three data sets acquired from IKONOS and Worldview-2 and 11 benchmark pansharpening algorithms were used to provide a comprehensive assessment of the proposed OATPRK approach. In both the synthetic and real experiments, OATPRK produced the most superior pan-sharpened results in terms of visual and quantitative assessment. OATPRK is a new conceptual method that advances the pixel-level geostatistical pansharpening approach to the object level and provides more accurate pan-sharpened MS images. [ABSTRACT FROM AUTHOR]

Due to the tradeoff between spatial and temporal resolutions commonly encountered in remote sensing, no single satellite sensor can provide fine spatial resolution land surface temperature (LST) products with frequent coverage. This situation greatly limits applications that require LST data with fine spatiotemporal resolution. Here, a deep learning-based spatiotemporal temperature fusion network (STTFN) method for the generation of fine spatiotemporal resolution LST products is proposed. In STTFN, a multiscale fusion convolutional neural network is employed to build the complex nonlinear relationship between input and output LSTs. Thus, unlike other LST spatiotemporal fusion approaches, STTFN is able to form the potentially complicated relationships through the use of training data without manually designed mathematical rules making it is more flexible and intelligent than other methods. In addition, two target fine spatial resolution LST images are predicted and then integrated by a spatiotemporal-consistency (STC)-weighting function to take advantage of STC of LST data. A set of analyses using two real LST data sets obtained from Landsat and moderate resolution imaging spectroradiometer (MODIS) were undertaken to evaluate the ability of STTFN to generate fine spatiotemporal resolution LST products. The results show that, compared with three classic fusion methods [the enhanced spatial and temporal adaptive reflectance fusion model (ESTARFM), the spatiotemporal integrated temperature fusion model (STITFM), and the two-stream convolutional neural network for spatiotemporal image fusion (StfNet)], the proposed network produced the most accurate outputs [average root mean square error (RMSE) < 1.40 °C and average structural similarity (SSIM) > 0.971]. [ABSTRACT FROM AUTHOR]

Imbalanced training sets are known to produce suboptimal maps for supervised classification. Therefore, one challenge in mapping land cover is acquiring training data that will allow classification with high overall accuracy (OA) in which each class is also mapped onto similar user’s accuracy. To solve this problem, we integrated local adaptive region and box-and-whisker plot (BP) techniques into an iterative algorithm to expand the size of the training sample for selected classes in this article. The major steps of the proposed algorithm are as follows. First, a very small initial training sample (ITS) for each class set is labeled manually. Second, potential new training samples are found within an adaptive region by conducting local spectral variation analysis. Lastly, three new training samples are acquired to capture information regarding intraclass variation; these samples lie in the lower, median, and upper quartiles of BP. After adding these new training samples to the ITS, classification is retrained and the process is continued iteratively until termination. The proposed approach was applied to three very high-resolution (VHR) remote-sensing images and compared with a set of cognate methods. The comparison demonstrated that the proposed approach produced the best result in terms of OA and exhibited superiority in balancing user’s accuracy. For example, the proposed approach was typically 2%-10% more accurate than the compared methods in terms of OA and it generally yielded the most balanced classification. [ABSTRACT FROM AUTHOR]

Superresolution 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 the 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 deconvolution if an area-to-area interpolation algorithm is to be applied. A novel iterative interpolation deconvolution (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 deconvolution. The fine-spatial-resolution land cover map is then updated by reconvolution, back-projection, and deconvolution iteratively until the final result is produced. The IID algorithm was evaluated with simulated shapes, simulated multispectral 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. [ABSTRACT FROM PUBLISHER]

Superresolution mapping (SRM) is a technique for generating a fine-spatial-resolution land cover map from coarse-spatial-resolution fraction images estimated by soft classification. The prior model used to describe the fine-spatial-resolution land cover pattern is a key issue in SRM. Here, a novel learning-based SRM algorithm, whose prior model is learned from other available fine-spatial-resolution land cover maps, is proposed. The approach is based on the assumption that the spatial arrangement of the land cover components for mixed pixel patches with similar fractions is often similar. The proposed SRM algorithm produces a learning database that includes a large number of patch pairs for which there is a fine- and coarse-spatial-resolution representation for the same area. From the learning database, patch pairs that have similar coarse-spatial-resolution patches as those in the input fraction images are selected. Fine-spatial-resolution patches in these selected patch pairs are then used to estimate the latent fine-spatial-resolution land cover map by solving an optimization problem. The approach is illustrated by comparison against state-of-the-art SRM methods using land cover map subsets generated from the USA's National Land Cover Database. Results show that the proposed SRM algorithm better maintains the spatial pattern of land covers for a range of different landscapes. The proposed SRM algorithm has the highest overall accuracy and kappa values in all of these SRM algorithms, by using the entire maps in the accuracy assessment. [ABSTRACT FROM AUTHOR]

The development of remote sensing has enabled the acquisition of information on land-cover change at different spatial scales. However, a tradeoff between spatial and temporal resolutions normally exists. Fine-spatial-resolution images have low temporal resolutions, whereas coarse-spatial-resolution images have high temporal repetition rates. A novel superresolution change detection method (SRCD) is proposed to detect land-cover changes at both fine spatial and temporal resolutions with the use of a coarse-resolution image and a fine-resolution land-cover map acquired at different times. SRCD is an iterative method that involves endmember estimation, spectral unmixing, land-cover fraction change detection, and superresolution land-cover mapping. Both the land-cover change/no-change map and from-to change map at fine spatial resolution can be generated by SRCD. In this paper, SRCD was applied to a synthetic multispectral image, a Moderate-Resolution Imaging Spectroradiometer multispectral image, and a Landsat-8 Operational Land Imager multispectral image. The land-cover from-to change maps are found to have the highest overall accuracy (higher than 85%) in all of the three experiments. Most of the changed land-cover patches, which were larger than the coarse-resolution pixel, were correctly detected. [ABSTRACT FROM AUTHOR]

Support vector machines (SVM) are attractive for the classification of remotely sensed data with some claims that the method is insensitive to the dimensionality of the data and, therefore, does not require a dimensionality-reduction analysis in preprocessing. Here, a series of classification analyses with two hyperspectral sensor data sets reveals that the accuracy of a classification by an SVM does vary as a function of the number of features used. Critically, it is shown that the accuracy of a classification may decline significantly (at 0.05 level of statistical significance) with the addition of features, particularly if a small training sample is used. This highlights a dependence of the accuracy of classification by an SVM on the dimensionality of the data and, therefore, the potential value of undertaking a feature-selection analysis prior to classification. Additionally, it is demonstrated that, even when a large training sample is available, feature selection may still be useful. For example, the accuracy derived from the use of a small number of features may be non-inferior (at 0.05 level of significance) to that derived from the use of a larger feature set providing potential advantages in relation to issues such as data storage and computational processing costs. Feature selection may, therefore, be a valuable analysis to include in preprocessing operations for classification by an SVM. [ABSTRACT FROM AUTHOR]

Remote sensing is a major source of land-cover information. Commonly, interest focuses on a single land-cover class. Although a conventional multiclass classifier may be used to provide a map depicting the class of interest, the analysis is not focused on that class and may be suboptimal in terms of the accuracy of its classification. With a conventional classifier, considerable effort is directed on the classes that are not of interest. Here, it is suggested that a one-class-classification approach could be appropriate when interest focuses on a specific class. This is illustrated with the classification of fenland, a habitat of considerable conservation value, from Landsat Enhanced Thematic Mapper Plus imagery. A range of one-class classifiers is evaluated, but attention focuses on the support-vector data description (SVDD). The SVDD was used to classify fenland with an accuracy of 97.5% and 93.6% from the user's and producer's perspectives, respectively. This classification was trained upon only the fenland class and was substantially more accurate in fen classification than a conventional multiclass maximum-likelihood classification provided with the same amount of training data, which classified fen with an accuracy of 90.0% and 72.0% from the user's and producer's perspectives, respectively. The results highlight the ability to classify a single class using only training data for that class. With a one-class classification, the analysis focuses tightly on the class of interest, with resources and effort not directed on other classes, and there are opportunities to derive highly accurate classifications from small training sets. [ABSTRACT FROM AUTHOR]

Support vector machines (SVMs) have considerable potential as classifiers of remotely sensed data. A constraint on their application in remote sensing has been their binary nature, requiring multiclass classifications to be based upon a large number of binary analyses. Here, an approach for multiclass classification of airborne sensor data by a single SVM analysis is evaluated against a series of classifiers that are widely used in remote sensing, with particular regard to the effect of training set size on classification accuracy. In addition to the SVM, the same datasets were classified using a discriminant analysis, decision tree, and multilayer perceptron neural network. The accuracy statements of the classifications derived from the different classifiers were compared in a statistically rigorous fashion that accommodated for the related nature of the samples used in the analyses. For each classification technique, accuracy was positively related with the size of the training set. In general, the most accurate classifications were derived from the SVM approach, and with the largest training set the SVM classification was significantly (p < 0.05) more accurate (93.75%) than that derived from the discriminant analysis (90.00%) and decision tree algorithms (90.31%). Although each classifier could yield a very accurate classification, >90% correct, the classifiers differed in the ability to correctly label individual cases and so may be suitable candidates for an ensemble-based approach to classification. [ABSTRACT FROM AUTHOR]