• Title/Summary/Keyword: depth of CU

Search Result 254, Processing Time 0.019 seconds

Complexity Reduction Method Using Inter-layer CU Depth Information for Scalable Video Coding Base on HEVC (계층 간 CU 깊이 예측을 이용한 HEVC SVC 고속 부호화 방법)

  • Jang, Hyeong-Moon;Nam, Jung-Hak;Sim, Dong-Gyu
    • Journal of Broadcast Engineering
    • /
    • v.17 no.5
    • /
    • pp.765-780
    • /
    • 2012
  • In this paper, we propose a fast mode decision method that determines the coding unit depth for enhancement layers to improve an encoding speed of a scalable video encoder based on HEVC. To decide the coding unit depth of the enhancement layer, firstly, the coding unit depth of the corresponded coding unit in the basement layer is employed. At this stage, the final CU depth is decided by calculating the rate-distortion costs of one lower depth to one upper depth of the referenced depth. The proposed method can reduce a computational load since it does not calculate the rate-distortion costs for all the depths of a target CU. We found that the proposed algorithm decreases encoding complexity of 26% with approximately 1.4% bit increment, compared with the simulcast encoder of the HM 4.0.

Keypoint-based Fast CU Depth Decision for HEVC Intra Coding (HEVC 인트라 부호화를 위한 특징점 기반의 고속 CU Depth 결정)

  • Kim, Namuk;Lim, Sung-Chang;Ko, Hyunsuk;Jeon, Byeungwoo
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.2
    • /
    • pp.89-96
    • /
    • 2016
  • The High Efficiency Video Coding (MPEG-H HEVC/ITU-T H.265) is the newest video coding standard which has the quadtree-structured coding unit (CU). The quadtree-structure splits a CU adaptively, and its optimum CU depth can be determined by rate-distortion optimization. Such HEVC encoding requires very high computational complexity for CU depth decision. Motivated that the blob detection, which is a well-known algorithm in computer vision, detects keypoints in pictures and decision of CU depth needs to consider high frequency energy distribution, in this paper, we propose to utilize these keypoints for fast CU depth decision. Experimental results show that 20% encoding time can be saved with only slightly increasing BDBR by 0.45% on all intra case.

Bayesian-theory-based Fast CU Size and Mode Decision Algorithm for 3D-HEVC Depth Video Inter-coding

  • Chen, Fen;Liu, Sheng;Peng, Zongju;Hu, Qingqing;Jiang, Gangyi;Yu, Mei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.4
    • /
    • pp.1730-1747
    • /
    • 2018
  • Multi-view video plus depth (MVD) is a mainstream format of 3D scene representation in free viewpoint video systems. The advanced 3D extension of the high efficiency video coding (3D-HEVC) standard introduces new prediction tools to improve the coding performance of depth video. However, the depth video in 3D-HEVC is time consuming. To reduce the complexity of the depth video inter coding, we propose a fast coding unit (CU) size and mode decision algorithm. First, an off-line trained Bayesian model is built which the feature vector contains the depth levels of the corresponding spatial, temporal, and inter-component (texture-depth) neighboring largest CUs (LCUs). Then, the model is used to predict the depth level of the current LCU, and terminate the CU recursive splitting process. Finally, the CU mode search process is early terminated by making use of the mode correlation of spatial, inter-component (texture-depth), and inter-view neighboring CUs. Compared to the 3D-HEVC reference software HTM-10.0, the proposed algorithm reduces the encoding time of depth video and the total encoding time by 65.03% and 41.04% on average, respectively, with negligible quality degradation of the synthesized virtual view.

