Encoding device and decoding device

Abstract

To reduce the data amount that is held in memory.SOLUTION: An encoding device 100 determines a filter to be used for deblocking filtering from among a plurality of filters including a first filter, a second filter, and a third filter (S102). The first filter uses M pixels located at an upper side of the block boundary and M pixels located at a lower side of the block boundary, the second filter uses N pixels (N=integer larger than M) located at the upper side of the block boundary and N pixels located at the lower side of the block boundary, and the third filter uses a first pixel at the upper side of the block boundary and a second pixel at the lower side of the block boundary. The number of the first pixels is any one of a plurality of first candidate values, and the number of the second pixels is any one of a plurality of second candidate values. The plurality of first pixel candidate values and the plurality of second pixel candidate values respectively are greater than or equal to N.SELECTED DRAWING: Figure 16

Description

[Technical Field]

[0001] This disclosure relates to an encoding device, a decoding device, an encoding method, and a decoding method. [Background technology]

[0002] Traditionally, H.265 has been used as a standard for encoding moving images. H.265 is also known as HEVC (High Efficiency Video Coding). [Prior art documents] [Non-patent literature]

[0003] [Non-Patent Document 1] H.265(ISO / IEC 23008-2 HEVC(High Efficiency Video Coding)) [Overview of the project] [Problems that the invention aims to solve]

[0004] In such encoding schemes, there is a need for proposals for new methods to improve encoding efficiency, image quality, and reduce circuit size.

[0005] Each of the embodiments or parts thereof disclosed in this disclosure may contribute to at least one of the following: improved coding efficiency, reduced coding / decoding processing load, reduced circuit size, improved coding / decoding speed, and appropriate selection of components / operations such as filters, blocks, sizes, motion vectors, reference pictures, and reference blocks in coding and decoding.

[0006] Furthermore, this disclosure also includes disclosure of configurations or methods that may provide benefits other than those mentioned above. For example, configurations or methods that improve coding efficiency while suppressing an increase in processing load. [Means for solving the problem]

[0007] An encoding device according to one aspect of the present disclosure comprises a circuit and a memory, the circuit using the memory to determine a filter to be used for deblocking filtering from a plurality of filters including a first filter, a second filter and a third filter, and performing the deblocking filtering on a block boundary using the determined filter, the first filter being a filter that uses M (M is an integer of 2 or more) pixels on the upper side of the block boundary and M pixels on the lower side of the block boundary, and the second filter being a filter that uses N (N is an integer of 2 or more) pixels on the upper side of the block boundary A filter using a large integer number of pixels and N pixels below the block boundary, the third filter using a first pixel above the block boundary and a second pixel below the block boundary, the number of the first pixels being one of a first set of candidate values, the number of the second pixels being one of a second set of candidate values, each of the first set of candidate values ​​and each of the second set of candidate values ​​being N or greater than N, and when the block boundary is at a predetermined position, the number of the first pixels is set to N.

[0008] A decoding device according to one aspect of the present disclosure comprises a circuit and a memory, the circuit using the memory to determine a filter to be used for deblocking filtering from a plurality of filters including a first filter, a second filter and a third filter, and performing the deblocking filtering on a block boundary using the determined filter, the first filter being a filter that uses M (M is an integer of 2 or more) pixels on the upper side of the block boundary and M pixels on the lower side of the block boundary, and the second filter being a filter that uses N (N is an integer of 2 or more) pixels on the upper side of the block boundary A filter using a large integer number of pixels and N pixels below the block boundary, the third filter using a first pixel above the block boundary and a second pixel below the block boundary, the number of the first pixels being one of a first set of candidate values, the number of the second pixels being one of a second set of candidate values, each of the first set of candidate values ​​and each of the second set of candidate values ​​being N or greater than N, and when the block boundary is at a predetermined position, the number of the first pixels is set to N.

[0009] These comprehensive or specific embodiments may be implemented as systems, devices, methods, integrated circuits, computer programs, or non-temporary recording media such as computer-readable CD-ROMs, or as any combination of systems, devices, methods, integrated circuits, computer programs, and recording media. [Effects of the Invention]

[0010] This disclosure can provide an encoding device, a decoding device, an encoding method, or a decoding method that can contribute to at least one of the following: improved encoding efficiency, reduced encoding / decoding processing load, reduced circuit size, improved encoding / decoding speed, and appropriate selection of components / operations such as filters, blocks, size, motion vectors, reference pictures, and reference blocks in encoding and decoding.

[0011] Note that the present disclosure also includes disclosure of configurations or methods that can provide benefits other than those described above. For example, a configuration or method that improves coding efficiency while suppressing an increase in throughput, and the like.

Brief Description of Drawings

[0012] [Figure 1] FIG. 1 is a block diagram showing a functional configuration of an encoding device according to Embodiment 1. [Figure 2] FIG. 2 is a diagram showing an example of block division in Embodiment 1. [Figure 3] FIG. 3 is a table showing conversion basis functions corresponding to each conversion type. [Figure 4A] FIG. 4A is a diagram showing an example of the shape of a filter used in ALF. [Figure 4B] FIG. 4B is a diagram showing another example of the shape of a filter used in ALF. [Figure 4C] FIG. 4C is a diagram showing another example of the shape of a filter used in ALF. [Figure 5A] FIG. 5A is a diagram showing 67 intra prediction modes in intra prediction. [Figure 5B] FIG. 5B is a flowchart for explaining an outline of prediction image correction processing by OBMC processing. [Figure 5C] FIG. 5C is a conceptual diagram for explaining an outline of prediction image correction processing by OBMC processing. [Figure 5D] FIG. 5D is a diagram showing an example of FRUC. [Figure 6] FIG. 6 is a diagram for explaining pattern matching (bilateral matching) between two blocks along a motion trajectory. <� [Figure 7] FIG. 7 is a diagram for explaining pattern matching (template matching) between a template in a current picture and a block in a reference picture. [Figure 8] FIG. 8 is a diagram for explaining a model assuming uniform linear motion. [Figure 9A]FIG. 9A is a diagram for explaining the derivation of a motion vector in units of sub-blocks based on motion vectors of a plurality of adjacent blocks. [Figure 9B] FIG. 9B is a diagram for explaining an outline of motion vector derivation processing in the merge mode. [Figure 9C] FIG. 9C is a conceptual diagram for explaining an outline of the DMVR processing. [Figure 9D] FIG. 9D is a diagram for explaining an outline of a method for generating a prediction image using a luminance correction process by the LIC process. [Figure 10] FIG. 10 is a block diagram showing a functional configuration of a decoding apparatus according to Embodiment 1. [Figure 11] FIG. 11 is a flowchart of deblocking filter processing according to Embodiment 1. [Figure 12] FIG. 12 is a diagram showing an example of filter candidates according to Embodiment 1. [Figure 13] FIG. 13 is a flowchart of a determination process of filter candidates according to the first aspect of Embodiment 1. [Figure 14] FIG. 14 is a diagram showing an example of filter candidates including an asymmetric filter according to the first aspect of Embodiment 1. [Figure 15] FIG. 15 is a flowchart of a determination process of filter candidates according to the second aspect of Embodiment 1. [Figure 16] [[ID=3०]]FIG. 16 is a diagram showing an example of filter candidates including a filter including an extrapolation process according to the second aspect of Embodiment 1. [Figure 17] FIG. 17 is a block diagram showing an implementation example of an encoding apparatus. [Figure 18] FIG. 18 is a block diagram showing an implementation example of a decoding apparatus. [Figure 19] FIG. 19 is an overall configuration diagram of a content supply system for realizing a content distribution service. [Figure 20] FIG. 20 is a diagram showing an example of an encoding structure at scalable encoding. [Figure 21]Figure 21 shows an example of an encoding structure during scalable encoding. [Figure 22] Figure 22 shows an example of how a web page is displayed. [Figure 23] Figure 23 shows an example of how a web page is displayed. [Figure 24] Figure 24 shows an example of a smartphone. [Figure 25] Figure 25 is a block diagram showing an example of a smartphone configuration. [Modes for carrying out the invention]

[0013] An encoding device according to one aspect of the present disclosure comprises a circuit and a memory, wherein the circuit uses the memory to determine a filter to be used for deblocking filtering from a plurality of filters including a first filter and a second filter, and performs the deblocking filtering on a block boundary using the determined filter, wherein the first filter is a filter that uses M (M is an integer of 2 or more) pixels on the upper side of the block boundary and M pixels on the lower side of the block boundary, the second filter is a filter that uses a first pixel on the upper side of the block boundary and a second pixel on the lower side of the block boundary, the number of the first pixels is one of a first plurality of candidate values, the number of the second pixels is one of a second plurality of candidate values, and each of the first plurality of candidate values ​​and each of the second plurality of candidate values ​​is M or a value greater than M.

[0014] According to this, the encoding device can reduce the number of pixels above or to the left of block boundaries used in the deblocking filter process, potentially reducing the amount of data held in memory. Alternatively, pixels to the left may be used instead of the upper pixels, and pixels to the right may be used instead of the lower pixels.

[0015] For example, the second filter may have the same number of pixels as the first filter, or it may have different numbers of pixels as the first filter.

[0016] For example, each of the first group of candidate values ​​and each of the second group of candidate values ​​may be 4 or a value greater than 4.

[0017] For example, among the multiple filters, filters other than the second filter may use the same number of pixels on the upper and lower sides of the block boundary.

[0018] For example, the maximum value of the number of first pixels may be limited depending on whether the position of the block boundary is a predetermined position or not.

[0019] For example, the predetermined position may be the upper end of the coding tree unit (CTU).

[0020] Furthermore, when applying the second filter to the vertical and horizontal boundaries, the limitation on the number of pixels used in the second filter may be applied only to the vertical boundary, or to both the vertical and horizontal boundaries. In other words, the predetermined position may be only the upper end of the CTU, or it may be the upper or lower end of the CTU.

[0021] For example, the predetermined position may be the upper end of the coding unit (CU).

[0022] Furthermore, when applying the second filter to the vertical and horizontal boundaries, the limitation on the number of pixels used in the second filter may be applied only to the vertical boundary, or to both the vertical and horizontal boundaries. In other words, the predetermined position may be only the upper end of the CU, or it may be the upper or lower end of the CU.

[0023] For example, the maximum value of the number of pixels in the first filter may be less than or equal to the number of pixels above the block boundary used by the filter with the second largest number of pixels used after the second filter among the plurality of filters.

[0024] For example, the maximum value of the number of the first pixels may be less than or equal to the number of pixels above the block boundary in the process that uses the most pixels above the block boundary among the processes included in the loop filtering process, including the deblocking filter process, excluding the second filter.

[0025] For example, if the number of pixels in the first filter and the number of pixels in the second filter are different, the filter tap lengths across the block boundary may be different.

[0026] For example, the second filter, when the number of first pixels and the number of second pixels are different, uses the first pixels to generate a third pixel that is continuous above the first pixels, and is a filter that uses the first pixels, the second pixels and the third pixels, and the sum of the number of first pixels and the number of third pixels may be equal to the number of second pixels.

[0027] A decoding device according to one aspect of the present disclosure comprises a circuit and a memory, the circuit using the memory to determine a filter to be used for deblocking filtering from a plurality of filters including a first filter and a second filter, and performing the deblocking filtering on a block boundary using the determined filter, wherein the first filter is a filter that uses M (M is an integer of 2 or more) pixels on the upper side of the block boundary and M pixels on the lower side of the block boundary, the second filter is a filter that uses a first pixel on the upper side of the block boundary and a second pixel on the lower side of the block boundary, the number of the first pixels is one of a first plurality of candidate values, the number of the second pixels is one of a second plurality of candidate values, and each of the first plurality of candidate values ​​and each of the second plurality of candidate values ​​is M or a value greater than M.

[0028] According to this, the decoding device can reduce the number of pixels above or to the left of block boundaries used in the deblocking filter process, which may reduce the amount of data held in memory.

[0029] For example, the second filter may have the same number of pixels as the first filter, or it may have different numbers of pixels as the first filter.

[0030] For example, each of the first group of candidate values ​​and each of the second group of candidate values ​​may be 4 or a value greater than 4.

[0031] For example, among the multiple filters, filters other than the second filter may use the same number of pixels on the upper and lower sides of the block boundary.

[0032] For example, the maximum value of the number of first pixels may be limited depending on whether the position of the block boundary is a predetermined position or not.

[0033] For example, the predetermined position may be the upper end of the coding tree unit (CTU).

[0034] Furthermore, when applying the second filter to the vertical and horizontal boundaries, the limitation on the number of pixels used in the second filter may be applied only to the vertical boundary, or to both the vertical and horizontal boundaries. In other words, the predetermined position may be only the upper end of the CTU, or it may be the upper or lower end of the CTU.

[0035] For example, the predetermined position may be the upper end of the coding unit (CU).

[0036] Furthermore, when applying the second filter to the vertical and horizontal boundaries, the limitation on the number of pixels used in the second filter may be applied only to the vertical boundary, or to both the vertical and horizontal boundaries. In other words, the predetermined position may be only the upper end of the CU, or it may be the upper or lower end of the CU.

[0037] For example, the maximum value of the number of pixels in the first filter may be less than or equal to the number of pixels above the block boundary used by the filter with the second largest number of pixels used after the second filter among the plurality of filters.

[0038] For example, the maximum value of the number of the first pixels may be less than or equal to the number of pixels above the block boundary in the process that uses the most pixels above the block boundary among the processes included in the loop filtering process, including the deblocking filter process, excluding the second filter.

[0039] For example, if the number of pixels in the first filter and the number of pixels in the second filter are different, the filter tap lengths across the block boundary may be different.

[0040] For example, the second filter, when the number of first pixels and the number of second pixels are different, uses the first pixels to generate a third pixel that is continuous above the first pixels, and is a filter that uses the first pixels, the second pixels and the third pixels, and the sum of the number of first pixels and the number of third pixels may be equal to the number of second pixels.

