Huiyang Wang

Mr. Huiyang Wang


Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 February 2025 in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
Verified
Journal Article
Open access
KQkewen qu
kewen qu
FLFangzhou Luo
Fangzhou Luo
HWHuiyang Wang
Huiyang Wang
WBWenxing Bao
Wenxing Bao
In recent years, hyperspectral sparse unmixing (HSU) has garnered extensive research and attention due to its unique characteristic of not requiring the estimation of endmembers and their number. However, the high coherence and large-scale nature of the prior spectral library frequently lead to substantial computational costs and limited unmixing accuracy in the optimization model, thereby hindering the efficiency and further promotion of HSU in practical engineering applications. To address these shortcomings, this article proposes a new fast two-step sparse unmixing algorithm, called NeSU-LP, which is based on adaptive spectral library pruning technology and the Nesterov fast optimization strategy. In this method, HSU is divided into two independent and consecutive subprocesses: coarse unmixing and fine unmixing. Specially, first, in the coarse unmixing stage, we design a sparse optimization model based on the initial large spectral library, requiring only a few iterations to initially estimate the row-sparse abundance matrix. Subsequently, the proposed atomic (i.e., endmember) activity evaluation method is utilized to screen the active endmembers, analyze the abundance matrix, and prune the endmembers in the spectral library. Irrelevant endmembers are removed, reducing the spectral library size and generating a low-coherence, small-scale endmember matrix. Finally, in the fine unmixing process, we retain the effective atomic abundance rows obtained in the previous stage and design the final fine hyperspectral unmixing model based on the pruned, small-scale endmember matrix. In addition, to enhance the smoothness of the abundance maps, graph Laplacian regularization is introduced during the fine unmixing stage. The Nesterov fast gradient strategy is employed to accelerate the iterative process of fine unmixing, ultimately achieving second-order convergence efficiency for the algorithm. Numerous experiments were conducted on both synthetic and real datasets, comparing them with state-of-the-art methods. The experimental results demonstrate the high efficiency and advancement of the proposed method.

19 July 2025 in Remote Sensing
Verified
Journal Article
Open access
PDF file
KQkewen qu
kewen qu
HWHuiyang Wang
Huiyang Wang
MDMingming Ding
Mingming Ding
XLXiaojuan Luo
Xiaojuan Luo
WBWenxing Bao
Wenxing Bao
Hyperspectral sparse unmixing (SU) networks have recently received considerable attention due to their model hyperspectral images (HSIs) with a priori spectral libraries and to capture nonlinear features through deep networks. This method effectively avoids errors associated with endmember extraction, and enhances the unmixing performance via nonlinear modeling. However, two major challenges remain: the use of large spectral libraries with high coherence leads to computational redundancy and performance degradation; moreover, certain feature extraction models, such as Transformer, while exhibiting strong representational capabilities, suffer from high computational complexity. To address these limitations, this paper proposes a hyperspectral unmixing dual-branch network integrating an adaptive hop-aware GCN and neighborhood offset Mamba that is termed DGMNet. Specifically, DGMNet consists of two parallel branches. The first branch employs the adaptive hop-neighborhood-aware GCN (AHNAGC) module to model global spatial features. The second branch utilizes the neighborhood spatial offset Mamba (NSOM) module to capture fine-grained local spatial structures. Subsequently, the designed Mamba-enhanced dual-stream feature fusion (MEDFF) module fuses the global and local spatial features extracted from the two branches and performs spectral feature learning through a spectral attention mechanism. Moreover, DGMNet innovatively incorporates a spectral-library-pruning mechanism into the SU network and designs a new pruning strategy that accounts for the contribution of small-target endmembers, thereby enabling the dynamic selection of valid endmembers and reducing the computational redundancy. Finally, an improved ESS-Loss is proposed, which combines an enhanced total variation (ETV) with an l1/2 sparsity constraint to effectively refine the model performance. The experimental results on two synthetic and five real datasets demonstrate the effectiveness and superiority of the proposed method compared with the state-of-the-art methods. Notably, experiments on the Shahu dataset from the Gaofen-5 satellite further demonstrated DGMNet’s robustness and generalization.