An analytical Study on the Influence length of SCP Method (측방이동 대책공법(SCP)의 영향범위 산정에 관한 해석적 연구)

  • Lee, Young-Keun;Park, Chun-Sik;Kim, Jong-Hwan
    • Proceedings of the Korean Geotechical Society Conference
    • /
    • 2010.09b
    • /
    • pp.152-160
    • /
    • 2010
  • In this study, cohesion of soft ground, soft ground depth and embankment height varying conditions, such as the impact of each condition after the calculation of the range, SCP was performed to evaluate the applicability of the method. Reinforcing effects of scope, and permit lateral movement of SCP 2D and 3D analysis of the program were calculated by the displacement ratio, the result follows. The height and depth of soft soil embankment with increasing and decreasing the cohesion tends to be affected were long range, SCP method applied by the finite element analysis Cu = 1.0tf/$m^2$, embankment height is 3.0m depth of soft soil can be applied in a less than 5.0m, and Cu = 3.0tf/$m^2$, embankment height, the soft soil depth is 3.0m 12.0m, Cu = 3.0tf/$m^2$, embankment height is 5.0m less than 7.0m depth of soft soil can be applied in was. And Cu = 5.0tf/$m^2$, embankment height is 3.0m below 15.0m depth rouge anti Floor, Cu = 3.0tf/$m^2$, embankment height of 5.0m 12.0m depth below the soft soil, Cu = 5.0tf/$m^2$, If the depth of soft soil embankment height of 7.0m and below 5.0m was applicable.

  • PDF

Fast PU Decision Method Using Coding Information of Co-Located Sub-CU in Upper Depth for HEVC (상위깊이의 Sub-CU 부호화 정보를 이용한 HEVC의 고속 PU 결정 기법)

  • Jang, Jae-Kyu;Choi, Ho-Youl;Kim, Jae-Gon
    • Journal of Broadcast Engineering
    • /
    • v.20 no.2
    • /
    • pp.340-347
    • /
    • 2015
  • HEVC (High Efficiency Video Coding) achieves high coding efficiency by employing a quadtree-based coding unit (CU) block partitioning structure and various prediction units (PUs), and the determination of the best CU partition structure and the best PU mode based on rate-distortion (R-D) cost. However, the computation complexity of encoding also dramatically increases. In this paper, to reduce such encoding computational complexity, we propose three fast PU mode decision methods based on encoding information of upper depth as follows. In the first method, the search of PU mode of the current CU is early terminated based on the sub-CBF (Coded Block Flag) of upper depth. In the second method, the search of intra prediction modes of PU in the current CU is skipped based on the sub-Intra R-D cost of upper depth. In the last method, the search of intra prediction modes of PU in the lower depth's CUs is skipped based on the sub-CBF of the current depth's CU. Experimental results show that the three proposed methods reduce the computational complexity of HM 14.0 to 31.4%, 2.5%, and 23.4% with BD-rate increase of 1.2%, 0.11%, and 0.9%, respectively. The three methods can be applied in a combined way to be applied to both of inter prediction and intra prediction, which results in the complexity reduction of 34.2% with 1.9% BD-rate increase.

A Fast Inter-prediction Mode Decision Algorithm for HEVC Based on Spatial-Temporal Correlation

  • Yao, Weixin;Yang, Dan
    • Journal of Information Processing Systems
    • /
    • v.18 no.2
    • /
    • pp.235-244
    • /
    • 2022
  • Many new techniques have been adopted in HEVC (High efficiency video coding) standard, such as quadtree-structured coding unit (CU), prediction unit (PU) partition, 35 intra-mode, and so on. To reduce computational complexity, the paper proposes two optimization algorithms which include fast CU depth range decision and fast PU partition mode decision. Firstly, depth range of CU is predicted according to spatial-temporal correlation. Secondly, we utilize the depth difference between the current CU and CU corresponding to the same position of adjacent frame for PU mode range selection. The number of traversal candidate modes is reduced. The experiment result shows the proposed algorithm obtains a lot of time reducing, and the loss of coding efficiency is inappreciable.

HEVC Encoder Optimization using Depth Information (깊이정보를 이용한 HEVC의 인코더 고속화 방법)

  • Lee, Yoon Jin;Bae, Dong In;Park, Gwang Hoon
    • Journal of Broadcast Engineering
    • /
    • v.19 no.5
    • /
    • pp.640-655
    • /
    • 2014
  • Many of today's video systems have additional depth camera to provide extra features such as 3D support. Thanks to these changes made in multimedia system, it is now much easier to obtain depth information of the video. Depth information can be used in various areas such as object classification, background area recognition, and so on. With depth information, we can achieve even higher coding efficiency compared to only using conventional method. Thus, in this paper, we propose the 2D video coding algorithm which uses depth information on top of the next generation 2D video codec HEVC. Background area can be recognized with depth information and by performing HEVC with it, coding complexity can be reduced. If current CU is background area, we propose the following three methods, 1) Earlier stop split structure of CU with PU SKIP mode, 2) Limiting split structure of CU with CU information in temporal position, 3) Limiting the range of motion searching. We implement our proposal using HEVC HM 12.0 reference software. With these methods results shows that encoding complexity is reduced more than 40% with only 0.5% BD-Bitrate loss. Especially, in case of video acquired through the Kinect developed by Microsoft Corp., encoding complexity is reduced by max 53% without a loss of quality. So, it is expected that these techniques can apply real-time online communication, mobile or handheld video service and so on.

