Zhenqing Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Zhenqing Li has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Kewen Qu
The School of Computer Science and Engineering, North Minzu University, Yinchuan 750021, China
4 shared publications - Fangzhou Luo
School of computer science and engineering, North Minzu University, Yinchuan, China
3 shared publications - Chenyang Wang
Image and Intelligence Information Processing Innovation Team of the National Ethnic Affairs Commission of China and the School of Computer Science and Engineering, North Minzu University, Yinchuan, China
2 shared publications - Wenxing Bao
The School of Computer Science and Engineering, North Minzu University, Yinchuan 750021, China
2 shared publications - Xiaojuan Luo
School of computer science and engineering, North Minzu University, Yinchuan, China
1 shared publication
Latest Publications
- Open Access
- 23 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
- Vol. 17 (19391404) , 9628-9644
Hyperspectral Unmixing Using Reweighted Unidirectional TV Low-Rank NTF With Multiple-Factor Collaboration Regularization
The purpose of hyperspectral unmixing (HU) is to extract the spectral signatures and their proportion fractions from the hyperspectral remote sensing image (HSIs), which is a crucial issue in HSIs processing. Recently, nonnegative tensor factorization (NTF) has been successfully applied in the field of HU, because a third-order tensor can effectively maintain the spatial–spectral structure of HSIs, and NTF can produce multiple-view factor matrices that can impose more natural and diverse constraints. However, current NTF unmixing models utilizing priors are still insufficient, and NTF does not fully utilize the multiview factor matrices. Moreover, most methods only consider single-factor constraints, neglecting the effectiveness of collaborative constraints among multiple-factor priors information. To address the aforementioned shortcomings, a reweighted unidirectional total variation (UTV) low-rank NTF with multiple-factor collaborative regularization is proposed in this article. Specifically, first, to further exploit the abundance prior information, by utilizing the spatial similarity and the group sparse structure between the pixels of the two abundance low-rank submatrices, two reweighted UTV regularizers are constructed, which enhance the smooth and sparse properties of the abundances. Second, to smooth the endmember spectra and reduce the irregular burrs phenomenon caused by spectral noise interference, we introduce endmember band difference smooth constraints to ensure the piecewise smoothness of the endmember spectrum. Then, two reweighted UTV regularizers and an endmember spectral smooth regularizer are jointly introduced into the low-rank NTF framework to collaboratively regularize the nonconvex tensor representation model. Finally, we adopt the alternating direction multiplier method to optimize the objective model, and a large number of experiments on both synthetic and real hyperspectral datasets validate the effectiveness and efficiency of the proposed approach.
- 23 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
- Vol. 17 (19391404) , 9628-9644
Open AccessHyperspectral Unmixing Using Reweighted Unidirectional TV Low-Rank NTF With Multiple-Factor Collaboration Regularization
The purpose of hyperspectral unmixing (HU) is to extract the spectral signatures and their proportion fractions from the hyperspectral remote sensing image (HSIs), which is a crucial issue in HSIs processing. Recently, nonnegative tensor factorization (NTF) has been successfully applied in the field of HU, because a third-order tensor can effectively maintain the spatial–spectral structure of HSIs, and NTF can produce multiple-view factor matrices that can impose more natural and diverse constraints. However, current NTF unmixing models utilizing priors are still insufficient, and NTF does not fully utilize the multiview factor matrices. Moreover, most methods only consider single-factor constraints, neglecting the effectiveness of collaborative constraints among multiple-factor priors information. To address the aforementioned shortcomings, a reweighted unidirectional total variation (UTV) low-rank NTF with multiple-factor collaborative regularization is proposed in this article. Specifically, first, to further exploit the abundance prior information, by utilizing the spatial similarity and the group sparse structure between the pixels of the two abundance low-rank submatrices, two reweighted UTV regularizers are constructed, which enhance the smooth and sparse properties of the abundances. Second, to smooth the endmember spectra and reduce the irregular burrs phenomenon caused by spectral noise interference, we introduce endmember band difference smooth constraints to ensure the piecewise smoothness of the endmember spectrum. Then, two reweighted UTV regularizers and an endmember spectral smooth regularizer are jointly introduced into the low-rank NTF framework to collaboratively regularize the nonconvex tensor representation model. Finally, we adopt the alternating direction multiplier method to optimize the objective model, and a large number of experiments on both synthetic and real hyperspectral datasets validate the effectiveness and efficiency of the proposed approach.
- Open Access
- 12 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
- Vol. 17 (19391404) , 1885-1902
A Fast Sparse NMF Optimization Algorithm for Hyperspectral Unmixing
Hyperspectral remote sensing images (HSIs) have received extensive attention because of their high spectral resolution. However, the limitation of spatial resolution of imaging spectrometers results in a large number of mixed pixels, which restricts the accuracy of data processing. Consequently, hyperspectral unmixing (HU) becomes an important step and tool in remote sensing image processing. In recent years, many approaches based on sparse nonnegative matrix factorization (NMF) have been widely applied in the field of hyperspectral unmixing due to their explicit statistical properties. In particular, methods based on $\ell _{1/2}$ norm regularized NMF and their extended models have attracted considerable attention. However, the $\ell _{1/2}$ sparse regularizer leads to a nonconvex and nonsmooth problem, which is a significant challenge to solve quickly and efficiently in practice. In this paper, to solve the above problems, we propose a new fast $\ell _{1/2}$ sparse NMF algorithm, called NewSpr-NMF, which combines two famous fast gradient strategies, i.e., Barzilai–Borwein gradient and Nesterov's optimal gradient, to alternately optimize two subproblems in NMF framework under the block coordinate descent scheme. Specifically, for the abundance subproblem of sparse NMF, in order to accelerate the solving process, we use Barzilai–Borwein gradient technology to develop a half-thresholding approximate iterative subalgorithm, while for another endmember subproblem, we adopt the Nestrov's optimal gradient method with second-order convergence to solve. Finally, we integrate the two aforementioned algorithms together to achieve efficient unmixing by alternately optimizing the two subproblems of the sparse NMF. The computational complexity and convergence of the proposed algorithm are carefully analysed and briefly proved theoretically, respectively. A series of experimental results on both synthetic and real datasets, and compared with other advanced approaches, verify the effectiveness and efficiency of the proposed algorithm.
- 12 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
- Vol. 17 (19391404) , 1885-1902
Open AccessA Fast Sparse NMF Optimization Algorithm for Hyperspectral Unmixing
Hyperspectral remote sensing images (HSIs) have received extensive attention because of their high spectral resolution. However, the limitation of spatial resolution of imaging spectrometers results in a large number of mixed pixels, which restricts the accuracy of data processing. Consequently, hyperspectral unmixing (HU) becomes an important step and tool in remote sensing image processing. In recent years, many approaches based on sparse nonnegative matrix factorization (NMF) have been widely applied in the field of hyperspectral unmixing due to their explicit statistical properties. In particular, methods based on $\ell _{1/2}$ norm regularized NMF and their extended models have attracted considerable attention. However, the $\ell _{1/2}$ sparse regularizer leads to a nonconvex and nonsmooth problem, which is a significant challenge to solve quickly and efficiently in practice. In this paper, to solve the above problems, we propose a new fast $\ell _{1/2}$ sparse NMF algorithm, called NewSpr-NMF, which combines two famous fast gradient strategies, i.e., Barzilai–Borwein gradient and Nesterov's optimal gradient, to alternately optimize two subproblems in NMF framework under the block coordinate descent scheme. Specifically, for the abundance subproblem of sparse NMF, in order to accelerate the solving process, we use Barzilai–Borwein gradient technology to develop a half-thresholding approximate iterative subalgorithm, while for another endmember subproblem, we adopt the Nestrov's optimal gradient method with second-order convergence to solve. Finally, we integrate the two aforementioned algorithms together to achieve efficient unmixing by alternately optimizing the two subproblems of the sparse NMF. The computational complexity and convergence of the proposed algorithm are carefully analysed and briefly proved theoretically, respectively. A series of experimental results on both synthetic and real datasets, and compared with other advanced approaches, verify the effectiveness and efficiency of the proposed algorithm.
- 17 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 61 (01962892) , 1-17
Spatial–Spectral Attention Graph U-Nets for Hyperspectral Image Classification
Graph Neural Networks (GNNs) have outstanding performance in modeling global spatial information dependence, which makes them very suitable for the complex and diverse distribution of objects in hyperspectral images (HSIs). In recent years, they have been widely used in research on HSIs classification. However, the high dimensionality and high redundancy between bands of HSIs make it difficult to explore deep spectral features, resulting in high computational and storage costs for GNNs. Additionally, traditional convolutional neural networks preprocess images to obtain pixel-level features, but the local receptive field of their convolutional kernels cannot model non-local spatial dependencies, leading to extracted features that lack diversity. To address these issues, this paper proposes a graph convolutional network that integrates spatial and spectral attention using the Graph U-Nets architecture for HSIs classification (SSAGU). Firstly, a Spectral Pixel Sequence (SPS) extraction Module is constructed in the encoder stage based on spectral attention to reduce the influence of redundant bands and enable graph convolution to extract more discriminative spectral feature representations. Simultaneously, a Lightweight Graph Attention Network (LwGAT) is designed to reduce computing resource consumption during similarity matrix calculation. Secondly, the Multi-scale Feature Aggregation Module (MFAM) based on spatial attention is used to extract pixel-level features from the original hyperspectral data, which provides a more diverse spatial-spectral feature for the Graph U-Nets by fusing spatial contextual information at different scales. Finally, experiments on three widely used HSI datasets demonstrate that the proposed method achieves better classification performance than other advanced classification methods.
- 17 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 61 (01962892) , 1-17
Spatial–Spectral Attention Graph U-Nets for Hyperspectral Image Classification
Graph Neural Networks (GNNs) have outstanding performance in modeling global spatial information dependence, which makes them very suitable for the complex and diverse distribution of objects in hyperspectral images (HSIs). In recent years, they have been widely used in research on HSIs classification. However, the high dimensionality and high redundancy between bands of HSIs make it difficult to explore deep spectral features, resulting in high computational and storage costs for GNNs. Additionally, traditional convolutional neural networks preprocess images to obtain pixel-level features, but the local receptive field of their convolutional kernels cannot model non-local spatial dependencies, leading to extracted features that lack diversity. To address these issues, this paper proposes a graph convolutional network that integrates spatial and spectral attention using the Graph U-Nets architecture for HSIs classification (SSAGU). Firstly, a Spectral Pixel Sequence (SPS) extraction Module is constructed in the encoder stage based on spectral attention to reduce the influence of redundant bands and enable graph convolution to extract more discriminative spectral feature representations. Simultaneously, a Lightweight Graph Attention Network (LwGAT) is designed to reduce computing resource consumption during similarity matrix calculation. Secondly, the Multi-scale Feature Aggregation Module (MFAM) based on spatial attention is used to extract pixel-level features from the original hyperspectral data, which provides a more diverse spatial-spectral feature for the Graph U-Nets by fusing spatial contextual information at different scales. Finally, experiments on three widely used HSI datasets demonstrate that the proposed method achieves better classification performance than other advanced classification methods.
- 12 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 61 (01962892) , 1-15
Hyperspectral Unmixing Using Higher-Order Graph Regularized NMF With Adaptive Feature Selection
Recently, graph learning methods have attracted much research attention, which uses first-order nearest-neighbor relation between pixels to construct adjacency graphs for capturing smooth abundance. However, the first-order nearest-neighbor information neglects the shared domain structure of pixels making the higher-order nearest-neighbor relation missing resulting in limited spatial structure learning. Additionally, the feature values in hyperspectral images vary greatly in different bands, tiny value contributions are easily neglected due to the statistical properties of the model, which hinders the learning efficiency of the approach. To address these shortcomings, a higher-order graph regularizer nonnegative matrix factorization with adaptive feature selection method is proposed. Specifically, we introduce pixel second-order nearest-neighbor relation in graph learning to capture the nearest-neighbor domains of pixels with missing connection in first-order neighborhoods and enhance the aggregation of homogeneous regions. Then, the first-order and second-order nearest-neighbor relation are combined to construct higher-order graph regularizer to better preserve the global spatial structure of the image. Additionally, adaptive weight is introduced in the data reconstruction to balance the effects of different feature values by adaptively selecting spectral features to enhance the contribution of tiny features. Finally, the objective function is designed by fusing the higher-order graph regularization, adaptive feature selection and L 1/2 sparse regularizer into the nonnegative matrix factorization framework, and the optimization algorithm of the model is derived using a multiplicative update rule. We conducted extensive experiments on synthetic and real datasets, and the effectiveness and superiority of the proposed method were verified by comparing it with several state-of-the-art methods.
- 12 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 61 (01962892) , 1-15
Hyperspectral Unmixing Using Higher-Order Graph Regularized NMF With Adaptive Feature Selection
Recently, graph learning methods have attracted much research attention, which uses first-order nearest-neighbor relation between pixels to construct adjacency graphs for capturing smooth abundance. However, the first-order nearest-neighbor information neglects the shared domain structure of pixels making the higher-order nearest-neighbor relation missing resulting in limited spatial structure learning. Additionally, the feature values in hyperspectral images vary greatly in different bands, tiny value contributions are easily neglected due to the statistical properties of the model, which hinders the learning efficiency of the approach. To address these shortcomings, a higher-order graph regularizer nonnegative matrix factorization with adaptive feature selection method is proposed. Specifically, we introduce pixel second-order nearest-neighbor relation in graph learning to capture the nearest-neighbor domains of pixels with missing connection in first-order neighborhoods and enhance the aggregation of homogeneous regions. Then, the first-order and second-order nearest-neighbor relation are combined to construct higher-order graph regularizer to better preserve the global spatial structure of the image. Additionally, adaptive weight is introduced in the data reconstruction to balance the effects of different feature values by adaptively selecting spectral features to enhance the contribution of tiny features. Finally, the objective function is designed by fusing the higher-order graph regularization, adaptive feature selection and L 1/2 sparse regularizer into the nonnegative matrix factorization framework, and the optimization algorithm of the model is derived using a multiplicative update rule. We conducted extensive experiments on synthetic and real datasets, and the effectiveness and superiority of the proposed method were verified by comparing it with several state-of-the-art methods.