Search

Spectral unmixing is one of the prime topics in hyperspectral image analysis, as images often contain multiple sources of spectra. Spectral variability is one of the key factors affecting unmixing accuracy, since spectral signatures are affected by variations in environmental conditions. These and other factors interfere with the accurate discrimination of source type. Several spectral mixing models have been proposed for hyperspectral unmixing to address the spectral variability problem. The interpretation for the spectral variability of these models is usually insufficient, and the unmixing algorithms corresponding to these models are usually classic unmixing techniques. Hyperspectral unmixing algorithms based on deep learning have outperformed classic algorithms. In this paper, based on the typical extended linear mixing model and the perturbed linear mixing model, the scaled and perturbed linear mixing model is constructed, and a spectral unmixing network based on this model is constructed using fully connected neural networks and variational autoencoders to update the abundances, scales, and perturbations involved in the variable endmembers. Adding spatial smoothness constraints to the scale and adding regularization constraints to the perturbation improve the robustness of the model, and adding sparseness constraints to the abundance determination prevents overfitting. The proposed approach is evaluated on both synthetic and real data sets. Experimental results show the superior performance of the proposed method against other competitors. [ABSTRACT FROM AUTHOR]

Anomaly detection has received considerable interest for hyperspectral data exploitation due to its high spectral resolution. Fast processing and good detection performance are practically significant in real world problems. Aiming at these requirements, this paper develops a recursive local summation RX anomaly detection approach by virtue of sliding windows. This paper develops a recursive local summation RX anomaly detection approach by virtue of sliding windows. A causal sample covariance/correlation matrix is derived for local window background. As for the real-time sliding windows, theWoodbury identity is used in recursive update equations, which could avoid the calculation of historical information and thus speed up the processing. Furthermore, a background suppression algorithm is also proposed in this paper, which removes the current under test pixel from the recursively update processing. Experiments are implemented on a real hyperspectral image. The experiment results demonstrate that the proposed anomaly detector outperforms the traditional real-time local background detector and has a significant speed-up effect on calculation time compared with the traditional detectors. [ABSTRACT FROM AUTHOR]

In recent years, neural network-based anomaly detection methods have attracted considerable attention in the hyperspectral remote sensing domain due to their powerful reconstruction ability compared with traditional methods. However, actual probability distribution statistics hidden in the latent space are not discovered by exploiting the reconstruction error because the probability distribution of anomalies is not explicitly modeled. To address the issue, we propose a novel probability distribution representation detector (PDRD) that explores the intrinsic distribution of both the background and the anomalies for hyperspectral anomaly detection in this paper. First, we represent the hyperspectral data with multivariate Gaussian distributions from a probabilistic perspective. Then, we combine the local statistics with the obtained distributions to leverage the spatial information. Finally, the difference between the test pixel and the average expectation of the pixels in the Chebyshev neighborhood is measured by computing the modified Wasserstein distance to acquire the detection map. We conduct the experiments on three real data sets to evaluate the performance of our proposed method. The experimental results demonstrate the accuracy and efficiency of our proposed method compared to the state-of-the-art detection methods. [ABSTRACT FROM AUTHOR]

Hyperspectral band selection (BS) is an effective means to avoid the Hughes phenomenon and heavy computational burden in hyperspectral image processing. However, most of the existing BS methods fail to fully consider the interaction between spectral bands and cannot comprehensively consider the representativeness and redundancy of the selected band subset. To solve these problems, we propose an unsupervised effective band attention reconstruction framework for band selection (EBARec-BS) in this article. The framework utilizes the EBARec network to learn the representativeness of each band to the original band set and measures the redundancy between the bands by calculating the distance of each unselected band to the selected band subset. Subsequently, by designing an adaptive weight to balance the influence of the representativeness metric and redundancy metric on the band evaluation, a final band scoring function is obtained to select a band subset that well represents the original hyperspectral image and has low redundancy. Experiments on three well-known hyperspectral data sets indicate that compared with the existing BS methods, the proposed EBARec-BS is robust to noise bands and can effectively select the band subset with higher classification accuracy and less redundant information. [ABSTRACT FROM AUTHOR]

