WO2019031369A1 - 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
WO2019031369A1
WO2019031369A1 PCT/JP2018/028946 JP2018028946W WO2019031369A1 WO 2019031369 A1 WO2019031369 A1 WO 2019031369A1 JP 2018028946 W JP2018028946 W JP 2018028946W WO 2019031369 A1 WO2019031369 A1 WO 2019031369A1
Authority
WO
WIPO (PCT)
Prior art keywords
processing
fruc
block
unit
decoding
Prior art date
Application number
PCT/JP2018/028946
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 WO2019031369A1 publication Critical patent/WO2019031369A1/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/103—Selection of coding mode or of prediction mode
    • H04N19/105—Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction
    • 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/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • 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/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/136—Incoming video signal characteristics or properties
    • 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/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/156—Availability of hardware or computational resources, e.g. encoding based on power-saving criteria
    • 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/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock

Definitions

  • the present disclosure relates to an encoding device, a decoding device, an encoding method, and a decoding method.
  • H. H.264 ITU-T International Telecommunication Union Telecommunication Standardization Division
  • ISO / IEC ISO / IEC standard
  • MPEG-4 AVC MPEG-4 AVC
  • An object of the present disclosure is to provide a decoding device, an encoding device, a decoding method, or an encoding method capable of suppressing processing delay.
  • An encoding apparatus includes a circuit and a memory, and the circuit uses the memory to generate a FRUC (frame rate up-based on first information related to processing time at the time of decoding). conversion) It is determined whether or not to prohibit processing, and when it is determined to inhibit the FRUC processing, one prediction mode is selected from a plurality of prediction modes not including the FRUC processing, and the code is not used without using the FRUC processing. If it is determined that the FRUC process is not prohibited, one prediction mode is selected from a plurality of prediction modes including the FRUC process, and it is determined whether the selected prediction mode is a mode for performing the FRUC process. Coding is performed using the FRUC process or not using the FRUC process to indicate whether the FRUC process is used or not Generating a coded bit stream including the second information.
  • FRUC frame rate up-based on first information related to processing time at the time of decoding). conversion
  • a decoding device is a decoding device that decodes the coded bit stream generated by the coding device, and includes a circuit and a memory, and the circuit uses the memory. According to the second information included in the coded bit stream, decoding is performed using the FRUC process or without using the FRUC process.
  • the present disclosure can provide a decoding device, an encoding device, a decoding method, or an encoding method that can suppress processing delay.
  • 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 schematic view showing an example of the first pipeline structure.
  • FIG. 12 is a schematic view showing an example of block division used for describing pipeline processing.
  • FIG. 13 is a time chart showing an example of processing timing in the first pipeline structure example.
  • FIG. 14 is a schematic diagram showing an example of a second pipeline structure.
  • FIG. 15 is a time chart showing an example of processing timing in the second example of the pipeline structure.
  • FIG. 16 is a schematic diagram showing an example of a third pipeline structure.
  • FIG. 17 is a time chart showing an example of processing timing in the third pipeline structural example.
  • FIG. 18 is a flowchart of the encoding process by the encoding device.
  • FIG. 19 is a flowchart of a first example of the encoding process.
  • FIG. 20 is a flowchart of the decoding process by the decoding device.
  • FIG. 21 is a flowchart of a second example of the encoding process.
  • FIG. 22 is a flowchart of a third example of the encoding process.
  • FIG. 23 is a flowchart of a fourth example of the encoding process.
  • FIG. 24 is a block diagram showing an implementation example of the coding apparatus according to Embodiment 1.
  • FIG. 24 is a block diagram showing an implementation example of the coding apparatus according to Embodiment 1.
  • FIG. 25 is a block diagram showing an implementation example of the decoding apparatus according to Embodiment 1.
  • FIG. 26 is an overall configuration diagram of a content supply system for realizing content distribution service.
  • FIG. 27 is a diagram illustrating an example of a coding structure at the time of scalable coding.
  • FIG. 28 is a diagram illustrating an example of a coding structure at the time of scalable coding.
  • FIG. 29 is a view showing an example of a display screen of a web page.
  • FIG. 30 is a diagram showing an example of a display screen of a web page.
  • FIG. 31 is a diagram illustrating an example of a smartphone.
  • FIG. 32 is a block diagram showing a configuration example of a smartphone.
  • the encoding apparatus encodes an image block by block.
  • the encoding apparatus may use inter-frame prediction or intra-frame prediction when encoding an image block by block.
  • inter-screen prediction is used to encode the current block
  • the encoding device detects a motion vector of the current block, and generates a predicted image of the current block using the detected motion vector. Then, the coding apparatus reduces the code amount by coding a difference image between the predicted image of the current block and the original image of the current block.
  • the encoding apparatus encodes motion vector information indicating a motion vector, and the decoding apparatus decodes the motion vector information. Furthermore, the decoding device decodes the difference image. Then, the decoding apparatus generates a predicted image of the current block using the motion vector indicated by the decoded motion vector information, and reconstructs the original image by adding the predicted image and the difference image. Thereby, the decoding device can decode the image.
  • the encoding device encodes the motion vector information, and the decoding device decodes the motion vector information, whereby the decoding device appropriately generates a predicted image of the current block using the motion vector used by the encoding device. be able to.
  • coding of motion vector information may increase the code amount.
  • the encoding device and the decoding device may use a technique called Frame Rate Up-Conversion (FRUC) to reduce such code amount.
  • FRUC Frame Rate Up-Conversion
  • the encoding device and the decoding device derive motion vectors in the same manner in the encoding device and the decoding device without encoding and decoding motion vector information.
  • the encoding device and the decoding device derive the motion vector of the current block using a template configured with a reconstructed image around the current block, without using the current block.
  • the encoding device and the decoding device can derive the motion vector in the same manner in the encoding device and the decoding device without encoding and decoding the motion vector information. Therefore, the code amount is reduced.
  • the encoding device and the decoding device can not use a template composed of reconstructed images around the current block until reconstructed images around the current block are generated. Therefore, in the process of deriving a motion vector by the template FRUC method, a delay may occur.
  • An encoding apparatus includes a circuit and a memory, and the circuit uses the memory to generate a FRUC (frame rate up-based on first information related to processing time at the time of decoding). conversion) It is determined whether or not to prohibit processing, and when it is determined to inhibit the FRUC processing, one prediction mode is selected from a plurality of prediction modes not including the FRUC processing, and the code is not used without using the FRUC processing. If it is determined that the FRUC process is not prohibited, one prediction mode is selected from a plurality of prediction modes including the FRUC process, and it is determined whether the selected prediction mode is a mode for performing the FRUC process. Coding is performed using the FRUC process or not using the FRUC process to indicate whether the FRUC process is used or not Generating a coded bit stream including the second information.
  • FRUC frame rate up-based on first information related to processing time at the time of decoding). conversion
  • the processing time at the time of decoding can be appropriately reduced, for example, the waiting time in pipeline control at the time of decoding can be reduced.
  • the first information is a size of a block to be processed, and the determination as to whether or not to inhibit the FRUC process prohibits the FRUC process when the size is larger than a predetermined threshold. You may decide.
  • the first information is the size of the block to be processed and the size of the block immediately before the block to be processed, and in the determination of whether or not to inhibit the FRUC process, the first information If the size is larger than the size of the immediately preceding block, it may be determined to inhibit the FRUC process.
  • the processing time can be reduced at the timing when the possibility of the waiting time is high, the waiting time can be efficiently reduced.
  • the first information is the number of blocks encoded using the FRUC process among a plurality of blocks, and the number of blocks is previously determined in the determination as to whether or not the FRUC process is inhibited. If it is larger than the threshold, it may be determined to prohibit the FRU processing.
  • the processing time can be reduced at the timing when the waiting time becomes long, the waiting time can be efficiently reduced. In addition, it is possible to suppress unnecessary prohibition of the FRCU processing.
  • the first information is a ratio of blocks encoded using the FRUC processing among a plurality of blocks, and the ratio of the blocks is predetermined in the determination of whether or not to inhibit the FRUC processing. If it is larger than the threshold, it may be determined to prohibit the FRU processing.
  • the processing time can be reduced at the timing when the waiting time becomes long, the waiting time can be efficiently reduced. In addition, it is possible to suppress unnecessary prohibition of the FRCU processing.
  • the plurality of blocks may be a plurality of blocks included in a coding tree unit (CTU) to which a block to be processed belongs and one or more coding tree units processed immediately before.
  • CTU coding tree unit
  • the plurality of blocks may be a plurality of blocks included in a slice or a picture to which a block to be processed belongs.
  • the first information is the number of consecutive blocks encoded using the FRUC process immediately before the block to be processed, and in the determination of whether to inhibit the FRUC process, the block It may be determined that the FRUC process is to be prohibited if the consecutive number is greater than a predetermined threshold.
  • the processing time can be reduced at the timing when the waiting time becomes long, the waiting time can be efficiently reduced. In addition, it is possible to suppress unnecessary prohibition of the FRCU processing.
  • the first information is a waiting time in pipeline control at the time of decoding, and in the determination of whether to inhibit the FRUC process, the waiting time is estimated, and the estimated waiting time is determined in advance. If it is larger than the threshold, it may be determined to prohibit the FRU processing.
  • the processing time can be reduced at the timing when the waiting time becomes long, the waiting time can be efficiently reduced. In addition, it is possible to suppress unnecessary prohibition of the FRCU processing.
  • the circuit uses the memory, and further, a parameter related to the determination as to whether or not to inhibit the FRUC process is included in the encoded bit stream, a sequence header area, a picture header area, a slice header area Or may be encoded in the side information area.
  • the circuit may switch, using the memory, a parameter related to the determination as to whether or not the FRUC process is to be prohibited, according to the size of the picture to be processed.
  • the circuit may switch, using the memory, a parameter related to the determination as to whether or not to inhibit the FRU processing according to the processing capability of the decoding device.
  • the circuit may switch, using the memory, a parameter related to the determination as to whether or not to inhibit the FRUC process according to a profile or a level assigned to the encoded bit stream.
  • a decoding device is a decoding device that decodes the coded bit stream generated by the coding device, and includes a circuit and a memory, and the circuit uses the memory. According to the second information included in the coded bit stream, decoding is performed using the FRUC process or without using the FRUC process.
  • the processing time at the time of decoding can be appropriately reduced, for example, the waiting time in pipeline control at the time of decoding can be reduced.
  • the encoding method determines whether or not to prohibit frame rate up-conversion (FRUC) processing based on first information related to processing time at the time of decoding, and prohibits the FRUC processing. If it is determined, one prediction mode is selected from a plurality of prediction modes not including the FRUC processing, encoding is performed without using the FRUC processing, and it is determined that the FRUC processing is not inhibited, the FRUC processing is performed.
  • FRUC frame rate up-conversion
  • one prediction mode is selected from a plurality of prediction modes including and the selected prediction mode is a mode for performing a FRUC process, using the above-mentioned FRUC process or without using the above-mentioned FRUC process Encoding is performed to generate an encoded bit stream including second information indicating whether the FRUC process is to be used.
  • the processing time at the time of decoding can be appropriately reduced, for example, the waiting time in pipeline control at the time of decoding can be reduced.
  • the decoding method is a decoding method for decoding the coded bit stream generated by the coding method, according to the second information included in the coded bit stream. Decryption is performed using or without the FRUC process.
  • the processing time at the time of decoding can be appropriately reduced, for example, the waiting time in pipeline control at the time of decoding can be reduced.
  • 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 schematic view showing an example of the first pipeline structure.
  • the first pipeline structure example illustrated in FIG. 11 is a pipeline structure example for decoding an image, and may be used by the decoding device 200.
  • the first pipeline structure example includes three stages of a first stage, a second stage, and a third stage. Also, the first stage includes entropy decoding (S101).
  • the second stage includes MVP calculation (S102), FRUC (S103), MC / BIO (S104), OBMC (S105), intra prediction (S106), switching (S107), inverse quantization inverse transform (S108), and , Addition (S109).
  • the third stage includes a loop filter (S110).
  • variable-length decoding is performed on the input stream.
  • quantization coefficients and the like can be obtained.
  • MVP calculation a predicted motion vector (MVP) is calculated.
  • MVP predicted motion vector
  • FRUC a motion vector of the current coding unit is derived using pixel values of an area different from that of the current coding unit which is a processing target coding unit.
  • a prediction image is generated by motion compensation (MC). Also, deformation may be applied to the predicted image by BIO.
  • OBMC S105
  • the current picture is encoded by mixing the predicted picture of the current coding unit, which is the processing target coding unit, and the predicted picture of the adjacent coding unit, which is the coding unit adjacent to the current coding unit. The predicted image of the unit is updated.
  • intra prediction a predicted image of the current coding unit is generated with reference to the coding unit in the current picture which is a processing target picture.
  • switching a predicted image obtained by inter-screen prediction such as MVP calculation (S102), FRUC (S103), MC / BIO (S104), and OBMC (S105), and intra-screen prediction (S106) And the predicted image to be displayed.
  • the loop filter (S110) applies a filter to the reconstructed image. Thereby, for example, distortion between coding units is suppressed. Then, the reconstructed image to which the filter is applied is output.
  • the reconstructed image reproduced in the second stage is fed back to FRUC (S103) and intra prediction (S106) because it is referred to in the processing of the peripheral coding unit.
  • FRUC FRUC
  • S106 intra prediction
  • the immediately preceding code in processing order It is possible to refer to the reconstruction image of the standardization unit.
  • the second stage includes many processes. Therefore, the processing time of the second stage is long.
  • the first pipeline structure example is an example of a pipeline structure, and processing may be partially removed, processing may be partially added, and the division method of the stage is changed. It may be done. Also, the processing time corresponds to the processing amount or the number of processing cycles.
  • FIG. 12 is a schematic view showing an example of block division used for describing pipeline processing.
  • Two coding tree units are shown in the block division example shown in FIG.
  • One coding tree unit includes two coding units CU0 and CU1, and the other coding tree unit includes three coding units CU2, CU3 and CU4.
  • the coding units CU0, CU1 and CU4 are of the same size as one another.
  • the coding units CU2 and CU3 are of the same size as one another.
  • the size of each of the coding units CU0, CU1 and CU4 is twice the size of each of the coding units CU2 and CU3.
  • FIG. 13 is a time chart showing an example of processing timing in the first pipeline structure example.
  • FIG. 13 shows processing timings of the five coding units CU0 to CU4 shown in FIG. Further, S1 to S3 in FIG. 13 indicate processing times of the first to third stages in FIG.
  • each of coding units CU0, CU1 and CU4 is twice the size of each of coding units CU2 and CU3
  • the processing time of each stage is also doubled for coding units CU0, CU1 and CU4. is there.
  • the processing time of the second stage is twice that of the other stages. Also, in each stage, after the processing of the same stage for the immediately preceding coding unit is finished, the processing of the same stage for the next coding unit is started.
  • the process of the second stage for the coding unit CU1 is started from time t6 when the process of the second stage for the coding unit CU0 is finished. Since the processing time of the second stage is twice that of the other stages, for the encoding unit CU1, the waiting time is from time t4 when processing of the first stage is finished to time t6 when processing of the first stage starts It has occurred.
  • a waiting time always occurs at the start of the second stage processing. Then, the waiting time is accumulated for each of the coding units CU1, CU2, CU3 and CU4. Then, for the coding unit CU4, a waiting time occurs from time t8 when the processing of the first stage is finished to time t14 when the processing of the second stage starts.
  • the processing time including the waiting time increases to about twice the original processing time excluding the waiting time, and the processing can not be completed within the time allocated to one picture. There is sex.
  • FIG. 14 is a schematic diagram showing an example of a second pipeline structure.
  • the second stage of the first pipeline structure example of FIG. 11 is divided into two stages. That is, the second pipeline structure example includes four stages of a first stage, a second stage, a third stage, and a fourth stage.
  • the first stage includes entropy decoding (S101).
  • the second stage includes MVP calculation (S102) and FRUC (S103).
  • the third stage includes MC / BIO (S104), OBMC (S105), intra prediction (S106), switching (S107), inverse quantization inverse transform (S108), and addition (S109).
  • the fourth stage includes a loop filter (S110).
  • the FRUC (S103) referring to the reconstructed image and the addition (S109) generating the reconstructed image are performed in two different stages by feedback delay control.
  • the processing time of each of the second stage and the third stage in the second pipeline structure example becomes about half of the processing time of the second stage in the first pipeline structure example.
  • the feedback delay control is, for example, control for delaying the reconstructed image generated in the third stage to be able to be referred to in the second stage of FRUC (S103).
  • the first pipeline structure example is an example of a pipeline structure, and processing may be partially removed, processing may be partially added, and the division method of the stage is changed. It may be done.
  • intra prediction (S106) for referring to the reconstructed image and addition (S109) for generating the reconstructed image are performed in the same stage. This makes it possible to refer to the reconstructed image of the immediately preceding encoding unit in intra prediction (S106).
  • Intra-screen prediction is performed with a smaller processing amount than inter-screen prediction such as MVP calculation (S102), FRUC (S103), MC / BIO (S104), and OBMC (S105). Therefore, even if intra-frame prediction (S106) and addition (S109) are performed in the same stage, the waiting time is less likely to be longer than inter-frame prediction.
  • inter-screen prediction such as MVP calculation (S102), FRUC (S103), MC / BIO (S104), and OBMC (S105). Therefore, even if intra-frame prediction (S106) and addition (S109) are performed in the same stage, the waiting time is less likely to be longer than inter-frame prediction.
  • intra prediction (S106) for referring to the reconstructed image and addition (S109) for generating the reconstructed image are performed at the same stage.
  • feedback delay control may be performed in two different stages: intra prediction (S106) that refers to a reconstructed image and addition (S109) that generates a reconstructed image.
  • the entropy decoding unit 202 performs entropy decoding (S101). Further, the inter prediction unit 218 performs MVP calculation (S102), FRUC (S103), MC / BIO (S104), and OBMC (S105).
  • S101 entropy decoding
  • inter prediction unit 218 performs MVP calculation (S102), FRUC (S103), MC / BIO (S104), and OBMC (S105).
  • the intra prediction unit 216 performs intra prediction (S106). Further, the prediction control unit 220 performs switching (S107). Also, the inverse quantization unit 204 and the inverse transform unit 206 perform inverse quantization inverse transform (S108). Further, the adding unit 208 performs addition (S109). Also, the loop filter unit 212 performs a loop filter (S110).
  • the reconstructed image generated by the adding unit 208 is stored in the block memory 210.
  • the inter prediction unit 218 performs FRUC (S103) with reference to the reconstructed image stored in the block memory 210.
  • the reconstructed image of the immediately preceding encoding unit is stored in the block memory 210 during processing of FRUC (S103) of the processing target encoding unit, and the immediately preceding encoding is performed.
  • the reconstructed image of the unit is referenced.
  • the reconstructed image of the immediately preceding encoding unit is not stored in the block memory 210 at the time of processing of the FRUC (S103) of the processing target encoding unit, and the immediately preceding encoding is performed.
  • the unit's reconstructed image is not referenced.
  • the encoding apparatus 100 also performs feedback delay control similarly to the decoding apparatus 200.
  • the plurality of components of the decoding device 200 and the decoding device 200 in the description herein may be replaced with the coding device 100 and a plurality of components of the coding device 100.
  • FIG. 15 is a time chart showing an example of processing timing in the second example of the pipeline structure.
  • FIG. 15 shows processing timings of the five coding units CU0 to CU4 shown in FIG. Further, S1 to S4 in FIG. 15 indicate processing times of the first to fourth stages in FIG.
  • each of coding units CU0, CU1, and CU4 is twice that of each of coding units CU2 and CU3
  • each of coding units CU0, CU1, and CU4 Stage processing time is also doubled.
  • the processing time of each stage is equal to the processing time of the other stages.
  • the amount of delay for delaying the reconstructed image in feedback delay control is one encoding unit. That is, in FRUC (S103) for each coding unit, reference to the immediately preceding coding unit is prohibited in the processing order. Reference to two or more previous coding units is not prohibited in the processing order.
  • the second stage of coding unit CU4 does not wait for the end of the third stage for coding unit CU3. Processing is started. On the other hand, since the reference to the coding unit CU2 is not prohibited, the processing of the second stage for the coding unit CU4 is started after the end of the third stage for the coding unit CU2.
  • a waiting time occurs from time t8 when the process of the first stage is finished to time t9 when the process of the second stage starts.
  • the waiting time is significantly reduced.
  • the processing time including the waiting time is prevented from significantly increasing more than the original processing time excluding the waiting time, and the processing is completed within the time allocated to one picture. The chance of being able to
  • FIG. 16 is a schematic diagram showing an example of a third pipeline structure.
  • the difference between the third pipeline configuration example shown in FIG. 16 and the second pipeline configuration example shown in FIG. 14 is that in the second stage, a path that enables the use of FRUC processing and a path that disables use of the FRUC processing Can be dynamically switched.
  • the processing amount (processing time) of the second stage will be the same as in the second example, but if you select a path that disables the use of FRUC processing, The processing amount (processing time) of the two stages is significantly smaller than that of the second example.
  • FIG. 17 is a time chart showing an example of processing timing in the third pipeline structure example shown in FIG. The difference from the example described in FIG. 15 is that a path for which the use of the FRUC process is prohibited is selected in the second stage of CU4. As a result, the processing time of the second stage of CU 4, which was t 2 in FIG. 15, is reduced to t 1.
  • a waiting time of t1 time occurs from the end of the processing of the first stage to the start of the processing of the second stage, but in FIG. Since the processing time is t1 time, the process ends at time t10. This reduces the waiting time of t1 which has occurred.
  • FIG. 18 is a flowchart of the coding process by the moving picture coding apparatus according to the present embodiment.
  • the encoding apparatus determines whether to prohibit the FRUC processing based on the first information related to the processing time at the time of decoding (S201).
  • the first information is information related to the waiting time in pipeline control at the time of decoding. The details of the first information will be described later.
  • the encoding apparatus selects one of the prediction modes including the FRUC processing. Is selected (S202). For example, the coding apparatus calculates costs for a plurality of candidate prediction modes, and selects the mode with the lowest cost. For example, the cost is calculated using the amount of encoded data when the mode is used, the residual (difference between the original image and the decoded image), and the like. That is, the smaller the amount of encoded data and the smaller the residual, the lower the cost.
  • the encoding apparatus performs the encoding using the FRUC process (S205). If the selected mode is not the mode for performing the FRUC process (No in S204), the encoding apparatus performs the encoding without using the FRUC process (S206). Specifically, the coding apparatus performs coding using an inter prediction process that does not include the FRUC process, an intra prediction process, or the like.
  • the encoding apparatus encodes the second information indicating whether or not the FRUC mode is used according to the determination result into a stream (S207). That is, the coding apparatus generates a coded bit stream including second information indicating whether or not the FRUC process is used.
  • FIG. 19 is a flowchart of a first example of determining prohibition of the FRU processing. 19 differs from FIG. 18 in that step S201 is replaced with S201A.
  • the encoding apparatus determines whether the size of the processing target CU is equal to or greater than the first threshold (S201A). For example, as the first threshold, any size may be used as long as it can be selected as a CU such as 64 ⁇ 64, 64 ⁇ 32, or 32 ⁇ 32.
  • the encoding apparatus selects one mode from a plurality of prediction modes not including the FRUC processing (S203), and performs the FRUC processing Encoding is performed without using (S206).
  • the encoding apparatus selects one mode from a plurality of prediction modes including the FRUC processing (S202), and the result is In response, encoding is performed using the FRUC processing (S205) or without using the FRUC processing (S206).
  • the encoding apparatus determines to inhibit the FRU processing when the size of the block to be processed (for example, CU) is larger than a predetermined threshold.
  • the coding apparatus includes a sequence header area, a picture header area, a slice header area, and the like, which are included in the coded bit stream, information related to the determination process of step S201A (parameters related to determination of whether to inhibit the FRUC process) Alternatively, it may be encoded in the auxiliary information area or the like.
  • the information related to the determination process is, for example, information indicating the first threshold. Further, the information may include information indicating whether or not the determination process of step S201A has been performed.
  • the encoding apparatus may adaptively switch information related to the determination process (the first threshold or whether or not to perform the determination process) according to the size of the picture to be processed.
  • the coding device may switch between them adaptively depending on the processing capability of the coding device or the decoding device.
  • the encoding device may switch between them according to a predefined profile or level. That is, the encoding apparatus may switch between them depending on the profile or level assigned to the encoded bit stream.
  • the encoding apparatus sets the first threshold to a large first value when the size of the picture is larger than a predetermined size, and sets the first threshold when the size of the picture is smaller than a predetermined size. , A second value smaller than the first value is set. In this way, it is possible to realize control suitable for how to select the size of a CU that varies depending on the size of the picture.
  • the encoding apparatus may determine to prohibit the FRUC process for all CU sizes. As a result, processing time can be shortened in a large-sized picture that does not have enough processing time.
  • the encoding apparatus may determine not to prohibit the FRUC process for all CU sizes. As a result, it is possible to suppress a decrease in coding efficiency in a small-sized picture with ample processing time.
  • the encoding apparatus can use the FRUC processing with more CUs by setting the first threshold to a large first value if the processing capability of the encoding apparatus or the decoding apparatus is higher than a predetermined reference. As a reduction in coding efficiency.
  • the coding apparatus sets the first threshold to a second value smaller than the first value if the processing capability of the coding apparatus or the decoding apparatus is lower than a predetermined reference, thereby allowing more CUs.
  • the processing time can be shortened by disabling the use of FRUC processing.
  • generated encoding bit stream is decided beforehand, the encoding apparatus is grasping
  • a profile is defined for a stream of images and indicates a set of available technical elements.
  • a level is defined for a stream of images and indicates a set of available parameter ranges. Profiles and levels may be predetermined. The inter prediction units 126 and 218 may switch whether to perform the first threshold or the determination process according to such a profile or level.
  • FIG. 20 is a flowchart of a decoding process in a moving picture decoding apparatus that decodes a coded bit stream generated by such a coding apparatus.
  • the decoding apparatus decodes second information indicating whether or not the FRUC process is used from the encoded bit stream (S211).
  • the decoding apparatus performs the decoding process using the FRUC process (S213).
  • the decoding apparatus performs the decoding processing without using the FRUC processing (S214).
  • the decoding apparatus performs the decoding using or not using the FRUC process according to the second information included in the coded bit stream. This makes it possible to repeat the waiting time of pipeline control as described in FIG.
  • the decoding device does not necessarily have to perform the process using the information, but the decoding device By referring to the information, for example, it can be determined whether the encoded bit stream has a format that can be decoded by the decoding device.
  • FIG. 21 is a flowchart of a second example for determining prohibition of the FRU processing. 21 differs from FIG. 19 in that step S201A is replaced with S201B.
  • the encoding apparatus determines whether the size of the processing target CU is larger than the size of the CU processed immediately before (S201B).
  • the encoding apparatus may determine whether the size of the processing target CU is larger than the size of the CU processed immediately before by a second threshold value or more.
  • the second threshold is, for example, 2 times or 4 times.
  • the encoding apparatus selects one of a plurality of prediction modes not including the FRUC processing (S203) Encoding is performed without using the FRUC process (S206). If it is determined that the size of the processing target CU is equal to or less than the size of the CU processed immediately before (No in S201B), the encoding apparatus selects one of a plurality of prediction modes including the FRU processing (S202) Depending on the result, encoding is performed using the FRUC processing (S205) or without using the FRUC processing (S206).
  • the coding apparatus determines to inhibit the FRU processing when the size of the block to be processed is larger than the size of the immediately preceding block.
  • the latency in pipeline control is generated by processing of a CU of a large size and processing of a CU of a smaller size. Therefore, as in CU4 of FIG. 17, the processing time of the second stage is shortened without performing the FRUC processing at the timing when the size of the processing target CU becomes larger than the size of the CU processed immediately before. As a result, it is possible to efficiently delay the generated waiting time and to complete processing within the time allocated to one picture.
  • the encoding apparatus includes, in the encoded bit stream, a sequence header area including information related to the determination process of step S201B (a parameter related to determination as to whether or not to inhibit the FRUC process). It may be encoded in a picture header area, a slice header area, a side information area, or the like.
  • the information related to the determination process is, for example, information indicating the second threshold. Further, the information may include information indicating whether or not the determination process of step S201B has been performed.
  • the coding apparatus determines whether or not to perform the second threshold or the determination process, (1) the size of a picture, and (2) the process of the coding apparatus or the decoding apparatus. Depending on the capabilities or (3) predefined profiles or levels may be switched.
  • the processing of the decoding device is the same as in the first example.
  • FIG. 22 is a flowchart of a third example of determining prohibition of the FRU processing. 22 differs from FIG. 19 in that step S201A is replaced with S201C.
  • the encoding apparatus determines whether or not a CU using FRUC has occurred at the third threshold or more by the time of processing the processing target CU (S201C).
  • the encoding apparatus selects one of a plurality of prediction modes not including the FRUC processing (S203), and performs the FRUC processing Encoding is performed without using (S206). If it is determined that the CU using FRUC is less than the third threshold (No in S201C), the encoding apparatus selects one mode from a plurality of prediction modes including the FRUC processing (S202), In response, encoding is performed using the FRUC processing (S205) or without using the FRUC processing (S206).
  • the encoding apparatus determines whether or not a CU using FRUC has generated a third threshold or more, any one of the following methods, a method combining a plurality of the following methods, or the following method and other methods The determination is made using a method combined with information.
  • the encoding apparatus determines whether the number of CUs subjected to the FRUC process in a predetermined period is equal to or more than a third threshold. That is, the encoding apparatus performs the FRUC processing when the number of blocks encoded using the FRUC processing among the plurality of blocks included in the predetermined range immediately before the processing target CU is larger than a predetermined threshold value. Decide to ban.
  • the encoding apparatus determines whether or not the proportion of CUs subjected to the FRUC processing within a predetermined period is equal to or greater than a threshold. That is, the encoding apparatus performs the FRUC processing when the ratio of blocks encoded using the FRUC processing among the plurality of blocks included in the predetermined range immediately before the processing target CU is larger than a predetermined threshold value. Decide to ban.
  • the ratio may be a value calculated from the number of CUs included in the predetermined period and the number of CUs subjected to the FRUC process, or the total of the area of CUs included in the predetermined period and the FRUC process It may be a value calculated from the sum of the areas of the CUs performed.
  • the predetermined period in the above (1) and (2) is, for example, a processing period of a constant CTU immediately before the processing target CU, or a processing period of the entire slice or the entire picture to which the processing target CU belongs.
  • the plurality of blocks included in the predetermined range are the coding tree unit (CTU) to which the block to be processed belongs and the plurality of blocks included in one or more coding tree units processed immediately before, or the processing target It is a plurality of blocks included in a slice or picture to which the block belongs.
  • the encoding apparatus determines whether the number of CUs subjected to the FRUC processing consecutively immediately before the processing target CU is equal to or more than a threshold. That is, the encoding apparatus determines to inhibit the FRUC processing when the number of consecutive blocks encoded using the FRUC processing immediately before the block to be processed is larger than a predetermined threshold.
  • the latency in pipeline control is accumulated and lengthened as processing of the CU progresses. Therefore, as in CU4 of FIG. 17, the processing time of the second stage is shortened without performing the FRUC processing at a specific frequency. As a result, the generated waiting time is delayed, and the possibility of completing the process in the time allocated to one picture is increased.
  • the processing time of the second stage is shortened without performing the FRUC processing at a specific frequency.
  • the generated waiting time is delayed, and the possibility of completing the process in the time allocated to one picture is increased.
  • a large number of CUs for which the FRUC mode has not been selected by the normal mode determination process are generated, it is possible to suppress an increase in the number of CUs that can not use the FRUC process more than necessary. There is a high possibility of doing it.
  • the encoding apparatus includes, in the encoded bit stream, a sequence header area including information related to the determination process of step S201C (a parameter related to determination as to whether or not to inhibit the FRUC process). It may be encoded in a picture header area, a slice header area, a side information area, or the like.
  • the information related to the determination process is, for example, information indicating the third threshold. Further, the information may include information indicating whether or not the determination process of step S201C has been performed.
  • the encoding apparatus determines whether the third threshold or the determination process is performed, (1) the size of the picture, and (2) the process of the encoding apparatus or the decoding apparatus. Depending on the capabilities or (3) predefined profiles or levels may be switched.
  • the processing of the decoding device is the same as in the first example.
  • FIG. 23 is a flowchart of a fourth example for determining prohibition of the FRU processing. 23 differs from FIG. 19 in that step S201A is replaced with S201D.
  • the encoding apparatus determines whether the estimated waiting time in pipeline control has become equal to or greater than the fourth threshold when processing the processing target CU (S201D).
  • the encoding apparatus selects one of a plurality of prediction modes not including the FRUC processing (S203), and uses the FRUC processing The encoding is performed without (S206). If it is determined that the estimated waiting time is less than the fourth threshold (No in S201D), the encoding apparatus selects one of a plurality of prediction modes including the FRUC processing (S202), and according to the result. The encoding is performed using the FRUC process (S205) or without using the FRUC process (S206).
  • the encoding device estimates the latency in pipeline control at the time of decoding, and determines to prohibit the FRUC process if the estimated latency is greater than a predetermined threshold.
  • the encoding apparatus estimates whether or not the waiting time has reached by simulating the processing timing of the stage processing of each CU in the pipeline configuration at the time of decoding as shown in FIG. .
  • the coding device compares the estimated waiting time with the fourth threshold.
  • the coding apparatus determines the size of the CU as to how much waiting time occurs between the start of the second stage performing the FRUC processing and the end of the first stage which is the previous stage, The estimation is performed using information such as the position of the CU and the reference availability of the neighboring CUs.
  • the latency in pipeline control is accumulated and lengthened as processing of the CU progresses. Therefore, as indicated by CU4 in FIG. 17, the processing time of the second stage is shortened without performing the FRUC processing when the estimated waiting time becomes equal to or greater than the fourth threshold. As a result, the generated waiting time is delayed, and the possibility of completing the process in the time allocated to one picture is increased. In addition, when a large number of CUs for which the FRUC mode has not been selected by the normal mode determination process are generated, it is possible to suppress an increase in CUs that can not use the FRUC process more than necessary. The possibility is high.
  • the encoding device includes, in the encoded bit stream, a sequence header area in which information related to the determination processing in step S201D (parameter related to determination as to whether or not to inhibit the FRUC processing) is included. It may be encoded in a picture header area, a slice header area, a side information area, or the like.
  • the information related to the determination process is, for example, information indicating the fourth threshold. Further, the information may include information indicating whether or not the determination process of step S201D has been performed.
  • the coding apparatus determines whether or not the fourth threshold or the determination process is performed, (1) the size of a picture, and (2) the process of the coding apparatus or the decoding apparatus. Depending on the capabilities or (3) predefined profiles or levels may be switched.
  • the processing of the decoding device is the same as in the first example.
  • the encoding apparatus may prohibit the FRU processing when it is determined as Yes in any of the steps S201A to S201D.
  • FIG. 24 is a block diagram showing an implementation example of the coding apparatus 100 according to Embodiment 1.
  • the coding apparatus 100 includes a circuit 160 and a memory 162.
  • the components of the coding apparatus 100 shown in FIG. 1 are implemented by the circuit 160 and the memory 162 shown in FIG.
  • the circuit 160 is a circuit that performs information processing and can access the memory 162.
  • the circuit 160 is a dedicated or general-purpose electronic circuit that encodes image information.
  • the circuit 160 may be a processor such as a CPU.
  • the circuit 160 may also be an assembly of a plurality of electronic circuits. Also, for example, the circuit 160 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.
  • the memory 162 is a general-purpose or dedicated memory in which information for the circuit 160 to encode image information is stored.
  • the memory 162 may be an electronic circuit or may be connected to the circuit 160.
  • the memory 162 may also be included in the circuit 160.
  • the memory 162 may be a collection of a plurality of electronic circuits.
  • the memory 162 may be a magnetic disk or an optical disk, or may be expressed as a storage or a recording medium.
  • the memory 162 may be a non-volatile memory or a volatile memory.
  • image information to be encoded may be stored, or a bit string corresponding to the encoded image information may be stored.
  • the memory 162 may also store a program for the circuit 160 to encode image information.
  • the circuit 160 may play a role of a component for storing information among the plurality of components of the encoding device 100 illustrated in FIG. 1.
  • the memory 162 may play the role of the block memory 118 and the frame memory 122 shown in FIG.
  • all of the plurality of components shown in FIG. 1 and the like may not be mounted, or all of the plurality of processes described above may not be performed. Some of the plurality of components shown in FIG. 1 and the like may be included in another device, and some of the plurality of processes described above may be performed by another device. Then, in the encoding apparatus 100, a part of the plurality of components shown in FIG. 1 and the like may be implemented, and a part of the plurality of processes described above may be performed to suppress processing delay. .
  • FIG. 25 is a block diagram showing an implementation example of the decoding device 200 according to Embodiment 1.
  • the decoding device 200 includes a circuit 260 and a memory 262.
  • the plurality of components of the decoding apparatus 200 shown in FIG. 10 are implemented by the circuit 260 and the memory 262 shown in FIG.
  • the circuit 260 is a circuit that performs information processing and can access the memory 262.
  • circuit 260 is a general purpose or dedicated electronic circuit that decodes image information.
  • the circuit 260 may be a processor such as a CPU.
  • the circuit 260 may be a collection of a plurality of electronic circuits.
  • the circuit 260 may play a role of a plurality of components excluding the component for storing information among the plurality of components of the decoding device 200 illustrated in FIG.
  • the memory 262 is a general-purpose or dedicated memory in which information for the circuit 260 to decode image information is stored.
  • the memory 262 may be an electronic circuit or may be connected to the circuit 260. Also, the memory 262 may be included in the circuit 260. Further, the memory 262 may be a collection of a plurality of electronic circuits. Also, the memory 262 may be a magnetic disk or an optical disk, or may be expressed as a storage or a recording medium.
  • the memory 262 may be either a non-volatile memory or a volatile memory.
  • a bit string corresponding to encoded image information may be stored, or image information corresponding to a decoded bit string may be stored.
  • the memory 262 may also store a program for the circuit 260 to decode image information.
  • the circuit 260 may play a role of a component for storing information among the plurality of components of the decoding device 200 illustrated in FIG.
  • the memory 262 may play the role of the block memory 210 and the frame memory 214 shown in FIG.
  • all of the plurality of components shown in FIG. 10 and the like may not be mounted, or all of the plurality of processes described above may not be performed. Some of the plurality of components shown in FIG. 10 and the like may be included in another device, and some of the plurality of processes described above may be performed by another device. Then, in the decoding apparatus 200, a part of the plurality of components shown in FIG. 10 and the like may be implemented, and a part of the plurality of processes described above may be performed to suppress processing delay.
  • each processing unit included in the encoding apparatus and the decoding apparatus according to the above-described embodiment is typically implemented as an LSI which is an integrated circuit. These may be individually made into one chip, or may be made into one chip so as to include some or all.
  • circuit integration is not limited to LSI's, and implementation using dedicated circuitry or general purpose processors is also possible.
  • a field programmable gate array (FPGA) that can be programmed after LSI fabrication, or a reconfigurable processor that can reconfigure connection and setting of circuit cells inside the LSI may be used.
  • 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.
  • the encoding device and the decoding device include processing circuitry and storage electrically connected to the processing circuitry (accessible from the processing circuitry).
  • the processing circuit includes at least one of dedicated hardware and a program execution unit.
  • the storage device stores a software program executed by the program execution unit. The processing circuit executes the encoding method or the decoding method in the above embodiment using a storage device.
  • the present disclosure may be the above-described software program, or may be a non-transitory computer-readable recording medium in which the above-described program is recorded. Further, it goes without saying that the program can be distributed via a transmission medium such as the Internet.
  • division of functional blocks in the block diagram is an example, and a plurality of functional blocks may be realized as one functional block, one functional block may be divided into a plurality of parts, or some functions may be transferred to another function block. May be Also, a single piece of hardware or software may process the functions of a plurality of functional blocks having similar functions in parallel or in time division.
  • the order in which the steps included in the above encoding method or decoding method are performed is for illustrating the present disclosure specifically, and may be an order other than the above. Also, some of the above steps may be performed simultaneously (in parallel) with other steps.
  • the encoding apparatus, the decoding apparatus, the encoding method, and the decoding method according to one or more aspects of the present disclosure have been described above based on the embodiments, but the present disclosure is limited to the embodiments. It is not a thing. Without departing from the spirit of the present disclosure, various modifications that may occur to those skilled in the art may be applied to the present embodiment, or a configuration constructed by combining components in different embodiments may be one or more of the present disclosure. It may be included within the scope of the embodiments.
  • 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. 26 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. 28, 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. 29 is a diagram showing an example of a display screen of a web page in the computer ex111 and the like.
  • FIG. 30 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. 31 is a diagram showing the smartphone ex115.
  • FIG. 32 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
  • 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.
  • the present disclosure is applicable to an image decoding device and an image coding device. Specifically, the present disclosure is applicable to a television, a recorder, a personal computer, a digital still camera, a digital video camera, a smartphone, and the like.

