Yangang Cai
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yangang Cai has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Jingyuan Tang
The School of Information and Communication Engineering, Beijing University of Posts and Telecommunications (BUPT) & Key Laboratory of Trustworthy Distributed Computing and Service (BUPT), Ministry of Education, Beijing, China
1 shared publication - Peiyin Xing
School of Electronics Engineering and Computer Science, Peking University, Beijing, China
1 shared publication Ronggang Wang
School of Electronic and Computer Engineering, Peking University Shenzhen Graduate School, Shenzhen, China
1 shared publication- Ronggang Wang
Guangdong Provincial Key Laboratory of Ultra High Definition Immersive Media Technology, Shenzhen Graduate School, Peking University, Shenzhen, China
1 shared publication - Songlin Sun
Beijing University of Posts and Telecommunications
1 shared publication - Weiqiang Chen
Shenzhen Graduate School, Peking University, Shenzhen, China
1 shared publication
Latest Publications
- 1 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 33 (10709908) , 1816-1820
Stream-Based Compression of Mass Spectrometry Signal via Spectral Access Units and Magnitude-Stratified Predictive Coding
High-throughput mass spectrometry generates massive non-stationary 1D signals, posing challenges to storage efficiency and interactive retrieval. Current monolithic compression schemes impose random access barriers, hindering parallel processing. To address this, this paper proposes a stream-based compression framework governed by a Spectral Access Unit (SAU) architecture, which encapsulates signal segments into self-contained packets for $O(1)$ retrieval and robust error containment. At the algorithmic level, we introduce Magnitude-Stratified Predictive Coding (MSPC), which extracts global Most Probable Modes (MPMs) at specific magnitude strata as prediction priors. By applying Gray-mapped Boolean masking between significant digits and their MPMs, MSPC leverages the adjacency of Gray-code space to transform minor numerical deviations into highly sparse, zero-centric residuals. Coupled with an Original Domain-Based Logarithmic Binary Arithmetic Coding (ODB-LBAC) engine, this effectively eliminates structural redundancies. Experimental results demonstrate that the proposed PMSDC achieves superior compression performance and accelerated encoding throughput compared to established general-purpose and domain-specific baselines, all while strictly preserving high signal fidelity for downstream analytics. The proposed PMSDC has been adopted by the Audio Video Coding Standard Workgroup of China (AVS) as the standard for mass spectrometry data compression.
- 1 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 33 (10709908) , 1816-1820
Stream-Based Compression of Mass Spectrometry Signal via Spectral Access Units and Magnitude-Stratified Predictive Coding
High-throughput mass spectrometry generates massive non-stationary 1D signals, posing challenges to storage efficiency and interactive retrieval. Current monolithic compression schemes impose random access barriers, hindering parallel processing. To address this, this paper proposes a stream-based compression framework governed by a Spectral Access Unit (SAU) architecture, which encapsulates signal segments into self-contained packets for $O(1)$ retrieval and robust error containment. At the algorithmic level, we introduce Magnitude-Stratified Predictive Coding (MSPC), which extracts global Most Probable Modes (MPMs) at specific magnitude strata as prediction priors. By applying Gray-mapped Boolean masking between significant digits and their MPMs, MSPC leverages the adjacency of Gray-code space to transform minor numerical deviations into highly sparse, zero-centric residuals. Coupled with an Original Domain-Based Logarithmic Binary Arithmetic Coding (ODB-LBAC) engine, this effectively eliminates structural redundancies. Experimental results demonstrate that the proposed PMSDC achieves superior compression performance and accelerated encoding throughput compared to established general-purpose and domain-specific baselines, all while strictly preserving high signal fidelity for downstream analytics. The proposed PMSDC has been adopted by the Audio Video Coding Standard Workgroup of China (AVS) as the standard for mass spectrometry data compression.
- Open Access
- 28 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 11222-11225
Generalized Sampling of Non-Local Textural Clues Multi-View Stereo Framework
3D reconstruction remains a pivotal topic in contemporary multimedia research, with multi-view stereo (MVS) methods being instrumental. Traditional MVS algorithms, have demonstrated robust performance in large-scale scenes. However, these methods often struggle with depth estimation in non-textured regions, resulting in inconsistencies across different areas of the reconstructed 3D model. This paper introduces a novel MVS framework, General Sampling Non-local Texture Features (GST-MVS), designed to enhance depth estimation by leveraging the intrinsic relationship between image texture and object depth. Our approach optimizes the 3D reconstruction process, yielding superior results, especially in low-textured regions. Comprehensive evaluations on the ETH3D dataset indicate that GST-MVS achieves dense and accurate 3D point cloud reconstructions, outperforming existing MVS algorithms. The GST-MVS framework is open-source and accessible on GitHub at https://github.com/Jasmine-tjy/GST-mvs. Additionally, Docker image facilitating the required execution environment, which is available at https://hub.docker.com/r/tangjas111/cmake_cuda_opencv/tags.
- 28 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 11222-11225
Open AccessGeneralized Sampling of Non-Local Textural Clues Multi-View Stereo Framework
3D reconstruction remains a pivotal topic in contemporary multimedia research, with multi-view stereo (MVS) methods being instrumental. Traditional MVS algorithms, have demonstrated robust performance in large-scale scenes. However, these methods often struggle with depth estimation in non-textured regions, resulting in inconsistencies across different areas of the reconstructed 3D model. This paper introduces a novel MVS framework, General Sampling Non-local Texture Features (GST-MVS), designed to enhance depth estimation by leveraging the intrinsic relationship between image texture and object depth. Our approach optimizes the 3D reconstruction process, yielding superior results, especially in low-textured regions. Comprehensive evaluations on the ETH3D dataset indicate that GST-MVS achieves dense and accurate 3D point cloud reconstructions, outperforming existing MVS algorithms. The GST-MVS framework is open-source and accessible on GitHub at https://github.com/Jasmine-tjy/GST-mvs. Additionally, Docker image facilitating the required execution environment, which is available at https://hub.docker.com/r/tangjas111/cmake_cuda_opencv/tags.
- 22 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 35 (4) , 3732-3744
High Efficient 3D Convolution Feature Compression
In this paper, a high efficient 3D convolution feature compression method is proposed. This method is mainly used to compress the three-dimensional convolution deep features extracted by video analysis. Gather the compressed features to the cloud server instead of all video features. This method can solve the problem that the data aggregation of video big data analysis requires a large amount of network bandwidth. Quantization is a common method for feature compression, but the existing quantization-based methods often carry out model training and quantization in stages, which makes the robustness of quantization results poor. To solve this problem, the method proposed in this paper is to apply the feature quantization operation directly to the network and train it with the analysis task, and use the parameter iterative optimization method to solve the non-differentiable problem of quantization operation. Different from the deep features extracted from images or single objects, the 3D convolution features extracted from video clips have high time-domain redundancy. In this paper, by serializing the three-dimensional convolution features, the time-domain prediction coding method is used to remove the time-domain redundancy of the three-dimensional convolution features, to improve the feature compression ratio. The experimental results show that this method can only use 1 bit to represent the elements in the three-dimensional convolution deep feature. When the analysis accuracy loss is no more than 1%, the feature compression ratio can reach 4500 times compared with the original feature data, and the data transmission can be reduced by 96%.
- 22 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 35 (4) , 3732-3744
High Efficient 3D Convolution Feature Compression
In this paper, a high efficient 3D convolution feature compression method is proposed. This method is mainly used to compress the three-dimensional convolution deep features extracted by video analysis. Gather the compressed features to the cloud server instead of all video features. This method can solve the problem that the data aggregation of video big data analysis requires a large amount of network bandwidth. Quantization is a common method for feature compression, but the existing quantization-based methods often carry out model training and quantization in stages, which makes the robustness of quantization results poor. To solve this problem, the method proposed in this paper is to apply the feature quantization operation directly to the network and train it with the analysis task, and use the parameter iterative optimization method to solve the non-differentiable problem of quantization operation. Different from the deep features extracted from images or single objects, the 3D convolution features extracted from video clips have high time-domain redundancy. In this paper, by serializing the three-dimensional convolution features, the time-domain prediction coding method is used to remove the time-domain redundancy of the three-dimensional convolution features, to improve the feature compression ratio. The experimental results show that this method can only use 1 bit to represent the elements in the three-dimensional convolution deep feature. When the analysis accuracy loss is no more than 1%, the feature compression ratio can reach 4500 times compared with the original feature data, and the data transmission can be reduced by 96%.
- 2 June 2022
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 81 (25) , 35875-35898
Towards 6DoF live video streaming system for immersive media
- 2 June 2022
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 81 (25) , 35875-35898
Towards 6DoF live video streaming system for immersive media
- 8 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 32 (9) , 6400-6413
An Overview of Panoramic Video Projection Schemes in the IEEE 1857.9 Standard for Immersive Visual Content Coding
Panoramic video contains 360-degree video content and it is convenient to draw the content that the user wants to watch on the head-Mount display (HMD) of the virtual reality display device. However, few encoders code panoramic video directly. Panoramic video content needs to be projected to a compression-friendly rectangular plane first. Then the existing video coding standards such as AVC, HEVC, VVC, AVS are used to code the panoramic video content. In order to improve the panoramic video coding efficiency, IEEE 1857.9 immersive video content coding working group was established to develop efficient immersive video projection and coding methods. This paper presents an overview of the panoramic video projection schemes in Immersive Visual Content Coding Standard IEEE 1857.9.
- 8 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 32 (9) , 6400-6413
An Overview of Panoramic Video Projection Schemes in the IEEE 1857.9 Standard for Immersive Visual Content Coding
Panoramic video contains 360-degree video content and it is convenient to draw the content that the user wants to watch on the head-Mount display (HMD) of the virtual reality display device. However, few encoders code panoramic video directly. Panoramic video content needs to be projected to a compression-friendly rectangular plane first. Then the existing video coding standards such as AVC, HEVC, VVC, AVS are used to code the panoramic video content. In order to improve the panoramic video coding efficiency, IEEE 1857.9 immersive video content coding working group was established to develop efficient immersive video projection and coding methods. This paper presents an overview of the panoramic video projection schemes in Immersive Visual Content Coding Standard IEEE 1857.9.