single-post

画像電子学会

The Institute of Image Electronics Engineers of Japan

Multi-Feature and Balanced Search Tree Based Depth Range Definition in HEVC Inter Prediction for VLSI Implementation

あらまし

High efficiency video coding (HEVC) is a video compression standard that outperforms the predecessor H.264/AVC by almost doubling the compression performance. To enhance the compression performance, the partition sizes is ranging from 4 × 4 to 64 × 64 in HEVC. However, the manifold partition sizes dramatically increase the encoding complexity. A lot of works focused on reducing the complexity but didn’t consider the feasibility of hardware implementation. This paper proposes a hardware friendly fast depth decision algorithm based on multiple features and balanced search tree. The minimum partition size is defined by multiple features, including quantization, texture and motion features. The balanced search tree will further define the depth search range. Our algorithm is VLSI friendly since the longest path of depth decision processing is reduced from four to three. Experimental results show that the proposed method saves about 32.18 % of the original processing time with 0.79 % of BD-bitrate increase on average. Keywords: HEVC, inter prediction, block texture, quantization, motion, depth decision

著者

Gaoxing CHEN*, Zhenyu LIU**, Tetsunori KOBAYASHI***, Takeshi IKENAGA*
*Graduate School of Informaton, Production and Systems, Waseda University , **TNList, Tsinghua University , ***Faculty of Science and Engineering, Waseda University

本文を読む
  • 一般社団法人 画像電子学会

    〒116-0002 東京都荒川区荒川3丁目35番4号
    ライオンズマンション三河島第二 101号 (事務局)

    TEL:03-5615-2893
    FAX:03-5615-2894

  • 地図・アクセス

  • お問い合わせフォーム






  • Copyright © 2017 IIEEJ (The Institute of Image Electronics Engineers of Japan)