Qi Cai

Qi Cai

Auto-generated profile, based on publicly available information

Qi Cai

Department of Electrical and Computer Engineering, University of Florida, Gainesville, FL, USA

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2021 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
QCQi Cai
Qi Cai
ZCZhifeng Chen
Zhifeng Chen
DWDapeng Oliver Wu
Dapeng Oliver Wu
Shan LiuShan Liu
Shan Liu
XLXiang Li
Xiang Li
Occupying the most significant portion of global data traffic, video is being generated in almost every aspect of our life. Because of its huge volume, we are depending much more heavily on machine intelligence based analysis. In the meantime, video coding technology has been continuously improved for better compression efficiency. However, the state-of-the-art video coding standards, such as H.265/HEVC and versatile video coding (VVC), are still designed assuming that the compressed video will be watched by a human later. Such a design is not optimal when the compressed video will be used by computer vision applications. While the human visual system (HVS) is consistently sensitive to the content with high contrast, the impact of pixels on computer vision algorithms is task driven. For example, because of the different categories of objects used to train detection algorithms, the influence of the same image content on those detectors also varies. Therefore, human oriented video coding strategies may not be optimal when the compressed signal is further processed by algorithms, as the encoder is unaware of the task specific information. In this article, taking object detection as an example, we propose a novel video coding strategy for computer vision. By protecting the information according to its importance for an object detector rather than for the human visual system, our proposed method has the potential to achieve a better object detection performance with the same bandwidth. The main contributions of our paper are: 1) the modeling of the relationship between object detection accuracy and bit rate; 2) a back propagation based method to analyze the influence of each pixel on the detection of target objects; 3) an object detection oriented bit allocation and codec control parameter determination scheme; 4) an evaluation metric to compare the impact of video coding strategies on a given object detector over a predefined range of bit rate. Experimental results demonstrate that our proposed algorithm can better preserve the video content vital for object detection than state-of-the-art video coding schemes.

21 January 2019 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
BHBo Huang
Bo Huang
ZCZhifeng Chen
Zhifeng Chen
QCQi Cai
Qi Cai
MZMingkui Zheng
Mingkui Zheng
DWDapeng Oliver Wu
Dapeng Oliver Wu
The newest generation of video coding standard, high efficiency video coding (HEVC), significantly improves the video compression efficiency by introducing more flexible block partitioning structures and richer coding modes than those of previous coding standards; however, the encoders suffer from high computational complexity, which greatly hinders their extensive application. Extensive studies on optimizing the complexity of HEVC encoders have been conducted. However, most studies do not effectively achieve a trade-off between the rate-distortion (RD) performance loss and complexity during rate-distortion optimization (RDO). In this paper, we mathematically define the complexity-constrained RDO problem as a constrained optimization problem of subset selection. Next, based on the classification methodology, the derivation process for this optimization problem is simplified to finding the adaptive threshold function in the feature space with extremely low complexity. The proposed method is also highly general and is applicable to algorithm design for various coding mode decisions, such as coding unit (CU) splitting, prediction unit (PU) partitioning and transform unit (TU) tree decision, and the global optimum can be achieved. Compared with existing methods, the experimental results show that the proposed method can reduce the coding time by 2-16% with the same RD performance loss and can decrease the BD rate by 0.1-1.2% under the same complexity. In addition, this method is capable of flexibly adjusting the complexity under different RDC trade-off requirements.