An Ultralow Complexity String Matching Approach to Screen Content Coding in AVS3
An Ultralow Complexity String Matching Approach to Screen Content Coding in AVS3
复制标题
AVS3 中屏幕内容编码的超低复杂度字符串匹配方法
DOI:
10.1109/tcsvt.2020.3029726
复制
发表时间:
2021-09
影响因子:
8.4
通讯作者:
Lin Tao
中科院分区:
文献类型:
--
作者:
Yang Yufen;Zhou Kailun;Zhao Liping;Lin Tao
Screen content coding (SCC) is increasingly used in mobile devices, and ultralow coding complexity is required for low power consumption. This article proposes an ultralow complexity string matching approach to SCC. The proposed approach has two essential features: 1) allowing only two types of most effective reference strings that have two most frequently occurring values of offset (i.e., displacement vector) named dual unity offset and 2) fully optimized coding of string matching parameters for maximum coding efficiency. Since at most only two offset values and corresponding reference string positions are allowed for any current string being coded, the optimal reference string searching process is extremely simple and only needs to select the best string from at most two candidates. Moreover, in the proposed approach, the value ranges of string matching parameters, i.e., the string offset vector and string length are very limited, resulting in few bits to code the two parameters and high coding efficiency. Compared with the AVS3 reference software HPM7.0 with IBC disabled, using AVS3 SCC common test condition and YUV test sequences in text and graphics with motion category, the proposed technique achieves Y average BD-rate reduction of 10.8% and 5.8% for all intra (AI) and low-delay B (LDB) configurations, respectively, at ultralow encoding and decoding complexity.