Guangchao Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Guangchao Yang has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Ruiyuan Li
College of Computer Science, Chongqing University, Chongqing, China
2 shared publications - Yu Zheng
Southwest Jiaotong University, Chengdu, Sichuan, China
2 shared publications - Abu Fatema Mohammad Abdun Noor
Daffodil International University
1 shared publication Bin Fang
College of Computer Science, Chongqing University, Chongqing 400030, P. R. China
1 shared publication- Chao Chen
College of Computer Science, Chongqing University, Chongqing, China
1 shared publication - Guanyao Li
Department of Computer Science, Beijing Normal-Hong Kong Baptist University, Zhuhai, China
1 shared publication
Latest Publications
- 28 January 2026
- Published by Springer Nature
- p. 494-507
GeGLUNet: Structural Retinal Vessel Segmentation via Attention-Gated GeGLU and Contrastive Supervision
- 28 January 2026
- Published by Springer Nature
- p. 494-507
GeGLUNet: Structural Retinal Vessel Segmentation via Attention-Gated GeGLU and Contrastive Supervision
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2556-2565
General Adaptive Memory Allocation for Learned Bloom Filters
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2556-2565
Open AccessGeneral Adaptive Memory Allocation for Learned Bloom Filters
- Open Access
- 17 June 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (3) , 1-27
Serf : Streaming Error-Bounded Floating-Point Compression
In IoT (Internet of Things) scenarios, massive floating-point time series data are generated in a streaming manner and transmitted within limited bandwidth for real-time analysis. To enhance the efficiency, it is acknowledged to compress the data before transmission. Existing floating-point compression methods are either for batched compression that may cause long delays, or for streaming lossless compression that has an unsatisfactory compression ratio when certain errors are allowed. In this paper, we propose the first Streaming ERror-bounded Floating-point compression Serf , which has two implementations: Serf-Qt and Serf-XOR . Serf-Qt first quantizes each floating-point value into an integer, and then encodes the integer with Elias gamma coding. Serf-XOR is the first lossy floating-point compression based on the XORing operation. To enhance the compression ratio of Serf-XOR , we propose a novel data offset technique to increase the leading zeros of the XORed values, and design a novel approximation technique to search for an error-qualified value that produces an XORed value with many trailing zeros. To improve the compression efficiency, we propose a pruning strategy to accelerate the process of approximated values search. We further build a streaming transmission prototype system based on a real development board, and deploy the proposed methods to it. Extensive experiments using 13 datasets show that, compared with 17 competitors, both Serf-Qt and Serf-XOR enjoy remarkable compression ratios with high efficiency in streaming scenarios. The transmission experiments based on the proposed system also showcase that Serf-XOR always takes the least overall time when the bandwidth is limited.
- 17 June 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (3) , 1-27
Open AccessSerf : Streaming Error-Bounded Floating-Point Compression
In IoT (Internet of Things) scenarios, massive floating-point time series data are generated in a streaming manner and transmitted within limited bandwidth for real-time analysis. To enhance the efficiency, it is acknowledged to compress the data before transmission. Existing floating-point compression methods are either for batched compression that may cause long delays, or for streaming lossless compression that has an unsatisfactory compression ratio when certain errors are allowed. In this paper, we propose the first Streaming ERror-bounded Floating-point compression Serf , which has two implementations: Serf-Qt and Serf-XOR . Serf-Qt first quantizes each floating-point value into an integer, and then encodes the integer with Elias gamma coding. Serf-XOR is the first lossy floating-point compression based on the XORing operation. To enhance the compression ratio of Serf-XOR , we propose a novel data offset technique to increase the leading zeros of the XORed values, and design a novel approximation technique to search for an error-qualified value that produces an XORed value with many trailing zeros. To improve the compression efficiency, we propose a pruning strategy to accelerate the process of approximated values search. We further build a streaming transmission prototype system based on a real development board, and deploy the proposed methods to it. Extensive experiments using 13 datasets show that, compared with 17 competitors, both Serf-Qt and Serf-XOR enjoy remarkable compression ratios with high efficiency in streaming scenarios. The transmission experiments based on the proposed system also showcase that Serf-XOR always takes the least overall time when the bandwidth is limited.
- 3 April 2024
- Published by World Scientific Pub Co Pte Ltd in Journal of Circuits, Systems and Computers
- Vol. 33 (14)
Deep Fusion Module for Video Action Recognition
In video action recognition, effective spatiotemporal modeling is crucial. However, traditional two-stream methods face challenges in integrating spatial information from RGB images and temporary information from optical flow without long-range temporal modelling. To address these limitations, we propose the Deep Fusion Module (DFM), which focuses on the deep fusion of spatial and temporal information and consists of two components. First, we propose an Attention Fusion Module (AFM) to effectively fuse the shallow features obtained from a two-stream network, thereby facilitating the integration of spatial and temporal information. Next, we incorporate a SpatioTemporal Module (STM), comprising a ConvGRU and a 1×1 convolution, to model long-range temporal dependency and fuse spatial-temporal features. Experiments on the UCF101 dataset show that our method achieves 96.5% accuracy, outperforming baseline two-stream models by 0.3%.
- 3 April 2024
- Published by World Scientific Pub Co Pte Ltd in Journal of Circuits, Systems and Computers
- Vol. 33 (14)
Deep Fusion Module for Video Action Recognition
In video action recognition, effective spatiotemporal modeling is crucial. However, traditional two-stream methods face challenges in integrating spatial information from RGB images and temporary information from optical flow without long-range temporal modelling. To address these limitations, we propose the Deep Fusion Module (DFM), which focuses on the deep fusion of spatial and temporal information and consists of two components. First, we propose an Attention Fusion Module (AFM) to effectively fuse the shallow features obtained from a two-stream network, thereby facilitating the integration of spatial and temporal information. Next, we incorporate a SpatioTemporal Module (STM), comprising a ConvGRU and a 1×1 convolution, to model long-range temporal dependency and fuse spatial-temporal features. Experiments on the UCF101 dataset show that our method achieves 96.5% accuracy, outperforming baseline two-stream models by 0.3%.
- 28 August 2017
- Published by World Scientific Pub Co Pte Ltd in International Journal of Wavelets, Multiresolution and Information Processing
- Vol. 15 (05)
Robust face recognition with multi-scale Weber local descriptor
This paper presents a simple and novel approach for robust face recognition. Extended multi-scale Weber local descriptor based on unfixed size patches is proposed to obtain micro and macro patterns. Then the recognition is performed using nearest neighborhood method based on Chi-square distance. Voting strategy is utilized in classification to reduce the impacts of the poor quality regions in face image caused by pose, illumination variations. Experiments on CMU-PIE, FERET and AR databases show that the proposed method has higher recognition accuracy in comparison with traditional methods.
- 28 August 2017
- Published by World Scientific Pub Co Pte Ltd in International Journal of Wavelets, Multiresolution and Information Processing
- Vol. 15 (05)
Robust face recognition with multi-scale Weber local descriptor
This paper presents a simple and novel approach for robust face recognition. Extended multi-scale Weber local descriptor based on unfixed size patches is proposed to obtain micro and macro patterns. Then the recognition is performed using nearest neighborhood method based on Chi-square distance. Voting strategy is utilized in classification to reduce the impacts of the poor quality regions in face image caused by pose, illumination variations. Experiments on CMU-PIE, FERET and AR databases show that the proposed method has higher recognition accuracy in comparison with traditional methods.