Abstract: A method of decoding JVET video, comprising defining a coding unit (CU) template within a decoded area of a video frame, the CU template being positioned above and/or to the left of a current decoding position for which data was intra predicted, defining a search window within the decoded area, the search window being adjacent to the CU template, generating a plurality of candidate prediction templates based on pixel values in the search window, each of the plurality of candidate prediction templates being generated using different intra prediction modes, calculating a matching cost between the CU template and each of the plurality of candidate prediction templates, selecting an intra prediction mode that generated the candidate prediction template that had the lowest matching cost relative to the CU template, and generating a prediction CU for the current decoding position based on the intra prediction mode.

Abstract: A method of partitioning in video coding for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT) structure that can have quadtree or binary partitioning of the root node and quadtree or binary trees branching from each of the leaf nodes. The partitioning at any depth can use asymmetric binary partitioning to split a node represented by a leaf node into two child nodes of unequal size, representing the two child nodes as leaf nodes in a binary tree branching from the parent leaf node and coding the child nodes represented by final leaf nodes of the binary tree with JVET, wherein further partitioning of child nodes split from leaf nodes via asymmetric binary partitioning is allowed recursively along the same branch in any order with symmetric partitioning.

Abstract: A method of partitioning a video coding block for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT) structure that can have a quadtree branching from the root node and binary trees branching from each of the quadtree's leaf nodes using asymmetric binary partitioning to split a coding unit represented by a quadtree leaf node into two child coding units of unequal size, representing the two child coding units as leaf nodes in a binary tree branching from the quadtree leaf node and coding the child coding units represented by leaf nodes of the binary tree with JVET, wherein further partitioning of child coding units split from quadtree leaf nodes via asymmetric binary partitioning is disallowed.

Abstract: A method of decoding JVET video includes receiving a bitstream that includes encoded video data that includes encoded video data. From the encoded data, a horizontal predictor and a vertical predictor for a pixel in the current coding block may be interpolated. A coding block size may be identified to determine whether to use equal weight or unequal weights to apply to each of the horizontal and vertical predictors for calculating a final planar prediction value P(x,y) by comparing the coding block size to a coding block size threshold.

Abstract: A system and method of planar motion vector derivation which, in some embodiments can employ an unequal weighted combination of adjacent motion vectors. In some embodiments, motion vector information associated with a bottom right pixel or block adjacent to a current coding unit can be derived from motion information associated with a top row or top neighboring row of a current coding unit and motion information associated with a left column or left neighboring column of a current coding unit. Weighted or non-weighted combinations of such values can be combined in a planar mode prediction model to derive associated motion information for bottom and/or right adjacent pixels or blocks.

Abstract: The present embodiments relate to a method for encoding and a technical equipment for implementing the method. The method includes receiving a sequence of pictures to be encoded; defining a refresh period for coded pictures, wherein the decoded recovery point picture and all subsequent decoded pictures in output order are correct in content when starting decoding from the random access point picture. The encoding further includes determining the size of the refreshed area; selecting a number of sample columns or rows outside a conformance cropping window so that a boundary between the refreshed area and the unrefreshed area of the picture is aligned with a coding tree unit boundary.

Abstract: A method and apparatus for decoding JVET video, including receiving a bitstream, and parsing said bitstream to identify a syntax element indicating an intra direction mode to use for generating at least one predictor. The intra direction mode is a first intra direction mode in a plurality of intra direction modes that includes at least one weighted intra direction mode that corresponds to a non-weighted intra direction mode. The syntax element may identify whether to use a non-weighted or weighted intra direction mode to generate the at least one predictor. Thus, the coding unit may be coded in accordance with the at least one generated predictor associated with the selected intra direction mode.

Abstract: A method of partitioning a video coding block for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT) structure that can have a quadtree branching from the root node and binary trees branching from each of the quadtree's leaf nodes using asymmetric binary partitioning to split a coding unit represented by a quadtree leaf node into two child nodes of unequal size, representing the two child nodes as leaf nodes in a binary tree branching from the quadtree leaf node and coding the child nodes represented by leaf nodes of the binary tree with JVET, wherein weighted angular coding unit prediction is employed and wherein post-coding unit prediction filtering can be avoided or unbiased to increase coding times.

Abstract: A method of partitioning in video coding for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT structure that can have quadtree or binary partitioning of the root node and quadtree or binary trees branching from each of the leaf nodes. The partitioning at any depth can use asymmetric binary partitioning to split a child node represented by a leaf node into two child coding units of unequal size, representing the two child coding units as leaf nodes in a binary tree branching from the parent leaf node and coding the child coding units represented by final leaf nodes of the binary tree with JVET. Disclosed is a generalized method of partitioning a block, either square or rectangular, which leads to more flexible block sizes with possible higher coding efficiency.

Abstract: A method of decoding JVET video, comprising defining a coding unit (CU) template within a decoded area of a video frame, the CU template being positioned above and/or to the left of a current decoding position for which data was intra predicted, defining a search window within the decoded area, the search window being adjacent to the CU template, generating a plurality of candidate prediction templates based on pixel values in the search window, each of the plurality of candidate prediction templates being generated using different intra prediction modes, calculating a matching cost between the CU template and each of the plurality of candidate prediction templates, selecting an intra prediction mode that generated the candidate prediction template that had the lowest matching cost relative to the CU template, and generating a prediction CU for the current decoding position based on the intra prediction mode.