[0041] An encoding method according to one aspect of the present disclosure involves determining a filter to be used for deblocking filtering from a plurality of filters, including a first filter and a second filter, and performing the deblocking filtering on a block boundary using the determined filter, wherein the first filter is a filter that uses M (M is an integer of 2 or more) pixels on the upper side of the block boundary and M pixels on the lower side of the block boundary, the second filter is a filter that uses a first pixel on the upper side of the block boundary and a second pixel on the lower side of the block boundary, the number of the first pixels is one of a first plurality of candidate values, the number of the second pixels is one of a second plurality of candidate values, and each of the first plurality of candidate values ​​and each of the second plurality of candidate values ​​is M or a value greater than M.

[0042] According to this, the encoding method can reduce the number of pixels above or to the left of block boundaries used in the deblocking filter process, which may reduce the amount of data held in memory.

[0043] A decoding method according to one aspect of the present disclosure involves determining a filter to be used for deblocking filtering from a plurality of filters, including a first filter and a second filter, and performing the deblocking filtering on a block boundary using the determined filter, wherein the first filter is a filter that uses M (M is an integer of 2 or more) pixels on the upper side of the block boundary and M pixels on the lower side of the block boundary, the second filter is a filter that uses a first pixel on the upper side of the block boundary and a second pixel on the lower side of the block boundary, the number of the first pixels is one of a first plurality of candidate values, the number of the second pixels is one of a second plurality of candidate values, and each of the first plurality of candidate values ​​and each of the second plurality of candidate values ​​is M or a value greater than M.

[0044] According to this, the decoding method can reduce the number of pixels above or to the left of block boundaries used in the deblocking filter process, which may reduce the amount of data held in memory.

[0045] Furthermore, these comprehensive or specific embodiments may be implemented as systems, devices, methods, integrated circuits, computer programs, or non-temporary recording media such as computer-readable CD-ROMs, or as any combination of systems, devices, methods, integrated circuits, computer programs, and recording media.

[0046] The embodiments will be described in detail below with reference to the drawings.

[0047] The embodiments described below are all comprehensive or specific examples. The numerical values, shapes, materials, components, arrangement and connection configurations of components, steps, and the order of steps shown in the following embodiments are examples only and are not intended to limit the scope of the claims. Furthermore, among the components in the following embodiments, those not described in the independent claim representing the highest-level concept will be described as optional components.

[0048] (Embodiment 1) First, an overview of Embodiment 1 will be given as an example of an encoding and decoding device to which the processes and / or configurations described in each aspect of this disclosure, described later, can be applied. However, Embodiment 1 is merely an example of an encoding and decoding device to which the processes and / or configurations described in each aspect of this disclosure can be applied, and the processes and / or configurations described in each aspect of this disclosure can also be implemented in encoding and decoding devices different from Embodiment 1.

[0049] When applying the processes and / or configurations described in each aspect of this disclosure to Embodiment 1, for example, one of the following may be performed:

[0050] (1) With respect to the encoding or decoding device of Embodiment 1, replace the component corresponding to the component described in each aspect of the disclosure with the component described in each aspect of the disclosure, among the plurality of components constituting the encoding or decoding device. (2) With respect to the encoding or decoding device of Embodiment 1, any modifications such as adding, replacing, or deleting functions or processes performed by some of the multiple components constituting the encoding or decoding device are made, and then the components corresponding to the components described in each aspect of the Disclosure are replaced with the components described in each aspect of the Disclosure. (3) Adding processing to and / or replacing, deleting, or otherwise modifying some of the processing included in the method performed by the encoding or decoding device of Embodiment 1, and then replacing the processing corresponding to the processing described in each aspect of the Disclosure with the processing described in each aspect of the Disclosure. (4) Combining some of the multiple components constituting the encoding or decoding device of Embodiment 1 with a component described in each aspect of the Disclosure, a component that has some of the functions of the component described in each aspect of the Disclosure, or a component that performs some of the processing performed by the component described in each aspect of the Disclosure. (5) A component that has some of the functions of some of the components constituting the encoding or decoding device of Embodiment 1, or a component that performs some of the processing performed by some of the components constituting the encoding or decoding device of Embodiment 1, in combination with a component described in each aspect of this disclosure, a component that has some of the functions of the components described in each aspect of this disclosure, or a component that performs some of the processing performed by the components described in each aspect of this disclosure. (6) With respect to the method performed by the encoding or decoding device of Embodiment 1, replace with the process corresponding to the process described in each aspect of the Disclosure among the multiple processes included in the method with the process described in each aspect of the Disclosure. (7) Performing some of the processes included in the method performed by the encoding or decoding device of Embodiment 1 in combination with the processes described in each aspect of the present disclosure.

[0051] The methods of implementing the processes and / or configurations described in each aspect of this disclosure are not limited to the examples above. For example, they may be implemented in a device used for a purpose other than the video / image encoding device or video / image decoding device disclosed in Embodiment 1, or the processes and / or configurations described in each embodiment may be implemented individually. Furthermore, the processes and / or configurations described in different embodiments may be implemented in combination.

[0052] [Overview of the coding device] First, an overview of the encoding device according to Embodiment 1 will be described. Figure 1 is a block diagram showing the functional configuration of the encoding device 100 according to Embodiment 1. The encoding device 100 is a video / image encoding device that encodes video / images in block units.

[0053] As shown in Figure 1, the encoding device 100 is a device that encodes an image in block units and comprises a division unit 102, a subtraction unit 104, a transformation unit 106, a quantization unit 108, an entropy encoding unit 110, an inverse quantization unit 112, an inverse transformation unit 114, an addition unit 116, a block memory 118, a loop filter unit 120, a frame memory 122, an intra prediction unit 124, an inter prediction unit 126, and a prediction control unit 128.

[0054] The encoding device 100 can be implemented, for example, by a general-purpose processor and memory. In this case, when a software program stored in memory is executed by the processor, the processor functions as a splitting unit 102, a subtraction unit 104, a conversion unit 106, a quantization unit 108, an entropy encoding unit 110, an inverse quantization unit 112, an inverse conversion unit 114, an addition unit 116, a loop filter unit 120, an intra prediction unit 124, an inter prediction unit 126, and a prediction control unit 128. Alternatively, the encoding device 100 may be implemented as one or more dedicated electronic circuits corresponding to the splitting unit 102, a subtraction unit 104, a conversion unit 106, a quantization unit 108, an entropy encoding unit 110, an inverse quantization unit 112, an inverse conversion unit 114, an addition unit 116, a loop filter unit 120, an intra prediction unit 124, an inter prediction unit 126, and a prediction control unit 128.

[0055] The following describes each component included in the encoding device 100.

[0056] [Divided part] The splitting unit 102 divides each picture contained in the input video into multiple blocks and outputs each block to the subtraction unit 104. For example, the splitting unit 102 first divides the picture into blocks of a fixed size (e.g., 128x128). These fixed-size blocks are sometimes called coding tree units (CTUs). Then, based on recursive quadtree and / or binary tree block partitioning, the splitting unit 102 divides each of the fixed-size blocks into blocks of a variable size (e.g., 64x64 or less). These variable-size blocks are sometimes called coding units (CUs), prediction units (PUs), or transformation units (TUs). In this embodiment, CUs, PUs, and TUs do not need to be distinguished, and some or all of the blocks in the picture may become processing units for CUs, PUs, and TUs.

[0057] Figure 2 shows an example of block partitioning in Embodiment 1. In Figure 2, solid lines represent block boundaries due to quadtree block partitioning, and dashed lines represent block boundaries due to binary tree block partitioning.

[0058] Here, block 10 is a 128x128 pixel square block (128x128 block). This 128x128 block 10 is first divided into four 64x64 square blocks (quadtree block partitioning).

[0059] The top-left 64x64 block is further divided vertically into two rectangular 32x64 blocks, and the left 32x64 block is further divided vertically into two rectangular 16x64 blocks (binary tree block partitioning). As a result, the top-left 64x64 block is divided into two 16x64 blocks 11 and 12 and a 32x64 block 13.

[0060] The 64x64 block in the upper right is horizontally divided into two rectangular 64x32 blocks, 14 and 15 (binary tree block division).

[0061] The bottom-left 64x64 block is divided into four square 32x32 blocks (quadrutree block division). Of the four 32x32 blocks, the top-left and bottom-right blocks are further divided. The top-left 32x32 block is vertically divided into two rectangular 16x32 blocks, and the rightmost 16x32 block is further horizontally divided into two 16x16 blocks (binary tree block division). The bottom-right 32x32 block is horizontally divided into two 32x16 blocks (binary tree block division). As a result, the bottom-left 64x64 block is divided into 16x32 block 16, two 16x16 blocks 17 and 18, two 32x32 blocks 19 and 20, and two 32x16 blocks 21 and 22.

[0062] The 64x64 block 23 in the bottom right will not be divided.

[0063] As described above, in Figure 2, block 10 is divided into 13 variable-sized blocks 11-23 based on recursive quad-tree and binary tree block partitioning. Such partitioning is sometimes called QTBT (quad-tree plus binary tree) partitioning.

[0064] In Figure 2, one block was divided into four or two blocks (quadrutree or binary tree block partitioning), but the partitioning is not limited to these. For example, one block may be divided into three blocks (ternary tree block partitioning). Partitioning that includes such ternary tree block partitioning is sometimes called MBT (multi-type tree) partitioning.

[0065] [Subtraction Unit] The subtraction unit 104 subtracts the predicted signal (predicted sample) from the original signal (original sample) in block units divided by the division unit 102. In other words, the subtraction unit 104 calculates the prediction error (also called the residual) of the block to be encoded (hereinafter referred to as the current block). The subtraction unit 104 then outputs the calculated prediction error to the conversion unit 106.

[0066] The source signal is the input signal to the encoding device 100, and is a signal representing the image of each picture that makes up the moving image (for example, a luminance (luma) signal and two chroma (chroma) signals). In the following, the signal representing the image may also be called a sample.

[0067] [Conversion section] The conversion unit 106 converts the prediction error in the spatial domain into conversion coefficients in the frequency domain and outputs the conversion coefficients to the quantization unit 108. Specifically, the conversion unit 106 performs a predetermined discrete cosine transform (DCT) or discrete sine transform (DST) on the prediction error in the spatial domain, for example.

[0068] The transformation unit 106 may also adaptively select a transformation type from among several transformation types and use a transformation basis function corresponding to the selected transformation type to convert the prediction error into transformation coefficients. Such a transformation is sometimes called an EMT (explicit multiple core transform) or an AMT (adaptive multiple transform).

[0069] Multiple transformation types include, for example, DCT-II, DCT-V, DCT-VIII, DST-I, and DST-VII. Figure 3 is a table showing the transformation basis functions corresponding to each transformation type. In Figure 3, N represents the number of input pixels. The selection of a transformation type from among these multiple transformation types may depend, for example, on the type of prediction (intra-prediction and inter-prediction) or on the intra-prediction mode.

[0070] Information indicating whether or not to apply such EMT or AMT (e.g., called an AMT flag) and information indicating the selected conversion type are signaled at the CU level. However, the signaling of this information is not limited to the CU level and may be at other levels (e.g., sequence level, picture level, slice level, tile level, or CTU level).

[0071] Furthermore, the transformation unit 106 may retransform the transformation coefficients (transformation results). Such retransformation is sometimes called AST (adaptive secondary transform) or NSST (non-separable secondary transform). For example, the transformation unit 106 performs retransformation for each subblock (e.g., 4x4 subblock) contained in the block of transformation coefficients corresponding to the intra-prediction error. Information indicating whether or not to apply NSST and information regarding the transformation matrix used for NSST are signaled at the CU level. Note that the signaling of this information is not limited to the CU level, but may be at other levels (e.g., sequence level, picture level, slice level, tile level, or CTU level).

[0072] Here, a separable transformation is a method in which the input is separated into directions equal to the number of dimensions and transformed multiple times, while a non-separable transformation is a method in which, when the input is multidimensional, two or more dimensions are treated as one dimension and transformed together.

[0073] For example, one example of a non-separable transformation is to treat a 4x4 block as a single array with 16 elements and then perform a transformation on that array using a 16x16 transformation matrix.

[0074] Similarly, the Hypercube Givens Transform, which treats a 4x4 input block as a single array with 16 elements and then performs multiple Givens rotations on that array, is another example of a non-separable transformation.

[0075] [Quantization section] The quantization unit 108 quantizes the conversion coefficients output from the conversion unit 106. Specifically, the quantization unit 108 scans the conversion coefficients of the current block in a predetermined scanning order and quantizes the conversion coefficients based on the quantization parameter (QP) corresponding to the scanned conversion coefficients. The quantization unit 108 then outputs the quantized conversion coefficients of the current block (hereinafter referred to as quantization coefficients) to the entropy coding unit 110 and the inverse quantization unit 112.

[0076] The predetermined order is the order for quantization / inverse quantization of the transformation coefficients. For example, the predetermined scanning order is defined as ascending frequency (from low frequency to high frequency) or descending frequency (from high frequency to low frequency).

[0077] Quantization parameters are parameters that define the quantization step (quantization width). For example, if the value of the quantization parameter increases, the quantization step also increases. In other words, if the value of the quantization parameter increases, the quantization error increases.

[0078] [Entropy coding unit] The entropy coding unit 110 generates an encoded signal (encoded bitstream) by variable-length encoding the quantization coefficients, which are input from the quantization unit 108. Specifically, the entropy coding unit 110, for example, binarizes the quantization coefficients and arithmetically encodes the binary signal.

[0079] [Dequantization section] The inverse quantization unit 112 inversely quantizes the quantization coefficients, which are input from the quantization unit 108. Specifically, the inverse quantization unit 112 inversely quantizes the quantization coefficients of the current block in a predetermined scanning order. Then, the inverse quantization unit 112 outputs the inversely quantized conversion coefficients of the current block to the inverse conversion unit 114.

