WO2019069902A1 - Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage - Google Patents

Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage Download PDF

Info

Publication number
WO2019069902A1
WO2019069902A1 PCT/JP2018/036833 JP2018036833W WO2019069902A1 WO 2019069902 A1 WO2019069902 A1 WO 2019069902A1 JP 2018036833 W JP2018036833 W JP 2018036833W WO 2019069902 A1 WO2019069902 A1 WO 2019069902A1
Authority
WO
WIPO (PCT)
Prior art keywords
picture
probability parameter
pictures
unit
decoding
Prior art date
Application number
PCT/JP2018/036833
Other languages
English (en)
Japanese (ja)
Inventor
西　孝啓
遠間　正真
安倍　清史
龍一 加納
Original Assignee
パナソニック インテレクチュアル プロパティ コーポレーション オブ アメリカ
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by パナソニック インテレクチュアル プロパティ コーポレーション オブ アメリカ filed Critical パナソニック インテレクチュアル プロパティ コーポレーション オブ アメリカ
Publication of WO2019069902A1 publication Critical patent/WO2019069902A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/13—Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC]

Definitions

  • the present disclosure relates to an encoding apparatus and the like that encode a moving image including a plurality of pictures.
  • H.264 also called High Efficiency Video Coding (HEVC)
  • HEVC High Efficiency Video Coding
  • the present disclosure provides an apparatus that can flexibly set parameters used when performing entropy coding.
  • An encoding apparatus is an encoding apparatus that encodes a moving image configured of a plurality of pictures, and includes a circuit and a memory, and the circuit uses the memory.
  • a first probability parameter used in entropy coding performed on a first picture of the plurality of pictures is included in a reference picture list used for inter prediction of the first picture of the plurality of pictures. With reference to the second probability parameter associated with the second picture to be initialized.
  • An encoding apparatus and the like can appropriately set information related to encoding of a moving image.
  • FIG. 1 is a block diagram showing a functional configuration of the coding apparatus according to the first embodiment.
  • FIG. 2 is a diagram showing an example of block division in the first embodiment.
  • FIG. 3 is a table showing transform basis functions corresponding to each transform type.
  • FIG. 4A is a view showing an example of the shape of a filter used in ALF.
  • FIG. 4B is a view showing another example of the shape of a filter used in ALF.
  • FIG. 4C is a view showing another example of the shape of a filter used in ALF.
  • FIG. 5A is a diagram illustrating 67 intra prediction modes in intra prediction.
  • FIG. 5B is a flowchart for describing an outline of predicted image correction processing by OBMC processing.
  • FIG. 5A is a diagram illustrating 67 intra prediction modes in intra prediction.
  • FIG. 5B is a flowchart for describing an outline of predicted image correction processing by OBMC processing.
  • FIG. 5C is a conceptual diagram for describing an outline of predicted image correction processing by OBMC processing.
  • FIG. 5D is a diagram illustrating an example of FRUC.
  • FIG. 6 is a diagram for describing pattern matching (bilateral matching) between two blocks along a motion trajectory.
  • FIG. 7 is a diagram for describing pattern matching (template matching) between a template in a current picture and a block in a reference picture.
  • FIG. 8 is a diagram for explaining a model assuming uniform linear motion.
  • FIG. 9A is a diagram for describing derivation of a motion vector in units of sub blocks based on motion vectors of a plurality of adjacent blocks.
  • FIG. 9B is a diagram for describing an overview of motion vector derivation processing in the merge mode.
  • FIG. 9A is a diagram for describing derivation of a motion vector in units of sub blocks based on motion vectors of a plurality of adjacent blocks.
  • FIG. 9B is a diagram for describing an
  • FIG. 9C is a conceptual diagram for describing an overview of DMVR processing.
  • FIG. 9D is a diagram for describing an outline of a predicted image generation method using luminance correction processing by LIC processing.
  • FIG. 10 is a block diagram showing a functional configuration of the decoding apparatus according to the first embodiment.
  • FIG. 11 is a block diagram showing an internal configuration of the entropy coding unit of the coding apparatus according to the first embodiment.
  • 12A is a flowchart of a management procedure of a reference probability parameter storage unit in the entropy coding unit of the coding apparatus according to Embodiment 1.
  • FIG. FIG. 12B is a flowchart of a memory management process of the reference probability parameter storage unit in the entropy coding unit of the coding apparatus according to Embodiment 1.
  • FIG. 13 is a flowchart of a process of initializing probability parameters in the entropy coding unit of the coding apparatus according to the first embodiment.
  • FIG. 14A is a chart showing an example of a data table related to probability parameters.
  • FIG. 14B is a chart showing an example of a data table on probability parameters.
  • FIG. 15A is a conceptual diagram showing an example of probability parameter reference restriction in probability parameter initialization of the entropy coding unit of the coding device in Embodiment 1.
  • FIG. 15B is a conceptual diagram showing an example of probability parameter reference restriction in probability parameter initialization of the entropy coding unit of the coding apparatus in Embodiment 1.
  • FIG. 14A is a chart showing an example of a data table related to probability parameters.
  • FIG. 14B is a chart showing an example of a data table on probability parameters.
  • FIG. 15A is a conceptual diagram showing an example of probability parameter reference restriction in probability parameter initialization of the entropy coding unit of the coding device
  • FIG. 16 is a block diagram showing an internal configuration of the entropy decoding unit of the decoding apparatus in the first embodiment.
  • FIG. 17 is a block diagram showing an implementation example of the coding apparatus.
  • FIG. 18 is a flow chart showing an operation example of the coding apparatus.
  • FIG. 19 is a block diagram showing an implementation example of the decoding device.
  • FIG. 20 is a flowchart showing an operation example of the decoding apparatus.
  • FIG. 21 is an overall configuration diagram of a content supply system for realizing content distribution service.
  • FIG. 22 is a diagram illustrating an example of a coding structure at the time of scalable coding.
  • FIG. 23 is a diagram illustrating an example of a coding structure at the time of scalable coding.
  • FIG. 22 is a diagram illustrating an example of a coding structure at the time of scalable coding.
  • FIG. 24 is a diagram showing an example of a display screen of a web page.
  • FIG. 25 is a diagram showing an example of a display screen of a web page.
  • FIG. 26 is a diagram illustrating an example of a smartphone.
  • FIG. 27 is a block diagram showing a configuration example of a smartphone.
  • a coding apparatus that codes a moving image including a plurality of pictures may perform binary arithmetic coding of the information element to be coded using the known occurrence probability of the information element to be coded.
  • binary arithmetic coding refers to a coding method of converting information elements to be coded into multiple values into binary signals represented by 0 and 1 and performing variable length coding. Make a part.
  • a decoding device that decodes a moving image including a plurality of pictures may perform binary arithmetic decoding of the information element to be decoded using the known occurrence probability of the information element to be decoded.
  • binary arithmetic decoding refers to a decoding method of converting a variable-length encoded binary signal into an original binary signal by variable-length decoding and converting the binary signal into a multilevel signal.
  • an encoding apparatus is an encoding apparatus that encodes a moving image configured of a plurality of pictures, and includes a circuit and a memory, and the circuit is configured to A reference used for inter prediction of the first picture of the plurality of pictures, using a memory and a first probability parameter used in entropy coding performed on the first picture of the plurality of pictures using a memory Initialization is performed with reference to the second probability parameter associated with the second picture included in the picture list.
  • the coding apparatus may not use the predetermined probability parameter when performing binary arithmetic coding, which is entropy coding. Therefore, the encoding apparatus can flexibly set the parameters to be used when performing binary arithmetic encoding.
  • each of the plurality of pictures is a picture to which a temporal ID indicating a hierarchy of temporal scalability is assigned, and in the initialization of the first probability parameter, the first picture of the plurality of pictures and the temporal ID
  • the third probability parameter associated with the third picture whose value is the same picture is prohibited to be referred to as the second probability parameter.
  • each of the plurality of pictures is a picture to which a temporal ID indicating a hierarchy of temporal scalability is assigned, and in the initialization of the first probability parameter, the temporal ID from the first picture of the plurality of pictures It is prohibited to refer to the fourth probability parameter associated with the fourth picture, which is a picture having a large value of, as the second probability parameter.
  • each of the plurality of pictures is a picture to which a temporal ID indicating a hierarchy of temporal scalability is assigned, and is associated with a predetermined picture of the plurality of pictures in the initialization of the first probability parameter. It is prohibited to refer to a fifth probability parameter as the second probability parameter, and the predetermined picture is selected from all pictures from the next picture to the first picture of the predetermined picture arranged in coding order.
  • the temporal ID value is equal to or larger than at least one picture of
  • initialization control information including a reference picture index for specifying a picture associated with the second probability parameter is encoded.
  • the first probability parameter it is determined whether or not the second probability parameter is referred to, and when the second probability parameter is referred to, the first probability parameter is referred to with reference to the second probability parameter. If the probability parameter is initialized and the second probability parameter is not referred to, the first probability parameter is initialized to a predetermined value.
  • a decoding device that decodes a moving image configured of a plurality of pictures, and includes a circuit and a memory, and the circuit uses the memory.
  • the circuit uses the memory.
  • the plurality of pictures included in the reference picture list used for inter prediction of the first picture among the plurality of pictures.
  • the second probability parameter associated with the second picture With reference to the second probability parameter associated with the second picture to be initialized.
  • each of the plurality of pictures is a picture to which a temporal ID indicating a hierarchy of temporal scalability is assigned, and in the initialization of the first probability parameter, the temporal ID and the temporal ID of the plurality of pictures
  • the third probability parameter associated with the third picture whose value is the same picture is prohibited to be referred to as the second probability parameter.
  • the decoding apparatus can perform reference restriction on the probability parameter used for binary arithmetic decoding associated with the picture, as in the case of reference restriction imposed on the picture in temporal scalability.
  • each of the plurality of pictures is a picture to which a temporal ID indicating a hierarchy of temporal scalability is assigned, and in the initialization of the first probability parameter, the temporal ID of the plurality of pictures from the first picture. It is prohibited to refer to the fourth probability parameter associated with the fourth picture, which is a picture having a large value of, as the second probability parameter.
  • the decoding apparatus can perform reference restriction on the probability parameter used for binary arithmetic decoding associated with the picture, as in the case of reference restriction imposed on the picture in temporal scalability.
  • each of the plurality of pictures is a picture to which a temporal ID indicating a hierarchy of temporal scalability is assigned, and is associated with a predetermined picture among the plurality of pictures in the initialization of the first probability parameter. It is prohibited to refer to a fifth probability parameter as the second probability parameter, and the predetermined picture is one of all pictures from the next picture of the predetermined picture to the first picture arranged in decoding order. It is a picture in which the value of temporal ID is equal to or larger than at least one picture.
  • the decoding device can perform reference restriction on the probability parameter used in binary arithmetic coding associated with the picture, as in the case of reference restriction imposed on the picture in temporal scalability.
  • initialization control information including a reference picture index for specifying a picture associated with the second probability parameter is decoded.
  • the first probability parameter it is determined whether or not the second probability parameter is referred to, and when the second probability parameter is referred to, the first probability parameter is referred to with reference to the second probability parameter. If the probability parameter is initialized and the second probability parameter is not referred to, the first probability parameter is initialized to a predetermined value.
  • an encoding method for encoding a moving image configured of a plurality of pictures, and a row corresponding to a first picture of the plurality of pictures.
  • a decoding method is a decoding method for decoding a moving image configured of a plurality of pictures, and entropy decoding performed on a first picture of the plurality of pictures
  • the first probability parameter used in the step is referred to the second probability parameter associated with the second picture included in the reference picture list used for inter prediction of the first picture among the plurality of pictures, initialize.
  • the encoding apparatus includes: a division unit, an intra prediction unit, an inter prediction unit, a loop filter unit, a conversion unit, a quantization unit, and an entropy coding unit. You may have.
  • the division unit may divide a picture into a plurality of blocks.
  • the intra prediction unit may perform intra prediction on blocks included in the plurality of blocks.
  • the inter prediction unit may perform inter prediction on the block.
  • the conversion unit may generate a conversion coefficient by converting a prediction error between a predicted image obtained by the intra prediction or the inter prediction and an original image.
  • the quantization unit may quantize the transform coefficient to generate a quantization coefficient.
  • the entropy coding unit may code the quantization coefficient to generate a coded bit stream.
  • the loop filter unit may apply a filter to a reconstructed image of the block.
  • the encoding apparatus may be an encoding apparatus that encodes a moving image including a plurality of pictures.
  • the entropy coding unit refers to the second probability parameter associated with the second picture included in the reference picture list used for inter prediction among the plurality of pictures, and sets the row for the first picture.
  • the initialization of the first probability parameter used in the entropy coding to be performed may be performed.
  • the decoding device may include an entropy decoding unit, an inverse quantization unit, an inverse transform unit, an intra prediction unit, an inter prediction unit, and a loop filter unit. .
  • the entropy decoding unit may decode quantization coefficients of blocks in a picture from a coded bit stream.
  • the dequantization unit may dequantize the quantization coefficient to obtain a transform coefficient.
  • the inverse transform unit may inverse transform the transform coefficient to obtain a prediction error.
  • the intra prediction unit may perform intra prediction on the block.
  • the inter prediction unit may perform inter prediction on the block.
  • the filter unit may apply a filter to a reconstructed image generated using the prediction image obtained by the intra prediction or the inter prediction and the prediction error.
  • the decoding device may be a decoding device that decodes a moving image including a plurality of pictures.
  • the entropy decoding unit is performed on the first picture with reference to the second probability parameter associated with the second picture included in the reference picture list used for inter prediction among the plurality of pictures. Initialization of the first probability parameter used in entropy decoding may be performed.
  • these general or specific aspects may be realized by a system, an apparatus, a method, an integrated circuit, a computer program, or a non-transitory recording medium such as a computer readable CD-ROM, and the system
  • the present invention may be realized as any combination of an apparatus, a method, an integrated circuit, a computer program, and a storage medium.
  • Embodiment 1 First, an outline of the first embodiment will be described as an example of an encoding apparatus and a decoding apparatus to which the process and / or the configuration described in each aspect of the present disclosure described later can be applied.
  • Embodiment 1 is merely an example of an encoding apparatus and a decoding apparatus to which the process and / or the configuration described in each aspect of the present disclosure can be applied, and the processing and / or the process described in each aspect of the present disclosure
  • the configuration can also be implemented in a coding apparatus and a decoding apparatus that are different from the first embodiment.
  • the encoding apparatus or the decoding apparatus according to the first embodiment corresponds to the constituent elements described in each aspect of the present disclosure among a plurality of constituent elements that configure the encoding apparatus or the decoding apparatus.
  • Replacing a component with a component described in each aspect of the present disclosure (2) A plurality of configurations constituting the encoding device or the decoding device with respect to the encoding device or the decoding device of the first embodiment
  • Addition of processing to the method performed by the encoding apparatus or the decoding apparatus of the first embodiment, and / or a plurality of processes included in the method home Replacing a process corresponding to the process described in each aspect of the present disclosure with the process described in each aspect of the present disclosure after replacing some of the processes and arbitrary changes such as deletion.
  • the component described in each aspect of the present disclosure is a component of a part of the plurality of components constituting the encoding apparatus or the decoding apparatus of the first aspect Implementing in combination with a component having a part of the functions to be provided or a component performing a part of the process performed by the component described in each aspect of the present disclosure (5)
  • the encoding apparatus according to the first embodiment Or a component having a part of functions provided by a part of a plurality of components constituting the decoding apparatus, or a plurality of components constituting the coding apparatus or the decoding apparatus of the first embodiment
  • Part of A component performing a part of the process performed by the component is a component described in each aspect of the present disclosure, a component provided with a part of the function of the component described in each aspect of the present disclosure, or the present Implementing in combination with a component that performs part of the processing performed by the components described in each aspect of the disclosure (6)
  • the manner of implementation of the processing and / or configuration described in each aspect of the present disclosure is not limited to the above example.
  • it may be implemented in an apparatus used for a purpose different from the moving picture / image coding apparatus or the moving picture / image decoding apparatus disclosed in the first embodiment, or the process and / or the process described in each aspect.
  • the configuration may be implemented alone.
  • the processes and / or configurations described in the different embodiments may be implemented in combination.
  • FIG. 1 is a block diagram showing a functional configuration of coding apparatus 100 according to the first embodiment.
  • the encoding device 100 is a moving image / image coding device that encodes a moving image / image in units of blocks.
  • the encoding apparatus 100 is an apparatus for encoding an image in units of blocks, and includes a dividing unit 102, a subtracting unit 104, a converting unit 106, a quantizing unit 108, and entropy coding.
  • Unit 110 inverse quantization unit 112, inverse transformation unit 114, addition unit 116, block memory 118, loop filter unit 120, frame memory 122, intra prediction unit 124, inter prediction unit 126, And a prediction control unit 128.
  • the encoding device 100 is realized by, for example, a general-purpose processor and a memory.
  • the processor controls the division unit 102, the subtraction unit 104, the conversion unit 106, the quantization unit 108, the entropy coding unit 110, and the dequantization unit 112.
  • the inverse transform unit 114, the addition unit 116, the loop filter unit 120, the intra prediction unit 124, the inter prediction unit 126, and the prediction control unit 128 function.
  • coding apparatus 100 includes division section 102, subtraction section 104, conversion section 106, quantization section 108, entropy coding section 110, inverse quantization section 112, inverse conversion section 114, addition section 116, and loop filter section 120. , And may be realized as one or more dedicated electronic circuits corresponding to the intra prediction unit 124, the inter prediction unit 126, and the prediction control unit 128.
  • the dividing unit 102 divides each picture included in the input moving image into a plurality of blocks, and outputs each block to the subtracting unit 104.
  • the division unit 102 first divides a picture into blocks of a fixed size (for example, 128 ⁇ 128).
  • This fixed size block may be referred to as a coding tree unit (CTU).
  • the dividing unit 102 divides each of fixed size blocks into blocks of variable size (for example, 64 ⁇ 64 or less) based on recursive quadtree and / or binary tree block division.
  • This variable sized block may be referred to as a coding unit (CU), a prediction unit (PU) or a transform unit (TU).
  • CUs, PUs, and TUs need not be distinguished, and some or all of the blocks in a picture may be processing units of CUs, PUs, and TUs.
  • FIG. 2 is a diagram showing an example of block division in the first embodiment.
  • solid lines represent block boundaries by quadtree block division
  • broken lines represent block boundaries by binary tree block division.
  • the block 10 is a square block (128 ⁇ 128 block) of 128 ⁇ 128 pixels.
  • the 128x128 block 10 is first divided into four square 64x64 blocks (quadtree block division).
  • the upper left 64x64 block is further vertically divided into two rectangular 32x64 blocks, and the left 32x64 block is further vertically divided into two rectangular 16x64 blocks (binary block division). As a result, the upper left 64x64 block is divided into two 16x64 blocks 11, 12 and a 32x64 block 13.
  • the upper right 64x64 block is divided horizontally into two rectangular 64x32 blocks 14 and 15 (binary block division).
  • the lower left 64x64 block is divided into four square 32x32 blocks (quadtree block division). Of the four 32x32 blocks, the upper left block and the lower right block are further divided.
  • the upper left 32x32 block is vertically divided into two rectangular 16x32 blocks, and the right 16x32 block is further horizontally split into two 16x16 blocks (binary block division).
  • the lower right 32x32 block is divided horizontally into two 32x16 blocks (binary block division).
  • the lower left 64x64 block is divided into a 16x32 block 16, two 16x16 blocks 17, 18, two 32x32 blocks 19, 20, and two 32x16 blocks 21, 22.
  • the lower right 64x64 block 23 is not divided.
  • the block 10 is divided into thirteen variable sized blocks 11 to 23 based on recursive quadtree and binary tree block division. Such division is sometimes called quad-tree plus binary tree (QTBT) division.
  • QTBT quad-tree plus binary tree
  • one block is divided into four or two blocks (quadtree or binary tree block division) in FIG. 2, the division is not limited to this.
  • one block may be divided into three blocks (tri-tree block division).
  • a partition including such a ternary tree block partition may be referred to as a multi type tree (MBT) partition.
  • MBT multi type tree
  • the subtracting unit 104 subtracts a prediction signal (prediction sample) from an original signal (original sample) in block units divided by the dividing unit 102. That is, the subtraction unit 104 calculates a prediction error (also referred to as a residual) of the encoding target block (hereinafter, referred to as a current block). Then, the subtracting unit 104 outputs the calculated prediction error to the converting unit 106.
  • the original signal is an input signal of the coding apparatus 100, and is a signal (for example, a luminance (luma) signal and two color difference (chroma) signals) representing an image of each picture constituting a moving image.
  • a signal representing an image may also be referred to as a sample.
  • Transform section 106 transforms the prediction error in the spatial domain into a transform coefficient in the frequency domain, and outputs the transform coefficient to quantization section 108.
  • the transform unit 106 performs, for example, discrete cosine transform (DCT) or discrete sine transform (DST) determined in advance on the prediction error in the spatial domain.
  • DCT discrete cosine transform
  • DST discrete sine transform
  • Transform section 106 adaptively selects a transform type from among a plurality of transform types, and transforms the prediction error into transform coefficients using a transform basis function corresponding to the selected transform type. You may Such transformation may be referred to as explicit multiple core transform (EMT) or adaptive multiple transform (AMT).
  • EMT explicit multiple core transform
  • AMT adaptive multiple transform
  • the plurality of transformation types include, for example, DCT-II, DCT-V, DCT-VIII, DST-I and DST-VII.
  • FIG. 3 is a table showing transform basis functions corresponding to each transform type. In FIG. 3, N indicates the number of input pixels. The choice of transform type from among these multiple transform types may depend, for example, on the type of prediction (intra-prediction and inter-prediction) or depending on the intra-prediction mode.
  • Information indicating whether to apply such EMT or AMT (for example, called an AMT flag) and information indicating the selected conversion type are signaled at CU level. Note that the signaling of these pieces of information need not be limited to the CU level, but may be at other levels (eg, sequence level, picture level, slice level, tile level or CTU level).
  • the conversion unit 106 may re-convert the conversion coefficient (conversion result). Such reconversion may be referred to as adaptive secondary transform (AST) or non-separable secondary transform (NSST). For example, the conversion unit 106 performs reconversion for each sub block (for example, 4 ⁇ 4 sub blocks) included in the block of transform coefficients corresponding to the intra prediction error.
  • the information indicating whether to apply the NSST and the information on the transformation matrix used for the NSST are signaled at the CU level. Note that the signaling of these pieces of information need not be limited to the CU level, but may be at other levels (eg, sequence level, picture level, slice level, tile level or CTU level).
  • Separable conversion is a method in which conversion is performed multiple times by separating in each direction as many as the number of dimensions of the input, and Non-Separable conversion is two or more when the input is multidimensional. This is a method of collectively converting the dimensions of 1 and 2 into one dimension.
  • Non-Separable conversion if the input is a 4 ⁇ 4 block, it is regarded as one array having 16 elements, and 16 ⁇ 16 conversion is performed on the array There is one that performs transformation processing with a matrix.
  • the quantization unit 108 quantizes the transform coefficient output from the transform unit 106. Specifically, the quantization unit 108 scans the transform coefficient of the current block in a predetermined scan order, and quantizes the transform coefficient based on the quantization parameter (QP) corresponding to the scanned transform coefficient. Then, the quantization unit 108 outputs the quantized transform coefficient of the current block (hereinafter, referred to as a quantization coefficient) to the entropy coding unit 110 and the inverse quantization unit 112.
  • QP quantization parameter
  • the predetermined order is an order for quantization / inverse quantization of transform coefficients.
  • the predetermined scan order is defined in ascending order (low frequency to high frequency) or descending order (high frequency to low frequency) of the frequency.
  • the quantization parameter is a parameter that defines a quantization step (quantization width). For example, if the value of the quantization parameter increases, the quantization step also increases. That is, as the value of the quantization parameter increases, the quantization error increases.
  • the entropy coding unit 110 generates a coded signal (coded bit stream) by subjecting the quantization coefficient input from the quantization unit 108 to variable-length coding. Specifically, for example, the entropy coding unit 110 binarizes the quantization coefficient and performs arithmetic coding on the binary signal.
  • the inverse quantization unit 112 inversely quantizes the quantization coefficient which is the input from the quantization unit 108. Specifically, the inverse quantization unit 112 inversely quantizes the quantization coefficient of the current block in a predetermined scan order. Then, the inverse quantization unit 112 outputs the inverse quantized transform coefficient of the current block to the inverse transform unit 114.
  • the inverse transform unit 114 restores the prediction error by inversely transforming the transform coefficient which is the input from the inverse quantization unit 112. Specifically, the inverse transform unit 114 restores the prediction error of the current block by performing inverse transform corresponding to the transform by the transform unit 106 on the transform coefficient. Then, the inverse conversion unit 114 outputs the restored prediction error to the addition unit 116.
  • the restored prediction error does not match the prediction error calculated by the subtracting unit 104 because the information is lost due to quantization. That is, the restored prediction error includes the quantization error.
  • the addition unit 116 reconstructs the current block by adding the prediction error, which is the input from the inverse conversion unit 114, and the prediction sample, which is the input from the prediction control unit 128. Then, the addition unit 116 outputs the reconstructed block to the block memory 118 and the loop filter unit 120. Reconstruction blocks may also be referred to as local decoding blocks.
  • the block memory 118 is a storage unit for storing a block in an encoding target picture (hereinafter referred to as a current picture) which is a block referred to in intra prediction. Specifically, the block memory 118 stores the reconstructed block output from the adding unit 116.
  • the loop filter unit 120 applies a loop filter to the block reconstructed by the adding unit 116, and outputs the filtered reconstructed block to the frame memory 122.
  • the loop filter is a filter (in-loop filter) used in the coding loop, and includes, for example, a deblocking filter (DF), a sample adaptive offset (SAO), an adaptive loop filter (ALF) and the like.
  • a least squares error filter is applied to remove coding distortion, for example, multiple 2x2 subblocks in the current block, based on local gradient direction and activity.
  • One filter selected from the filters is applied.
  • subblocks for example, 2x2 subblocks
  • a plurality of classes for example, 15 or 25 classes.
  • the direction value D of the gradient is derived, for example, by comparing gradients in a plurality of directions (for example, horizontal, vertical and two diagonal directions).
  • the gradient activation value A is derived, for example, by adding gradients in a plurality of directions and quantizing the addition result.
  • a filter for the subblock is determined among the plurality of filters.
  • FIGS. 4A to 4C are diagrams showing a plurality of examples of filter shapes used in ALF.
  • FIG. 4A shows a 5 ⁇ 5 diamond shaped filter
  • FIG. 4B shows a 7 ⁇ 7 diamond shaped filter
  • FIG. 4C shows a 9 ⁇ 9 diamond shaped filter.
  • Information indicating the shape of the filter is signaled at the picture level. Note that the signaling of the information indicating the shape of the filter does not have to be limited to the picture level, and may be another level (for example, sequence level, slice level, tile level, CTU level or CU level).
  • the on / off of the ALF is determined, for example, at the picture level or the CU level. For example, as to luminance, it is determined whether to apply ALF at the CU level, and as to color difference, it is determined whether to apply ALF at the picture level.
  • Information indicating on / off of ALF is signaled at picture level or CU level. Note that the signaling of the information indicating ALF on / off need not be limited to the picture level or CU level, and may be other levels (eg, sequence level, slice level, tile level or CTU level) Good.
  • the set of coefficients of the plurality of selectable filters (eg, up to 15 or 25 filters) is signaled at the picture level.
  • the signaling of the coefficient set need not be limited to the picture level, but may be other levels (eg, sequence level, slice level, tile level, CTU level, CU level or sub-block level).
  • the frame memory 122 is a storage unit for storing a reference picture used for inter prediction, and may be referred to as a frame buffer. Specifically, the frame memory 122 stores the reconstructed block filtered by the loop filter unit 120.
  • the intra prediction unit 124 generates a prediction signal (intra prediction signal) by performing intra prediction (also referred to as in-screen prediction) of the current block with reference to a 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 with reference to samples (for example, luminance value, color difference value) of a block adjacent to the current block, and performs prediction control on the intra prediction signal. Output to the part 128.
  • intra prediction signal intra prediction signal
  • intra prediction also referred to as in-screen prediction
  • the intra prediction unit 124 performs intra prediction using one of a plurality of predefined intra prediction modes.
  • the plurality of intra prediction modes include one or more non-directional prediction modes and a plurality of directional prediction modes.
  • Non-Patent Document 1 One or more non-directional prediction modes are described, for example, in It includes Planar prediction mode and DC prediction mode defined in H.265 / High-Efficiency Video Coding (HEVC) standard (Non-Patent Document 1).
  • Planar prediction mode and DC prediction mode defined in H.265 / High-Efficiency Video Coding (HEVC) standard (Non-Patent Document 1).
  • HEVC High-Efficiency Video Coding
  • the plurality of directionality prediction modes are, for example, H. It includes 33 directional prediction modes defined by the H.265 / HEVC standard. In addition to the 33 directions, the plurality of directionality prediction modes may further include 32 direction prediction modes (a total of 65 directionality prediction modes).
  • FIG. 5A is a diagram showing 67 intra prediction modes (2 non-directional prediction modes and 65 directional prediction modes) in intra prediction. Solid arrows indicate H. A broken line arrow represents the added 32 directions, which represents the 33 directions defined in the H.265 / HEVC standard.
  • a luminance block may be referred to in intra prediction of a chrominance block. That is, the chrominance component of the current block may be predicted based on the luminance component of the current block.
  • Such intra prediction may be referred to as cross-component linear model (CCLM) prediction.
  • the intra prediction mode (for example, referred to as a CCLM mode) of a chrominance block referencing such a luminance block may be added as one of the intra prediction modes of the chrominance block.
  • the intra prediction unit 124 may correct the pixel value after intra prediction based on the gradient of the reference pixel in the horizontal / vertical directions. Intra prediction with such correction is sometimes called position dependent intra prediction combination (PDPC). Information indicating the presence or absence of application of PDPC (for example, called a PDPC flag) is signaled, for example, at CU level. Note that the signaling of this information need not be limited to the CU level, but may be at other levels (eg, sequence level, picture level, slice level, tile level or CTU level).
  • the inter prediction unit 126 performs inter prediction (also referred to as inter-frame prediction) of a current block with reference to a reference picture that is a reference picture stored in the frame memory 122 and that is different from the current picture. Generate a prediction signal). Inter prediction is performed in units of a current block or sub blocks (for example, 4 ⁇ 4 blocks) in the current block. For example, the inter prediction unit 126 performs motion estimation on the current block or sub block in the reference picture. Then, the inter prediction unit 126 generates an inter prediction signal of the current block or sub block by performing motion compensation using motion information (for example, a motion vector) obtained by the motion search. Then, the inter prediction unit 126 outputs the generated inter prediction signal to the prediction control unit 128.
  • inter prediction also referred to as inter-frame prediction
  • a motion vector predictor may be used to signal the motion vector. That is, the difference between the motion vector and the predicted motion vector may be signaled.
  • the inter prediction signal may be generated using not only the motion information of the current block obtained by the motion search but also the motion information of the adjacent block. Specifically, the inter prediction signal is generated in units of sub blocks in the current block by weighting and adding a prediction signal based on motion information obtained by motion search and a prediction signal based on motion information of an adjacent block. It may be done.
  • Such inter prediction (motion compensation) may be called OBMC (overlapped block motion compensation).
  • OBMC block size information indicating the size of the sub-block for the OBMC
  • OBMC flag information indicating whether or not to apply the OBMC mode
  • the level of signaling of these pieces of information need not be limited to the sequence level and the CU level, and may be other levels (eg, picture level, slice level, tile level, CTU level or subblock level) Good.
  • FIG. 5B and FIG. 5C are a flowchart and a conceptual diagram for explaining an outline of predicted image correction processing by OBMC processing.
  • a predicted image (Pred) by normal motion compensation is acquired using the motion vector (MV) assigned to the encoding target block.
  • the motion vector (MV_L) of the encoded left adjacent block is applied to the current block to obtain a predicted image (Pred_L), and the predicted image and Pred_L are weighted and superimposed. Perform the first correction of the image.
  • the motion vector (MV_U) of the encoded upper adjacent block is applied to the coding target block to obtain a predicted image (Pred_U), and the predicted image subjected to the first correction and the Pred_U are weighted.
  • a second correction of the predicted image is performed by adding and superposing, and this is made a final predicted image.
  • the right adjacent block and the lower adjacent block may be used to perform correction more than two steps. It is possible.
  • the area to be superimposed may not be the pixel area of the entire block, but only a partial area near the block boundary.
  • the processing target block may be a prediction block unit or a sub block unit obtained by further dividing the prediction block.
  • obmc_flag is a signal indicating whether to apply the OBMC process.
  • the encoding apparatus it is determined whether the encoding target block belongs to a complex area of motion, and if it belongs to a complex area of motion, the value 1 is set as obmc_flag. The encoding is performed by applying the OBMC processing, and when not belonging to the complex region of motion, the value 0 is set as the obmc_flag and the encoding is performed without applying the OBMC processing.
  • the decoding apparatus decodes the obmc_flag described in the stream, and switches whether to apply the OBMC process according to the value to perform decoding.
  • the motion information may be derived on the decoding device side without being signalized.
  • the merge mode defined in the H.265 / HEVC standard may be used.
  • motion information may be derived by performing motion search on the decoding device side. In this case, motion search is performed without using the pixel value of the current block.
  • the mode in which motion estimation is performed on the side of the decoding apparatus may be referred to as a pattern matched motion vector derivation (PMMVD) mode or a frame rate up-conversion (FRUC) mode.
  • PMMVD pattern matched motion vector derivation
  • FRUC frame rate up-conversion
  • FIG. 5D An example of the FRUC process is shown in FIG. 5D.
  • a plurality of candidate lists (which may be common to the merge list) each having a predicted motion vector are generated Be done.
  • the best candidate MV is selected from among the plurality of candidate MVs registered in the candidate list. For example, an evaluation value of each candidate included in the candidate list is calculated, and one candidate is selected based on the evaluation value.
  • a motion vector for the current block is derived based on the selected candidate motion vector.
  • the selected candidate motion vector (best candidate MV) is derived as it is as the motion vector for the current block.
  • a motion vector for the current block may be derived by performing pattern matching in a peripheral region of a position in the reference picture corresponding to the selected candidate motion vector. That is, the search is performed on the area around the best candidate MV by the same method, and if there is an MV for which the evaluation value is good, the best candidate MV is updated to the MV and the current block is updated. It may be used as the final MV. In addition, it is also possible to set it as the structure which does not implement the said process.
  • the evaluation value is calculated by calculating the difference value of the reconstructed image by pattern matching between the area in the reference picture corresponding to the motion vector and the predetermined area. Note that the evaluation value may be calculated using information other than the difference value.
  • first pattern matching or second pattern matching is used as pattern matching.
  • the first pattern matching and the second pattern matching may be referred to as bilateral matching and template matching, respectively.
  • pattern matching is performed between two blocks in two different reference pictures, which are along the motion trajectory of the current block. Therefore, in the first pattern matching, a region in another reference picture along the motion trajectory of the current block is used as the predetermined region for calculation of the evaluation value of the candidate described above.
  • FIG. 6 is a diagram for explaining an example of pattern matching (bilateral matching) between two blocks along a motion trajectory.
  • First pattern matching among pairs of two blocks in two reference pictures (Ref0, Ref1) which are two blocks along the motion trajectory of the current block (Cur block), Two motion vectors (MV0, MV1) are derived by searching for the most matching pair. Specifically, for the current block, a reconstructed image at a designated position in the first encoded reference picture (Ref 0) designated by the candidate MV, and a symmetric MV obtained by scaling the candidate MV at a display time interval.
  • the difference with the reconstructed image at the specified position in the second coded reference picture (Ref 1) specified in step is derived, and the evaluation value is calculated using the obtained difference value.
  • the candidate MV with the best evaluation value among the plurality of candidate MVs may be selected as the final MV.
  • motion vectors (MV0, MV1) pointing to two reference blocks are the temporal distance between the current picture (Cur Pic) and the two reference pictures (Ref0, Ref1) It is proportional to (TD0, TD1).
  • the mirror symmetric bi-directional motion vector Is derived when the current picture is temporally located between two reference pictures, and the temporal distances from the current picture to the two reference pictures are equal, in the first pattern matching, the mirror symmetric bi-directional motion vector Is derived.
  • pattern matching is performed between a template in the current picture (a block adjacent to the current block in the current picture (eg, upper and / or left adjacent blocks)) and a block in the reference picture. Therefore, in the second pattern matching, a block adjacent to the current block in the current picture is used as the predetermined area for calculating the evaluation value of the candidate described above.
  • FIG. 7 is a diagram for explaining an example of pattern matching (template matching) between a template in a current picture and a block in a reference picture.
  • the current block (Cur Pic) is searched for in the reference picture (Ref 0) for a block that most closely matches a block adjacent to the current block (Cur block).
  • Motion vectors are derived.
  • the reconstructed image of the left adjacent region and / or the upper adjacent encoded region and the encoded reference picture (Ref 0) specified by the candidate MV are equivalent to each other.
  • the evaluation value is calculated using the obtained difference value, and the candidate MV having the best evaluation value among the plurality of candidate MVs is selected as the best candidate MV Good.
  • a FRUC flag Information indicating whether to apply such a FRUC mode (for example, called a FRUC flag) is signaled at the CU level.
  • a signal for example, called a FRUC mode flag
  • a method of pattern matching for example, first pattern matching or second pattern matching
  • the signaling of these pieces of information need not be limited to the CU level, but may be at other levels (eg, sequence level, picture level, slice level, tile level, CTU level or subblock level) .
  • This mode is sometimes referred to as a bi-directional optical flow (BIO) mode.
  • BIO bi-directional optical flow
  • FIG. 8 is a diagram for explaining a model assuming uniform linear motion.
  • (v x , v y ) indicate velocity vectors
  • ⁇ 0 and ⁇ 1 indicate the time between the current picture (Cur Pic) and two reference pictures (Ref 0 and Ref 1 ), respectively.
  • (MVx 0 , MVy 0 ) indicates a motion vector corresponding to the reference picture Ref 0
  • (MVx 1 , MVy 1 ) indicates a motion vector corresponding to the reference picture Ref 1 .
  • the optical flow equation is: (i) the time derivative of the luminance value, (ii) the product of the horizontal velocity and the horizontal component of the spatial gradient of the reference image, and (iii) the vertical velocity and the spatial gradient of the reference image The product of the vertical components of and the sum of is equal to zero.
  • a motion vector in units of blocks obtained from a merge list or the like is corrected in units of pixels.
  • the motion vector may be derived on the decoding device side by a method different from the derivation of the motion vector based on a model assuming uniform linear motion.
  • motion vectors may be derived on a subblock basis based on motion vectors of a plurality of adjacent blocks.
  • This mode is sometimes referred to as affine motion compensation prediction mode.
  • FIG. 9A is a diagram for describing derivation of a motion vector in units of sub blocks based on motion vectors of a plurality of adjacent blocks.
  • the current block includes sixteen 4 ⁇ 4 subblocks.
  • the motion vector v 0 of the upper left corner control point of the current block is derived based on the motion vector of the adjacent block
  • the motion vector v 1 of the upper right corner control point of the current block is derived based on the motion vector of the adjacent subblock Be done.
  • the motion vector (v x , v y ) of each sub block in the current block is derived according to the following equation (2).
  • x and y indicate the horizontal position and the vertical position of the sub block, respectively, and w indicates a predetermined weighting factor.
  • the derivation method of the motion vector of the upper left and upper right control points may include several different modes.
  • Information indicating such an affine motion compensation prediction mode (for example, called an affine flag) is signaled at the CU level. Note that the signaling of the information indicating this affine motion compensation prediction mode need not be limited to the CU level, and other levels (eg, sequence level, picture level, slice level, tile level, CTU level or subblock level) ) May be.
  • the prediction control unit 128 selects one of the intra prediction signal and the inter prediction signal, and outputs the selected signal as a prediction signal to the subtraction unit 104 and the addition unit 116.
  • FIG. 9B is a diagram for describing an overview of motion vector derivation processing in the merge mode.
  • a predicted MV list in which candidates for predicted MV are registered is generated.
  • the prediction MV candidate the position of the coding target block in the coded reference picture, which is the MV of the plurality of coded blocks located in the spatial periphery of the coding target block, is projected
  • Temporally adjacent prediction MV which is an MV possessed by a nearby block
  • joint prediction MV which is an MV generated by combining spatially adjacent prediction MV and MVs of temporally adjacent prediction MV, and zero prediction MV whose value is MV, etc.
  • one prediction MV is selected from among the plurality of prediction MVs registered in the prediction MV list, and it is determined as the MV of the current block.
  • merge_idx which is a signal indicating which prediction MV has been selected, is described in the stream and encoded.
  • the prediction MVs registered in the prediction MV list described in FIG. 9B are an example, and the number is different from the number in the drawing, or the configuration does not include some types of the prediction MV in the drawing, It may have a configuration in which prediction MVs other than the type of prediction MV in the drawing are added.
  • the final MV may be determined by performing the DMVR process described later using the MV of the coding target block derived in the merge mode.
  • FIG. 9C is a conceptual diagram for describing an overview of DMVR processing.
  • a first reference picture which is a processed picture in the L0 direction and a second reference picture which is a processed picture in the L1 direction To generate a template by averaging each reference pixel.
  • the regions around candidate MVs of the first reference picture and the second reference picture are respectively searched, and the MV with the lowest cost is determined as the final MV.
  • the cost value is calculated using the difference value between each pixel value of the template and each pixel value of the search area, the MV value, and the like.
  • the outline of the process described here is basically common to the encoding apparatus and the decoding apparatus.
  • FIG. 9D is a diagram for describing an outline of a predicted image generation method using luminance correction processing by LIC processing.
  • an MV for obtaining a reference image corresponding to a current block to be coded is derived from a reference picture which is a coded picture.
  • a predicted image for a block to be encoded is generated.
  • the shape of the peripheral reference area in FIG. 9D is an example, and other shapes may be used.
  • a predicted image is generated from a plurality of reference pictures, and is similar to the reference image acquired from each reference picture. After performing luminance correction processing by a method, a predicted image is generated.
  • lic_flag is a signal indicating whether to apply the LIC process.
  • the encoding apparatus it is determined whether or not the encoding target block belongs to the area in which the luminance change occurs, and when it belongs to the area in which the luminance change occurs, as lic_flag A value of 1 is set and encoding is performed by applying LIC processing, and when not belonging to an area where a luminance change occurs, a value of 0 is set as lic_flag and encoding is performed without applying the LIC processing.
  • the decoding apparatus decodes lic_flag described in the stream to switch whether to apply the LIC processing according to the value and performs decoding.
  • determining whether to apply the LIC process for example, there is also a method of determining according to whether or not the LIC process is applied to the peripheral block.
  • a method of determining according to whether or not the LIC process is applied to the peripheral block For example, when the encoding target block is in merge mode, whether or not the surrounding encoded blocks selected in the derivation of the MV in merge mode processing are encoded by applying LIC processing According to the result, whether to apply the LIC process is switched to perform encoding. In the case of this example, the processing in the decoding is completely the same.
  • FIG. 10 is a block diagram showing a functional configuration of decoding apparatus 200 according to Embodiment 1.
  • the decoding device 200 is a moving image / image decoding device that decodes a moving image / image in units of blocks.
  • the decoding apparatus 200 includes an entropy decoding unit 202, an inverse quantization unit 204, an inverse conversion unit 206, an addition unit 208, a block memory 210, a loop filter unit 212, and a frame memory 214. , An intra prediction unit 216, an inter prediction unit 218, and a prediction control unit 220.
  • the decoding device 200 is realized by, for example, a general-purpose processor and a memory. In this case, when the processor executes the software program stored in the memory, the processor determines whether the entropy decoding unit 202, the inverse quantization unit 204, the inverse conversion unit 206, the addition unit 208, the loop filter unit 212, the intra prediction unit 216 functions as an inter prediction unit 218 and a prediction control unit 220.
  • the decoding apparatus 200 is a dedicated unit corresponding to the entropy decoding unit 202, the inverse quantization unit 204, the inverse conversion 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. And one or more electronic circuits.
  • the entropy decoding unit 202 entropy decodes the coded bit stream. Specifically, the entropy decoding unit 202 performs arithmetic decoding, for example, from a coded bit stream to a binary signal. Then, the entropy decoding unit 202 debinarizes the binary signal. Thereby, the entropy decoding unit 202 outputs the quantization coefficient to the dequantization unit 204 in block units.
  • the inverse quantization unit 204 inversely quantizes the quantization coefficient of the block to be decoded (hereinafter referred to as a current block), which is an input from the entropy decoding unit 202. Specifically, the dequantization part 204 dequantizes the said quantization coefficient about each of the quantization coefficient of a current block based on the quantization parameter corresponding to the said quantization coefficient. Then, the dequantization unit 204 outputs the dequantized quantization coefficient (that is, transform coefficient) of the current block to the inverse transformation unit 206.
  • a current block which is an input from the entropy decoding unit 202.
  • the dequantization part 204 dequantizes the said quantization coefficient about each of the quantization coefficient of a current block based on the quantization parameter corresponding to the said quantization coefficient. Then, the dequantization unit 204 outputs the dequantized quantization coefficient (that is, transform coefficient) of the current block to the inverse transformation unit 206.
  • the inverse transform unit 206 restores the prediction error by inversely transforming the transform coefficient that is the input from the inverse quantization unit 204.
  • the inverse transform unit 206 determines the current block based on the deciphered transformation type information. Inverse transform coefficients of
  • the inverse transform unit 206 applies inverse retransformation to the transform coefficients.
  • the addition unit 208 adds the prediction error, which is the input from the inverse conversion unit 206, and the prediction sample, which is the input from the prediction control unit 220, to reconstruct the current block. Then, the adding unit 208 outputs the reconstructed block to the block memory 210 and the loop filter unit 212.
  • the block memory 210 is a storage unit for storing a block within a picture to be decoded (hereinafter referred to as a current picture) which is a block referred to in intra prediction. Specifically, the block memory 210 stores the reconstructed block output from the adding unit 208.
  • the loop filter unit 212 applies a loop filter to the block reconstructed by the adding unit 208, and outputs the filtered reconstructed block to the frame memory 214 and a display device or the like.
  • one filter is selected from the plurality of filters based on the local gradient direction and activity, The selected filter is applied to the reconstruction block.
  • the frame memory 214 is a storage unit for storing a reference picture used for inter prediction, and may be referred to as a frame buffer. Specifically, the frame memory 214 stores the reconstructed block filtered by the loop filter unit 212.
  • the intra prediction unit 216 refers to a block in the current picture stored in the block memory 210 to perform intra prediction based on the intra prediction mode read from the coded bit stream, thereby generating a prediction signal (intra prediction Signal). Specifically, the intra prediction unit 216 generates an intra prediction signal by performing intra prediction with reference to samples (for example, luminance value, color difference value) of a block adjacent to the current block, and performs prediction control on the intra prediction signal. Output to unit 220.
  • the intra prediction unit 216 may predict the chrominance component of the current block based on the luminance component of the current block. .
  • the intra prediction unit 216 corrects the pixel value after intra prediction based on the gradient of reference pixels in the horizontal / vertical directions.
  • the inter prediction unit 218 predicts the current block with reference to the reference picture stored in the frame memory 214.
  • the prediction is performed in units of the current block or subblocks (for example, 4 ⁇ 4 blocks) in the current block.
  • the inter prediction unit 218 generates an inter prediction signal of the current block or sub block by performing motion compensation using motion information (for example, a motion vector) read from the coded bit stream, and generates an inter prediction signal. It is output to the prediction control unit 220.
  • the inter prediction unit 218 determines not only the motion information of the current block obtained by the motion search but also the motion information of the adjacent block. Use to generate an inter prediction signal.
  • the inter prediction unit 218 is configured to follow the method of pattern matching deciphered from the coded stream (bilateral matching or template matching). Motion information is derived by performing motion search. Then, the inter prediction unit 218 performs motion compensation using the derived motion information.
  • the inter prediction unit 218 derives a motion vector based on a model assuming uniform linear motion. Also, in the case where the information deciphered from the coded bit stream indicates that the affine motion compensation prediction mode is applied, the inter prediction unit 218 performs motion vectors in units of sub blocks based on motion vectors of a plurality of adjacent blocks. Derive
  • the prediction control unit 220 selects one of the intra prediction signal and the inter prediction signal, and outputs the selected signal to the addition unit 208 as a prediction signal.
  • FIG. 11 is a block diagram showing an internal configuration of entropy coding section 110 of coding apparatus 100 according to the present embodiment.
  • the entropy coding unit 110 includes a binarization unit 131, a binary arithmetic coding unit 132, a probability parameter control unit 133, a current probability parameter storage unit 134, and a reference probability parameter storage unit 135.
  • the binarization unit 131 is a circuit for performing binarization of the information element to be encoded.
  • the binary arithmetic coding unit 132 is a circuit for arithmetically coding the binarized information element to be coded.
  • the probability parameter control unit 133 is a circuit for controlling the probability parameter by generation of initialization control information or the like.
  • the current probability parameter storage unit 134 is a memory for storing probability parameters used for binary arithmetic coding in the binary arithmetic coding unit 132.
  • the reference probability parameter storage unit 135 is a memory for storing a plurality of probability parameters used for binary arithmetic coding in the binary arithmetic coding unit 132.
  • the probability parameter initialization stored in the current probability parameter storage unit 134 and used by the binary arithmetic coding unit 132 at the beginning of the slice is stored in the reference probability parameter storage unit 135. It may be implemented with reference to the parameters.
  • the probability parameter control unit 133 The probability parameter after the block at the predetermined position has been processed is stored in the reference probability parameter storage unit 135.
  • Each of the plurality of probability parameters stored in the reference probability parameter storage unit 135 is managed by the probability parameter control unit 133 in association with the corresponding reference picture stored in the reference picture buffer.
  • a reference picture may be marked as "unused for reference”.
  • the probability parameter control unit 133 marks the probability parameter associated with the reference picture marked as "unused for reference (non-reference)" as "unused for reference (non-reference)”.
  • Encoding apparatus 100 and decoding apparatus 200 encode a method of initializing the probability parameter stored in current probability parameter storage unit 134 using a header associated with the slice, such as a slice header.
  • the configuration may be such that notification can be made from the device 100 to the decoding device 200.
  • the value of the probability parameter stored in the reference probability parameter storage unit 135 may be specified using the value of the reference picture index of the reference picture corresponding to the slice to be encoded.
  • the default probability parameter is stored without referring to the probability parameter stored in the reference probability parameter storage unit 135.
  • the probability parameter stored in the current probability parameter storage unit 134 and used by the binary arithmetic coding unit 132 may be initialized using
  • the predetermined condition may be, for example, that the temporal ID of the reference picture is smaller than the temporal ID of the picture to be encoded. Also, the predetermined condition may be that the temporal ID of the reference picture is smaller than the temporal IDs of all the pictures arranged in the encoding order between the picture to be encoded and the reference picture.
  • FIG. 12A is a flowchart showing the management procedure of the reference probability parameter storage unit 135 in the entropy coding unit 110 of the coding apparatus 100 according to the present embodiment.
  • the coding apparatus 100 shown in FIG. 1 performs, for example, the operation shown in FIG. 12A.
  • the encoding apparatus 100 processes a slice header (S101).
  • the entropy coding unit 110 generates and codes a slice header of the slice to be coded.
  • the encoding apparatus 100 performs a memory management process (S102). For example, the encoding apparatus 100 performs processing as shown in FIG. 12B. Details of the process will be described later.
  • the encoding apparatus 100 determines whether the NAL unit type of the picture to be encoded is a type that permits reference to another picture or a type corresponding to non-reference (S103). For example, the probability parameter control unit 133 determines whether the NAL unit type of the current slice is a type corresponding to a referenced picture or a non-referenced picture.
  • encoding apparatus 100 performs an encoding process for each CU.
  • the encoding apparatus 100 starts a loop of processing for the CU. First, the encoding apparatus 100 encodes a CU (S104). Next, the encoding apparatus 100 determines whether the position of the CU is a predetermined position (S105).
  • the coding apparatus 100 sets the probability parameter in the probability parameter storage area of the reference probability parameter storage unit 135 associated with the picture to be encoded. Save (S106).
  • the probability parameter storage area may be fixedly divided and associated with the picture to be encoded, or the probability parameter storage area may be dynamically divided and associated with the picture to be encoded, and the association may be updated as appropriate.
  • the coding apparatus 100 ends the CU loop.
  • the predetermined position may be the last position of the slice, the center position, the first position, or a position several minutes after the start.
  • the probability parameter is stored for each slice in the picture
  • the probability parameter may be stored for each tile in the picture, or the probability parameter may be stored for each CTU line.
  • probability parameters may be stored for each picture. That is, the probability parameter may be stored for each arbitrary processing unit.
  • the encoding apparatus 100 skips storage.
  • FIG. 12B is a flowchart showing management processing of the memory of the reference probability parameter storage unit 135 in the entropy coding unit 110 of the coding apparatus 100 according to the present embodiment.
  • the encoding device 100 illustrated in FIG. 1 performs the operation illustrated in FIG. 12B.
  • the encoding apparatus 100 determines whether the encoding target portion is the beginning of a picture (S201). If the encoding target portion is not the beginning of the picture (No in S201), the memory management process is ended. When the target portion to be encoded is the beginning of the picture (Yes in S201), the reference picture buffer is updated (S202).
  • the encoding apparatus 100 marks the probability parameter of the reference probability parameter storage unit 135 associated with the reference picture marked as "unused for reference” as "unused for reference” (S203). Thereby, when the reference picture is deleted from the reference picture buffer, the probability parameter associated with the reference picture is also deleted.
  • the NAL unit type of the picture to be encoded corresponds to the reference, that is, the type to which the reference is permitted or to the non-reference, that is, the type to which the reference is not permitted. It is determined (S204). For example, the probability parameter control unit 133 determines whether the NAL unit type of the current slice is a type corresponding to a referenced picture or a non-referenced picture.
  • the encoding apparatus 100 ends the memory management process.
  • the probability parameter storage area of the reference probability parameter storage unit 135 is associated with the picture to be encoded (S205).
  • the coding apparatus 100 manages the probability parameter in the reference probability parameter storage unit 135 so as to associate and store the reference picture and the probability parameter.
  • a reference picture index may be used.
  • the probability parameter storage area may be fixedly divided and associated with the encoding target picture, or the probability parameter storage area may be dynamically divided, associated with the encoding target picture, and the association updated as appropriate. It is also good.
  • FIG. 13 is a flowchart showing the procedure of initializing the probability parameter in entropy coding section 110 of coding apparatus 100 according to the present embodiment.
  • the coding apparatus 100 shown in FIG. 1 performs, for example, the operation shown in FIG.
  • the encoding apparatus 100 constructs a reference picture list (S301).
  • the probability parameter control unit 133 acquires probability parameter initialization control information (S302).
  • the probability parameter initialization control information may include, for example, a reference picture index for specifying a probability parameter used for entropy coding.
  • the coding apparatus 100 determines whether the probability parameter control unit 133 refers to the probability parameter associated with the reference picture or not (S303).
  • the probability parameter control unit 133 refers to the probability parameter associated with the reference picture (Yes in S303)
  • the probability parameter control unit 133 refers to the probability parameter of the reference probability parameter storage unit 135 designated by the reference picture index.
  • the probability parameter of the current probability parameter storage unit 134 is initialized (S304).
  • the probability parameter control unit 133 may initialize the probability parameter for each processing unit in which the probability parameter is stored.
  • the probability parameter control unit 133 When the probability parameter control unit 133 does not refer to the probability parameter associated with the reference picture (No in S303), the probability parameter control unit 133 initializes the probability parameter of the current probability parameter storage unit 134 by a predetermined method. (S306).
  • the predetermined method is, for example, a method of initializing the probability parameter of the current probability parameter storage unit 134 by a predetermined value.
  • the probability parameter control unit 133 may initialize the probability parameter for each predetermined processing unit.
  • the coding apparatus 100 starts a CU loop, and performs CU coding of a picture to be coded (S305).
  • the encoding device 100 ends the operation.
  • FIG. 14A and FIG. 14B are charts showing an example of a data table regarding probability parameters. It shows what kind of data table the first probability parameter used in the entropy coding and the second probability parameter referred to in the initialization of the first probability parameter are stored.
  • FIG. 14A is a data table of the first probability parameter stored in the current probability parameter storage unit 134 of the entropy coding unit 110.
  • the current probability parameter storage unit 134 stores one first probability parameter.
  • the first probability parameter stored here is used for entropy coding of the current picture.
  • the first probability parameter is stored in the same format in the current probability parameter storage unit 232 (described later) of the entropy decoding unit 202.
  • FIG. 14B is a data table of second probability parameters stored in the reference probability parameter storage unit 135 of the entropy coding unit 110.
  • the field of the data table may be a picture number, a reference index, information on the possibility of referring to another picture, and a probability parameter associated with each of the plurality of pictures.
  • the data table may include information other than those listed above.
  • the picture number is a number assigned to each of a plurality of pictures to be encoded.
  • the reference index is a value used as information indicating a picture when a certain picture is referenced from another picture. Information on whether to refer to another picture indicates whether or not the coding apparatus 100 can refer to the probability parameter of another picture when the picture is encoded by entropy coding. It is information to show.
  • the probability parameter is a probability parameter used in entropy coding of a picture of interest. As shown in FIG. 14B, the above information may be uniquely associated and stored for each of a plurality of pictures.
  • the reference probability parameter storage unit 135 may further store information other than the above.
  • the reference probability parameter storage unit 233 (described later) of the entropy decoding unit 202 stores the picture number, the reference index, and information on probability of referring to other pictures and probability parameters.
  • the reference probability parameter storage unit 233 may further store information other than the above.
  • FIG. 15A is a conceptual diagram showing an example of probability parameter reference restriction in probability parameter initialization of the entropy coding unit 110 of the coding apparatus 100 according to the present embodiment.
  • the pictures p0 to p8 shown in FIG. 15A are encoded in the order of p0, p1, p2, p3, p4, p5, p6, p7 and p8.
  • temporal IDs indicating a hierarchy of temporal scalability are assigned to each of the pictures p0 to p8. Specifically, 0 is assigned to the pictures p0 and p1 as temporal IDs. Further, 1 is assigned to the picture p2 as a temporal ID. Further, 2 is assigned as temporal ID to the pictures p3 and p6. In addition, 3 is assigned as temporal ID to the pictures p4, p5, p7 and p8.
  • FIG. 15A shows an example in the case where the picture p6 is the current picture to be encoded. Then, in initialization of the probability parameter for each slice of the picture p6, the probability parameter for which the reference is permitted and the probability parameter for which the reference is prohibited are shown.
  • the pictures p0 to p5 are coded pictures.
  • the temporal IDs of the pictures p4 and p5 are larger than the temporal ID of the picture p6. Therefore, reference to pictures p4 and p5 is prohibited in the coding of picture p6. Accordingly, in initialization of the probability parameter in the entropy coding of the picture p6, reference to the probability parameter of each of the pictures p4 and p5 may be prohibited.
  • the picture p6 is a TSA picture
  • reference to the picture p3 having the same temporal ID as the picture p6 is prohibited in the coding of the picture p6. Accordingly, reference to the probability parameter of the picture p3 may be prohibited in the initialization of the probability parameter in the entropy coding of the picture p6.
  • FIG. 15B is a conceptual diagram showing an example of probability parameter reference restriction in probability parameter initialization of the entropy coding unit 110 of the coding apparatus 100 according to the present embodiment.
  • pictures p0 to p8 are shown in FIG. 15B.
  • the encoding order of the pictures p0 to p8 and the temporal ID assigned to each of the pictures p0 to p8 in the example of FIG. 15B are the same as the example of FIG. 15A.
  • FIG. 15B shows an example where the picture p7 is the current picture to be encoded. Then, in initialization of probability parameters for each slice of the picture p7, probability parameters for which reference is permitted and probability parameters for which reference is prohibited are shown.
  • the pictures p0 to p6 are coded pictures. Among the pictures p0 to p6, reference to a specific picture whose temporal ID is smaller than any picture from the picture following the specific picture to the picture p7 in coding order, or a picture whose temporal ID is 0 may be permitted .
  • the temporal ID of each of the pictures p0 and p1 is 0.
  • the temporal ID of the picture p2 is smaller than any of the pictures p3 to p7.
  • the temporal ID of the picture p6 is smaller than that of the picture p7. Therefore, in the initialization of the probability parameters in the entropy coding of the picture p7, reference to the probability parameters of the pictures p0 to p2 and p6 may be permitted.
  • the temporal ID of the picture p3 is the same as the temporal ID of the picture p6 among the pictures p4 to p7.
  • the temporal ID of the picture p4 is larger than the temporal ID of the picture p6 among the pictures p5 to p7.
  • the temporal ID of the picture p5 is larger than the temporal ID of the picture p6 among the pictures p6 and p7. Therefore, reference to probability parameters of pictures p3 to p5 may be prohibited in initialization of probability parameters in entropy coding of picture p7.
  • the reference restriction as described above corresponds to the reference restriction when each picture having a temporal ID different from 0 is a TSA picture.
  • the reference restriction shown in FIG. 15B also corresponds to the reference restriction when the picture p6 is a TSA picture. For example, if there is a TSA picture with the same or smaller temporal ID as compared to the current picture, and the current picture has a temporal ID of greater than 0, the probability of the coded picture Parameter reference may be prohibited.
  • FIG. 15B also shows such a reference restriction.
  • FIG. 16 is a block diagram showing an internal configuration of the entropy decoding unit 202 of the decoding apparatus 200 in the present embodiment.
  • the configuration of the entropy decoding unit 202 of the decoding device 200 corresponds to the configuration of the entropy coding unit 110 of the coding device 100.
  • the entropy decoding unit 202 includes an inverse binarization unit 235, a binary arithmetic decoding unit 234, a probability parameter control unit 231, a current probability parameter storage unit 232, and a reference probability parameter storage unit 233.
  • the inverse binarization unit 235 is a circuit for converting binary values of decoded information elements into multiple values.
  • the binary arithmetic decoding unit 234 is a circuit for decoding an information element to be decoded which is binary.
  • the probability parameter control unit 231 is a circuit for receiving initialization control information and controlling the probability parameter.
  • the current probability parameter storage unit 232 is a memory for storing probability parameters used for decoding in the binary arithmetic decoding unit 234.
  • the reference probability parameter storage unit 233 is a memory for storing a plurality of probability parameters used for decoding in the binary arithmetic decoding unit 234.
  • the operation of the entropy decoding unit 202 of the decoding device 200 corresponds to the operation of the entropy coding unit 110 of the coding device 100.
  • the entropy decoding unit 202 initializes the probability parameter stored in the current probability parameter storage unit 232 and used by the binary arithmetic decoding unit 234 at the beginning of the slice by using the probability parameter stored in the reference probability parameter storage unit 233. It may be implemented with reference.
  • the probability parameter control unit 231 determines that a block at a predetermined position is present.
  • the processed probability parameters are stored in the reference probability parameter storage unit 233.
  • Each of the plurality of probability parameters stored in the reference probability parameter storage unit 233 is managed by the probability parameter control unit 231 in association with the corresponding reference picture stored in the reference picture buffer.
  • a reference picture may be marked as "unused for reference”.
  • the probability parameter control unit 231 marks the probability parameter associated with the reference picture marked as "unused for reference (non-reference)" as “unused for reference (non-reference)”.
  • the operations described with reference to FIG. 12A to FIG. 13 regarding the encoding device 100 may be described as operations for the decoding device 200 by replacing encoding with decoding.
  • the decoding apparatus 200 performs an operation corresponding to the operation shown in FIG. 12A.
  • the operations performed by the decoding device 200 corresponding to the operations shown in FIG. 12A may be described based on FIG. 12A.
  • the decoding device 200 processes a slice header (S101). For example, the entropy decoding unit 202 generates and decodes a slice header of a slice to be decoded.
  • the decryption apparatus 200 performs a memory management process (S102).
  • the decoding device 200 performs processing as shown in FIG. 12B. Details of the process will be described later.
  • the decoding apparatus 200 determines whether the NAL unit type of the picture to be decoded corresponds to the reference, that is, whether the reference is permitted or not, that is, the reference is not permitted. It judges (S103). For example, the probability parameter control unit 231 determines whether the NAL unit type of the current slice is a type corresponding to a referenced picture or a non-referenced picture.
  • a loop of processing for CU is performed (S107). That is, the decoding device 200 performs the decoding process for each CU.
  • the decoding apparatus 200 starts a loop of processing for the CU. First, the decoding apparatus 200 decodes a CU (S104). Next, it is determined whether the position of the CU is a predetermined position or not (S105).
  • the probability parameter is stored in the probability parameter storage area of the reference probability parameter storage unit 233 associated with the picture to be decoded (S106).
  • the probability parameter storage area may be fixedly divided and associated with the picture to be decoded, or the probability parameter storage area may be dynamically divided and associated with the picture to be decoded, and the association may be updated as appropriate.
  • the decoding device 200 ends the CU loop.
  • the decoding device 200 skips the storage.
  • the predetermined position may be the last position of the slice, the center position, the first position, or a position several minutes after the start.
  • the probability parameter is stored for each slice in the picture
  • the probability parameter may be stored for each tile in the picture, or the probability parameter may be stored for each CTU line.
  • probability parameters may be stored for each picture. That is, the probability parameter may be stored for each arbitrary processing unit.
  • the decoding device 200 performs an operation corresponding to the operation illustrated in FIG. 12B.
  • the operations performed by the decoding device 200 corresponding to the operations shown in FIG. 12B may be described based on FIG. 12B.
  • the decoding device 200 determines whether the decoding target portion is the beginning of a picture (S201). If the part to be decoded is not the head of the picture (No in S201), the decoding device 200 ends the memory management process. When the part to be decoded is the head of the picture (Yes in S201), the reference picture buffer is updated (S202).
  • the decoding apparatus 200 marks the probability parameter of the reference probability parameter storage unit 233 associated with the reference picture marked as "unused for reference” as "unused for reference” (S203). Thereby, when the reference picture is deleted from the reference picture buffer, the probability parameter associated with the reference picture is also deleted.
  • the decoding apparatus 200 determines whether the NAL unit type of the picture to be decoded corresponds to the reference, that is, whether the reference is permitted or not, that is, the reference is not permitted. It judges (S204). For example, the probability parameter control unit 231 determines whether the NAL unit type of the current slice is a type corresponding to a referenced picture or a non-referenced picture.
  • the decoding apparatus 200 ends the memory management process.
  • the probability parameter storage area of the reference probability parameter storage unit 233 is associated with the picture to be decoded (S205) ).
  • the decoding device 200 manages the probability parameter in the reference probability parameter storage unit 233 so as to associate and store the reference picture and the probability parameter.
  • a reference picture index may be used.
  • the probability parameter storage area may be fixedly divided and associated with the picture to be decoded, or the probability parameter storage area may be dynamically divided and associated with the picture to be decoded, and the association may be updated appropriately. .
  • the decoding device 200 performs an operation corresponding to the operation illustrated in FIG.
  • the operations performed by the decoding device 200 corresponding to the operations shown in FIG. 13 may be described based on FIG.
  • the decoding apparatus 200 constructs a reference picture list (S301).
  • the probability parameter control unit 231 acquires probability parameter initialization control information (S302).
  • the probability parameter initialization control information may include, for example, a reference picture index for specifying a probability parameter to be used for entropy decoding.
  • the decoding apparatus 200 determines whether the probability parameter control unit 231 refers to or does not refer to the probability parameter associated with the reference picture (S303).
  • the probability parameter control unit 231 refers to the probability parameter associated with the reference picture (Yes in S303)
  • the probability parameter control unit 231 refers to the probability parameter of the reference probability parameter storage unit 233 designated by the reference picture index.
  • the probability parameter of the current probability parameter storage unit 232 is initialized (S304).
  • the probability parameter control unit 231 may initialize the probability parameter for each processing unit in which the probability parameter is stored.
  • the probability parameter control unit 231 When the probability parameter control unit 231 does not refer to the probability parameter associated with the reference picture (No in S303), the probability parameter control unit 231 initializes the probability parameter of the current probability parameter storage unit 232 by a predetermined method. (S306).
  • the predetermined method is, for example, a method of initializing the probability parameter of the current probability parameter storage unit 232 according to a predetermined value.
  • the probability parameter control unit 231 may initialize the probability parameter for each processing unit in which the probability parameter is stored.
  • the decoding apparatus 200 starts a CU loop, and performs CU decoding of a picture to be decoded (S305).
  • the decoding device 200 ends the operation.
  • FIG. 17 is a block diagram showing an implementation example of the coding apparatus 100.
  • the coding apparatus 100 includes a circuit 150 and a memory 152.
  • the components of the coding apparatus 100 shown in FIG. 1 are implemented by the circuit 150 and the memory 152 shown in FIG.
  • the circuit 150 is an electronic circuit that can access the memory 152 and performs information processing.
  • the circuit 150 is a dedicated or general-purpose electronic circuit that encodes a moving image using the memory 152.
  • the circuit 150 may be a processor such as a CPU.
  • the circuit 150 may be an assembly of a plurality of electronic circuits.
  • the circuit 150 may play a role of a plurality of components excluding the component for storing information among the plurality of components of the encoding device 100 illustrated in FIG. 1. That is, circuit 150 may perform the operations described above as the operation of these components.
  • the memory 152 is a dedicated or general-purpose memory in which information for the circuit 150 to encode moving pictures is stored.
  • the memory 152 may be an electronic circuit, may be connected to the circuit 150, or may be included in the circuit 150.
  • the memory 152 may be an assembly of a plurality of electronic circuits, or may be configured of a plurality of sub memories.
  • the memory 152 may be a magnetic disk or an optical disk, or may be expressed as a storage or a recording medium.
  • the memory 152 may be either a non-volatile memory or a volatile memory.
  • the memory 152 may play a role of a component for storing information among the plurality of components of the encoding device 100 illustrated in FIG. 1. Specifically, the memory 152 may play a role of the current probability parameter storage unit 134 and the reference probability parameter storage unit 135 shown in FIG. 1.
  • a moving image to be encoded may be stored, or a bit string corresponding to the encoded moving image may be stored.
  • the memory 152 may also store a program for the circuit 150 to encode a moving image.
  • all of the plurality of components shown in FIG. 1 may not be mounted, or all of the plurality of processes described above may not be performed. Some of the components shown in FIG. 1 may be included in other devices, and some of the above-described processes may be performed by other devices. Then, in the encoding apparatus 100, part of the plurality of components shown in FIG. 1 is implemented, and part of the plurality of processes described above is performed to relate to encoding of a moving image. Information can be set appropriately.
  • FIG. 18 is a flowchart showing an operation example of the coding apparatus 100 shown in FIG.
  • the coding apparatus 100 shown in FIG. 17 performs the operation shown in FIG. 18 when performing entropy coding on a moving image composed of a plurality of pictures.
  • the circuit 150 performs the following operation using the memory 152.
  • the circuit 150 refers to the second probability parameter stored in the reference probability parameter storage unit 135 (S401).
  • the first probability parameter stored in the current probability parameter storage unit 134 is initialized using the referred second probability parameter (S402).
  • the first probability parameter is a probability parameter used for entropy coding performed on a moving image composed of a plurality of pictures.
  • the coding apparatus 100 uses the second probability parameter stored in the reference probability parameter storage unit 135 to calculate the probability parameter used for entropy coding performed on a moving image composed of a plurality of pictures. It can be initialized. Therefore, encoding apparatus 100 can flexibly set the probability parameter to be used in the case of entropy encoding performed on a moving image composed of a plurality of pictures.
  • the second probability parameter may be a probability parameter used when encoding an already encoded picture.
  • the encoding apparatus 100 may set the third probability parameter associated with the third picture in which the value of the temporal ID is the same as the value of the first picture of the plurality of pictures. Reference to two probability parameters may be prohibited.
  • the coding apparatus 100 is configured to set the fourth probability parameter associated with the fourth picture, which is a picture having a larger temporal ID value than the first picture among the plurality of pictures, Reference to two probability parameters may be prohibited.
  • the coding apparatus 100 may prohibit reference to the fifth probability parameter associated with a predetermined one of the plurality of pictures as the second probability parameter in the initialization of the first probability parameter.
  • the predetermined picture is a picture whose temporal ID value is equal to or greater than at least one of all the pictures from the next picture to the first picture of the predetermined picture arranged in the encoding order Good.
  • the encoding apparatus 100 may encode initialization control information including a reference picture index for specifying a picture associated with the second probability parameter.
  • the encoding apparatus 100 determines whether to refer to the second probability parameter, and when referring to the second probability parameter, refers to the second probability parameter to determine the first probability. If the parameters are initialized and the second probability parameter is not referred to, the first probability parameter may be initialized to a default value.
  • FIG. 19 is a block diagram showing an implementation example of the decoding device 200.
  • the decoding device 200 includes a circuit 250 and a memory 252.
  • the plurality of components of the decoding device 200 shown in FIG. 10 are implemented by the circuit 250 and the memory 252 shown in FIG.
  • the circuit 250 is an electronic circuit that can access the memory 252 and performs information processing.
  • the circuit 250 is a dedicated or general-purpose electronic circuit that decodes a moving image using the memory 252.
  • the circuit 250 may be a processor such as a CPU.
  • the circuit 250 may be an assembly of a plurality of electronic circuits.
  • circuit 250 may play a role of a plurality of components excluding the component for storing information among the plurality of components of the decoding apparatus 200 illustrated in FIG. That is, circuit 250 may perform the operations described above as the operation of these components.
  • the memory 252 is a dedicated or general-purpose memory in which information for the circuit 250 to decode a moving image is stored.
  • the memory 252 may be an electronic circuit, may be connected to the circuit 250, or may be included in the circuit 250.
  • the memory 252 may be an assembly of a plurality of electronic circuits, or may be configured of a plurality of sub memories.
  • the memory 252 may be a magnetic disk or an optical disk, or may be expressed as a storage or a recording medium.
  • the memory 252 may be a non-volatile memory or a volatile memory.
  • the memory 252 may play a role of a component for storing information among the plurality of components of the decoding device 200 illustrated in FIG. Specifically, the memory 252 may play a role of the current probability parameter storage unit 232 and the reference probability parameter storage unit 233 illustrated in FIG. 10.
  • a bit string corresponding to the decoded moving image may be stored, or the decoded moving image may be stored.
  • the memory 252 may store a program for the circuit 250 to decode a moving image.
  • all of the plurality of components shown in FIG. 10 may not be mounted, or all of the plurality of processes described above may not be performed. Some of the components shown in FIG. 10 may be included in other devices, or some of the above-described processes may be performed by other devices. Then, in the decoding apparatus 200, a part of the plurality of components shown in FIG. 10 is implemented, and a part of the plurality of processes described above is performed, whereby the information related to the decoding of the moving image becomes It can be set appropriately.
  • FIG. 20 is a flowchart showing an operation example of the decoding device 200.
  • the decoding apparatus 200 shown in FIG. 19 performs the operation shown in FIG. 20 when performing entropy decoding on a moving image composed of a plurality of pictures.
  • the circuit 250 performs the following operation using the memory 252.
  • the circuit 250 refers to the second probability parameter stored in the reference probability parameter storage unit 233 (S501).
  • the first probability parameter stored in the current probability parameter storage unit 232 is initialized using the referred second probability parameter (S502).
  • the first probability parameter is a probability parameter used for entropy decoding performed on a moving image composed of a plurality of pictures.
  • the decoding apparatus 200 initializes the probability parameter used for entropy decoding performed on a moving image composed of a plurality of pictures, using the second probability parameter stored in the reference probability parameter storage unit 233. can do. Therefore, the decoding apparatus 200 can flexibly set the probability parameter to be used in the entropy decoding performed on a moving image composed of a plurality of pictures.
  • the second probability parameter may be the probability parameter used when decoding the already decoded picture.
  • the decoding device 200 may be configured, in the initialization of the first probability parameter, to a third probability parameter associated with a third picture in which the value of the temporal ID is the same as the value of the first picture among the plurality of pictures. It may be prohibited to refer to it as a probability parameter.
  • the decoding apparatus 200 further includes, in the initialization of the first probability parameter, a fourth probability parameter associated with a fourth picture, which is a picture having a larger temporal ID value than the first picture, among the plurality of pictures. It may be prohibited to refer to it as a probability parameter.
  • the decoding device 200 may prohibit reference to the fifth probability parameter associated with the predetermined picture among the plurality of pictures as the second probability parameter in the initialization of the first probability parameter.
  • the predetermined picture may be a picture in which the value of temporal ID is equal to or larger than at least one of all pictures from the next picture to the first picture of the predetermined picture arranged in decoding order .
  • the decoding device 200 may decode initialization control information including a reference picture index for specifying a picture associated with the second probability parameter.
  • the decoding apparatus 200 determines whether or not to refer to the second probability parameter in the initialization of the first probability parameter, and when referring to the second probability parameter, refers to the second probability parameter to refer to the first probability parameter.
  • the first probability parameter may be initialized with a default value.
  • Coding apparatus 100 and decoding apparatus 200 in the present embodiment may be used as an image coding apparatus and an image decoding apparatus, respectively, or may be used as a moving image coding apparatus and a moving image decoding apparatus.
  • each component may be configured by dedicated hardware or implemented by executing a software program suitable for each component.
  • Each component may be realized by a program execution unit such as a CPU or a processor reading and executing a software program recorded on a recording medium such as a hard disk or a semiconductor memory.
  • each of the encoding device 100 and the decoding device 200 includes a processing circuit (Processing Circuitry) and a storage device (Storage) electrically connected to the processing circuit and accessible to the processing circuit. You may have.
  • processing circuitry may correspond to circuitry 150 or 250 and storage may correspond to memory 152 or 252.
  • the processing circuit includes at least one of dedicated hardware and a program execution unit, and executes processing using a storage device.
  • the storage device stores a software program executed by the program execution unit.
  • software for realizing the encoding apparatus 100 or the decoding apparatus 200 of the present embodiment is a program as follows.
  • this program is a coding method for coding a moving image composed of a plurality of pictures in a computer, and is used in entropy coding performed on the first picture of the plurality of pictures.
  • a first probability parameter is initialized with reference to a second probability parameter associated with a second picture included in a reference picture list used for inter prediction of the first picture among the plurality of pictures.
  • the encoding method may be performed.
  • the program is a decoding method for decoding a moving image composed of a plurality of pictures in a computer, and a first probability used in entropy decoding performed on a first picture of the plurality of pictures.
  • each component may be a circuit as described above. These circuits may constitute one circuit as a whole or may be separate circuits. Each component may be realized by a general purpose processor or a dedicated processor.
  • another component may execute the processing that a particular component performs. Further, the order of executing the processing may be changed, or a plurality of processing may be executed in parallel. Further, the coding and decoding apparatus may include the coding apparatus 100 and the decoding apparatus 200.
  • first and second ordinal numbers used in the description may be replaced as appropriate.
  • ordinal numbers may be newly given or removed for components and the like.
  • the aspect of the encoding apparatus 100 and the decoding apparatus 200 was demonstrated based on embodiment, the aspect of the encoding apparatus 100 and the decoding apparatus 200 is not limited to this embodiment.
  • the encoding apparatus 100 and the decoding apparatus 200 may be configured by combining various modifications in the present embodiment that may occur to those skilled in the art without departing from the spirit of the present disclosure, or by combining components in different embodiments. It may be included within the scope of the aspect of.
  • This aspect may be practiced in combination with at least some of the other aspects in the present disclosure.
  • part of the processing described in the flowchart of this aspect part of the configuration of the apparatus, part of the syntax, and the like may be implemented in combination with other aspects.
  • each of the functional blocks can usually be realized by an MPU, a memory, and the like. Further, the processing by each of the functional blocks is usually realized by a program execution unit such as a processor reading and executing software (program) recorded in a recording medium such as a ROM.
  • the software may be distributed by downloading or the like, or may be distributed by being recorded in a recording medium such as a semiconductor memory.
  • each embodiment may be realized by centralized processing using a single device (system), or may be realized by distributed processing using a plurality of devices. Good.
  • the processor that executes the program may be singular or plural. That is, centralized processing may be performed, or distributed processing may be performed.
  • the system is characterized by having an image coding apparatus using an image coding method, an image decoding apparatus using an image decoding method, and an image coding / decoding apparatus provided with both.
  • Other configurations in the system can be suitably modified as the case may be.
  • FIG. 21 is a diagram showing an overall configuration of a content supply system ex100 for realizing content distribution service.
  • the area for providing communication service is divided into desired sizes, and base stations ex106, ex107, ex108, ex109 and ex110, which are fixed wireless stations, are installed in each cell.
  • each device such as a computer ex111, a game machine ex112, a camera ex113, a home appliance ex114, and a smartphone ex115 via the Internet service provider ex102 or the communication network ex104 and the base stations ex106 to ex110 on the Internet ex101 Is connected.
  • the content supply system ex100 may connect any of the above-described elements in combination.
  • the respective devices may be connected to each other directly or indirectly via a telephone network, near-field radio, etc., not via the base stations ex106 to ex110 which are fixed wireless stations.
  • the streaming server ex103 is connected to each device such as the computer ex111, the game machine ex112, the camera ex113, the home appliance ex114, and the smartphone ex115 via the Internet ex101 or the like.
  • the streaming server ex103 is connected to a terminal or the like in a hotspot in the aircraft ex117 via the satellite ex116.
  • a radio access point or a hotspot may be used instead of base stations ex106 to ex110.
  • the streaming server ex103 may be directly connected to the communication network ex104 without the internet ex101 or the internet service provider ex102, or may be directly connected with the airplane ex117 without the satellite ex116.
  • the camera ex113 is a device capable of shooting a still image such as a digital camera and shooting a moving image.
  • the smartphone ex115 is a smartphone, a mobile phone, a PHS (Personal Handyphone System), or the like compatible with a mobile communication system generally called 2G, 3G, 3.9G, 4G, and 5G in the future.
  • the home appliance ex118 is a refrigerator or a device included in a home fuel cell cogeneration system.
  • a terminal having a photographing function when a terminal having a photographing function is connected to the streaming server ex103 through the base station ex106 or the like, live distribution and the like become possible.
  • a terminal (a computer ex111, a game machine ex112, a camera ex113, a home appliance ex114, a smartphone ex115, a terminal in an airplane ex117, etc.) transmits the still image or moving image content captured by the user using the terminal.
  • the encoding process described in each embodiment is performed, and video data obtained by the encoding and sound data obtained by encoding a sound corresponding to the video are multiplexed, and the obtained data is transmitted to the streaming server ex103. That is, each terminal functions as an image coding apparatus according to an aspect of the present disclosure.
  • the streaming server ex 103 streams the content data transmitted to the requested client.
  • the client is a computer ex111, a game machine ex112, a camera ex113, a home appliance ex114, a smartphone ex115, a terminal in the airplane ex117, or the like capable of decoding the above-described encoded data.
  • Each device that receives the distributed data decrypts and reproduces the received data. That is, each device functions as an image decoding device according to an aspect of the present disclosure.
  • the streaming server ex103 may be a plurality of servers or a plurality of computers, and may process, record, or distribute data in a distributed manner.
  • the streaming server ex103 may be realized by a CDN (Contents Delivery Network), and content delivery may be realized by a network connecting a large number of edge servers distributed around the world and the edge servers.
  • CDN Content Delivery Network
  • content delivery may be realized by a network connecting a large number of edge servers distributed around the world and the edge servers.
  • physically close edge servers are dynamically assigned according to clients. The delay can be reduced by caching and distributing the content to the edge server.
  • processing is distributed among multiple edge servers, or the distribution subject is switched to another edge server, or a portion of the network where a failure has occurred. Since the delivery can be continued bypassing, high-speed and stable delivery can be realized.
  • each terminal may perform encoding processing of captured data, or may perform processing on the server side, or may share processing with each other.
  • a processing loop is performed twice.
  • the first loop the complexity or code amount of the image in frame or scene units is detected.
  • the second loop processing is performed to maintain the image quality and improve the coding efficiency.
  • the terminal performs a first encoding process
  • the server receiving the content performs a second encoding process, thereby improving the quality and efficiency of the content while reducing the processing load on each terminal. it can.
  • the first encoded data made by the terminal can also be received and reproduced by another terminal, enabling more flexible real time delivery Become.
  • the camera ex 113 or the like extracts a feature amount from an image, compresses data relating to the feature amount as metadata, and transmits the data to the server.
  • the server performs compression according to the meaning of the image, for example, determining the importance of the object from the feature amount and switching the quantization accuracy.
  • Feature amount data is particularly effective in improving the accuracy and efficiency of motion vector prediction at the time of second compression in the server.
  • the terminal may perform simple coding such as VLC (variable length coding) and the server may perform coding with a large processing load such as CABAC (context adaptive binary arithmetic coding method).
  • a plurality of video data in which substantially the same scenes are shot by a plurality of terminals.
  • a unit of GOP Group of Picture
  • a unit of picture or a tile into which a picture is divided, using a plurality of terminals for which photographing was performed and other terminals and servers which are not photographing as necessary.
  • the encoding process is allocated in units, etc., and distributed processing is performed. This reduces delay and can realize more real time performance.
  • the server may manage and / or instruct the video data captured by each terminal to be mutually referred to.
  • the server may receive the encoded data from each terminal and change the reference relationship among a plurality of data, or may correct or replace the picture itself and re-encode it. This makes it possible to generate streams with enhanced quality and efficiency of each piece of data.
  • the server may deliver the video data after performing transcoding for changing the coding method of the video data.
  • the server may convert the encoding system of the MPEG system into the VP system, or the H.264 system. H.264. It may be converted to 265.
  • the encoding process can be performed by the terminal or one or more servers. Therefore, in the following, although the description such as “server” or “terminal” is used as the subject of processing, part or all of the processing performed by the server may be performed by the terminal, or the processing performed by the terminal Some or all may be performed on the server. In addition, with regard to these, the same applies to the decoding process.
  • the server not only encodes a two-dimensional moving image, but also automatically encodes a still image based on scene analysis of the moving image or at a time designated by the user and transmits it to the receiving terminal. It is also good. Furthermore, if the server can acquire relative positional relationship between the imaging terminals, the three-dimensional shape of the scene is not only determined based on the two-dimensional moving image but also the video of the same scene captured from different angles. Can be generated. Note that the server may separately encode three-dimensional data generated by a point cloud or the like, or an image to be transmitted to the receiving terminal based on a result of recognizing or tracking a person or an object using the three-dimensional data. Alternatively, it may be generated by selecting or reconfiguring from videos taken by a plurality of terminals.
  • the user can enjoy the scene by arbitrarily selecting each video corresponding to each photographing terminal, or from the three-dimensional data reconstructed using a plurality of images or videos, the video of the arbitrary viewpoint You can also enjoy the extracted content.
  • the sound may be picked up from a plurality of different angles as well as the video, and the server may multiplex the sound from a specific angle or space with the video and transmit it according to the video.
  • the server may create viewpoint images for the right eye and for the left eye, respectively, and may perform coding to allow reference between each viewpoint video using Multi-View Coding (MVC) or the like. It may be encoded as another stream without reference. At the time of decoding of another stream, reproduction may be performed in synchronization with each other so that a virtual three-dimensional space is reproduced according to the viewpoint of the user.
  • MVC Multi-View Coding
  • the server superimposes virtual object information in the virtual space on camera information in the real space based on the three-dimensional position or the movement of the user's viewpoint.
  • the decoding apparatus may acquire or hold virtual object information and three-dimensional data, generate a two-dimensional image according to the movement of the user's viewpoint, and create superimposed data by smoothly connecting.
  • the decoding device transmits the motion of the user's viewpoint to the server in addition to the request for virtual object information, and the server creates superimposed data in accordance with the motion of the viewpoint received from the three-dimensional data held in the server.
  • the superimposed data may be encoded and distributed to the decoding device.
  • the superimposed data has an ⁇ value indicating transparency as well as RGB
  • the server sets the ⁇ value of a portion other than the object created from the three-dimensional data to 0 etc., and the portion is transparent , May be encoded.
  • the server may set RGB values of predetermined values as a background, such as chroma key, and generate data in which the portion other than the object has a background color.
  • the decryption processing of the distributed data may be performed by each terminal which is a client, may be performed by the server side, or may be performed sharing each other.
  • one terminal may send a reception request to the server once, the content corresponding to the request may be received by another terminal and decoded, and the decoded signal may be transmitted to a device having a display. Data of high image quality can be reproduced by distributing processing and selecting appropriate content regardless of the performance of the communicable terminal itself.
  • a viewer's personal terminal may decode and display a partial area such as a tile in which a picture is divided. Thereby, it is possible to confirm at hand the area in which the user is in charge or the area to be checked in more detail while sharing the whole image.
  • encoded data over the network such as encoded data being cached on a server that can be accessed in a short time from a receiving terminal, or copied to an edge server in a content delivery service, etc. It is also possible to switch the bit rate of the received data based on ease.
  • the server may have a plurality of streams with the same content but different qualities as individual streams, but is temporally / spatial scalable which is realized by coding into layers as shown in the figure.
  • the configuration may be such that the content is switched using the feature of the stream. That is, the decoding side determines low-resolution content and high-resolution content by determining which layer to decode depending on the internal factor of performance and external factors such as the state of the communication band. It can be switched freely and decoded. For example, when it is desired to view the continuation of the video being watched by the smartphone ex115 while moving on a device such as the Internet TV after returning home, the device only has to decode the same stream to different layers, so the burden on the server side Can be reduced.
  • the picture is encoded for each layer, and the enhancement layer includes meta information based on statistical information of the image, etc., in addition to the configuration for realizing the scalability in which the enhancement layer exists above the base layer.
  • the decoding side may generate high-quality content by super-resolving a picture of the base layer based on the meta information.
  • the super resolution may be either an improvement in the SN ratio at the same resolution or an expansion of the resolution.
  • Meta information includes information for identifying linear or non-linear filter coefficients used for super-resolution processing, or information for identifying parameter values in filter processing used for super-resolution processing, machine learning or least squares operation, etc. .
  • the picture may be divided into tiles or the like according to the meaning of an object or the like in the image, and the decoding side may be configured to decode only a part of the area by selecting the tile to be decoded.
  • the decoding side can position the desired object based on the meta information And determine the tile that contains the object. For example, as shown in FIG. 23, meta information is stored using a data storage structure different from pixel data, such as an SEI message in HEVC. This meta information indicates, for example, the position, size, or color of the main object.
  • meta information may be stored in units of a plurality of pictures, such as streams, sequences, or random access units.
  • the decoding side can acquire the time when a specific person appears in the video and the like, and can identify the picture in which the object exists and the position of the object in the picture by combining the information with the picture unit.
  • FIG. 24 is a diagram showing an example of a display screen of a web page in the computer ex111 and the like.
  • FIG. 25 is a diagram showing an example of a display screen of a web page in the smartphone ex115 and the like.
  • the web page may include a plurality of link images which are links to image content, and the appearance differs depending on the browsing device.
  • the display device When multiple link images are visible on the screen, the display device until the user explicitly selects the link image, or until the link image approaches near the center of the screen or the entire link image falls within the screen
  • the (decoding device) displays still images or I pictures of each content as link images, displays images such as gif animation with a plurality of still images or I pictures, etc., receives only the base layer Decode and display.
  • the display device decodes the base layer with the highest priority.
  • the display device may decode up to the enhancement layer if there is information indicating that the content is scalable in the HTML configuring the web page.
  • the display device decodes only forward referenced pictures (I picture, P picture, forward referenced only B picture) before the selection or when the communication band is very strict. And, by displaying, it is possible to reduce the delay between the decoding time of the leading picture and the display time (delay from the start of decoding of content to the start of display).
  • the display device may roughly ignore the reference relationship of pictures and roughly decode all B pictures and P pictures with forward reference, and may perform normal decoding as time passes and the number of received pictures increases.
  • the receiving terminal when transmitting or receiving still image or video data such as two-dimensional or three-dimensional map information for automatic traveling or driving assistance of a car, the receiving terminal is added as image information belonging to one or more layers as meta information Information on weather or construction may also be received, and these may be correlated and decoded.
  • the meta information may belong to the layer or may be simply multiplexed with the image data.
  • the receiving terminal since a car including a receiving terminal, a drone or an airplane moves, the receiving terminal transmits the position information of the receiving terminal at the time of reception request to seamlessly receive and decode while switching the base stations ex106 to ex110. Can be realized.
  • the receiving terminal can dynamically switch how much meta information is received or how much map information is updated according to the user's selection, the user's situation or the state of the communication band. become.
  • the client can receive, decode, and reproduce the encoded information transmitted by the user in real time.
  • the server may perform the encoding process after performing the editing process. This can be realized, for example, with the following configuration.
  • the server performs recognition processing such as shooting error, scene search, meaning analysis, and object detection from the original image or encoded data after shooting in real time or by accumulation. Then, the server manually or automatically corrects out-of-focus or camera shake, etc. based on the recognition result, or a scene with low importance such as a scene whose brightness is low or out of focus compared with other pictures. Make edits such as deleting, emphasizing the edge of an object, or changing the color. The server encodes the edited data based on the edited result. It is also known that the audience rating drops when the shooting time is too long, and the server works not only with scenes with low importance as described above, but also moves as content becomes within a specific time range according to the shooting time. Scenes with a small amount of motion may be clipped automatically based on the image processing result. Alternatively, the server may generate and encode a digest based on the result of semantic analysis of the scene.
  • recognition processing such as shooting error, scene search, meaning analysis, and object detection from the original image or encoded data after shooting in real
  • the server may change and encode the face of a person at the periphery of the screen, or the inside of a house, etc. into an image out of focus.
  • the server recognizes whether or not the face of a person different from the person registered in advance appears in the image to be encoded, and if so, performs processing such as mosaicing the face portion. May be Alternatively, the user designates a person or background area desired to process an image from the viewpoint of copyright etc.
  • preprocessing or post-processing of encoding replaces the designated area with another video or blurs the focus. It is also possible to perform such processing. If it is a person, it is possible to replace the image of the face part while tracking the person in the moving image.
  • the decoding apparatus first receives the base layer with the highest priority, and performs decoding and reproduction, although it depends on the bandwidth.
  • the decoding device may receive the enhancement layer during this period, and may play back high-quality video including the enhancement layer if it is played back more than once, such as when playback is looped.
  • scalable coding it is possible to provide an experience in which the stream gradually becomes smart and the image becomes better although it is a rough moving image when it is not selected or when it starts watching.
  • the same experience can be provided even if the coarse stream played back first and the second stream coded with reference to the first moving image are configured as one stream .
  • these encoding or decoding processes are generally processed in an LSI ex 500 that each terminal has.
  • the LSI ex 500 may be a single chip or a plurality of chips.
  • Software for moving image encoding or decoding is incorporated in any recording medium (CD-ROM, flexible disk, hard disk, etc.) readable by computer ex111 or the like, and encoding or decoding is performed using the software. It is also good.
  • moving image data acquired by the camera may be transmitted. The moving image data at this time is data encoded by the LSI ex 500 included in the smartphone ex 115.
  • the LSI ex 500 may be configured to download and activate application software.
  • the terminal first determines whether the terminal corresponds to the content coding scheme or has the ability to execute a specific service. If the terminal does not support the content encoding method or does not have the ability to execute a specific service, the terminal downloads the codec or application software, and then acquires and reproduces the content.
  • the present invention is not limited to the content supply system ex100 via the Internet ex101, but also to a system for digital broadcasting at least a moving picture coding apparatus (image coding apparatus) or a moving picture decoding apparatus (image decoding apparatus) of the above embodiments. Can be incorporated. There is a difference in that it is multicast-oriented with respect to the configuration in which the content supply system ex100 can be easily unicasted, since multiplexed data in which video and sound are multiplexed is transmitted on broadcast radio waves using satellites etc. Similar applications are possible for the encoding process and the decoding process.
  • FIG. 26 is a diagram showing the smartphone ex115.
  • FIG. 27 is a diagram showing an example configuration of the smartphone ex115.
  • the smartphone ex115 receives an antenna ex450 for transmitting and receiving radio waves to and from the base station ex110, a camera unit ex465 capable of taking video and still images, a video taken by the camera unit ex465, and the antenna ex450 And a display unit ex ⁇ b> 458 for displaying data obtained by decoding an image or the like.
  • the smartphone ex115 further includes an operation unit ex466 that is a touch panel or the like, a voice output unit ex457 that is a speaker or the like for outputting voice or sound, a voice input unit ex456 that is a microphone or the like for inputting voice, Identify the user, the memory unit ex 467 capable of storing encoded video or still image, recorded voice, received video or still image, encoded data such as mail, or decoded data, and specify a network, etc. And a slot unit ex464 that is an interface unit with the SIM ex 468 for authenticating access to various data. Note that an external memory may be used instead of the memory unit ex467.
  • a main control unit ex460 that integrally controls the display unit ex458 and the operation unit ex466, a power supply circuit unit ex461, an operation input control unit ex462, a video signal processing unit ex455, a camera interface unit ex463, a display control unit ex459, / Demodulation unit ex452, multiplexing / demultiplexing unit ex453, audio signal processing unit ex454, slot unit ex464, and memory unit ex467 are connected via a bus ex470.
  • the power supply circuit unit ex461 activates the smartphone ex115 to an operable state by supplying power from the battery pack to each unit.
  • the smartphone ex115 performs processing such as call and data communication based on control of the main control unit ex460 having a CPU, a ROM, a RAM, and the like.
  • the audio signal collected by the audio input unit ex456 is converted to a digital audio signal by the audio signal processing unit ex454, spread spectrum processing is performed by the modulation / demodulation unit ex452, and digital analog conversion is performed by the transmission / reception unit ex451.
  • transmission is performed via the antenna ex450.
  • the received data is amplified and subjected to frequency conversion processing and analog-to-digital conversion processing, subjected to spectrum despreading processing by modulation / demodulation unit ex452, and converted to an analog sound signal by sound signal processing unit ex454.
  • Output from In the 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 of the operation unit ex466 or the like of the main unit, and transmission and reception processing is similarly performed.
  • the video signal processing unit ex 455 executes the video signal stored in the memory unit ex 467 or the video signal input from the camera unit ex 465 as described above.
  • the video data is compressed and encoded by the moving picture encoding method shown in the form, and the encoded video data is sent to the multiplexing / demultiplexing unit ex453.
  • the audio signal processing unit ex454 encodes an audio signal collected by the audio input unit ex456 while capturing a video or a still image with the camera unit ex465, and sends the encoded audio data to the multiplexing / demultiplexing unit ex453.
  • the multiplexing / demultiplexing unit ex453 multiplexes the encoded video data and the encoded audio data according to a predetermined method, and performs modulation processing and conversion by the modulation / demodulation unit (modulation / demodulation circuit unit) ex452 and the transmission / reception unit ex451. It processes and transmits via antenna ex450.
  • the multiplexing / demultiplexing unit ex453 multiplexes in order to decode multiplexed data received via the antenna ex450.
  • the multiplexed data is divided into a bit stream of video data and a bit stream of audio data, and the encoded video data is supplied to the video signal processing unit ex455 via the synchronization bus ex470, and The converted audio data is supplied to the audio signal processing unit ex 454.
  • the video signal processing unit ex 455 decodes the video signal by the moving picture decoding method corresponding to the moving picture coding method described in each of the above embodiments, and is linked from the display unit ex 458 via the display control unit ex 459. An image or a still image included in the moving image file is displayed.
  • the audio signal processing unit ex 454 decodes the audio signal, and the audio output unit ex 457 outputs the audio. Furthermore, since real-time streaming is widespread, depending on the user's situation, it may happen that sound reproduction is not socially appropriate. Therefore, as an initial value, it is preferable to be configured to reproduce only the video data without reproducing the audio signal. Audio may be synchronized and played back only when the user performs an operation such as clicking on video data.
  • the smartphone ex115 has been described as an example, in addition to a transceiving terminal having both an encoder and a decoder as a terminal, a transmitting terminal having only the encoder and a receiver having only the decoder There are three possible implementation forms: terminals. Furthermore, in the digital broadcasting system, it has been described that multiplexed data in which audio data is multiplexed with video data is received or transmitted, but in multiplexed data, character data related to video other than audio data is also described. It may be multiplexed, or video data itself may be received or transmitted, not multiplexed data.
  • the terminal often includes a GPU. Therefore, a configuration in which a large area is collectively processed using the performance of the GPU may be performed using a memory shared by the CPU and the GPU, or a memory whose address is managed so as to be commonly used. As a result, coding time can be shortened, real time property can be secured, and low delay can be realized. In particular, it is efficient to perform processing of motion search, deblock filter, sample adaptive offset (SAO), and transform / quantization collectively in units of pictures or the like on the GPU instead of the CPU.
  • SAO sample adaptive offset
  • the present disclosure is applicable to, for example, a television receiver, a digital video recorder, a car navigation system, a mobile phone, a digital camera, a digital video camera, a video conference system, an electronic mirror, and the like.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

