Dong Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Dong Li has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Shuisheng Zhou
School of Mathematics and Statistics, XiDian University, Xi’an, China
4 shared publications - Bing Qin
Harbin Institute of Technology, Harbin, China
1 shared publication - Bo Wang
Northwest Institute of Mechanical and Electrical Engineering, Xianyang 712099, China
1 shared publication - Dingheng Wang
Northwest Institute of Mechanical and Electrical Engineering, Xianyang, China
1 shared publication - Furu Wei
Microsoft Corporation
1 shared publication - Haichao Zhu
Baidu Inc
1 shared publication
Latest Publications
- 25 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 63 (01962892) , 1-14
Temperature-Aware Dynamic Fusion Network for Few-Shot Segmentation of Infrared Images
Infrared remote sensing is indispensable for aerial target detection due to its all-weather thermal radiation sensing capability. Integrating visible light’s high resolution with infrared’s robustness to environmental interference represents an advanced strategy to improve segmentation accuracy. Current challenges of the strategy include: 1) degradation of infrared images due to background noise; 2) cross-modal feature mismatches caused by temperature disparities between thermal and spectral data; 3) insufficient annotated datasets restricting model generalization. To address these challenges, this paper proposes a temperature-aware dynamic fusion network for few-shot infrared image segmentation algorithm. The method significantly improves segmentation accuracy through two key innovations: temperature-guided dual-modal feature fusion and thermodynamic few-shot transfer mechanisms. Specifically, in temperature-guided dual-modal feature fusion, Dual-stream Pyramid Enhancement Module (DPEM) is designed to suppress noise and boost contrast in infrared image. Building upon this, Temperature-guided Dual-modal Encoder is constructed to dynamically fuse visible light and Infrared features. In thermodynamic few-shot transfer, Thermodynamic Adversarial Alignment can obtain dual-modal features with discriminative information in few-shot transfer. Then, Thermodynamic Pseudo-Labeling Enhancement is created to improve pseudo-label quality by Temperature Confidence Propagation. Numerous experimental results performed on a multi-scenario dataset with 12,800 visible-infrared aircraft images have validated the method’s superiority, achieving SOTA performance with minimum gains of 7.07% mPA, 6.48% mF1, and 7.93% mIoU over existing methods like GANFuse and TransFusion. This framework advances explainable infrared visual understanding in complex environments.
- 25 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 63 (01962892) , 1-14
Temperature-Aware Dynamic Fusion Network for Few-Shot Segmentation of Infrared Images
Infrared remote sensing is indispensable for aerial target detection due to its all-weather thermal radiation sensing capability. Integrating visible light’s high resolution with infrared’s robustness to environmental interference represents an advanced strategy to improve segmentation accuracy. Current challenges of the strategy include: 1) degradation of infrared images due to background noise; 2) cross-modal feature mismatches caused by temperature disparities between thermal and spectral data; 3) insufficient annotated datasets restricting model generalization. To address these challenges, this paper proposes a temperature-aware dynamic fusion network for few-shot infrared image segmentation algorithm. The method significantly improves segmentation accuracy through two key innovations: temperature-guided dual-modal feature fusion and thermodynamic few-shot transfer mechanisms. Specifically, in temperature-guided dual-modal feature fusion, Dual-stream Pyramid Enhancement Module (DPEM) is designed to suppress noise and boost contrast in infrared image. Building upon this, Temperature-guided Dual-modal Encoder is constructed to dynamically fuse visible light and Infrared features. In thermodynamic few-shot transfer, Thermodynamic Adversarial Alignment can obtain dual-modal features with discriminative information in few-shot transfer. Then, Thermodynamic Pseudo-Labeling Enhancement is created to improve pseudo-label quality by Temperature Confidence Propagation. Numerous experimental results performed on a multi-scenario dataset with 12,800 visible-infrared aircraft images have validated the method’s superiority, achieving SOTA performance with minimum gains of 7.07% mPA, 6.48% mF1, and 7.93% mIoU over existing methods like GANFuse and TransFusion. This framework advances explainable infrared visual understanding in complex environments.
- 13 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (11) , 6653-6666
Multi-Prototypes Convex Merging Based K-Means Clustering Algorithm
K-Means algorithm is a popular clustering method. However, it has two limitations: 1) it gets stuck easily in spurious local minima, and 2) the number of clusters$k$ has to be given a priori. To solve these two issues, a multi-prototypes convex merging based K-Means clustering algorithm (MCKM) is presented. First, based on the structure of the spurious local minima of the K-Means problem, a multi-prototypes sampling (MPS) is designed to select the appropriate number of multi-prototypes for data with arbitrary shapes. Then, a merging technique, called convex merging (CM), merges the multi-prototypes to get a better local minima without$k$ being given a priori. Specifically, CM can obtain the optimal merging and estimate the correct$k$ . By integrating these two techniques with K-Means algorithm, the proposed MCKM is an efficient and explainable clustering algorithm for escaping the undesirable local minima of K-Means problem without given$k$ first. Two theoretical proofs are given to guarantee that the cost of MCKM (MPS+CM) can achieve a constant factor approximation to the optimal cost of the K-Means problem. Experimental results performed on synthetic and real-world data sets have verified the effectiveness of the proposed algorithm.- 13 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (11) , 6653-6666
Multi-Prototypes Convex Merging Based K-Means Clustering Algorithm
K-Means algorithm is a popular clustering method. However, it has two limitations: 1) it gets stuck easily in spurious local minima, and 2) the number of clusters$k$ has to be given a priori. To solve these two issues, a multi-prototypes convex merging based K-Means clustering algorithm (MCKM) is presented. First, based on the structure of the spurious local minima of the K-Means problem, a multi-prototypes sampling (MPS) is designed to select the appropriate number of multi-prototypes for data with arbitrary shapes. Then, a merging technique, called convex merging (CM), merges the multi-prototypes to get a better local minima without$k$ being given a priori. Specifically, CM can obtain the optimal merging and estimate the correct$k$ . By integrating these two techniques with K-Means algorithm, the proposed MCKM is an efficient and explainable clustering algorithm for escaping the undesirable local minima of K-Means problem without given$k$ first. Two theoretical proofs are given to guarantee that the cost of MCKM (MPS+CM) can achieve a constant factor approximation to the optimal cost of the K-Means problem. Experimental results performed on synthetic and real-world data sets have verified the effectiveness of the proposed algorithm.- 11 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 35 (12) , 12337-12349
Accelerated Fuzzy C-Means Clustering Based on New Affinity Filtering and Membership Scaling
Fuzzy C-Means (FCM) is a widely used clustering method. However, FCM and its many accelerated variants have low efficiency in the mid-to-late stage of the clustering process. In this stage, all samples are involved in updating their non-affinity centers, and the fuzzy membership grades of most samples, whose assignments remain unchanged, are still updated by calculating the sample-center distances. All these factors lead to the algorithms converging slowly. In this paper, a new affinity filtering technique is developed to recognize a complete set of non-affinity centers for each sample with low computations. Then, a new membership scaling technique is suggested to set the membership grades between each sample and its non-affinity centers to 0 and maintain the fuzzy membership grades for others. By integrating these two techniques, FCM based on new affinity filtering and membership scaling (AMFCM) is proposed to accelerate the whole convergence process of FCM. Numerous experimental results performed on synthetic and real-world data sets have shown the feasibility and efficiency of the proposed algorithm. Compared with state-of-the-art algorithms, AMFCM is significantly faster and more effective. For example, AMFCM reduces the number of FCM iterations by 80 $\%$ on average.
- 11 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 35 (12) , 12337-12349
Accelerated Fuzzy C-Means Clustering Based on New Affinity Filtering and Membership Scaling
Fuzzy C-Means (FCM) is a widely used clustering method. However, FCM and its many accelerated variants have low efficiency in the mid-to-late stage of the clustering process. In this stage, all samples are involved in updating their non-affinity centers, and the fuzzy membership grades of most samples, whose assignments remain unchanged, are still updated by calculating the sample-center distances. All these factors lead to the algorithms converging slowly. In this paper, a new affinity filtering technique is developed to recognize a complete set of non-affinity centers for each sample with low computations. Then, a new membership scaling technique is suggested to set the membership grades between each sample and its non-affinity centers to 0 and maintain the fuzzy membership grades for others. By integrating these two techniques, FCM based on new affinity filtering and membership scaling (AMFCM) is proposed to accelerate the whole convergence process of FCM. Numerous experimental results performed on synthetic and real-world data sets have shown the feasibility and efficiency of the proposed algorithm. Compared with state-of-the-art algorithms, AMFCM is significantly faster and more effective. For example, AMFCM reduces the number of FCM iterations by 80 $\%$ on average.
- Open Access
Transforming Wikipedia into Augmented Data for Query-Focused Summarization
The limited size of existing query-focused summarization datasets renders training data-driven summarization models challenging. Meanwhile, the manual construction of a query-focused summarization corpus is costly and time-consuming. In this paper, we use Wikipedia to automatically collect a large query-focused summarization dataset (named WIKIREF) of more than 280, 000 examples, which can serve as a means of data augmentation. We also develop a BERT-based query-focused summarization model (Q-BERT) to extract sentences from the documents as summaries. To better adapt a huge model containing millions of parameters to tiny benchmarks, we identify and fine-tune only a sparse subnetwork, which corresponds to a small fraction of the whole model parameters. Experimental results on three DUC benchmarks show that the model pre-trained on WIKIREF has already achieved reasonable performance. After fine-tuning on the specific benchmark datasets, the model with data augmentation outperforms strong comparison systems. Moreover, both our proposed Q-BERT model and subnetwork fine-tuning further improve the model performance. The dataset is publicly available at https://aka.ms/wikiref.
Open AccessTransforming Wikipedia into Augmented Data for Query-Focused Summarization
The limited size of existing query-focused summarization datasets renders training data-driven summarization models challenging. Meanwhile, the manual construction of a query-focused summarization corpus is costly and time-consuming. In this paper, we use Wikipedia to automatically collect a large query-focused summarization dataset (named WIKIREF) of more than 280, 000 examples, which can serve as a means of data augmentation. We also develop a BERT-based query-focused summarization model (Q-BERT) to extract sentences from the documents as summaries. To better adapt a huge model containing millions of parameters to tiny benchmarks, we identify and fine-tune only a sparse subnetwork, which corresponds to a small fraction of the whole model parameters. Experimental results on three DUC benchmarks show that the model pre-trained on WIKIREF has already achieved reasonable performance. After fine-tuning on the specific benchmark datasets, the model with data augmentation outperforms strong comparison systems. Moreover, both our proposed Q-BERT model and subnetwork fine-tuning further improve the model performance. The dataset is publicly available at https://aka.ms/wikiref.
- 1 March 2021
- Published by Elsevier in Knowledge-Based Systems
- Vol. 215
Robust multiclass least squares support vector classifier with optimal error distribution
- 1 March 2021
- Published by Elsevier in Knowledge-Based Systems
- Vol. 215
Robust multiclass least squares support vector classifier with optimal error distribution
- 18 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 29 (9) , 2810-2818
A New Membership Scaling Fuzzy C-Means Clustering Algorithm
Fuzzy c-means (FCM) is one of the most frequently used methods for clustering. However, with the increasing amount of data, FCM suffers from slow convergence and a large amount of calculation because all samples are involved in updating the solutions per iteration without considering the current clustering results. In this research, a new membership scaling FCM (MSFCM) is proposed, based on the observation that the samples, whose nearest cluster center is v, aid the convergence of v, whereas the remaining samples prevent the convergence of v. In the new algorithm, many samples whose nearest cluster centers do not change in the next iteration are chosen by using the triangle inequality. A new scheme for scaling the membership degrees of the chosen samples is suggested to boost the effect of the in-cluster samples and weaken the effect of the out-of-cluster samples in the clustering process. The new scheme not only accelerates the convergence of the algorithm but also maintains the high clustering quality. Many experimental results on synthetic and real-world data sets have verified the effectiveness of the proposed algorithm in improving the speed of the convergence of the fuzzy clustering. In particular, compared with FCM, MSFCM saves at least two thirds of total rounds of iterations without significantly increasing the cost per iteration.
- 18 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 29 (9) , 2810-2818
A New Membership Scaling Fuzzy C-Means Clustering Algorithm
Fuzzy c-means (FCM) is one of the most frequently used methods for clustering. However, with the increasing amount of data, FCM suffers from slow convergence and a large amount of calculation because all samples are involved in updating the solutions per iteration without considering the current clustering results. In this research, a new membership scaling FCM (MSFCM) is proposed, based on the observation that the samples, whose nearest cluster center is v, aid the convergence of v, whereas the remaining samples prevent the convergence of v. In the new algorithm, many samples whose nearest cluster centers do not change in the next iteration are chosen by using the triangle inequality. A new scheme for scaling the membership degrees of the chosen samples is suggested to boost the effect of the in-cluster samples and weaken the effect of the out-of-cluster samples in the clustering process. The new scheme not only accelerates the convergence of the algorithm but also maintains the high clustering quality. Many experimental results on synthetic and real-world data sets have verified the effectiveness of the proposed algorithm in improving the speed of the convergence of the fuzzy clustering. In particular, compared with FCM, MSFCM saves at least two thirds of total rounds of iterations without significantly increasing the cost per iteration.