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]

Like any other techniques for hyperspectral image analysis, high performance computing is also the urgent requirement for endmember extraction. In this paper, we investigate the fast implementation of two endmember extraction algorithms named as new simplex growing algorithm (NSGA) and kernel new simplex growing algorithm (KNSGA), which are recently developed as linear and nonlinear alternative to the SGA algorithm, respectively, and shown to be two promising endmember extraction techniques. Due to the fact that when implementing NSGA and KNSGA only the new endmember is processed at a time with the former endmembers staying the same and remaining unchanged, the time cost of simplex volume computation is reduced by simplifying matrix determinant based on the partitioned matrix determinant formula. Experimental results of simulated and real data show that the proposed fast algorithms can greatly reduce computational complexity while their performance remains invariant. [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]

Occlusion is unavoidable in real-world applications of person re-identification (ReID). To alleviate the occlusion problem, this work proposes the detection of the occluded and visible regions of the human body by suppressing the occluded region during feature generation and matching, and enhancing the significance of the visible region. This paper introduces a novel method based on pose-guided spatial attention (PGSA) and activation-based attention (AA) called dual-attention re-identification (DAReID). DAReID consists of a mask branch and a global branch and uses ResNet-50 as the backbone network. The mask branch uses PGSA to obtain the visible and occluded regions of a person and constructs pose guided coarse labels for the occluded region through keypoints of the human body, driving the network to obtain robust local features. The global branch obtains the visual activation levels of different regions through AA, and combines this with human pose information to define weighted local distances(WLD). The WLD learning strategy is applied to drive the network to learn new and more discriminative local features. Experimental results show that DAReID achieves comparable performance on the Market1501, DukeMTMC-reID, and CUHK-03 datasets. And on the Occluded-DukeMTMC dataset, DAReID outperforms the existing methods. [ABSTRACT FROM AUTHOR]

The reliability of feature matching can decide the accuracy and robustness of the feature-based registration result. Aiming at the problem that the number of final feature matches preserved by many popular outlier removal methods is small, and the position accuracy of final feature matches is not high enough, we propose an accurate and robust image registration framework based on outlier removal and feature point adjustment in this paper. This framework increases the number and improves the position accuracy of inliers while eliminating most outliers. The increased number of inliers improves the robustness of image registration, and high accurate inliers improves the accuracy of image registration. Firstly, the initial feature matches are extracted by a commonly used feature-based registration method, such as the scale-invariant feature transform (SIFT)-based method. Then, outliers of the initial feature matches are eliminated by a frequency domain similarity measure, called PHase-based Structural SIMilarity (PH-SSIM) proposed in this paper. Considering the inherent error of the feature matches that still exist after the outlier elimination, a PH-SSIM-based feature point adjustment strategy is designed to fine-adjust the position of the preserved feature points in the reference image. Finally, the registration parameters are calculated by the fine-adjusted feature matches. The proposed framework has been evaluated by several remote sensing images with different resolution, grey-scale, texture, and scene, and compared with four state-of-the-art image registration methods. Experimental result demonstrates the high accuracy and robustness of the proposed method. [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]

