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.
6 February 2020 in IEEE Transactions on Geoscience and Remote Sensing
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.
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.
9 October 2017 in IEEE Transactions on Geoscience and Remote Sensing
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.
29 March 2018 in CAAI Transactions on Intelligence Technology
Here, the authors propose a novel two‐phase clustering algorithm with a density exploring distance (DED) measure. In the first phase, the fast global K ‐means clustering algorithm is used to obtain the cluster number and the prototypes. Then, the prototypes of all these clusters and representatives of points belonging to these clusters are regarded as the input data set of the second phase. Afterwards, all the prototypes are clustered according to a DED measure which makes data points locating in the same structure to possess high similarity with each other. In experimental studies, the authors test the proposed algorithm on seven artificial as well as seven UCI data sets. The results demonstrate that the proposed algorithm is flexible to different data distributions and has a stronger ability in clustering data sets with complex non‐convex distribution when compared with the comparison algorithms.