Abstract: An in-loop deblocking filter apparatus (120) for processing a current row or column of samples into a filtered row or column of samples. The current row or column of samples comprises a plurality of samples from a first sample block and a horizontally or vertically neighboring second sample block of a reconstructed picture of a video stream. The samples of the current row or column of samples have sample values pN?1?p0, q0?qN?1 wherein N is an even integer greater than 2. If a first condition or a second condition is satisfied, the current row or column is processed by: determining a filtered sample value q0? by applying a (2N?1)-tap filter to the sample values pN?2, . . . , p0, q0, . . . , qN?1 of the current row or column; and/or determining a filtered sample value p0? by applying a (2N?1)-tap filter to the sample values pN?1, . . . , p0, q0, . . . , qN?2 of the current row or column.

Abstract: The present disclosure relates to encoding a decoding video employing texture coding. In particular, a texture region is identified within a video picture and a texture patch is determined for said region. Moreover, a set of parameters specifies luminance within the texture region (1001) by fitting the texture region samples to a two-dimensional polynomial function of the patch determined according to the set of parameters (1040); and/or motion within the texture region by fitting motion estimated between the texture region of the video picture and an adjacent picture to a two-dimensional polynomial The texture patch and the first set of parameters are then included into a bitstream which is output of the encoder and provided in this way to the decoder which reconstructs the texture based on the patch and the function applied to the patch.

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 means to enable reduction of memory access in motion vector determination and/or refinement for a prediction block. In particular, the present disclosure relates to means to enable reduction of memory access in motion vector determination and/or refinement performed on a sub prediction block basis. In other words, a prediction block is split into sub prediction blocks for which at least the motion vector refinement is performed individually. The memory access window which limits the samples accessible during the motion vector determination and refinement of the sub prediction blocks does not exceed the memory access window for performing the motion vector determination and/or refinement for the prediction 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 method of coding implemented by a decoding device, comprising obtaining a value of a parameter for a current block, the value of the parameter indicating a partition mode for the current block; obtaining a first prediction mode for the current block; obtaining a second prediction mode for the current block; generate a first prediction value for a chroma sample in the current block according to the first prediction mode; generate a second prediction value for a chroma sample in the current block according to the second prediction mode; obtaining a combined prediction value by combining the first prediction value and the second prediction value.

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: A method of coding implemented by a coding apparatus. The method includes selecting an intra prediction mode for a current block, and encoding the selected intra prediction mode using truncated binary coding when the selected intra prediction mode is a remaining mode.

Abstract: An in-loop deblocking filter apparatus (120) for processing a current row or column of samples into a filtered row or column of samples. The current row or column of samples comprises a plurality of samples from a first sample block and a horizontally or vertically neighboring second sample block of a reconstructed picture of a video stream. The samples of the current row or column of samples have sample values pN?1?p0, q0?qN?1 wherein N is an even integer greater than 2. If a first condition or a second condition is satisfied, the current row or column is processed by: determining a filtered sample value q0? by applying a (2N?1)-tap filter to the sample values pN?2, . . . , p0, q0, . . . , qN?1 of the current row or column; and/or determining a filtered sample value p0? by applying a (2N?1)-tap filter to the sample values pN?1, . . . , p0, q0, . . . , qN?2 of the current row or column.

Abstract: An encoder and a decoder respectively encode and decode signal and syntax elements to/from a bitstream. In the encoding/decoding, semantics for the syntax elements are derived in accordance with previously decoded signal samples. Such encoding/decoding is applicable for instance to a video or audio signal.

Abstract: A system and method for processing a video stream are provided. When coding or decoding a video stream a de-blocking filtering may be applied for reducing discontinuities caused by use of a block-based video coding. The de-blocking filtering is performed using a filter grid. The size of the filter grid is chosen adaptively based on the processing parameters. The adaptive size of the filtering grid is determined based on the number of samples used and modified in de-blocking filtering of an edge of a coding block. The filtering grid may be used both for vertical and horizontal edge filtering.

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 or encoding device, the method comprising obtaining a value of an angle parameter for a current block; obtaining a value of a width of the current block and a value of a height of the current block; calculating a ratio value between the value of the width and the value of height; obtaining a first value according to the value of angle parameter and the ratio value; calculating a sample distance value for a sample in the current block according to the first value; obtaining a prediction value for the sample in the current block according to the sample distance value.

Abstract: Embodiments of the present disclosure relate to the field of picture processing. Especially, the embodiments are directed to improving the deblocking filter of an image coding device. During the deblocking, at most a number MA of sample values of the first coding block adjacent to the block edge are modified and at most a number MB of sample values of the second coding block adjacent to the block edge are modified; or at most a number MA of sample values of the second coding block adjacent to the block edge are modified and at most a number MB of sample values of the first coding block adjacent to the block edge are modified, MA?MB.

Abstract: A motion vector determination employs template matching. At first, an initial motion vector is obtained. If the initial motion vector points to a position that is fractional, and thus, requires interpolation from the integer sample positions, 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 matching to define a refinement of the initial motion vector.

Abstract: The present disclosure relates to motion vector determination using template matching. In particular, an initial motion vector and a template are obtained for a prediction block. Then a 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. The template matching accesses integer sample positions within a predetermined window, the predetermined window including said search space and further integer sample positions accessible for the template matching, replaces at least one integer sample position located out of the window by at least one replacement value, each replacement value is based on at least one sample within said window, and uses the accessed integer sample position values as well as the at least one replacement value to perform the template matching.

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: Embodiments of the present invention relate to the field of picture processing. Especially, the embodiments are directed to improving the deblocking filter of an image coding device. During the deblocking, at most a number MA of sample values of the first coding block adjacent to the block edge are modified and at most a number MB of sample values of the second coding block adjacent to the block edge are modified; or at most a number MA of sample values of the second coding block adjacent to the block edge are modified and at most a number MB of sample values of the first coding block adjacent to the block edge are modified, MA?MB.

Abstract: A motion vector determination employs template matching. At first, an initial motion vector is obtained. If the initial motion vector points to a position that is fractional, and thus, requires interpolation from the integer sample positions, 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 matching to define a refinement of the initial motion vector.

Abstract: The present disclosure relates to motion vector determination using template matching. In particular, an initial motion vector and a template are obtained for a prediction block. Then a 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. The template matching accesses integer sample positions within a predetermined window, the predetermined window including said search space and further integer sample positions accessible for the template matching, replaces at least one integer sample position located out of the window by at least one replacement value, each replacement value is based on at least one sample within said window, and uses the accessed integer sample position values as well as the at least one replacement value to perform the template matching.