Xiaojuan Luo

Ms. Xiaojuan Luo


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
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.

3 January 2026 in Remote Sensing
Verified
Journal Article
Open access
PDF file
KQkewen qu
kewen qu
XLXiaojuan Luo
Xiaojuan Luo
WBWenxing Bao
Wenxing Bao
Hyperspectral unmixing (HU) aims to extract constituent information from mixed pixels and is a fundamental task in hyperspectral remote sensing. Deep non-negative matrix factorization (DNMF) has recently attracted attention for HU due to its hierarchical representation capability. However, existing DNMF-based methods are often sensitive to noise and outliers, and face limitations in incorporating prior knowledge, modeling feature structures, and enforcing sparsity constraints, which restrict their robustness, accuracy, and interpretability. To address these challenges, we propose a sparse deep NMF model with adversarial graph regularization for hyperspectral unmixing, termed DNMF-AG. Specifically, we design an adversarial graph regularizer that integrates local similarity and dissimilarity graphs to promote intraclass consistency and interclass separability in the spatial domain, thereby enhancing structural modeling and robustness. In addition, a Gram-based sparsity constraint is introduced to encourage sparse abundance representations by penalizing inner product correlations. To further improve robustness and computational efficiency, a truncated activation function is incorporated into the iterative update process, suppressing low-amplitude components and promoting zero entries in the abundance matrix. The overall model is optimized using the alternating direction method of multipliers (ADMM). Experimental results on multiple synthetic and real datasets demonstrate that the proposed method outperforms state-of-the-art approaches in terms of estimation accuracy and robustness.