Xiaoxiang Liu

Xiaoxiang Liu


Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
21 May 2022 in Neural Networks
Verified
Journal Article
Closed access
YTYongqi Tian
Yongqi Tian
XGXueyuan Gong
Xueyuan Gong
JTJialin Tang
Jialin Tang
BSBinghua Su
Binghua Su
XLXiaoxiang Liu
Xiaoxiang Liu
XZXinyuan Zhang
Xinyuan Zhang

13 January 2025 in Agronomy
Verified
Journal Article
Open access
PDF file
CTChanglei Tian
Changlei Tian
ZLZhanchong Liu
Zhanchong Liu
HCHaosen Chen
Haosen Chen
董方董 方龙
董 方龙
XLXiaoxiang Liu
Xiaoxiang Liu
CLCong Lin
Cong Lin
Automated harvesting of “Sunshine Rose” grapes requires accurate detection and classification of grape clusters under challenging orchard conditions, such as occlusion and variable lighting, while ensuring that the model can be deployed on resource- and computation-constrained edge devices. This study addresses these challenges by proposing a lightweight YOLOv8-based model, incorporating DualConv and the novel C2f-GND module to enhance feature extraction and reduce computational complexity. Evaluated on the newly developed Shine-Muscat-Complex dataset of 4715 images, the proposed model achieved a 2.6% improvement in mean Average Precision (mAP) over YOLOv8n while reducing parameters by 36.8%, FLOPs by 34.1%, and inference time by 15%. Compared with the latest YOLOv11n, our model achieved a 3.3% improvement in mAP, with reductions of 26.4% in parameters, 14.3% in FLOPs, and 14.6% in inference time, demonstrating comprehensive enhancements. These results highlight the potential of our model for accurate and efficient deployment on resource-constrained edge devices, providing an algorithmic foundation for the automated harvesting of “Sunshine Rose” grapes.

14 September 2024 in Nanomaterials
Verified
Journal Article
Open access
PDF file
YOYajie Ouyang
Yajie Ouyang
TSTsinghua Shenzhen International Graduate School
Tsinghua Shenzhen International Graduate School
XLXiaoxiang Liu
Xiaoxiang Liu
The correlation between metasurface structures and their corresponding absorption spectra is inherently complex due to intricate physical interactions. Additionally, the reliance on Maxwell’s equations for simulating these relationships leads to extensive computational demands, significantly hindering rapid development in this area. Numerous researchers have employed artificial intelligence (AI) models to predict absorption spectra. However, these models often act as black boxes. Despite training high-performance models, it remains challenging to verify if they are fitting to rational patterns or merely guessing outcomes. To address these challenges, we introduce the Explainable Encoder–Prediction–Reconstruction (EEPR) framework, which separates the prediction process into feature extraction and spectra generation, facilitating a deeper understanding of the physical relationships between metasurface structures and spectra and unveiling the model’s operations at the feature level. Our model achieves a 66.23% reduction in average Mean Square Error (MSE), with an MSE of 2.843 × 10−4 compared to the average MSE of 8.421×10−4 for mainstream networks. Additionally, our model operates approximately 500,000 times faster than traditional simulations based on Maxwell’s equations, with a time of 3×10−3 seconds per sample, and demonstrates excellent generalization capabilities. By utilizing the EEPR framework, we achieve feature-level explainability and offer insights into the physical properties and their impact on metasurface structures, going beyond the pixel-level explanations provided by existing research. Additionally, we demonstrate the capability to adjust absorption by changing the metasurface at the feature level. These insights potentially empower designers to refine structures and enhance their trust in AI applications.