Shallow underwater topography has important practical applications in fisheries, navigation, and pipeline laying. Traditional multibeam bathymetry is limited by the high cost of largescale topographic surveys in large, shallow sand wave areas. Remote sensing inversion methods to detect shallow sand wave topography in Taiwan rely heavily on measured water depth data. To address these problems, this study proposes a largescale remote sensing inversion model of sand wave topography based on long short-term memory network machine learning. Using multi-angle sun glitter remote sensing to obtain sea surface roughness (SSR) information and by learning and training SSR and its corresponding water depth information, the sand wave topography of a largescale shallow sea sand wave region is extracted. The accuracy of the model is validated through its application to a 774 km2 area in the sand wave topography of the Taiwan Banks. The model obtains a root mean square error of 3.31–3.67 m, indicating that the method has good generalization capability and can achieve a largescale topographic understanding of shallow sand waves with some training on measured bathymetry data. Sand wave topography is widely present in tidal environments; our method has low requirements for ground data, with high application value. [ABSTRACT FROM AUTHOR]

Convolution-based autoencoder networks have yielded promising performances in exploiting spatial–contextual signatures for spectral unmixing. However, the extracted spectral and spatial features of some networks are aggregated, which makes it difficult to balance their effects on unmixing results. In this paper, we propose two gated autoencoder networks with the intention of adaptively controlling the contribution of spectral and spatial features in unmixing process. Gating mechanism is adopted in the networks to filter and regularize spatial features to construct an unmixing algorithm based on spectral information and supplemented by spatial information. In addition, abundance sparsity regularization and gating regularization are introduced to ensure the appropriate implementation. Experimental results validate the superiority of the proposed method to the state-of-the-art techniques in both synthetic and real-world scenes. This study confirms the effectiveness of gating mechanism in improving the accuracy and efficiency of utilizing spatial signatures for spectral unmixing. [ABSTRACT FROM AUTHOR]

Due to invariance to significant intensity differences, similarity metrics have been widely used as criteria for an area-based method for registering optical remote sensing image. However, for images with large scale and rotation difference, the robustness of similarity metrics can greatly determine the registration accuracy. In addition, area-based methods usually require appropriately selected initial values for registration parameters. This paper presents a registration approach using spatial consistency (SC) and average regional information divergence (ARID), called spatial-consistency and average regional information divergence minimization via quantum-behaved particle swarm optimization (SC-ARID-QPSO) for optical remote sensing images registration. Its key idea minimizes ARID with SC to select an ARID-minimized spatial consistent feature point set. Then, the selected consistent feature set is tuned randomly to generate a set of M registration parameters, which provide initial particle warms to implement QPSO to obtain final optimal registration parameters. The proposed ARID is used as a criterion for the selection of consistent feature set, the generation of initial parameter sets, and fitness functions used by QPSO. The iterative process of QPSO is terminated based on a custom-designed automatic stopping rule. To evaluate the performance of SC-ARID-QPSO, both simulated and real images are used for experiments for validation. In addition, two data sets are particularly designed to conduct a comparative study and analysis with existing state-of-the-art methods. The experimental results demonstrate that SC-ARID-QPSO produces better registration accuracy and robustness than compared methods. [ABSTRACT FROM AUTHOR]

Automatic image registration has been wildly used in remote sensing applications. However, the feature-based registration method is sometimes inaccurate and unstable for images with large scale difference, grayscale and texture differences. In this manuscript, a coarse-to-fine registration scheme is proposed, which combines the advantage of feature-based registration and phase correlation-based registration. The scheme consists of four steps. First, feature-based registration method is adopted for coarse registration. A geometrical outlier removal method is applied to improve the accuracy of coarse registration, which uses geometric similarities of inliers. Then, the sensed image is modified through the coarse registration result under affine deformation model. After that, the modified sensed image is registered to the reference image by extended phase correlation. Lastly, the final registration results are calculated by the fusion of the coarse registration and the fine registration. High universality of feature-based registration and high accuracy of extended phase correlation-based registration are both preserved in the proposed method. Experimental results of several different remote sensing images, which come from several published image registration papers, demonstrate the high robustness and accuracy of the proposed method. The evaluation contains root mean square error (RMSE), Laplace mean square error (LMSE) and red–green image registration results. [ABSTRACT FROM AUTHOR]

In this paper, a novel unsupervised band selection (BS) criterion based on maximizing representativeness and minimizing redundancy (MRMR) is proposed for selecting a set of informative bands to represent the whole hyperspectral image cube. The new selection criterion is denoted as the MRMR selection criterion and the associated BS method is denoted as the MRMR method. The MRMR selection criterion can evaluate the band subset's representativeness and redundancy simultaneously. For one band subset, its representativeness is estimated by using orthogonal projection (OP) and its redundancy is measured by the average of the Pearson correlation coefficients among the bands in this subset. To find the satisfactory subset, an effective evolutionary algorithm, i.e., the immune clone selection (ICS) algorithm, is applied as the subset searching strategy. Moreover, we further introduce two effective tricks to simplify the computation of the representativeness metric, thus the computational complexity of the proposed method is reduced significantly. Experimental results on different real-world datasets demonstrate that the proposed method is very effective and its selected bands can obtain good classification performances in practice. [ABSTRACT FROM AUTHOR]