[0080] [Inverse Transformation Section] The inverse transform unit 114 restores the prediction error by inversely transforming the transformation coefficients, which are input from the inverse quantization unit 112. Specifically, the inverse transform unit 114 restores the prediction error of the current block by performing an inverse transform on the transformation coefficients that corresponds to the transformation by the transformation unit 106. The inverse transform unit 114 then outputs the restored prediction error to the summation unit 116.

[0081] Furthermore, the recovered prediction error does not match the prediction error calculated by the subtraction unit 104 because information is lost due to quantization. In other words, the recovered prediction error includes quantization errors.

[0082] [Addition section] The adder 116 reconstructs the current block by adding the prediction error, which is the input from the inverse transformer 114, and the prediction sample, which is the input from the prediction control unit 128. The adder 116 then outputs the reconstructed block to the block memory 118 and the loop filter unit 120. The reconstructed block is sometimes called the local decoded block.

[0083] [Block memory] The block memory 118 is a storage unit for storing blocks within the picture to be encoded (hereinafter referred to as the current picture) that are referenced in intra prediction. Specifically, the block memory 118 stores the reconstructed blocks output from the adder 116.

[0084] [Loop Filter Section] The loop filter unit 120 applies a loop filter to the block reconstructed by the adder unit 116 and outputs the filtered reconstructed block to the frame memory 122. A loop filter is a filter used within the encoding loop (in-loop filter), and includes, for example, a deblocking filter (DF), sample adaptive offset (SAO), and adaptive loop filter (ALF).

[0085] In ALF, a least-squares error filter is applied to remove coding distortion. For example, for each 2x2 subblock within the current block, one filter selected from several filters is applied based on the direction and activity of the local gradient.

[0086] Specifically, first, subblocks (e.g., 2x2 subblocks) are classified into multiple classes (e.g., 15 or 25 classes). The classification of subblocks is based on the direction and activity of the gradient. For example, a classification value C (e.g., C = 5D + A) is calculated using the gradient direction value D (e.g., 0-2 or 0-4) and the gradient activity value A (e.g., 0-4). Then, based on the classification value C, the subblocks are classified into multiple classes (e.g., 15 or 25 classes).

[0087] The gradient direction value D is derived, for example, by comparing gradients in multiple directions (e.g., horizontal, vertical, and two diagonal directions). The gradient activation value A is derived, for example, by adding the gradients in multiple directions and quantizing the sum.

[0088] Based on the results of this classification, a filter for the subblock is determined from among multiple filters.

[0089] For example, a circularly symmetric shape is used as the filter shape in ALF. Figures 4A to 4C show several examples of filter shapes used in ALF. Figure 4A shows a 5x5 diamond-shaped filter, Figure 4B shows a 7x7 diamond-shaped filter, and Figure 4C shows a 9x9 diamond-shaped filter. Information indicating the filter shape is signaled at the picture level. However, the signaling of information indicating the filter shape is not limited to the picture level and may be at other levels (e.g., sequence level, slice level, tile level, CTU level, or CU level).

[0090] The on / off status of ALF is determined, for example, at the picture level or CU level. For instance, the decision to apply ALF to luminance is made at the CU level, and the decision to apply ALF to color difference is made at the picture level. Information indicating whether ALF is on or off is signaled at the picture level or CU level. However, the signaling of information indicating whether ALF is on or off is not limited to the picture level or CU level, but may be at other levels (e.g., sequence level, slice level, tile level, or CTU level).

[0091] The coefficient sets of multiple selectable filters (e.g., up to 15 or 25 filters) are signaled at the picture level. However, the signaling of the coefficient sets is not limited to the picture level; it may be at other levels (e.g., sequence level, slice level, tile level, CTU level, CU level, or subblock level).

[0092] [Frame memory] The frame memory 122 is a storage unit for storing reference pictures used for interpretation, and is sometimes called a frame buffer. Specifically, the frame memory 122 stores the reconstructed blocks filtered by the loop filter unit 120.

[0093] [Intra Prediction Unit] The intra-prediction unit 124 generates a prediction signal (intra-prediction signal) by performing intra-prediction (also called in-screen prediction) of the current block by referring to the block in the current picture stored in the block memory 118. Specifically, the intra-prediction unit 124 generates an intra-prediction signal by performing intra-prediction by referring to samples (e.g., luminance values, color difference values) of blocks adjacent to the current block, and outputs the intra-prediction signal to the prediction control unit 128.

[0094] For example, the intra-prediction unit 124 performs intra-prediction using one of a predetermined set of intra-prediction modes. The set of intra-prediction modes includes one or more non-directional prediction modes and multiple directional prediction modes.

[0095] One or more non-directional prediction modes include, for example, the Planar prediction mode and DC prediction mode as defined in the H.265 / HEVC (High-Efficiency Video Coding) standard (Non-Patent Document 1).

[0096] Multiple directional prediction modes include, for example, the 33 directional prediction modes defined in the H.265 / HEVC standard. Note that multiple directional prediction modes may also include 32 additional directional prediction modes (a total of 65 directional prediction modes). Figure 5A shows 67 intra-prediction modes (2 non-directional prediction modes and 65 directional prediction modes) in intra-prediction. Solid arrows represent the 33 directions defined in the H.265 / HEVC standard, and dashed arrows represent the additional 32 directions.

[0097] Furthermore, in the intra-prediction of a color difference block, a luminance block may be referenced. That is, the color difference component of the current block may be predicted based on the luminance component of the current block. Such intra-prediction is sometimes called CCLM (cross-component linear model) prediction. Such an intra-prediction mode for a color difference block that references a luminance block (e.g., called the CCLM mode) may be added as one of the intra-prediction modes for a color difference block.

[0098] The intra-prediction unit 124 may correct the pixel values ​​after intra-prediction based on the gradient of the horizontal / vertical reference pixels. Intra-prediction with such correction is sometimes called PDPC (position dependent intra-prediction combination). Information indicating whether or not PDPC is applied (for example, called a PDPC flag) is signaled at, for example, the CU level. Note that the signaling of this information is not limited to the CU level, but may be at other levels (for example, sequence level, picture level, slice level, tile level, or CTU level).

[0099] [International Prediction Department] The inter-prediction unit 126 generates a prediction signal (inter-prediction signal) by performing inter-prediction (also called inter-screen prediction) of the current block by referring to a reference picture stored in the frame memory 122 that is different from the current picture. Inter-prediction is performed in units of the current block or sub-blocks within the current block (e.g., 4x4 blocks). For example, the inter-prediction unit 126 performs motion estimation within the reference picture for the current block or sub-block. Then, the inter-prediction unit 126 generates an inter-prediction signal for the current block or sub-block by performing motion compensation using motion information (e.g., motion vectors) obtained from the motion estimation. Finally, the inter-prediction unit 126 outputs the generated inter-prediction signal to the prediction control unit 128.

[0100] The motion information used for motion compensation is converted into a signal. A motion vector predictor may be used to convert the motion vector into a signal. In other words, the difference between the motion vector and the predicted motion vector may be converted into a signal.

[0101] Furthermore, an inter-prediction signal may be generated using not only the motion information of the current block obtained through motion search, but also the motion information of adjacent blocks. Specifically, an inter-prediction signal may be generated for each sub-block within the current block by weighted addition of a prediction signal based on motion information obtained through motion search and a prediction signal based on the motion information of adjacent blocks. Such inter-prediction (motion compensation) is sometimes called OBMC (overlapped block motion compensation).

[0102] In this OBMC mode, information indicating the size of the subblock for OBMC (e.g., called the OBMC block size) is signaled at the sequence level. Information indicating whether or not to apply OBMC mode (e.g., called the OBMC flag) is signaled at the CU level. Note that the signaling levels for this information are not limited to the sequence and CU levels; other levels (e.g., picture level, slice level, tile level, CTU level, or subblock level) may also be used.

[0103] Let's explain the OBMC mode in more detail. Figures 5B and 5C are flowcharts and conceptual diagrams illustrating the overview of the predictive image correction process using OBMC processing.

[0104] First, a predicted image (Pred) is obtained using normal motion compensation with the motion vector (MV) assigned to the block to be encoded.

[0105] Next, the motion vector (MV_L) of the encoded left adjacent block is applied to the block to be encoded to obtain a predicted image (Pred_L), and the first correction of the predicted image is performed by superimposing the predicted image and Pred_L with weights.

[0106] Similarly, the motion vector (MV_U) of the encoded upper adjacent block is applied to the block to be encoded to obtain a predicted image (Pred_U). The predicted image is then corrected a second time by weighting the first corrected predicted image and Pred_U, and this is used as the final predicted image.

[0107] While this explanation describes a two-stage correction method using the left adjacent block and the upper adjacent block, it is also possible to use the right adjacent block and the lower adjacent block to perform corrections more than two times.

[0108] Furthermore, the area to be superimposed does not have to be the entire pixel area of ​​the block, but rather only a portion of the area near the block boundary.

[0109] Although this explanation describes the predictive image correction process using a single reference picture, the process is similar when correcting predictive images from multiple reference pictures. After obtaining corrected predictive images from each reference picture, the resulting predictive images are superimposed to create the final predictive image.

[0110] The processing target block may be a prediction block unit, or it may be a sub-block unit obtained by further dividing the prediction block.

[0111] One method for determining whether or not to apply OBMC processing is to use an obmc_flag signal, which indicates whether or not to apply OBMC processing. Specifically, in an encoding device, it is determined whether or not the block to be encoded belongs to a region with complex motion. If it belongs to a region with complex motion, the obmc_flag is set to a value of 1 and OBMC processing is applied to perform encoding. If it does not belong to a region with complex motion, the obmc_flag is set to a value of 0 and encoding is performed without applying OBMC processing. On the other hand, in a decoding device, the obmc_flag written in the stream is decoded, and the device switches whether or not to apply OBMC processing depending on its value and performs decoding.

[0112] Furthermore, motion information may be derived by the decoder without being converted into a signal. For example, the merge mode specified in the H.265 / HEVC standard may be used. Alternatively, motion information may be derived by performing a motion search on the decoder side. In this case, the motion search is performed without using the pixel values ​​of the current block.

[0113] Here, we will explain the mode in which motion detection is performed on the decoding device side. This mode in which motion detection is performed on the decoding device side is sometimes called PMMVD (pattern matched motion vector derivation) mode or FRUC (frame rate up-conversion) mode.

[0114] An example of FRUC processing is shown in Figure 5D. First, a list of multiple candidates (which may be the same as the merge list) is generated, each having a predicted motion vector, by referencing the motion vectors of spatially or temporally adjacent encoded blocks to the current block. Next, the best candidate MV is selected from among the multiple candidate MVs registered in the candidate list. For example, an evaluation value is calculated for each candidate included in the candidate list, and one candidate is selected based on the evaluation value.

[0115] Then, based on the motion vectors of the selected candidates, a motion vector for the current block is derived. Specifically, for example, the motion vector of the selected candidate (best candidate MV) is directly derived as the motion vector for the current block. Alternatively, for example, the motion vector for the current block may be derived by performing pattern matching in the area surrounding the position in the reference picture corresponding to the motion vector of the selected candidate. That is, a similar search is performed in the area surrounding the best candidate MV, and if an MV with a better evaluation value is found, the best candidate MV may be updated to this MV and used as the final MV for the current block. It is also possible to configure the system so that this process is not performed.

[0116] The same processing method can be used when processing at the sub-block level.

[0117] The evaluation value is calculated by determining the difference value of the reconstructed image through pattern matching between a region in the reference picture corresponding to the motion vector and a predetermined region. Alternatively, the evaluation value may be calculated using information other than the difference value.

[0118] For pattern matching, either first-order pattern matching or second-order pattern matching is used. First-order pattern matching and second-order pattern matching are sometimes called bilateral matching and template matching, respectively.

[0119] In the first pattern matching, pattern matching is performed between two blocks in two different reference pictures that are aligned with the motion trajectory of the current block. Therefore, in the first pattern matching, a region in another reference picture aligned with the motion trajectory of the current block is used as a predetermined region for calculating the evaluation value of the candidate described above.

[0120] Figure 6 illustrates an example of pattern matching (bilateral matching) between two blocks along a motion trajectory. As shown in Figure 6, in the first pattern matching, two motion vectors (MV0, MV1) are derived by searching for the best-matching pair of two blocks within two different reference pictures (Ref0, Ref1) that are along the motion trajectory of the current block. Specifically, for the current block, the difference between the reconstructed image at a specified position in the first encoded reference picture (Ref0) specified by the candidate MV and the reconstructed image at a specified position in the second encoded reference picture (Ref1) specified by the symmetric MV obtained by scaling the candidate MV by the display time interval is derived, and an evaluation value is calculated using the obtained difference value. It is preferable to select the candidate MV with the best evaluation value among multiple candidate MVs as the final MV.

[0121] Under the assumption of a continuous motion trajectory, the motion vector (MV0, MV1) pointing to two reference blocks is proportional to the temporal distance (TD0, TD1) between the current picture (Cur Pic) and the two reference pictures (Ref0, Ref1). For example, if the current picture is temporally located between the two reference pictures and the temporal distances from the current picture to the two reference pictures are equal, then the first pattern matching derives a mirror-symmetric bidirectional motion vector.

[0122] In the second pattern matching, pattern matching is performed between the template in the current picture (blocks adjacent to the current block in the current picture (e.g., blocks above and / or to the left)) and the blocks in the reference picture. Therefore, in the second pattern matching, the blocks adjacent to the current block in the current picture are used as a predetermined area for calculating the evaluation value of the candidates mentioned above.