15 March 2022 in arXiv
Verified
Preprint
Open access
PDF file
YTYongqi Tian
Yongqi Tian
XGXueyuan Gong
Xueyuan Gong
JTJialin Tang
Jialin Tang
BSBinghua Su
Binghua Su
XLXiaoxiang Liu
Xiaoxiang Liu
XZXinyuan Zhang
Xinyuan Zhang
In recent years, with the rapid development of artificial intelligence, image generation based on deep learning has dramatically advanced. Image generation based on Generative Adversarial Networks (GANs) is a promising study. However, since convolutions are limited by spatial-agnostic and channel-specific, features extracted by traditional GANs based on convolution are constrained. Therefore, GANs are unable to capture any more details per image. On the other hand, straightforwardly stacking of convolutions causes too many parameters and layers in GANs, which will lead to a high risk of overfitting. To overcome the aforementioned limitations, in this paper, we propose a new GANs called Involution Generative Adversarial Networks (GIU-GANs). GIU-GANs leverages a brand new module called the Global Information Utilization (GIU) module, which integrates Squeeze-and-Excitation Networks (SENet) and involution to focus on global information by channel attention mechanism, leading to a higher quality of generated images. Meanwhile, Batch Normalization(BN) inevitably ignores the representation differences among noise sampled by the generator, and thus degrade the generated image quality. Thus we introduce Representative Batch Normalization(RBN) to the GANs architecture for this issue. The CIFAR-10 and CelebA datasets are employed to demonstrate the effectiveness of our proposed model. A large number of experiments prove that our model achieves state-of-the-art competitive performance.

8 March 2025 in arXiv
Verified
Preprint
Open access
PDF file
SZSi Zhou
Si Zhou
YSYain-Whar Si
Yain-Whar Si
XYXiaochen Yuan
Xiaochen Yuan
XLXiaofan Li
Xiaofan Li
XLXiaoxiang Liu
Xiaoxiang Liu
XGXueyuan Gong
Xueyuan Gong
In Neural Networks, there are various methods of feature fusion. Different strategies can significantly affect the effectiveness of feature representation, consequently influencing the ability of model to extract representative and discriminative features. In the field of face recognition, traditional feature fusion methods include feature concatenation and feature addition. Recently, various attention mechanism-based fusion strategies have emerged. However, we found that these methods primarily focus on the important features in the image, referred to as salient features in this paper, while neglecting another equally important set of features for image recognition tasks, which we term differential features. This may cause the model to overlook critical local differences when dealing with complex facial samples. Therefore, in this paper, we propose an efficient convolution module called MSConv (Multiplicative and Subtractive Convolution), designed to balance the learning of model about salient and differential features. Specifically, we employ multi-scale mixed convolution to capture both local and broader contextual information from face images, and then utilize Multiplication Operation (MO) and Subtraction Operation (SO) to extract salient and differential features, respectively. Experimental results demonstrate that by integrating both salient and differential features, MSConv outperforms models that only focus on salient features.

19 December 2023 in arXiv
Verified
Preprint
Open access
PDF file
JXJiamu Xu
Jiamu Xu
XLXiaoxiang Liu
Xiaoxiang Liu
XZXinyuan Zhang
Xinyuan Zhang
YSYain-Whar Si
Yain-Whar Si
XLXiaofan Li
Xiaofan Li
XGXueyuan Gong
Xueyuan Gong
Learning the discriminative features of different faces is an important task in face recognition. By extracting face features in neural networks, it becomes easy to measure the similarity of different face images, which makes face recognition possible. To enhance the neural network's face feature separability, incorporating an angular margin during training is common practice. State-of-the-art loss functions CosFace and ArcFace apply fixed margins between weights of classes to enhance the inter-class separation of face features. Since the distribution of samples in the training set is imbalanced, similarities between different identities are unequal. Therefore, using an inappropriately fixed angular margin may lead to the problem that the model is difficult to converge or the face features are not discriminative enough. It is more in line with our intuition that the margins are angular adaptive, which could increase with the angles between classes growing. In this paper, we propose a new angular margin loss named X2-Softmax. X2-Softmax loss has adaptive angular margins, which provide the margin that increases with the angle between different classes growing. The angular adaptive margin ensures model flexibility and effectively improves the effect of face recognition. We have trained the neural network with X2-Softmax loss on the MS1Mv3 dataset and tested it on several evaluation benchmarks to demonstrate the effectiveness and superiority of our loss function.