Abstract: The disclosure relates to a method of decoding implemented by a decoding device, comprising: obtaining a value of a reference line index for a current block; constructing a most probable mode, MPM, list for the current block; obtaining a value of intra-prediction mode index for the current block; when the value of the reference line index is not equal to 0, obtaining an intra prediction mode of the current block according to the MPM list for the current block and the value of the intra-prediction mode index for the current block, wherein the value of the intra-prediction mode index indicates a position that corresponds to the intra prediction mode of the current block among angular intra-prediction modes in the MPM list. The disclosure also relates to a coding apparatus and a non-transitory machine-readable medium.

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: 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 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: A method for boundary partition of a current block is provided. The method includes obtaining a partition indicator from a received bitstream; determining whether the partition indicator indicates that the current block is to be split and whether the current block is a boundary block; and performing a non-inverse transform operation on an inside part of the current block when the partition indicator indicates that the current block is not to be split and the current block is a boundary block, wherein the inside part of the block is located within the picture. For the boundary block which is determined not to be split, a non-inverse transform operation is chosen. This avoids a normal inverse transform on the residuals of the inside part (within the picture) of the current block in the decoder, so number of blocks for the inverse transformation is decreased, and decoding complexity is thus reduced.

Abstract: A decoding method for decoding an encoded picture which is partitioned into coding tree blocks which are further partitioned into coding blocks with different sizes, comprises parsing a first indication from the sequence parameter set (SPS)/picture parameter set (PPS)/slice header/tile header of a bit stream containing the encoded picture, determining the partition mode of the coding tree blocks, which are confined by block size restriction parameter and partition depth restriction parameter included in the SPS/PPS/slice header/tile header when the first indication is first value, or determining the partition mode of the multiple coding tree blocks, which are confined by default by block size restriction parameter and default partition depth restriction parameter when the first indication is second value or not presented in the SPS/PPS/slice header/tile header, and partitioning the coding tree blocks into the coding blocks according to the partition mode, and decoding the coding blocks.

Abstract: An apparatus and a method filters reconstructed images, in particular, video images, with adaptive multiplicative filters. The apparatus and method groups the multiplier coefficients of the filter into at least two groups; determines the value of each multiplier coefficient in a first group so as to be allowed to assume any value in a first set of allowed values of multiplier coefficients, determines the value of each multiplier coefficient in a second group so as to be allowed to assume any value in a second set of allowed values of multiplier coefficients, and filters the set of samples of an image with the filter. At least one of the first and second sets has at least one value that is not in the other set.

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: The present disclosure relates to motion vector determination using template or bilateral matching and predictor generation based on the motion vector. The template or bilateral matching and/or the predictor generation use interpolation filtering. The interpolation filtering operation accesses integer sample positions within a window, and further uses padded sample values for integer sample positions outside the window, which are based on at least one sample within said window, and uses the accessed integer sample position values as well as the padded sample values to perform the template or bilateral matching and/or predictor generation.

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 disclosure relates to a method of decoding implemented by a decoding device, comprising: obtaining a value of a reference line index for a current block; constructing a most probable mode, MPM, list for the current block; obtaining a value of intra-prediction mode index for the current block; when the value of the reference line index is not equal to 0, obtaining an intra prediction mode of the current block according to the MPM list for the current block and the value of the intra-prediction mode index for the current block, wherein the value of the intra-prediction mode index indicates a position that corresponds to the intra prediction mode of the current block among angular intra-prediction modes in the MPM list. The disclosure also relates to a coding apparatus and a non-transitory machine-readable medium.

Abstract: The present disclosure relates to encoding of video image using coding parameters, which are adapted based on events related to motion within the video image. Image content is captured by a standard image sensor and an event-triggered sensor, providing an event-signal indicating changes (e.g. amount and time-spatial location) of image intensity. Objects are detected within the video image, based on the event signal assessing motion of the object, and their textures extracted. The spatial-time coding parameters of the video image are determined based on the location and strength of the event signal, and the extent to which 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: 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: An apparatus and method determining a motion vector for a block, which relates to motion vector determination employing template matching or bilateral matching, are provided. At first, candidate motion vectors are obtained and are mapped to respective representatives (representative motion vectors). In particular, if the obtained candidate motion vectors point to fractional positions and thus, interpolation from the integer sample positions is required, the initial motion vector is rounded to a closest integer sample position. The rounded position is then used to define the search space for the template or bilateral matching to determine the best matching motion vector for the block (in other words, a refinement of an initial motion vector around which the candidate space is spanned). Finally, the mapping operation can be reverted in order to obtain a result in the original search space.

Abstract: A method of image partitioning, comprises determining a first indicator, wherein the first indicator is shared by a first part of a bitstream; determining a partitioning of an image area corresponding to the first part of the bitstream with binary tree (BT) splitting or ternary tree (TT) splitting when the first indicator takes a first value; and determining the partitioning of the image area corresponding to the first part of the bitstream without BT splitting and TT splitting when the first indicator takes a second value, wherein the first value is different from the second value.

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 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 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: An apparatus and method of partitioning of an image or an image slice is described herein. In particular, on an image processing apparatus, the image or image slice is split into an integer number of coding tree units in both vertical and horizontal directions. The remaining boundary portion is then at least partly forced-split so that the deepest partitioning level is a result of binary partitioning, i.e. includes a coding unit which is longer on one side than on the other side. The longer side is parallel or concurrent to the image or image slice boundary.