[0123] Figure 7 illustrates an example of pattern matching (template matching) between a template in the current picture and a block in the reference picture. As shown in Figure 7, in the second pattern matching, the motion vector of the current block is derived by searching in the reference picture (Ref0) for the block that best matches the block adjacent to the current block (Cur block) in the current picture (Cur Pic). Specifically, for the current block, the difference is derived between the reconstructed image of the encoded region of both or either of the left adjacent and upper adjacent regions and the reconstructed image at the equivalent position in the encoded reference picture (Ref0) specified by the candidate MV. An evaluation value is calculated using the obtained difference value, and the candidate MV with the best evaluation value among multiple candidate MVs is selected as the best candidate MV.

[0124] Information indicating whether or not to apply such a FRUC mode (e.g., called the FRUC flag) is signaled at the CU level. Furthermore, if the FRUC mode is applied (e.g., the FRUC flag is true), information indicating the pattern matching method (first pattern matching or second pattern matching) (e.g., called the FRUC mode flag) is signaled at the CU level. Note that the signaling of this information is not limited to the CU level; it may be at other levels (e.g., sequence level, picture level, slice level, tile level, CTU level, or subblock level).

[0125] Here, we will describe a mode for deriving motion vectors based on a model that assumes uniform linear motion. This mode is sometimes called the BIO (bi-directional optical flow) mode.

[0126] Figure 8 is a diagram illustrating a model that assumes uniform linear motion. In Figure 8, (v x ,v yindicates the velocity vector, and τ0 and τ1 respectively indicate the temporal distances between the current picture (Cur Pic) and the two reference pictures (Ref0, Ref1). (MVx0, MVy0) indicates the motion vector corresponding to the reference picture Ref0, and (MVx1, MVy1) indicates the motion vector corresponding to the reference picture Ref1.

[0127] At this time, under the assumption of uniform linear motion of the velocity vector (v x , v y ), (MVx0, MVy0) and (MVx1, MVy1) are respectively (v x τ0, v y τ0) and (-v x τ1, -v y τ1), and the following optical flow equation (1) holds.

[0128]

Equation

[0129] <000051​​​​​​​​​​Here, we will describe a mode in which motion vectors are derived at the sub-block level based on the motion vectors of multiple adjacent blocks. This mode is sometimes called the affine motion compensation prediction mode.

[0132] Figure 9A is a diagram illustrating the derivation of subblock-level motion vectors based on the motion vectors of multiple adjacent blocks. In Figure 9A, the current block contains 16 4x4 subblocks. Here, the motion vector v0 of the upper left corner control point of the current block is derived based on the motion vectors of the adjacent blocks, and the motion vector v1 of the upper right corner control point of the current block is derived based on the motion vectors of the adjacent subblocks. Then, using the two motion vectors v0 and v1, the motion vector (v) of each subblock within the current block is derived by the following equation (2). x ,v y ) is derived.

[0133]

number

[0134] Here, x and y represent the horizontal and vertical positions of the subblock, respectively, and w represents a predetermined weighting coefficient.

[0135] Such affine motion compensation prediction modes may include several modes in which the motion vectors of the upper-left and upper-right corner control points are derived. Information indicating such affine motion compensation prediction modes (e.g., called affine flags) is signaled at the CU level. Note that the signaling of this information indicating affine motion compensation prediction modes is not limited to the CU level, but may be at other levels (e.g., sequence level, picture level, slice level, tile level, CTU level, or subblock level).

[0136] [Prediction Control Unit] The prediction control unit 128 selects either the intra-prediction signal or the inter-prediction signal and outputs the selected signal as the prediction signal to the subtraction unit 104 and the addition unit 116.

[0137] Here, we will explain an example of deriving the motion vector of a picture to be encoded using merge mode. Figure 9B is a diagram illustrating the overview of the motion vector derivation process using merge mode.

[0138] First, a list of predicted MVs is generated, containing registered candidates for predicted MVs. Candidates for predicted MVs include spatially adjacent predicted MVs, which are the MVs of multiple encoded blocks located spatially around the block to be encoded; temporally adjacent predicted MVs, which are the MVs of nearby blocks projected onto the location of the block to be encoded in the encoded reference picture; combined predicted MVs, which are generated by combining the MV values ​​of spatially adjacent predicted MVs and temporally adjacent predicted MVs; and zero predicted MVs, which are MVs with a value of zero.

[0139] Next, one predicted MV is selected from the multiple predicted MVs registered in the predicted MV list to determine it as the MV for the block to be encoded.

[0140] Furthermore, the variable-length coding unit encodes the merge_idx signal, which indicates which predicted MV was selected, by writing it to a stream.

[0141] Note that the predicted MVs registered in the predicted MV list explained in Figure 9B are just an example, and the number of predicted MVs may differ from the number shown in the figure, the configuration may not include some of the types of predicted MVs shown in the figure, or it may include predicted MVs other than those shown in the figure.

[0142] Alternatively, the final MV may be determined by performing the DMVR process described later using the MV of the target block to be encoded derived by merge mode.

[0143] Here, we will explain an example of determining the MV using DMVR processing.

[0144] Figure 9C is a conceptual diagram illustrating the overview of DMVR processing.

[0145] First, the optimal MVP set for the block to be processed is used as a candidate MV. According to the candidate MV, reference pixels are obtained from the first reference picture, which is a processed picture in the L0 direction, and the second reference picture, which is a processed picture in the L1 direction, and a template is generated by taking the average of each reference pixel.

[0146] Next, using the template, the surrounding regions of candidate MVs for the first and second reference pictures are searched, and the MV with the lowest cost is determined as the final MV. The cost value is calculated using the difference between each pixel value of the template and each pixel value of the search region, as well as the MV value, etc.

[0147] Note that the general outline of the processing described here is basically the same for both the encoding and decoding devices.

[0148] Note that any process that can explore the vicinity of a candidate MV and derive the final MV may be used instead of the exact process described here.

[0149] Here, we will explain the mode for generating predictive images using LIC processing.

[0150] Figure 9D is a diagram illustrating the outline of a predictive image generation method using luminance correction processing by LIC processing.

[0151] First, we derive a Music Model (MV) to obtain the reference image corresponding to the block to be encoded from the reference picture, which is an encoded picture.

[0152] Next, for the block to be encoded, information indicating how the luminance values ​​have changed between the reference picture and the picture to be encoded is extracted using the luminance pixel values ​​of the left-adjacent and top-adjacent encoded surrounding reference regions, and the luminance pixel values ​​at the equivalent positions in the reference picture specified by MV, and a luminance correction parameter is calculated.

[0153] By performing brightness correction processing on the reference image within the reference picture specified in MV using the brightness correction parameter, a predicted image for the encoding target block is generated.

[0154] Note that the shape of the surrounding reference region in Figure 9D is just one example, and other shapes may be used.

[0155] Furthermore, while this explanation describes the process of generating a predicted image from a single reference picture, the process is similar when generating predicted images from multiple reference pictures. Brightness correction processing is performed on each reference image obtained from a single reference picture in the same manner before generating the predicted image.

[0156] One method for determining whether or not to apply LIC processing is to use a signal called lic_flag, which indicates whether or not to apply LIC processing. Specifically, in an encoding device, it is determined whether or not the block to be encoded belongs to a region where brightness changes occur. If it belongs to a region where brightness changes occur, the value of lic_flag is set to 1 and LIC processing is applied and encoding is performed. If it does not belong to a region where brightness changes occur, the value of lic_flag is set to 0 and encoding is performed without applying LIC processing. On the other hand, in a decoding device, the lic_flag written in the stream is decoded, and the device switches whether or not to apply LIC processing according to its value and performs decoding.

[0157] Another way to determine whether to apply LIC processing is, for example, by checking whether LIC processing has been applied to surrounding blocks. A specific example is that if the block to be encoded is in merge mode, during the MV derivation in merge mode processing, it is determined whether the surrounding encoded blocks selected were encoded with LIC processing. Based on this result, the application of LIC processing is switched, and encoding is performed accordingly. In this example, the decoding process is exactly the same.

[0158] [Overview of the decryption device] Next, an overview of a decoding device capable of decoding the encoded signal (encoded bitstream) output from the above-mentioned encoding device 100 will be described. Figure 10 is a block diagram showing the functional configuration of the decoding device 200 according to Embodiment 1. The decoding device 200 is a video / image decoding device that decodes video / images in block units.

[0159] As shown in Figure 10, the decoding device 200 includes an entropy decoding unit 202, an inverse quantization unit 204, an inverse transform unit 206, an adder unit 208, a block memory 210, a loop filter unit 212, a frame memory 214, an intra prediction unit 216, an inter prediction unit 218, and a prediction control unit 220.

[0160] The decoding device 200 can be implemented, for example, by a general-purpose processor and memory. In this case, when the software program stored in memory is executed by the processor, the processor functions as an entropy decoding unit 202, an inverse quantization unit 204, an inverse transformation unit 206, an addition unit 208, a loop filter unit 212, an intra prediction unit 216, an inter prediction unit 218, and a prediction control unit 220. Alternatively, the decoding device 200 may be implemented as one or more dedicated electronic circuits corresponding to the entropy decoding unit 202, the inverse quantization unit 204, the inverse transformation unit 206, the addition unit 208, the loop filter unit 212, the intra prediction unit 216, the inter prediction unit 218, and the prediction control unit 220.

[0161] The following describes each component included in the decoding device 200.

[0162] [Entropy Decoder] The entropy decoding unit 202 entropically decodes the encoded bitstream. Specifically, the entropy decoding unit 202 arithmetically decodes the encoded bitstream into a binary signal, for example. Then, the entropy decoding unit 202 debinarizes the binary signal. As a result, the entropy decoding unit 202 outputs the quantization coefficients in block units to the inverse quantization unit 204.

[0163] [Dequantization section] The inverse quantization unit 204 inversely quantizes the quantization coefficients of the decoded block (hereinafter referred to as the current block), which is the input from the entropy decoding unit 202. Specifically, for each quantization coefficient of the current block, the inverse quantization unit 204 inversely quantizes the quantization coefficient based on the quantization parameter corresponding to that quantization coefficient. The inverse quantization unit 204 then outputs the inversely quantized quantization coefficients (i.e., transformation coefficients) of the current block to the inverse transformation unit 206.

[0164] [Inverse Transformation Section] The inverse transform unit 206 restores the prediction error by inversely transforming the transformation coefficients, which are input from the inverse quantization unit 204.

[0165] For example, if the information decoded from the encoded bitstream indicates that EMT or AMT should be applied (e.g., the AMT flag is true), the inverse transform unit 206 inversely transforms the transformation coefficients of the current block based on the information indicating the decoded transformation type.

[0166] For example, if the information decoded from the encoded bitstream indicates that NSST should be applied, the inverse transform unit 206 applies inverse retransformation to the transformation coefficients.

[0167] [Addition section] The adder 208 reconstructs the current block by adding the prediction error, which is the input from the inverse transformer 206, and the prediction sample, which is the input from the prediction control unit 220. The adder 208 then outputs the reconstructed block to the block memory 210 and the loop filter unit 212.

[0168] [Block memory] The block memory 210 is a storage unit for storing blocks that are referenced in intra prediction and are located within the decoded picture (hereinafter referred to as the current picture). Specifically, the block memory 210 stores the reconstructed blocks output from the adder 208.

[0169] [Loop Filter Section] The loop filter unit 212 applies a loop filter to the block reconstructed by the adder unit 208 and outputs the filtered reconstructed block to the frame memory 214 and the display device, etc.

[0170] If the information interpreted from the encoded bitstream indicating ALF on / off indicates ALF is on, one filter is selected from among several filters based on the direction and activity of the local gradient, and the selected filter is applied to the reconstruction block.

[0171] [Frame memory] The frame memory 214 is a memory unit for storing reference pictures used for interpretation, and is sometimes called a frame buffer. Specifically, the frame memory 214 stores the reconstructed blocks filtered by the loop filter unit 212.

[0172] [Intra Prediction Unit] The intra-prediction unit 216 generates a prediction signal (intra-prediction signal) by performing intra-prediction based on the intra-prediction mode decoded from the encoded bitstream, and by referring to the blocks in the current picture stored in the block memory 210. Specifically, the intra-prediction unit 216 generates an intra-prediction signal by performing intra-prediction by referring to samples (e.g., luminance values, chrominance values) of blocks adjacent to the current block, and outputs the intra-prediction signal to the prediction control unit 220.

[0173] Furthermore, if an intra-prediction mode that references a luminance block is selected in the intra-prediction of a color difference block, the intra-prediction unit 216 may predict the color difference component of the current block based on the luminance component of the current block.

[0174] Furthermore, if the information decoded from the encoded bitstream indicates the application of PDPC, the intra-prediction unit 216 corrects the pixel value after intra-prediction based on the gradient of the reference pixels in the horizontal / vertical directions.

[0175] [International Prediction Department] The inter-prediction unit 218 predicts the current block by referring to a reference picture stored in the frame memory 214. Prediction is performed in units of the current block or sub-blocks within the current block (e.g., 4x4 blocks). For example, the inter-prediction unit 218 generates an inter-prediction signal for the current block or sub-block by performing motion compensation using motion information (e.g., motion vectors) decoded from the encoded bitstream, and outputs the inter-prediction signal to the prediction control unit 220.

[0176] Furthermore, if the information decoded from the encoded bitstream indicates that OBMC mode should be applied, the interpretation unit 218 generates an interpretation prediction signal using not only the motion information of the current block obtained by motion search, but also the motion information of adjacent blocks.

[0177] Furthermore, if the information decoded from the encoded bitstream indicates that FRUC mode should be applied, the interpretation unit 218 derives motion information by performing a motion search according to the pattern matching method (bilateral matching or template matching) decoded from the encoded stream. Then, the interpretation unit 218 performs motion compensation using the derived motion information.

