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 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, 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.

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 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, apparatus, and computer program product provide for management of luma mapping with chroma scaling (LMCS) processes for Gradual Decoding Refresh (GDR) pictures. In the context of a method, the method accesses a picture to be decoded and determines whether the picture is a GDR picture. The method can also prevent a LMCS decoding process from being applied to the GDR picture. Another method can determine whether a virtual boundary is within a current coding tree unit of the gradual ecoding refresh picture and if so, prevent a chroma residual scaling decoding process associated with LMCS from being applied to one or more coding units within a clean area. Another method can pad a neighboring pixel area from one or more reconstructed pixels in a clean area for a chroma residual scaling decoding process associated with LMCS.

Abstract: A method of decoding JVET video that 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 intra prediction mode selected from a plurality of intra prediction modes for calculating a prediction pixel P[x,y] at coordinate x,y for the coding unit. A number of intra prediction modes available for coding the coding unit are reduced by replacing two or more non-weighted intra prediction modes by a weighted intra prediction mode.

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: A method is provided for inter-coding video in which transmission bandwidth requirements associated with second motion vectors for bi-directional temporal prediction is reduced. In the method, vector information for one of motion vectors for multi-directional temporal prediction can be transmitted together with information on how to derive or construct the second motion vectors. Thus, rather than sending express information regarding each of the plurality of motion vectors, express information related to only one motion vector along with information related to reconstruction/derivation of the second motion vectors is transmitted, thus reducing bandwidth requirements and increasing coding efficiency.

Abstract: A method for inter-coding video is provided in which transmission bandwidth requirements associated with second motion vectors for bi-directional temporal prediction is reduced. In the method motion vector information for only one of the two motion vectors for bi-directional temporal prediction can be transmitted together with information on how to derive or construct the second motion vector. Thus, rather than sending express information regarding two motion vectors, express information related to only one motion vector along with information related to reconstruction/derivation of the second motion vector is transmitted, thus reducing bandwidth requirements and increasing coding efficiency.

Abstract: A method and apparatus for decoding JVET video, including receiving a bitstream and generating predictor pixels for angular prediction using pixels at projected positions along both a top reference row (main reference line) and a left reference column (side reference line). By combining projected pixel values on the main reference line with projected pixel values on the side reference, a predictor pixel at coordinate (x,y) can be determined. Further weighting the values according to a distance between predictor pixels and projected pixel positions on the main and side references may be included in the combination of pixel values. The weight parameter may be determined from a weighting table. Further, the weights for horizontal and vertical predictors may be computed based on that of a horizontal and vertical predictor, whichever is more accurate.

Abstract: A method, apparatus and a non-transitory computer readable medium are provided for receiving an input picture divided into a plurality of coding units (CUs) and comprising a virtual boundaries between a dirty area and a clean area of the input picture, each CU located within either the clean area or the dirty area. The virtual boundary is treated as a picture boundary for coding units within the clean area and as a non-boundary for coding units within the dirty area. For a current CU, a history-based motion vector prediction (HMVP) table can be prepared that identifies other CUs as HMVP candidates for inter prediction, the HMVP candidates being adjacent the current CU. The HMVP candidate CUs are limited to CUs previously coded in the clean area. The current CU can be intra coded based at least upon the HMVP candidates from the HMVP table.

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 method of decoding JVET video that 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 intra prediction mode selected from a plurality of intra prediction modes for calculating a prediction pixel P[x,y] at coordinate x,y for the coding unit. A number of intra prediction modes available for coding the coding unit are reduced by replacing two or more non-weighted intra prediction modes by a weighted intra prediction mode.