Abstract

L'invention concerne un dispositif de codage (100) pourvu d'un circuit (160) et d'une mémoire (162), le circuit (160) utilisant la mémoire (162) pour déterminer, sur la base de premières informations relatives au temps de traitement au moment du décodage, si le traitement FRUC est interdit ou non (S201), lors de la détermination du fait que le traitement FRUC est interdit (Oui en S201), sélectionnant un mode de prédiction parmi de multiples modes de prédiction ne comprenant pas le traitement FRUC (S203) et effectuant un codage sans utiliser le traitement FRUC (S206) et, lorsqu'il est déterminé que le traitement FRUC n'est pas interdit (Non en S201), sélectionnant un mode de prédiction parmi de multiples modes de prédiction comprenant le traitement FRUC (S202), à l'aide du traitement FRUC (S205) ou sans l'aide du traitement FRUC, effectuant un codage (S206) et générant un flux binaire codé comprenant des secondes informations indiquant si le traitement FRUC est utilisé ou non (S207).
PCT/JP2018/028946 2017-08-07 2018-08-01 Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage WO2019031369A1 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US201762541898P 2017-08-07 2017-08-07
US62/541,898 2017-08-07
JP2017-167800 2017-08-31
JP2017167800 2017-08-31

Publications (1)

Publication Number Publication Date
WO2019031369A1 true WO2019031369A1 (fr) 2019-02-14