[0178] Furthermore, when the BIO mode is applied, the inter-prediction unit 218 derives motion vectors based on a model that assumes uniform linear motion. Also, if the information decoded from the encoded bitstream indicates that the affine motion compensation prediction mode should be applied, the inter-prediction unit 218 derives motion vectors on a sub-block basis based on the motion vectors of multiple adjacent blocks.

[0179] [Prediction Control Unit] The prediction control unit 220 selects either the intra-prediction signal or the inter-prediction signal and outputs the selected signal as the prediction signal to the adder 208.

[0180] [Deblocking filter processing] Next, the deblocking filter processing performed in the encoding device 100 and decoding device 200 configured as described above will be explained in detail with reference to the drawings. In the following, the operation of the loop filter unit 120 of the encoding device 100 will be mainly explained, but the operation of the loop filter unit 212 of the decoding device 200 is similar.

[0181] As described above, when encoding an image, the encoding device 100 calculates the prediction error by subtracting the prediction signal generated by the intra-prediction unit 124 or the inter-prediction unit 126 from the original signal. The encoding device 100 generates quantization coefficients by applying orthogonal transformation and quantization processing to the prediction error. Furthermore, the encoding device 100 restores the prediction error by inverse quantization and inverse orthogonal transformation of the obtained quantization coefficients. Here, since quantization is an irreversible process, the restored prediction error has an error (quantization error) relative to the prediction error before the transformation.

[0182] The deblocking filter processing performed in the loop filter section 120 is a type of filtering process applied for purposes such as reducing quantization errors. Deblocking filtering is applied to block boundaries to remove block noise.

[0183] Figure 11 is a flowchart outlining the deblocking filter process according to this embodiment. First, the loop filter unit 120 determines whether or not to perform deblocking filter processing on the target boundary, which is the block boundary to be processed, using, for example, the pixel values ​​of pixels within the block or quantization parameters (S101). If it is determined that deblocking filter processing should be performed (Yes in S101), the loop filter unit 120 determines the filter characteristics (S102) and performs deblocking filter processing on the target boundary using the determined filter characteristics (S103).

[0184] For example, in determining the filter characteristics, the loop filter section 120 selects a filter to use from several filter candidates with different numbers of pixels used in the filter. For example, filter candidates may include a weak filter, which uses a small number of pixels; a strong filter, which uses more pixels than the weak filter; and a super-strong filter, which uses even more pixels than the strong filter.

[0185] Figure 12 shows an example of this filter candidate. For example, as shown in Figure 12, the number of pixels used for each filter may vary; a weak filter may use 3 pixels on each side of the boundary, a strong filter may use 4 pixels on each side of the boundary, and a very strong filter may use 8 pixels on each side of the boundary, or a different number of pixels may be used. Note that while examples of upper and lower block boundaries are shown here, the same applies to left and right block boundaries.

[0186] Furthermore, multiple filter candidates may include multiple filters that use the same number of pixels but have different filter characteristics due to different filter coefficients.

[0187] Note that the number of pixels used for filtering does not have to be the same as the number of pixels being filtered. For example, in a strong filter, the loop filter section 120 calculates the displacement using 4 pixels on each side of the boundary, but it may also be possible to perform filtering on 3 pixels on each side of the boundary. In other words, the number of pixels used for filtering may be greater than the number of pixels being filtered.

[0188] [First aspect of the filter candidate determination process] In the determination of the filter characteristics described above (S102), the loop filter unit 120 determines a plurality of filter candidates and selects a filter to be used for the deblocking filter processing from the plurality of determined filter candidates. The first aspect of this filter candidate determination process will be described below. Figure 13 is a flowchart showing the first aspect of the filter candidate determination process included in the deblocking filter processing by the encoding device 100 of this embodiment.

[0189] First, the loop filter unit 120 obtains the position of the target boundary, which is the block boundary to be filtered (S111). In the following, of the two blocks adjacent to the target boundary, the lower or right block will be referred to as the target block, and the upper or left block will be referred to as the adjacent block.

[0190] Next, the loop filter unit 120 determines whether the position of the target boundary is a predetermined position (S112). Here, the predetermined position may be, for example, the upper end of the CTU to which the target block belongs, or the upper or left end of the CTU to which the target block belongs, or the upper end of the CU to which the target block belongs, or the upper or left end of the CU to which the target block belongs. In other words, the predetermined position is a unit block (CTU or CU) that contains multiple blocks, and may be the upper end, upper end, or left end of the unit block to which the target block belongs.

[0191] If the target boundary is in a predetermined position (Yes in S112), the loop filter unit 120 adds an asymmetric filter to the filter candidates (S113). Specifically, the loop filter unit 120 adds an asymmetric filter to the filter candidates, replacing the filter candidate with the largest number of pixels used for filtering among the initial multiple filter candidates. Here, an asymmetric filter is a filter in which the number of pixels used for filtering is asymmetric across the boundary. In other words, an asymmetric filter is a filter in which the number of pixels used in the target block and the number of pixels used in the adjacent block are different. Specifically, an asymmetric filter is a filter in which the filter tap lengths on either side of the target boundary are different.

[0192] For example, as shown in Figure 12, if there are initial filter candidates such as a weak filter that uses 3 pixels on each side of the boundary, a strong filter that uses 4 pixels on each side of the boundary, and a very strong filter that uses 8 pixels on each side of the boundary, the loop filter unit 120 replaces the very strong filter with an asymmetric filter. That is, the loop filter unit 120 may decide which of the multiple candidate filters to use, and if the filter to be used is a very strong filter, it may decide whether or not to replace the very strong filter with an asymmetric filter.

[0193] Figure 14 shows an example of a candidate filter after replacement. For example, as shown in Figure 14, a very strong filter is replaced with a filter that uses 4 pixels and 12 pixels asymmetrically across the boundary. For example, in an asymmetric filter, the number of pixels used on the adjacent block side is less than the number of pixels used on the target block side.

[0194] Furthermore, the number of pixels on the adjacent block side used by the very strong filter shown in Figure 14 is less than the number of pixels on the adjacent block side used by the very strong filter shown in Figure 12. Also, the number of pixels on the target block side used by the very strong filter shown in Figure 14 is greater than the number of pixels on the target block side used by the very strong filter shown in Figure 12. In addition, the sum of the number of pixels on the adjacent block side and the number of pixels on the target block side used by the very strong filter shown in Figure 14 is equal to the sum of the number of pixels on the adjacent block side and the number of pixels on the target block side used by the very strong filter shown in Figure 12.

[0195] Note that the number of pixels in the target block of the asymmetric filter may be the same as the number of pixels in the target block of the filter before replacement. Also, the total number of pixels used in the asymmetric filter may be different from the total number of pixels used in the filter before replacement.

[0196] On the other hand, if the position of the target boundary is not a predetermined position (No in S112), the loop filter unit 120 does not add the asymmetric filter to the filter candidates, but instead selects a filter to use from the initial filter candidates, for example. For example, the loop filter unit 120 selects a filter to use from a plurality of filter candidates that do not include the asymmetric filter shown in Figure 12.

[0197] [Effects of the first embodiment] As described above, the configuration of the first embodiment may reduce the amount of data held in line memory. Specifically, by using an asymmetric filter, the number of pixels used in the filter can be changed, and the number of pixels stored in memory can be changed. Therefore, it may be possible to reduce the memory capacity required to store the pixel values ​​of a block.

[0198] [Second aspect of the filter candidate determination process] The second aspect of the filter candidate determination process is described below. In the first aspect, an example was described in which a filter with different tap lengths on the target block side and the adjacent block side was used as an asymmetric filter. In this aspect, a filter including extrapolation is used as the asymmetric filter.

[0199] Figure 15 is a flowchart showing a second aspect of the filter candidate determination process included in the deblocking filter process by the encoding device 100 according to this embodiment.

[0200] First, the loop filter unit 120 obtains the position of the target boundary, which is the block boundary to be filtered (S121). Next, the loop filter unit 120 determines whether the position of the target boundary is a predetermined position (S122). Here, the predetermined position may be, for example, the upper end of the CTU to which the target block belongs, or the upper or left end of the CTU to which the target block belongs, or the upper end of the CU to which the target block belongs, or the upper or left end of the CU to which the target block belongs. In other words, the predetermined position is a unit block (CTU or CU) that contains multiple blocks, and may be the upper end, upper end, or left end of the unit block to which the target block belongs.

[0201] If the target boundary is at a predetermined position (Yes in S122), the loop filter unit 120 adds a filter that includes extrapolation to the filter candidates (S123). This filter generates pixel values ​​for predetermined pixels by extrapolation processing and performs filtering using the generated pixel values. Specifically, the loop filter unit 120 adds a filter that includes extrapolation processing to the filter candidates, replacing the filter candidate with the largest number of pixels used among the multiple filter candidates. The predetermined pixels are pixels included in the adjacent block and located near the target boundary.

[0202] Here, for example, as shown in Figure 12, if there are initial filter candidates such as a weak filter that uses 3 pixels on each side of the boundary, a strong filter that uses 4 pixels on each side of the boundary, and a very strong filter that uses 8 pixels on each side of the boundary, the loop filter unit 120 replaces the very strong filter with a filter that includes extrapolation.

[0203] Figure 16 shows an example of a filter candidate after replacement. For example, as shown in Figure 16, in a filter that includes extrapolation, the loop filter unit 120 generates pixel values ​​for the four pixels above the target boundary using the pixel values ​​of the four pixels above the target boundary through extrapolation. Next, the loop filter unit 120 performs filtering using the pixel values ​​of the four pixels above the target boundary, the four pixels generated by extrapolation, and the pixel values ​​of the eight pixels below the target boundary.

[0204] Here, extrapolation refers to processes such as padding or mirroring. In padding, the pixel value of the pixel to be extrapolated is generated, for example, by copying the pixel value of an adjacent pixel. For example, in the example shown in Figure 16, the fourth pixel value from the top of the target boundary is copied. In mirroring, the multiple pixel values ​​to be extrapolated are generated by inverting and arranging the multiple pixel values ​​used for extrapolation at the boundary between the multiple pixel values ​​used for extrapolation and the multiple pixel values ​​to be extrapolated. For example, in the example shown in Figure 16, the four pixel values ​​to be extrapolated are generated by vertically inverting the four pixel values ​​from the top of the target boundary. Here, the process of filling in missing pixels in order to make the number of pixels used in the filter symmetrical across the boundary is called extrapolation, but it can also be called extrapolation, interpolation, or pixel generation.

[0205] Furthermore, the number of pixels on the adjacent block side used in the very strong filter shown in Figure 16 is less than the number of pixels on the adjacent block side used in the very strong filter shown in Figure 12. Also, the number of pixels on the target block side used in the very strong filter shown in Figure 16 is equal to the number of pixels on the target block side used in the very strong filter shown in Figure 12. In addition, the extrapolation target pixels are one or more pixels adjacent to the pixels on the adjacent block side used, on the opposite side (upper or left side) from the target boundary.

[0206] Furthermore, the filter that uses the pixel values ​​generated by extrapolation may be the same as the filter used before replacement. In other words, the filter that uses the pixel values ​​generated by extrapolation may be a filter that uses the same number of pixel values ​​on either side of the block boundary. For example, in this example, a very strong filter that uses 8 pixels on each side of the boundary, as shown in Figure 12, may be used.

[0207] On the other hand, if the position of the target boundary is not a predetermined position (No in S122), the loop filter unit 120 does not add filters including extrapolation to the filter candidates, but instead selects a filter to use from the initial filter candidates, for example. For example, the loop filter unit 120 selects a filter to use from a plurality of filter candidates that do not include the asymmetric filter shown in Figure 12.

[0208] [Effects of the second embodiment] As described above, the configuration of the second embodiment may reduce the amount of data held in line memory. Specifically, the number of pixels used for filtering can be changed using a filter that includes extrapolation. Therefore, it may be possible to reduce the memory capacity required to store the pixel values ​​of the block.

[0209] Furthermore, compared to the first embodiment, the process may be simplified because there is no need to change the filter itself.

[0210] [Differentiation] In the asymmetric filters described in the first and second embodiments, the number of pixels used on the adjacent block side (upper or left side) of the block boundary may be less than the number of pixels used on the target block side (right or lower side) of the block boundary.

[0211] For example, the number of pixels required by an asymmetric filter on the adjacent block side of a block boundary may be less than or equal to the number of pixels on the adjacent block side of a block boundary used by a filter candidate that uses fewer pixels than the filter candidate to be replaced (e.g., the very strong filter shown in Figure 12) included in the initial filter candidates (e.g., the strong filters shown in Figures 12, 14, and 16). For example, in the examples shown in Figures 12, 14, and 16, the strong filters use 4 pixels on each side of the boundary, so the number of pixels used by the asymmetric filter on the left or above side of the filter boundary is 4 pixels, which is equal to the number of pixels used by the strong filters.

[0212] Furthermore, for example, the number of pixels required on the adjacent block side of a block boundary for an asymmetric filter may be less than or equal to the number of pixels on the adjacent block side used in the process that uses the most pixels on the adjacent block side among all processes included in the loop filtering process, excluding the filter candidate before replacement (for example, the very strong filter shown in Figure 12), not limited to deblocking filters. For example, if pixels are required up to a position 6 pixels away from the filtered pixel in the ALF process, the number of pixels used on the adjacent block side of a block boundary for an asymmetric filter may be 6 pixels or less.

[0213] The above processing may be controlled by turning it on or off based on luminance (Luma) and chroma (Chroma). For example, the above processing may be applied to one of luminance and chroma, but not to the other. Alternatively, the behavior may be switched based on luminance and chroma.

[0214] Furthermore, information indicating whether or not to perform the above processing may be written in the syntax. In other words, the encoding device may generate a bitstream that includes information indicating whether or not to perform the above processing. The decoding device may decode the information indicating whether or not to perform the above processing from the bitstream and switch whether or not to perform the above processing according to the decoded information.

