Hyperspectral change detection is critical for analyzing the temporal evolution of the feature components in multi-temporal hyperspectral images. However, existing methods often fall short of fully exploiting the spatio-temporal-spectral correlations within these images, thereby limiting their accuracy and robustness. This paper introduces a novel hyperspectral change detection method, termed dual collaborative sparse unmixing via variable splitting augmented Lagrangian and total variation (DCLSUnSAL-TV). By integrating dual collaborative sparsity and total variation regularizers, this method capitalizes on the local similarity of changes in the feature components, leveraging the low-rank property of hyperspectral difference images (HSDIs) and their inherent spatial-spectral correlations. A customized abundance-wise-truncation and ensemble strategy is designed to obtain the change map by aggregating the subpixel-level changes with respect to each endmember. Comprehensive comparison and ablation experiments demonstrate the effectiveness of the proposed method in improving the accuracy of change detection. The source code is available at https://github.com/2alsbz/DCLSUnSAL_TV.

The empirical studies of most existing graph neural networks (GNNs) broadly take the original node feature and adjacency relationship as single-channel input, ignoring the rich information of multiple graph channels. To circumvent this issue, the multichannel graph analysis framework has been developed to fuse graph information across channels. How to model and integrate shared (i.e., consistency) and channel-specific (i.e., complementarity) information is a key issue in multichannel graph analysis. In this article, we propose a cross-channel graph information bottleneck (CCGIB) principle to maximize the agreement for common representations and the disagreement for channel-specific representations. Under this principle, we formulate the consistency and complementarity information bottleneck (IB) objectives. To enable optimization, a viable approach involves deriving variational lower bound and variational upper bound (VarUB) of mutual information terms, subsequently focusing on optimizing these variational bounds to find the approximate solutions. However, obtaining the lower bounds of cross-channel mutual information objectives proves challenging through direct utilization of variational approximation, primarily due to the independence of the distributions. To address this challenge, we leverage the inherent property of joint distributions and subsequently derive variational bounds to effectively optimize these information objectives. Extensive experiments on graph benchmark datasets demonstrate the superior effectiveness of the proposed method.

Multi-modal remote sensing image template matching is a meaningful and crucial topic in remote sensing image processing. However, due to different imaging mechanisms, there are significant nonlinear radiometric variations among multi-modal remote sensing images, increasing the matching challenge and leading to poor matching performances. To tackle this issue, this paper proposes a Fourier Domain Adaptive Network (FDANet) for multi-modal remote sensing image matching. Firstly, FDANet randomly swaps the low-frequency spectrum information between multi-modal images through the Fourier transform to reduce differences among multi-modal images, enhancing network adaptability to different image modalities and improving the multi-modal image matching performance. Secondly, FDANet extracts domain-invariant features from the transformed images through a deep Siamese network. After that, FDANet performs template matching and achieves high-precision multi-modal remote sensing image matching. In addition, we adopt the contrastive learning loss to optimize the FDANet. Extensive experiments on multi-modal remote sensing image matching demonstrate the effectiveness and advantages of the proposed FDANet.

Recent studies have highlighted the effectiveness of deep domain adaptation (DA) techniques in addressing cross-scene hyperspectral image (HSI) classification challenges. However, most of the existing DA methods often prioritize aligning data distributions while overlooking the intrinsic separability between source and target domain data. In this paper, we propose a decoupled contrastive learning based unsupervised domain adaptation (DCLUDA) method for HSI classification. Unlike conventional adversarial DA methods, our method introduces a unique DA loss specifically designed to minimize class confusion in the target domain. This not only simplifies model training but also enhances class discriminability. Moreover, we employ a decoupled contrastive learning strategy on both domains to enhance data separability within each domain. Finally, we propose a sample selection strategy based on confident learning to select high-confidence samples from the target domain for fine-tuning the DA model. Experiments on two cross-scene HSI classification tasks shown that our proposed DCLUDA outperforms several existing DA methods.