An Early Termination Algorithm of Prediction Unit (PU) Search for Fast HEVC Encoding (HEVC 고속 부호화를 위한 PU 탐색 조기 종료 기법)

  • Kim, Jae-Wook;Kim, Dong-Hyun;Kim, Jae-Gon
    • Journal of Broadcast Engineering
    • /
    • v.19 no.5
    • /
    • pp.627-630
    • /
    • 2014
  • The latest video coding standard, high efficiency video coding (HEVC) achieves high coding efficiency by employing a quadtree-based coding unit (CU) block partitioning structure which allows recursive splitting into four equally sized blocks. At each depth level, each CU is partitioned into variable sized blocks of prediction units (PUs). However, the determination of the best CU partition for each coding tree unit (CTU) and the best PU mode for each CU causes a dramatic increase in computational complexity. To reduce such computational complexity, we propose a fast PU decision algorithm that early terminates PU search. The proposed method skips the computation of R-D cost for certain PU modes in the current CU based on the best mode and the rate-distortion (RD) cost of the upper depth CU. Experimental results show that the proposed method reduces the computational complexity of HM12.0 to 18.1% with only 0.2% increases in BD-rate.

Spatial Correlation Based Fast Coding Depth Decision and Reference Frame Selection in HEVC (HEVC의 공간적 상관성 기반 고속 부호화 깊이 및 참조영상 결정 방법)

  • Lee, Sang-Yong;Kim, Dong-Hyun;Kim, Jae-Gon;Choi, Hae-Chul;Kim, Jin-Soo;Choi, Jin-Soo
    • Journal of Broadcast Engineering
    • /
    • v.17 no.5
    • /
    • pp.716-724
    • /
    • 2012
  • In this paper, we propose a fast decision method of maximum coding depth decision and reference frame selection in HEVC. To reduce computational complexity and encoding time of HEVC, two methods are proposed. In the first method, the maximum depth of each coding unit (CU) in a largest CU (LCU) is constrained by using the maximum coding depth used by adjacent LCUs based on the assumption that the spatial correlation is very high and rate-distortion (R-D) cost. And we constrain the number of reference pictures for prediction unit (PU) performing motion estimation by using the motion information of the upper depth PU. The proposed methods reduce computational complexity of the HEVC encoder by constraining the maximum coding depth and the reference frame. We could achieve about 39% computational complexity reduction with marginal bitrate increase of 1.2% in the comparison with HM6.1 HEVC reference software.

Fast HEVC Encoding based on CU-Depth First Decision (CU 깊이 우선 결정 기반의 HEVC 고속 부호화 방법)

  • Yoo, Sung-Eun;Ahn, Yong-Jo;Sim, Dong-Gyu
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.49 no.3
    • /
    • pp.40-50
    • /
    • 2012
  • In this paper we propose the fast CU (Coding Unit) mode decision method. To reduce computational complexity and save encoding time of HEVC, we divided CU, PU (Prediction Unit) and TU (Transform Unit) decision process into two stages. In the first stage, because $2N{\times}2N$ PU mode is mostly selected among $2N{\times}2N$, $N{\times}2N$, $2N{\times}N$, $N{\times}N$ PU modes, proposed algorithm uses only $2N{\times}2N$ PU mode deciding depth of each CU in the LCU (Largest CU). And then, proposed method decides exact PU and TU modes at the depth level which is decided in the first stage. In addition, early skip decision rule is applied to the proposed method to obtain more efficient computational complexity reduction. The proposed method reduces computational complexity of the HEVC encoder by simplifying a CU depth decision method. We could obtain about 50% computational complexity reduction in comparison with HM 3.3 HEVC reference software while bitrate compressed by the proposed algorithm increases only 2%.