Block Merging for Quadtree-Based Partitioning in HEVC

Helle, Philipp; Oudin, Simon; Bross, Benjamin; Marpe, Detlev; Bici, M. Oguz; Uǧur, Kemal; Jung, Joël; Clare, Gordon; Wiegand, Thomas

doi:10.1109/tcsvt.2012.2223051

Cited by 154 publications

(65 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…2 for both the original algorithm and the proposed algorithm. The symmetric PUs, specifically the 2N × 2N, N × 2N, and 2N × N PUs [2,3], are processed for all CU sizes {8 × 8, 16 × 16, 32 × 32, 64 × 64} and corresponding depths {3, 2, 1, 0}. Once the CU depth is less than 3 or the size of that CU exceeds 8 × 8, asymmetric PU partitions are enabled for the IME.…”

Section: The Proposed Algorithmmentioning

confidence: 99%

“…The High-Efficiency Video Coding (HEVC) [1][2][3][4][5] standard, the latest video coding standard, is designed to replace the previous H.264/AVC standard owing to the fact that HEVC not only preserves the video compression quality of H.264/AVC but also reduces the bitrate by as much as 50%. However, this achievement results in a substantial increase of the encoding complexity or the encoding time.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A hardware-oriented concurrent TZ search algorithm for High-Efficiency Video Coding

Doan

Kim

Rhee

et al. 2017

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

High-Efficiency Video Coding (HEVC) is the latest video coding standard, in which the compression performance is double that of its predecessor, the H.264/AVC standard, while the video quality remains unchanged. In HEVC, the test zone (TZ) search algorithm is widely used for integer motion estimation because it effectively searches the good-quality motion vector with a relatively small amount of computation. However, the complex computation structure of the TZ search algorithm makes it difficult to implement it in the hardware. This paper proposes a new integer motion estimation algorithm which is designed for hardware execution by modifying the conventional TZ search to allow parallel motion estimations of all prediction unit (PU) partitions. The algorithm consists of the three phases of zonal, raster, and refinement searches. At the beginning of each phase, the algorithm obtains the search points required by the original TZ search for all PU partitions in a coding unit (CU). Then, all redundant search points are removed prior to the estimation of the motion costs, and the best search points are then selected for all PUs. Compared to the conventional TZ search algorithm, experimental results show that the proposed algorithm significantly decreases the Bjøntegaard Delta bitrate (BD-BR) by 0.84%, and it also reduces the computational complexity by 54.54%.

show abstract

Section: The Proposed Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A hardware-oriented concurrent TZ search algorithm for High-Efficiency Video Coding

Doan

Kim

Rhee

et al. 2017

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

show abstract

“…Each CTU can be recursively divided into four CUs with equal size, thus forming a coding quad-tree splitting structure [15]. The CUs size may range from 8x8 to 64x64 luma samples as configuration file defines.…”

Section: Depth Judgment Simplification For High Quality Reference Framementioning

confidence: 99%

An Simplified Reference Frame Selection Configuration Method

Kuang¹,

Deng

2016

IJMUE

View full text Add to dashboard Cite

show abstract

“…This can be explained by the increased overhead to encode the indices of atoms. Following the idea of the merge mode in HEVC [39], a coding mode that merges indices may help reduce the side information.…”

Section: ) Common Test Conditionsmentioning

confidence: 99%

Sparse/DCT (S/DCT) Two-Layered Representation of Prediction Residuals for Video Coding

Kang

Gabbouj

Kuo

2013

IEEE Trans. on Image Process.

View full text Add to dashboard Cite

Abstract-In this paper, we propose a cascaded sparse/DCT (S/DCT) two-layer representation of prediction residuals, and implement this idea on top of the state-of-the-art high efficiency video coding (HEVC) standard. First, a dictionary is adaptively trained to contain featured patterns of residual signals so that a high portion of energy in a structured residual can be efficiently coded via sparse coding. It is observed that the sparse representation alone is less effective in the R-D performance due to the side information overhead at higher bit rates. To overcome this problem, the DCT representation is cascaded at the second stage. It is applied to the remaining signal to improve coding efficiency. The two representations successfully complement each other. It is demonstrated by experimental results that the proposed algorithm outperforms the HEVC reference codec HM5.0 in the Common Test Condition.Index Terms-ρ domain rate model, discrete cosine transform (DCT), high efficiency video coding (HEVC), multilayered coding, overcomplete dictionary based video coding, residual coding, sparse representation.

show abstract

Block Merging for Quadtree-Based Partitioning in HEVC

Cited by 154 publications

References 15 publications

A hardware-oriented concurrent TZ search algorithm for High-Efficiency Video Coding

A hardware-oriented concurrent TZ search algorithm for High-Efficiency Video Coding

An Simplified Reference Frame Selection Configuration Method

Sparse/DCT (S/DCT) Two-Layered Representation of Prediction Residuals for Video Coding

Contact Info

Product

Resources

About