Family

ID=65271562

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2018/028946 WO2019031369A1 (fr) 2017-08-07 2018-08-01 Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage

Country Status (1)

Country Link
WO (1) WO2019031369A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112801959A (zh) * 2021-01-18 2021-05-14 华南理工大学 一种基于视觉特征识别的辅助装配系统
CN113841413A (zh) * 2019-05-21 2021-12-24 松下电器（美国）知识产权公司 编码装置、解码装置、编码方法和解码方法

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
CHEN, JIANLE ET AL.: "Algorithm Description of Joint Exploration Test Model 5", JOINT VIDEO EXPLORATION TEAM(JVET) OF ITU-T SG 16 WP3, no. JVET-E1001-v2, 20 January 2017 (2017-01-20), Geneva, CH, pages 15 - 27, XP030150648 *
CHEN, JIANLE ET AL.: "Further improvements to HMKTA-1.0", ITU-TELECOMMUNICATIONS STANDARDIZATION SECTOR STUDY GROUP 16 QUESTION 6 VIDEO CODING EXPERTS GROUP (VCEG) 52ND MEETING, no. VCEG-AZ07_V2, 26 June 2015 (2015-06-26), Warsaw, Poland, pages 1 - 8, XP055555095 *
LIN, YONGBING ET AL.: "EE 3: Enhanced FRUC Template Matching Mode", JOINT VIDEO EXPLORATION TEAM(JVET) OF ITU-T SG 16 WP3, no. JVET-F0032, 23 March 2017 (2017-03-23), Hobart, AU, pages 1 - 4, XP030150684 *
LIN, YONGBING ET AL.: "Enhanced Template Matching in FRUC Mode", JOINT VIDEO EXPLORATION TEAM(JVET) OF ITU-T SG 16 WP3, no. JVET-E0035, 3 January 2017 (2017-01-03), Geneva, CH, pages 1 - 4, XP030150502 *
SEO, JUNG-DONG ET AL.: "Simplification and improvements on FRUC", JOINT VIDEO EXPLORATION TEAM(JVET) OF ITU-T SG 16 WP3, no. JVET-G0065, 6 July 2017 (2017-07-06), Torino, IT, pages 1 - 6, XP030150852 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113841413A (zh) * 2019-05-21 2021-12-24 松下电器（美国）知识产权公司 编码装置、解码装置、编码方法和解码方法
CN112801959A (zh) * 2021-01-18 2021-05-14 华南理工大学 一种基于视觉特征识别的辅助装配系统
CN112801959B (zh) * 2021-01-18 2023-08-22 华南理工大学 一种基于视觉特征识别的辅助装配系统