Hyperspectral unmixing (HU) is a crucial technique for exploiting remotely sensed hyperspectral data, which aims at estimating a set of spectral signatures, called endmembers and their corresponding proportions, called abundances. The performance of HU is often seriously degraded by various kinds of noise existing in hyperspectral images (HSIs). Most of existing robust HU methods are based on the assumption that noise or outlier only exists in one kind of formulation, e.g., band noise or pixel noise. However, in real-world applications, HSIs are unavoidably corrupted by noisy bands and noisy pixels simultaneously, which require robust HU in both the spatial dimension and spectral dimension. Meanwhile, the sparsity of abundances is an inherent property of HSIs and different regions in an HSI may possess various sparsity levels across locations. This article proposes a correntropy-based spatial-spectral robust sparsity-regularized unmixing model to achieve 2-D robustness and adaptive weighted sparsity constraint for abundances simultaneously. The updated rules of the proposed model are efficient to be implemented and carried out by a half-quadratic technique. The experimental results obtained by both synthetic and real hyperspectral data demonstrate the superiority of the proposed method compared to the state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Hyperspectral unmixing (HU) is a crucial technique for exploiting remotely sensed hyperspectral data, which aims to estimate a set of spectral signatures, called endmembers and their corresponding proportions, called abundances. Nonnegative matrix factorization (NMF) and its various robust extensions have been widely applied to HU. Most existing robust NMF methods consider that noises only exist in one kind of formulation. However, the hyperspectral images (HSIs) are unavoidably corrupted by noisy bands and noisy pixels simultaneously in the real applications. This paper proposes a novel spectral–spatial robust NMF model by incorporating $\ell _{2,1}$ norm and $\ell _{1,2}$ norm, which achieves robustness to band noise and pixel noise simultaneously. The Huber’s M-estimator is integrated into the proposed model to achieve better assignations of weights for each pixel and band with various noise intensities, which avoids the singularity problem and effectively improves the unmixing performance. The elegant updating rules of the proposed spectral–spatial robust model are also efficiently learned and provided. Experiments are conducted on both synthetic and real hyperspectral data sets. The experimental results demonstrate the effectiveness of the proposed methods in unmixing performance. [ABSTRACT FROM AUTHOR]

Kernel nonnegative matrix factorization (KNMF) is an extension of NMF designed to capture nonlinear dependence features in data matrix through kernel functions. In KNMF, the size of the kernel matrices is closely associated with the input data matrix, of which the calculation consumes a large amount of memory and computing resource. When applied on large-scale hyperspectral data, KNMF often meets the bottleneck of memory and may cause the overflow of memory. And when dealing with dynamically acquired data, KNMF requires recomputation of the whole data set when newly acquired data arrived, which produces huge memory and computing resource requirements. To reduce the usage of memory and improve the computational efficiency when applying KNMF on large scale and dynamic hyperspectral data, we extend KNMF by introducing partition matrix theory and considering the relationships among dividing blocks. The decomposition results of hyperspectral data are derived from much smaller scale matrices containing the formerly achieved results and the newly data blocks incrementally. In this paper, we propose an incremental KNMF (IKNMF) to reduce the computing requirements for large-scale data in hyperspectral unmixing. An improved IKNMF (IIKNMF) is also proposed to further improve the abundance results of IKNMF. Experiments are conducted on both synthetic and real hyperspectral data sets. The experimental results demonstrate that the proposed methods can effectively save memory resources without degrading the unmixing performance and the proposed IIKNMF can achieve better abundance results than IKNMF and KNMF. [ABSTRACT FROM AUTHOR]

Owing to significant geometric distortions and illumination differences, high precision and robust matching of multisource remote sensing images is a difficult task. To solve this, mutual information (MI)-based methods have been a preferred choice, as MI represents a measure of statistical dependence between the two images. However, MI only considers original grey information and neglects spatial information in the calculation of the probability distribution. In this paper, a novel similarity metric based on rotationally invariant regional mutual information (RIRMI) is proposed. The RIRMI metric is constructed by combining MI with a regional information based on the statistical relationship between rotationally invariant centre-symmetric local binary patterns of the images. The similarity metric based on RIRMI considers not only the spatial information, but the effect of the local grey variations and rotation changes on computing probability density function as well. The proposed method is tested on various simulated remote sensing images (5-30 m GSD) and real remote sensing images (2-30 m GSD) which are taken at different sensors, spectral bands, and times. Results verify that RIRMI is more robust and accurate than the common MI-based registration method. [ABSTRACT FROM AUTHOR]

