publications

2025

1. FlashGMM: Fast Gaussian Mixture Entropy Model for Learned Image Compression

   Shimon Murai, Fangzheng Lin, and Jiro Katto

   In IEEE International Conference on Visual Communications and Image Processing (VCIP), 2025
2. Evaluation of 2D Video Interpolation and Extrapolation Methods for Real-Time V-PCC Error Concealment

   Eiko Nakajima, Fangzheng Lin, Kasidis Arunruangsirilert, and 1 more author

   In IEEE International Conference on Visual Communications and Image Processing (VCIP), 2025
3. Teapot: Efficiently Uncovering Spectre Gadgets in COTS Binaries

   Fangzheng Lin, Zhongfa Wang, and Hiroshi Sasaki

   In ACM/IEEE International Symposium on Code Generation and Optimization (CGO), 2025

   Abs arXiv Code

   Speculative execution is crucial in enhancing modern processor performance but can introduce Spectre-type vulnerabilities that may leak sensitive information. Detecting Spectre gadgets from programs has been a research focus to enhance the analysis and understanding of Spectre attacks. However, one of the problems of existing approaches is that they rely on the presence of source code (or are impractical in terms of run-time performance and gadget detection ability). This paper presents Teapot, the first Spectre gadget scanner that works on COTS binaries with comparable performance to compiler-based alternatives. As its core principle, we introduce Speculation Shadows, a novel approach that separates the binary code for normal execution and speculation simulation in order to improve run-time efficiency. Teapot is based on static binary rewriting. It instruments the program to simulate the effects of speculative execution and also adds integrity checks to detect Spectre gadgets at run time. By leveraging fuzzing, Teapot succeeds in efficiently detecting Spectre gadgets. Evaluations show that Teapot outperforms both performance (more than 20x performant) and gadget detection ability than a previously proposed binary-based approach.

2024

1. Real-Time Video Prediction with Fast Video Interpolation Model and Prediction Training

   Shota Hirose, Kazuki Kotoyori, Kasidis Arunruangsirilert, and 3 more authors

   In IEEE International Conference on Image Processing (ICIP), 2024

2023

1. PTS-LIC: Pruning Threshold Searching for Lightweight Learned Image Compression

   Ao Luo, Heming Sun, Jinming Liu, and 2 more authors

   In IEEE International Conference on Visual Communications and Image Processing (VCIP), 2023
2. Recoil: Parallel rANS Decoding with Decoder-Adaptive Scalability

   Fangzheng Lin, Kasidis Arunruangsirilert, Heming Sun, and 1 more author

   In International Conference on Parallel Processing (ICPP), 2023

   Abs arXiv Code

   Entropy coding is essential to data compression, image and video coding, etc. The Range variant of Asymmetric Numeral Systems (rANS) is a modern entropy coder, featuring superior speed and compression rate. As rANS is not designed for parallel execution, the conventional approach to parallel rANS partitions the input symbol sequence and encodes partitions with independent codecs, and more partitions bring extra overhead. This approach is found in state-of-the-art implementations such as DietGPU. It is unsuitable for content-delivery applications, as the parallelism is wasted if the decoder cannot decode all the partitions in parallel, but all the overhead is still transferred. To solve this, we propose Recoil, a parallel rANS decoding approach with decoder-adaptive scalability. We discover that a single rANS-encoded bitstream can be decoded from any arbitrary position if the intermediate states are known. After renormalization, these states also have a smaller upper bound, which can be stored efficiently. We then split the encoded bitstream using a heuristic to evenly distribute the workload, and store the intermediate states and corresponding symbol indices as metadata. The splits can then be combined simply by eliminating extra metadata entries. The main contribution of Recoil is reducing unnecessary data transfer by adaptively scaling parallelism overhead to match the decoder capability. The experiments show that Recoil decoding throughput is comparable to the conventional approach, scaling massively on CPUs and GPUs and greatly outperforming various other ANS-based codecs.

3. Multistage Spatial Context Models for Learned Image Compression

   Fangzheng Lin, Heming Sun, Jinming Liu, and 1 more author

   In IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2023

   Abs arXiv Code

   Recent state-of-the-art Learned Image Compression methods feature spatial context models, achieving great rate-distortion improvements over hyperprior methods. However, the autoregressive context model requires serial decoding, limiting runtime performance. The Checkerboard context model allows parallel decoding at a cost of reduced RD performance. We present a series of multistage spatial context models allowing both fast decoding and better RD performance. We split the latent space into square patches and decode serially within each patch while different patches are decoded in parallel. The proposed method features a comparable decoding speed to Checkerboard while reaching the RD performance of Autoregressive and even also outperforming Autoregressive. Inside each patch, the decoding order must be carefully decided as a bad order negatively impacts performance; therefore, we also propose a decoding order optimization algorithm.

2022

1. F-LIC: FPGA-based Learned Image Compression with a Fine-grained Pipeline

   Heming Sun, Qingyang Yi, Fangzheng Lin, and 3 more authors

   In IEEE Asian Solid-State Circuits Conference (A-SSCC), 2022
2. Real-time Learned Image Codec on FPGA

   Heming Sun, Qingyang Yi, Fangzheng Lin, and 3 more authors

   In IEEE International Conference on Visual Communications and Image Processing (VCIP), 2022
3. Streaming-Capable High-Performance Architecture of Learned Image Compression Codecs

   Fangzheng Lin, Heming Sun, and Jiro Katto

   In IEEE International Conference on Image Processing (ICIP), 2022

   Abs arXiv Code

   Learned image compression allows achieving state-of-the-art accuracy and compression ratios, but their relatively slow runtime performance limits their usage. While previous attempts on optimizing learned image codecs focused more on the neural model and entropy coding, we present an alternative method to improving the runtime performance of various learned image compression models. We introduce multi-threaded pipelining and an optimized memory model to enable GPU and CPU workloads asynchronous execution, fully taking advantage of computational resources. Our architecture alone already produces excellent performance without any change to the neural model itself. We also demonstrate that combining our architecture with previous tweaks to the neural models can further improve runtime performance. We show that our implementations excel in throughput and latency compared to the baseline and demonstrate the performance of our implementations by creating a real-time video streaming encoder-decoder sample application, with the encoder running on an embedded device.