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.

Abstract: A method is provided for inter-coding video in which coding units can be encoded using multiple local illumination compensation (LIC) values to more accurately and efficiently transmit and render video. In the method, two or more LIC values can be established for a single coding unit (CU) such that the CU can be coded using multiple LIC values instead of a single LIC value as employed in present systems.

Abstract: A method for inter-coding video in which encoder and decoder memory requirements associated with storage of motion information related to collocated coding units is reduced. In the method motion information related to only a single or reduced set of collocated coding unit(s) may be stored at the encoder and decoder. In operation, if the encoder determines that motion information for a current coding unit should replace a currently stored motion information for currently stored motion information for the collocated coding unit, then the encoder can replace the motion information at the encoder and transmit an indicator with the current coding unit to signal to the decoder that currently stored motion information currently should be updated or replaced with the motion information associated with the current coding unit.

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 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 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 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: There are disclosed a method and an apparatus for video encoding. The method can include determining that a coding unit is in intra coded area and encoding the coding unit in intra prediction mode into a bitstream unless the intra prediction for the coding unit needs a reference sample for prediction from a dirty area. The method can further include determining that a coding unit is in clean area when the coding unit is encoded in inter prediction mode into a bitstream, the method comprises validating a plurality of inter prediction modes to determine which of the plurality of inter prediction modes do not use reference samples from a dirty area, and defining such inter prediction mode as a valid inter prediction mode. The method further includes encoding into a bitstream that exact-match is required at a recovery point and encoding into a bitstream an indication of a use of a diagonal refresh; and transmitting the encoded bitstream to a decoder.

Abstract: A method is provided for inter-coding video in which coding units can be encoded using multiple local illumination compensation (LIC) values to more accurately and efficiently transmit and render video. In the method, two or more LIC values can be established for a single coding unit (CU) such that the CU can be coded using multiple LIC values instead of a single LIC value as employed in present systems.

Abstract: A method for inter-coding video in which encoder and decoder memory requirements associated with storage of motion information related to collocated coding units is reduced. In the method motion information related to only a single or reduced set of collocated coding unit(s) may be stored at the encoder and decoder. In operation, if the encoder determines that motion information for a current coding unit should replace a currently stored motion information for currently stored motion information for the collocated coding unit, then the encoder can replace the motion information at the encoder and transmit an indicator with the current coding unit to signal to the decoder that currently stored motion information currently should be updated or replaced with the motion information associated with the current coding unit.

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 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 decoding JVET video, comprising receiving a bitstream indicating how a coding tree unit was partitioned into coding units according to a partitioning structure that allows nodes to be split according to a partitioning technique. An intra direction mode for a coding unit may be selected, as well as one or more of the plurality of reference lines to generate at least one predictor for the intra direction mode. A predictor may be generated from reference samples within each selected reference line by combining predicted pixel values based on a projected position on a main reference line in combination with predicted pixel values based on a projected position on a side reference line. The predicted pixel values are weighted according to a weight parameter, wherein the weight parameter is determined based on a shift conversion factor.

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.