[0215] Furthermore, in the above explanation, the decision of whether or not to use an asymmetric filter was made when the position of the target boundary was a predetermined position. However, the decision of whether or not to use an asymmetric filter may be made by other methods. For example, the loop filter unit 120 may calculate an evaluation value based on a predetermined criterion for each of the images obtained with and without an asymmetric filter, and select the method with the higher evaluation value. For example, rate distortion (RD) optimization can be used for this evaluation.

[0216] Furthermore, in this embodiment, "the number of pixels used for filtering" may refer to all pixels used in the filtering process, or it may refer to the pixels located on one side of the boundary of the object to be filtered among the pixels used in the filtering process.

[0217] Furthermore, when the pixels used for filtering satisfy predetermined conditions, the loop filter unit 120 may replace at least one of the predetermined filter candidates with a different filter candidate, or it may add a different filter candidate to the predetermined filter candidates. In other words, in this embodiment, the loop filter unit 120 may set a predetermined filter as a candidate instead of a very strong filter, or it may add a predetermined filter to the filter candidates in addition to a very strong filter.

[0218] Furthermore, the pixels used for filtering may be, for example, pixels used for determining whether a filter should be applied, pixels used for determining the filter characteristics, or pixels to which filtering is applied.

[0219] Although the above mainly describes the operation of the loop filter unit 120 of the encoding device 100, the same operation is performed in the loop filter unit 212 of the decoding device 200.

[0220] Furthermore, not all of the processes described in this embodiment are always necessary, and only some of the processes in this embodiment may be performed.

[0221] [summary] As described above, the encoding device 100 according to this embodiment determines a filter to be used for deblocking filtering from a plurality of filters including a first filter and a second filter (S102), and performs deblocking filtering on the block boundary using the determined filter (S103). The first filter is a filter that uses M (M is an integer of 2 or more) pixels on the upper side of the block boundary and M pixels on the lower side of the block boundary, the second filter is a filter that uses a first pixel on the upper side of the block boundary and a second pixel on the lower side of the block boundary, the number of first pixels is one of the first plurality of candidate values ​​and the number of second pixels is one of the second plurality of candidate values, and each of the first plurality of candidate values ​​and each of the second plurality of candidate values ​​is M or a value greater than M.

[0222] As a result, the encoding device 100 can reduce the number of pixels above or to the left of block boundaries used for deblocking filtering, which may reduce the amount of data held in memory.

[0223] For example, the second filter may have the same number of pixels as the first filter, or it may have different numbers of pixels than the first filter.

[0224] For example, each of the first set of candidate values ​​and each of the second set of candidate values ​​are either 4 or greater than 4.

[0225] For example, among multiple filters, all filters except the second filter use the same number of pixels on the upper and lower sides of the block boundary.

[0226] For example, the encoding device 100 limits the maximum value of the number of first pixels depending on whether the block boundary is at a predetermined position or not.

[0227] For example, a predetermined position is the top end of a coding tree unit (CTU). For example, a predetermined position is the top and left end of a coding tree unit (CTU). For example, a predetermined position is the top end of a coding unit (CU). For example, a predetermined position is the top and left end of a coding unit (CU).

[0228] For example, the maximum possible number of pixels for the first filter is less than or equal to the number of pixels above the block boundary used by the filter with the second largest number of pixels used after the second filter (for example, the very strong filter shown in Figure 12).

[0229] For example, the maximum possible value for the number of first pixels is less than or equal to the number of pixels above the block boundary in the process that uses the most pixels above the block boundary among the processes included in the loop filtering process, which includes deblocking filtering, excluding the second filter (for example, the very strong filter shown in Figure 12).

[0230] For example, as described in the first embodiment, the second filter has different filter tap lengths across the block boundary when the number of pixels in the first filter and the number of pixels in the second filter are different.

[0231] For example, as described in the second embodiment, the second filter, when the number of first pixels and the number of second pixels are different, uses the first pixels to generate a third pixel that is continuous above the first pixel, and is a filter that uses the first pixel, the second pixel, and the third pixel, where the sum of the number of first pixels and the number of third pixels is equal to the number of second pixels.

[0232] Furthermore, the decoding device 200 according to this embodiment determines a filter to be used for deblocking filtering from a plurality of filters including a first filter and a second filter (S102), and performs deblocking filtering on the block boundary using the determined filter (S103). The first filter is a filter that uses M (M is an integer of 2 or more) pixels on the upper side of the block boundary and M pixels on the lower side of the block boundary, the second filter is a filter that uses a first pixel on the upper side of the block boundary and a second pixel on the lower side of the block boundary, the number of first pixels is one of the first plurality of candidate values ​​and the number of second pixels is one of the second plurality of candidate values, and each of the first plurality of candidate values ​​and each of the second plurality of candidate values ​​is M or a value greater than M.

[0233] This allows the decoding device 200 to reduce the number of pixels above or to the left of block boundaries used for deblocking filtering, potentially reducing the amount of data held in memory.

[0234] For example, the second filter may have the same number of pixels as the first filter, or it may have different numbers of pixels than the first filter.

[0235] For example, each of the first set of candidate values ​​and each of the second set of candidate values ​​are either 4 or greater than 4.

[0236] For example, among multiple filters, all filters except the second filter use the same number of pixels on the upper and lower sides of the block boundary.

[0237] For example, the decoding device 200 limits the maximum value of the number of first pixels depending on whether the block boundary is at a predetermined position or not.

[0238] For example, a predetermined position is the top end of a coding tree unit (CTU). For example, a predetermined position is the top and left end of a coding tree unit (CTU). For example, a predetermined position is the top end of a coding unit (CU). For example, a predetermined position is the top and left end of a coding unit (CU).

[0239] For example, the maximum possible number of pixels for the first filter is less than or equal to the number of pixels above the block boundary used by the filter with the second largest number of pixels used after the second filter (for example, the very strong filter shown in Figure 12).

[0240] For example, the maximum possible value for the number of first pixels is less than or equal to the number of pixels above the block boundary in the process that uses the most pixels above the block boundary among the processes included in the loop filtering process, which includes deblocking filtering, excluding the second filter (for example, the very strong filter shown in Figure 12).

[0241] For example, as described in the first embodiment, the second filter has different filter tap lengths across the block boundary when the number of pixels in the first filter and the number of pixels in the second filter are different.

[0242] For example, as described in the second embodiment, the second filter, when the number of first pixels and the number of second pixels are different, uses the first pixels to generate a third pixel that is continuous above the first pixel, and is a filter that uses the first pixel, the second pixel, and the third pixel, where the sum of the number of first pixels and the number of third pixels is equal to the number of second pixels.

[0243] Furthermore, the encoding device 100 according to this embodiment includes: a division unit 102 that divides an image into a plurality of blocks; an intra prediction unit 124 that predicts the blocks included in the image using a reference picture included in the image; an inter prediction unit 126 that predicts the blocks included in the image using a reference block included in another image different from the image; a loop filter unit 120 that applies a filter to the blocks included in the image; a conversion unit 106 that converts the prediction error between the predicted signal generated by the intra prediction unit 124 or the inter prediction unit 126 and the original signal to generate conversion coefficients; a quantization unit 108 that quantizes the conversion coefficients to generate quantization coefficients; and an entropy encoding unit 110 that generates an encoded bitstream by variable-length encoding the quantization coefficients. The loop filter unit 120 determines a filter to be used for deblocking filtering from a plurality of filters including a first filter and a second filter (S102), and performs deblocking filtering on the block boundaries using the determined filter (S103). The first filter uses M pixels (where M is an integer greater than or equal to 2) above the block boundary and M pixels below the block boundary, the second filter uses a first pixel above the block boundary and a second pixel below the block boundary, the number of first pixels is one of the first set of candidate values, the number of second pixels is one of the second set of candidate values, and each of the first set of candidate values ​​and each of the second set of candidate values ​​is either M or greater than M.

[0244] Furthermore, the decoding device 200 according to this embodiment includes a decoding unit (entropy decoding unit 202) that decodes an encoded bitstream and outputs quantization coefficients, an inverse quantization unit 204 that inversely quantizes the quantization coefficients and outputs conversion coefficients, an inverse conversion unit 206 that inversely transforms the conversion coefficients and outputs a prediction error, an intra prediction unit 216 that predicts blocks included in the image using reference pictures included in the image, an inter prediction unit 218 that predicts blocks included in the image using reference blocks included in another image different from the image, and a loop filter unit 212 that applies a filter to the blocks included in the image. The loop filter unit 212 determines a filter to be used for deblocking filtering from a plurality of filters including a first filter and a second filter (S102), and performs deblocking filtering on block boundaries using the determined filter (S103). The first filter uses M pixels (where M is an integer greater than or equal to 2) above the block boundary and M pixels below the block boundary, the second filter uses a first pixel above the block boundary and a second pixel below the block boundary, the number of first pixels is one of the first set of candidate values, the number of second pixels is one of the second set of candidate values, and each of the first set of candidate values ​​and each of the second set of candidate values ​​is either M or greater than M.

[0245] [Example of an encoding device implementation] Figure 17 is a block diagram showing an example of an implementation of the encoding device 100 according to Embodiment 1. The encoding device 100 includes a circuit 160 and a memory 162. For example, the multiple components of the encoding device 100 shown in Figure 1 are implemented by the circuit 160 and memory 162 shown in Figure 17.

[0246] Circuit 160 is an information processing circuit and is a circuit that can access memory 162. For example, circuit 160 is a dedicated or general-purpose electronic circuit for encoding moving images. Circuit 160 may also be a processor such as a CPU. Alternatively, circuit 160 may be a collection of multiple electronic circuits. Furthermore, for example, circuit 160 may play the role of multiple components of the encoding device 100 shown in Figure 1, etc., excluding the component for storing information.

[0247] Memory 162 is a dedicated or general-purpose memory in which information for the circuit 160 to encode moving images is stored. Memory 162 may be an electronic circuit, or it may be connected to circuit 160. Memory 162 may also be included in circuit 160. Memory 162 may also be a collection of multiple electronic circuits. Memory 162 may also be a magnetic disk or an optical disk, or it may be described as storage or a recording medium. Memory 162 may also be a non-volatile memory or a volatile memory.

[0248] For example, memory 162 may store the video to be encoded, or it may store a bit sequence corresponding to the encoded video. Alternatively, memory 162 may store a program for circuit 160 to encode the video.

[0249] Furthermore, for example, memory 162 may play the role of an information storage component among the multiple components of the encoding device 100 shown in Figure 1, etc. Specifically, memory 162 may play the role of block memory 118 and frame memory 122 shown in Figure 1. More specifically, reconstructed blocks and reconstructed pictures may be stored in memory 162.

[0250] Note that in the encoding device 100, not all of the plurality of components shown in FIG. 1 and the like need to be implemented, and not all of the plurality of processes described above need to be performed. Some of the plurality of components shown in FIG. 1 and the like may be included in other devices, and some of the plurality of processes described above may be executed by other devices.

[0251] [Implementation Example of Decoding Device] FIG. 18 is a block diagram showing an implementation example of the decoding device 200 according to Embodiment 1. The decoding device 200 includes a circuit 260 and a memory 262. For example, the plurality of components of the decoding device 200 shown in FIG. 10 are implemented by the circuit 260 and the memory 262 shown in FIG. 18.

[0252] The circuit 260 is a circuit that performs information processing and is a circuit that can access the memory 262. For example, the circuit 260 is a dedicated or general-purpose electronic circuit that decodes a moving image. The circuit 260 may be a processor such as a CPU. Also, the circuit 260 may be an aggregate of a plurality of electronic circuits. Further, for example, the circuit 260 may play the roles of a plurality of components of the decoding device 200 shown in FIG. 10 and the like, excluding the components for storing information.

[0253] The memory 262 is a dedicated or general-purpose memory in which information for the circuit 260 to decode a moving image is stored. The memory 262 may be an electronic circuit and may be connected to the circuit 260. Also, the memory 262 may be included in the circuit 260. Also, the memory 262 may be an aggregate of a plurality of electronic circuits. Further, the memory 262 may be a magnetic disk, an optical disk, or the like, or may be expressed as a storage or a recording medium or the like. Also, the memory 262 may be a non-volatile memory or a volatile memory.

[0254] For example, the memory 262 may store a bit string corresponding to the encoded moving image, or may store a moving image corresponding to the decoded bit string. Also, the memory 262 may store a program for the circuit 260 to decode a moving image.

[0255] Furthermore, for example, memory 262 may play the role of an information storage component among the multiple components of the decoding device 200 shown in Figure 10, etc. Specifically, memory 262 may play the role of block memory 210 and frame memory 214 shown in Figure 10. More specifically, reconstructed blocks and reconstructed pictures, etc., may be stored in memory 262.

[0256] Furthermore, the decoding device 200 does not necessarily have to implement all of the components shown in Figure 10, etc., nor does it have to perform all of the processes described above. Some of the components shown in Figure 10, etc., may be included in other devices, and some of the processes described above may be performed by other devices.

[0257] [supplement] Furthermore, the encoding device 100 and decoding device 200 in this embodiment may be used as an image encoding device and an image decoding device, respectively, or as a video encoding device and a video decoding device.

[0258] Furthermore, in this embodiment, each component may be implemented by being composed of dedicated hardware or by executing a software program suitable for each component. Each component may also be implemented by a program execution unit such as a CPU or processor reading and executing a software program recorded on a recording medium such as a hard disk or semiconductor memory.

[0259] Specifically, each of the encoding device 100 and the decoding device 200 may include a processing circuitry and a storage device electrically connected to and accessible from the processing circuitry. For example, the processing circuitry corresponds to circuit 160 or 260, and the storage device corresponds to memory 162 or 262.

[0260] The processing circuit includes at least one of dedicated hardware and a program execution unit, and performs processing using a memory device. Furthermore, if the processing circuit includes a program execution unit, the memory device stores the software program executed by that program execution unit.

