Zhentao Lin

Dr. Zhentao Lin

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
16 February 2023 in Knowledge-Based Systems
Verified
Journal Article
Closed access
ZLZhentao Lin
Zhentao Lin
BZBi Zeng
Bi Zeng
HHHuiting Hu
Huiting Hu
YHYuting Huang
Yuting Huang
LXLinwen Xu
Linwen Xu
ZYZhuangze Yao
Zhuangze Yao

9 May 2026 in Computation
Verified
Journal Article
Open access
PDF file
ZCZihao Chen
Zihao Chen
ZLZhentao Lin
Zhentao Lin
BZBi Zeng
Bi Zeng
LHLinyi Huang
Linyi Huang
JCJia Cai
Jia Cai
To ensure the reliable operation of speech systems across diverse environments, noise addition methods have emerged as the standard solution. However, existing methods offer limited coverage of real-world scenes and depend on pre-existing noise libraries and scene metadata. This paper presents prompt-based Dynamic Generative Scene-based Noise Addition (DGSNA), a novel approach driven by generative language models that integrates Dynamic Generation of Scene-based Information (DGSI) with Scene-based Noise Addition for Speech (SNAS). The DGSI module, with a BET (Background, Examples, Task) prompt framework, dynamically generates logic-compliant scene-based information, including scene dimensions, sound sources, and microphone positions, thereby addressing the challenges of scene enumeration and detailed description. Complementing this, the SNAS module employs a Time–Frequency Diffusion-based (TFD) Text-to-Audio model to synthesize scene-specific noise. By integrating this noise with clean speech via Room Impulse Response (RIR) filters, the module streamlines the traditionally labor-intensive process of replicating diverse acoustic environments. Experimental results show that DGSNA significantly enhances the robustness of speech recognition and keyword spotting models, achieving relative improvements of up to 11.32%. Furthermore, DGSNA is highly compatible with existing noise addition techniques.

18 July 2026 in Pattern Recognition
Verified
Journal Article
Closed access
BZBi Zeng
Bi Zeng
SWSong Wen
Song Wen
QZQiaoxia Zhong
Qiaoxia Zhong
ZYZhuangkai Yao
Zhuangkai Yao
ZLZhentao Lin
Zhentao Lin

29 January 2026 in Digital Signal Processing
Verified
Journal Article
Closed access
ZLZhentao Lin
Zhentao Lin
BZBi Zeng
Bi Zeng
SWSong Wen
Song Wen
ZCZihao Chen
Zihao Chen
HHHuiting Hu
Huiting Hu

1 April 2026 in Computation
Verified
Journal Article
Open access
PDF file
ZSZhushun Su
Zhushun Su
BZBi Zeng
Bi Zeng
PWPengfei Wei
Pengfei Wei
KWKeyun Wang
Keyun Wang
ZLZhentao Lin
Zhentao Lin
With the continuous emergence of exam question types, accurate classification of knowledge points is crucial for intelligent exam analysis. Existing methods focus on text or text–image fusion but largely ignore spatial layout. To address this limitation, we propose a heterogeneous layout-aware cross-modal framework for knowledge point classification. The architecture begins with an encoding module where independent text and layout encoders extract semantic content and spatial configurations, respectively. We then design a layout-aware enhancing module consisting of two parallel cross-modal blocks, namely a Layout-Aware Text-Enhancing block and a Context-Aware Layout-Enhancing block. This module supports the bidirectional fusion of text and layout features and generates a comprehensive representation that integrates both semantic and spatial information. Furthermore, a dynamic router with top-k expert selection is introduced to dynamically adapt to question-specific knowledge distributions and focus on core knowledge points for precise classification. Experimental results demonstrate that our method effectively integrates text and layout information, significantly enhancing performance on the proposed QType-EDU dataset. The approach achieves 91.56% accuracy for coarse-grained classification and 80.58% for fine-grained classification, with an overall F1-score of 91.39%, surpassing all baseline models.