The minimization problem of reconstruction error over large hyperspectral image data is one of the most important problems in unsupervised hyperspectral unmixing. A variety of algorithms based on nonnegative matrix factorization (NMF) have been proposed in the literature to solve this minimization problem. One popular optimization method for NMF is the projected gradient descent (PGD). However, as the algorithm must compute the full gradient on the entire dataset at every iteration, the PGD suffers from high computational cost in the large-scale real hyperspectral image. In this paper, we try to alleviate this problem by introducing a mini-batch gradient descent-based algorithm, which has been widely used in large-scale machine learning. In our method, the endmember can be updated pixel set by pixel set while abundance can be updated band set by band set. Thus, the computational cost is lowered to a certain extent. The performance of the proposed algorithm is quantified in the experiment on synthetic and real data. [ABSTRACT FROM AUTHOR]

Subpixel mapping technology can determine the specific location of different objects in the mixed pixel and effectively solve the uncertainty of the ground features spatial distribution in traditional classification technology. Existing methods based on linear optimization encounter the premature and local convergence of the optimization algorithm. This paper proposes a subpixel mapping method based on modified binary quantum particle swarm optimization (MBQPSO) to solve the above issues. The initial subpixel mapping imagery is obtained according to spectral unmixing results. We focus mainly on the discretization of QPSO, which is implemented by modifying the discrete update process of particle location, to minimize the objective function, which is formulated based on different connected regional perimeter calculating methods. To reduce time complexity, a target optimization strategy of global iteration combined with local iteration is performed. The MBQPSO is tested on standard test functions and results show that MBQPSO has the best performance on global optimization and convergent rate. Then, we analyze the proposed algorithm qualitatively and quantitatively by simulated and real experiment; results show that the method combined with MBQPSO and objective function, which is formulated based on the gap length between region and background, has the best performance in accuracy and efficiency. [ABSTRACT FROM AUTHOR]

Endmember extraction is an important and challenging step to solve the spectral unmixing problem. Most existing endmember extraction algorithms (EEAs) usually find image pixels as endmembers assuming the presence of pure pixels in an image scene or generate virtual endmembers without pure-pixel assumption. When some prevalent materials have pure-pixel representation and pure pixels of other less prevalent materials are absent in the image, it would be more appropriate to extract the endmembers of both prevalent and less prevalent materials, respectively. Therefore, a novel two-stage EEA is presented in this paper. In the first stage, conventional pure-pixel-based EEAs are applied to generate a candidate pixel set, and then spatial information of the candidate pixels is exploited to determine the endmembers of prevalent materials. In the second stage, given known endmembers of prevalent materials, a modified algorithm based on nonnegative matrix factorization is performed to generate the endmembers of less prevalent materials. The validity of the proposed algorithm is demonstrated by experiments based on synthetic mixtures and a real image scene. [ABSTRACT FROM AUTHOR]

Hyperspectral classification is a fundamental problem for applying hyperspectral technology, and unsupervised learning is a promising direction to address the issue. Unsupervised feature learning algorithm extracts representative features, which help efficiently classify the hyperspectral pixels. This paper combines the popular contrastive learning method (prototypical contrastive learning) and the classic representation learning method (autoencoder) to design an unsupervised feature learning network for hyperspectral classification. First, two different encoders are used to extract different features as augmentation function in a contrastive network (ContrastNet). Second, the prototypical contrastive learning method is adopted to train a contrastive network. Third, features extracted by the contrastive network are used for classification. Experiments have proved that our two proposed autoencoder networks show good feature learning capabilities by themselves and the designed contrastive learning network can further learn better representative features from the two modules. The three modules compose an efficient framework for unsupervised feature learning. Our method also performs reasonably fast in the testing phase, which implies that it is applicable in practice under specific conditions. [ABSTRACT FROM AUTHOR]