L'invention concerne un dispositif de codage (100) qui code une image animée comprenant une pluralité d'images et est pourvu d'un circuit (150) et d'une mémoire (152). Le circuit (150) utilise la mémoire (152) pour se référer à un deuxième paramètre de probabilité associé à une deuxième image incluse dans une liste d'images de référence qui est utilisée dans une prédiction inter d'une première image parmi la pluralité d'images et initialise un premier paramètre de probabilité utilisé dans un codage entropique effectué sur la première image parmi la pluralité d'images.
PCT/JP2018/036833 2017-10-06 2018-10-02 Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage WO2019069902A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201762569178P 2017-10-06 2017-10-06
US62/569,178 2017-10-06

Publications (1)

Publication Number Publication Date
WO2019069902A1 true WO2019069902A1 (fr) 2019-04-11

Family

ID=65994928

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2018/036833 WO2019069902A1 (fr) 2017-10-06 2018-10-02 Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage

Country Status (2)

Country Link
TW (1) TW201924338A (fr)
WO (1) WO2019069902A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111566584A (zh) * 2019-06-28 2020-08-21 深圳市大疆创新科技有限公司 一种图像处理的方法、装置和无人机
US11425414B2 (en) * 2019-08-05 2022-08-23 Tencent America LLC Method and apparatus for video coding

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2011055180A (ja) * 2009-09-01 2011-03-17 Nippon Telegr & Teleph Corp <Ntt> コンテクスト適応エントロピ符号化方法および装置，コンテクスト適応エントロピ復号方法および装置，並びにそれらのプログラム
WO2012114693A1 (fr) * 2011-02-24 2012-08-30 パナソニック株式会社 Procédé de décodage arithmétique et procédé de codage arithmétique
US20160353108A1 (en) * 2015-05-29 2016-12-01 Qualcomm Incorporated Advanced arithmetic coder
JP2016201837A (ja) * 2011-06-24 2016-12-01 サン パテント トラスト 復号方法及び復号装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2011055180A (ja) * 2009-09-01 2011-03-17 Nippon Telegr & Teleph Corp <Ntt> コンテクスト適応エントロピ符号化方法および装置，コンテクスト適応エントロピ復号方法および装置，並びにそれらのプログラム
WO2012114693A1 (fr) * 2011-02-24 2012-08-30 パナソニック株式会社 Procédé de décodage arithmétique et procédé de codage arithmétique
JP2016201837A (ja) * 2011-06-24 2016-12-01 サン パテント トラスト 復号方法及び復号装置
US20160353108A1 (en) * 2015-05-29 2016-12-01 Qualcomm Incorporated Advanced arithmetic coder

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
CHEN, JIANLE ET AL.: "Further improvements to HMKTA-1.0", 26 June 2015 (2015-06-26), XP030003885, Retrieved from the Internet <URL:http://wftp3.itu.int/av-arch/video-site/1506_War/VCEG-AZ07.zip> *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111566584A (zh) * 2019-06-28 2020-08-21 深圳市大疆创新科技有限公司 一种图像处理的方法、装置和无人机
US11425414B2 (en) * 2019-08-05 2022-08-23 Tencent America LLC Method and apparatus for video coding