25 March 2025 in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
Verified
Journal Article
Open access
KQkewen qu
kewen qu
HWHuiyang Wang
Huiyang Wang
MDMingming Ding
Mingming Ding
XLXiaojuan Luo
Xiaojuan Luo
FLFangzhou Luo
Fangzhou Luo
In recent years, sparse unmixing (SU) has garnered significant attention in hyperspectral images (HSI) because it does not require endmember estimation, relying instead on prior spectral libraries to represent observed HSI data, which avoids the influence of endmember extraction on unmixing. However, SU methods based on representation models have limited capability in learning nonlinear features, which results in poor abundances estimation performance in complex environments. Recently, inspired by deep learning, SU models based on neural networks have been proposed to more effectively extract and handle nonlinear features. Nevertheless, the convolution strategies employed in existing SU network models lead to insufficient attention to longrange pixel dependencies, consequently resulting in restricted utilization of spatial priors. In view of the above shortcomings, this paper proposes a parallel dynamic multi-hop graph and composite multi-scale convolution network for SU, referred to as PMGMCN. The network combines the advantages of Convolutional Neural Network (CNN) and Graph Convolutional Network (GCN), achieving a complementary and enhanced integration of their characteristics. Specifically, the network captures longrange spatial features through the designed Dynamic Multi-hop Graph Interaction Attention Module (DMGIAM), which is based on GCN, while the Composite Multi-scale convolution SpatialSpectral Attention Module (CMS2AM), which is based on CNN, is designed to extract multi-scale spatial-spectral information within local regions. Additionally, this paper introduces an adaptive weighted total variation loss function based on Sobel edge operator and Gaussian function (SGATV) to encourage piecewise smoothness in abundances maps while preserving edge information. Extensive experiments on synthetic and real datasets demonstrate the effectiveness and superiority of the proposed method compared with the state-of-the-art methods.

28 November 2025 in Mathematics
Verified
Journal Article
Open access
PDF file
KQkewen qu
kewen qu
FLFangzhou Luo
Fangzhou Luo
HWHuiyang Wang
Huiyang Wang
WBWenxing Bao
Wenxing Bao
Sparse unmixing (SU) has become a research hotspot in hyperspectral image (HSI) analysis in recent years due to its interpretable physical mechanisms and engineering practicality. However, traditional SU methods are confronted with two core bottlenecks: Firstly, the high computational complexity of the abundance matrix inversion severely limits algorithmic efficiency. Secondly, the inherent challenges posed by large-scale highly coherent spectral libraries hinder improvement of unmixing accuracy. To overcome these limitations, this study proposes a novel sub-abundance map regularized sparse unmixing (SARSU) framework based on dynamic abundances subspace awareness. Specifically, first of all, we have developed an intelligent spectral atom selection strategy that employs a designed dynamic activity evaluation mechanism to quantify the participation contribution of spectral library atoms during the unmixing process in real time. This enables adaptive selection of critical subsets to construct active subspace abundance maps, effectively mitigating spectral redundancy interference. Secondly, we innovatively integrated weighted nuclear norm regularization based on sub-abundance maps into the model, deeply mining potential low-rank structures within spatial distribution patterns to significantly enhance the spatial fidelity of unmixing results. Additionally, a multi-directional neighborhood-aware dual total variation (DTV) regularizer was designed, which enforces spatial consistency constraints between adjacent pixels through a four directional (horizontal, vertical, diagonal, and back-diagonal) differential penalty mechanism, ensuring abundance distributions comply with physical diffusion laws of ground objects. Finally, to efficiently solve the proposed objective model, an optimization algorithm based on the Alternating Direction Method of Multipliers (ADMM) was developed. Comparative experiments conducted on two simulated datasets and four real hyperspectral benchmark datasets, alongside comparisons with state-of-the-art methods, validated the efficiency and superiority of the proposed approach.