Abstract: A method of partitioning in video coding for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT) structure that can have quadtree or binary partitioning of the root node and quadtree or binary trees branching from each of the leaf nodes. The partitioning at any depth can use asymmetric binary partitioning to split a node represented by a leaf node into two child nodes of unequal size, representing the two child nodes as leaf nodes in a binary tree branching from the parent leaf node and coding the child nodes represented by final leaf nodes of the binary tree with JVET, wherein further partitioning of child nodes split from leaf nodes via asymmetric binary partitioning is allowed recursively along the same branch in any order with symmetric partitioning.

Abstract: A method of partitioning in video coding for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT) structure that can have quadtree or binary partitioning of the root node and quadtree or binary trees branching from each of the leaf nodes. The partitioning at any depth can use asymmetric binary partitioning to split a node represented by a leaf node into two child nodes of unequal size, representing the two child nodes as leaf nodes in a binary tree branching from the parent leaf node and coding the child nodes represented by final leaf nodes of the binary tree with JVET, wherein further partitioning of child nodes split from leaf nodes via asymmetric binary partitioning is allowed recursively along the same branch in any order with symmetric partitioning.

Abstract: A method of partitioning a video coding block for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT) structure that can have a quadtree branching from the root node and binary trees branching from each of the quadtree's leaf nodes using asymmetric binary partitioning to split a coding unit represented by a quadtree leaf node into two child coding units of unequal size, representing the two child coding units as leaf nodes in a binary tree branching from the quadtree leaf node and coding the child coding units represented by leaf nodes of the binary tree with JVET, wherein further partitioning of child coding units split from quadtree leaf nodes via asymmetric binary partitioning is disallowed.

Abstract: A method of partitioning a video coding block for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT) structure that can have a quadtree branching from the root node and binary trees branching from each of the quadtree's leaf nodes using asymmetric binary partitioning to split a coding unit represented by a quadtree leaf node into two child coding units of unequal size, representing the two child coding units as leaf nodes in a binary tree branching from the quadtree leaf node and coding the child coding units represented by leaf nodes of the binary tree with JVET, wherein further partitioning of child coding units split from quadtree leaf nodes via asymmetric binary partitioning is disallowed.

Abstract: A method of partitioning in video coding for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT) structure that can have quadtree or binary partitioning of the root node and quadtree or binary trees branching from each of the leaf nodes. The partitioning at any depth can use asymmetric binary partitioning to split a node represented by a leaf node into two child nodes of unequal size, representing the two child nodes as leaf nodes in a binary tree branching from the parent leaf node and coding the child nodes represented by final leaf nodes of the binary tree with JVET, wherein further partitioning of child nodes split from leaf nodes via asymmetric binary partitioning is allowed recursively along the same branch in any order with symmetric partitioning.

Abstract: A method of partitioning in video coding for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT) structure that can have quadtree or binary partitioning of the root node and quadtree or binary trees branching from each of the leaf nodes. The partitioning at any depth can use asymmetric binary partitioning to split a node represented by a leaf node into two child nodes of unequal size, representing the two child nodes as leaf nodes in a binary tree branching from the parent leaf node and coding the child nodes represented by final leaf nodes of the binary tree with JVET, wherein further partitioning of child nodes split from leaf nodes via asymmetric binary partitioning is allowed recursively along the same branch in any order with symmetric partitioning.

Abstract: A method, apparatus, and computer program product provide for solving merge candidate list mismatches. In the context of a method, the method accesses a current coding unit of a picture. The method can also generate a merge candidate list comprising a plurality of coding unit representations in a predefined order. The method also determines whether a particular coding unit representation within the merge candidate list is representative of a coding unit within a dirty area of the picture and prevents the particular coding unit representation and one or more coding unit representations following the particular coding unit in the predefined order from being selected as a merge candidate for the current coding unit.

Abstract: A method, apparatus, and computer program product provide for improving prediction accuracy of a geometric partitioning merge mode. In the context of a method, the method accesses a coding unit partitioned into a first partition and a second partition. The method also determines whether an enabling value associated with the coding unit is indicative of additional motion vector refinement and, in accordance with a determination that the enabling value associated with the coding unit is indicative of additional motion vector refinement, determines at least one motion vector difference value for at least one partition of the first partition and the second partition. The method additionally applies a prediction of the coding unit in accordance with the at least one motion vector difference value.

Abstract: A method of decoding JVET video includes receiving a bitstream indicating how a coding tree unit was partitioned into coding units, and parsing said bitstream to generate at least one predictor based on an intra prediction mode signaled in the bitstream. The predictor may be generated by interpolating neighboring pixels for each pixel within a coding block. The computation may be more accurate by deriving a value for a bottom right neighboring pixel.

Abstract: A second level intra prediction mode can be combined with one or more of sixty-seven JVET intra prediction modes during encoding of a coding unit in a video bitstream. Embodiments include making a position dependent intra prediction combination (PDPC) mode available as the second level intra prediction mode. In embodiments, when a PDPC (position dependent intra prediction combination) mode is enabled, the second level intra prediction is combined with one of the 67 selected intra predictor modes. In embodiments, the PDPC mode is only enabled or available for a predetermined subset of intra prediction modes (out of 67 possible modes), in order to reduce encoder complexity and potentially improve coding efficiency. The PDPC mode may be identifies as enabled or available by a list of modes or signaling in the video bitstream.