Deep learning (DL) have recently achieved outstanding performance in change detection of multitemporal images. However, most existing DL-based change detection methods still suffer from the problem of insufficient labeled training samples. To overcome this limitation, an unsupervised superpixel-guided self-supervised learning network (S3Net) is proposed for detecting changes occurred on the land surface. By performing principal component analysis on two input images, a triple-channel pseudo-color image containing the main information of both images is first generated, which is used for superpixel segmentation to produce homogeneous image objects. Then, a siamese network composing of two identical subnetworks with shared weight based on transfer learning is trained for pretext task in a self-supervised learning way, aiming to obtain multiscale object-level spatial feature difference images. On this basis, a high-quality difference image is generated by incorporating the pixel-level and object-level difference information using a simple weighted fusion strategy, which can be analyzed by thresholding to produce the final binary change map. The experimental results on four real-world datasets from different sensors show that the proposed approach can obtain superior performance in comparison with several state-of-the-art change detection methods, which further demonstrates its effectiveness and practicability. We make our data and code publicly available (https://github.com/OMEGA-RS/S3Net_CD).

In recent years, deep learning models, which possess powerful feature extraction abilities, have achieved remarkable success in the classification of hyperspectral images (HSIs). Nevertheless, a common challenge faced by most deep learning models, including few-shot learning models, is the scarcity of valid labeled samples. To address this issue, we propose a cross-domain self-taught network (CDSTN) for few-shot hyperspectral image classification. The proposed CDSTN merges domain adaptation and semi-supervised self-taught strategy to implement the few-shot learning, which utilizes adequate labeled and unlabeled samples from source as well as target domain respectively. For the feature information extraction of HSI, we propose a deep spatial-spectral feature embedded extractor composed of four residual blocks and a channel attention module. Additionally, a set of domain classifiers are introduced behind each residual block for the purpose of domain alignment by extracting more domain information at different depths of the network. Finally, plenty of unlabeled samples are assigned with pseudo labels through the trained network, and a pseudo label refinement module is designed to select the most confident pseudo label sample for each class to further enrich the labeled database of target domain. Experiments conducted on four widely used benchmark HSI data sets demonstrate that CDSTN can obtain superior and stable performance with limited labeled samples compared with some state of the arts.

With the increasing popularity of deep learning, most recent developments of change detection (CD) approaches have taken advantage of deep learning techniques to improve the detection performance. However, it is usually necessary to elaborately design the network architecture and train the model with a large amount of labeled data, which are difficult to obtain in practice. To overcome these limitations, this letter proposed an unsupervised CD framework for high-resolution remote sensing images integrating transfer learning-based bilinear convolutional neural networks (BCNNs) and object-based change analysis. A difference image is first generated, which is used for the subsequent preclassification and superpixel segmentation. Then, two sets of superpixel samples with reliable labels derived from the bitemporal remote sensing images are input into two pretrained CNNs to extract representative features, respectively. On this basis, the matrix outer product is utilized to generate the combined bilinear features, which are input into the softmax classifier to discriminate the change and no-change information and thus obtaining the final change map by feeding all sample data into the well-trained model. The experimental results on three real data sets demonstrate the effectiveness and superiority of the proposed method over several existing CD approaches.

Hyperspectral unmixing including endmember extration and abundance estimation has been investigated successively in recent years due to increasingly hyperspectral processing requirements. As one type of decision after solution paradigm, multiobjective endmember estimation method is able to obtain a set of Pareto optimal solutions, thus providing a wealth of information to determine the most representative endmembers. In addition, multiobjective optimization methods also have the characteristics of flexible modeling, excellent global convergence and commendable adaptability, etc. However, the evolutionary algorithms designed for this kind of method generally use little spatial-spectral information of the hyperspectral image. In this paper, we delve into the memetic strategy by exploiting the topological structure of hyperspectral data in the high-dimensional space to establish a vertex-directed multiobjective endmember estimation method, termed VD-MoEE. According to the frequently used linear mixture model, endmembers of hyperspectral images are generally distributed at the vertices of hyperspectral data manifold. Therefore, we design a vertex-directed local search operator to guide the search direction of the individuals in evolutionary algorithms. Experimental results on synthetic as well as real data sets demonstrated that the proposed VD-MOEE is able to achieve appealing performance in terms of the solution selecting and accuracy in comparison with several classic and state-of-the-art endmember estimation methods.

Hyperspectral imagery is always composed of mixed pixels because of the limited spatial resolution of a sensor and the macroscopic/microscopic mixture of distinct substances. The linear mixing model (LMM) is proven to be simple and effective in extensive literature when the macroscopic mixture dominates the mixing process. But when the photons undergo multiple reflections before reaching the sensor, the LMM becomes invalid. In this circumstance, the bilinear mixture model (Bi-LMM), which considers secondary reflections with a bilinear term, is a viable alternative. However, the bilinear term in most existing Bi-LMMs is constructed based on the pre-estimated endmembers, and thus, most Bi-LMMs focus mainly on the abundance estimation. This may lead to inaccurate estimation of endmembers and abundances for a given hyperspectral image. In this article, we propose a multiobjective endmember extraction (Bi-MoEE) method within the bilinear mixture paradigm, which considers each secondary reflection as a virtual endmember. Then, Bi-MoEE selects real and virtual endmembers from an extended spectral library consisting of a standard spectral library and their virtual products. By imposing some intuitive constraints, the solution space is greatly reduced, and the multipoint crossover and restricted bit-flip mutation operators are specially designed. Finally, Bi-MoEE can efficiently obtain a set of tradeoff solutions by minimizing the unmixing residuals and the number of selected endmembers, and automatically determine the optimal solution with multiobjective decision-making techniques. Compared with some advanced endmember extraction methods, the proposed Bi-MoEE does not need to know the number of real endmembers. In addition, the time efficiency of Bi-MoEE is mainly related to the image size and the algorithmic parameters, and has little to do with the size of spectral library, thus facilitating the practical implementation of Bi-MoEE with regard to the oversized spectral library. The experiments on synthetic and real data sets demonstrated the excellent performance of Bi-MoEE.

The rapid development of remote sensing technology has enabled the acquisition of very high spatial resolution (VHR) multitemporal images in Earth observation. However, how to effectively exploit these existing data to accurately monitor land surface changes is still a challenging task. In this article, we propose an unsupervised scale-driven change detection (CD) framework for VHR images by jointly analyzing the spatial-spectral change information, which combines the advantages of deep feature learning and multiscale decision fusion. First, a well pretrained deep fully convolutional network (FCN) is used to automatically extract the deep spatial context information from the acquired images. Then, the uncertainty analysis incorporating the deep spatial feature and the image spectral feature is implemented to generate a pseudobinary change map. On this basis, it is easy to choose suitable samples to train an excellent support vector machine (SVM) classifier, thus detecting changes occurred on the ground. In addition, the multiscale superpixel segmentation technique is introduced to make full use of the spatial structural information, which takes an image-object as the basic analysis unit. Finally, a robust binary change map with high detection precision can be achieved by merging the CD results obtained at different scales. The impressive experimental results on four real data sets demonstrate the effectiveness and flexibility of the proposed framework.

Non-negative matrix factorization (NMF) is becoming increasingly popular in many research fields due to its particular properties of semantic interpretability and part-based representation. Sparseness constraints are usually imposed on the NMF problems in order to achieve potential features and sparse representation. These constrained NMF problems are usually reformulated as regularization models to solve conveniently. However, the regularization parameters in the regularization model are difficult to tune and the frequently used sparse-inducing terms in the regularization model generally have bias effects on the induced matrix and need an extra restricted isometry property (RIP). This paper proposes a multiobjective sparse NMF paradigm which refrains from the regularization parameter issues, bias effects, and the RIP condition. A novel multiobjective memetic algorithm is also proposed to generate a set of solutions with diverse sparsity and high factorization accuracy. A masked projected gradient local search scheme is specially designed to accelerate the convergence rate. In addition, a priori knowledge is also integrated in the algorithm to reduce the computational time in discovering our interested region in the objective space. The experimental results show that the proposed paradigm has better performance than some regularization algorithms in producing solutions with different degrees of sparsity as well as high factorization accuracy, which are favorable for making the final decisions.

In sparse hyperspectral unmixing, regularization methods inevitably suffer from the "decision ahead of solution" issue concerning the regularization parameter, which is not conducive to practical applications. To settle this issue, a two-phase multiobjective sparse unmixing (Tp-MoSU) approach has been proposed recently. However, Tp-MoSU has limited performance on high noise data and uses little spatial-contextual information in estimating abundances. To address the first problem, a tri-objective optimization model is established for each of the two phases to model mixed additive noise automatically. To address the second problem, a dual spatial exploiting objective is specially designed in the second phase to exploit similarity among adjacent pixels, which can improve the quality of estimated abundances. In addition, the memetic based evolutionary algorithms are elaborately modified for each of the two phases for better convergence. The experimental results on several representative data sets demonstrate that the proposed method performs better than Tp-MoSU in both of the two phases and completely better than some advanced regularization algorithms in abundance estimation under mixed additive noise.

With the rapid development of remote sensing technology, how to accurately detect changes that have occurred on the land surface has been a critical task, particularly when images come from different satellite sensors. In this letter, we propose an unsupervised change detection method for heterogeneous synthetic aperture radar (SAR) and optical images based on the logarithmic transformation feature learning framework. First, the logarithmic transformation is applied to the SAR image that aims to achieve similar statistical distribution properties as the optical image. Then, high-level feature representations can be learned from the transformed image pair via joint feature extraction, which are used to select reliable samples for training a neural network classifier. When it is trained well, a robust change map can be obtained, thus identifying changed regions accurately. The experimental results on three real heterogeneous data sets demonstrate the effectiveness and superiority of the proposed method compared with other existing state-of-the-art approaches.

With the sparse unmixing becoming increasingly popular recently, some advanced regularization algorithms have been proposed for settling this problem. However, they are limited by their “decision ahead of solution” attribute, i.e., the regularization parameters must be preset before the solution is obtained. In this paper, the sparse unmixing problem is first formulated as a two-phase multiobjective problem. The first phase simultaneously minimizes the unmixing residuals and the number of estimated endmembers for automatically finding the real active endmembers from the spectral library. A decomposition-based endmember selection algorithm considering the gene exchange in the population is specially designed for better and quicker search of the decision space. This algorithm can obtain a set of nondominated solutions for better decision of the active endmembers, which are important for the subsequent calculation of the abundance matrix. The second phase concurrently minimizes the unmixing residuals and the total variation term for estimating a preferable abundance matrix. A local search strategy based on the multiplicative update rule is designed in the evolution process for better approximation of the Pareto front. The experimental results on the synthetic as well as the real data reveal that the proposed framework has a better performance in finding the real active endmembers and estimating their corresponding abundances than some advanced regularization algorithms.