Wenying Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Wenying Chen has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Junbin Zhuang
School of Aerospace Science and Technology, Xidian University, Xi’an 710126, China
2 shared publications - Yunyi Yan
School of Aerospace Science and Technology, Xidian University, Xian, China
2 shared publications - Baolong Guo
Institute of Intelligent Control and Image Engineering, Xidian University, Xian, China
1 shared publication - Xunan Huang
School of Computer Science and Technology, Xidian University, Xi’an, China
1 shared publication
Latest Publications
- Open Access
- 8 January 2025
- Published by MDPI AG in Remote Sensing
- Vol. 17 (2) , 193
Band Selection Algorithm Based on Multi-Feature and Affinity Propagation Clustering
Hyperspectral images are high-dimensional data containing rich spatial, spectral, and radiometric information, widely used in geological mapping, urban remote sensing, and other fields. However, due to the characteristics of hyperspectral remote sensing images—such as high redundancy, strong correlation, and large data volumes—the classification and recognition of these images present significant challenges. In this paper, we propose a band selection method (GE-AP) based on multi-feature extraction and the Affine Propagation Clustering (AP) algorithm for dimensionality reduction of hyperspectral images, aiming to improve classification accuracy and processing efficiency. In this method, texture features of the band images are extracted using the Gray-Level Co-occurrence Matrix (GLCM), and the Euclidean distance between bands is calculated. A similarity matrix is then constructed by integrating multi-feature information. The AP algorithm clusters the bands of the hyperspectral images to achieve effective band dimensionality reduction. Through simulation and comparison experiments evaluating the overall classification accuracy (OA) and Kappa coefficient, it was found that the GE-AP method achieves the highest OA and Kappa coefficient compared to three other methods, with maximum increases of 8.89% and 13.18%, respectively. This verifies that the proposed method outperforms traditional single-information methods in handling spatial and spectral redundancy between bands, demonstrating good adaptability and stability.
- 8 January 2025
- Published by MDPI AG in Remote Sensing
- Vol. 17 (2) , 193
Open AccessBand Selection Algorithm Based on Multi-Feature and Affinity Propagation Clustering
Hyperspectral images are high-dimensional data containing rich spatial, spectral, and radiometric information, widely used in geological mapping, urban remote sensing, and other fields. However, due to the characteristics of hyperspectral remote sensing images—such as high redundancy, strong correlation, and large data volumes—the classification and recognition of these images present significant challenges. In this paper, we propose a band selection method (GE-AP) based on multi-feature extraction and the Affine Propagation Clustering (AP) algorithm for dimensionality reduction of hyperspectral images, aiming to improve classification accuracy and processing efficiency. In this method, texture features of the band images are extracted using the Gray-Level Co-occurrence Matrix (GLCM), and the Euclidean distance between bands is calculated. A similarity matrix is then constructed by integrating multi-feature information. The AP algorithm clusters the bands of the hyperspectral images to achieve effective band dimensionality reduction. Through simulation and comparison experiments evaluating the overall classification accuracy (OA) and Kappa coefficient, it was found that the GE-AP method achieves the highest OA and Kappa coefficient compared to three other methods, with maximum increases of 8.89% and 13.18%, respectively. This verifies that the proposed method outperforms traditional single-information methods in handling spatial and spectral redundancy between bands, demonstrating good adaptability and stability.
- Open Access
- 27 September 2024
- Published by MDPI AG in Remote Sensing
- Vol. 16 (19) , 3608
Infrared Weak Target Detection in Dual Images and Dual Areas
This study proposes a novel approach for detecting weak small infrared (IR) targets, called double-image and double-local contrast measurement (DDLCM), designed to overcome challenges of low contrast and complex backgrounds in images. In this approach, the original image is decomposed into odd and even images, and the gray difference contrast is determined using a dual-neighborhood sliding window structure, enhancing target saliency and contrast by increasing the distinction between the target and the local background. A central unit is then constructed to capture relationships between neighboring and non-neighboring units, aiding in clutter suppression and eliminating bright non-target interference. Lastly, the output value is derived by extracting the lowest contrast value of the weak small targets from the saliency map in each direction. Experimental results on two datasets demonstrate that the DDLCM algorithm significantly enhances real-time IR dim target detection, achieving an average performance improvement of 32.83%. The area under the ROC curve (AUC) decline is effectively controlled, with a maximum reduction limited to 3%. Certain algorithms demonstrate a notable AUC improvement of up to 43.96%. To advance infrared dim target detection research, we introduce the IFWS dataset for benchmarking and validating algorithm performance.
- 27 September 2024
- Published by MDPI AG in Remote Sensing
- Vol. 16 (19) , 3608
Open AccessInfrared Weak Target Detection in Dual Images and Dual Areas
This study proposes a novel approach for detecting weak small infrared (IR) targets, called double-image and double-local contrast measurement (DDLCM), designed to overcome challenges of low contrast and complex backgrounds in images. In this approach, the original image is decomposed into odd and even images, and the gray difference contrast is determined using a dual-neighborhood sliding window structure, enhancing target saliency and contrast by increasing the distinction between the target and the local background. A central unit is then constructed to capture relationships between neighboring and non-neighboring units, aiding in clutter suppression and eliminating bright non-target interference. Lastly, the output value is derived by extracting the lowest contrast value of the weak small targets from the saliency map in each direction. Experimental results on two datasets demonstrate that the DDLCM algorithm significantly enhances real-time IR dim target detection, achieving an average performance improvement of 32.83%. The area under the ROC curve (AUC) decline is effectively controlled, with a maximum reduction limited to 3%. Certain algorithms demonstrate a notable AUC improvement of up to 43.96%. To advance infrared dim target detection research, we introduce the IFWS dataset for benchmarking and validating algorithm performance.