Jiayao Xu
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
Jiayao Xu has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Dingquan Li
Department of Networked Intelligence, Pengcheng Laboratory, Shenzhen, China
1 shared publication - Fuma Kimishima
Graduate School of Science and Engineering, Hosei University, Koganei Campus, Tokyo 184-8584, Japan
1 shared publication - Ittetsu Taniguchi
The University of Osaka, Suita, Japan
1 shared publication - Jian Yang
Graduate School of Science and Engineering, Hosei University, Koganei, Japan
1 shared publication - Jinjia Zhou
Hosei University
1 shared publication - Wei Zhang
School of Computer Science and Technology, Harbin Institute of Technology, Shenzhen, China
1 shared publication
Latest Publications
- 21 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Geoscience and Remote Sensing Letters
- Vol. 22 (1545598X) , 1-5
Low-Overhead Compression-Aware Channel Filtering for Hyperspectral Image Compression
Both traditional and learning-based hyperspectral image compression methods suffer from significant quality loss at high compression ratios. To address this, we propose a low-overhead, compression-aware channel filtering method. The encoder derives channel filters via Least Squares Regression between lossy compressed and original images. The bitstream, containing the compressed image and filters, is sent to the decoder, where the filters enhance image quality. This simple, compression-aware approach is compatible with any existing framework, enhancing quality while introducing only a negligible increase in bitstream size and decoding time, thereby achieving low overhead. Experimental results show consistent rate-distortion gains, reducing compression rates by 10.51% to 39.81% on the GF-5 dataset with minimal decoding and storage overhead.
- 21 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Geoscience and Remote Sensing Letters
- Vol. 22 (1545598X) , 1-5
Low-Overhead Compression-Aware Channel Filtering for Hyperspectral Image Compression
Both traditional and learning-based hyperspectral image compression methods suffer from significant quality loss at high compression ratios. To address this, we propose a low-overhead, compression-aware channel filtering method. The encoder derives channel filters via Least Squares Regression between lossy compressed and original images. The bitstream, containing the compressed image and filters, is sent to the decoder, where the filters enhance image quality. This simple, compression-aware approach is compatible with any existing framework, enhancing quality while introducing only a negligible increase in bitstream size and decoding time, thereby achieving low overhead. Experimental results show consistent rate-distortion gains, reducing compression rates by 10.51% to 39.81% on the GF-5 dataset with minimal decoding and storage overhead.
- 26 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 26 (15209210) , 4871-4883
Compressive Sensing Based Image Codec With Partial Pre-Calculation
Compressive Sensing (CS) surpasses the limitations of the sampling theorem by reducing signal dimensions during sampling. Recent works integrate measurement coding into CS to enhance the compression ratio. However, these works significantly decrease image quality, and both encoding and decoding become time-consuming. This paper proposes a Compressive Sensing based Image Codec with Partial Pre-calculation (CSCP) to solve these issues. The CSCP separates the original reconstruction procedure into two parts: reconstructing the frequency domain data and the inverse calculation. Depending on the feature of the chosen deterministic sensing matrix, the complex reconstruction procedure is reduced to twice matrix-based multiplications, resulting in a low time cost. Moreover, we can further optimize the reconstruction process by moving the frequency domain data reconstruction to the encoder, referred to as the partial pre-calculation process. Then compressing the sparse data in the frequency domain. This approach has two main benefits: 1) it reduces the complexity of the decoder, and 2) it results in less degradation in quality compared to existing measurement coding methods. Additionally, this work proposes the One-Row-Two-Tables strategy for defining Huffman Coding units. This approach leverages the quantized data distribution to improve compression efficiency while maintaining low complexity. In the decoder, the sequence of operations includes Huffman decoding, dequantization, and inverse calculation. Compared to the state-of-the-art, this work decreases 22.61 $\%$ bpp with 17.72 $\%$ increased quality. Meanwhile, time speeds up to 649.13× on the encoder, 11.03× on the decoder, and 288.46× in total.
- 26 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 26 (15209210) , 4871-4883
Compressive Sensing Based Image Codec With Partial Pre-Calculation
Compressive Sensing (CS) surpasses the limitations of the sampling theorem by reducing signal dimensions during sampling. Recent works integrate measurement coding into CS to enhance the compression ratio. However, these works significantly decrease image quality, and both encoding and decoding become time-consuming. This paper proposes a Compressive Sensing based Image Codec with Partial Pre-calculation (CSCP) to solve these issues. The CSCP separates the original reconstruction procedure into two parts: reconstructing the frequency domain data and the inverse calculation. Depending on the feature of the chosen deterministic sensing matrix, the complex reconstruction procedure is reduced to twice matrix-based multiplications, resulting in a low time cost. Moreover, we can further optimize the reconstruction process by moving the frequency domain data reconstruction to the encoder, referred to as the partial pre-calculation process. Then compressing the sparse data in the frequency domain. This approach has two main benefits: 1) it reduces the complexity of the decoder, and 2) it results in less degradation in quality compared to existing measurement coding methods. Additionally, this work proposes the One-Row-Two-Tables strategy for defining Huffman Coding units. This approach leverages the quantized data distribution to improve compression efficiency while maintaining low complexity. In the decoder, the sequence of operations includes Huffman decoding, dequantization, and inverse calculation. Compared to the state-of-the-art, this work decreases 22.61 $\%$ bpp with 17.72 $\%$ increased quality. Meanwhile, time speeds up to 649.13× on the encoder, 11.03× on the decoder, and 288.46× in total.