Abstract: A decoding method and a decoder for decoding a current block of a video frame is provided, wherein the decoding method comprises determining a list of Most Probable Modes (MPMs) for the current block. When at least one condition is satisfied, the list of MPMs includes a DC mode, a Vertical mode, a Horizontal mode, an intra prediction mode corresponding to a value of the Vertical mode with a first offset, and an intra prediction mode corresponding to the value of the Vertical mode with a second offset. The decoding method further includes obtaining a MPM flag and a MPM index for the current block from a bitstream of the video, and obtaining an intra prediction mode for the current block for reconstructing the current block.

Abstract: An apparatus and a method for filtering reconstructed images, in particular, video images, with adaptive multiplicative filters. The efficiency of the filtering operation is increased by restricting the allowable values of the filter coefficients to those that have only a limited number of “ones” in the binary representation.

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: A method and image processing device are provided, including a deblocking filter. The deblocking filter modifies values of at most MA samples of the first image block as first filter output values, the at most MA samples being located at a column of the first image block that is perpendicular to and adjacent to the horizontal block edge; and modifies values of at most MB samples of the second image block as second filter output values, the at most MB samples being located at a column of the second image block that is perpendicular to and adjacent to the horizontal block edge. At most a number MA of sample values of the first image block adjacent to the block edge are modified and at most a number MB of sample values of the second image block adjacent to the block edge are modified, wherein MA<MB.

Abstract: The embodiments disclosed herein relate to the construction of a search space for determining a motion vector for a current block of a picture in a video sequence. The search space construction is split into in two main stages, wherein a first and a second partial search space are respectively determined. Based on an initial estimate of a motion vector, a first search space is first constructed. A first and a second candidate motion of the first search space are identified according to a cost function. Based on the first and the second candidate motion vectors, a second search space is constructed. The motion vector for the current block is selected from the candidate motion vectors of the first search space and the second search space.

Abstract: This application relates to the field of image processing, and in particular, to a multi-lens video recording method and related devices. The method includes: performing collaborative photographing through a plurality of cameras, determining a target camera movement mode based on main subject information in images obtained through photographing and motion information of the cameras, and then fusing, based on the target camera movement mode, the images obtained through photographing by using the plurality of cameras, to implement online camera movement fusion on the plurality of video stream images.

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 filtering a sample value of a picture is provided, with an integer t that is less than k and with an integer j in the range of 1 to m: generating, with an integer i in the range of 1 to k?t?1, a filtered sample value by applying a filter to the value of the sample p(i,j), wherein the filter is supported by a set of filter support samples, the set of filter support samples does not comprise any samples p(i?,j?) with row index i? greater than k?t?1, and/or generating, with an integer i in the range of k?t to k, a filtered sample value by applying a filter to the value of the sample p(i,j), the filter is supported by a set of filter support samples, wherein the set of filter support samples does not comprise any samples p(i?,j?) with row index i? less than k?t.

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 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: Embodiments provide methods and devices (encoder and/or decoder) of coding a picture. A History Based Motion Vector Prediction (HMVP) list for a current Coding Tree Unit (CTU) row within a tile of a picture is initialized and a CTU of the current CTU row is processed based on the initialized HMVP list.

Abstract: A method and image processing device are provided, including a deblocking filter. The deblocking filter modifies values of at most MA samples of the first image block as first filter output values, the at most MA samples being obtained from a column of the first image block that is perpendicular to and adjacent to the horizontal block edge; and modifies values of at most MB samples of the second image block as second filter output values, the at most MB samples being obtained from a column of the second image block that is perpendicular to and adjacent to the horizontal block edge. At most a number MA of sample values of the first image block adjacent to the block edge are modified and at most a number MB of sample values of the second image block adjacent to the block edge are modified, wherein MA<MB.

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: A method for encoding a video image using coding parameters, adapted on the basis of motion of the video image and of an output of a machine-learning based model, wherein the machine-learning based model is input with samples of a block of the video image and motion information of the samples, and along with texture, wherein the machine-learning model segments the video image into regions based on strength of the motion determined from the motion information. An object is detected within the video based on the motion and the texture, and spatial-time coding parameters are determined based on the strength of the motion, and whether or not the detected objects moves.

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.

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: A decoding method and a decoder for decoding a current block of a video frame is provided, wherein the decoding method comprises determining a list of Most Probable Modes (MPMs) for the current block. When at least one condition is satisfied, the list of MPMs includes a DC mode, a Vertical mode, a Horizontal mode, an intra prediction mode corresponding to a value of the Vertical mode with a first offset, and an intra prediction mode corresponding to the value of the Vertical mode with a second offset. The decoding method further includes obtaining a MPM flag and a MPM index for the current block from a bitstream of the video, and obtaining an intra prediction mode for the current block for reconstructing the current block.

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