Hyperspectral classification is a fundamental problem for applying hyperspectral technology, and unsupervised learning is a promising direction to address the issue. Unsupervised feature learning algorithm extracts representative features, which help efficiently classify the hyperspectral pixels. This paper combines the popular contrastive learning method (prototypical contrastive learning) and the classic representation learning method (autoencoder) to design an unsupervised feature learning network for hyperspectral classification. First, two different encoders are used to extract different features as augmentation function in a contrastive network (ContrastNet). Second, the prototypical contrastive learning method is adopted to train a contrastive network. Third, features extracted by the contrastive network are used for classification. Experiments have proved that our two proposed autoencoder networks show good feature learning capabilities by themselves and the designed contrastive learning network can further learn better representative features from the two modules. The three modules compose an efficient framework for unsupervised feature learning. Our method also performs reasonably fast in the testing phase, which implies that it is applicable in practice under specific conditions. [ABSTRACT FROM AUTHOR]

Hyperspectral band selection (BS) aims to select a subset of bands from the original image cube for subsequent tasks, such as pixel classification. In this paper, we propose a novel unsupervised BS method, termed the representativeness and redundancy-based BS (RRBS) method, by measuring the representativeness and redundancy of the selected bands. The intuitive motivation is to find a subset of bands, which represents the dataset and has low redundancy. The desired bands are obtained sequentially. In each round of lookup, two novel selection criteria based on orthogonal subspace projection are designed for searching the bands that not only well represent the unselected bands but also lowly correlate with the selected bands. Additionally, kernel tricks are used to develop a nonlinear version of the linear selection criteria. Both the linear and nonlinear selection criteria can explicitly evaluate the representativeness and redundancy simultaneously, and they are also robust to noisy bands. The experimental results verify that the proposed method yields excellent classification performance even selecting very a limited number of bands. [ABSTRACT FROM AUTHOR]

Due to significant geometric distortions and illumination differences, developing techniques for high precision and robust multisource remote sensing image registration poses a great challenge. This article presents an iterative image registration approach, called iterative scale-invariant feature transform (ISIFT) for remote sensing images, which extends the traditional scale-invariant feature transform (SIFT)-based registration system to a close-feedback SIFT system that includes a rectification feedback loop to update rectified parameters in an iterative manner. Its key idea uses consistent feature point sets obtained by maximum similarity to calculate new alignment parameters to rectify the current sensed image and the resulting rectified sensed image is then fed back to update and replace the current sensed image as a new sensed image to reimplement SIFT for next iteration. The same process is repeated iteratively until an automatic stopping rule is satisfied. To evaluate the performance of ISIFT, both the simulated and real images are used for experiments for the validation of ISIFT. In addition, several data sets are particularly designed to conduct a comparative study and analysis with existing state-of-the-art methods. Furthermore, experiments with different rotation are also performed to verify the adaptability of ISIFT under different rotation distortions. The experimental results demonstrate that ISIFT improves performance and produces better registration accuracy than traditional SIFT-based methods and existing state-of-the-art 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]

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]

Band selection (BS) is a special case of the feature selection problem, and it tries to remove redundant bands and select a few informative and distinctive bands to represent the whole image cube. The maximum ellipsoid volume (MEV) method regards the band subset with the maximum volume as the optimal band combination. However, the MEV method cannot be directly applied for hyperspectral imagery due to the high dimensionality of the data sets. Therefore, we first combine MEV with the sequential forward search (SFS) and propose a new unsupervised BS method called MEV-SFS. Furthermore, a subtle relationship between the ellipsoid volume of the band set and the orthogonal projections (OPs) of the candidate bands is observed. Based on this relationship, we propose another equivalent method, namely, the OP-based BS (OPBS) method. OPBS is the fast version of MEV-SFS, and it has a better computational efficiency and the potential to determine the number of bands to be selected. We specifically explain the rationality of the MEV-based methods (MEV-SFS and OPBS) and illustrate their theoretical significance and physical meaning from different aspects. Theoretical analysis also demonstrates that OPBS can be regarded as a model or framework for BS, and thus, we further propose a third novel BS method named the OPBS-information divergence (OPBS-ID) method, which is a variant of OPBS. OPBS-ID can achieve a better classification performance than OPBS in many cases. Experimental results on different hyperspectral data sets demonstrate that the proposed methods have high computational efficiency, and the selected bands can achieve satisfactory classification performances. [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]

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]

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]