Xiangming Jiang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xiangming Jiang has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
- Maoguo Gong
Xidian University, Xi'an, China
18 shared publications - Tao Zhan
Northwest A&F University
10 shared publications Maoguo Gong
Xidian University
5 shared publicationsHao Li
Xidian University
4 shared publications- Mingyang Zhang
School of Electronic Engineering, Key Laboratory of Collaborative Intelligence Systems, Ministry of Education, Xidian University, Xian, China
4 shared publications Jingjing Ma
Key Lab of Intelligent Perception and Image Understanding of Ministry of Education of China, Xidian University PO Box 224 Xi'an 710071 People's Republic of China
3 shared publications
Latest Publications
- 22 July 2026
- Published by Taylor & Francis in International Journal of Remote Sensing
- Vol. 47 (18) , 8230-8257
Laplacian regularized low-rank representation for collaborative sparse unmixing in hyperspectral change detection
1. Hyperspectral imaging captures detailed spectral signatures across numerous contiguous bands, enabling precise material identification and characterization based on unique spectral properties (B...
- 22 July 2026
- Published by Taylor & Francis in International Journal of Remote Sensing
- Vol. 47 (18) , 8230-8257
Laplacian regularized low-rank representation for collaborative sparse unmixing in hyperspectral change detection
1. Hyperspectral imaging captures detailed spectral signatures across numerous contiguous bands, enabling precise material identification and characterization based on unique spectral properties (B...
- 5 October 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 330
A nonlocal superpatch-based reweighted low-rank representation method for hyperspectral unmixing
- 5 October 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 330
A nonlocal superpatch-based reweighted low-rank representation method for hyperspectral unmixing
- 28 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Geoscience and Remote Sensing Letters
- Vol. 22 (1545598X) , 1-5
Dual Collaborative Sparse and Total Variation Regularization for Unmixing-Based Change Detection
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.
- 28 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Geoscience and Remote Sensing Letters
- Vol. 22 (1545598X) , 1-5
Dual Collaborative Sparse and Total Variation Regularization for Unmixing-Based Change Detection
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.
- 22 August 2025
- Published by Elsevier in Applied Soft Computing
- Vol. 184
Multiobjective coevolutionary Bayesian learning for hyperspectral sparse unmixing
- 22 August 2025
- Published by Elsevier in Applied Soft Computing
- Vol. 184
Multiobjective coevolutionary Bayesian learning for hyperspectral sparse unmixing
- 28 August 2024
- Published by Elsevier in Applied Soft Computing
- Vol. 166
Multiobjective sparse unmixing based hyperspectral change detection
- 28 August 2024
- Published by Elsevier in Applied Soft Computing
- Vol. 166
Multiobjective sparse unmixing based hyperspectral change detection
- 25 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (5) , 9488-9499
CCGIB: A Cross-Channel Graph Information Bottleneck Principle
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.
- 25 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (5) , 9488-9499
CCGIB: A Cross-Channel Graph Information Bottleneck Principle
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.
- 13 February 2024
- Published by Elsevier in Applied Soft Computing
- Vol. 154
A Bayesian network learning method for sparse and unbalanced data with GNN-based multilabel classification application
- 13 February 2024
- Published by Elsevier in Applied Soft Computing
- Vol. 154
A Bayesian network learning method for sparse and unbalanced data with GNN-based multilabel classification application
- 1 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Geoscience and Remote Sensing Letters
- Vol. 20 (1545598X) , 1-5
S 3 Net: Superpixel-Guided Self-Supervised Learning Network for Multitemporal Image Change Detection
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).
- 1 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Geoscience and Remote Sensing Letters
- Vol. 20 (1545598X) , 1-5
S 3 Net: Superpixel-Guided Self-Supervised Learning Network for Multitemporal Image Change Detection
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).
- 12 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 61 (01962892) , 1-19
Cross-Domain Self-Taught Network for Few-Shot Hyperspectral Image Classification
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.
- 12 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 61 (01962892) , 1-19
Cross-Domain Self-Taught Network for Few-Shot Hyperspectral Image Classification
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.
- 17 December 2022
- Published by Springer Nature
- p. 374-385
Evolutionary Multitasking Optimization for Multiobjective Hyperspectral Band Selection
- 17 December 2022
- Published by Springer Nature
- p. 374-385
Evolutionary Multitasking Optimization for Multiobjective Hyperspectral Band Selection