Similar Documents

Publication Publication Date Title
JP6765520B2 (ja) 符号化装置、復号装置、符号化方法及び復号方法
JP6946419B2 (ja) 復号装置、復号方法及びプログラム
JP7260685B2 (ja) 符号化装置及び符号化方法
JP7339890B2 (ja) 符号化装置及び復号装置
WO2019022099A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
JP7422811B2 (ja) 非一時的記憶媒体
JP2022008413A (ja) 復号装置、符号化装置及び記録媒体
WO2019138998A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
WO2019013235A1 (fr) Dispositif de codage, procédé de codage, dispositif de décodage et procédé de décodage
JP2024015159A (ja) 符号化装置、復号装置、符号化方法、及び復号方法
WO2019013236A1 (fr) Dispositif de codage, procédé de codage, dispositif de décodage et procédé de décodage
WO2019098152A1 (fr) Dispositif et procédé de codage, et dispositif et procédé de décodage
JP2023126387A (ja) 符号化装置及び符号化方法
JP6770192B2 (ja) 符号化装置、符号化方法、復号装置及び復号方法
JP7371055B2 (ja) 符号化装置、及び復号装置
WO2019009314A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage, et procédé de décodage
JP6910461B2 (ja) 符号化装置、復号装置、符号化方法及び復号方法
WO2019031369A1 (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
WO2019059107A1 (fr) Dispositif d'encodage, dispositif de décodage, procédé d'encodage 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
WO2019021803A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage, et procédé de décodage
WO2019244809A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage, et procédé de décodage
WO2019098092A1 (fr) Dispositif de codage, dispositif de décodage, procédé de codage et procédé de décodage
WO2019031417A1 (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: 18844345

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: 18844345

Country of ref document: EP

Kind code of ref document: A1