Abstract: The present disclosure relates to methods and devices to be employed for encoding and decoding of image or video signal. They include determination of whether or not the size of a current block is larger than a minimum allowed quadtree leaf node size. If the size of the current block is not larger than the minimum allowed quadtree leaf node size, multi-type tree splitting is applied to the current block. The minimum allowed quadtree leaf node size is not larger than a maximum allowed binary tree root node size or the minimum allowed quadtree leaf node size is not larger than a maximum allowed ternary tree root node size.

Abstract: A video processing method, comprising: initializing a HMVP list for a current CTU row when the current CTU is the beginning CTU of a current CTU row; and processing the current CTU row based on the HMVP list. By performing the method, the encoding efficiency and decoding efficiency are improved.

Abstract: An image processing device for use in an image encoder and/or an image decoder, for deblocking a block edge between a first block and a second block of an image encoded with a block code, is provided. The image processing device comprises a filter for filtering the block edge, configured to, for at least some of the pixels to be filtered, within a deblocking range from the block edge, the deblocking range being perpendicular to the block edge, determine a filtered pixel value from an original pixel value of the pixel and at least one further pixel value, determine a clipping value of the pixel, dependent upon a distance of the pixel from the block edge, and clip the filtered pixel value, using the clipping value resulting in a deblocked pixel value.

Abstract: Embodiments of this application disclose example apparatuses, methods, and computer program products for extracting a feature from an image of a scene. One example apparatus comprises at least one processor and one or more memories coupled to the at least one processor and storing programming instructions for execution by the at least one processor to, in response to a feature extraction event, extract a feature from first image data representing a first image of a scene, wherein the feature extraction event is based on second image data representing a second image of the scene.

Abstract: A partitioning method comprises determining whether a current block of a picture is a boundary block and whether the size of the current block is larger than a minimum allowed quadtree leaf node size; and if the current block is the boundary block and the size of the current block is not larger than the minimum allowed quadtree leaf node size (MinQTSize), applying forced binary tree (BT) partitioning to the current block. A method comprises making a determination that a current block of a picture is a boundary block and that a size of the current block is less than or equal to a minimum allowed quadtree (QT) leaf node size (MinQTSize); and applying, in response to the determination, forced binary tree (BT) partitioning to the current block.

Abstract: The present invention relates to the performance of motion vector refinement in a search space for multi-reference inter-prediction. Two or more reference pictures are selected, one of those used for motion vector refinement. Based on an initial estimate of a motion vector to the reference picture for motion vector refinement, a search space in this reference image is constructed. Using template matching, the first motion vector is refined. The second motion vector to another reference picture is calculated using its initial estimate, the initial estimate of the first motion vector and the refined first motion vector.

Abstract: The present disclosure relates to motion vector refinement. As a first step, an initial motion vector and a template for the block are obtained. Then, the refinement of the initial motion vector is determined by template matching with said template in a search space. The search space is located on a position given by the initial motion vector and includes one or more fractional sample positions, wherein each of the fractional sample positions belonging to the search space is obtained by interpolation filtering with a filter of a predefined tap-size assessing integer samples only within a window, said window being formed by integer samples accessible for the template matching in said search space.

Abstract: An image processing device for use in an image encoder and/or an image decoder, for deblocking a block edge between a first block and a second block of an image encoded with a block code, is provided. The image processing device comprises a filter for filtering the block edge, configured to, for at least some of the pixels to be filtered, within a deblocking range from the block edge, the deblocking range being perpendicular to the block edge, determine a filtered pixel value from an original pixel value of the pixel and at least one further pixel value, determine a clipping value of the pixel, dependent upon a distance of the pixel from the block edge, and clip the filtered pixel value, using the clipping value resulting in a deblocked pixel value.

Abstract: A coding apparatus configured to select an intra prediction mode for a current block, encode the selected intra prediction mode using truncated binary coding every time the selected intra prediction mode is a remaining mode, and encode the selected intra prediction mode using N bits when the selected intra prediction mode is included in a first portion from remaining modes and using N+1 bits when the selected intra prediction mode is included in a second portion of the remaining modes.

Abstract: The present disclosure relates to methods and devices to be employed for encoding and decoding of image or video signal. They include determination of whether or not the size of a current block is larger than a minimum allowed quadtree leaf node size. If the size of the current block is not larger than the minimum allowed quadtree leaf node size, multi-type tree splitting is applied to the current block. The minimum allowed quadtree leaf node size is not larger than a maximum allowed binary tree root node size or the minimum allowed quadtree leaf node size is not larger than a maximum allowed ternary tree root node size.