[0261] Here, the software that implements the encoding device 100 or decoding device 200, etc., in this embodiment is the following program.

[0262] Furthermore, each component may be a circuit, as described above. These circuits may form a single circuit as a whole, or they may be separate circuits. Also, each component may be implemented using a general-purpose processor, or it may be implemented using a dedicated processor.

[0263] Furthermore, a process performed by one component may be performed by another component. Also, the order in which processes are executed may be changed, and multiple processes may be executed in parallel. Additionally, the encoding / decoding device may comprise an encoding device 100 and a decoding device 200.

[0264] Although the embodiments of the encoding device 100 and the decoding device 200 have been described above based on these embodiments, the embodiments of the encoding device 100 and the decoding device 200 are not limited to these embodiments. Without departing from the spirit of this disclosure, various modifications that a person skilled in the art could conceive of are applied to these embodiments, and configurations constructed by combining components from different embodiments may also be included within the scope of the embodiments of the encoding device 100 and the decoding device 200.

[0265] This embodiment may be implemented in combination with at least some of the other embodiments of this disclosure. Furthermore, some of the processes, some of the configurations of the apparatus, some of the syntax, etc., described in the flowchart of this embodiment may be implemented in combination with the other embodiments.

[0266] (Embodiment 2) In each of the above embodiments, each functional block can typically be implemented by an MPU and memory, etc. Furthermore, the processing performed by each functional block is typically implemented by a program execution unit such as a processor reading and executing software (program) recorded on a recording medium such as ROM. This software may be distributed by download, etc., or it may be recorded on a recording medium such as semiconductor memory and distributed. Of course, it is also possible to implement each functional block by hardware (dedicated circuitry).

[0267] Furthermore, the processing described in each embodiment may be implemented by centralized processing using a single device (system), or by distributed processing using multiple devices. Also, the processor executing the above program may be one or multiple. In other words, centralized processing may be performed, or distributed processing may be performed.

[0268] The embodiments of this disclosure are not limited to those described above, and various modifications are possible, which are also included within the scope of the embodiments of this disclosure.

[0269] Furthermore, here we will describe application examples of the video encoding method (image encoding method) or video decoding method (image decoding method) shown in each of the above embodiments, and a system using the same. The system is characterized by having an image encoding device using the image encoding method, an image decoding device using the image decoding method, and an image encoding and decoding device that includes both. Other configurations in the system can be appropriately modified as needed.

[0270] [Usage example] Figure 19 shows the overall configuration of the content supply system ex100 that realizes the content distribution service. The communication service area is divided into desired sizes, and fixed radio stations, base stations ex106, ex107, ex108, ex109, and ex110, are installed in each cell.

[0271] In this content supply system ex100, devices such as computer ex111, game console ex112, camera ex113, home appliance ex114, and smartphone ex115 are connected to the Internet ex101 via Internet service provider ex102 or communication network ex104 and base stations ex106 - ex110. The content supply system ex100 may be connected by combining any of the above elements. The devices may be directly or indirectly connected to each other via a telephone network or short - range wireless, etc., without passing through base stations ex106 - ex110 which are fixed wireless stations. Also, streaming server ex103 is connected to devices such as computer ex111, game console ex112, camera ex113, home appliance ex114, and smartphone ex115 via Internet ex101, etc. Further, streaming server ex103 is connected to terminals within a hotspot in an airplane ex117 via satellite ex116.

[0272] Note that a wireless access point or hotspot, etc. may be used instead of base stations ex106 - ex110. Also, streaming server ex103 may be directly connected to communication network ex104 without passing through Internet ex101 or Internet service provider ex102, or may be directly connected to airplane ex117 without passing through satellite ex116.

[0273] Camera ex113 is a device capable of taking still pictures and videos, such as a digital camera. Also, smartphone ex115 is a smartphone device, mobile phone, or PHS (Personal Handyphone System), etc. that generally supports the mobile communication system methods called 2G, 3G, 3.9G, 4G, and in the future 5G.

[0274] Home appliance ex118 is a device such as a refrigerator or a device included in a household fuel cell cogeneration system.

[0275] In the content supply system ex100, live streaming becomes possible when a terminal with a shooting function is connected to the streaming server ex103 via a base station ex106 or the like. In live streaming, the terminal (computer ex111, game console ex112, camera ex113, home appliance ex114, smartphone ex115, and terminal inside an airplane ex117, etc.) performs the encoding process described in each of the above embodiments on still images or video content captured by the user using the terminal, multiplexes the video data obtained by encoding with sound data encoded from the sound corresponding to the video, and transmits the obtained data to the streaming server ex103. In other words, each terminal functions as an image encoding device according to one aspect of this disclosure.

[0276] Meanwhile, the streaming server ex103 streams the content data sent to the requesting client. The client is a computer ex111, a game console ex112, a camera ex113, a home appliance ex114, a smartphone ex115, or a terminal on an airplane ex117, etc., that is capable of decoding the encoded data. Each device that receives the distributed data decodes and plays back the received data. That is, each device functions as an image decoding device according to one aspect of this disclosure.

[0277] [Distributed Processing] Furthermore, the streaming server ex103 may consist of multiple servers or computers that distribute data processing, recording, and distribution. For example, the streaming server ex103 may be implemented using a CDN (Content Delivery Network), where content delivery is achieved through a network connecting numerous edge servers distributed worldwide. In a CDN, the physically closest edge server is dynamically assigned depending on the client. Latency can be reduced by caching and delivering content to the edge server. In addition, if an error occurs or the communication state changes due to an increase in traffic, processing can be distributed among multiple edge servers, the delivery entity can be switched to another edge server, or delivery can be continued by bypassing the failed part of the network, thus enabling high-speed and stable delivery.

[0278] Furthermore, beyond the distributed processing of the distribution itself, the encoding process of the captured data can be performed on each terminal, on the server side, or shared among them. For example, encoding generally involves two processing loops. In the first loop, the complexity or code amount of the image at the frame or scene level is detected. In the second loop, processing is performed to improve encoding efficiency while maintaining image quality. For example, if the terminal performs the first encoding process and the server that receives the content performs the second encoding process, it is possible to improve the quality and efficiency of the content while reducing the processing load on each terminal. In this case, if there is a request to receive and decode near real time, the first encoded data from the terminal can be received and played back on other terminals, enabling more flexible real-time distribution.

[0279] Another example is the camera ex113, which extracts features from an image, compresses the feature data as metadata, and sends it to the server. The server performs compression according to the meaning of the image, for example, by determining the importance of an object from the features and switching the quantization precision. Feature data is particularly effective in improving the accuracy and efficiency of motion vector prediction during further compression on the server. Alternatively, a simple encoding such as VLC (Variable Length Coding) may be performed on the terminal, and a more computationally intensive encoding such as CABAC (Context-Adaptive Binary Arithmetic Coding) may be performed on the server.

[0280] Another example is a scenario in a stadium, shopping mall, or factory where multiple video data sets of nearly identical scenes may exist, captured by multiple terminals. In such cases, the encoding process is distributed among the multiple terminals that captured the footage, along with other terminals and servers as needed, by assigning encoding tasks to each unit, for example, at the Group of Picture (GOP) level, picture level, or tile level (a division of a picture). This reduces latency and enables more real-time performance.

[0281] Furthermore, since multiple video data sets depict essentially the same scene, the server may manage and / or instruct the video data captured by each terminal to reference each other. Alternatively, the server may receive the encoded data from each terminal, change the reference relationships between the multiple data sets, or correct or replace the pictures themselves and re-encode them. This allows for the creation of a stream with improved quality and efficiency for each individual data set.

[0282] Furthermore, the server may transcode the video data to change its encoding method before distributing it. For example, the server may convert an MPEG-based encoding method to a VP-based encoding method, or convert H.264 to H.265.

[0283] Thus, the encoding process can be performed by a terminal or one or more servers. Therefore, in the following, the terms "server" or "terminal" will be used to refer to the entity performing the processing, but some or all of the processing performed by the server may be performed by the terminal, and some or all of the processing performed by the terminal may be performed by the server. The same applies to the decoding process.

[0284] [3D, Multi-angle] In recent years, it has become increasingly common to integrate and utilize images or videos of different scenes, or the same scene, captured from different angles, using multiple cameras ex113 and / or smartphones ex115, which are nearly synchronized with each other. The videos captured by each device are integrated based on the relative positional relationship between the devices, or on areas where feature points contained in the videos coincide, which are acquired separately.

[0285] The server may not only encode 2D video but also encode still images automatically based on scene analysis of the video, or at a time specified by the user, and send them to the receiving terminal. Furthermore, if the server can obtain the relative positional relationship between the shooting terminals, it can generate a 3D shape of the scene based not only on 2D video but also on video of the same scene taken from different angles. The server may also separately encode 3D data generated by a point cloud, or it may select or reconstruct video to send to the receiving terminal from video taken by multiple terminals based on the results of recognizing or tracking a person or object using the 3D data.

[0286] In this way, users can enjoy scenes by arbitrarily selecting each video corresponding to each shooting terminal, or they can enjoy content in which video from an arbitrary viewpoint is extracted from 3D data reconstructed using multiple images or videos. Furthermore, just like the video, sound can also be collected from multiple different angles, and the server may multiplex and transmit sound from a specific angle or space in conjunction with the video.

[0287] In recent years, content that links the real world with a virtual world, such as Virtual Reality (VR) and Augmented Reality (AR), has also become popular. In the case of VR images, the server may create separate viewpoint images for the right and left eyes and perform encoding that allows referencing between the viewpoint images using Multi-View Coding (MVC), or it may encode them as separate streams without referencing each other. When decoding the separate streams, it is advisable to synchronize playback so that the virtual 3D space is reproduced according to the user's viewpoint.

[0288] In the case of AR images, the server superimposes virtual object information from the virtual space onto camera information from the real space, based on its three-dimensional position or the user's viewpoint movement. The decoding device may acquire or store the virtual object information and three-dimensional data, generate a two-dimensional image according to the user's viewpoint movement, and create superimposed data by smoothly stitching them together. Alternatively, the decoding device may send the user's viewpoint movement to the server in addition to requesting virtual object information, and the server may create superimposed data from the three-dimensional data held by the server according to the received viewpoint movement, encode the superimposed data, and distribute it to the decoding device. The superimposed data may have an α value indicating transparency in addition to RGB, and the server may set the α value of parts other than the object created from the three-dimensional data to 0, etc., so that those parts are transparent, and encode the data. Alternatively, the server may set a predetermined RGB value to the background, like chroma keying, and generate data in which parts other than the object are the background color.

[0289] Similarly, the decryption process of the distributed data can be performed on each client terminal, on the server side, or shared between them. For example, one terminal may send a reception request to the server, and other terminals may receive the content corresponding to that request, perform the decryption process, and then transmit the decrypted signal to a device with a display. By distributing the processing and selecting appropriate content regardless of the performance of the communication-capable terminals themselves, it is possible to play back data with good image quality. Another example is that while receiving large image data on a TV or similar device, a portion of the picture, such as tiles, may be decrypted and displayed on the viewer's personal terminal. This allows for sharing the overall picture while allowing users to check their own area of ​​responsibility or areas they want to examine in more detail on their own device.

[0290] In the future, it is expected that content will be seamlessly received by switching appropriate data for the connected communication, using distribution system standards such as MPEG-DASH, in situations where multiple short-range, medium-range, or long-range wireless communications are available both indoors and outdoors. This will allow users to freely select and switch in real time between decoding devices or display devices, such as displays installed indoors or outdoors, as well as their own terminals. Furthermore, decoding can be performed while switching between the decoding terminal and the display terminal based on the user's location information. This will make it possible to display map information on the wall or part of the ground of an adjacent building with a displayable device embedded, while traveling to a destination. It will also be possible to switch the bitrate of the received data based on the ease of access to the encoded data on the network, such as when the encoded data is cached on a server that can be accessed quickly from the receiving terminal, or copied to an edge server in the content delivery service.

[0291] [Scalable encoding] Regarding content switching, we will explain using a scalable stream compressed and encoded using the video encoding method described in each of the embodiments above, as shown in Figure 20. The server may have multiple streams with the same content but different qualities as individual streams, but it may also be configured to switch content by taking advantage of the characteristics of a temporally / spatially scalable stream realized by encoding it in layers, as shown in the figure. In other words, the decoding side can freely switch between decoding low-resolution and high-resolution content by deciding which layer to decode according to internal factors such as performance and external factors such as the state of the communication bandwidth. For example, if you want to watch the rest of a video that you were watching on your smartphone ex115 while traveling, on a device such as an internet TV when you get home, that device only needs to decode the same stream to a different layer, thus reducing the burden on the server.

[0292] Furthermore, in addition to the configuration described above, in which pictures are encoded for each layer and an enhancement layer exists above the base layer to achieve scalability, the enhancement layer may include metadata based on statistical information of the image, and the decoding side may generate high-quality content by super-resolution the picture in the base layer based on the metadata. Super-resolution may refer to either an improvement in the signal-to-noise ratio at the same resolution or an increase in resolution. The metadata may include information for identifying linear or nonlinear filter coefficients used in the super-resolution process, or information for identifying parameter values ​​in the filtering process, machine learning, or least-squares operation used in the super-resolution process.

[0293] Alternatively, the picture may be divided into tiles or similar structures according to the meaning of objects within the image, and the decoding side may select tiles to decode, thereby decoding only a portion of the area. Furthermore, by storing the attributes of objects (people, cars, balls, etc.) and their positions within the image (coordinate positions within the same image, etc.) as metadata, the decoding side can identify the location of a desired object based on the metadata and determine the tile containing that object. For example, as shown in Figure 21, the metadata is stored using a data storage structure different from pixel data, such as the SEI message in HEVC. This metadata indicates, for example, the position, size, or color of the main object.

