Xizhan Gao

Dr. Xizhan Gao

orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
22 March 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
FZFa Zhu
Fa Zhu
Wenjie ZhangWenjie Zhang
Wenjie Zhang
XCXingchi Chen
Xingchi Chen
XGXizhan Gao
Xizhan Gao
NYNing Ye
Ning Ye

1 February 2020 in Expert Systems with Applications
Verified
Journal Article
Closed access
XGXizhan Gao
Xizhan Gao
QSQuansen Sun
Quansen Sun
HXHaitao Xu
Haitao Xu
JGJianqiang Gao
Jianqiang Gao

4 June 2015 in International Journal of Machine Learning and Cybernetics
Verified
Journal Article
Closed access
PDF file
XGXizhan Gao
Xizhan Gao
LFLiya Fan
Liya Fan
HXHaitao Xu
Haitao Xu

18 October 2022 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
XGXizhan Gao
Xizhan Gao
SNSijie Niu
Sijie Niu
DWDong Wei
Dong Wei
XLXingrui Liu
Xingrui Liu
TWTingwei Wang
Tingwei Wang
QSQuansen Sun
Quansen Sun
With the rapid advances in digital imaging and communication technologies, recently image set classification has attracted significant attention and has been widely used in many real-world scenarios. As an effective technology, the class-specific representation theory-based methods have demonstrated their superior performances. However, this type of methods either only uses one gallery set to measure the gallery-to-probe set distance or ignores the inner connection between different metrics, leading to the learned distance metric lacking robustness, and is sensitive to the size of image sets. In this article, we propose a novel joint metric learning-based class-specific representation framework (JMLC), which can jointly learn the related and unrelated metrics. By iteratively modeling probe set and related or unrelated gallery sets as affine hull, we reconstruct this hull sparsely or collaboratively over another image set. With the obtained representation coefficients, the combined metric between the query set and the gallery set can then be calculated. In addition, we also derive the kernel extension of JMLC and propose two new unrelated set constituting strategies. Specifically, kernelized JMLC (KJMLC) embeds the gallery sets and probe sets into the high-dimensional Hilbert space, and in the kernel space, the data become approximately linear separable. Extensive experiments on seven benchmark databases show the superiority of the proposed methods to the state-of-the-art image set classifiers.

1 April 2020 in Pattern Recognition
Verified
Journal Article
Closed access
DWDong Wei
Dong Wei
XSXiaobo Shen
Xiaobo Shen
QSQuansen Sun
Quansen Sun
XGXizhan Gao
Xizhan Gao
WYWenzhu Yan
Wenzhu Yan

11 July 2022 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
THTianhao Han
Tianhao Han
SNSijie Niu
Sijie Niu
XGXizhan Gao
Xizhan Gao
WYWenyue Yu
Wenyue Yu
NCNa Cui
Na Cui
JDJiwen Dong
Jiwen Dong
Deep subspace clustering (DSC) has achieved considerable success in the classification task of hyperspectral images (HSIs) without background (defined as noisy samples) compared with traditional subspace clustering methods. Unfortunately, directly applying DSC to classify land-cover on HSI datasets with background may suffer from the degradation of classification performance. In this article, we propose an effective deep low-rank graph convolutional subspace clustering (DLR-GCSC) framework for improving the performance of land-cover classification on HSI datasets with background. Specifically, we design a joint spatial–spectral network to extract band- and patch-level features simultaneously by combining 1-D and 2-D autoencoders. Moreover, we construct a low-rank constrained fully connected layer as a self-expression layer in the network to make the joint features more discriminative. To reduce the influence of noisy samples and obtain an informative affinity matrix, we recast the joint features into a non-Euclidean domain by introducing graph convolution. Finally, spectral clustering is applied to the informative affinity matrix to obtain the classification results. Experiments on three benchmark HSI datasets show that our proposed method achieves competitive classification performance to the state-of-the-art methods on both HSI data with background and without background.