Guanlin Chen

Guanlin Chen

Auto-generated profile, based on publicly available information

Guanlin Chen

School of Computer and Computing Science, Hangzhou City University, Hangzhou 310015, P. R. China

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
10 December 2023
Verified
Conference Paper
Open access
ZZZhihua Zhong
Zhihua Zhong
JZJingsen Zhu
Jingsen Zhu
YDYuxin Dai
Yuxin Dai
CZChuankun Zheng
Chuankun Zheng
GCGuanlin Chen
Guanlin Chen
RWRui Wang
Rui Wang
The workload of real-time rendering is steeply increasing as the demand for high resolution, high refresh rates, and high realism rises, overwhelming most graphics cards. To mitigate this problem, one of the most popular solutions is to render images at a low resolution to reduce rendering overhead, and then manage to accurately upsample the low-resolution rendered image to the target resolution, a.k.a. super-resolution techniques. Most existing methods focus on exploiting information from low-resolution inputs, such as historical frames. The absence of high frequency details in those LR inputs makes them hard to recover fine details in their high-resolution predictions. In this paper, we propose an efficient and effective super-resolution method that predicts high-quality upsampled reconstructions utilizing low-cost high-resolution auxiliary G-Buffers as additional input. With LR images and HR G-buffers as input, the network requires to align and fuse features at multi resolution levels. We introduce an efficient and effective H-Net architecture to solve this problem and significantly reduce rendering overhead without noticeable quality deterioration. Experiments show that our method is able to produce temporally consistent reconstructions in 4 × 4 and even challenging 8 × 8 upsampling cases at 4K resolution with real-time performance, with substantially improved quality and significant performance boost compared to existing works.Project page: https://isaac-paradox.github.io/FuseSR/

22 May 2025 in ACM Transactions on Spatial Algorithms and Systems
Verified
Journal Article
Open access
HCHongyang Chen
Hongyang Chen
SZSheng Zhang
Sheng Zhang
JXJiajia Xie
Jiajia Xie
HLHan Liu
Han Liu
GCGuanlin Chen
Guanlin Chen
Smart cities leverage advancements in big data and artificial intelligence to deliver a multitude of services and information to urban people. Among these services, predicting on-street parking availability is an important application with the potential to enhance parking efficiency, alleviate city congestion, and minimize pollution. Existing methods for forecasting parking occupancy rates mostly rely on recurrent neural networks (RNNs) to capture temporal dimension information from parking time series data. However, these methods typically overlook the crucial spatial dependency among parking areas, resulting in suboptimal prediction accuracy. Furthermore, the computationally intensive nature of RNN-based methods leads to slow prediction speeds. To address these limitations, we propose Multi-view Spatial-temporal Graph Convolutional Networks (MV-STGCN) to predict parking occupancy rates. By integrating spatial and temporal features, MV-STGCN is able to capture complex spatial-temporal correlations and improve prediction accuracy while optimizing prediction speed. The proposed MV-STGCN incorporates a multi-view contrastive Graph Convolution module (mvc-GConv), which employs a multi-view contrast method to extract features from topology and feature spaces with commonalities and differences in a multi-view way. Experimental results based on real-world datasets demonstrate that MV-STGCN outperforms baselines in predicting long-term parking occupancy rates while achieving superior prediction speed.


29 July 2026 in SSRN Electronic Journal
Verified
Preprint
Open access
YXYuyang Xu
Yuyang Xu
JWJunlin Wang
Junlin Wang
LZLeyi Zhao
Leyi Zhao
GCGuanlin Chen
Guanlin Chen
The intelligent management of hazardous chemicals inherently relies on high-fidelity, structured safety knowledge. However, the vast majority of this critical information remains trapped in highly unstructured, complex regulatory documents, notably Material Safety Data Sheets. Extracting actionable knowledge from these fragmented tables and verbose technical texts poses a formidable challenge. Traditional rule-based natural language processing pipelines are excessively brittle, whereas employing monolithic large language models invariably introduces fatal factual hallucinations in zero-tolerance safety scenarios. To overcome these critical bottlenecks, we propose the Multi-Agent Knowledge Extraction and Reasoning (MAKER) framework, an automated, industrial-grade solution. MAKER systematically decomposes the complex extraction pipeline into granular, specialized tasks through a stateful multi-agent paradigm. It seamlessly integrates the deterministic precision of regular expressions with the contextual reasoning of a specialized agent society-comprising extractors, normalizers, critics, and linkers. Through a continuous evaluate-feedback-refine loop, the system eliminates error cascading and ensures strict schema compliance. Using this interactive framework, we constructed one of the most comprehensive multimodal knowledge graphs for hazardous chemicals to date, encompassing 2,380 core entities, over 31,000 nodes, and 108,000 relations. To definitively demonstrate its industrial value, we integrated this highdensity graph as a structural prior into KGC-CLIP, a vision-language pre-training model for emergency chemical identification. Rigorous downstream evaluations in a critical visual retrieval task reveal that without the MAKER-constructed graph, the visual model completely fails due to visual ambiguity, yielding a near-zero top-1 recall of 0.22%. Conversely, incorporating the graph propels the model's performance to a substantial accuracy of 62.86%. These results conclusively demonstrate that MAKER provides the indispensable spatial skeleton required for robust multimodal AI applications in high-stakes scientific domains.

13 May 2026 in International Journal of Pattern Recognition and Artificial Intelligence
Verified
Journal Article
Closed access
GCGuanlin Chen
Guanlin Chen
LZLeyi Zhao
Leyi Zhao
WWWenyong Weng
Wenyong Weng
WYWujian Yang
Wujian Yang