VCIP 2025 Video Coding Challenge

Ultra Low-Bitrate Video Compression Challenge

Focusing on innovative, perceptually-driven, low-latency video coding.
Tracks: 50kbps & 200kbps

About the Challenge

The VCIP 2025 Low-Bitrate Video Compression Challenge aims to advance video compression technology for extremely limited bandwidth scenarios, with a particular focus on ultra low-bitrates (50kbps and 200kbps) where existing methods suffer significant degradation in quality and efficiency. While mainstream streaming services operate at higher bitrates, real-world applications such as emergency command, disaster relief, and field rescue communications often face severe bandwidth restrictions, resulting in poor video quality. Traditional compression benchmarks have largely emphasized objective metrics at conventional bitrates, leaving a critical gap in research targeting ultra low-bitrate environments and perceptual quality assessment. To address this gap, the challenge emphasizes both extreme bitrate constraints and subjective visual quality evaluation, encouraging innovative AI-powered and perceptually optimized codecs for low-latency, bandwidth-constrained scenarios. The challenge further encourages the exploration of generative AI and foundational models, reflecting recent advances in video diffusions, text-to-video and video synthesis, to fundamentally improve compression efficiency and perceptual quality at ultra low bitrates.

Tracks & Requirements

50kbps Track (Low-bitrate)

  • Total decoding complexity:
    Average ≤ 1000 kMac/pixel
  • Total encoding complexity:
    Average ≤ 1500 kMac/pixel
  • Maximum decoding time (per frame):
    7000 ms

200kbps Track (High-bitrate)

  • Total decoding complexity:
    Average ≤ 50 kMac/pixel
  • Total encoding complexity:
    Average ≤ 75 kMac/pixel
  • Maximum decoding time (per frame):
    125 ms (approximately 8fps)

Note: All complexity constraints are evaluated based on the average computational cost per pixel for 720P resolution video. For each track, the encoding complexity is constrained to be no more than 1.5× the decoding complexity.

Test Dataset

The official challenge dataset consists of 720P video sequences (coming soon), primarily derived from HEVC-CTC datasets.
[Download link coming soon]

Important Dates

Evaluation Criteria

Awards & Sponsors

Organizers

Contact & Participation

For inquiries, please contact:
Prof. Guo Lu (luguo2014@sjtu.edu.cn)
Jing Wang (wangjing215@huawei.com)
Yunuo Chen (cyril-chenyn@sjtu.edu.cn)
Yibo Shi (shiyibo@huawei.com)
Yuxin Zhao (zhaoyuxin22@huawei.com)

Q & A

Q1 · How will PSNR be computed in this challenge?

The PSNR metric will be computed in the YUV420 domain. We will use a weighting scheme of 6 : 1 : 1 for the Y, U and V components, respectively (i.e., PSNRY : PSNRU : PSNRV = 6 : 1 : 1).

Q2 · Are there any constraints on the intra-period (GOP) configuration?

There is no official constraint on the intra-period for the challenge. Participants are free to choose any intra-period configuration, including open-GOP structures.