Also Published As

Publication number Publication date
TW201924338A (zh) 2019-06-16

Similar Documents

Publication Publication Date Title
JP6765520B2 (ja) 符号化装置、復号装置、符号化方法及び復号方法
JP6946419B2 (ja) 復号装置、復号方法及びプログラム
JP7087030B2 (ja) 符号化装置、復号装置、符号化方法及び復号方法
WO2019022099A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
WO2019009129A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
JP6756919B2 (ja) 復号装置及び復号方法
JP2022008413A (ja) 復号装置、符号化装置及び記録媒体
WO2019065444A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
JPWO2019155971A1 (ja) 符号化装置、復号装置、符号化方法及び復号方法
WO2019098152A1 (fr) Dispositif et procédé de codage, et dispositif et procédé de décodage
WO2019138998A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
WO2019013236A1 (fr) Dispositif de codage, procédé de codage, dispositif de décodage et procédé de décodage
WO2019069968A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
WO2019069782A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
JP2022093625A (ja) 符号化装置、復号装置、符号化方法、及び復号方法
JP2021180494A (ja) 復号装置、復号方法、及び、非一時的記憶媒体
WO2019009314A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage, et procédé de décodage
WO2019131364A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage, et procédé de décodage
WO2019163794A1 (fr) Dispositif de codage, et procédé de codage
WO2019124191A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage, et procédé de décodage
WO2019069902A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
WO2019059107A1 (fr) Dispositif d&#39;encodage, dispositif de décodage, procédé d&#39;encodage et procédé de décodage
WO2019021803A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage, et procédé de décodage
WO2019065329A1 (fr) Dispositif et procédé de codage, et dispositif et procédé de décodage
WO2019031369A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18865313

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18865313

Country of ref document: EP

Kind code of ref document: A1