×

BINARY TERNARY QUAD TREE PARTITIONING FOR JVET

  • US 20200137425A1
  • Filed: 12/30/2019
  • Published: 04/30/2020
  • Est. Priority Date: 05/25/2016
  • Status: Active Application
First Claim
Patent Images

1. An apparatus for coding video data comprising one or more processors configured to:

  • receive a bitstream indicating how a coding tree unit was partitioned into coding units according to a partitioning structure that allows root nodes to be partitioned with at least one of quadtree partitioning, binary partitioning, and/or ternary partitioning;

    parse said bitstream to determine how the coding tree unit was partitioned using the quadtree partitioning, binary partitioning, and/or ternary partitioning;

    parse said bitstream to determine a symmetry of said partitioning, to determine if at least one of asymmetric partitioning and/or symmetric partitioning was used to partition a parent coding unit into child nodes, wherein symmetric partitioning splits a parent node in to child nodes of equal size, and asymmetric partitioning splits a parent node in to child nodes of unequal size;

    identify each of the child nodes within each respective parent unit, wherein a node can be recursively partitioned in to smaller nodes,wherein both ternary and binary partitioning are allowed in the partitioning structure in either order during a recursive partitioning of a root node or parent node; and

    decode the identified coding units using JVET.

View all claims
  • 4 Assignments
Timeline View
Assignment View
    ×
    ×