Sea surface roughness (SSR) is a key physical parameter in studies of air–sea interactions and the ocean dynamics process. The SSR quantitative inversion model based on multi-angle sun glitter (SG) images has been proposed recently, which will significantly promote SSR observations through multi-angle remote-sensing platforms. However, due to the sensitivity of the sensor view angle (SVA) to SG, it is necessary to determine the optimal imaging angle and their combinations. In this study, considering the design optimization of imaging geometry for multi-angle remote-sensing platforms, we have developed an error transfer simulation model based on the multi-angle SG remote-sensing radiation transmission and SSR estimation models. We simulate SSR estimation errors at different imaging geometry combinations to evaluate the optimal observation geometry combination. The results show that increased SSR inversion accuracy can be obtained with SVA combinations of 0° and 20° for nadir- and backward-looking SVA compared with current combinations of 0° and 27.6°. We found that SSR inversion prediction error using the proposed model and actual SSR inversion error from field buoy data are correlated. These results can provide support for the design optimization of imaging geometry for multi-angle ocean remote-sensing platforms. [ABSTRACT FROM AUTHOR]

This paper presents a new parameterized nonlinear least squares (PNLS) algorithm for unsupervised nonlinear spectral unmixing (UNSU). The PNLS-based algorithms transform the original optimization problem with respect to the endmembers, abundances, and nonlinearity coefficients estimation into separate alternate parameterized nonlinear least squares problems. Owing to the Sigmoid parameterization, the PNLS-based algorithms are able to thoroughly relax the additional nonnegative constraint and the nonnegative constraint in the original optimization problems, which facilitates finding a solution to the optimization problems. Subsequently, we propose to solve the PNLS problems based on the Gauss–Newton method. Compared to the existing nonnegative matrix factorization (NMF)-based algorithms for UNSU, the well-designed PNLS-based algorithms have faster convergence speed and better unmixing accuracy. To verify the performance of the proposed algorithms, the PNLS-based algorithms and other state-of-the-art algorithms are applied to synthetic data generated by the Fan model and the generalized bilinear model (GBM), as well as real hyperspectral data. The results demonstrate the superiority of the PNLS-based algorithms. [ABSTRACT FROM AUTHOR]

Infrared small target detection under intricate background and heavy noise is one of the crucial tasks in the field of remote sensing. Conventional algorithms can fail in detecting small targets due to the low signal-to-noise ratios of the images. To solve this problem, an effective infrared small target detection algorithm inspired by random walks is presented in this paper. The novelty of our contribution involves the combination of the local contrast feature and the global uniqueness of the small targets. Firstly, the original pixel-wise image is transformed into an multi-dimensional image with respect to the local contrast measure. Secondly, a reconstructed seeds selection map (SSM) is generated based on the multi-dimensional image. Then, an adaptive seeds selection method is proposed to automatically select the foreground seeds potentially placed in the areas of the small targets in the SSM. After that, a confidence map is constructed using a modified random walks (MRW) algorithm to represent the global uniqueness of the small targets. Finally, we segment the targets from the confidence map by utilizing an adaptive threshold. Extensive experimental evaluation results on a real test dataset demonstrate that our algorithm is superior to the state-of-the-art algorithms in both target enhancement and detection performance. [ABSTRACT FROM AUTHOR]

Hyperspectral Band Selection (BS) aims to select a few informative and distinctive bands to represent the whole image cube. In this paper, an unsupervised BS framework named the band priority index (BPI) is proposed. The basic idea of BPI is to find the bands with large amounts of information and low correlation. Sequential forward search (SFS) is used to avoid an exhaustive search, and the objective function of BPI consist of two parts: the information metric and the correlation metric. We proposed a new band correlation metric, namely, the joint correlation coefficient (JCC), to estimate the joint correlation between a single band and multiple bands. JCC uses the angle between a band and the hyperplane determined by a band set to evaluate the correlation between them. To estimate the amount of information, the variance and entropy are used as the information metric for BPI, respectively. Since BPI is a framework for BS, other information metrics and different mathematic functions of the angle can also be used in the model, which means there are various implementations of BPI. The BPI-based methods have the advantages as follows: (1) The selected bands are informative and distinctive. (2) The BPI-based methods usually have good computational efficiencies. (3) These methods have the potential to determine the number of bands to be selected. The experimental results on different real hyperspectral datasets demonstrate that the BPI-based methods are highly efficient and accurate BS methods. [ABSTRACT FROM AUTHOR]