Ofinno, LLC

Comcast Cable Communications, LLC

Damian Ruiz Coll

Tae Meon Bae

Esmael Hejazi Dinan

Kalyan Goswami

Vasily Alexeevich Rufitskiy

Young-Yoon Lee

Kyungmin Park

Peyman Talebi Fard

Weihua Qiao

Vinod Kumar Malamal Vadakital

SungDuck Chun

Alexey Konstantinovich Filippov

Vikas Warudkar

A decoder receives, from a bitstream, a first indication of a first bit depth for a sequence of frames, and a second indication of a second bit depth for a block in a frame of the sequence of frames, a residual block of samples of the second bit depth, and a prediction parameter. The decoder determines a first decoded block of samples of the second bit depth based on the second bit depth indicated by the second indication, the residual block of samples, and the prediction parameter. The decoder converts, based on a difference between the first bit depth and the second bit depth, the first decoded block of samples to a second decoded block of samples of the first bit depth based on the first decoded block of samples of the second bit depth and the first indication of the first bit depth for the sequence.

Adaptive block level bit-depth prediction

Encoding and/or decoding a block of a video frame may be based on a template associated with the block. The length of the template may be determined based on at least one of: a position of the block relative to a boundary, available reference samples above the boundary, and/or the length of a second template of one or more other template derivation algorithms. The length may be adjusted to improve prediction efficiencies and accuracies of template-based predictions.

Video compression using boundary based template refinement

Encoding and/or decoding a block of a video frame may be based on a previously decoded reference block in the same frame or in a different frame. The reference block may be indicated by a block vector (BV). The BV may be encoded as difference between a block vector predictor (BVP) and the BV. The BVP may be selected based on a distance between the BVP and another BVP which may improve diversity of selected BVPs and improve prediction accuracy of the BVP.

Block vector predictor candidate selection

A decoder receives, from a bitstream, an indication of a block vector predictor (BVP) and a first block vector difference (BVD) for a current block. The decoder determines a second BVD based on: the first BVD and whether a location displaced from the current block by a sum of the BVP and the first BVD is outside a reference region. The decoder calculates a block vector (BV) based on a sum of the second BVD and the BVP. The decoder reconstructs the current block based on a reference block indicated by the BV.

Intra block copy vector difference wrap around

In some embodiments, a decoder may receive, from a bit stream, a residual of a block and an indication that the residual was determined based on a refined partition edge. The decoder may determine the refined partition edge based on the indication and reference samples neighboring the block. The decoder may determine based on at least one prediction mode, a prediction for two parts of the block defined by the refined partition edge. The decoder may determine a reconstruction for the block based on the residual and the prediction of the block.

Geometric partitioning refinement

An apparatus determines a value of a coordinate of a sample is outside a range of values of the coordinate for samples in an intra block copy (IBC) reference region. The sample is displaced from a current block by an amount indicated by a candidate block vector predictor (BVP). Based on determining the value of the coordinate of the sample is outside the range of value of the coordinate for the samples in the IBC reference region, the apparatus adjusts a component of the candidate BVP to generate an adjusted candidate BVP. The apparatus constructs a list of candidate BVPs comprising the adjusted candidate BVP. The apparatus derives costs for the candidate BVPs in the list. The apparatus reorders the candidate BVPs in the list based on the costs.

Adaptive reordering of adjusted block vector predictor candidates

A wireless device receives, from an SMF, a message for a PDU session establishment, wherein the message comprises a configuration information for determining whether one or more packets are associated with a plurality of packets of a data unit (DU) based on a timestamp field of the one or more packets. The wireless device determines, based on the configuration information, that a first packet, comprising a first timestamp field, is one of a first plurality of packets of a first DU, and a second packet, comprising a second timestamp field, is one of the first plurality of packets of the first DU. The wireless device sends, to a base station, the first packet and the second packet.

Data unit identification

An apparatus determines a value of a coordinate for a sample is outside a range of values of the coordinate for samples in a reference region. The sample is displaced relative to a current block by an amount indicated by a block vector predictor (BVP). The apparatus adjusts a component, corresponding to a direction of the coordinate, of the BVP to have an adjusted value closer to the range of values of the coordinate for the samples in the reference region based on the determining. The apparatus uses the BVP, with the component adjusted to have the adjusted value, to determine or predict a block vector (BV) for the current block.

Block vector predictor refinement based on reference region boundary

Encoding and/or decoding a block of a video frame may be based on a previously decoded reference block in the same frame or in a different frame. The reference block may be indicated by a block vector (BV). The BV may be encoded as difference between a block vector predictor (BVP) and the BV. The BVP may be adjusted to improve prediction accuracy of the BVP.

Video compression using block vector predictor refinement

A decoder receives, in a bitstream, an indication of a block vector predictor (BVP) and a first and a second component magnitude of a block vector difference (BVD). The decoder determines each of a plurality of BV candidates based on a sum of the BVP and a different one of a plurality of BVD candidates. Each of the plurality of BVD candidates comprises: the first and second component magnitudes; and a different combination of signs for the first and second component magnitudes. The decoder determines a sign for at least one of the first and second component magnitudes of the BVD based on validities of the plurality of BV candidates.

Block vector difference signaling for intra block copy

A decoder may generate a reconstruction of a luma block based on a prediction of the luma block and a residual of the luma block. The decoder may generate, at one or more hidden layers, a score distribution. The decoder may generate the score distribution based on the reconstruction of the luma block and one or more coding parameters of the luma block. The decoder may generate, at an output layer and based on the score distribution, a prediction of a chroma block corresponding to the luma block. The decoder may determine a reconstruction of the chroma block based on the prediction of the chroma block and a residual of the chroma block.

Chroma prediction from luma for video coding

An apparatus calculates a block vector difference (BVD) between a block vector (BV) and a block vector predictor (BVP). The apparatus determines each of a plurality of BV candidates based on a sum of the BVP and a different one of a plurality of BVD candidates. Each of the plurality of BVD candidates comprises: a first and a second component magnitude of the BVD; and a different combination of signs for the first and second component magnitudes. The apparatus determines validities of the plurality of BV candidates based on values of samples, stored in a reference memory, of reference blocks indicated by the plurality of BV candidates. The apparatus signales, in a bitstream, a sign for at least one of the first and second component magnitudes of the BVD based on the validities of the plurality of BV candidates.

Validity determination of block vector candidates

A user plane function UPF receives, from a SMF, a DU identification information for identifying a plurality of packets for one or more DUs of an application. The UPF receives a first plurality of packets, of the plurality of packets, of a first DU of the application; and a second plurality of packets, of the plurality of packets, of a second DU of the application. The UPF sends, to an access node and using the DU identification information a first GTP container comprising a first GTP header comprising a first number identifying the first plurality of packets, and a second GTP container comprising a second GTP header comprising a second number identifying the second plurality of packets.

Data unit in wireless system

A decoder may receive, from a bitstream for a block, an indication of a first bit depth, a residual block of samples of the first bit depth, and a prediction parameter. The decoder may receive, from the bitstream for a sequence, an indication of a second bit depth. The decoder may determine a first decoded block of samples of the first bit depth based on the first bit depth, the residual block of samples of the first bit depth, and the prediction parameter. The decoder may determine a second decoded block of samples of the second bit depth based on the first decoded block of samples of the first bit depth.

Growing community of inventors

Reston, VA, United States of America

Damian Ruiz Coll