HZHengyi Zheng

Hengyi Zheng

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Hengyi Zheng has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Graph Kolmogorov–Arnold Convolutional Network for Hyperspectral Image Classification

    by Hengyi Zheng, Hongjun Su, Zhaoyue Wu, Yiping Chen, Qian Du

    The Graph Neural Network (GNN) exhibits noteworthy performance in hyperspectral image classification (HSIC) due to its efficient message passing structure, which employs the Multi-Layer Perceptron (MLP) for feature extraction and utilizes nonlinear activation function between two layers of the network. However, two significant limitations (poor model scaling and lack of interpretability) impede GNN's ability to extract deeper features in the graph. Therefore, this paper proposes a novel method called Graph Kolmogorov-Arnold Convolutional Network (GKACN) where the Kolmogorov-Arnold Network (KAN) theory based convolutional operation employed in the graph for HSIC. As a new network architecture designed to replace the traditional MLP, KAN addresses the model scaling and interpretability limitations of MLP by using learnable spline-based functions in lieu of weights, resulting GKACN fully exploits the potential of the KAN and GNN structures to facilitate the mining of more representative features. Moreover, textural features from the extended morphological attribute profile extraction are used for spatial-spectral classification. Comprehensive experiments on four distinct HSI datasets have demonstrated the feasibility and superiority of the proposed method compared to other state-of-the-art models.


  • Graph Convolutional Network With Relaxed Collaborative Representation for Hyperspectral Image Classification

    by Hengyi Zheng, Hongjun Su, Zhaoyue Wu, Mercedes E. Paoletti, Qian Du

    Graph Convolutional Networks (GCNs) have been skillfully employed in hyperspectral image (HSI) classification, exhibiting remarkable performance owing to their unique superiority in handling non-Euclidean graph-structured data. However, the inherent absence of predefined connections between pixels in HSI results in the underutilization of the structural and attribute information of the graph edges. Furthermore, the construction of adjacency matrices for large-scale HSI data imposes a huge computational burden on traditional GCNs. Therefore, in this paper, a novel method combining Relaxed Collaborative Representation (RCR) and GCN (RCR-GCN) for hyperspectral classification is proposed. Specifically, RCR is adopted to compute the representation coefficients of each feature, reflecting the similarity and diversity among different sample features. Meanwhile, the representation coefficients are applied as edge attributes in the graph, denoting the weights of the connections between neighboring nodes. After that, GCN is employed to classify the graph nodes. Moreover, an efficient version of the RCR-GCN method is developed to boost the computation, which constructs the graph based on superpixel nodes instead of the pixel nodes by using Simple Linear Iterative Clustering (SLIC). Extensive experiments on three HSI image datasets demonstrate that the proposed method outperforms other state-of-the-art methods and achieves more efficiency and feasibility in HSI image classification.


  • Iterative Semi-Supervised Learning With Few-Shot Samples for Coastal Wetland Land Cover Classification

    by Hongjun Su, Hongliang Lu, Pan Zheng, Hengyi Zheng, Zhaohui Xue, Qian Du

    A novel approach is proposed in this study that combines superpixel (SP) segmentation and multi-classifier ensemble learning to address the limited availability of labeled samples in coastal wetland land cover classification. Firstly, the SP segmentation techniques is employed to partition unknown samples into multiple homogeneous regions, thereby facilitating the effective capture of spatial information pertaining to land cover. Subsequently, a multi-classifier ensemble learning strategy is employed within these regions to process the samples, effectively leading to a reduction in classification errors and an improvement in accuracy. To enhance the performance of semi-supervised learning (SSL), a sample iteration selection metric is introduced to optimize the training samples based on the consistency of sample types within homogeneous regions and the results obtained from the multi-classifier ensemble, thus enhancing the reliability of pseudo-labels. Additionally, multi-scale SP segmentation is utilized to augment the ensemble strategy for samples in order to reduce the necessity for hyperparameter adjustments and increase the automation and reliability of the model. Overall, the accuracy of coastal wetland classification is improved by this approach, while simultaneously mitigating the complexity of SSL in terms of hyperparameter tuning. The effectiveness of the proposed approach has been assessed through experiments conducted on three GF-5 hyperspectral images of coastal wetlands in China. In particular, the proposed methods provide superior performance compared with the state-of-the-art classification methods.


  • Semi-Supervised Dynamic Ensemble Learning With Balancing Diversity and Consistency for Hyperspectral Image Classification

    by Hongliang Lu, Hongjun Su, Pan Zheng, Yihan Gao, Hengyi Zheng, Zhaohui Xue, Weiwei Sun, Qian Du

    Hyperspectral coastal wetland classification requires an extensive quantity of labeled samples, which are hard to acquire. Therefore, a novel semi-supervised dynamic ensemble learning (SSDEL) framework is proposed to overcome the limitations of labeled samples in wetland hyperspectral classification. First, a collaborative relationship is established between labeled and unlabeled samples in the sample augmentation stage. Based on this relationship, unlabeled samples were assigned to the region to which the most similar samples belonged. Then, multiple classifiers are trained using labeled samples and predict unlabeled samples in the same region to obtain higher confidence pseudo-label results. Second, based on the assumption that different classifiers should produce similar classification results for a specific target sample, an objective function is designed to unify the classification behavior of multiple classifiers. The representation coefficients of multiple classifiers in the same region are constrained by optimizing the objective function through the $l_{2}$ -norm. Finally, a complete SSDEL framework is constructed by applying consistency learning again to the augmented samples. The proposed method is evaluated using three wetland hyperspectral images of China, and the experimental results demonstrate its effectiveness.


  • A Probabilistic Sample Boosting Approach With Adaptive Representation Coefficient Consistency for China Coastal Wetland Land Cover Classification Using GF-5 Hyperspectral Imagery

    by Hongliang Lu, Hongjun Su, Pan Zheng, Yihan Gao, Hengyi Zheng, Weiwei Sun, Qian Du

    Wetland contains numerous features, and label acquisition is time-consuming, laborious, and inaccurate. Coastal wetland land cover classification with limited labeled training samples has become a significant challenge. In this study, a novel probabilistic ensemble sample selection framework (ProESS) is proposed for coastal wetland land cover classification. First, a sample probabilistic confidence index (SPCI) is proposed, which is defined by probabilistic output of each base classifier. Then the prediction confidences of unknown samples are obtained by joint probability of ensemble base classifiers, which can select high-quality samples to improve classification performance. However, the low accuracy of base classifiers will affect the confidence of samples selected by SPCI, thus reducing the classification accuracy. Based on this observation, an adaptive representation coefficient consistency learning (AdaRCCL) is proposed to help define SPCI. Finally, a ProESS is constructed through SPCI and AdaRCCL which can obtain training samples with high confidence from unknown samples. To evaluate the effectiveness of proposed methods, the three wetland hyperspectral datasets of China, i.e., Yangtze River Delta, Jiangsu Dafeng Natural Reserve, and Yellow River Delta, are used for classification experiments in the paper. Experimental results show that the proposed algorithms achieve higher performance and are robust to parameters in comparison to the baseline and the state-of-the-art ensemble algorithms. The extensibility and transferability of proposed methods are also discussed in the paper. Better results on multiple machine learning models with new samples show the extensibility of SPCI and ProESS. The great performance on Botswana dataset also demonstrates the transferability of proposed methods.


  • Open Access

    Superpixel-Based Weighted Sparse Regression and Spectral Similarity Constrained for Hyperspectral Unmixing

    by Yao Liang, Hengyi Zheng, Guoguo Yang, Qian Du, Hongjun Su

    With the support of spectral libraries, sparse unmixing techniques have gradually developed. However, some existing sparse unmixing algorithms suffer from problems, such as insufficient utilization of spatial information and sensitivity to noise. To solve these problems, this article proposes a novel hyperspectral unmixing algorithm, called superpixel-based weighted sparse regression and spectral similarity constrained unmixing (WSRSSU). In the proposed method, a pre-calculated weight is introduced to help enhance sparsity of abundances, which is obtained from coarse abundance estimation. It also maintains spatial consistency in a local region of a hyperspectral image to mitigate the negative influence of noise. Additionally, the method selects optimal neighborhood pixels in the local region by combining spatial and spectral information and constructs a similarity matrix to explore spectral similarity in the subspace. Meanwhile, superpixel segmentation is considered as an auxiliary method to obtain local regions in the unmixing process. Experiments performed on synthetic and real data demonstrate that the proposed method achieves more accurate abundance estimation than other comparison algorithms.