A computation and energy reduction technique for HEVC intra mode decision

Özcan, Erdem; Kalalı, Ercan; Adibelli, Yusuf; Hamzaoğlu, İlker

doi:10.1109/tce.2014.7027351

Cited by 15 publications

(2 citation statements)

References 15 publications

(16 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…e 3D-HEVC depth map intraprediction exploits the previously coded block to remove the spatial redundancies [25,26] where each depth map PU is evaluated by rough mode decision [27]. In the rough mode decision, 35 modes including DC/Planar and 33 angular directions (see Figure 2 (top)) are performed based on the sum of absolute transformed difference (SATD) [28].…”

Section: D-hevc Depth Map Intraprediction Toolsmentioning

confidence: 99%

A Computation Complexity Reduction of the Size Decision Algorithm in 3D-HEVC Depth Map Intracoding

Hamout

Elyousfi

2022

Advances in Multimedia

View full text Add to dashboard Cite

A new video format called a multiview video plus depth map is recently designed as the most efficient 3D video representation. 3D-high efficiency video coding (3D-HEVC) is the international standard for 3D video coding finalized in 2016. In 3D-HEVC intracoding, the depth map is an essential component, in which the depth map intraprediction occupies more than 85% of the overall intraencoding time. In 3D-HEVC design, a highly flexible quadtree coding unit partitioning is adopted, in which one coding tree unit is partitioned recursively into a prediction unit (PU) from 64 × 64 down to 4 × 4. This highly flexible partitioning provides more accurate prediction signals and thereby achieves better intradepth map compression efficiency. However, performing all depth map intraprediction modes for each PU level achieves high depth map intracoding efficiency, but it results in a substantial computational complexity increase. This paper proposes an amelioration of the previously proposed depth map PU size decision using an efficient homogeneity determination. The resulting experiences show that the proposed method can significantly save the computational complexity with a negligible loss of intracoding efficiency.

show abstract

Section: D-hevc Depth Map Intraprediction Toolsmentioning

confidence: 99%

A Computation Complexity Reduction of the Size Decision Algorithm in 3D-HEVC Depth Map Intracoding

Hamout

Elyousfi

2022

Advances in Multimedia

View full text Add to dashboard Cite

show abstract

“…RMD의 첫 번째 단계에서는 SATD(Sum of Absolute Transformed Differences) [4] [6], sub-cbf를 이용한 방법 [7] , 제안된 방법과의 비교 실험 Table 3. Comparison Experiments of the method using only DCT coefficients distribution [6], the method using sub-cbf [7] , and the proposed method 되었으며, HEVC의 공통 실험조건 [8] 에 맞추어 실행하였다.…”

Section: Rmdunclassified

Fast Intra Coding using DCT Coefficients

Kim¹,

Kim²,

Lee

2015

Journal of Broadcast Engineering

View full text Add to dashboard Cite

The RDO (Rate Distortion Optimization) process of HEVC results in good coding efficiency, but relatively requires much encoding time. In order to reduce the encoding time of RDO process, this paper proposes a method of fast intra prediction mode decision using DCT coefficients distributions and the existence of DCT coefficients. The proposed fast Intra coding sets the number of intra prediction mode candidates to three(3) from the RMD (Rough Mode Decision) process in HM16.0 reference SW and reduces the number of candidates one more time by investigating DCT coefficients distribution. After that, if there exists a quantized DCT block having all zero coefficient values for a specific candidate before the RDO process, the candidate is chosen without the RDO process. The proposed method reduces the encoder complexity on average 46%, while the coding efficiency is 2.1% decreased compared with the HEVC encoder.

show abstract