Abstract: A method for inter prediction of a current geometric partition of a coding block includes, when the coding block is enabled for a geometric partition merge mode, generating a merge candidate list for the coding block partitioned into two geometric partitions including the current geometric partition. The merge candidate list generation comprises deriving one or more spatial merge candidates from neighboring coding units, and directly or immediately deriving one or more temporal motion vector predictions (MVPs). An uni-prediction MV is derived as a motion vector of the current geometric partition based on the merge candidate list. The current geometric partition of the coding block is predicted based on the uni-prediction MV to obtain a predicted value of the current geometric partition.

Abstract: A method of filtering a sample value of a picture includes, when an integer t is less than k and an integer j is in the range of 1 to m, generating, with an integer i in the range of 1 to k?t?1, a first filtered sample value by applying a first filter to the value of the sample p(i,j), where the first filter is supported by a first set of filter support samples, which does not comprise any samples p(i?,j?) with row index i? greater than k?t?1, and generating, with i in the range of k?t to k, a second filtered sample value by applying a second filter to the value of the sample p(i,j), the second filter is supported by a second set of filter support samples, which does not comprise any samples p(i?,j?) with row index i? less than k?t.

Abstract: The present disclosure relates to motion vector refinement. As a first step, an initial motion vector and a template for the block are obtained. Then, the refinement of the initial motion vector is determined by template matching with said template in a search space. The search space is located on a position given by the initial motion vector and includes one or more fractional sample positions, wherein each of the fractional sample positions belonging to the search space is obtained by interpolation filtering with a filter of a predefined tap-size assessing integer samples only within a window, said window being formed by integer samples accessible for the template matching in said search space.

Abstract: A method of coding implemented by a decoding device, comprising obtaining a bitstream; obtaining a value of an indicator for a current block according to the bitstream; obtaining a value of a first parameter for the current block and a value of a second parameter for the current block, according to the value of the indicator and a predefined lookup table; obtaining a value of a sample distance for a sample which is located in the current block, according to the value of the first parameter and the value of the second parameter; obtaining a prediction value for the sample, according to the value of the sample distance for the sample.

Abstract: The present disclosure provides apparatuses and methods for splitting an image into coding units. An image is divided into coding tree units (CTUs) which are hierarchically partitioned. Hierarchical partitioning includes multi-type partitioning such as binary tree or quad tree splitting. For CTUs completely within the image and CTUs on the boundary, respective multi-type partition depths are chosen. The present disclosure provides for multi-type partitioning flexibility in a boundary portion of the image.

Abstract: A method for coding implemented by a decoding device or an encoding device includes: obtaining a first prediction mode for a first sub-block, obtaining a second prediction mode for a second sub-block; obtaining a first prediction value for a sample in the current block according to the first prediction mode, obtaining a second prediction value for the sample in the current block according to the second prediction mode; obtaining a value of an indicator, the value of the indicator indicating a blending operation which is performed for the sample in the current block; and obtaining a combined prediction value for the sample in the current block, according to the value of the indictor, the first prediction value, and the second prediction value. The blending operation adaptively performs around a separation line dividing the current block into at least the first sub-block and the second sub-block.

Abstract: The present disclosure provides an encoding apparatus and a decoding apparatus, as well as an encoding method and a decoding method. In particular, the present disclosure relates to block partitioning and signaling the partitioning parameters in a bitstream. An override flag in a slice header indicates whether or not a block is to be partitioned according to a first partition constraint information. The override flag is included in the bitstream and the block is partitioned accordingly.

Abstract: A deblocking filter of an image processing device is provided. The deblocking filter is used in an image coding process, for deblocking a block edge between a first coding block and a second coding block of an image. The first block has SA samples perpendicular to the block edge by N samples parallel to the block edge, and the second block has SB samples perpendicular to the block edge by N samples parallel to the block edge. No more than IA samples of the first coding block are used as first filter input values, and no more than IB samples of the second coding block are used as second filter input values. No more than MA samples of the first coding block are modified as first filter output values, and no more than MB samples of the second coding block are modified as second filter output values.

Abstract: The present disclosure relates generally to video coding and picture partitioning methods. In particular, the disclosure is concerned with relations between partition constraint elements, by setting partitioning rules for different picture partitioning methods. The disclosure provides devices and corresponding methods for generating or processing a bitstream including encoded pictures, particularly for setting and including partition constraint element into the bitstream. One of the devices is configured to determine a minimum luma size of a leaf block resulting from quadtree splitting (MinQtSizeY), determine a maximum luma size of a coding block where partitioning using a binary tree splitting is allowed (MaxBtSizeY) based on the MinQtSizeY, and include information for the determined MinQtSizeY into the bitstream.