Fast Hash-Based Inter-Block Matching for Screen Content Coding
| Autor: | Wei Xiao, Bin Li, Feng Wu, Jizheng Xu, Guangming Shi |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Theoretical computer science
HAT-trie Computer science Hash function 020206 networking & telecommunications 02 engineering and technology Rolling hash Hash table Quadratic probing 0202 electrical engineering electronic engineering information engineering Media Technology 020201 artificial intelligence & image processing Electrical and Electronic Engineering Encoder Algorithm Perfect hash function Double hashing |
| Zdroj: | IEEE Transactions on Circuits and Systems for Video Technology. 28:1169-1182 |
| ISSN: | 1558-2205 1051-8215 |
| DOI: | 10.1109/tcsvt.2016.2643701 |
| Popis: | In the latest High Efficiency Video Coding (HEVC) development, i.e., HEVC screen content coding extensions (HEVC-SCC), a hash-based inter-motion search/block matching scheme is adopted in the reference test model, which brings significant coding gains to code screen content. However, the hash table generation itself may take up to half the encoding time and is thus too complex for practical usage. In this paper, we propose a hierarchical hash design and the corresponding block matching scheme to significantly reduce the complexity of hash-based block matching. The hierarchical structure in the proposed scheme allows large block calculation to use the results of small blocks. Thus, we avoid redundant computation among blocks with different sizes, which greatly reduces complexity without compromising coding efficiency. The experimental results show that compared with the hash-based block matching scheme in the HEVC-SCC test model (SCM)-6.0, the proposed scheme reduces about 77% of hash processing time, which leads to 12% and 16% encoding time savings in random access (RA) and low-delay B coding structures. The proposed scheme has been adopted into the latest SCM. A parallel implementation of the proposed hash table generation on graphics processing unit (GPU) is also presented to show the high parallelism of the proposed scheme, which achieves more than 30 frames/s for 1080p sequences and 60 frames/s for 720p sequences. With the fast hash-based block matching integrated into x265 and the hash table generated on GPU, the encoder can achieve 11.8% and 14.0% coding gains on average for RA and low-delay P coding structures, respectively, for real-time encoding. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|