Name
Abstract | ||
|---|---|---|
In the current working draft of HEVC, residual quad-tree (RQT) coding is used to encode prediction residuals in both Intra and Inter coding units (CU). However, the rationale for using RQT as a coding tool is different in the two cases. For Intra prediction units, RQT provides an efficient syntax for coding a number of sub-blocks with the same intra prediction mode. For Inter CUs, RQT adapts to the spatial-frequency variations of the CU, using as large a transform size as possible while catering to local variations in residual statistics. While providing coding gains, effective use of RQT currently requires an exhaustive search of all possible combinations of transform sizes within a block. In this paper, we exploit our insights to develop two fast RQT algorithms, each designed to meet the needs of Intra and Inter prediction residual coding. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/MMSP.2011.6093805 | 2011 IEEE 13th International Workshop on Multimedia Signal Processing |
Keywords | Field | DocType |
video coding,HEVC,recursive quadtree,residual coding | Context-adaptive variable-length coding,Computer science,Coding (social sciences),Theoretical computer science,Artificial intelligence,Context-adaptive binary arithmetic coding,Residual,Pattern recognition,Brute-force search,Coding tree unit,Algorithm,Data compression,Quadtree | Conference |
ISSN | ISBN | Citations |
2163-3517 | 978-1-4577-1432-0 | 12 |
PageRank | References | Authors |
1.08 | 2 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yih Han Tan | 1 | 140 | 13.87 |
| Chuohao Yeo | 2 | 692 | 42.48 |
| Hui Li Tan | 3 | 76 | 7.42 |
| Z. Li | 4 | 1578 | 164.19 |