[0294] Furthermore, metadata may be stored in units consisting of multiple pictures, such as streams, sequences, or random access units. This allows the decryption side to obtain information such as the time when a specific person appears in the video, and by combining this with the picture-level information, it can identify the picture in which the object exists and the object's position within that picture.

[0295] [Web page optimization] Figure 22 shows an example of a web page display screen on a computer ex111, etc. Figure 23 shows an example of a web page display screen on a smartphone ex115, etc. As shown in Figures 22 and 23, a web page may contain multiple linked images, which are links to image content, and their appearance will differ depending on the viewing device. When multiple linked images are visible on the screen, the display device (decoder) will display still images or I-pictures of each content as linked images, display video such as a GIF animation using multiple still images or I-pictures, or receive only the base layer and decode and display the video, until the user explicitly selects a linked image, or until the linked image approaches the center of the screen or the entire linked image is within the screen.

[0296] When a linked image is selected by the user, the display device prioritizes decoding the base layer. If the HTML of the web page contains information indicating that the content is scalable, the display device may decode up to the enhancement layer. Furthermore, to ensure real-time performance, before selection or when bandwidth is very limited, the display device can decode and display only forward-referenced pictures (I-pictures, P-pictures, and B-pictures that only use forward references), thereby reducing the delay between the decoding time and display time of the first picture (the delay from the start of content decoding to the start of display). Alternatively, the display device may deliberately ignore the reference relationships between pictures and roughly decode all B-pictures and P-pictures using forward references, then perform normal decoding as time passes and more pictures are received.

[0297] [Autonomous driving] Furthermore, when transmitting and receiving still images or video data such as 2D or 3D map information for autonomous driving or driving assistance of a vehicle, the receiving terminal may receive metadata such as weather or construction information in addition to image data belonging to one or more layers, and decode these in association with each other. The metadata may belong to a layer, or it may simply be multiplexed with the image data.

[0298] In this case, since the vehicle, drone, or airplane containing the receiving terminal is in motion, the receiving terminal can transmit its location information when a reception request is made, enabling seamless reception and decoding while switching between base stations ex106 to ex110. Furthermore, the receiving terminal can dynamically switch how much metadata is received or how much map information is updated, depending on the user's selection, the user's situation, or the state of the communication bandwidth.

[0299] As described above, the content supply system ex100 allows the client to receive, decode, and play back encoded information transmitted by the user in real time.

[0300] [Distribution of personal content] Furthermore, the ex100 content delivery system allows for unicast or multicast distribution of not only high-definition, long-duration content from video distribution companies, but also low-definition, short-duration content from individuals. It is also expected that the amount of such individual content will continue to increase. To improve the quality of individual content, the server may perform editing before encoding. This can be achieved, for example, with the following configuration.

[0301] During shooting, or after shooting, the server performs recognition processing such as detecting shooting errors, searching for scenes, analyzing semantics, and detecting objects from the original images or encoded data in real time. Based on the recognition results, the server manually or automatically edits the images, correcting out-of-focus or shaky images, deleting less important scenes such as those with lower brightness or out of focus compared to other pictures, emphasizing object edges, and changing color tones. The server then encodes the edited data based on the editing results. It is also known that viewership decreases if the shooting time is too long, so the server may automatically clip scenes with little movement, as well as less important scenes, based on the image processing results, to ensure that the content falls within a specific time range according to the shooting time. Alternatively, the server may generate and encode a digest based on the results of the semantic analysis of the scenes.

[0302] Furthermore, personal content may contain elements that infringe on copyright, moral rights, or portrait rights, and the scope of sharing may exceed the intended scope, which can be inconvenient for the individual. Therefore, for example, the server may intentionally change the image to one that is out of focus, such as the faces of people at the edges of the screen or the interior of a house, before encoding. The server may also recognize whether the face of a person other than those previously registered is visible in the image to be encoded, and if so, it may apply a mosaic effect to the face. Alternatively, as a pre- or post-processing step before encoding, the user can specify a person or background area that they want to process from a copyright perspective, and the server can replace the specified area with a different image or blur the focus. In the case of a person, the server can track the person in a video and replace the image of their face.

[0303] Furthermore, because viewing personal content with small data volumes requires real-time processing, depending on the bandwidth, the decoder prioritizes receiving, decoding, and playing the base layer first. During this time, the decoder can receive the enhancement layer, and if playback is looped or if the content is played more than once, it may play the high-quality video including the enhancement layer. With a stream that uses this scalable encoding, it is possible to provide an experience where the video is rough when unselected or at the beginning of viewing, but gradually the stream becomes smarter and the image quality improves. In addition to scalable encoding, a similar experience can be provided even if the rough stream played the first time and the second stream encoded by referencing the first video are configured as a single stream.

[0304] [Other usage examples] Furthermore, these encoding or decoding processes are generally performed by the LSIex500 present in each terminal. The LSIex500 may be a single chip or a multi-chip configuration. Alternatively, video encoding or decoding software may be embedded in some recording medium (such as a CD-ROM, flexible disk, or hard disk) that can be read by a computer ex111, and the encoding or decoding process may be performed using that software. In addition, if the smartphone ex115 has a camera, video data acquired by that camera may be transmitted. In this case, the video data is data encoded by the LSIex500 present in the smartphone ex115.

[0305] The LSIex500 may also be configured to be activated by downloading application software. In this case, the terminal first determines whether it supports the content encoding method or whether it has the capability to perform the specific service. If the terminal does not support the content encoding method or does not have the capability to perform the specific service, the terminal downloads the codec or application software, and then acquires and plays the content.

[0306] Furthermore, not only the content supply system ex100 via the Internet ex101, but also digital broadcasting systems can incorporate at least one of the video encoding device (image encoding device) or video decoding device (image decoding device) of each of the above embodiments. While the content supply system ex100 has a configuration that is more suited to multicast than unicast, as it transmits and receives multiplexed data with video and sound multiplexed onto broadcast radio waves using satellites, etc., the encoding and decoding processes are similar and can be applied in the same way.

[0307] [Hardware configuration] Figure 24 shows the smartphone ex115. Figure 25 shows an example of the configuration of the smartphone ex115. The smartphone ex115 includes an antenna ex450 for transmitting and receiving radio waves with the base station ex110, a camera unit ex465 capable of taking video and still images, and a display unit ex458 that displays video captured by the camera unit ex465 and data decoded from video received by the antenna ex450. The smartphone ex115 further includes an operation unit ex466, which is a touch panel, an audio output unit ex457, which is a speaker for outputting voice or sound, an audio input unit ex456, which is a microphone for inputting voice, a memory unit ex467 capable of storing captured video or still images, recorded audio, received video or still images, encoded data such as emails, or decoded data, and a slot unit ex464, which is an interface unit with SIM ex468 for identifying the user and authenticating access to various data, including the network. External memory may be used instead of the memory unit ex467.

[0308] Furthermore, the main control unit ex460, which comprehensively controls the display unit ex458 and the operation unit ex466, is connected via the bus ex470 to the power supply circuit unit ex461, the operation input control unit ex462, the video signal processing unit ex455, the camera interface unit ex463, the display control unit ex459, the modulation / demodulation unit ex452, the multiplexing / decompression unit ex453, the audio signal processing unit ex454, the slot unit ex464, and the memory unit ex467.

[0309] The power supply circuit unit ex461, when the power key is turned on by the user, supplies power from the battery pack to each component, thereby starting up the smartphone ex115 and making it operational.

[0310] The smartphone ex115 performs tasks such as phone calls and data communication based on the control of the main control unit ex460, which has a CPU, ROM, RAM, etc. During a call, the audio signal picked up by the audio input unit ex456 is converted into a digital audio signal by the audio signal processing unit ex454, which is then subjected to spread spectrum processing by the modulation / demodulation unit ex452, and after digital-to-analog conversion and frequency conversion processing by the transmission / reception unit ex451, it is transmitted via the antenna ex450. Similarly, received data is amplified, subjected to frequency conversion and analog-to-digital conversion processing, despread spectrum processing by the modulation / demodulation unit ex452, converted into an analog audio signal by the audio signal processing unit ex454, and then output from the audio output unit ex457. In data communication mode, text, still images, or video data are sent to the main control unit ex460 via the operation input control unit ex462 by the operation unit ex466 of the main unit, and transmission and reception processing is performed in the same manner. When transmitting video, still images, or video and audio in data communication mode, the video signal processing unit ex455 compresses and encodes the video signal stored in the memory unit ex467 or the video signal input from the camera unit ex465 using the video encoding method shown in each of the above embodiments, and sends the encoded video data to the multiplexing / decoding unit ex453. The audio signal processing unit ex454 encodes the audio signal picked up by the audio input unit ex456 while the camera unit ex465 is capturing video or still images, and sends the encoded audio data to the multiplexing / decoding unit ex453. The multiplexing / decoding unit ex453 multiplexes the encoded video data and encoded audio data in a predetermined manner, performs modulation and conversion processing in the modulation / demodulation unit (modulation / demodulation circuit unit) ex452 and the transmission / reception unit ex451, and transmits the data via the antenna ex450.

[0311] When receiving video attached to an email or chat, or video linked to a webpage, etc., the multiplexing / decomposition unit ex453 separates the multiplexed data received via antenna ex450 to decode the multiplexed data, dividing it into a video data bitstream and an audio data bitstream. It then supplies the encoded video data to the video signal processing unit ex455 and the encoded audio data to the audio signal processing unit ex454 via the synchronization bus ex470. The video signal processing unit ex455 decodes the video signal using a video decoding method corresponding to the video encoding method shown in each embodiment above, and displays the video or still image contained in the linked video file from the display unit ex458 via the display control unit ex459. The audio signal processing unit ex454 decodes the audio signal, and audio is output from the audio output unit ex457. However, since real-time streaming is widespread, there may be situations where audio playback is socially inappropriate depending on the user's circumstances. Therefore, as an initial setting, it is preferable to have a configuration that plays only video data and not audio signals. Audio may be synchronized and played only when the user performs an action, such as clicking on video data.

[0312] Furthermore, although the smartphone ex115 was used as an example here, there are three possible implementation formats for terminals: a transceiver-type terminal that has both an encoder and a decoder, a transmitting terminal that has only an encoder, and a receiving terminal that has only a decoder. In addition, although it was explained that multiplexed data, in which audio data etc. is multiplexed with video data, is received or transmitted in a digital broadcasting system, the multiplexed data may also include text data related to the video in addition to audio data, or the video data itself may be received or transmitted instead of multiplexed data.

[0313] Although it was explained that the main control unit ex460, including the CPU, controls the encoding or decoding process, terminals often also have a GPU. Therefore, a configuration that leverages the GPU's performance to process a wide area at once using memory shared by the CPU and GPU, or memory whose addresses are managed so that it can be used in common, is also possible. This can shorten the encoding time, ensure real-time performance, and achieve low latency. In particular, it is efficient to perform motion detection, deblocking filters, SAO (Sample Adaptive Offset), and transformation / quantization processes at once on the GPU, rather than on the CPU, in units such as pictures.

[0314] This embodiment may be implemented in combination with at least some of the other embodiments of this disclosure. Furthermore, some of the processes, some of the configurations of the apparatus, some of the syntax, etc., described in the flowchart of this embodiment may be implemented in combination with the other embodiments. [Industrial applicability]

[0315] This disclosure can be used, for example, in television receivers, digital video recorders, car navigation systems, mobile phones, digital cameras, digital video cameras, video conferencing systems, or electronic mirrors. [Explanation of Symbols]

[0316] 100 Encoding device 102 Division 104 Subtraction Unit 106 Conversion Unit 108 Quantization section 110 Entropy coding unit 112, 204 Inverse quantization section 114, 206 Inverse Transform Section 116, 208 Addition section 118, 210 block memory 120, 212 Loop filter section 122,214 frame memory 124, 216 Intra Prediction Unit 126, 218 Interpretation Unit 128, 220 Prediction Control Unit 160, 260 circuits 162,262 memory 200 Decoders 202 Entropy Decoder

Claims

1. Circuits and, Equipped with memory, The circuit uses the memory, From a plurality of filters, including the first filter, the second filter, and the third filter, the filter to be used for the deblocking filtering process is determined. Using the determined filter, the deblocking filter process is performed on the block boundary. The first filter described above is a filter that uses M pixels (where M is an integer of 2 or more) on the upper side of the block boundary and M pixels on the lower side of the block boundary, The second filter described above is a filter that uses N pixels (where N is an integer greater than M) on the upper side of the block boundary and N pixels on the lower side of the block boundary, The third filter described above is a filter that uses the first pixel on the upper side of the block boundary and the second pixel on the lower side of the block boundary, The number of the first pixels is one of the first group of candidate values, The number of the second pixels is one of the second set of candidate values. Each of the first set of candidate values ​​and each of the second set of candidate values ​​are N or a value greater than N. When the block boundary is at a predetermined position, the number of the first pixels is N. Encoding device.

2. Circuits and, Equipped with memory, The circuit uses the memory, From a plurality of filters, including the first filter, the second filter, and the third filter, the filter to be used for the deblocking filtering process is determined. Using the determined filter, the deblocking filter process is performed on the block boundary. The first filter described above is a filter that uses M pixels (where M is an integer of 2 or more) on the upper side of the block boundary and M pixels on the lower side of the block boundary, The second filter described above is a filter that uses N pixels (where N is an integer greater than M) on the upper side of the block boundary and N pixels on the lower side of the block boundary, The third filter described above is a filter that uses the first pixel on the upper side of the block boundary and the second pixel on the lower side of the block boundary, The number of the first pixels is one of the first group of candidate values, The number of the second pixels is one of the second set of candidate values. Each of the first set of candidate values ​​and each of the second set of candidate values ​​are N or a value greater than N. When the block boundary is at a predetermined position, the number of the first pixels is N. Decoding device.

Images