WO2020116630A1 - 符号化装置、復号装置、符号化方法及び復号方法 - Google Patents
符号化装置、復号装置、符号化方法及び復号方法 Download PDFInfo
- Publication number
- WO2020116630A1 WO2020116630A1 PCT/JP2019/047886 JP2019047886W WO2020116630A1 WO 2020116630 A1 WO2020116630 A1 WO 2020116630A1 JP 2019047886 W JP2019047886 W JP 2019047886W WO 2020116630 A1 WO2020116630 A1 WO 2020116630A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- tile
- picture
- information
- slice
- block
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims description 376
- 230000033001 locomotion Effects 0.000 description 283
- 238000012545 processing Methods 0.000 description 243
- 239000013598 vector Substances 0.000 description 194
- 230000008569 process Effects 0.000 description 168
- 239000011449 brick Substances 0.000 description 129
- 238000010586 diagram Methods 0.000 description 118
- PXFBZOLANLWPMH-UHFFFAOYSA-N 16-Epiaffinine Natural products C1C(C2=CC=CC=C2N2)=C2C(=O)CC2C(=CC)CN(C)C1C2CO PXFBZOLANLWPMH-UHFFFAOYSA-N 0.000 description 70
- 238000000605 extraction Methods 0.000 description 70
- 238000013139 quantization Methods 0.000 description 60
- 230000001419 dependent effect Effects 0.000 description 54
- 238000006243 chemical reaction Methods 0.000 description 48
- 238000012937 correction Methods 0.000 description 32
- 238000009795 derivation Methods 0.000 description 31
- 239000000470 constituent Substances 0.000 description 28
- 230000002093 peripheral effect Effects 0.000 description 24
- 230000006870 function Effects 0.000 description 22
- 238000004891 communication Methods 0.000 description 17
- 238000011156 evaluation Methods 0.000 description 16
- 238000005192 partition Methods 0.000 description 16
- 230000009466 transformation Effects 0.000 description 15
- 230000000694 effects Effects 0.000 description 14
- 239000011159 matrix material Substances 0.000 description 14
- 238000001914 filtration Methods 0.000 description 10
- 230000008707 rearrangement Effects 0.000 description 10
- 230000008859 change Effects 0.000 description 9
- 230000005236 sound signal Effects 0.000 description 9
- 230000003287 optical effect Effects 0.000 description 8
- 230000003044 adaptive effect Effects 0.000 description 7
- 238000004458 analytical method Methods 0.000 description 7
- 230000005540 biological transmission Effects 0.000 description 7
- 230000006872 improvement Effects 0.000 description 6
- 230000001131 transforming effect Effects 0.000 description 6
- 101100537098 Mus musculus Alyref gene Proteins 0.000 description 5
- 101150095908 apex1 gene Proteins 0.000 description 5
- 230000008901 benefit Effects 0.000 description 5
- 230000002146 bilateral effect Effects 0.000 description 5
- 238000001514 detection method Methods 0.000 description 5
- 238000003702 image correction Methods 0.000 description 5
- 230000002123 temporal effect Effects 0.000 description 5
- 241000023320 Luma <angiosperm> Species 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 4
- 238000007906 compression Methods 0.000 description 4
- 230000010365 information processing Effects 0.000 description 4
- OSWPMRLSEDHDFF-UHFFFAOYSA-N methyl salicylate Chemical group COC(=O)C1=CC=CC=C1O OSWPMRLSEDHDFF-UHFFFAOYSA-N 0.000 description 4
- 230000009467 reduction Effects 0.000 description 4
- 230000011664 signaling Effects 0.000 description 4
- 230000006835 compression Effects 0.000 description 3
- 238000004590 computer program Methods 0.000 description 3
- 229910003460 diamond Inorganic materials 0.000 description 3
- 239000010432 diamond Substances 0.000 description 3
- 230000014509 gene expression Effects 0.000 description 3
- 238000005457 optimization Methods 0.000 description 3
- 239000000047 product Substances 0.000 description 3
- 238000000638 solvent extraction Methods 0.000 description 3
- 230000004913 activation Effects 0.000 description 2
- 238000012217 deletion Methods 0.000 description 2
- 230000037430 deletion Effects 0.000 description 2
- 238000005286 illumination Methods 0.000 description 2
- 238000002156 mixing Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 238000001228 spectrum Methods 0.000 description 2
- 230000000153 supplemental effect Effects 0.000 description 2
- 238000012935 Averaging Methods 0.000 description 1
- 102100036790 Tubulin beta-3 chain Human genes 0.000 description 1
- 102100036788 Tubulin beta-4A chain Human genes 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000001174 ascending effect Effects 0.000 description 1
- 230000003190 augmentative effect Effects 0.000 description 1
- 230000002457 bidirectional effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 239000000446 fuel Substances 0.000 description 1
- 238000009499 grossing Methods 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012805 post-processing Methods 0.000 description 1
- 238000007781 pre-processing Methods 0.000 description 1
- 230000002265 prevention Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 239000013589 supplement Substances 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
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/70—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by syntax aspects related to video coding, e.g. related to compression standards
-
- 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/119—Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
-
- 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
-
- 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/42—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation
- H04N19/423—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation characterised by memory arrangements
-
- 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/44—Decoders specially adapted therefor, e.g. video decoders which are asymmetric with respect to the encoder
Definitions
- the present disclosure relates to video coding, for example, a system, a component, and a method in moving image coding and decoding.
- Video coding technology is based on H.264. H.261 and MPEG-1 from H.264. H.264/AVC (Advanced Video Coding), MPEG-LA, H.264. H.265/HEVC (High Efficiency Video Coding), and H.264. It has progressed to 266/VVC (Versatile Video Codec). With this advance, there is always a need to provide improvements and optimizations in video coding techniques to handle the ever-increasing amount of digital video data in various applications.
- the present disclosure may contribute to one or more of, for example, improved coding efficiency, improved image quality, reduced throughput, reduced circuit size, improved processing speed, and proper selection of elements or operations.
- a configuration or method is provided. It should be noted that the present disclosure may include configurations or methods that may contribute to benefits other than the above.
- An encoding device is an encoding device that encodes a moving image, and includes a circuit and a memory connected to the circuit, and the circuit is an object to be encoded in operation.
- Picture is divided into two or more tiles, and the picture is encoded by encoding each of the divided tiles or by encoding each rectangular slice composed of one or more tiles.
- the header information does not include information about the area occupied by the slice located in the lower right corner of the picture.
- a decoding device is a decoding device that decodes a moving image, and includes a circuit and a memory connected to the circuit.
- the picture is decoded by dividing the picture into two or more tiles, and decoding each of a part of the divided tiles or a rectangular slice composed of one or more tiles.
- the information about the area occupied by the slice located in the lower right corner of is set by a predetermined method that does not use header information, and the information about the area is not included in the header information.
- Some implementations of the embodiments in this disclosure may improve coding efficiency, simplify the coding/decoding process, or speed up the coding/decoding process.
- Appropriate filters/block sizes, motion vectors, reference pictures, reference blocks, etc. may be efficiently selected for use in appropriate components/operations used for encoding and decoding.
- a configuration or method according to an aspect of the present disclosure includes, for example, improvement of coding efficiency, improvement of image quality, reduction of processing amount, reduction of circuit scale, improvement of processing speed, and appropriate selection of elements or operations. Can contribute to more than one of them. Note that the configuration or method according to one aspect of the present disclosure may contribute to benefits other than the above.
- FIG. 1 is a block diagram showing a functional configuration of an encoding device according to an embodiment.
- FIG. 2 is a flowchart showing an example of the overall encoding process by the encoding device.
- FIG. 3 is a conceptual diagram showing an example of block division.
- FIG. 4A is a conceptual diagram showing an example of a slice configuration.
- FIG. 4B is a conceptual diagram showing an example of a tile configuration.
- FIG. 5A is a table showing conversion basis functions corresponding to various conversion types.
- FIG. 5B is a conceptual diagram showing an example of SVT (Spatially Varying Transform).
- FIG. 6A is a conceptual diagram showing an example of a shape of a filter used in an ALF (adaptive loop filter).
- FIG. 1 is a block diagram showing a functional configuration of an encoding device according to an embodiment.
- FIG. 2 is a flowchart showing an example of the overall encoding process by the encoding device.
- FIG. 3 is a conceptual diagram showing
- FIG. 6B is a conceptual diagram showing another example of the shape of the filter used in ALF.
- FIG. 6C is a conceptual diagram showing another example of the shape of the filter used in ALF.
- FIG. 7 is a block diagram showing an example of a detailed configuration of a loop filter unit that functions as a DBF (deblocking filter).
- FIG. 8 is a conceptual diagram showing an example of a deblocking filter having a filter characteristic symmetrical with respect to a block boundary.
- FIG. 9 is a conceptual diagram for explaining a block boundary where the deblocking filter processing is performed.
- FIG. 10 is a conceptual diagram showing an example of the Bs value.
- FIG. 11 is a flowchart showing an example of processing performed by the prediction processing unit of the encoding device.
- FIG. 11 is a flowchart showing an example of processing performed by the prediction processing unit of the encoding device.
- FIG. 12 is a flowchart showing another example of the processing performed by the prediction processing unit of the encoding device.
- FIG. 13 is a flowchart showing another example of the processing performed by the prediction processing unit of the encoding device.
- FIG. 14 is a conceptual diagram showing an example of 67 intra prediction modes in intra prediction according to the embodiment.
- FIG. 15 is a flowchart showing an example of the basic processing flow of inter prediction.
- FIG. 16 is a flowchart showing an example of motion vector derivation.
- FIG. 17 is a flowchart showing another example of motion vector derivation.
- FIG. 18 is a flowchart showing another example of motion vector derivation.
- FIG. 19 is a flowchart showing an example of inter prediction in the normal inter mode.
- FIG. 20 is a flowchart showing an example of inter prediction in the merge mode.
- FIG. 21 is a conceptual diagram for explaining an example of motion vector derivation processing in the merge mode.
- FIG. 22 is a flowchart showing an example of FRUC (frame rate up conversion) processing.
- FIG. 23 is a conceptual diagram for explaining an example of pattern matching (bilateral matching) between two blocks along a motion trajectory.
- FIG. 24 is a conceptual diagram for explaining an example of pattern matching (template matching) between a template in the current picture and a block in the reference picture.
- FIG. 25A is a conceptual diagram for explaining an example of derivation of a motion vector in sub-block units based on motion vectors of a plurality of adjacent blocks.
- FIG. 25B is a conceptual diagram for explaining an example of derivation of a motion vector in a sub-block unit in an affine mode having three control points.
- FIG. 26A is a conceptual diagram for explaining the affine merge mode.
- FIG. 26B is a conceptual diagram for explaining the affine merge mode having two control points.
- FIG. 26C is a conceptual diagram for explaining an affine merge mode having three control points.
- FIG. 27 is a flowchart showing an example of processing in the affine merge mode.
- FIG. 28A is a conceptual diagram for explaining an affine inter mode having two control points.
- FIG. 28B is a conceptual diagram for explaining an affine inter mode having three control points.
- FIG. 29 is a flowchart showing an example of processing in the affine inter mode.
- FIG. 30A is a conceptual diagram for explaining an affine inter mode in which a current block has three control points and an adjacent block has two control points.
- FIG. 30B is a conceptual diagram for explaining an affine inter mode in which a current block has two control points and an adjacent block has three control points.
- FIG. 31A is a flowchart showing a merge mode including DMVR (decoder motion vector refinement).
- FIG. 31B is a conceptual diagram for explaining an example of DMVR processing.
- FIG. 32 is a flowchart showing an example of generation of a predicted image.
- FIG. 33 is a flowchart showing another example of generation of a predicted image.
- FIG. 34 is a flowchart showing another example of generation of a predicted image.
- FIG. 35 is a flowchart for explaining an example of a predicted image correction process by an OBMC (overlapped block motion compensation) process.
- FIG. 36 is a conceptual diagram for explaining an example of a predicted image correction process by the OBMC process.
- FIG. 37 is a conceptual diagram for explaining generation of prediction images of two triangles.
- FIG. 38 is a conceptual diagram for explaining a model assuming a uniform linear motion.
- FIG. 39 is a conceptual diagram for explaining an example of a predictive image generation method using a brightness correction process by a LIC (local illumination compensation) process.
- FIG. 40 is a block diagram showing an implementation example of the encoding device.
- FIG. 41 is a block diagram showing a functional configuration of the decoding device according to the embodiment.
- FIG. 42 is a flowchart showing an example of the overall decoding process performed by the decoding device.
- FIG. 43 is a flowchart showing an example of processing performed by the prediction processing unit of the decoding device.
- FIG. 44 is a flowchart showing another example of the processing performed by the prediction processing unit of the decoding device.
- FIG. 45 is a flowchart showing an example of inter prediction in the normal inter mode in the decoding device.
- FIG. 46 is a block diagram showing an implementation example of the decoding device.
- FIG. 47A is a diagram showing an example of a picture configuration divided into one or more tile sets on the basis of tile boundaries according to the first aspect of the first embodiment.
- FIG. 47B is a diagram showing an example of a picture configuration divided into one or more tile sets on the basis of tile boundaries according to the first aspect of the first embodiment.
- FIG. 47C is a diagram showing an example of a picture configuration divided into one or more tile sets on the basis of tile boundaries according to the first mode of the first embodiment.
- FIG. 47D is a diagram showing an example of a picture configuration divided into one or more tile sets based on the tile boundary according to the first mode of the first embodiment.
- FIG. 48A is a diagram illustrating an example of syntax for encoding a tile group that configures a picture when encoding the picture according to the first aspect of the first embodiment.
- FIG. 48B is a diagram showing an example of syntax regarding a tile group according to the first mode of the first embodiment.
- FIG. 49A is a diagram showing an example of a tile set included in a picture according to the first mode of the first embodiment and a basic coding order.
- FIG. 49B is a diagram showing an example in which the coding order of tile groups is replaced in the same tile set as in FIG. 48A.
- FIG. 50A is a flowchart showing tile group decoding processing performed by the decoding device according to the first mode of the first embodiment.
- FIG. 50B is a flowchart showing an example of an error detection process and a concealment process in the tile group decoding process performed by the decoding device according to the first mode of the first embodiment.
- FIG. 51A is a diagram showing an example of a case where the tile extraction information SEI according to the first mode of the first embodiment is encoded after a picture.
- FIG. 51B is a diagram showing an example of a case where the tile extraction information SEI according to the first example of the first embodiment is encoded before a picture.
- FIG. 52 is a diagram showing an example of syntax for encoding the tile extraction information SEI according to the first mode of the first embodiment.
- FIG. 53 is a diagram illustrating an example of syntax for encoding tiles included in a picture when encoding the picture according to the second aspect of the first embodiment.
- FIG. 54A is a diagram showing an example of a tile set forming a picture according to the second mode of the first embodiment and a basic encoding order.
- FIG. 54B is a diagram illustrating an example in which the tile encoding order is changed in the tile set including the same tile group as in FIG. 54A.
- FIG. 55A is a flowchart showing tile decoding processing performed by the decoding device according to the second mode of the first embodiment.
- FIG. 55B is a flowchart showing an example of an error detection process and a concealment process in the tile decoding process performed by the decoding device according to the second mode of the first embodiment.
- FIG. 56A is a diagram showing an example of a case where the tile extraction information SEI according to the second mode of the first embodiment is encoded after a picture.
- FIG. 56B is a diagram showing an example of a case where the tile extraction information SEI according to the second mode of the first embodiment is encoded before a picture.
- FIG. 57 is a diagram showing an example of syntax for encoding the tile extraction information SEI according to the second mode of the first embodiment.
- FIG. 58A is a diagram showing an example of a configuration of a picture when a picture according to the third aspect of the first embodiment is divided into rectangular areas and encoded.
- FIG. 58B is a diagram showing an example of the structure of a picture when a picture according to the third aspect of the first embodiment is divided into rectangular areas and encoded.
- FIG. 59 is a diagram showing an example of the syntax of a picture parameter set (PPS) for dividing and encoding a picture when encoding the picture according to the third aspect of the first embodiment.
- FIG. 60 is a flowchart showing an example of rectangular slice setting processing in the rectangular slice mode performed by the decoding device according to the third aspect of the first embodiment.
- FIG. PPS picture parameter set
- FIG. 61 is a diagram illustrating an example of the syntax of a picture parameter set (PPS) for dividing and encoding a picture when encoding the picture according to the fourth aspect of the first embodiment.
- FIG. 62 is a flowchart showing an example of rectangular slice setting processing in the rectangular slice mode performed by the decoding device according to the fourth aspect of the first embodiment.
- FIG. 63 is a diagram showing an example of the syntax of a picture parameter set (PPS) for dividing and encoding a picture when encoding the picture according to the fifth aspect of the first embodiment.
- FIG. 64 is a flowchart showing an example of slice mode setting processing when the decoding device according to the fifth aspect of the first embodiment performs slice data decoding processing.
- FIG. 65 is a diagram illustrating an example of the syntax of a picture parameter set (PPS) for dividing and encoding a picture when encoding the picture according to the sixth aspect of the first embodiment.
- FIG. 66 is a flowchart showing an example of the brick setting process when the decoding device according to the sixth aspect of the first embodiment performs the decoding process of brick data.
- FIG. 67 is a block diagram illustrating an implementation example of the encoding device according to the first embodiment.
- 68 is a flowchart showing an operation example of the encoding apparatus shown in FIG. 67.
- FIG. 69 is a block diagram illustrating an implementation example of the decoding device according to the first embodiment.
- 70 is a flowchart showing an operation example of the decoding device shown in FIG. 69.
- FIG. 69 is a diagram illustrating an example of the syntax of a picture parameter set (PPS) for dividing and encoding a picture when encoding the picture according to the sixth aspect of the first embodiment.
- FIG. 71 is a block diagram showing the overall configuration of a content supply system that realizes a content distribution service.
- FIG. 72 is a conceptual diagram showing an example of a coding structure at the time of scalable coding.
- FIG. 73 is a conceptual diagram showing an example of a coding structure at the time of scalable coding.
- FIG. 74 is a conceptual diagram showing an example of a web page display screen.
- FIG. 75 is a conceptual diagram showing an example of a web page display screen.
- FIG. 76 is a block diagram showing an example of a smartphone.
- FIG. 77 is a block diagram showing a configuration example of a smartphone.
- an encoding device is an encoding device that encodes a moving image, and includes a circuit and a memory connected to the circuit, and the circuit, in operation, encodes
- the picture to be encoded is divided into two or more tiles, and the picture is encoded by encoding a part of the divided tiles or a rectangular slice composed of one or more tiles to encode the picture.
- the information about the area occupied by the slice located in the lower right corner of the picture is not included in the header information.
- the coding apparatus can omit the picture parameter set without including a part of the information about the slice setting method, and thus the coding amount may be reduced.
- the information regarding the area is information indicating the position of the lower right corner of the slice.
- the information on the region is information indicating the position of the upper left corner and the position of the lower right corner of the slice.
- the information on the area is information represented by syntax.
- the circuit when the circuit encodes the picture, uses the position information of the upper left corner of the slice located at the beginning of the picture as header information as information indicating the position of the upper left corner of the picture. include.
- a decoding device is a decoding device that decodes a moving image, and includes a circuit and a memory connected to the circuit, and the circuit, in operation, is a picture to be decoded. Is divided into two or more tiles, and the picture is decoded by decoding a part of the divided tiles or a rectangular slice composed of one or more tiles, and when decoding the picture, Information about the area occupied by the slice located in the lower right corner of the picture is set by a predetermined method that does not use header information, and the information about the area is not included in the header information.
- the decoding process can be performed even if the picture parameter set does not include a part of the information on the slice setting method. Therefore, the decoding device may be able to reduce the code amount of the acquired bitstream.
- the information regarding the area is information indicating the position of the lower right corner of the slice.
- the information on the region is information indicating the position of the upper left corner and the position of the lower right corner of the slice.
- the information on the area is information represented by syntax.
- the circuit when the circuit decodes the picture, the circuit includes position information of an upper left corner of a slice located at the head of the picture, information indicating a position of an upper left corner of the picture included in header information. Decrypt from.
- a coding method is a coding method for coding a moving image, in which a picture to be coded is divided into two or more tiles, and a part of the divided tiles.
- the picture is encoded, and when encoding the picture, information regarding an area occupied by a slice located in a lower right corner of the picture. Is not included in the header information.
- the coding method can be omitted because the picture parameter set does not include a part of the information about the slice setting method, and thus the coding amount may be reduced.
- a decoding method is a decoding method for decoding a moving image, in which a picture to be decoded is divided into two or more tiles, and a part of the divided tiles or one or more tiles.
- the picture is decoded, and when decoding the picture, the header information is used for the information about the area occupied by the slice located in the lower right corner of the picture. Not set by a predetermined method, and information regarding the area is not included in the header information.
- the decoding process can be performed even if the picture parameter set does not include a part of the information on the slice setting method. Therefore, the decoding method may reduce the code amount of the acquired bitstream.
- these comprehensive 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, It may be realized by any combination of a system, an apparatus, a method, an integrated circuit, a computer program, and a recording medium.
- the following describes embodiments of the encoding device and the decoding device.
- the embodiments are examples of the encoding device and the decoding device to which the processing and/or the configuration described in each aspect of the present disclosure can be applied.
- the processing and/or the configuration can be implemented in an encoding device and a decoding device different from the embodiment.
- any of the following may be performed.
- Some components of the plurality of components configuring the encoding device or the decoding device according to the embodiment may be combined with the components described in any of the aspects of the present disclosure. , May be combined with a component that includes a part of the function described in each of the aspects of the present disclosure, or a component that performs a part of the processing performed by the component described in each aspect of the present disclosure. May be combined with.
- a component that includes a part of the functions of the encoding device or the decoding device of the embodiment or a component that performs a part of the processing of the encoding device or the decoding device of the embodiment is the A component described in any one of the aspects, a component including a part of the function described in any of the aspects of the present disclosure, or a part of the process described in any of the aspects of the present disclosure. It may be combined or replaced with the implementing components.
- any one of the plurality of processes included in the method is the same as or similar to the process described in any of the aspects of the present disclosure. It may be replaced or combined with any of the processes.
- a part of the plurality of processes included in the method performed by the encoding device or the decoding device according to the embodiment may be combined with the process described in any of the aspects of the present disclosure. ..
- the method of performing the process and/or the configuration described in each aspect of the present disclosure is not limited to the encoding device or the decoding device according to the embodiment.
- the processing and/or the configuration may be implemented in an apparatus used for a purpose different from the moving picture coding or moving picture decoding disclosed in the embodiments.
- FIG. 1 is a block diagram showing a functional configuration of an encoding device 100 according to the embodiment.
- the encoding device 100 is a moving image encoding device that encodes a moving image in block units.
- the encoding device 100 is a device that encodes an image in block units, and includes a division unit 102, a subtraction unit 104, a conversion unit 106, a quantization unit 108, and entropy encoding.
- the encoding device 100 is realized by, for example, a general-purpose processor and a memory.
- the processor when the software program stored in the memory is executed by the processor, the processor causes the dividing unit 102, the subtracting unit 104, the converting unit 106, the quantizing unit 108, the entropy coding unit 110, and the dequantizing unit 112.
- the encoding device 100 includes a division unit 102, a subtraction unit 104, a conversion unit 106, a quantization unit 108, an entropy encoding unit 110, an inverse quantization unit 112, an inverse transformation unit 114, an addition unit 116, a loop filter unit 120.
- the intra prediction unit 124, the inter prediction unit 126, and the prediction control unit 128 may be implemented as one or more dedicated electronic circuits.
- FIG. 2 is a flowchart showing an example of the overall encoding process performed by the encoding device 100.
- the division unit 102 of the encoding device 100 divides each picture included in the input image, which is a moving image, into a plurality of fixed size blocks (for example, 128 ⁇ 128 pixels) (step Sa_1). Then, the division unit 102 selects a division pattern (also referred to as a block shape) for the fixed size block (step Sa_2). That is, the dividing unit 102 further divides the fixed-size block into a plurality of blocks forming the selected division pattern. Then, the encoding device 100 performs the processes of steps Sa_3 to Sa_9 on each of the plurality of blocks (that is, the block to be encoded).
- a division pattern also referred to as a block shape
- the prediction processing unit including all or a part of the intra prediction unit 124, the inter prediction unit 126, and the prediction control unit 128 generates a prediction signal (also referred to as a prediction block) of a coding target block (also referred to as a current block). (Step Sa_3).
- the subtraction unit 104 generates a difference between the encoding target block and the prediction block as a prediction residual (also referred to as a difference block) (step Sa_4).
- the transforming unit 106 and the quantizing unit 108 generate a plurality of quantized coefficients by transforming and quantizing the difference block (step Sa_5).
- a block including a plurality of quantized coefficients is also called a coefficient block.
- the entropy coding unit 110 generates a coded signal by performing coding (specifically, entropy coding) on the coefficient block and the prediction parameter related to generation of the prediction signal (step). Sa — 6).
- the encoded signal is also referred to as an encoded bitstream, a compressed bitstream, or a stream.
- the inverse quantization unit 112 and the inverse transformation unit 114 restore a plurality of prediction residuals (that is, difference blocks) by performing inverse quantization and inverse transformation on the coefficient block (step Sa_7).
- the addition unit 116 reconstructs the current block into a reconstructed image (also referred to as a reconstructed block or a decoded image block) by adding a prediction block to the restored difference block (step Sa_8). As a result, a reconstructed image is generated.
- a reconstructed image also referred to as a reconstructed block or a decoded image block
- the loop filter unit 120 filters the reconstructed image as necessary (step Sa_9).
- step Sa_10 determines whether the encoding of the entire picture is completed (step Sa_10), and when it is determined that the encoding is not completed (No in step Sa_10), repeatedly executes the processing from step Sa_2. To do.
- the encoding device 100 selects one division pattern for fixed-size blocks and encodes each block according to the division pattern, but according to each of the plurality of division patterns. Each block may be encoded.
- the encoding apparatus 100 evaluates the cost for each of the plurality of division patterns, and, for example, the encoded signal obtained by the encoding according to the division pattern with the smallest cost is used as the output encoded signal. You may choose.
- steps Sa_1 to Sa_10 are sequentially performed by the encoding device 100.
- some of the plurality of processes may be performed in parallel, and the order of the processes may be changed.
- 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 dividing unit 102 first divides the picture into blocks of a fixed size (for example, 128 ⁇ 128). Other fixed block sizes may be employed. This fixed size block is sometimes referred to as a coding tree unit (CTU).
- CTU coding tree unit
- the dividing unit 102 divides each fixed-size block into a variable-size (for example, 64 ⁇ 64 or less) block based on, for example, recursive quadtree and/or binary tree block division. To do. That is, the dividing unit 102 selects a division pattern.
- This variable size block may be referred to as a coding unit (CU), prediction unit (PU) or transform unit (TU).
- CU, PU, and TU do not have to be distinguished, and some or all blocks in a picture may be the processing unit of CU, PU, and TU.
- FIG. 3 is a conceptual diagram showing an example of block division in the embodiment.
- a solid line represents a block boundary by quadtree block division
- a broken line represents a block boundary by binary tree block division.
- the block 10 is a square block of 128 ⁇ 128 pixels (128 ⁇ 128 block).
- the 128 ⁇ 128 block 10 is first divided into four square 64 ⁇ 64 blocks (quadtree block division).
- the upper left 64x64 block is vertically divided into two rectangular 32x64 blocks, and the left 32x64 block is further vertically divided into two rectangular 16x64 blocks (binary tree block division). As a result, the upper left 64x64 block is divided into two 16x64 blocks 11 and 12 and a 32x64 block 13.
- the upper right 64x64 block is horizontally divided into two rectangular 64x32 blocks 14 and 15 (binary tree block division).
- the lower left 64x64 block is divided into four square 32x32 blocks (quadtree block division).
- the upper left block and the lower right block of the four 32 ⁇ 32 blocks are further divided.
- the upper left 32x32 block is vertically divided into two rectangular 16x32 blocks, and the right 16x32 block is further horizontally divided into two 16x16 blocks (binary tree block division).
- the lower right 32x32 block is horizontally divided into two 32x16 blocks (binary tree block division).
- the lower left 64x64 block is divided into a 16x32 block 16, two 16x16 blocks 17 and 18, two 32x32 blocks 19 and 20, and two 32x16 blocks 21 and 22.
- the lower right 64x64 block 23 is not divided.
- the block 10 is divided into 13 variable-sized blocks 11 to 23 based on the recursive quadtree and binary tree block division.
- Such division may be called QTBT (quad-tree plus binary tree) division.
- one block is divided into four or two blocks (quadtree or binary tree block division), but the division is not limited to these.
- one block may be divided into three blocks (ternary tree block division). Partitioning including such ternary tree block partitioning is sometimes called MBT (multi type tree) partitioning.
- MBT multi type tree
- Picture configuration slice/tile Pictures may be organized in slices or tiles to decode pictures in parallel.
- the picture in slice units or tile units may be configured by the dividing unit 102.
- a slice is a basic coding unit that constitutes a picture.
- a picture is composed of, for example, one or more slices.
- a slice is composed of one or more continuous CTUs (Coding Tree Units).
- FIG. 4A is a conceptual diagram showing an example of a slice configuration.
- the picture includes 11 ⁇ 8 CTUs and is divided into four slices (slices 1-4).
- Slice 1 consists of 16 CTUs
- slice 2 consists of 21 CTUs
- slice 3 consists of 29 CTUs
- slice 4 consists of 22 CTUs.
- each CTU in the picture belongs to one of the slices.
- the shape of the slice is such that the picture is divided in the horizontal direction.
- the slice boundary does not have to be the screen edge, and may be any of the CTU boundaries within the screen.
- the processing order (coding order or decoding order) of the CTUs in the slice is, for example, the raster scan order.
- the slice includes header information and encoded data.
- the header information may describe the characteristics of the slice such as the CTU address at the beginning of the slice and the slice type.
- Tiles are units of rectangular areas that make up a picture. A number called TileId may be assigned to each tile in raster scan order.
- FIG. 4B is a conceptual diagram showing an example of the tile configuration.
- the picture includes 11 ⁇ 8 CTUs and is divided into four rectangular area tiles (tiles 1-4).
- the processing order of the CTU is changed as compared with the case where the tile is not used. If tiles are not used, multiple CTUs in the picture are processed in raster scan order. If tiles are used, at least one CTU in each of the plurality of tiles is processed in raster scan order.
- the processing order of the plurality of CTUs included in tile 1 is from the left end of the first row of tile 1 to the right end of the first row of tile 1, and then the left end of the second row of tile 1. To the right end of the second row of tile 1.
- one tile may include one or more slices, and one slice may include one or more tiles.
- the subtraction unit 104 subtracts the prediction signal (prediction sample input from the prediction control unit 128 described below) from the original signal (original sample) in block units input from the division unit 102 and divided by the division unit 102. .. That is, the subtraction unit 104 calculates the prediction error (also referred to as the residual) of the coding target block (hereinafter referred to as the current block). Then, the subtraction unit 104 outputs the calculated prediction error (residual error) to the conversion unit 106.
- the original signal is an input signal of the encoding device 100, and is a signal (for example, a luminance (luma) signal and two color difference (chroma) signals) representing an image of each picture forming a moving image.
- a signal representing an image may be referred to as a sample.
- the transformation unit 106 transforms the prediction error in the spatial domain into a transform coefficient in the frequency domain, and outputs the transform coefficient to the quantization unit 108. Specifically, the conversion unit 106 performs predetermined discrete cosine transform (DCT) or discrete sine transform (DST) on the prediction error in the spatial domain, for example.
- DCT discrete cosine transform
- DST discrete sine transform
- the predetermined DCT or DST may be predetermined.
- the conversion unit 106 adaptively selects a conversion type from a plurality of conversion types and converts a prediction error into a conversion coefficient using a conversion basis function (transform basis function) corresponding to the selected conversion type. You may. Such a conversion is sometimes called an EMT (explicit multiple core transform) or an AMT (adaptive multiple transform).
- EMT express multiple core transform
- AMT adaptive multiple transform
- the plurality of conversion types include, for example, DCT-II, DCT-V, DCT-VIII, DST-I and DST-VII.
- FIG. 5A is a table showing conversion basis functions corresponding to conversion type examples.
- N indicates the number of input pixels.
- the selection of the conversion type from these plural conversion types may depend on the type of prediction (intra prediction and inter prediction) or may depend on the intra prediction mode, for example.
- the information indicating whether to apply such EMT or AMT (for example, called EMT flag or AMT flag) and the information indicating the selected conversion type are usually signalized at the CU level.
- EMT flag or AMT flag the information indicating whether to apply such EMT or AMT
- the signalization of these pieces of information is not limited to the CU level, and may be another level (for example, a bit sequence level, a picture level, a slice level, a tile level, or a CTU level).
- the conversion unit 106 may reconvert the conversion coefficient (conversion result). Such re-conversion is sometimes called AST (adaptive secondary transform) or NSST (non-separable secondary transform). For example, the transform unit 106 retransforms each subblock (for example, 4 ⁇ 4 subblock) included in the block of transform coefficients corresponding to the intra prediction error.
- the information indicating whether to apply the NSST and the information about the transformation matrix used for the NSST are usually signalized at the CU level. Note that the signalization of these pieces of information is not limited to the CU level and may be another level (for example, a sequence level, a picture level, a slice level, a tile level, or a CTU level).
- the conversion unit 106 may be applied with separable conversion and non-separable conversion.
- the separable conversion is a method of performing the conversion a plurality of times by separating each direction by the number of input dimensions
- the non-separable conversion is a method of converting two or more dimensions when the input is multidimensional. This is a method of collectively considering it as one-dimensional and performing conversion collectively.
- Non-Separable conversion if the input is a 4 ⁇ 4 block, it is regarded as one array having 16 elements, and a 16 ⁇ 16 conversion matrix for the array.
- An example is one that performs conversion processing in.
- a transformation in which a 4 ⁇ 4 input block is regarded as one array having 16 elements and then a Givens rotation is performed a plurality of times for the array may be held.
- the conversion in the conversion unit 106 it is possible to switch the type of base to be converted into the frequency domain according to the area in the CU.
- SVT Spaally Varying Transform
- the CU is divided into two equal parts in the horizontal or vertical direction, and only one of the regions is converted into the frequency domain.
- the type of conversion base can be set for each region, and for example, DST7 and DCT8 are used. In this example, only one of the two areas in the CU is converted and the other is not converted, but both areas may be converted.
- the division method is not limited to bisectors, but is also quadrants, or it is possible to make it more flexible by separately encoding information indicating the split and signaling the same as in CU split.
- the SVT may also be referred to as an SBT (Sub-block Transform).
- 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 scanning 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 quantized coefficient) to the entropy coding unit 110 and the dequantization unit 112.
- the predetermined scanning order may be predetermined.
- the predetermined scan order is the order for quantization/inverse quantization of transform coefficients.
- the predetermined scanning order may be defined in ascending order of frequencies (from low frequency to high frequency) or in descending order (from high frequency to low frequency).
- Quantization parameter is a parameter that defines the quantization step (quantization width). For example, the quantization step increases as the value of the quantization parameter increases. That is, the quantization error increases as the value of the quantization parameter increases.
- a quantization matrix may be used for quantization.
- quantization refers to digitizing values sampled at a predetermined interval in association with a predetermined level, and is referred to in this technical field by using other expressions such as rounding, rounding, and scaling. Rounding, rounding, or scaling may be used.
- the predetermined interval and level may be predetermined.
- the quantization matrix As a method of using the quantization matrix, there are a method of using the quantization matrix set directly on the encoding device side and a method of using the default quantization matrix (default matrix).
- the quantization matrix can be set according to the characteristics of the image by directly setting the quantization matrix. However, in this case, there is a demerit that the code amount increases due to the coding of the quantization matrix.
- the quantization matrix may be designated by, for example, SPS (sequence parameter set: Sequence Parameter Set) or PPS (picture parameter set: Picture Parameter Set).
- SPS sequence parameter set: Sequence Parameter Set
- PPS picture parameter set: Picture Parameter Set
- the SPS contains the parameters used for the sequence and the PPS contains the parameters used for the picture.
- the SPS and PPS may be simply called a parameter set.
- the entropy coding unit 110 generates a coded signal (coded bit stream) based on the quantized coefficient input from the quantization unit 108. Specifically, the entropy encoding unit 110, for example, binarizes the quantized coefficient, arithmetically encodes the binary signal, and outputs a compressed bitstream or sequence.
- the inverse quantization unit 112 inversely quantizes the quantized coefficient input from the quantization unit 108. Specifically, the inverse quantization unit 112 inversely quantizes the quantized coefficient of the current block in a predetermined scanning order. Then, the inverse quantization unit 112 outputs the inversely quantized transform coefficient of the current block to the inverse transform unit 114.
- the predetermined scanning order may be predetermined.
- the inverse transform unit 114 restores the prediction error (residual error) by inversely transforming the transform coefficient input from the inverse quantization unit 112. Specifically, the inverse transform unit 114 restores the prediction error of the current block by performing an inverse transform corresponding to the transform performed by the transform unit 106 on the transform coefficient. Then, the inverse transformation 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 subtraction unit 104, because information is usually lost due to quantization. That is, the restored prediction error usually includes the quantization error.
- the adding unit 116 reconstructs the current block by adding the prediction error input from the inverse transform unit 114 and the prediction sample 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.
- the reconstruction block may also be referred to as a local decoding block.
- the block memory 118 is, for example, a storage unit that stores a block that is referred to in intra prediction and that is included in a current picture to be coded. Specifically, the block memory 118 stores the reconstructed block output from the addition unit 116.
- the frame memory 122 is, for example, a storage unit for storing a reference picture used for inter prediction, and may be called a frame buffer. Specifically, the frame memory 122 stores the reconstructed block filtered by the loop filter unit 120.
- 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 or DBF), a sample adaptive offset (SAO), an adaptive loop filter (ALF), and the like.
- a least square error filter for removing coding distortion is applied, and for example, for each 2 ⁇ 2 sub-block in the current block, a plurality of multiples based on the direction and the activity of a local gradient are used. One filter selected from the filters is applied.
- sub-blocks are classified into multiple classes (eg 15 or 25 classes).
- Sub-block classification is based on gradient direction and activity.
- the sub-block is classified into a plurality of classes.
- the gradient direction value D 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.
- the filter for the sub-block is determined from the multiple filters.
- FIG. 6A to 6C are views showing a plurality of examples of the shapes of filters used in ALF.
- 6A shows a 5 ⁇ 5 diamond shaped filter
- FIG. 6B shows a 7 ⁇ 7 diamond shaped filter
- FIG. 6C shows a 9 ⁇ 9 diamond shaped filter.
- the information indicating the shape of the filter is usually signaled at the picture level.
- the signalization 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, a sequence level, a slice level, a tile level, a CTU level or a CU level).
- ALF on/off may be determined at the picture level or the CU level, for example. For example, it may be determined whether or not ALF is applied at the CU level for luminance, and whether or not ALF is applied at the picture level for color difference.
- Information indicating ON/OFF of ALF is usually signaled at a picture level or a CU level. Signaling of information indicating ON/OFF of ALF does not have to be limited to the picture level or the CU level, and may be at another level (for example, sequence level, slice level, tile level or CTU level). Good.
- the coefficient set of multiple selectable filters (eg up to 15 or 25 filters) is usually signaled at the picture level.
- the signalization of the coefficient set does not have to be limited to the picture level, and may be another level (eg, sequence level, slice level, tile level, CTU level, CU level or sub-block level).
- the loop filter unit 120 reduces the distortion generated at the block boundary by filtering the block boundary of the reconstructed image.
- FIG. 7 is a block diagram showing an example of a detailed configuration of the loop filter unit 120 that functions as a deblocking filter.
- the loop filter unit 120 includes a boundary determination unit 1201, a filter determination unit 1203, a filter processing unit 1205, a processing determination unit 1208, a filter characteristic determination unit 1207, and switches 1202, 1204, and 1206.
- the boundary determination unit 1201 determines whether or not the pixel to be deblocked/filtered (that is, the target pixel) exists near the block boundary. Then, the boundary determination unit 1201 outputs the determination result to the switch 1202 and the processing determination unit 1208.
- the switch 1202 outputs the image before the filter processing to the switch 1204 when the boundary determination unit 1201 determines that the target pixel exists near the block boundary. On the contrary, when the boundary determining unit 1201 determines that the target pixel does not exist near the block boundary, the switch 1202 outputs the image before the filter processing to the switch 1206.
- the filter determination unit 1203 determines whether to perform deblocking filter processing on the target pixel based on the pixel values of at least one peripheral pixel around the target pixel. Then, the filter determination unit 1203 outputs the determination result to the switch 1204 and the processing determination unit 1208.
- the switch 1204 When the filter determination unit 1203 determines that the target pixel is to be subjected to deblocking filter processing, the switch 1204 outputs the pre-filtering image acquired via the switch 1202 to the filter processing unit 1205. On the contrary, when the filter determination unit 1203 determines that the target pixel is not subjected to the deblocking filtering process, the switch 1204 outputs the image before the filtering process acquired through the switch 1202 to the switch 1206.
- the filtering unit 1205 When the image before filtering is acquired via the switches 1202 and 1204, the filtering unit 1205 performs the deblocking filtering process having the filter characteristic determined by the filter characteristic determining unit 1207 on the target pixel. Run. Then, the filter processing unit 1205 outputs the pixel after the filter processing to the switch 1206.
- the switch 1206 selectively outputs a pixel that has not been deblocked and filtered and a pixel that has been deblocked and filtered by the filter processing unit 1205, under the control of the processing determination unit 1208.
- the processing determination unit 1208 controls the switch 1206 based on the determination results of the boundary determination unit 1201 and the filter determination unit 1203. That is, when the processing determination unit 1208 determines that the target pixel exists near the block boundary by the boundary determination unit 1201 and that the target pixel is subjected to the deblocking filter processing by the filter determination unit 1203. , The pixel subjected to the deblocking filter processing is output from the switch 1206. In addition, except for the above case, the processing determination unit 1208 causes the switch 1206 to output a pixel that has not been subjected to deblocking filter processing. By repeating the output of such pixels, the image after the filter processing is output from the switch 1206.
- FIG. 8 is a conceptual diagram showing an example of a deblocking filter having a symmetric filter characteristic with respect to a block boundary.
- one of two deblocking filters having different characteristics that is, a strong filter or a weak filter is selected using a pixel value and a quantization parameter.
- a strong filter as shown in FIG. 8
- the pixel values of the pixels q0 to q2 are calculated by the following formulas, for example.
- the pixel values q′0 to q′2 are changed by performing
- p0 to p2 and q0 to q2 are the pixel values of the pixels p0 to p2 and the pixels q0 to q2, respectively.
- q3 is the pixel value of the pixel q3 adjacent to the pixel q2 on the opposite side of the block boundary.
- the coefficient by which the pixel value of each pixel used for deblocking filter processing is multiplied is the filter coefficient.
- clip processing may be performed so that the pixel value after calculation does not exceed the threshold value and is not set.
- the pixel value after the calculation according to the above formula is clipped to “the calculation target pixel value ⁇ 2 ⁇ threshold value” using the threshold value determined from the quantization parameter. This can prevent excessive smoothing.
- FIG. 9 is a conceptual diagram for explaining a block boundary where deblocking filter processing is performed.
- FIG. 10 is a conceptual diagram showing an example of the Bs value.
- the block boundary on which the deblocking filter processing is performed is, for example, a PU (Prediction Unit) or TU (Transform Unit) boundary of an 8 ⁇ 8 pixel block as shown in FIG. 9.
- the deblocking filtering process can be performed in units of 4 rows or 4 columns.
- the deblocking filtering process for the color difference signal is performed when the Bs value is 2.
- the deblocking filtering process on the luminance signal is performed when the Bs value is 1 or more and a predetermined condition is satisfied.
- the predetermined condition may be predetermined.
- the Bs value determination conditions are not limited to those shown in FIG. 10, and may be determined based on other parameters.
- FIG. 11 is a flowchart showing an example of processing performed by the prediction processing unit of the encoding device 100.
- the prediction processing unit includes all or some of the components of the intra prediction unit 124, the inter prediction unit 126, and the prediction control unit 128.
- the prediction processing unit generates a prediction image of the current block (step Sb_1).
- This prediction image is also called a prediction signal or a prediction block.
- the prediction signal includes, for example, an intra prediction signal or an inter prediction signal.
- the prediction processing unit generates a prediction block, a difference block, a coefficient block, a difference block, and a decoded image block, and reconstructs an already obtained reconstructed image.
- the predicted image of the current block is generated by using this.
- the reconstructed image may be, for example, the image of the reference picture or the image of the encoded block in the current picture that is the picture including the current block.
- the coded block in the current picture is, for example, a block adjacent to the current block.
- FIG. 12 is a flowchart showing another example of the processing performed by the prediction processing unit of the encoding device 100.
- the prediction processing unit generates a predicted image by the first method (step Sc_1a), a predicted image by the second method (step Sc_1b), and a predicted image by the third method (step Sc_1c).
- the first method, the second method, and the third method are different methods for generating a predicted image, and are, for example, an inter prediction method, an intra prediction method, and a prediction method other than them. It may be.
- the above-mentioned reconstructed image may be used in these prediction methods.
- the prediction processing unit selects any one of the plurality of prediction images generated in steps Sc_1a, Sc_1b, and Sc_1c (step Sc_2).
- the selection of the predicted image that is, the selection of the scheme or mode for obtaining the final predicted image may be performed based on the cost calculated for each generated predicted image. Alternatively, the selection of the predicted image may be performed based on the parameters used in the encoding process.
- the coding apparatus 100 may signal the information for specifying the selected predicted image, method, or mode into a coded signal (also referred to as a coded bitstream).
- the information may be, for example, a flag.
- the decoding device can generate a predicted image according to the scheme or mode selected in the encoding device 100 based on the information.
- the prediction processing unit selects any one of the predicted images after generating the predicted image by each method. However, the prediction processing unit selects a method or mode based on the parameters used in the above-described encoding process before generating the predicted images, and generates a predicted image according to the method or mode. Good.
- the first method and the second method are intra prediction and inter prediction, respectively, and the prediction processing unit determines the final predicted image for the current block from the predicted images generated according to these prediction methods. You may choose.
- FIG. 13 is a flowchart showing another example of the processing performed by the prediction processing unit of the encoding device 100.
- the prediction processing unit generates a predicted image by intra prediction (step Sd_1a) and a predicted image by inter prediction (step Sd_1b).
- the prediction image generated by intra prediction is also referred to as an intra prediction image
- the prediction image generated by inter prediction is also referred to as an inter prediction image.
- the prediction processing unit evaluates each of the intra-predicted image and the inter-predicted image (step Sd_2). Cost may be used for this evaluation. That is, the prediction processing unit calculates the respective costs C of the intra prediction image and the inter prediction image.
- D is the coding distortion of the predicted image, and is represented by, for example, the sum of absolute differences between the pixel value of the current block and the pixel value of the predicted image.
- R is the generated code amount of the predicted image, specifically, the code amount necessary for coding the motion information or the like for generating the predicted image.
- ⁇ is, for example, an undetermined multiplier of Lagrange.
- the prediction processing unit selects the prediction image for which the smallest cost C is calculated from the intra prediction image and the inter prediction image as the final prediction image of the current block (step Sd_3). That is, the prediction method or mode for generating the predicted image of the current block is selected.
- the intra prediction unit 124 generates a prediction signal (intra prediction signal) by referring to a block in the current picture stored in the block memory 118 and performing intra prediction (also referred to as intra prediction) of the current block. Specifically, the intra prediction unit 124 generates an intra prediction signal by performing intra prediction with reference to a sample (for example, a luminance value and a color difference value) of a block adjacent to the current block, and predicts and controls the intra prediction signal. Output to the unit 128.
- the intra prediction unit 124 performs intra prediction using one of a plurality of prescribed intra prediction modes.
- the multiple intra prediction modes typically include one or more non-directional prediction modes and multiple directional prediction modes.
- the plurality of prescribed modes may be prescribed in advance.
- the one or more non-directional prediction modes are, for example, H.264. It includes Planar prediction mode and DC prediction mode defined in the H.265/HEVC standard.
- Multiple directionality prediction modes include, for example, H.264. It includes a prediction mode in 33 directions defined by the H.265/HEVC standard. It should be noted that the plurality of directional prediction modes may further include 32 directional prediction modes (total of 65 directional prediction modes) in addition to 33 directions.
- FIG. 14 is a conceptual diagram showing all 67 intra prediction modes (2 non-directional prediction modes and 65 directional prediction modes) that can be used in intra prediction. The solid arrow indicates the H. The 33 directions defined in the H.265/HEVC standard are represented, and the dashed arrows represent the added 32 directions (two non-directional prediction modes are not shown in FIG. 14).
- the luminance block may be referred to in the intra prediction of the color difference block. That is, the color difference component of the current block may be predicted based on the luminance component of the current block.
- Such intra prediction is sometimes called CCLM (cross-component linear model) prediction.
- the intra-prediction mode (for example, called CCLM mode) of the chrominance block that refers to 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 reference pixels in the horizontal/vertical directions. Intra prediction with such a correction is sometimes called PDPC (position dependent intra prediction combination). Information indicating whether or not PDPC is applied (for example, called a PDPC flag) is usually signaled at the CU level. Note that the signaling of this information does not have to be limited to the CU level, but may be another level (eg, sequence level, picture level, slice level, tile level or CTU level).
- the inter prediction unit 126 refers to a reference picture stored in the frame memory 122 and is different from the current picture to perform inter prediction (also referred to as inter-screen prediction) of the current block, thereby predicting a prediction signal (inter prediction). Predicted signal).
- the inter prediction is performed in units of the current block or the current sub block (for example, 4 ⁇ 4 block) in the current block.
- the inter prediction unit 126 performs a motion estimation on a current block or a current subblock in a reference picture to find a reference block or a subblock that best matches the current block or the current subblock.
- the inter prediction unit 126 acquires motion information (for example, motion vector) that compensates for motion or change from the reference block or sub-block to the current block or sub-block.
- the inter prediction unit 126 performs motion compensation (or motion prediction) based on the motion information, and generates an inter prediction signal of the current block or sub block.
- the inter prediction unit 126 outputs the generated inter prediction signal to the prediction control unit 128.
- the motion information used for motion compensation may be signaled as an inter prediction signal in various forms.
- the motion vector may be signalized.
- the difference between the motion vector and the motion vector predictor may be signaled.
- FIG. 15 is a flowchart showing an example of the basic flow of inter prediction.
- the inter prediction unit 126 first generates a predicted image (steps Se_1 to Se_3). Next, the subtraction unit 104 generates a difference between the current block and the predicted image as a prediction residual (step Se_4).
- the inter prediction unit 126 determines the motion vector (MV) of the current block (steps Se_1 and Se_2) and performs the motion compensation (step Se_3) to generate the predicted image. To do. Further, the inter prediction unit 126 determines an MV by selecting a candidate motion vector (candidate MV) (step Se_1) and deriving an MV (step Se_2). The selection of the candidate MV is performed, for example, by selecting at least one candidate MV from the candidate MV list. In the derivation of MVs, the inter prediction unit 126 determines at least one selected candidate MV as the MV of the current block by selecting at least one candidate MV from among at least one candidate MV. May be.
- the inter prediction unit 126 may determine the MV of the current block by searching the area of the reference picture indicated by the candidate MV for each of the selected at least one candidate MV. It should be noted that searching the area of the reference picture may be referred to as motion estimation.
- steps Se_1 to Se_3 are performed by the inter prediction unit 126, but the processes such as step Se_1 or step Se_2 may be performed by another component included in the encoding device 100. ..
- FIG. 16 is a flowchart showing an example of motion vector derivation.
- the inter prediction unit 126 derives the MV of the current block in a mode in which motion information (for example, MV) is encoded.
- motion information for example, MV
- motion information is coded as a prediction parameter and signalized. That is, the encoded motion information is included in the encoded signal (also referred to as an encoded bitstream).
- the inter prediction unit 126 derives the MV in a mode in which motion information is not encoded. In this case, the motion information is not included in the encoded signal.
- the MV derivation mode may include a normal inter mode, a merge mode, a FRUC mode, and an affine mode, which will be described later.
- modes for encoding motion information include a normal inter mode, a merge mode, and an affine mode (specifically, an affine inter mode and an affine merge mode).
- the motion information may include not only the MV but also the motion vector predictor selection information described later. Further, as a mode in which motion information is not coded, there is a FRUC mode or the like.
- the inter prediction unit 126 selects a mode for deriving the MV of the current block from these plural modes, and derives the MV of the current block using the selected mode.
- FIG. 17 is a flowchart showing another example of motion vector derivation.
- the inter prediction unit 126 derives the MV of the current block in the mode of encoding the difference MV.
- the difference MV is coded as a prediction parameter and signalized. That is, the encoded difference MV is included in the encoded signal.
- This difference MV is the difference between the MV of the current block and its predicted MV.
- the inter prediction unit 126 derives the MV in a mode in which the difference MV is not encoded.
- the encoded difference MV is not included in the encoded signal.
- the MV derivation modes include a normal inter mode, a merge mode, a FRUC mode, and an affine mode, which will be described later.
- these modes there are a normal inter mode and an affine mode (specifically, an affine inter mode) as a mode for encoding the difference MV.
- modes that do not encode the difference MV include a FRUC mode, a merge mode, and an affine mode (specifically, an affine merge mode).
- the inter prediction unit 126 selects a mode for deriving the MV of the current block from these plural modes, and derives the MV of the current block using the selected mode.
- FIG. 18 is a flowchart showing another example of motion vector derivation.
- the modes that do not encode the difference MV include a merge mode, a FRUC mode, and an affine mode (specifically, an affine merge mode).
- the merge mode is a mode for deriving the MV of the current block by selecting a motion vector from the surrounding encoded blocks
- the FRUC mode is This is a mode for deriving the MV of the current block by performing a search between coded areas.
- the affine mode is a mode in which the motion vector of each of the plurality of sub-blocks forming the current block is derived as the MV of the current block, assuming affine transformation.
- the inter prediction unit 126 when the inter prediction mode information indicates 0 (0 in Sf_1), the inter prediction unit 126 derives a motion vector in the merge mode (Sf_2). Also, when the inter prediction mode information indicates 1 (1 in Sf_1), the inter prediction unit 126 derives a motion vector in the FRUC mode (Sf_3). Further, when the inter prediction mode information indicates 2 (2 in Sf_1), the inter prediction unit 126 derives a motion vector in the affine mode (specifically, the affine merge mode) (Sf_4). In addition, when the inter prediction mode information indicates 3 (3 in Sf_1), the inter prediction unit 126 derives a motion vector in a mode for encoding the difference MV (for example, normal inter mode) (Sf_5).
- the normal inter mode is an inter prediction mode in which the MV of the current block is derived from the area of the reference picture indicated by the candidate MV, based on the block similar to the image of the current block. Further, in this normal inter mode, the difference MV is encoded.
- FIG. 19 is a flowchart showing an example of inter prediction in the normal inter mode.
- the inter prediction unit 126 first acquires a plurality of candidate MVs for the current block based on information such as the MVs of a plurality of encoded blocks surrounding the current block temporally or spatially (step). Sg_1). That is, the inter prediction unit 126 creates a candidate MV list.
- the inter prediction unit 126 selects each of N (N is an integer of 2 or more) candidate MVs from the plurality of candidate MVs acquired in step Sg_1 as a motion vector predictor candidate (also referred to as a predicted MV candidate). As a result, extraction is performed according to a predetermined priority order (step Sg_2).
- the priority order may be predetermined for each of the N candidate MVs.
- the inter prediction unit 126 selects one motion vector predictor candidate from the N motion vector predictor candidates as a motion vector predictor (also referred to as a motion vector MV) of the current block (step Sg_3). At this time, the inter prediction unit 126 encodes the motion vector predictor selection information for identifying the selected motion vector predictor into a stream.
- the stream is the above-mentioned coded signal or coded bit stream.
- the inter prediction unit 126 refers to the coded reference picture and derives the MV of the current block (step Sg_4). At this time, the inter prediction unit 126 further encodes the difference value between the derived MV and the motion vector predictor as a difference MV into a stream.
- the coded reference picture is a picture composed of a plurality of blocks reconstructed after coding.
- the inter prediction unit 126 generates a predicted image of the current block by performing motion compensation on the current block using the derived MV and the encoded reference picture (step Sg_5).
- the predicted image is the inter prediction signal described above.
- the information included in the encoded signal and indicating the inter prediction mode (normal inter mode in the above example) used to generate the predicted image is coded as a prediction parameter, for example.
- the candidate MV list may be commonly used with lists used in other modes. Further, the process related to the candidate MV list may be applied to the process related to the list used in another mode.
- the processing related to this candidate MV list is, for example, extraction or selection of candidate MVs from the candidate MV list, rearrangement of candidate MVs, or deletion of candidate MVs.
- the merge mode is an inter prediction mode that derives the MV by selecting the candidate MV from the candidate MV list as the MV of the current block.
- FIG. 20 is a flowchart showing an example of inter prediction in merge mode.
- the inter prediction unit 126 first acquires a plurality of candidate MVs for the current block based on information such as the MVs of a plurality of encoded blocks surrounding the current block temporally or spatially (step). Sh_1). That is, the inter prediction unit 126 creates a candidate MV list.
- the inter prediction unit 126 derives the MV of the current block by selecting one candidate MV from the plurality of candidate MVs acquired in step Sh_1 (step Sh_2). At this time, the inter prediction unit 126 encodes the MV selection information for identifying the selected candidate MV into a stream.
- the inter prediction unit 126 generates a predicted image of the current block by performing motion compensation on the current block using the derived MV and the encoded reference picture (step Sh_3).
- the information included in the encoded signal and indicating the inter prediction mode (merge mode in the above example) used to generate the predicted image is encoded as, for example, a prediction parameter.
- FIG. 21 is a conceptual diagram for explaining an example of the motion vector derivation process of the current picture in the merge mode.
- Predictive MV candidates include spatially adjacent prediction MVs that are MVs of a plurality of coded blocks spatially located around the target block, and blocks around which the position of the target block in the coded reference picture is projected.
- There are a temporally adjacent prediction MV which is an MV that the user has, a jointly predicted MV which is an MV generated by combining MV values of a spatially adjacent prediction MV and a temporally adjacent prediction MV, and a zero prediction MV which is a MV having a value of zero.
- variable length coding unit a signal indicating which prediction MV is selected, merge_idx, is described in the stream and coded.
- the prediction MVs registered in the prediction MV list described in FIG. 21 are examples, and the number may be different from the number in the figure, or may be a configuration that does not include some types of the prediction MV in the figure.
- the configuration may be such that prediction MVs other than the types of prediction MVs in the figure are added.
- the final MV may be determined by performing a DMVR (decoder motion vector refinement) process described later using the MV of the target block derived by the merge mode.
- DMVR decoder motion vector refinement
- the candidate of the predicted MV is the above-mentioned candidate MV
- the predicted MV list is the above-mentioned candidate MV list.
- the candidate MV list may be referred to as a candidate list.
- merge_idx is MV selection information.
- the motion information may be derived on the decoding device side without being signalized on the encoding device side. Note that, as described above, H.264.
- the merge mode defined by the H.265/HEVC standard may be used. Further, for example, the motion information may be derived by performing motion search on the decoding device side. In the embodiment, on the decoding device side, motion search is performed without using the pixel value of the current block.
- the mode for performing motion search on the decoding device side will be described.
- the mode for performing motion search on the side of this decoding device is sometimes called a PMMVD (pattern matched motion vector derivation) mode or a FRUC (frame rate up-conversion) mode.
- PMMVD pattern matched motion vector derivation
- FRUC frame rate up-conversion
- a list of a plurality of candidates each having a motion vector predictor (MV) (that is, a candidate MV list, (It may be common to the merge list) is generated (step Si_1).
- the best candidate MV is selected from the plurality of candidate MVs registered in the candidate MV list (step Si_2). For example, the evaluation value of each candidate MV included in the candidate MV list is calculated, and one candidate MV is selected based on the evaluation value.
- the motion vector for the current block is derived based on the motion vector of the selected candidate (step Si_4).
- the motion vector of the selected candidate is directly derived as the motion vector for the current block.
- the motion vector for the current block may be derived by performing pattern matching in the peripheral region of the position in the reference picture corresponding to the selected candidate motion vector. That is, the area around the best candidate MV is searched for using pattern matching in the reference picture and the evaluation value, and if there is an MV with a better evaluation value, the best candidate MV is set to the MV. It may be updated to be the final MV of the current block. It is also possible to adopt a configuration in which the process of updating to an MV having a better evaluation value is not performed.
- the inter prediction unit 126 generates a predicted image of the current block by performing motion compensation on the current block using the derived MV and the encoded reference picture (step Si_5).
- the evaluation value may be calculated by various methods. For example, a reconstructed image of a region in a reference picture corresponding to a motion vector and a predetermined region (the region is a region of another reference picture or a region of an adjacent block of the current picture, as shown below, for example. May be used).
- the predetermined area may be predetermined.
- the difference between the pixel values of the two reconstructed images may be calculated and used as the evaluation value of the motion vector.
- the evaluation value may be calculated using other information in addition to the difference value.
- one candidate MV included in the candidate MV list (for example, merge list) is selected as a start point of the search by pattern matching.
- the first pattern matching or the second pattern matching may be used as the pattern matching.
- the first pattern matching and the second pattern matching may be referred to as bilateral matching and template matching, respectively.
- the predetermined area may be predetermined.
- FIG. 23 is a conceptual diagram for explaining an example of first pattern matching (bilateral matching) between two blocks in two reference pictures along a motion trajectory.
- first pattern matching in a pair of two blocks in two different 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 best matching pair. Specifically, for the current block, the reconstructed image at the specified position in the first coded reference picture (Ref0) specified by the candidate MV and the symmetric MV obtained by scaling the candidate MV at the display time interval.
- the difference with the reconstructed image at the specified position in the second coded reference picture (Ref1) specified by is derived, and the evaluation value is calculated using the obtained difference value. It is possible to select, as the final MV, the candidate MV having the best evaluation value among the plurality of candidate MVs, which may bring about a good result.
- the motion vector (MV0, MV1) pointing to two reference blocks is the temporal distance between the current picture (CurPic) and the two reference pictures (Ref0, Ref1). It is proportional to (TD0, TD1). For example, 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, mirror-symmetric bidirectional motion vectors are used. Is derived.
- MV derivation>FRUC> template matching In the second pattern matching (template matching), pattern matching is performed between a template in the current picture (a block adjacent to the current block in the current picture (for example, an upper and/or left adjacent block)) and a block in the reference picture. Done. 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 above-described candidate evaluation value.
- FIG. 24 is a conceptual diagram for explaining an example of pattern matching (template matching) between a template in the current picture and a block in the reference picture.
- the current picture (CurPic) is searched for in the reference picture (Ref0) the block that most closely matches the block adjacent to the current block (Cur block).
- the motion vector of is derived.
- the reconstructed image of the left adjacent and/or upper adjacent encoded areas and the equivalent in the encoded reference picture (Ref0) specified by the candidate MV are equal.
- the difference with the reconstructed image at the position is derived, 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. It is possible.
- a FRUC flag indicating whether or not the FRUC mode is applied may be signaled at the CU level.
- information indicating an applicable pattern matching method first pattern matching or second pattern matching
- the signaling of these pieces of information is not limited to the CU level and may be another level (eg, sequence level, picture level, slice level, tile level, CTU level or sub-block level). ..
- FIG. 25A is a conceptual diagram for explaining an example of derivation of a motion vector in sub-block units based on motion vectors of a plurality of adjacent blocks.
- the current block includes 16 4x4 sub-blocks.
- 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, and similarly, the motion vector v 0 of the upper right corner control point of the current block is derived based on the motion vector of the adjacent sub block. 1 is derived.
- the two motion vectors v 0 and v 1 may be projected and the motion vector (v x , v y ) of each sub-block in the current block may be derived by the following expression (1A).
- x and y respectively indicate the horizontal position and the vertical position of the sub-block
- w indicates a predetermined weighting coefficient.
- the predetermined weighting factor may be predetermined.
- Information (such as an affine flag) indicating such an affine mode may be signaled at the CU level.
- the signalization of the information indicating the affine mode does not have to be limited to the CU level, but may be another level (for example, a sequence level, a picture level, a slice level, a tile level, a CTU level or a sub-block level). You may.
- an affine mode may include some modes in which the method of deriving the motion vector of the upper left and upper right corner control points is different.
- FIG. 25B is a conceptual diagram for explaining an example of derivation of a motion vector in a sub-block unit in an affine mode having three control points.
- the current block includes 16 4x4 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 block.
- the motion vector v 2 of the lower left corner control point of the current block is derived based on the motion vectors of the adjacent blocks.
- three motion vectors v 0 , v 1 and v 2 may be projected by the following equation (1B), and the motion vector (v x , v y ) of each sub-block in the current block is derived. Good.
- x and y respectively indicate the horizontal position and the vertical position of the center of the sub block
- w indicates the width of the current block
- h indicates the height of the current block.
- Affine modes with different numbers of control points may be signaled by switching at the CU level.
- the information indicating the number of affine mode control points used at the CU level may be signaled at another level (for example, sequence level, picture level, slice level, tile level, CTU level or sub-block level). Good.
- the affine mode having such three control points may include some modes in which the method of deriving the motion vector of the upper left, upper right and lower left corner control points is different.
- FIGS. 26A, 26B, and 26C are conceptual diagrams for explaining the affine merge mode.
- an encoded block A left
- a block B upper
- a block C upper right
- a block D lower left
- a block E upper left
- the predicted motion vector of each control point of the current block is calculated based on the plurality of motion vectors corresponding to the block encoded in the affine mode.
- these blocks are examined in the order of encoded block A (left), block B (top), block C (top right), block D (bottom left), and block E (top left), and in affine mode.
- the first valid block encoded is identified.
- the predicted motion vector of the control point of the current block is calculated based on the plurality of motion vectors corresponding to the specified block.
- the upper left corner and the upper right corner of the encoded block including the block A are The motion vectors v 3 and v 4 projected at the position of are derived. Then, the predicted motion vector v 0 of the control point at the upper left corner of the current block and the predicted motion vector v 1 of the control point at the upper right corner of the current block are calculated from the derived motion vectors v 3 and v 4 .
- the upper left corner and the upper right corner of the encoded block including the block A are And the motion vectors v 3 , v 4 and v 5 projected to the position of the lower left corner are derived. Then, from the derived motion vectors v 3 , v 4 and v 5 , the predicted motion vector v 0 of the control point at the upper left corner of the current block, the predicted motion vector v 1 of the control point at the upper right corner, and the control of the lower left corner. The predicted motion vector v 2 of the point is calculated.
- this predictive motion vector deriving method may be used for deriving each predictive motion vector of the control point of the current block in step Sj_1 of FIG. 29 described later.
- FIG. 27 is a flowchart showing an example of the affine merge mode.
- the inter prediction unit 126 first derives the prediction MV of each control point of the current block (step Sk_1).
- the control points are the upper left corner and the upper right corner of the current block as shown in FIG. 25A, or the upper left corner, the upper right corner and the lower left corner of the current block as shown in FIG. 25B.
- the inter prediction unit 126 performs the sequence of the coded block A (left), block B (upper), block C (upper right), block D (lower left), and block E (upper left). Examine these blocks and identify the first valid block encoded in affine mode.
- the inter prediction unit 126 causes the motion vector v 3 at the upper left corner and the upper right corner of the encoded block including the block A, as illustrated in FIG. 26B.
- v 4 the motion vector v 0 of the control point at the upper left corner of the current block and the motion vector v 1 of the control point at the upper right corner are calculated.
- the inter prediction unit 126 projects the motion vectors v 3 and v 4 at the upper left corner and the upper right corner of the coded block onto the current block to predict the motion vector predictor v 0 at the control point at the upper left corner of the current block.
- the predicted motion vector v 1 of the control point at the upper right corner the predicted motion vector v 1 of the control point at the upper right corner.
- the inter prediction unit 126 moves the upper left corner, the upper right corner, and the lower left corner of the encoded block including the block A, as illustrated in FIG. 26C.
- the motion vector v 0 of the control point at the upper left corner of the current block, the motion vector v 1 of the control point at the upper right corner, and the motion vector v 2 of the control point at the lower left corner of the current block are calculated from the vectors v 3 , v 4 and v 5. To do.
- the inter prediction unit 126 projects the motion vectors v 3 , v 4 and v 5 at the upper left corner, the upper right corner and the lower left corner of the coded block onto the current block to control points at the upper left corner of the current block. to the calculated and the predicted motion vector v 0, the predicted motion vector v 1 of the control point in the upper right corner, the control point of the lower-left corner of the motion vector v 2.
- the inter prediction unit 126 performs motion compensation on each of the plurality of sub blocks included in the current block. That is, the inter prediction unit 126 determines, for each of the plurality of sub-blocks, the two motion vector predictors v 0 and v 1 and the above-mentioned equation (1A), or the three motion vector predictors v 0 , v 1 and v 2 .
- the motion vector of the sub-block is calculated as the affine MV using the above equation (1B) (step Sk_2).
- the inter prediction unit 126 performs motion compensation on the sub-block using the affine MV and the encoded reference picture (step Sk_3). As a result, motion compensation is performed on the current block, and a predicted image of the current block is generated.
- FIG. 28A is a conceptual diagram for explaining an affine inter mode having two control points.
- the motion vector selected from the motion vectors of the coded block A, block B, and block C adjacent to the current block is the prediction of the control point at the upper left corner of the current block. It is used as the motion vector v 0 .
- the motion vector selected from the motion vectors of the coded blocks D and E adjacent to the current block is used as the predicted motion vector v 1 of the control point at the upper right corner of the current block.
- FIG. 28B is a conceptual diagram for explaining an affine inter mode having three control points.
- the motion vector selected from the motion vectors of the coded blocks A, B and C adjacent to the current block is the prediction of the control point at the upper left corner of the current block. It is used as the motion vector v 0 .
- the motion vector selected from the motion vectors of the coded blocks D and E adjacent to the current block is used as the predicted motion vector v 1 of the control point at the upper right corner of the current block.
- the motion vector selected from the motion vectors of the coded blocks F and G adjacent to the current block is used as the predicted motion vector v 2 of the control point at the lower left corner of the current block.
- FIG. 29 is a flowchart showing an example of the affine inter mode.
- the inter prediction unit 126 predicts the prediction MV (v 0 , v 1 ) or (v 0 , v 1 , v of each of the two or three control points of the current block. 2 ) is derived (step Sj_1).
- the control point is a point at the upper left corner, upper right corner, or lower left corner of the current block, as shown in FIG. 25A or 25B.
- the inter prediction unit 126 predicts the control point of the current block by selecting the motion vector of any block of the coded blocks near each control point of the current block shown in FIG. 28A or 28B.
- the motion vector (v 0 , v 1 ) or (v 0 , v 1 , v 2 ) is derived.
- the inter prediction unit 126 encodes the motion vector predictor selection information for identifying the two selected motion vectors into a stream.
- the inter prediction unit 126 determines which motion vector of a block is selected from the coded blocks adjacent to the current block as the motion vector predictor of the control point by using cost evaluation or the like, and which motion vector predictor is selected. A flag indicating whether it has been selected may be described in the bitstream.
- the inter prediction unit 126 performs motion search (steps Sj_3 and Sj_4) while updating the motion vector predictor selected or derived in step Sj_1 (step Sj_2). That is, the inter prediction unit 126 calculates the motion vector of each sub-block corresponding to the updated motion vector predictor as the affine MV using the above formula (1A) or formula (1B) (step Sj_3). Then, the inter prediction unit 126 performs motion compensation on each sub-block using the affine MV and the encoded reference picture (step Sj_4). As a result, the inter prediction unit 126 determines, as a motion vector of the control point, a motion vector predictor for which the smallest cost is obtained in the motion search loop (step Sj_5). At this time, the inter prediction unit 126 further encodes each difference value between the determined MV and the motion vector predictor as a difference MV in the stream.
- the inter prediction unit 126 generates a predicted image of the current block by performing motion compensation on the current block using the determined MV and the encoded reference picture (step Sj_6).
- FIG. 30A and FIG. 30B are conceptual diagrams for explaining a control point prediction vector deriving method in the case where the number of control points is different between the encoded block and the current block.
- the current block has three control points of the upper left corner, the upper right corner, and the lower left corner, and the block A adjacent to the left of the current block has two control points.
- the motion vectors v 3 and v 4 projected at the positions of the upper left corner and the upper right corner of the encoded block including the block A are derived.
- the predicted motion vector v 0 of the control point at the upper left corner of the current block and the predicted motion vector v 1 of the control point at the upper right corner of the current block are calculated from the derived motion vectors v 3 and v 4 .
- the predicted motion vector v 2 of the control point at the lower left corner is calculated from the derived motion vectors v 0 and v 1 .
- the current block has two control points at the upper left corner and the upper right corner, and the block A adjacent to the left of the current block is encoded in the affine mode having three control points.
- the motion vectors v 3 , v 4 and v 5 projected at the positions of the upper left corner, upper right corner and lower left corner of the encoded block including the block A are derived.
- the predicted motion vector v 0 of the control point at the upper left corner and the predicted motion vector v 1 of the control point at the upper right corner of the current block are calculated.
- This predictive motion vector deriving method may be used for deriving the predictive motion vector of each control point of the current block in step Sj_1 of FIG.
- FIG. 31A is a flowchart showing the relationship between the merge mode and DMVR.
- the inter prediction unit 126 derives the motion vector of the current block in the merge mode (step Sl_1). Next, the inter prediction unit 126 determines whether or not to search a motion vector, that is, a motion search (step Sl_2). Here, when the inter prediction unit 126 determines not to perform the motion search (No in step Sl_2), the inter prediction unit 126 determines the motion vector derived in step Sl_1 as the final motion vector for the current block (step Sl_4). That is, in this case, the motion vector of the current block is determined in the merge mode.
- step Sl_3 the final motion vector is derived (step Sl_3). That is, in this case, the motion vector of the current block is determined by DMVR.
- FIG. 31B is a conceptual diagram for explaining an example of the DMVR process for determining the MV.
- the optimal MVP set in the current block (for example, in merge mode) is set as the candidate MV.
- the candidate MV (L0) the reference pixel is specified from the first reference picture (L0) which is a coded picture in the L0 direction.
- the reference pixel is specified from the second reference picture (L1) which is a coded picture in the L1 direction.
- a template is generated by averaging these reference pixels.
- the peripheral areas of the candidate MVs of the first reference picture (L0) and the second reference picture (L1) are searched respectively, and the MV that minimizes the cost is determined as the final MV.
- the cost value may be calculated using, for example, a difference value between each pixel value of the template and each pixel value of the search area, a candidate MV value, and the like.
- the encoding device and the decoding device described later have basically the same configuration and operation of the processing described here.
- any processing may be used as long as it is a processing that can search the periphery of the candidate MV and derive the final MV.
- BIO/OBMC In motion compensation, there is a mode in which a predicted image is generated and the predicted image is corrected.
- the mode is, for example, BIO and OBMC described later.
- FIG. 32 is a flowchart showing an example of generation of a predicted image.
- the inter prediction unit 126 generates a predicted image (step Sm_1), and corrects the predicted image according to, for example, any of the modes described above (step Sm_2).
- FIG. 33 is a flowchart showing another example of generation of a predicted image.
- the inter prediction unit 126 determines the motion vector of the current block (step Sn_1). Next, the inter prediction unit 126 generates a predicted image (step Sn_2) and determines whether or not to perform the correction process (step Sn_3). Here, when the inter prediction unit 126 determines to perform the correction process (Yes in step Sn_3), the inter prediction unit 126 corrects the predicted image to generate a final predicted image (step Sn_4). On the other hand, when the inter prediction unit 126 determines not to perform the correction process (No in step Sn_3), the inter prediction unit 126 outputs the predicted image as a final predicted image without correction (step Sn_5).
- the mode is, for example, LIC described later.
- FIG. 34 is a flowchart showing another example of generation of a predicted image.
- the inter prediction unit 126 derives a motion vector of the current block (step So_1). Next, the inter prediction unit 126 determines whether to perform the brightness correction process (step So_2). Here, when the inter prediction unit 126 determines to perform the brightness correction process (Yes in step So_2), the inter prediction unit 126 generates a predicted image while performing the brightness correction (step So_3). That is, the predicted image is generated by the LIC. On the other hand, when the inter prediction unit 126 determines that the brightness correction process is not performed (No in step So_2), the inter prediction unit 126 generates a predicted image by normal motion compensation without performing the brightness correction (step So_4).
- 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 weighted addition of the prediction signal based on the motion information (in the reference picture) obtained by the motion search and the prediction signal based on the motion information of the adjacent block (in the current picture)
- the inter prediction signal may be generated in units of sub-blocks in the block.
- Such inter prediction (motion compensation) may be referred to as OBMC (overlapped block motion compensation).
- information indicating the size of a sub block for the OBMC may be signaled at the sequence level. Further, information indicating whether to apply the OBMC mode (for example, called an OBMC flag) may be signaled at the CU level. It should be noted that the level of signalization of these pieces of information is not limited to the sequence level and the CU level, and may be another level (eg, picture level, slice level, tile level, CTU level or sub-block level). Good.
- 35 and 36 are a flowchart and a conceptual diagram for explaining the outline of the predicted image correction process by the OBMC process.
- a prediction image (Pred) obtained by normal motion compensation is acquired using a motion vector (MV) assigned to a processing target (current) block.
- MV motion vector assigned to a processing target (current) block.
- an arrow “MV” indicates a reference picture and indicates what the current block of the current picture refers to in order to obtain a predicted image.
- the motion vector (MV_L) that has already been derived for the coded left adjacent block is applied (reused) to the block to be coded to obtain the predicted image (Pred_L).
- the motion vector (MV_L) is indicated by an arrow “MV_L” pointing from the current block to the reference picture.
- the first prediction image is corrected by superimposing the two prediction images Pred and Pred_L. This has the effect of blending the boundaries between adjacent blocks.
- the motion vector (MV_U) already derived for the encoded upper adjacent block is applied (reused) to the block to be encoded to obtain the predicted image (Pred_U).
- the motion vector (MV_U) is indicated by an arrow "MV_U" pointing from the current block to the reference picture.
- the predicted image Pred_U is superimposed on the predicted image (for example, Pred and Pred_L) that has been subjected to the first correction to perform the second correction of the predicted image. This has the effect of blending the boundaries between adjacent blocks.
- the predicted image obtained by the second correction is the final predicted image of the current block in which the boundaries with adjacent blocks are mixed (smoothed).
- the above-described example is a two-pass correction method that uses left adjacent blocks and upper adjacent blocks, but the correction method is three or more passes that also use right adjacent blocks and/or lower adjacent blocks.
- the correction method may be used.
- the overlapping area may not be the pixel area of the entire block, but may be only a partial area near the block boundary.
- the predictive image correction process of the OBMC for obtaining one predictive image Pred by superimposing the additional predictive images Pred_L and Pred_U from one reference picture has been described.
- the same process may be applied to each of the plurality of reference pictures.
- a corrected predicted image is acquired from each reference picture, and then the acquired plurality of corrected predicted images are further superimposed. To get the final predicted image.
- the unit of the target block may be a prediction block unit or a subblock unit obtained by further dividing the prediction block.
- the encoding device may determine whether or not the target block belongs to a complex region of motion.
- the coding apparatus sets a value of 1 as obmc_flag when the motion belongs to a complicated area, and applies OBMC processing to perform coding.
- the coding apparatus does not belong to the motion complicated area, it codes as an obmc_flag.
- the value 0 is set to encode the block without applying the OBMC process.
- the decoding device by decoding obmc_flag described in the stream (for example, a compression sequence), whether or not to apply the OBMC process is switched according to the value and decoding is performed.
- the inter prediction unit 126 generates one rectangular predicted image for the rectangular current block. However, the inter prediction unit 126 generates a plurality of predicted images having a shape different from the rectangle for the rectangular current block, and combines the plurality of predicted images to generate a final rectangular predicted image. You may.
- the shape different from the rectangle may be a triangle, for example.
- FIG. 37 is a conceptual diagram for explaining the generation of two triangular predicted images.
- the inter prediction unit 126 generates a triangular predicted image by performing motion compensation on the triangular first partition in the current block using the first MV of the first partition. Similarly, the inter prediction unit 126 generates a triangular predicted image by performing motion compensation on the second triangular partition in the current block using the second MV of the second partition. Then, the inter prediction unit 126 combines these prediction images to generate a prediction image having the same rectangular shape as the current block.
- the first partition and the second partition are each triangular, but they may be trapezoidal or may have mutually different shapes.
- the current block is composed of two partitions, but it may be composed of three or more partitions.
- first partition and the second partition may overlap. That is, the first partition and the second partition may include the same pixel area.
- the predicted image of the current block may be generated using the predicted image of the first partition and the predicted image of the second partition.
- the prediction image is generated by inter prediction for both two partitions, but the prediction image may be generated by intra prediction for at least one partition.
- BIO a method of deriving a motion vector.
- the mode for deriving a motion vector based on a model assuming constant velocity linear motion will be described. This mode is sometimes called a BIO (bi-directional optical flow) mode.
- FIG. 38 is a conceptual diagram for explaining a model assuming a uniform linear motion.
- (vx, vy) indicates a velocity vector
- ⁇ 0, ⁇ 1 indicate a temporal distance between the current picture (Cur Pic) and two reference pictures (Ref0, Ref1), respectively.
- (MVx0, MVy0) indicates a motion vector corresponding to the reference picture Ref0
- (MVx1, MVy1) indicates a motion vector corresponding to the reference picture Ref1.
- This optical flow equation is (i) the temporal 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. It shows that the product of the vertical components of and the sum of is equal to zero.
- the block-based motion vector obtained from the merge list or the like may be corrected on a pixel-by-pixel basis.
- the motion vector may be derived on the decoding device side by a method different from the method of deriving the motion vector based on a model that assumes uniform linear motion.
- the motion vector may be derived in sub-block units based on the motion vectors of a plurality of adjacent blocks.
- FIG. 39 is a conceptual diagram for explaining an example of a predicted image generation method using the brightness correction processing by the LIC processing.
- the MV is derived from the encoded reference picture, and the reference image corresponding to the current block is acquired.
- the current block information indicating how the luminance value has changed between the reference picture and the current picture is extracted.
- This extraction is performed by using the luminance pixel values of the encoded left adjacent reference area (peripheral reference area) and the encoded upper adjacent reference area (peripheral reference area) in the current picture and the reference picture specified by the derived MV. This is performed based on the luminance pixel value at the equivalent position. Then, the brightness correction parameter is calculated using the information indicating how the brightness value has changed.
- a predicted image for the current block is generated by performing the brightness correction process that applies the brightness correction parameter to the reference image in the reference picture specified by MV.
- the shape of the peripheral reference area in FIG. 39 is an example, and other shapes may be used.
- the predicted image may be generated after performing the brightness correction processing in the same manner as in.
- lic_flag is a signal indicating whether to apply LIC processing.
- the encoding device it is determined whether or not the current block belongs to the area in which the brightness change occurs, and if it belongs to the area in which the brightness change occurs, the value is set as lic_flag.
- a value 0 is set as lic_flag and encoding is performed without applying LIC processing.
- the decoding device by decoding the lic_flag described in the stream, whether or not to apply the LIC processing may be switched according to the value to perform the decoding.
- determining whether to apply the LIC processing for example, there is a method of determining whether to apply the LIC processing in the peripheral block.
- determining whether to apply the LIC processing in the peripheral block For example, when the current block is in the merge mode, it is determined whether or not the peripheral coded block selected at the time of deriving the MV in the merge mode process is encoded by applying the LIC process. .. Encoding is performed by switching whether or not to apply the LIC processing according to the result. Even in the case of this example, the same processing is applied to the processing on the decoding device side.
- the inter prediction unit 126 derives a motion vector for acquiring a reference image corresponding to the target block to be encoded from a reference picture that is an encoded picture.
- the inter prediction unit 126 for the target block to be encoded, the luminance pixel values of the left adjacent and upper adjacent encoded peripheral reference regions and the luminance pixels at the same position in the reference picture designated by the motion vector.
- the value is used to extract information indicating how the luminance value has changed between the reference picture and the current picture to be encoded, and the luminance correction parameter is calculated.
- the luminance pixel value of a pixel in the peripheral reference area in the current picture is p0
- the luminance pixel value of a pixel in the peripheral reference area in the reference picture at the same position as the pixel is p1.
- the inter prediction unit 126 performs a brightness correction process on the reference image in the reference picture specified by the motion vector using the brightness correction parameter to generate a predicted image for the encoding target block.
- the brightness pixel value in the reference image is p2
- the brightness pixel value of the predicted image after the brightness correction process is p3.
- the shape of the peripheral reference area in FIG. 39 is an example, and shapes other than this may be used. Further, a part of the peripheral reference area shown in FIG. 39 may be used. For example, an area including a predetermined number of pixels thinned from each of the upper adjacent pixel and the left adjacent pixel may be used as the peripheral reference area.
- the peripheral reference area is not limited to the area adjacent to the target block for encoding, but may be an area not adjacent to the target block for encoding.
- the predetermined number of pixels may be predetermined.
- the peripheral reference area in the reference picture is an area specified by the motion vector of the encoding target picture from the peripheral reference area in the encoding target picture, but other peripheral motion vectors are used. It may be a designated area.
- the other motion vector may be a motion vector of the peripheral reference area in the current picture.
- the LIC processing may be applied not only to luminance but also to color difference.
- the correction parameters may be individually derived for each of Y, Cb, and Cr, or a common correction parameter may be used for any of them.
- the correction parameter may be derived using the peripheral reference area of the current sub-block and the peripheral reference area of the reference sub-block in the reference picture specified by the MV of the current sub-block.
- the prediction control unit 128 selects either an intra prediction signal (a signal output from the intra prediction unit 124) or an inter prediction signal (a signal output from the inter prediction unit 126), and subtracts the selected signal as a prediction signal. Output to the unit 104 and the addition unit 116.
- the prediction control unit 128 may output the prediction parameter input to the entropy coding unit 110.
- the entropy coding unit 110 may generate a coded bitstream (or sequence) based on the prediction parameter input from the prediction control unit 128 and the quantization coefficient input from the quantization unit 108.
- the prediction parameter may be used in the decoding device.
- the decoding device may receive and decode the encoded bitstream, and may perform the same processing as the prediction processing performed by the intra prediction unit 124, the inter prediction unit 126, and the prediction control unit 128.
- the prediction parameter is a selected prediction signal (for example, a motion vector, a prediction type, or a prediction mode used by the intra prediction unit 124 or the inter prediction unit 126), or an intra prediction unit 124, an inter prediction unit 126, and a prediction control unit. It may include any index, flag, or value based on or indicative of the prediction process performed at 128.
- FIG. 40 is a block diagram showing an implementation example of the encoding device 100.
- the encoding device 100 includes a processor a1 and a memory a2.
- the plurality of components of the encoding device 100 shown in FIG. 1 are implemented by the processor a1 and the memory a2 shown in FIG.
- the processor a1 is a circuit that performs information processing, and is a circuit that can access the memory a2.
- the processor a1 is a dedicated or general-purpose electronic circuit that encodes a moving image.
- the processor a1 may be a processor such as a CPU.
- the processor a1 may be an aggregate of a plurality of electronic circuits. Further, for example, the processor a1 may play the role of a plurality of components among the plurality of components of the encoding device 100 shown in FIG.
- the memory a2 is a dedicated or general-purpose memory that stores information for the processor a1 to encode a moving image.
- the memory a2 may be an electronic circuit and may be connected to the processor a1. Further, the memory a2 may be included in the processor a1. Further, the memory a2 may be an aggregate of a plurality of electronic circuits.
- the memory a2 may be a magnetic disk, an optical disk, or the like, and may be expressed as a storage, a recording medium, or the like.
- the memory a2 may be a non-volatile memory or a volatile memory.
- the moving image to be encoded may be stored in the memory a2, or a bit string corresponding to the encoded moving image may be stored.
- the memory a2 may store a program for the processor a1 to encode a moving image.
- the memory a2 may serve as a component for storing information among the plurality of components of the encoding device 100 shown in FIG.
- the memory a2 may serve as the block memory 118 and the frame memory 122 shown in FIG. More specifically, the memory a2 may store reconstructed blocks, reconstructed pictures, and the like.
- not all of the plurality of components shown in FIG. 1 and the like may be implemented, or all of the plurality of processes described above may not be performed.
- a part of the plurality of constituent elements illustrated in FIG. 1 and the like may be included in another device, and a part of the plurality of processes described above may be executed by another device.
- FIG. 41 is a block diagram showing a functional configuration of the decoding device 200 according to the embodiment.
- the decoding device 200 is a moving image decoding device that decodes a moving image in block units.
- the decoding device 200 includes an entropy decoding unit 202, an inverse quantization unit 204, an inverse transformation unit 206, an addition unit 208, a block memory 210, a loop filter unit 212, and a frame memory 214. And an intra prediction unit 216, an inter prediction unit 218, and a prediction control unit 220.
- the decryption device 200 is realized by, for example, a general-purpose processor and a memory.
- the processor entropy decoding unit 202, inverse quantization unit 204, inverse transformation unit 206, addition unit 208, loop filter unit 212, intra prediction unit. 216, the inter prediction unit 218, and the prediction control unit 220.
- the decoding device 200 is a dedicated one corresponding to the entropy decoding unit 202, the dequantization unit 204, the inverse transformation unit 206, the addition unit 208, the loop filter unit 212, the intra prediction unit 216, the inter prediction unit 218, and the prediction control unit 220. May be implemented as one or more electronic circuits of
- the following describes the overall processing flow of the decoding device 200, and then each component included in the decoding device 200.
- FIG. 42 is a flowchart showing an example of the overall decoding process performed by the decoding device 200.
- the entropy decoding unit 202 of the decoding device 200 specifies a division pattern of a fixed size block (for example, 128 ⁇ 128 pixels) (step Sp_1).
- This division pattern is a division pattern selected by the encoding device 100.
- the decoding device 200 performs the processing of steps Sp_2 to Sp_6 on each of the plurality of blocks that form the division pattern.
- the entropy decoding unit 202 decodes (specifically, entropy decoding) the encoded quantized coefficient and the prediction parameter of the decoding target block (also referred to as the current block) (step Sp_2).
- the inverse quantization unit 204 and the inverse transformation unit 206 restore a plurality of prediction residuals (that is, difference blocks) by performing inverse quantization and inverse transformation on the plurality of quantized coefficients (step Sp_3). ).
- the prediction processing unit including all or part of the intra prediction unit 216, the inter prediction unit 218, and the prediction control unit 220 generates a prediction signal (also referred to as a prediction block) of the current block (step Sp_4).
- the addition unit 208 reconstructs the current block into a reconstructed image (also referred to as a decoded image block) by adding the prediction block to the difference block (step Sp_5).
- the loop filter unit 212 filters the reconstructed image (step Sp_6).
- the decoding device 200 determines whether or not the decoding of the entire picture is completed (step Sp_7), and when it is determined that the decoding is not completed (No in step Sp_7), the processing from step Sp_1 is repeatedly executed.
- steps Sp_1 to Sp_7 are sequentially performed by the decoding device 200. Alternatively, some of these processes may be performed in parallel, and the order of the processes may be changed.
- the entropy decoding unit 202 entropy-decodes the encoded bitstream. Specifically, the entropy decoding unit 202, for example, arithmetically decodes a coded bitstream into a binary signal. Then, the entropy decoding unit 202 debinarizes the binary signal. The entropy decoding unit 202 outputs the quantized coefficient in block units to the inverse quantization unit 204. The entropy decoding unit 202 may output the prediction parameter included in the coded bitstream (see FIG. 1) to the intra prediction unit 216, the inter prediction unit 218, and the prediction control unit 220 according to the embodiment. The intra prediction unit 216, the inter prediction unit 218, and the prediction control unit 220 can execute the same prediction process as the processes performed by the intra prediction unit 124, the inter prediction unit 126, and the prediction control unit 128 on the encoding device side.
- the inverse quantization unit 204 inversely quantizes the quantized coefficient of the decoding target block (hereinafter referred to as the current block) that is the input from the entropy decoding unit 202. Specifically, the inverse quantization unit 204 inversely quantizes each quantized coefficient of the current block based on the quantized parameter corresponding to the quantized coefficient. Then, the inverse quantization unit 204 outputs the inversely quantized quantized coefficient (that is, the transform coefficient) of the current block to the inverse transform 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 information indicating the transformed conversion type. Invert the transformation coefficient of.
- the inverse transform unit 206 applies inverse retransform to the transform coefficient.
- the adding unit 208 reconstructs the current block by adding the prediction error that is the input from the inverse transform unit 206 and the prediction sample that is the input from the prediction control unit 220. Then, the addition 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 that is referred to in intra prediction and that is within a current picture to be decoded (hereinafter referred to as a current picture). Specifically, the block memory 210 stores the reconstructed block output from the addition unit 208.
- the loop filter unit 212 applies a loop filter to the blocks reconstructed by the adder 208, and outputs the reconstructed blocks that have been filtered to the frame memory 214, the display device, and the like.
- one filter is selected from a plurality of filters based on the direction and activity of the local gradient, 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 is sometimes called a frame buffer. Specifically, the frame memory 214 stores the reconstructed block filtered by the loop filter unit 212.
- FIG. 43 is a flowchart showing an example of processing performed by the prediction processing unit of the decoding device 200.
- the prediction processing unit includes all or some of the components of the intra prediction unit 216, the inter prediction unit 218, and the prediction control unit 220.
- the prediction processing unit generates a prediction image of the current block (step Sq_1).
- This prediction image is also called a prediction signal or a prediction block.
- the prediction signal includes, for example, an intra prediction signal or an inter prediction signal.
- the prediction processing unit generates a prediction block, a difference block, a coefficient block, a difference block, and a decoded image block, and reconstructs an already obtained reconstructed image.
- the predicted image of the current block is generated by using this.
- the reconstructed image may be, for example, an image of a reference picture or an image of a decoded block in a current picture that is a picture including a current block.
- the decoded block in the current picture is, for example, a block adjacent to the current block.
- FIG. 44 is a flowchart showing another example of the processing performed by the prediction processing unit of the decoding device 200.
- the prediction processing unit determines the method or mode for generating the predicted image (step Sr_1). For example, this scheme or mode may be determined based on, for example, a prediction parameter.
- the prediction processing unit determines the first method as the mode for generating the prediction image
- the prediction processing unit generates the prediction image according to the first method (step Sr_2a).
- the prediction processing unit determines the second method as the mode for generating the prediction image
- the prediction processing unit generates the prediction image according to the second method (step Sr_2b).
- the prediction processing unit determines the third method as the mode for generating the predicted image
- the prediction processing unit generates the predicted image according to the third method (step Sr_2c).
- the first method, the second method, and the third method are different methods for generating a predicted image, and are, for example, an inter prediction method, an intra prediction method, and a prediction method other than them. It may be.
- the above-mentioned reconstructed image may be used in these prediction methods.
- the intra prediction unit 216 performs intra prediction by referring to a block in the current picture stored in the block memory 210 based on the intra prediction mode read from the coded bitstream, thereby performing a prediction signal (intra prediction). Signal). Specifically, the intra prediction unit 216 generates an intra prediction signal by performing intra prediction with reference to a sample (for example, a luminance value and a color difference value) of a block adjacent to the current block, and predicts and controls the intra prediction signal. Output to the section 220.
- a sample for example, a luminance value and a color difference value
- the intra prediction unit 216 may predict the color difference 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 the reference pixels in the horizontal/vertical directions.
- the inter prediction unit 218 refers to the reference picture stored in the frame memory 214 to predict the current block.
- the prediction is performed in units of the current block or a sub block (for example, 4 ⁇ 4 block) in the current block.
- the inter prediction unit 218 performs motion compensation using motion information (for example, a motion vector) that has been deciphered from a coded bitstream (for example, a prediction parameter output from the entropy decoding unit 202), or the current block or
- the inter prediction signal of the sub block is generated, and the inter prediction signal is output to the prediction control unit 220.
- the inter prediction unit 218 uses not only the motion information of the current block obtained by the motion search but also the motion information of the adjacent block. , Generate inter prediction signals.
- the inter prediction unit 218 follows the pattern matching method (bilateral matching or template matching) read from the coded stream. Motion information is derived by performing a motion search. Then, the inter prediction unit 218 performs motion compensation (prediction) using the derived motion information.
- the inter prediction unit 218 also derives a motion vector based on a model that assumes constant velocity linear motion when the BIO mode is applied. In addition, when the information read from the encoded bitstream indicates that the affine motion compensation prediction mode is applied, the inter prediction unit 218 determines the motion vector in subblock units based on the motion vectors of a plurality of adjacent blocks. Derive.
- the inter prediction unit 218 derives an MV based on the information deciphered from the coded stream and uses the MV. Motion compensation (prediction) is performed.
- FIG. 45 is a flowchart showing an example of inter prediction in the normal inter mode in the decoding device 200.
- the inter prediction unit 218 of the decoding device 200 performs motion compensation for each block.
- the inter prediction unit 218 acquires a plurality of candidate MVs for the current block based on information such as MVs of a plurality of decoded blocks surrounding the current block temporally or spatially (step Ss_1). That is, the inter prediction unit 218 creates a candidate MV list.
- the inter prediction unit 218 determines each of N (N is an integer of 2 or more) candidate MVs from the plurality of candidate MVs acquired in step Ss_1 as a motion vector predictor candidate (also referred to as a predicted MV candidate). As a result, extraction is performed according to a predetermined priority order (step Ss_2). In addition, the priority may be predetermined for each of the N predicted MV candidates.
- the inter prediction unit 218 decodes the motion vector predictor selection information from the input stream (that is, the coded bit stream), and uses the decoded motion vector predictor selection information, the N prediction MV candidates.
- One of the predicted MV candidates is selected as a predicted motion vector (also referred to as predicted MV) of the current block (step Ss_3).
- the inter prediction unit 218 decodes the difference MV from the input stream, and adds the difference value that is the decoded difference MV and the selected motion vector predictor to calculate the MV of the current block. It is derived (step Ss_4).
- the inter prediction unit 218 generates a predicted image of the current block by performing motion compensation on the current block using the derived MV and the decoded reference picture (step Ss_5).
- the prediction control unit 220 selects either the intra prediction signal or the inter prediction signal, and outputs the selected signal as a prediction signal to the addition unit 208.
- the configurations, functions, and processes of the prediction control unit 220, the intra prediction unit 216, and the inter prediction unit 218 on the decoding device side are the same as those of the prediction control unit 128, the intra prediction unit 124, and the inter prediction unit 126 on the encoding device side. May correspond to the configuration, function, and processing of.
- FIG. 46 is a block diagram showing an implementation example of the decoding device 200.
- the decoding device 200 includes a processor b1 and a memory b2.
- the plurality of components of the decoding device 200 shown in FIG. 41 are implemented by the processor b1 and the memory b2 shown in FIG.
- the processor b1 is a circuit that performs information processing, and is a circuit that can access the memory b2.
- the processor b1 is a dedicated or general-purpose electronic circuit that decodes an encoded moving image (that is, an encoded bit stream).
- the processor b1 may be a processor such as a CPU.
- the processor b1 may be an aggregate of a plurality of electronic circuits. Further, for example, the processor b1 may play a role of a plurality of constituent elements among the plurality of constituent elements of the decoding device 200 illustrated in FIG. 41 and the like.
- the memory b2 is a dedicated or general-purpose memory in which information for the processor b1 to decode the encoded bitstream is stored.
- the memory b2 may be an electronic circuit and may be connected to the processor b1.
- the memory b2 may be included in the processor b1.
- the memory b2 may be an aggregate of a plurality of electronic circuits.
- the memory b2 may be a magnetic disk, an optical disk, or the like, and may be expressed as a storage, a recording medium, or the like.
- the memory b2 may be a non-volatile memory or a volatile memory.
- the memory b2 may store a moving image or an encoded bitstream. Further, the memory b2 may store a program for the processor b1 to decode the encoded bitstream.
- the memory b2 may serve as a component for storing information among the plurality of components of the decoding device 200 shown in FIG. 41 and the like. Specifically, the memory b2 may serve as the block memory 210 and the frame memory 214 shown in FIG. More specifically, the memory b2 may store reconstructed blocks, reconstructed pictures, and the like.
- the decoding device 200 not all of the plurality of constituent elements shown in FIG. 41 or the like may be implemented, or all of the plurality of processes described above may not be performed. Some of the plurality of components illustrated in FIG. 41 and the like may be included in another device, and some of the plurality of processes described above may be executed by another device.
- each term may be defined as follows.
- a picture is either an array of luma samples in monochrome format, or an array of luma samples in 4:2:0, 4:2:2 and 4:4:4 color format and two chroma samples. It is a corresponding array.
- the picture may be a frame or a field.
- a frame is a composition of a top field in which a plurality of sample rows 0, 2, 4,... Is generated and a bottom field in which a plurality of sample rows 1, 3, 5,.
- a slice is an independent number of coding trees contained in one independent slice segment and all subsequent dependent slice segments that precede the next independent slice segment (if any) in the same access unit. It is a unit.
- a tile is a rectangular area of a plurality of coding tree blocks in a specific tile row and specific tile row in a picture.
- a tile may be a rectangular region of a frame intended to be independently decoded and coded, although a loop filter across the edges of the tile may still be applied.
- a block is an MxN (N rows and M columns) array of multiple samples or an MxN array of multiple transform coefficients.
- the block may be a square or rectangular area of a plurality of pixels including a plurality of matrices of one luminance and two color differences.
- a CTU may be a coding tree block of a plurality of luma samples of a picture having a three sample array or two corresponding coding tree blocks of a plurality of chrominance samples. ..
- the CTU is a multi-coded coding treeblock of either a monochrome picture or a picture coded using three separate color planes and a syntax structure used to code the multi-samples. May be
- the super block may be a square block of 64 ⁇ 64 pixels that constitutes one or two mode information blocks, or may be recursively divided into four 32 ⁇ 32 blocks and further divided.
- encoding apparatus 100 (or decoding apparatus 200) divides a picture into two or more tiles, and performs encoding (or decoding) for each tile group including one or more tiles. By doing so, the picture is encoded (or decoded).
- 47A to 47D are diagrams showing an example of a picture configuration divided into one or more tile sets based on the tile boundary according to the first mode of the first embodiment.
- 47A to 47D each of the 12 rectangular areas obtained by dividing the picture into four in the horizontal direction and three in the vertical direction is shown as one tile.
- Each tile is composed of one or more consecutive CTUs, as described above.
- the configuration of such a picture may be configured by the dividing unit 102.
- FIG. 47A shows an example in which the picture is divided into tile sets 1 having tile groups A to C.
- the tile group A shown in FIG. 47A is included in the tile set 1, and is configured by two tiles in which the basic encoding orders shown by circles 1 and 2 are continuous.
- the tile group B shown in FIG. 47A is included in the tile set 1 and is composed of seven tiles in which the basic encoding orders shown by circles 3 to 9 are continuous.
- the tile group C shown in FIG. 47A is included in the tile set 1 and is composed of three tiles in which the basic encoding orders shown by circles 10 to 12 are continuous. That is, the tile group is included in the tile set and is composed of one or more tiles in which the basic encoding order is continuous.
- the basic encoding order means the order in which tiles are scanned during encoding, and is the raster order.
- the basic encoding order of tiles means that the order in which tiles are scanned during encoding is raster order.
- FIG. 47B shows an example in which a picture is divided into a tile set 1 having a tile group A and a tile set 2 having tile groups B to D.
- the tile group A shown in FIG. 47B is included in the tile set 1, and is composed of four tiles in which the basic encoding orders shown by circles 1 to 4 are continuous.
- the tile group B shown in FIG. 47B is included in the tile set 2 and is composed of four tiles in which the basic coding orders shown by circles 5 to 8 are continuous.
- the tile groups C and D shown in FIG. 47B are included in the tile set 2 and are composed of two tiles in which the basic encoding orders shown by circles 9, 10 and circles 11 to 12 are continuous.
- FIG. 47C shows an example in which a picture is divided into a tile set 1 having tile groups A and B, a tile set 2 having tile groups C and D, and a tile set 2 having tile group E. .
- the tile group A shown in FIG. 47C is included in the tile set 1 and is composed of two tiles in which the basic coding orders indicated by circles 1 and 2 are continuous.
- the tile group B shown in FIG. 47C is included in the tile set 1 and is composed of one tile indicated by a circle 3.
- the tile group C shown in FIG. 47C is included in the tile set 2 and is composed of three tiles in which the basic encoding orders shown by circles 4 to 6 are continuous.
- the tile set 2 is composed of three tiles in which the basic coding orders indicated by circles 7 to 9 are continuous.
- the tile group E shown in FIG. 47C is included in the tile set 3 and is composed of three tiles in which the basic encoding orders shown by circles 10 to 12 are continuous.
- FIG. 47D a picture is divided into a tile set 1 having tile groups A and B, a tile set 2 having tile group C, a tile set 3 having tile groups D and E, and a tile set 4 having tile group F.
- the tile group A illustrated in FIG. 47D is included in the tile set 1, and is configured by two tiles in which the basic encoding orders indicated by circles 1 and 2 are continuous.
- the tile group B shown in FIG. 47C is included in the tile set 1 and is composed of four tiles indicated by circles 3 to 6.
- the tile group C shown in FIG. 47D is included in the tile set 2 and is composed of three tiles in which the basic encoding orders indicated by circles 7 and 8 are continuous.
- the tile group E illustrated in FIG. 47D is included in the tile set 3, and is configured by two tiles in which the basic encoding orders indicated by circles 10 and 11 are continuous.
- the tile group F shown in FIG. 47D is included in the tile set 4 and is composed of one tile indicated by a circle 12.
- one tile set may include one or more tile groups, and one tile group may include one or more tiles.
- the tile group may be referred to as a slice.
- FIG. 48A is a diagram showing an example of syntax for encoding a tile group that configures a picture when encoding the picture according to the first aspect of the first embodiment.
- FIG. 48A shows an example of syntax for encoding tile groups divided as in FIGS. 47A to 47D.
- tile groups are made into NAL units.
- NAL is an abbreviation for Network Abstraction Layer, and indicates a processing layer that appropriately divides a raw stream.
- a picture is divided into a plurality of NAL units, encapsulated, and encoded for each NAL unit.
- the encoding apparatus 100 classifies the tile groups into an independent tile group (Independent Tile Group) and a dependent tile group (Dependent Tile Group), and notifies them with syntax. Good.
- one independent tile group and zero or more dependent tile groups may form a tile group sequence.
- the independent tile group is a tile group that can be independently decoded
- the dependent tile group is a tile group that can be decoded by using the information of the independent tile group in the tile group sequence to which the tile group belongs.
- the encoding apparatus 100 may include the dependent tile group identification information (dependent_tile_group_flag or the like in the syntax example illustrated in FIG. 48A) in the tile group header. Thereby, the encoding device 100 can notify that the tile group is an independent tile group or a dependent tile group.
- dependent_tile_group_flag or the like in the syntax example illustrated in FIG. 48A
- the encoding device 100 may include tile group sequence identification information (for example, tile_group_seq_id in the syntax example shown in FIG. 48A) in the tile group header when the picture is composed of a plurality of tile groups. Thereby, the encoding device 100 can notify the tile group sequence ID to which the tile group belongs. Furthermore, the encoding device 100 may notify that the tile group sequence is composed of one independent tile group and zero or more dependent tile groups by using the tile group sequence identification information. it can.
- tile group sequence identification information for example, tile_group_seq_id in the syntax example shown in FIG. 48A
- the encoding device 100 may encode the independent tile group at the beginning of the tile group sequence.
- the encoding device 100 can reuse the header information (parameter value) of the independent tile group having the same tile group sequence identification information.
- the encoding device 100 can reuse the parameter value of the independent tile group having the same tile group sequence ID when the tile group is the dependent tile group, the notification of the parameter value of the dependent tile group is omitted. can do.
- the encoding device 100 may determine the size of each tile group according to the number of tiles included in the tile group (hereinafter referred to as the number of tiles), the tile data size, or the like.
- the encoding apparatus 100 may always include the time information (such as tile_group_pic_order_cnt_lsb in the syntax example shown in FIG. 48A) of the picture to which the tile group belongs in the tile group header. That is, the encoding apparatus 100 may always notify the time information of the picture to which the tile group belongs, regardless of whether the tile group is an independent tile group or a dependent tile group. Accordingly, the decoding device 200 can detect that the tile group of the next picture has arrived by referring to the time information of the tile group header, and thus can detect that there is a tile group that has not arrived. Therefore, the decoding device 200 may determine that an error has occurred when detecting that there is a tile group that has not arrived among the tile groups that form the current picture.
- the time information such as tile_group_pic_order_cnt_lsb in the syntax example shown in FIG. 48A
- the encoding apparatus 100 may allow the decoding apparatus 200 to easily detect data loss due to a communication error or the like even when encoding tile groups in an arbitrary order.
- FIG. 48B is a diagram showing an example of syntax regarding a tile group according to the first mode of the first embodiment.
- FIG. 48B shows an example of the syntax when the encoding device 100 encodes one or more continuous CTUs in tile units. Further, in FIG. 48B, a syntax example in which the encoding apparatus 100 repeats encoding in tile units until tile group end identification information (for example, end_of_tile_group_flag in the syntax example illustrated in FIG. 48B) becomes true. It is shown.
- tile group end identification information for example, end_of_tile_group_flag in the syntax example illustrated in FIG. 48B
- the encoding apparatus 100 determines the size of each tile group according to the number of tiles included in the tile group, the data size of the tiles included in the tile group, and the like, and determines whether the tile group end identification information is true or false. May be set.
- the tile group end identification information does not necessarily have to be CABAC encoded.
- the encoding apparatus 100 may omit 1 bit at the end of the tile (for example, end_of_tile_one_bit in the syntax example illustrated in FIG. 48B) and perform encoding.
- FIG. 49A is a diagram showing an example of a tile set forming a picture according to the first mode of the first embodiment and a basic coding order.
- FIG. 49A shows an example in which a picture is divided into a tile set 1 having tile groups A to C and a tile set 2 having tile groups DF.
- Each of the tile groups A to F is composed of two tiles.
- FIG. 49B is a diagram showing an example in which the coding order of tile groups is changed in the same tile set as in FIG. 48A. That is, as shown in FIG. 49B, the encoding apparatus 100 encodes the tile group A included in the tile set 1 and then encodes the tile group D included in the tile set 2, and the like. The two may be interleaved and encoded. As a result, when the encoding device 100 performs encoding processing in tile set units in parallel, there is a possibility that the delay time from encoding to data transmission can be shortened.
- the encoding order for interleaving tile sets and encoding tile groups shown in FIG. 49B is an example. That is, the encoding apparatus 100 may encode the tile groups in any order, or in the tile group sequence, the independent tile group sequence may always be encoded first.
- the encoding apparatus 100 may also change the encoding order by a tile group sequence or a tile set unit. Then, in this case, the encoding apparatus 100 may omit encoding the tile group sequence identification information.
- FIG. 50A is a flowchart showing a tile group decoding process performed by the decoding device 200 according to the first mode of the first embodiment.
- the decoding device 200 acquires a tile group header of a bitstream encoded in tile group units, and analyzes information of the acquired tile group header (S10).
- the decoding device 200 determines whether or not the tile group to be decoded is the dependent tile group based on the information analysis result in step S10 (S11).
- the decoding device 200 analyzes whether or not the tile group is a dependent tile group by analyzing the dependent tile group identification information (for example, the syntax such as dependent_tile_group_flag shown in FIG. 48A) included in the tile group header. Can be determined.
- the dependent tile group identification information for example, the syntax such as dependent_tile_group_flag shown in FIG. 48A
- step S11 if the tile group to be decoded is not the dependent tile group (independent in step S11), the decoding device 200 stores the analyzed tile group header information in a predetermined memory area (S12).
- the decoding device 200 determines the information of the analyzed tile group header according to the tile group sequence identification information (for example, the syntax such as tile_group_seq_id shown in FIG. 48A). Stored in the determined memory area.
- step S11 when the tile group to be decoded is the dependent tile group (dependent in step S11), the decoding device 200 acquires the tile group header information from a predetermined memory area (S13).
- the decoding device 200 acquires the tile group header information from the memory area determined according to the tile group sequence identification information.
- the information of the acquired tile group header is the information of the tile group header of the independent tile group in the tile group sequence to which the dependent tile group to be decoded belongs, and is determined according to the tile group sequence identification information and stored in a predetermined memory area. Has been done. As a result, the information in the tile group header of the independent tile group is reused.
- the decoding device 200 performs a decoding process for all tiles included in the tile group using the analyzed or acquired information of the tile group header (S14).
- FIG. 50B is a flowchart showing an example of an error detection process and a concealment process in the tile group decoding process performed by the decoding device 200 according to the first mode of the first embodiment.
- the decoding device 200 acquires the tile group header of the bit stream encoded in tile group units, and analyzes the information of the acquired tile group header (S20). In this aspect, the decoding device 200 analyzes the time information of the tile group header (for example, the syntax such as tile_group_pic_order_cnt_lsb shown in FIG. 48A).
- the decoding device 200 determines whether or not the time of the picture to which the decoding target tile group belongs has advanced based on the information analysis result in step S20 (S21). In this aspect, the decoding apparatus 200 determines whether or not the time (for example, time T) of the picture to which the tile group to be decoded belongs has advanced by checking the time information of the tile group header.
- the decoding device 200 determines whether or not there is an unreceived tile group (S22). In this aspect, the decoding device 200 determines whether there is an unreceived tile group in the picture at the previous time (time T) when the time of the picture to which the decoding target tile group belongs is, for example, time T+1. Determine whether or not.
- the decoding apparatus 200 performs error concealment processing for the unreceived tile group (S23).
- the decoding device 200 determines that an error has occurred in the unreceived tile group such as a communication error when there is an unreceived tile group in the picture at the previous time (time T), and the unreceived tile group is not received. Perform error concealment processing for tile groups.
- the decoding device 200 performs decoding processing of all tiles included in the tile group based on the analyzed information of the tile group header (S24).
- the processing may be switched according to the content indicated by the dependent tile group identification information included in the tile group header. Since the processing when switching the processing has been described with reference to FIG. 50A, description thereof will be omitted here.
- step S21 if the time of the picture has not advanced (No in step S21), and if there is no unreceived tile group in step S22 (No in S22), the loop is started and step S24 is executed. do it.
- the tile extraction information SEI is an abbreviation for Supplemental Enhancement Information and is a NAL unit that provides useful information although it is not necessary for encoding.
- the tile extraction information SEI is also information for extracting and processing a part of the encoded tiles. Further, the tile extraction information SEI may be coded before or after the tile set, tile group sequence or tile group.
- the tile to be extracted is, for example, a tile that configures a partial area of the picture when the partial area of the picture is decoded instead of decoding the entire picture.
- the extraction target tile is a tile that constitutes a break of division when a picture is divided for parallel processing when the decoding of the picture is performed in parallel.
- FIG. 51A is a diagram showing an example of a case where the tile extraction information SEI according to the first mode of the first embodiment is encoded after a picture.
- FIG. 51B is a diagram showing an example of a case where the tile extraction information SEI according to the first example of the first embodiment is encoded before a picture.
- the encoding device 100 encodes the tile extraction information SEI after the picture, as in the example shown in FIG. 51A.
- the encoding apparatus 100 can encode the tile extraction information SEI after encoding the tile group data, and thus can transmit or store the tile group data as soon as the tile group data is encoded.
- the encoding apparatus 100 may be able to reduce the memory amount for temporarily holding the tile group data.
- the encoding device 100 encodes the tile extraction information SEI before the picture, as in the example shown in FIG. 51B.
- the decoding device 200 can acquire the tile extraction information SEI before analyzing the tile group data.
- the encoding apparatus 100 may be able to simplify the procedure for extracting desired tile data performed by the decoding apparatus 200.
- the encoding device 100 moves the above tile extraction information SEI from the back to the front of the corresponding tile group data and then performs the multiplexing when performing the system multiplexing processing by MPEG-2 TS, MMT, MP4, or the like. You may perform a conversion process.
- FIG. 52 is a diagram showing an example of syntax for encoding the tile extraction information SEI according to the first mode of the first embodiment.
- the encoding apparatus 100 may encode the number of tiles included in the tile group and the leading byte position information indicating the leading byte position of the tile data that is the extraction unit in the tile extraction information SEI as syntax. Good.
- the syntax indicating the number of tiles included in the tile group is num_tiles_in_tile_group_minus1[i] or the like.
- the syntax indicating the leading byte position information is entry_point_offset_minus1[i][j].
- the encoding device 100 can notify the number of tiles included in the tile group and the byte position at the beginning of the tile data that is the extraction unit by encoding the tile extraction information SEI.
- the encoding apparatus 100 may further include the syntax indicating the bit precision of the tile that is the extraction unit (such as offset_len_minus1 in the example shown in FIG. 52) in the tile extraction information SEI for encoding. With this, the encoding apparatus 100 can further notify the bit precision of the tile that is the extraction unit.
- the encoding apparatus 100 encodes the number of tiles included in the tile group and the leading byte position information indicating the leading byte position of the tile data, which is the extraction unit, in the tile extraction information SEI as syntax. May be.
- the encoding device 100 may include information indicating the number of tile groups associated with the tile extraction information SEI as syntax in the tile extraction information SEI to encode the tile extraction information SEI. Also, the encoding apparatus 100 may associate all tile groups included in a picture, a tile set, or a tile group sequence with a plurality of tile groups, or may individually associate each tile group. In this case, the encoding apparatus 100 may include the syntax indicating the associated content in the tile extraction information SEI for encoding.
- the encoding device 100 may include the information indicating the rearrangement of tile group data in the tile extraction information SEI for encoding.
- the information indicating the rearrangement of tile group data includes, for example, the basic encoding order.
- the encoding device 100 encodes the tile extraction information SEI by including information including information indicating a data rearrangement unit (tile set, tile group sequence, etc.) in addition to the presence or absence of rearrangement of tile group data. Good.
- the syntax indicating the rearrangement of tile group data is arbitrary_tile_group_order_flag or the like.
- the encoding apparatus 100 may include the tile group sequence identification information, the tile address information of the first tile of the tile group, and the dependent tile group identification information in the tile extraction information SEI for encoding.
- the syntax indicating the tile group sequence identification information is, for example, tile_group_seq_id[i].
- the syntax indicating the tile address information of the first tile of the tile group is tile_group_address[i].
- the syntax indicating the dependent tile group identification information is dependent_tile_group_flag[i] or the like. Accordingly, the encoding device 100 can notify the tile group sequence identification information, the tile address information of the first tile of the tile group, and the dependent tile group identification information by encoding the tile extraction information SEI.
- the encoding device 100 may use the information on the head byte position and the number of bytes of the tile included in the tile group as the information on the byte position and the number of bytes in the payload part including the emulation prevention byte of the VCL NAL unit. Furthermore, the encoding device 100 may use the head byte position of each tile group header as a byte position reference.
- the encoding device 100 encodes a plurality of tile extraction information SEI that specifies only one tile group, as many as the number of tile groups, instead of specifying a plurality of tile groups with one tile extraction information SEI. Good.
- the encoding device 100 notifies the tile group sequence identification information using the tile group header.
- the decoding device 200 may be able to correctly acquire the information of the tile group header of the dependent tile group even when the encoding device 100 has changed the encoding order of the tile groups and encoded the picture. ..
- the encoding device 100 notifies the time information of the picture in the tile group header by always including the time information of the picture to which the tile group belongs in the tile group header.
- the decoding device 200 may be able to easily detect the loss of tile group data due to packet loss or the like, even if the coding order of the tile groups has been changed by the coding device 100.
- the decoding device 200 may be able to acquire the tile extraction information SEI before analyzing the tile group data, and thus the extraction procedure of desired tile data may be simplified. Further, according to the first aspect, the encoding device 100 may encode the tile extraction information SEI after encoding the tile group data. As a result, the encoding apparatus 100 can transmit or store the tile group data as soon as the tile group data is encoded, and it is possible that the memory amount for temporarily holding the tile group data can be reduced. is there.
- this aspect may be implemented in combination with at least a part of other aspects in the present disclosure. Moreover, you may implement a part of process described in the flowchart of this aspect, a part of structure of the apparatus of this aspect, a part of syntax of this aspect, etc. in combination with another aspect.
- the tile group decoding process in the decoding device 200 may be similarly performed in the tile group coding process in the encoding device 100.
- the decoding device 200 is not limited to the case of performing the decoding process of the dependent tile group by using the information of the tile group header.
- the decoding device 200 uses the decoded independent tile group having the same tile group sequence identification information as the tile group to be decoded, the reconstructed image of the decoded dependent tile group, or the parameter to perform the decoding processing of the dependent tile group.
- the parameter is, for example, at least one parameter of information or index about motion vector, inter prediction mode, reference picture list, reference picture index, intra prediction mode, quantization parameter, and internal parameter of arithmetic coding.
- the decoding processing of the dependent tile group includes at least one processing of inter prediction, intra prediction, inverse quantization, arithmetic decoding, filter processing, and the like.
- FIG. 53 is a diagram showing an example of a syntax for encoding tiles forming a picture when encoding a picture according to the second mode of the first embodiment.
- FIG. 53 shows an example of syntax for encoding tiles divided as in FIGS. 47A to 47D.
- NAL units are formed in tile units.
- the encoding apparatus 100 classifies the tiles into independent tiles (Independent Tile) and dependent tiles (Dependent Tile) and notifies them with syntax. Good.
- the independent tile is a tile that is independently decodable
- the dependent tile is a tile that is decodable using the information of the independent tile in the tile group to which it belongs.
- the encoding apparatus 100 may include the dependent tile identification information (dependent_tile_flag or the like in the syntax example shown in FIG. 53) in the tile header. Accordingly, the encoding device 100 can notify that the tile is an independent tile or a dependent tile.
- the encoding device 100 may include tile group identification information (for example, tile_group_id in the syntax example shown in FIG. 53) in the tile header when the tile group is composed of a plurality of tiles. Accordingly, the encoding device 100 can notify the tile group ID to which the tile belongs. Furthermore, the encoding device 100 can notify that the tile group is composed of one independent tile and zero or more dependent tiles by using the tile group identification information.
- tile group identification information for example, tile_group_id in the syntax example shown in FIG. 53
- the encoding device 100 may encode the independent tiles at the head of the tile group. Accordingly, the encoding apparatus 100 can cause the decoding apparatus 200 to reuse the header information (parameter value) of the independent tile having the same tile group identification information when decoding the dependent tile. Furthermore, since the encoding device 100 can reuse the parameter value of the independent tile having the same tile group ID when the tile is a dependent tile, the notification of the parameter value of the dependent tile can be omitted.
- the encoding apparatus 100 may always include the time information of the picture to which the tile belongs (such as tile_pic_order_cnt_lsb in the syntax example shown in FIG. 53) in the tile header. That is, the encoding apparatus 100 may always notify the time information of the picture to which the tile belongs, regardless of whether the tile is an independent tile or a dependent tile. Accordingly, the decoding device 200 can detect that the tile of the next picture has arrived by referring to the time information of the tile header, and thus can detect that there is a tile that has not arrived. The decoding device 200 may determine that an error has occurred when detecting that there is a tile that has not arrived among the tiles that form the current picture.
- the time information of the picture to which the tile belongs such as tile_pic_order_cnt_lsb in the syntax example shown in FIG. 53
- the encoding apparatus 100 may allow the decoding apparatus 200 to easily detect data loss due to a communication error or the like even when encoding tiles in an arbitrary order.
- FIG. 54A is a diagram showing an example of a tile set forming a picture according to the second mode of the first embodiment and a basic coding order.
- 54A is the same diagram as FIG. 49A and is the same as that described with reference to FIG. 49A. Therefore, description of FIG. 54A will be omitted, but circles 1 to 12 shown in FIG. 54A indicate the encoding order. ..
- FIG. 54B is a diagram showing an example in which the tile encoding order is changed in the tile set configured with the same tile group as in FIG. 54A. Circles 1 to 12 shown in FIG. 54B represent encoding orders.
- the encoding apparatus 100 encodes the tile indicated by circle 1 included in the tile group A of the tile set 1, and then encodes the tile indicated by circle 2 included in the tile group D of the tile set 2, After that, the tile indicated by circle 3 included in the tile group A of the tile set 1 is encoded. That is, the encoding apparatus 100 may interleave and encode between the tile sets 1 and 2 as shown in FIG. 54B. As a result, when the encoding device 100 performs encoding processing in tile set units in parallel, there is a possibility that the delay time from encoding to data transmission can be shortened.
- the encoding order for interleaving tile sets and encoding tiles shown in FIG. 54B is an example. That is, the encoding apparatus 100 may encode the tiles in any order, or may encode the tiles in an order in which the independent tile is always the first in the tile group.
- the encoding apparatus 100 may also change the encoding order in units of tile groups or tile sets. Then, in this case, the encoding device 100 may omit encoding the tile group identification information.
- FIG. 55A is a flowchart showing tile decoding processing performed by the decoding device 200 according to the second mode of the first embodiment.
- the decoding device 200 acquires a tile header of a bitstream coded in tile units, and analyzes information of the acquired tile header (S30).
- the decoding apparatus 200 determines whether the tile to be decoded is a dependent tile based on the information analysis result in step S30 (S31).
- the decoding device 200 determines whether the tile to be decoded is a dependent tile by analyzing the dependent tile identification information (for example, the syntax such as dependent_tile_flag shown in FIG. 53) included in the tile header. can do.
- the decoding device 200 stores the analyzed tile header information in a predetermined memory area (S32).
- the decoding device 200 determines the memory of the analyzed tile header information according to the tile group identification information (for example, the syntax such as tile_group_id shown in FIG. 53) when the decoding target tile is an independent tile. Store in area.
- the decoding device 200 acquires the tile header information from a predetermined memory area (S33).
- the decoding device 200 acquires the tile header information from the memory area determined according to the tile group identification information.
- the acquired tile header information is the tile header information of the independent tile in the tile group to which the dependent tile to be decoded belongs, and is determined according to the tile group identification information and stored in a predetermined memory area. As a result, the information of the tile header of the independent tile is reused.
- the decoding device 200 uses the information of the tile header analyzed or acquired to perform the decoding process of the tile to be decoded (S34).
- FIG. 55B is a flowchart showing an example of an error detection process and a concealment process in the tile decoding process performed by the decoding device 200 according to the second mode of the first embodiment.
- the decoding device 200 acquires the tile header of the bitstream encoded in tile units, and analyzes the information of the acquired tile header (S40). In this aspect, the decoding device 200 analyzes the time information of the tile header (for example, the syntax such as tile_pic_order_cnt_lsb shown in FIG. 53).
- the decoding device 200 determines whether or not the time of the picture to which the decoding target tile belongs has advanced based on the information analysis result in step S40 (S41). In this aspect, the decoding device 200 determines whether or not the time (for example, time T) of the picture to which the decoding target tile belongs has advanced by checking the time information of the tile header.
- the decoding device 200 determines whether or not there is an unreceived tile (S42). In this aspect, the decoding device 200 determines whether or not there is an unreceived tile in the picture at the previous time (time T) when the time of the picture to which the decoding target tile belongs is, for example, time T+1. To judge.
- the decoding apparatus 200 performs error concealment processing on the unreceived tile (S43).
- the decoding device 200 determines that an error has occurred in the unreceived tile such as a communication error when there is an unreceived tile in the picture at the previous time (time T), and regarding the unreceived tile. Perform error concealment processing.
- the decoding device 200 performs the decoding process of the tile to be decoded based on the analyzed tile header information (S44).
- the processing may be switched according to the content indicated by the dependent tile identification information included in the tile header. Since the processing when switching the processing has been described with reference to FIG. 55A, description thereof will be omitted here.
- step S41 If the time of the picture has not advanced in step S41 (No in step S41) and if there is no unreceived tile in step S42 (No in S42), the process proceeds to step S44 to execute the process. Good.
- tile extraction information SEI may be coded before or after the tile set or tile group.
- FIG. 56A is a diagram showing an example of a case where the tile extraction information SEI according to the second mode of the first embodiment is encoded after a picture.
- FIG. 56B is a diagram showing an example of a case where the tile extraction information SEI according to the second mode of the first embodiment is encoded before a picture.
- the encoding device 100 encodes the tile extraction information SEI after the picture, as in the example shown in FIG. 56A.
- the tile data can be transmitted or accumulated as soon as the tile data is encoded.
- the encoding apparatus 100 may be able to reduce the amount of memory for temporarily holding tile data.
- the encoding device 100 encodes the tile extraction information SEI before the picture, as in the example shown in FIG. 56B.
- the decoding device 200 can acquire the tile extraction information SEI before analyzing the tile data.
- the encoding apparatus 100 may be able to simplify the procedure for extracting desired tile data performed by the decoding apparatus 200.
- the encoding device 100 moves the tile extraction information SEI described above from the back to the front of the corresponding tile data before performing the system multiplexing processing with MPEG-2 TS, MMT, MP4, etc. Processing may be performed.
- FIG. 57 is a diagram showing an example of a syntax for encoding the tile extraction information SEI according to the second mode of the first embodiment.
- the encoding apparatus 100 uses, as syntax, tile extraction information in which the number of tile groups associated with the tile extraction information SEI, information regarding rearrangement of tile data, tile group identification information, and tile address information indicating the address of the first tile of the tile group is used as syntax. It may be encoded by being included in SEI. Further, the encoding apparatus 100 may include the information indicating the number of tiles included in the tile group in the tile extraction information SEI as the syntax and perform the encoding.
- the syntax indicating the number of tile groups is num_tile_groups_minus1[i] shown in FIG.
- the information regarding the rearrangement of data includes information indicating whether tile data is rearranged, information indicating a rearrangement unit of data (tile set, tile group, etc.).
- the syntax indicating whether tile data is rearranged is arbitrary_tile_order_flag or the like.
- the syntax indicating the tile group identification information is tile_group_id[i] or the like.
- the syntax indicating the tile address information is tile_group_address[i] or the like.
- the syntax indicating the number of tiles included in the tile group is num_tiles_in_tile_group_minus1[i].
- the encoding device 100 encodes the tile extraction information SEI to obtain the number of tile groups, information about rearrangement of tile data, tile group identification information, tile address information, and tiles included in tile groups. You can notify the number.
- the encoding apparatus 100 can encode the information regarding the tile group to which each tile in the picture belongs by using the tile extraction information SEI, and thus is required when the decoding apparatus 200 decodes a desired tile. There is a possibility that the extraction of various data can be simplified.
- the encoding apparatus 100 may associate all tile groups included in a picture, a tile set, or a tile group sequence with a plurality of tile groups, or may associate each tile group individually.
- the encoding apparatus 100 may include the syntax indicating the associated content in the tile extraction information SEI for encoding.
- the encoding device 100 notifies the tile group identification information by the tile header.
- the decoding device 200 may be able to correctly acquire the tile header information of the dependent tile even when the encoding order of the tiles has been changed by the encoding device 100 and the picture has been encoded.
- the encoding device 100 always notifies the time information of the picture in the tile header by including the time information of the picture to which the tile belongs in the tile header.
- the decoding apparatus 200 may be able to easily detect the loss of tile data due to packet loss or the like even when the encoding order of the tiles has been changed by the encoding apparatus 100 and the picture has been encoded. ..
- the decoding device 200 may be able to acquire the tile extraction information SEI before analyzing the tile data, and thus the extraction procedure of desired tile data may be simplified.
- the encoding device 100 may encode the tile extraction information SEI after encoding the tile data. With this, the encoding device 100 can transmit or store the tile data as soon as the tile data is encoded. Therefore, the memory amount for temporarily holding the tile data may be reduced.
- this aspect may be implemented in combination with at least a part of other aspects in the present disclosure. Moreover, you may implement a part of process described in the flowchart of this aspect, a part of structure of the apparatus of this aspect, a part of syntax of this aspect, etc. in combination with another aspect.
- the tile decoding process in the decoding device 200 may be similarly performed in the tile coding process in the encoding device 100.
- the unit of tiles included in a picture is not limited to the tile set, tile group, and tile as defined in this disclosure.
- a picture only needs to include at least one or more tiles, and either the tile set or the tile group may not be defined.
- the picture may include at least an area A (for example, a tile or a tile group) including one or more CTUs and an area B (for example, a tile group or a tile set) including one or more areas A.
- one or more areas A that can be continuously scanned in the first order (for example, raster order) may be defined as the area B.
- tile extraction information SEI is coded in picture units
- present invention is not limited to this.
- the tile extraction information SEI may be encoded in sequence units.
- the encoding device 100 may switch the tile extraction information for identifying the tile group of the extraction target and the tile extraction information for identifying the tile of the extraction target in units of pictures to perform encoding.
- the decoding device 200 is not limited to the case where the decoding process of the dependent tile is performed using the information of the tile header.
- the decoding device 200 may perform the decoding process of the dependent tile using the decoded independent tile having the same tile group identification information as the decoding target tile, the reconstructed image of the decoded dependent tile, or the parameter.
- the parameter is, for example, at least one parameter of information or index about motion vector, inter prediction mode, reference picture list, reference picture index, intra prediction mode, quantization parameter, and internal parameter of arithmetic coding.
- the decoding processing of the dependent tile includes at least one processing of inter prediction, intra prediction, inverse quantization, arithmetic decoding, filter processing, and the like.
- the tile that divides the picture may be able to be further divided.
- the encoding device 100 (or the decoding device 200) divides a picture into two or more tiles and has a rectangular shape configured by a part of the divided tiles or one or more tiles. A case where encoding (or decoding) is performed for each slice will be described.
- 58A and 58B are diagrams showing an example of the configuration of a picture when a picture according to the third aspect of the first embodiment is divided into rectangular areas and encoded.
- FIG. 58A an example is shown in which a picture is divided into 12 rectangular areas that are horizontally divided into 4 and vertically divided into 3.
- the rectangular areas indicated by circles 1 to 12 may be tiles or bricks. That is, the picture may be divided into tiles indicated by circles 1 to 12, and the divided tiles may be further divided into one brick.
- the brick is a unit for dividing the tile, and is a unit for dividing the tile into one or more rectangular areas.
- a tile or brick is composed of one or more consecutive CTUs. The configuration of such a picture may be configured by the dividing unit 102.
- the numbers from circle 1 to circle 12 indicate the order in which the encoding apparatus 100 encodes tiles or bricks.
- FIG. 58B shows an example in which the picture is divided into six rectangular areas. More specifically, in FIG. 58B, the picture is first divided into three tiles (three rectangular areas surrounded by thick frames), and each of the three tiles is further divided into one or more bricks (enclosed by thin frames). The example is divided into one or more rectangular areas). The tile on the left side is divided into two bricks indicated by circles 1 and 2, and the tile in the center is divided into three bricks indicated by circles 3 to 6. The tile on the right may be divided into one brick, indicated by circle 6, or may remain tiles. The configuration of such a picture may be configured by the dividing unit 102. The numbers from circle 1 to circle 6 indicate the order in which the encoding apparatus 100 encodes tiles or bricks.
- bricks can compose slices like tiles. That is, one or more tiles or one or more bricks can form one slice and are collectively coded as one slice.
- raster scan slice mode Raster Scan Slice Mode
- rectangular slice mode Rectangular Slice Mode
- raster scan slice mode tiles or bricks are scanned in raster order and organized into slices.
- rectangular slice mode tiles or bricks are grouped into slices so that all the slices have a rectangular shape.
- FIG. 58A shows an example in which slices are set in the raster scan slice mode. That is, in FIG. 58A, tiles (or bricks) of circles 1 and 2 are combined in slice A, and tiles (or bricks) of circles 3 to 9 are combined in slice B. Then, tiles (or bricks) of circles 10 to 12 are collected in slice C.
- FIG. 58B shows an example in which slices are set in the rectangular slice mode. That is, in FIG. 58B, the brick of circle 1 is collected in the slice A, and the brick of circle 2 is collected in the slice B. Further, the bricks of circles 3 and 4 are combined in slice C, and the bricks of circle 5 are combined in slice D. Then, the tiles (or bricks) of circle 6 are collected in slice E.
- FIG. 59 is a diagram showing an example of a syntax of a picture parameter set (PPS) for dividing and encoding a picture when encoding the picture according to the third aspect of the first embodiment.
- FIG. 59 shows an example of the syntax of PPS for dividing and encoding a picture as shown in FIG. 58A or 58B.
- PPS is an abbreviation for Picture Parameter Set, and is header information in which information related to coding of the entire picture is written.
- the encoding apparatus 100 may notify the information about the picture dividing method and the information about the slice setting method. More specifically, the encoding apparatus 100 includes information regarding whether or not the target picture is configured with a single tile (such as single_tile_in_pic_flag in the syntax example illustrated in FIG. 59) in the PPS. Then, when the picture is composed of a plurality of tiles, the encoding apparatus 100 includes information about a picture division method by tiles or bricks and information about a slice setting method in the PPS. With this, the encoding apparatus 100 notifies the information about the method of dividing a picture by tiles or bricks and the information about the method of setting slices according to the information about whether or not the target picture is composed of a single tile. be able to.
- the encoding apparatus 100 includes information regarding whether or not the target picture is configured with a single tile (such as single_tile_in_pic_flag in the syntax example illustrated in FIG. 59) in the PPS. Then, when the picture is composed of a plurality of
- the encoding apparatus 100 includes the syntax indicating the slice mode information in the PPS to notify whether the slice setting method in the target picture is the rectangular slice mode or the raster scan slice mode. be able to.
- the encoding device 100 further provides information that specifies the region included in each slice, based on at least one of the information indicating whether the number of bricks in a slice is always one and the information about the slice mode. You may switch whether to include and notify in PPS.
- the encoding apparatus 100 may not include the information regarding the slice mode in the PPS. In this case, since the information regarding the slice mode is not notified, the decoding device 200 may consider that the function information is always 1 in the slice mode and the slice setting method in the target picture is the rectangular slice mode.
- the encoding apparatus 100 When the slice setting method in the target picture is the rectangular slice mode, the encoding apparatus 100 notifies the PPS of the information specifying the rectangular area included in each slice as information about the slice setting method. You can
- the information specifying the rectangular area included in each slice includes information about the number of slices in the picture and position information of the upper left corner and the lower right corner of each slice.
- the syntax indicating the number of slices in a picture is num_slices_in_pic_minus1 or the like.
- the syntax indicating the positions of the upper left corner and the lower right corner of each slice is top_left_brick_idx, bottom_right_brick_idx_delta, etc., as shown in FIG. That is, the position of the upper left corner may be indicated by the brick index, and the position of the lower right corner may be indicated by the brick index or its difference value.
- the encoding apparatus 100 includes the information for identifying the rectangular area included in each slice in the PPS as syntax, thereby determining the number of slices in the picture and the positions of the upper left corner and the lower right corner of each slice. Can be notified.
- the encoding device 100 when the slice setting method in the target picture is the rectangular slice mode, the upper left corner position information of the first slice of the picture and the upper left corner and lower right corner positions of the last slice of the picture. Information may be omitted (not necessarily included in PPS). In this case, the decoding device 200 may set the value by a predetermined method. The details will be described below.
- the decoding device 200 may set the position of the upper left corner of the first slice of the picture to 0 (zero). Also, the decoding device 200 may set the position of the upper left corner of the last slice of the picture as follows. The last slice corresponds to an area where a slice based on information about a slice setting method included in the same PPS is not set. Therefore, the decoding apparatus 200 may set the smallest brick index among the brick indexes occupying the unset area at the upper left corner of the last slice of the picture.
- the decoding device 200 may set an offset value or the like of the position of the upper left corner of the last slice of the picture for the position of the lower right corner of the last slice of the picture.
- the decoding device 200 may set the position of the lower right corner of the last slice of the picture to NumBricksInPic-1-top_left_brick_idx[num_slices_in_pic_minus1].
- the number of bricks in the picture is NumBricksInPic.
- the position of the upper left corner of the last slice of the picture is set to top_left_brick_idx[num_slices_in_pic_minus1].
- the encoding apparatus 100 when the setting method of slices in the target picture is the rectangular slice mode, specifies the rectangular area included in each slice, such as the positional information of the upper left corner and the lower right corner of each slice. Is included in the PPS to notify. However, the encoding apparatus 100 may omit the notification regarding the position information of the upper left corner of the first slice of the picture and the position information of the upper left corner and the lower right corner of the last slice of the picture.
- FIG. 60 is a flowchart showing an example of rectangular slice setting processing in the rectangular slice mode performed by the decoding device 200 according to the third aspect of the first embodiment.
- the decoding device 200 when the decoding device 200 performs the decoding process in the rectangular slice mode, the rectangular area included in each slice is specified as the rectangular slice setting process by referring to the information about the slice setting method notified by the PPS. The processing to be performed is shown.
- the decoding device 200 acquires a picture parameter set (PPS) of a bitstream and analyzes the acquired PPS (S51).
- PPS picture parameter set
- the decoding device 200 sets a loop count that is one less than the number of slices in a picture (S52).
- the decoding device 200 analyzes the PPS and confirms information regarding the number of slices in a picture.
- the decoding device 200 can confirm the information about the number of slices in a picture by analyzing the syntax such as num_slices_in_pic_minus1 included in the PPS.
- the decoding device 200 executes the loop process only once less than the set number of times, that is, the number of slices in the picture.
- the decoding device 200 determines whether or not the decoding target slice is the first slice of the picture (S53).
- the decoding device 200 sets the value notified by the PPS as the position information of the upper left corner of the slice to be decoded (S54).
- the decoding device 200 may set the brick index included in the PPS as the position information of the upper left corner of the slice to be decoded, and may set the brick index or the difference value thereof as the position information of the lower right corner.
- the decoding device 200 may set the position information of the upper left corner and the position information of the lower right corner of each slice to top_left_brick_idx and bottom_right_brick_idx_delta shown in FIG. Accordingly, the decoding device 200 can specify the rectangular area included in each slice.
- the decoding device 200 sets the position information of the upper left corner of the slice to be decoded by the first predetermined method (S55).
- the PPS does not notify the position information of the upper left corner of the first slice of the picture. Therefore, the decoding apparatus 200 may set the position information of the upper left corner of the first slice of the picture, for example, information indicating the upper left corner of the picture such as 0 (zero).
- the decoding device 200 sets the position information of the upper left corner of the slice to be decoded by the second predetermined method (S56). Since the loop processing has been completed, the slice to be decoded here is the last slice of the picture. Further, the position information of the upper left corner of the last slice of the picture is not notified by PPS. Therefore, the decoding apparatus 200 may set the position information of the upper left corner of the slice to be decoded to the smallest brick index in the region where the slice is not set by the information about the slice setting method included in the PPS. .. For example, the decoding apparatus 200 may set the position information of the upper left corner of the last slice of the picture to top_left_brick_idx[num_slices_in_pic_minus1] shown in FIG.
- the decoding apparatus 200 sets the position information of the lower right corner of the slice to be decoded by the third predetermined method (S57).
- the decoding apparatus 200 may set the offset value of the position of the upper left corner as the position information of the lower right corner of the last slice of the picture to be decoded.
- the decoding apparatus 200 may set, for example, NumBricksInPic-1-top_left_brick_idx[num_slices_in_pic_minus1] in the position information of the lower right corner of the last slice of the picture.
- the number of bricks in the picture is NumBricksInPic.
- the position of the upper left corner of the last slice of the picture is set to top_left_brick_idx[num_slices_in_pic_minus1].
- the encoding apparatus 100 can omit the picture parameter set without including part of the information on the slice setting method, and thus the encoding amount may be reduced.
- this aspect may be implemented in combination with at least a part of other aspects in the present disclosure. Moreover, you may implement a part of process described in the flowchart of this aspect, a part of structure of the apparatus of this aspect, a part of syntax of this aspect, etc. in combination with another aspect.
- the rectangular slice setting process in the decoding device 200 may be similarly performed in the rectangular slice setting process in the encoding device 100.
- FIG. 61 is a diagram showing an example of the syntax of a picture parameter set (PPS) for dividing and encoding a picture when encoding the picture according to the fourth aspect of the first embodiment.
- FIG. 61 shows an example of the syntax of PPS for dividing and encoding a picture as shown in FIG. 58A or 58B.
- PPS picture parameter set
- the encoding apparatus 100 may notify the information about the picture dividing method and the information about the slice setting method. More specifically, the encoding apparatus 100 includes information (for example, single_tile_in_pic_flag in the syntax example illustrated in FIG. 61) regarding whether or not the target picture is configured with a single tile in the PPS. Then, when the picture is composed of a plurality of tiles, the encoding apparatus 100 includes information about a picture division method by tiles or bricks and information about a slice setting method in the PPS. With this, the encoding apparatus 100 notifies the information about the method of dividing a picture by tiles or bricks and the information about the method of setting slices according to the information about whether or not the target picture is composed of a single tile. be able to.
- the encoding apparatus 100 includes information (for example, single_tile_in_pic_flag in the syntax example illustrated in FIG. 61) regarding whether or not the target picture is configured with a single tile in the PPS. Then, when the picture is composed of a pluralit
- Information regarding the slice setting method includes, for example, information indicating whether the number of bricks in the slice is always one and information regarding the slice mode.
- the syntax indicating whether the number of bricks in the slice is always one is single_brick_per_slice_flag or the like.
- the syntax indicating information about the slice mode is rect_slice_flag or the like.
- the encoding device 100 further provides information for identifying the area included in each slice, based on at least one of the information indicating whether the number of bricks in a slice is always one and the information about the slice mode. You may switch whether to include and notify in PPS.
- the encoding apparatus 100 may not include the information regarding the slice mode in the PPS. In this case, since the information regarding the slice mode is not notified, the decoding device 200 may consider that the function information is always 1 in the slice mode and the slice setting method in the target picture is the rectangular slice mode.
- the encoding device 100 When the slice setting method in the target picture is the rectangular slice mode, the encoding device 100 notifies the PPS of the information specifying the rectangular area included in each slice as the information regarding the slice setting method. You can
- the information for specifying the rectangular area included in each slice includes information about the number of slices in the picture and position information of the upper left corner and the lower right corner of each slice.
- the syntax indicating the number of slices in a picture is num_slices_in_pic_minus1 or the like.
- the syntax indicating the positions of the upper left corner and the lower right corner of each slice is top_left_brick_idx, bottom_right_brick_idx_delta, etc., as shown in FIG.
- the position of the upper left corner may be indicated by the brick index
- the position of the lower right corner may be indicated by the brick index or its difference value.
- the encoding apparatus 100 includes the information for identifying the rectangular area included in each slice in the PPS as syntax, thereby determining the number of slices in the picture and the positions of the upper left corner and the lower right corner of each slice. Can be notified.
- the encoding device 100 when the slice setting method in the target picture is the rectangular slice mode, outputs the position information of the upper left corner of the first slice of the picture and the position information of the lower right corner of the last slice of the picture. It may be omitted (not necessarily included in the PPS). In this case, the decoding device 200 may set the value by a predetermined method.
- the decoding device 200 may set the position of the upper left corner of the first slice of the picture to 0 (zero). Further, the decoding device 200 may set an offset value or the like of the position of the upper left corner of the last slice of the picture for the position of the lower right corner of the last slice of the picture. For example, the decoding device 200 may set the position of the lower right corner of the last slice of the picture to NumBricksInPic-1-top_left_brick_idx[num_slices_in_pic_minus1]. Here, the number of bricks in the picture is NumBricksInPic. In addition, the position of the upper left corner of the last slice of the picture is set to top_left_brick_idx[num_slices_in_pic_minus1].
- the encoding device 100 specifies the rectangular area included in each slice, such as the positional information of the upper left corner and the lower right corner of each slice. Notify by including the information in the PPS. However, the encoding apparatus 100 may omit the notification regarding the position information of the upper left corner of the first slice of the picture and the position information of the lower right corner of the last slice of the picture.
- FIG. 62 is a flowchart showing an example of a rectangular slice setting process in the rectangular slice mode performed by the decoding device 200 according to the fourth mode of the first embodiment.
- the rectangular area setting process specifies the rectangular area included in each slice while referring to the information about the slice setting method notified by the PPS. ..
- the decoding device 200 acquires a picture parameter set (PPS) of a bitstream and analyzes the acquired PPS (S61).
- PPS picture parameter set
- the decoding device 200 sets the number of loops according to the number of slices in the picture (S62).
- the decoding device 200 analyzes the PPS and confirms information regarding the number of slices in a picture.
- the decoding device 200 can confirm the information regarding the number of slices in a picture by analyzing the syntax such as num_slices_in_pic_minus1 included in the PPS. Then, the decoding device 200 sets the number of times of subsequent loop processing according to the number of slices in the confirmed picture.
- the decoding device 200 executes the loop process for the set number of loops, that is, the number of slices in the picture.
- the decoding device 200 determines whether the slice to be decoded is the first slice of the picture (S63).
- the decoding apparatus 200 sets the value notified by the PPS as the position information of the upper left corner of the slice to be decoded (S64).
- the decoding device 200 may set the brick index included in the PPS as the position information of the upper left corner of the slice to be decoded, and may set the brick index or the difference value thereof as the position information of the lower right corner.
- the decoding apparatus 200 may set the position information of the upper left corner and the position information of the lower right corner of each slice to top_left_brick_idx and bottom_right_brick_idx_delta shown in FIG. 61. Accordingly, the decoding device 200 can specify the rectangular area included in each slice.
- the decoding apparatus sets the position information of the upper left corner of the slice to be decoded by the first predetermined method (S65). Also in the processing example illustrated in FIG. 62, it is assumed that the PPS has not notified the position information of the upper left corner of the first slice of the picture. Therefore, the decoding apparatus 200 may set the position information of the upper left corner of the first slice of the picture, for example, information indicating the upper left corner of the picture such as 0 (zero).
- the decoding device 200 determines whether the slice to be decoded is the last slice of the picture (S66).
- the decoding apparatus 200 sets the value notified by the PPS as the position information of the lower right corner of the slice to be decoded (S67).
- the decoding device 200 may set the brick index included in the PPS or the difference value thereof as the position information of the lower right corner of the slice to be decoded.
- the decoding apparatus 200 may set the position information of the lower right corner of the decoding target slice to bottom_right_brick_idx_delta or the like shown in FIG.
- the decoding apparatus sets the position information of the lower right corner of the slice to be decoded by the third predetermined method (S68).
- the position information of the lower right corner of the last slice of the picture is also not notified by the PPS. Therefore, the decoding apparatus 200 may set the offset value of the position of the upper left corner as the position information of the lower right corner of the last slice of the picture to be decoded.
- the decoding device 200 may set the position information of the lower right corner of the last slice of the picture to NumBricksInPic-1-top_left_brick_idx[num_slices_in_pic_minus1].
- the number of bricks in the picture is NumBricksInPic.
- the position of the upper left corner of the last slice of the picture is set to top_left_brick_idx[num_slices_in_pic_minus1].
- the decoding device 200 can specify the rectangular area included in each slice.
- the coding apparatus 100 can omit the picture parameter set without including part of the information about the slice setting method, and thus the coding amount may be reduced.
- this aspect may be implemented in combination with at least a part of other aspects in the present disclosure. Moreover, you may implement a part of process described in the flowchart of this aspect, a part of structure of the apparatus of this aspect, a part of syntax of this aspect, etc. in combination with another aspect.
- the rectangular slice setting process in the decoding device 200 may be similarly performed in the rectangular slice setting process in the encoding device 100.
- FIG. 63 is a diagram showing an example of a syntax of a picture parameter set (PPS) for dividing and encoding a picture when encoding the picture according to the fifth aspect of the first embodiment.
- FIG. 63 shows an example of the syntax of PPS for dividing and encoding a picture as shown in FIG. 58A or 58B.
- the PPS syntax shown in FIG. 63 is added with information on the tile division method by brick, as compared with the PPS syntax shown in FIG. 61, for example.
- the encoding apparatus 100 may notify the information about the picture dividing method and the information about the slice setting method. More specifically, the encoding apparatus 100 includes information (for example, single_tile_in_pic_flag in the syntax example shown in FIG. 63) regarding whether or not the target picture is configured with a single tile in the PPS. Then, when the picture is composed of a plurality of tiles, the encoding apparatus 100 includes information about a picture division method by tiles or bricks and information about a slice setting method in the PPS. With this, the encoding apparatus 100 notifies the information about the method of dividing a picture by tiles or bricks and the information about the method of setting slices according to the information about whether or not the target picture is composed of a single tile. be able to.
- the encoding apparatus 100 includes information (for example, single_tile_in_pic_flag in the syntax example shown in FIG. 63) regarding whether or not the target picture is configured with a single tile in the PPS. Then, when the picture is composed of a pluralit
- the encoding apparatus 100 may include information regarding the tile division method by brick in the PPS.
- information regarding the tile division method by brick for example, information indicating whether or not a tile in a picture is allowed to be divided by brick and whether or not the number of bricks in a slice is always 1 are indicated.
- the syntax indicating whether or not tiles in a picture are allowed to be divided by bricks is, for example, brick_splitting_present_flag.
- the syntax indicating whether or not the number of bricks in a slice is always one is, for example, single_brick_per_slice_flag.
- the encoding apparatus 100 When the information indicating whether or not the tile in the picture is allowed to be divided by the brick indicates that the tile is allowed to be divided, the encoding apparatus 100 notifies the PPS of the information indicating the division method by the brick for each tile. ..
- the encoding apparatus 100 transmits the information about the slice mode as the information about the slice setting method. Notify by including in PPS.
- the syntax indicating the information on the slice mode is, for example, rect_slice_flag shown in FIG. 63.
- the information on the slice mode indicates that the slice setting method in the target picture is the rectangular slice mode or the raster scan slice mode.
- the encoding device 100 transmits information about the slice mode.
- the notification may be omitted (not included in the PPS). If the information about the slice mode is not notified, the decoding device 200 may consider that the function information is always 1 in the slice mode and the slice setting method in the target picture is the rectangular slice mode.
- the encoding apparatus 100 can perform exclusive control between the process of dividing a tile by bricks in the rectangular slice mode and the process of the raster scan slice mode without error.
- FIG. 64 is a flowchart showing an example of slice mode setting processing when the decoding apparatus 200 according to the fifth aspect of the first embodiment performs the slice data decoding processing.
- the decoding device 200 refers to the information about the slice or tile setting method or the information about the brick setting method notified by the PPS as the slice mode setting process, and refers to the slice mode (rectangular slice mode or raster scan slice). Mode).
- the decoding device 200 acquires a picture parameter set (PPS) of a bitstream and analyzes the acquired PPS (S71).
- PPS picture parameter set
- the decoding device 200 determines whether or not tiles in a picture are allowed to be divided by bricks (S72).
- the decoding device 200 analyzes the PPS and confirms the information indicating whether or not the tile in the picture is allowed to be divided by the brick.
- the decoding device 200 can confirm whether or not a tile in a picture is allowed to be divided by bricks by analyzing syntax such as brick_splitting_present_flag included in PPS. ..
- the decoding device 200 determines whether or not the number of bricks in the slice is always one (step S72). S73).
- the decoding device 200 when the syntax indicating whether tiles in the picture included in the PPS are allowed to be divided by the bricks is not 1, always determines the number of bricks in the slices included in the PPS. Check the syntax that indicates whether there is one. In the example shown in FIG. 63, the decoding device 200 can confirm whether or not the number of bricks in a slice is always one by analyzing the syntax such as single_brick_per_slice_flag included in PPS.
- step S73 when the number of bricks in the slice is not necessarily one (No in step S73), the decoding device 200 sets the slice mode according to the information regarding the slice mode of PPS (S74).
- the decoding device 200 sets the slice mode to the raster scan slice mode when the syntax indicating whether or not the number of bricks in the slice included in the PPS is always one is not one.
- step S72 when the tile in the picture is allowed to be divided by the brick (allowed in step S72), the decoding device 200 sets the slice mode to the rectangular slice mode (S75).
- the decoding device 200 determines that the slice mode is rectangular slice when the syntax indicating whether or not the tile in the picture included in the PPS is allowed to be divided by the brick is 1. Set to mode.
- step S73 when the number of bricks in the slice is always one (Yes in step S73), the decoding device 200 sets the slice mode to the rectangular slice mode (S75).
- the decoding device 200 sets the slice mode to the rectangular slice mode when the syntax indicating whether the number of bricks in the slice included in the PPS is always 1 is 1. Set.
- the decoding apparatus 200 may omit the information about the slice mode from the PPS such as rect_slice_flag in FIG. 63 and may not be notified.
- the encoding apparatus 100 can omit the picture parameter set without including part of the information related to the slice mode, and thus the code amount may be reduced.
- this aspect may be implemented in combination with at least a part of other aspects in the present disclosure. Moreover, you may implement a part of process described in the flowchart of this aspect, a part of structure of the apparatus of this aspect, a part of syntax of this aspect, etc. in combination with another aspect.
- the slice mode setting process in the decoding device 200 may be similarly performed in the slice mode setting process in the encoding device 100.
- FIG. 65 is a diagram showing an example of the syntax of a picture parameter set (PPS) for dividing and encoding a picture when encoding the picture according to the sixth aspect of the first embodiment.
- FIG. 65 shows an example of the syntax of PPS for dividing and encoding a picture as shown in FIG. 58A or 58B.
- PPS picture parameter set
- the encoding apparatus 100 may notify the information about the picture dividing method and the information about the slice setting method. More specifically, the encoding apparatus 100 includes information (for example, single_tile_in_pic_flag in the syntax example illustrated in FIG. 65) regarding whether or not the target picture is configured with a single tile in the PPS. Then, when the picture is composed of a plurality of tiles, the encoding apparatus 100 includes information about a picture division method by tiles or bricks and information about a slice setting method in the PPS. With this, the encoding apparatus 100 notifies the information about the method of dividing a picture by tiles or bricks and the information about the method of setting slices according to the information about whether or not the target picture is composed of a single tile. be able to.
- the encoding apparatus 100 includes information (for example, single_tile_in_pic_flag in the syntax example illustrated in FIG. 65) regarding whether or not the target picture is configured with a single tile in the PPS. Then, when the picture is composed of a plurality of
- the information related to the slice mode is included in the PPS, and the information related to the slice mode is included. Later, information about the division of bricks is included in the PPS. That is, the encoding apparatus 100 switches whether or not to include the information about the division of the brick in the PPS and notifies the PPS. Therefore, the encoding apparatus 100 includes the information about the slice mode in the PPS and notifies the PPS of the information about the slice mode.
- the information related to the slice mode there is information indicating whether or not the number of bricks in the slice is always one, and information regarding the slice mode.
- the syntax indicating whether the number of bricks in a slice is always 1 is single_brick_per_slice_flag shown in FIG.
- the syntax indicating information about the slice mode is, for example, rect_slice_flag shown in FIG.
- the information on the slice mode indicates that the slice setting method in the target picture is the rectangular slice mode or the raster scan slice mode.
- the encoding device 100 may omit the information regarding the slice mode (not included in the PPS) and omit the notification. If the information about the slice mode is not notified, the decoding device 200 may consider that the function information is always 1 in the slice mode and the slice setting method in the target picture is the rectangular slice mode.
- the encoding apparatus 100 indicates whether or not the tile in the picture is permitted to be divided by the brick, only when the setting method of the slice in the target picture is the rectangular slice mode. May be included in the PPS for notification. In other words, the encoding apparatus 100 provides the information indicating whether or not the tile in the picture is allowed to be divided by the brick when the slice setting method in the target picture is not the rectangular slice (in the raster scan slice mode). The coding apparatus 100 may omit the notification (not included in the PPS), and if the slice setting method in the target picture is not a rectangular slice, the coding apparatus 100 provides information indicating that brick division is not allowed. This allows the decoding device 200 to perform the decoding process without allowing the brick division. That is, the decoding device 200 is set to the brick division operation that does not permit the brick division, and the decoding process is performed. Perform processing.
- the information regarding the division of the brick includes information indicating whether or not the tile in the picture is permitted to be divided by the brick, and information indicating how to divide each tile by the brick. ..
- the syntax indicating whether or not tiles in a picture are allowed to be divided by bricks is brick_splitting_present_flag or the like.
- the information indicating how to divide each tile by bricks includes, for example, the brick division method of each tile such as the presence/absence of division of each tile and the division size.
- the encoding device 100 includes information indicating whether or not tiles in a picture are allowed to be divided by bricks in the PPS only in the rectangular slice mode and notifies the information, and the raster scan mode is used. Sometimes it may be omitted (not included in the PPS) and not notified.
- the decoding device 200 considers that the information is always 0 and that the tile in the picture is not divided by the brick. You may do it.
- the encoding device 100 divides a picture to be encoded into two or more tiles and encodes the picture, when a part of the divided tiles or one or more tiles is used.
- the header information includes information indicating a slice mode for specifying whether the slice has a rectangular shape while encoding each configured slice.
- the coding apparatus 100 when coding the picture by coding for each rectangular slice, information indicating the rectangular slice mode as a slice mode and a part of tiles forming the rectangular slice or Information about how to set one or more tiles may be included in the header information.
- the coding apparatus 100 when coding the picture by coding for each rectangular slice, information indicating the rectangular slice mode as the slice mode and the divided tiles are further divided into a plurality of rectangular areas.
- the header information may include information that allows division, and information about a part of tiles forming a rectangular slice or a method of setting one or more tiles. It consists of a rectangular area.
- the encoding device 100 scans the divided two or more tiles in raster order and combines them into slices, and encodes them for each combined slice, so that when encoding the picture, for each combined slice.
- Information indicating the slice mode to be encoded may be included in the header information.
- FIG. 66 is a flowchart showing an example of a brick setting process when the decoding device 200 according to the sixth aspect of the first embodiment performs a brick data decoding process.
- the decoding device 200 identifies the rectangular area included in each brick while referring to the information regarding the slice or tile setting method or the information regarding the brick setting method notified by the PPS, as the brick setting processing.
- the decoding device 200 acquires a picture parameter set (PPS) of a bitstream and analyzes the acquired PPS (S81).
- PPS picture parameter set
- the decoding device 200 confirms the slice mode of the picture to be decoded (S82).
- the decoding device 200 analyzes the PPS and confirms the information regarding the slice mode.
- the decoding device 200 can confirm whether the slice mode of the picture to be decoded is the rectangular slice mode or the raster scan slice mode by analyzing the syntax such as rect_slice_flag included in the PPS.
- step S82 when the slice mode of the picture to be decoded is the rectangular slice mode (rectangle in step S82), the decoding device 200 confirms whether or not the tile in the picture is allowed to be divided by the brick. Yes (S84).
- the decoding device 200 can confirm whether or not the tile in the picture is allowed to be divided by the brick by analyzing the syntax such as brick_splitting_present_flag included in the PPS.
- the decoding device 200 determines the number of times of loop processing (number of loops) according to the information about the number of tiles in the picture. Is set (S85).
- the decoding device 200 analyzes the PPS, and when the syntax such as brick_splitting_present_flag included in the PPS is 1, interprets that the tile in the picture is allowed to be divided by the brick. Then, the decoding device 200 sets the number of loops according to information about the number of tiles in the picture, such as the product of the number of tile divisions in the horizontal direction and the number of tile divisions in the vertical direction, and executes the loop processing.
- the decoding device 200 sets the brick division method of each tile according to the information regarding the division of the brick (S86).
- the decoding device 200 sets the brick division method for each tile, such as the presence/absence of division of each tile and the division size.
- the coding apparatus 100 can omit the picture parameter set without including part of the information about the setting method of the brick, and thus the coding amount may be reduced.
- this aspect may be implemented in combination with at least a part of other aspects in the present disclosure. Moreover, you may implement a part of process described in the flowchart of this aspect, a part of structure of the apparatus of this aspect, a part of syntax of this aspect, etc. in combination with another aspect.
- the brick setting process in the decoding device 200 may be similarly performed in the brick setting process in the encoding device 100.
- FIG. 67 is a block diagram showing an implementation example of the encoding device 100 according to the first embodiment.
- the encoding device 100 includes a circuit 160 and a memory 162.
- the plurality of components of the encoding device 100 shown in FIG. 1 are implemented by the circuit 160 and the memory 162 shown in FIG. 67.
- the circuit 160 is a circuit that performs information processing, and is a circuit that can access the memory 162.
- the circuit 160 is a dedicated or general-purpose electronic circuit that encodes a moving image.
- the circuit 160 may be a processor such as a CPU.
- the circuit 160 may be an assembly of a plurality of electronic circuits.
- the circuit 160 may play the role of a plurality of constituent elements other than the constituent element for storing information among the plurality of constituent elements of the encoding device 100 shown in FIG. 1 and the like.
- the memory 162 is a dedicated or general-purpose memory in which information for the circuit 160 to encode a moving image is stored.
- the memory 162 may be an electronic circuit and may be connected to the circuit 160. Further, the memory 162 may be included in the circuit 160. Further, the memory 162 may be an aggregate of a plurality of electronic circuits. Further, the memory 162 may be a magnetic disk, an optical disk, or the like, and may be expressed as a storage, a recording medium, or the like.
- the memory 162 may be a non-volatile memory or a volatile memory.
- the memory 162 may store a moving image to be encoded, or may store a bit string corresponding to the encoded moving image. Further, the memory 162 may store a program for the circuit 160 to encode a moving image.
- the memory 162 may serve as a component for storing information among the plurality of components of the encoding device 100 shown in FIG. 1 and the like. Specifically, the memory 162 may serve as the block memory 118 and the frame memory 122 shown in FIG. More specifically, the memory 162 may store reconstructed blocks, reconstructed pictures, and the like.
- the encoding device 100 not all of the plurality of components shown in FIG. 1 and the like may be implemented, or all of the plurality of processes described above may not be performed. A part of the plurality of constituent elements illustrated in FIG. 1 and the like may be included in another device, and a part of the plurality of processes described above may be executed by another device. Then, in the encoding device 100, a part of the plurality of constituent elements illustrated in FIG. 1 and the like is implemented, and a part of the plurality of processes described above is performed, thereby performing a prediction process in the inter prediction mode. Is done efficiently.
- FIG. 68 is a flowchart showing an operation example of the encoding device 100 shown in FIG. 67.
- the encoding device 100 shown in FIG. 67 performs the operation shown in FIG. 68 when encoding a moving image.
- the circuit 160 of the encoding device 100 performs the following processing in operation. That is, first, the circuit 160 divides the picture to be encoded into two or more tiles (S311). Next, the circuit 160 encodes a picture by encoding a part of the tile divided in step S311 or a rectangular slice composed of one or more tiles, and the circuit 160 encodes the picture. In doing so, the information about the area occupied by the slice located in the lower right corner of the picture is not included in the header information (S312). Note that the circuit 160 includes information regarding other areas in the header information when encoding the picture.
- the part of the tiles divided in step S311 means a part of the tiles included in the two or more divided tiles.
- the encoding apparatus 100 can omit the picture parameter set without including a part of the information about the slice setting method, and thus the encoding amount may be reduced.
- FIG. 69 is a block diagram showing an implementation example of the decoding device 200 according to the first embodiment.
- the decoding device 200 includes a circuit 260 and a memory 262.
- the plurality of constituent elements of the decoding device 200 shown in FIG. 41 are implemented by the circuit 260 and the memory 262 shown in FIG.
- the circuit 260 is a circuit that performs information processing and is a circuit that can access the memory 262.
- the circuit 260 is a dedicated or general-purpose electronic circuit that decodes a moving image.
- the circuit 260 may be a processor such as a CPU.
- the circuit 260 may be an assembly of a plurality of electronic circuits. Further, for example, the circuit 260 may play the role of a plurality of constituent elements other than the constituent element for storing information among the plurality of constituent elements of the decoding device 200 shown in FIG. 41 and the like.
- the memory 262 is a dedicated or general-purpose memory that stores information for the circuit 260 to decode a moving image.
- the memory 262 may be an electronic circuit and may be connected to the circuit 260.
- the memory 262 may also be included in the circuit 260.
- the memory 262 may be an aggregate of a plurality of electronic circuits.
- the memory 262 may be a magnetic disk, an optical disk, or the like, and may be expressed as a storage, a recording medium, or the like.
- the memory 262 may be a non-volatile memory or a volatile memory.
- the memory 262 may store a bit string corresponding to the encoded moving image or a moving image corresponding to the decoded bit string. Further, the memory 262 may store a program for the circuit 260 to decode a moving image.
- the memory 262 may serve as a component for storing information among the plurality of components of the decoding device 200 shown in FIG. 41 and the like. Specifically, the memory 262 may serve as the block memory 210 and the frame memory 214 shown in FIG. 41. More specifically, the memory 262 may store reconstructed blocks, reconstructed pictures, and the like.
- the decoding device 200 not all of the plurality of constituent elements shown in FIG. 41 or the like may be implemented, or all of the plurality of processes described above may not be performed. Some of the plurality of components illustrated in FIG. 41 and the like may be included in another device, and some of the plurality of processes described above may be executed by another device. Then, in the decoding device 200, a part of the plurality of components shown in FIG. 41 and the like is mounted, and a part of the plurality of processes described above is performed, so that motion compensation is efficiently performed. ..
- FIG. 70 is a flowchart showing an operation example of the decoding device 200 shown in FIG. 69.
- the decoding device 200 shown in FIG. 69 performs the operation shown in FIG. 70 when decoding a moving image.
- the circuit 260 of the decoding device 200 performs the following processing in operation. That is, first, the circuit 260 divides the picture to be decoded into two or more tiles (S411). Next, the circuit 260 decodes the picture by decoding a part of the tile divided in step S411 or each rectangular slice composed of one or more tiles, and the circuit 260 decodes the picture. At this time, the information about the area occupied by the slice located in the lower right corner of the picture is set by a predetermined method that does not use the header information, and the information about the area is not included in the header information (S412). When the circuit 260 encodes a picture, the header information includes information about other areas.
- the decoding device 200 can perform the decoding process even if the picture parameter set does not include a part of the information on the slice setting method. Therefore, the decoding device 200 may be able to reduce the code amount of the acquired bitstream.
- the coding apparatus 100 and the decoding apparatus 200 may be used as an image coding apparatus and an image decoding apparatus, respectively, or may be used as a moving picture coding apparatus and a moving picture decoding apparatus, respectively. Good.
- each component may be configured by dedicated hardware, or may be realized 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 in a recording medium such as a hard disk or a semiconductor memory.
- each of the encoding device 100 and the decoding device 200 includes a processing circuit (Processing Circuit) and a storage device (Storage) electrically connected to the processing circuit and accessible from the processing circuit. You may have it.
- the processing circuit corresponds to the circuit 160 or 260
- the storage device corresponds to the memory 162 or 262.
- the processing circuit includes at least one of dedicated hardware and a program execution unit, and executes processing using a storage device. Further, when the processing circuit includes the program execution unit, the storage device stores the software program executed by the program execution unit.
- the software that realizes the encoding device 100 or the decoding device 200 according to the present embodiment is the following program.
- this program is a coding method for coding a moving image on a computer, and divides a picture to be coded into two or more tiles, and from a part of the divided tiles or one or more tiles.
- a picture is encoded, and when encoding the picture, an encoding method that does not include information about the area occupied by the slice located in the lower right corner of the picture in the header information is provided. It may be executed.
- this program is a decoding method for decoding a moving image, in which a picture to be decoded is divided into two or more tiles, and a part of the divided tiles or a rectangular shape composed of one or more tiles is used.
- the picture is decoded, and when decoding the picture, the information about the area occupied by the slice located in the lower right corner of the picture is set by a predetermined method that does not use header information.
- the information may cause the computer to execute a decoding method not included in the header information.
- each component may be a circuit as described above. These circuits may form one circuit as a whole or may be separate circuits. Further, each component may be realized by a general-purpose processor or a dedicated processor.
- the processing executed by a specific component may be executed by another component.
- the order in which the processes are executed may be changed, or a plurality of processes may be executed in parallel.
- the encoding/decoding device may include the encoding device 100 and the decoding device 200.
- the first and second ordinal numbers used in the explanation may be replaced appropriately.
- an ordinal number may be newly added to or removed from a component or the like.
- One or more aspects disclosed herein may be implemented in combination with at least a part of other aspects in the present disclosure.
- a part of the processes, a part of the configuration of the apparatus, a part of the syntax, and the like described in the flowcharts of one or more aspects disclosed herein may be implemented in combination with other aspects.
- each of the functional or functional blocks can be generally realized by an MPU (micro processing unit), a memory and the like. Further, the processing by each of the functional blocks may be realized as a program execution unit such as a processor that reads and executes software (program) recorded in a recording medium such as a ROM. The software may be distributed. The software may be recorded in various recording media such as a semiconductor memory. Note that each functional block can be realized by hardware (dedicated circuit). Various combinations of hardware and software can be employed.
- 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. Further, the number of processors that execute the program may be singular or plural. That is, centralized processing may be performed or distributed processing may be performed.
- Such a system may be characterized by having an image encoding device using the image encoding method, an image decoding device using the image decoding method, or an image encoding/decoding device including both. Other configurations of such a system can be appropriately changed depending on the case.
- FIG. 71 is a diagram showing an overall configuration of an appropriate content supply system ex100 that realizes a content distribution service.
- the area for providing communication services is divided into cells of desired size, and base stations ex106, ex107, ex108, ex109, and ex110, which are fixed wireless stations in the illustrated example, 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 is connected to the Internet ex101 via an Internet service provider ex102 or a communication network ex104 and base stations ex106 to ex110.
- the content supply system ex100 may be configured to be connected by combining any of the above devices.
- each device may be directly or indirectly connected to each other via a telephone network, a short-range wireless communication, or the like, not via the base stations ex106 to ex110.
- the streaming server ex103 may be 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 and the like. Further, the streaming server ex103 may be connected to a terminal or the like in a hotspot in the airplane ex117 via the satellite ex116.
- 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 to the airplane ex117 without the satellite ex116.
- the camera ex113 is a device such as a digital camera capable of shooting still images and moving images.
- the smartphone ex115 is a smartphone device, a mobile phone, a PHS (Personal Handy-phone System), or the like that supports a mobile communication system called 2G, 3G, 3.9G, 4G, and 5G in the future.
- a mobile communication system called 2G, 3G, 3.9G, 4G, and 5G in the future.
- the home appliance ex114 is a refrigerator, a device included in a home fuel cell cogeneration system, or the like.
- a terminal having a shooting function is connected to the streaming server ex103 via the base station ex106 and the like, which enables live distribution and the like.
- terminals computer ex111, game machine ex112, camera ex113, home appliances ex114, smartphone ex115, terminals in airplane ex117, etc.
- the encoding process described in each embodiment may be performed, the video data obtained by the encoding and the audio data obtained by encoding the sound corresponding to the video may be multiplexed, and the obtained data is streamed. It may be transmitted to the server ex103. That is, each terminal functions as an image encoding device according to an aspect of the present disclosure.
- the streaming server ex103 streams the content data transmitted to the requested client.
- the client is a terminal or the like in the computer ex111, the game machine ex112, the camera ex113, the home appliance ex114, the smartphone ex115, or the airplane ex117 capable of decoding the encoded data.
- Each device that has received the distributed data may decrypt the received data and reproduce it. That is, each device may function as the image decoding device according to one aspect of the present disclosure.
- the streaming server ex103 may be a plurality of servers or a plurality of computers, and may decentralize data for processing, recording, or distributing.
- the streaming server ex103 may be realized by a CDN (Contents Delivery Network), and content distribution may be realized by a network connecting a large number of edge servers distributed around the world and the edge servers.
- CDN Contents Delivery Network
- content distribution 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 can be dynamically assigned according to clients. Then, the content can be cached and delivered to the edge server to reduce the delay.
- processing is distributed among multiple edge servers, the distribution subject is switched to another edge server, or a failure occurs. Since delivery can be continued by bypassing the network part, fast and stable delivery can be realized.
- the processing loop is performed twice.
- the first loop the complexity of the image or the code amount of each frame or scene is detected.
- the second loop processing for maintaining the image quality and improving the coding efficiency is performed.
- the terminal performs the first encoding process
- the server side that receives the content performs the 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 be received and reproduced by another terminal, which enables more flexible real-time distribution. Become.
- the camera ex113 or the like extracts a feature amount (feature or feature amount) from an image, compresses data relating to the feature amount as metadata, and sends the metadata to the server.
- the server performs compression according to the meaning of the image (or the importance of the content), for example, determining the importance of the object from the feature amount and switching the quantization accuracy.
- the feature amount data is particularly effective in improving the accuracy and efficiency of motion vector prediction at the time of re-compression in the server.
- the terminal may perform simple encoding such as VLC (variable length encoding), and the server may perform encoding with a large processing load such as CABAC (context adaptive binary arithmetic encoding method).
- the server may manage and/or instruct so that the video data shot by each terminal can be referred to each other. Also, the encoded data from each terminal may be received by the server, the reference relationship may be changed among a plurality of data, or the picture itself may be corrected or replaced and re-encoded. This makes it possible to generate streams with improved quality and efficiency of each piece of data.
- the server may transcode the video data to change the coding method and then distribute the video data.
- the server may convert the MPEG type encoding method into the VP type (for example, VP9), or the H.264 standard. H.264. It may be converted to 265 or the like.
- the encoding process can be performed by the terminal or one or more servers. Therefore, in the following, the description such as “server” or “terminal” is used as the entity performing the process, but a part or all of the process performed by the server may be performed by the terminal, or the process performed by the terminal may be performed. Some or all may be done at the server. The same applies to the decoding process.
- the server not only encodes the two-dimensional moving image, but also automatically encodes the still image based on the scene analysis of the moving image, or at the time specified by the user, and transmits it to the receiving terminal. Good. If the server is able to acquire the relative positional relationship between the photographing terminals, the server further determines the three-dimensional shape of the scene based on not only the two-dimensional moving image but also the video captured from the same scene from different angles. Can be generated.
- the server may separately encode the three-dimensional data generated by the point cloud or the like, or based on the result of recognizing or tracking a person or an object using the three-dimensional data, a plurality of images to be transmitted to the receiving terminal may be transmitted. It may be generated by selecting or reconstructing it from the video taken by the terminal of.
- the user can freely select each video corresponding to each shooting terminal and enjoy the scene, or select the video of the selected viewpoint from the three-dimensional data reconstructed using a plurality of images or videos. You can also enjoy the cut out content. Further, along with the video, sound is also picked up from a plurality of different angles, and the server multiplexes the sound from a specific angle or space with the corresponding video and transmits the multiplexed video and sound. Good.
- the server may create viewpoint images for the right eye and the left eye, respectively, and perform encoding that allows reference between the viewpoint videos by using Multi-View Coding (MVC) or the like. It may be encoded as another stream without referring to it. At the time of decoding another stream, it is preferable to reproduce them in synchronization with each other so that a virtual three-dimensional space can be reproduced according to the viewpoint of the user.
- MVC Multi-View Coding
- the server may superimpose the virtual object information in the virtual space on the camera information in the physical space based on the three-dimensional position or the movement of the user's viewpoint.
- the decoding device may acquire or hold the virtual object information and the three-dimensional data, generate a two-dimensional image according to the movement of the viewpoint of the user, and smoothly connect the two to generate the superimposed data.
- the decoding device may transmit the movement of the user's viewpoint to the server in addition to the request for the virtual object information.
- the server may create the superimposition data in accordance with the movement of the viewpoint received from the three-dimensional data stored in the server, encode the superimposition data, and deliver the superimposition data to the decoding device.
- the superimposition data typically has an ⁇ value indicating transparency other than RGB
- the server sets the ⁇ value of a portion other than an object created from three-dimensional data to 0 or the like, and May be encoded in a state in which is transparent.
- the server may set the RGB value of a predetermined value to the background like chroma key, and generate the data with the background color for the parts other than the object.
- the RGB value of the predetermined value may be predetermined.
- the decryption process of the distributed data may be performed by the client (for example, the terminal), the server side, or the processes may be shared by each other.
- a certain terminal may send a reception request to the server once, another terminal may receive the content corresponding to the request, perform a decoding process, and the decoded signal may be transmitted to a device having a display. It is possible to reproduce high-quality data by distributing the processing and selecting an appropriate content regardless of the performance of the terminal capable of communication.
- a partial area such as a tile into which a picture is divided may be decoded and displayed on the viewer's personal terminal. As a result, it is possible to confirm the field in which the user is in charge or the area to be confirmed in more detail, while sharing the entire image.
- the user may switch in real time while freely selecting the user's terminal, a decoding device or a display device such as a display arranged indoors or outdoors.
- it is possible to perform decoding by switching the terminal to be decoded and the terminal to be displayed, using the position information of itself. This allows information to be mapped and displayed on a wall or part of the ground of an adjacent building in which the displayable device is embedded while the user is traveling to the destination.
- encoded data on the network such as encoded data being cached in a server that can be accessed from the receiving terminal in a short time or being 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 easiness.
- the server may have a plurality of streams having the same content but different qualities as individual streams, but as shown in the figure, it is possible to realize a temporal/spatial scalable that is realized by performing coding by dividing into layers.
- a configuration may be used in which contents are switched by utilizing the characteristics of streams. That is, the decoding side decides which layer to decode according to an internal factor such as performance and an external factor such as the state of the communication band, so that the decoding side can determine low-resolution content and high-resolution content. You can freely switch and decrypt.
- the device when the user wants to watch the continuation of the video that he/she was watching on the smartphone ex115 while moving, for example, on a device such as the Internet TV after returning home, the device only needs to decode the same stream up to different layers. The burden on the side can be reduced.
- the picture is coded for each layer, and in addition to the configuration that realizes scalability in the enhancement layer above the base layer, the enhancement layer includes meta information based on image statistical information and the like. Good.
- the decoding side may generate high-quality content by super-resolution of the base layer picture based on the meta information. Super-resolution may improve signal-to-noise ratio while maintaining and/or increasing resolution.
- the meta information is information for specifying a linear or non-linear filter coefficient used for super-resolution processing, or information for specifying parameter values for filter processing, machine learning or least-squares calculation used for super-resolution processing. including.
- a configuration may be provided in which a picture is divided into tiles or the like according to the meaning of objects in an image.
- the decoding side decodes only a part of the area by selecting the tile to be decoded. Furthermore, by storing the attributes of the object (person, car, ball, etc.) and the position in the video (coordinate position in the same image, etc.) as meta information, the decoding side can position the desired object based on the meta information.
- the meta information may be stored using a data storage structure different from the pixel data, such as an SEI (supplemental enhancement information) 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 composed of multiple pictures such as streams, sequences, or random access units.
- the decoding side can obtain the time when a specific person appears in the video, and the like, and by combining the information on a picture-by-picture basis and the time information, the picture in which the object exists can be specified and the position of the object in the picture can be determined.
- FIG. 74 is a diagram showing an example of a web page display screen on the computer ex111 or the like.
- FIG. 75 is a diagram illustrating an example of a web page display screen on the smartphone ex115 or the like.
- the web page may include a plurality of link images that are links to the image content, and the appearance may be different depending on the browsing device.
- the display device When a plurality of link images are visible on the screen, the display device (until the user explicitly selects the link image, or until the link image approaches the center of the screen or the whole link image is within the screen (
- the decoding device may display a still image or I picture included in each content as a link image, may display a video such as a gif animation with a plurality of still images or I pictures, and may display a base layer. Only the video may be received and the video may be decoded and displayed.
- the display device When the link image is selected by the user, the display device performs decoding while giving the base layer the highest priority, for example.
- the display device may decode up to the enhancement layer if there is information indicating that the content is scalable in the HTML forming the web page.
- the display device decodes only forward reference pictures (I picture, P picture, forward reference only B picture) before selection or when the communication band is very severe. By displaying and, the delay between the decoding time of the first picture and the display time (delay from the decoding start of the content to the display start) can be reduced.
- the display device may intentionally ignore the reference relationship of pictures, perform coarse decoding with all B pictures and P pictures as forward references, and perform normal decoding as the number of pictures received increases over time. ..
- the receiving terminal may add meta data in addition to image data belonging to one or more layers.
- Information such as weather or construction information may be received as information, and these may be associated and decrypted.
- the meta information may belong to the layer or may simply be multiplexed with the image data.
- a car, a drone, an airplane, or the like including the receiving terminal moves, so that the receiving terminal transmits the position information of the receiving terminal to perform seamless reception and decoding while switching the base stations ex106 to ex110. realizable.
- the receiving terminal can dynamically switch how much the meta information is received or how much the map information is updated according to the selection of the user, the situation of the user and/or the state of the communication band. Will be possible.
- the client can receive, decode, and reproduce the encoded information transmitted by the user in real time.
- the server may perform the editing process and then the encoding process. This can be realized by using the following configuration, for example.
- the server performs recognition processing such as shooting error, scene search, meaning analysis, and object detection from original image data or encoded data. Then, the server manually or automatically corrects out-of-focus or camera-shake based on the recognition result, or a less important scene such as a scene whose brightness is lower than other pictures or out of focus. Edit it by deleting it, emphasizing the edge of the object, or changing the hue.
- the server encodes the edited data based on the editing result. It is also known that if the shooting time is too long, the audience rating will decrease, and the server will move not only the less important scenes as described above so that the content falls within a specific time range depending on the shooting time. A scene or the like with a small number may be automatically clipped based on the image processing result. Alternatively, the server may generate and encode the digest based on the result of the semantic analysis of the scene.
- the server may intentionally change the face of a person in the peripheral portion of the screen, the inside of the house, or the like into an image that is out of focus and encode the image. Further, the server recognizes whether or not a face of a person different from the previously registered person is shown in the image to be encoded, and if it is shown, performs processing such as applying mosaic to the face part. May be.
- the user or the background region in which the user wants to process the image from the viewpoint of copyright may be designated.
- the server may perform processing such as replacing the designated area with another image or defocusing. If it is a person, the person in the moving image can be tracked to replace the image of the face portion of the person.
- the decoding device may first receive the base layer with the highest priority and perform decoding and playback, depending on the bandwidth.
- the decoding device may receive the enhancement layer during this period, and when the reproduction is performed twice or more, such as when the reproduction is looped, the decoding device may reproduce the high-quality image including the enhancement layer.
- the stream is thus encoded in a scalable manner, it is possible to provide an experience in which the video is rough when it is not selected or when it is first seen, but the stream gradually becomes smarter and the image becomes better.
- the same experience can be provided even if the coarse stream that is first played and the second stream that is coded by referring to the first moving image are configured as one stream. ..
- the LSI (large scale integration circuit) ex500 may be a single chip or may be composed of a plurality of chips.
- the moving picture coding or decoding software is installed in some kind of recording medium (CD-ROM, flexible disk, hard disk, etc.) that can be read by the computer ex111 or the like, and the coding or decoding processing is performed using the software. Good.
- the smartphone ex115 has a camera, the moving image data acquired by the camera may be transmitted. The moving image data at this time may be data encoded by the LSI ex500 included in the smartphone ex115.
- the LSI ex500 may be configured to download and activate application software.
- the terminal first determines whether the terminal is compatible with the content encoding method or has the capability to execute a specific service.
- the terminal may download the codec or application software, and then acquire and reproduce the content.
- the moving image coding device image coding device
- the moving image decoding device image decoding device
- FIG. 76 is a diagram showing further details of the smartphone ex115 shown in FIG. 71. Further, FIG. 77 is a diagram illustrating a configuration example of the smartphone ex115.
- the smartphone ex115 receives at the antenna ex450 for transmitting and receiving radio waves to and from the base station ex110, the camera unit ex465 capable of taking a video image and a still image, the video image captured by the camera unit ex465, and the antenna ex450.
- a display unit ex458 that displays data in which an image or the like is decoded is provided.
- the smartphone ex115 further includes an operation unit ex466 that is a touch panel, a voice output unit ex457 that is a speaker that outputs voice or sound, a voice input unit ex456 that is a microphone that inputs voice, and the like.
- Memory unit ex467 that can store encoded video or still image, recorded audio, received image or still image, encoded data such as mail, or decoded data, specify a user, and start a network.
- a slot unit ex464 that is an interface unit with the SIM ex468 for authenticating access to various data is provided.
- An external memory may be used instead of the memory unit ex467.
- a main control unit ex460 capable of controlling the display unit ex458 and the operation unit ex466 and the like, 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, a modulation/ The demodulation unit ex452, the multiplexing/demultiplexing unit ex453, the audio signal processing unit ex454, the slot unit ex464, and the memory unit ex467 are connected to each other via the synchronization bus ex470.
- the power supply circuit unit ex461 activates the smartphone ex115 and supplies power from the battery pack to each unit.
- the smartphone ex115 performs processing such as call and data communication under the control of the main control unit ex460 including a CPU, a ROM, a RAM, and the like.
- the voice signal collected by the voice input unit ex456 is converted into a digital voice signal by the voice signal processing unit ex454, the modulation/demodulation unit ex452 performs spread spectrum processing, and the transmission/reception unit ex451 performs digital-analog conversion processing. And frequency conversion processing is performed, and the resulting signal is transmitted via the antenna ex450.
- the received data is amplified, subjected to frequency conversion processing and analog-digital conversion processing, subjected to spectrum despreading processing in the modulation/demodulation unit ex452, converted into an analog audio signal in the audio signal processing unit ex454, and then converted into an audio output unit ex457.
- text, still image, or video data may be sent out under the control of the main control unit ex460 via the operation input control unit ex462 based on the operation of the operation unit ex466 of the main body. Similar transmission/reception processing is performed.
- the video signal processing unit ex455 uses the video signal stored in the memory unit ex467 or the video signal input from the camera unit ex465 as in each of the above embodiments.
- the moving picture coding method shown in the embodiment is used for compression coding, and the coded video data is sent to the multiplexing/demultiplexing unit ex453.
- the audio signal processing unit ex454 encodes the audio signal picked up by the audio input unit ex456 while the video unit or the still image is being captured by the camera unit ex465, and sends the encoded audio data to the multiplexing/demultiplexing unit ex453.
- the multiplexing/separating unit ex453 multiplexes the coded video data and the coded audio data by 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 is processed and transmitted via the antenna ex450.
- the predetermined method may be predetermined.
- the multiplexing/demultiplexing unit ex453 performs the multiplexing.
- 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.
- the encoded audio data is supplied to the audio signal processing unit ex454.
- the video signal processing unit ex455 decodes the video signal by the moving picture decoding method corresponding to the moving picture coding method shown in each of the above embodiments, and is linked from the display unit ex458 via the display control unit ex459.
- the video or still image included in the moving image file is displayed.
- the audio signal processing unit ex454 decodes the audio signal and the audio output unit ex457 outputs the audio.
- audio playback may not be socially suitable depending on the user's situation. Therefore, as the initial value, it is preferable to reproduce only the video data without reproducing the audio signal, and the audio may be reproduced synchronously only when the user performs an operation such as clicking the video data. ..
- the smartphone ex115 has been described here as an example, in addition to a transmission/reception terminal having both an encoder and a decoder as a terminal, a transmission terminal having only an encoder and a reception having only a decoder are provided. Another implementation format called a terminal is possible.
- the description has been made assuming that the multiplexed data in which the audio data is multiplexed with the video data is received or transmitted.
- character data related to video may be multiplexed in the multiplexed data.
- the video data itself may be received or transmitted instead of the multiplexed data.
- main control unit ex460 including a CPU has been described as controlling the encoding or decoding process, but various terminals often include a GPU. Therefore, a configuration in which a large area is collectively processed by utilizing the performance of the GPU by a memory shared by the CPU and the GPU or a memory whose address is managed so as to be commonly used may be used. As a result, the coding time can be shortened, real-time performance can be secured, and low delay can be realized. In particular, it is efficient to collectively perform the motion search, deblock filter, SAO (Sample Adaptive Offset), and conversion/quantization processing in units of pictures or the like in the GPU instead of the CPU.
- SAO Sample Adaptive Offset
- the present disclosure can be used for, for example, a television receiver, a digital video recorder, a car navigation, a mobile phone, a digital camera, a digital video camera, a video conference system, an electronic mirror, or the like.
- Encoding Device 102 Dividing Unit 104 Subtracting Unit 106 Transforming Unit 108 Quantizing Unit 110 Entropy Encoding Unit 112, 204 Inverse Quantizing Unit 114, 206 Inverse Transforming Unit 116, 208 Addition Unit 118, 210 Block Memory 120, 212 Loop Filter Unit 122, 214 Frame memory 124, 216 Intra prediction unit 126, 218 Inter prediction unit 128, 220 Prediction control unit 200 Decoding device 202 Entropy decoding unit 1201 Boundary determination unit 1202, 1204, 1206 switch 1203 Filter determination unit 1205 Filter processing unit 1207 Filter characteristic determination unit 1208 Processing determination unit a1, b1 Processor a2, b2 Memory
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
Description
まず、実施の形態に係る符号化装置を説明する。図1は、実施の形態に係る符号化装置100の機能構成を示すブロック図である。符号化装置100は、動画像をブロック単位で符号化する動画像符号化装置である。
図2は、符号化装置100による全体的な符号化処理の一例を示すフローチャートである。
分割部102は、入力動画像に含まれる各ピクチャを複数のブロックに分割し、各ブロックを減算部104に出力する。例えば、分割部102は、まず、ピクチャを固定サイズ(例えば128x128)のブロックに分割する。他の固定ブロックサイズが採用されてもよい。この固定サイズのブロックは、符号化ツリーユニット(CTU)と呼ばれることがある。そして、分割部102は、例えば再帰的な四分木(quadtree)及び/又は二分木(binary tree)ブロック分割に基づいて、固定サイズのブロックの各々を可変サイズ(例えば64x64以下)のブロックに分割する。すなわち、分割部102は、分割パターンを選択する。この可変サイズのブロックは、符号化ユニット(CU)、予測ユニット(PU)あるいは変換ユニット(TU)と呼ばれることがある。なお、種々の処理例では、CU、PU及びTUは区別される必要はなく、ピクチャ内の一部又はすべてのブロックがCU、PU、TUの処理単位となってもよい。
ピクチャを並列にデコードするために、ピクチャはスライス単位またはタイル単位で構成される場合がある。スライス単位またはタイル単位からなるピクチャは、分割部102によって構成されてもよい。
減算部104は、分割部102から入力され、分割部102によって分割されたブロック単位で、原信号(原サンプル)から予測信号(以下に示す予測制御部128から入力される予測サンプル)を減算する。つまり、減算部104は、符号化対象ブロック(以下、カレントブロックという)の予測誤差(残差ともいう)を算出する。そして、減算部104は、算出された予測誤差(残差)を変換部106に出力する。
変換部106は、空間領域の予測誤差を周波数領域の変換係数に変換し、変換係数を量子化部108に出力する。具体的には、変換部106は、例えば空間領域の予測誤差に対して所定の離散コサイン変換(DCT)又は離散サイン変換(DST)を行う。所定のDCT又はDSTは、予め定められていてもよい。
量子化部108は、変換部106から出力された変換係数を量子化する。具体的には、量子化部108は、カレントブロックの変換係数を所定の走査順序で走査し、走査された変換係数に対応する量子化パラメータ(QP)に基づいて当該変換係数を量子化する。そして、量子化部108は、カレントブロックの量子化された変換係数(以下、量子化係数という)をエントロピー符号化部110及び逆量子化部112に出力する。所定の走査順序は、予め定められていてもよい。
エントロピー符号化部110は、量子化部108から入力された量子化係数に基づいて符号化信号(符号化ビットストリーム)を生成する。具体的には、エントロピー符号化部110は、例えば、量子化係数を二値化し、二値信号を算術符号化し、圧縮されたビットストリームまたはシーケンスを出力する。
逆量子化部112は、量子化部108から入力された量子化係数を逆量子化する。具体的には、逆量子化部112は、カレントブロックの量子化係数を所定の走査順序で逆量子化する。そして、逆量子化部112は、カレントブロックの逆量子化された変換係数を逆変換部114に出力する。所定の走査順序は、予め定められていてもよい。
逆変換部114は、逆量子化部112から入力された変換係数を逆変換することにより予測誤差(残差)を復元する。具体的には、逆変換部114は、変換係数に対して、変換部106による変換に対応する逆変換を行うことにより、カレントブロックの予測誤差を復元する。そして、逆変換部114は、復元された予測誤差を加算部116に出力する。
加算部116は、逆変換部114から入力された予測誤差と予測制御部128から入力された予測サンプルとを加算することによりカレントブロックを再構成する。そして、加算部116は、再構成されたブロックをブロックメモリ118及びループフィルタ部120に出力する。再構成ブロックは、ローカル復号ブロックと呼ばれることもある。
ブロックメモリ118は、例えば、イントラ予測で参照されるブロックであって符号化対象ピクチャ(カレントピクチャという)内のブロックを格納するための記憶部である。具体的には、ブロックメモリ118は、加算部116から出力された再構成ブロックを格納する。
フレームメモリ122は、例えば、インター予測に用いられる参照ピクチャを格納するための記憶部であり、フレームバッファと呼ばれることもある。具体的には、フレームメモリ122は、ループフィルタ部120によってフィルタされた再構成ブロックを格納する。
ループフィルタ部120は、加算部116によって再構成されたブロックにループフィルタを施し、フィルタされた再構成ブロックをフレームメモリ122に出力する。ループフィルタとは、符号化ループ内で用いられるフィルタ(インループフィルタ)であり、例えば、デブロッキング・フィルタ(DFまたはDBF)、サンプルアダプティブオフセット(SAO)及びアダプティブループフィルタ(ALF)などを含む。
デブロッキング・フィルタでは、ループフィルタ部120は、再構成画像のブロック境界にフィルタ処理を行うことによって、そのブロック境界に生じる歪みを減少させる。
q'1=(p0+q0+q1+q2+2)/4
q'2=(p0+q0+q1+3×q2+2×q3+4)/8
図11は、符号化装置100の予測処理部で行われる処理の一例を示すフローチャートである。なお、予測処理部は、イントラ予測部124、インター予測部126、及び予測制御部128の全てまたは一部の構成要素からなる。
イントラ予測部124は、ブロックメモリ118に格納されたカレントピクチャ内のブロックを参照してカレントブロックのイントラ予測(画面内予測ともいう)を行うことで、予測信号(イントラ予測信号)を生成する。具体的には、イントラ予測部124は、カレントブロックに隣接するブロックのサンプル(例えば輝度値、色差値)を参照してイントラ予測を行うことでイントラ予測信号を生成し、イントラ予測信号を予測制御部128に出力する。
インター予測部126は、フレームメモリ122に格納された参照ピクチャであってカレントピクチャとは異なる参照ピクチャを参照してカレントブロックのインター予測(画面間予測ともいう)を行うことで、予測信号(インター予測信号)を生成する。インター予測は、カレントブロック又はカレントブロック内のカレントサブブロック(例えば4x4ブロック)の単位で行われる。例えば、インター予測部126は、カレントブロック又はカレントサブブロックについて参照ピクチャ内で動き探索(motion estimation)を行い、そのカレントブロック又はカレントサブブロックに最も一致する参照ブロック又はサブブロックを見つける。そして、インター予測部126は、参照ブロック又はサブブロックからカレントブロック又はサブブロックへの動き又は変化を補償する動き情報(例えば動きベクトル)を取得する。インター予測部126は、その動き情報に基づいて、動き補償(または動き予測)を行い、カレントブロック又はサブブロックのインター予測信号を生成する。インター予測部126は、生成されたインター予測信号を予測制御部128に出力する。
図15は、インター予測の基本的な流れの一例を示すフローチャートである。
図16は、動きベクトル導出の一例を示すフローチャートである。
図18は、動きベクトル導出の他の例を示すフローチャートである。MV導出のモード、すなわちインター予測モードには、複数のモードがあり、大きく分けて、差分MVを符号化するモードと、差分動きベクトルを符号化しないモードとがある。差分MVを符号化しないモードには、マージモード、FRUCモード、及びアフィンモード(具体的には、アフィンマージモード)がある。これらのモードの詳細については、後述するが、簡単には、マージモードは、周辺の符号化済みブロックから動きベクトルを選択することによって、カレントブロックのMVを導出するモードであり、FRUCモードは、符号化済み領域間で探索を行うことによって、カレントブロックのMVを導出するモードである。また、アフィンモードは、アフィン変換を想定して、カレントブロックを構成する複数のサブブロックそれぞれの動きベクトルを、カレントブロックのMVとして導出するモードである。
ノーマルインターモードは、候補MVによって示される参照ピクチャの領域から、カレントブロックの画像に類似するブロックに基づいて、カレントブロックのMVを導出するインター予測モードである。また、このノーマルインターモードでは、差分MVが符号化される。
マージモードは、候補MVリストから候補MVをカレントブロックのMVとして選択することによって、そのMVを導出するインター予測モードである。
動き情報は符号化装置側から信号化されずに、復号装置側で導出されてもよい。なお、上述のように、H.265/HEVC規格で規定されたマージモードが用いられてもよい。また例えば、復号装置側で動き探索を行うことにより動き情報が導出されてもよい。実施の形態において、復号装置側では、カレントブロックの画素値を用いずに動き探索が行われる。
第1パターンマッチングでは、異なる2つの参照ピクチャ内の2つのブロックであってカレントブロックの動き軌道(motion trajectory)に沿う2つのブロックの間でパターンマッチングが行われる。したがって、第1パターンマッチングでは、上述した候補の評価値の算出のための所定の領域として、カレントブロックの動き軌道に沿う他の参照ピクチャ内の領域が用いられる。所定の領域は、予め定められていてもよい。
第2パターンマッチング(テンプレートマッチング)では、カレントピクチャ内のテンプレート(カレントピクチャ内でカレントブロックに隣接するブロック(例えば上及び/又は左隣接ブロック))と参照ピクチャ内のブロックとの間でパターンマッチングが行われる。したがって、第2パターンマッチングでは、上述した候補の評価値の算出のための所定の領域として、カレントピクチャ内のカレントブロックに隣接するブロックが用いられる。
次に、複数の隣接ブロックの動きベクトルに基づいてサブブロック単位で動きベクトルを導出するアフィンモードについて説明する。このモードは、アフィン動き補償予測(affine motion compensation prediction)モードと呼ばれることがある。
図25Bは、3つの制御ポイントを有するアフィンモードにおけるサブブロック単位の動きベクトルの導出の一例を説明するための概念図である。図25Bにおいて、カレントブロックは、16の4x4サブブロックを含む。ここでは、隣接ブロックの動きベクトルに基づいてカレントブロックの左上角制御ポイントの動きベクトルv0が導出され、同様に、隣接ブロックの動きベクトルに基づいてカレントブロックの右上角制御ポイントの動きベクトルv1、隣接ブロックの動きベクトルに基づいてカレントブロックの左下角制御ポイントの動きベクトルv2が導出される。そして、以下の式(1B)により、3つの動きベクトルv0、v1及びv2が投影されてもよく、カレントブロック内の各サブブロックの動きベクトル(vx,vy)が導出されてもよい。
図26A、図26B及び図26Cは、アフィンマージモードを説明するための概念図である。
図28Aは、2つの制御ポイントを有するアフィンインターモードを説明するための概念図である。
異なる制御ポイント数(例えば、2つと3つ)のアフィンモードをCUレベルで切り替えて信号化する場合、符号化済みブロックとカレントブロックで制御ポイントの数が異なる場合がある。図30A及び図30Bは、符号化済みブロックとカレントブロックで制御ポイントの数が異なる場合の、制御ポイントの予測ベクトル導出方法を説明するための概念図である。
図31Aは、マージモード及びDMVRの関係を示すフローチャートである。
動き補償では、予測画像を生成し、その予測画像を補正するモードがある。そのモードは、例えば、後述のBIO及びOBMCである。
動き探索により得られたカレントブロックの動き情報だけでなく、隣接ブロックの動き情報も用いて、インター予測信号が生成されてもよい。具体的には、(参照ピクチャ内の)動き探索により得られた動き情報に基づく予測信号と、(カレントピクチャ内の)隣接ブロックの動き情報に基づく予測信号と、を重み付け加算することにより、カレントブロック内のサブブロック単位でインター予測信号が生成されてもよい。このようなインター予測(動き補償)は、OBMC(overlapped block motion compensation)と呼ばれることがある。
次に、動きベクトルを導出する方法について説明する。まず、等速直線運動を仮定したモデルに基づいて動きベクトルを導出するモードについて説明する。このモードは、BIO(bi-directional optical flow)モードと呼ばれることがある。
次に、LIC(local illumination compensation)処理を用いて予測画像(予測)を生成するモードの一例について説明する。
予測制御部128は、イントラ予測信号(イントラ予測部124から出力される信号)及びインター予測信号(インター予測部126から出力される信号)のいずれかを選択し、選択した信号を予測信号として減算部104及び加算部116に出力する。
図40は、符号化装置100の実装例を示すブロック図である。符号化装置100は、プロセッサa1及びメモリa2を備える。例えば、図1に示された符号化装置100の複数の構成要素は、図40に示されたプロセッサa1及びメモリa2によって実装される。
次に、例えば上記の符号化装置100から出力された符号化信号(符号化ビットストリーム)を復号可能な復号装置について説明する。図41は、実施の形態に係る復号装置200の機能構成を示すブロック図である。復号装置200は、動画像をブロック単位で復号する動画像復号装置である。
図42は、復号装置200による全体的な復号処理の一例を示すフローチャートである。
エントロピー復号部202は、符号化ビットストリームをエントロピー復号する。具体的には、エントロピー復号部202は、例えば、符号化ビットストリームから二値信号に算術復号する。そして、エントロピー復号部202は、二値信号を多値化(debinarize)する。エントロピー復号部202は、ブロック単位で量子化係数を逆量子化部204に出力する。エントロピー復号部202は、実施の形態におけるイントラ予測部216、インター予測部218及び予測制御部220に、符号化ビットストリーム(図1参照)に含まれている予測パラメータを出力してもよい。イントラ予測部216、インター予測部218及び予測制御部220は、符号化装置側におけるイントラ予測部124、インター予測部126及び予測制御部128で行われる処理と同じ予測処理を実行することができる。
逆量子化部204は、エントロピー復号部202からの入力である復号対象ブロック(以下、カレントブロックという)の量子化係数を逆量子化する。具体的には、逆量子化部204は、カレントブロックの量子化係数の各々について、当該量子化係数に対応する量子化パラメータに基づいて当該量子化係数を逆量子化する。そして、逆量子化部204は、カレントブロックの逆量子化された量子化係数(つまり変換係数)を逆変換部206に出力する。
逆変換部206は、逆量子化部204からの入力である変換係数を逆変換することにより予測誤差を復元する。
加算部208は、逆変換部206からの入力である予測誤差と予測制御部220からの入力である予測サンプルとを加算することによりカレントブロックを再構成する。そして、加算部208は、再構成されたブロックをブロックメモリ210及びループフィルタ部212に出力する。
ブロックメモリ210は、イントラ予測で参照されるブロックであって復号対象ピクチャ(以下、カレントピクチャという)内のブロックを格納するための記憶部である。具体的には、ブロックメモリ210は、加算部208から出力された再構成ブロックを格納する。
ループフィルタ部212は、加算部208によって再構成されたブロックにループフィルタを施し、フィルタされた再構成ブロックをフレームメモリ214及び表示装置等に出力する。
フレームメモリ214は、インター予測に用いられる参照ピクチャを格納するための記憶部であり、フレームバッファと呼ばれることもある。具体的には、フレームメモリ214は、ループフィルタ部212によってフィルタされた再構成ブロックを格納する。
図43は、復号装置200の予測処理部で行われる処理の一例を示すフローチャートである。なお、予測処理部は、イントラ予測部216、インター予測部218、及び予測制御部220の全てまたは一部の構成要素からなる。
イントラ予測部216は、符号化ビットストリームから読み解かれたイントラ予測モードに基づいて、ブロックメモリ210に格納されたカレントピクチャ内のブロックを参照してイントラ予測を行うことで、予測信号(イントラ予測信号)を生成する。具体的には、イントラ予測部216は、カレントブロックに隣接するブロックのサンプル(例えば輝度値、色差値)を参照してイントラ予測を行うことでイントラ予測信号を生成し、イントラ予測信号を予測制御部220に出力する。
インター予測部218は、フレームメモリ214に格納された参照ピクチャを参照して、カレントブロックを予測する。予測は、カレントブロック又はカレントブロック内のサブブロック(例えば4x4ブロック)の単位で行われる。例えば、インター予測部218は、符号化ビットストリーム(例えば、エントロピー復号部202から出力される予測パラメータ)から読み解かれた動き情報(例えば動きベクトル)を用いて動き補償を行うことでカレントブロック又はサブブロックのインター予測信号を生成し、インター予測信号を予測制御部220に出力する。
符号化ビットストリームから読み解かれた情報がノーマルインターモードを適用することを示す場合、インター予測部218は、符号化ストリームから読み解かれた情報に基づいて、MVを導出し、そのMVを用いて動き補償(予測)を行う。
予測制御部220は、イントラ予測信号及びインター予測信号のいずれかを選択し、選択した信号を予測信号として加算部208に出力する。全体的に、復号装置側の予測制御部220、イントラ予測部216及びインター予測部218の構成、機能、及び処理は、符号化装置側の予測制御部128、イントラ予測部124及びインター予測部126の構成、機能、及び処理と対応していてもよい。
図46は、復号装置200の実装例を示すブロック図である。復号装置200は、プロセッサb1及びメモリb2を備える。例えば、図41に示された復号装置200の複数の構成要素は、図46に示されたプロセッサb1及びメモリb2によって実装される。
各用語は一例として、以下のような定義であってもよい。
[第1態様]
以下では、代表して符号化装置100または復号装置200の動作を説明するが、復号装置200または符号化装置100の動作も同様である。
第1態様によれば、符号化装置100は、タイルグループヘッダでタイルグループシーケンス識別情報を通知する。これにより、復号装置200は、符号化装置100によりタイルグループの符号化順序が入れ替えられてピクチャが符号化されていた場合でも、依存タイルグループのタイルグループヘッダの情報を正しく取得できる可能性がある。
なお、本態様は、本開示における他の態様の少なくとも一部と組み合わせて実施してもよい。また、本態様のフローチャートに記載の一部の処理、本態様の装置の一部の構成、本態様のシンタックスの一部などを他の態様と組み合わせて実施してもよい。
第1態様では、タイルグループ単位でNALユニット化される場合の例について説明した。第2態様では、タイル単位でNALユニット化される場合の例について説明する。
第2態様の構成によれば、符号化装置100は、タイルヘッダでタイルグループ識別情報を通知する。これにより、復号装置200は、符号化装置100によりタイルの符号化順序が入れ替えられてピクチャが符号化されていた場合でも、依存タイルのタイルヘッダの情報を正しく取得できる可能性がある。
なお、本態様は、本開示における他の態様の少なくとも一部と組み合わせて実施してもよい。また、本態様のフローチャートに記載の一部の処理、本態様の装置の一部の構成、本態様のシンタックスの一部などを他の態様と組み合わせて実施してもよい。
ピクチャを分割するタイルは、さらに分割することができる場合がある。以下の第3態様では、符号化装置100(または復号装置200)は、ピクチャを2つ以上のタイルに分割して、分割したタイルの一部または1つ以上のタイルから構成される矩形形状のスライスごとに符号化(または復号)する場合について説明する。
第3態様によれば、符号化装置100は、ピクチャパラメータセットに、スライスの設定方法に関する情報の一部を含めず省略することができるので、符号量を削減できる可能性がある。
なお、本態様は、本開示における他の態様の少なくとも一部と組み合わせて実施してもよい。また、本態様のフローチャートに記載の一部の処理、本態様の装置の一部の構成、本態様のシンタックスの一部などを他の態様と組み合わせて実施してもよい。
以下の第4態様では、第3態様で説明した省略可能な情報(スライスの設定方法に関する情報の一部)が異なる場合の例について説明する。
第4態様によれば、符号化装置100は、ピクチャパラメータセットに、スライスの設定方法に関する情報の一部を含めず省略することができるので、符号量を削減できる可能性がある。
なお、本態様は、本開示における他の態様の少なくとも一部と組み合わせて実施してもよい。また、本態様のフローチャートに記載の一部の処理、本態様の装置の一部の構成、本態様のシンタックスの一部などを他の態様と組み合わせて実施してもよい。
以下の第5態様では、第3態様及び第4態様で説明した例と異なる例について説明する。
第5態様によれば、符号化装置100は、ピクチャパラメータセットに、スライスモードに関する情報の一部を含めず省略することができるので、符号量を削減できる可能性がある。
なお、本態様は、本開示における他の態様の少なくとも一部と組み合わせて実施してもよい。また、本態様のフローチャートに記載の一部の処理、本態様の装置の一部の構成、本態様のシンタックスの一部などを他の態様と組み合わせて実施してもよい。
以下の第6態様では、第5態様で説明した例と異なる例について説明する。
第6態様によれば、符号化装置100は、ピクチャパラメータセットに、ブリックの設定方法に関する情報の一部を含めず省略することができるので、符号量を削減できる可能性がある。
なお、本態様は、本開示における他の態様の少なくとも一部と組み合わせて実施してもよい。また、本態様のフローチャートに記載の一部の処理、本態様の装置の一部の構成、本態様のシンタックスの一部などを他の態様と組み合わせて実施してもよい。
図67は、実施の形態1に係る符号化装置100の実装例を示すブロック図である。符号化装置100は、回路160及びメモリ162を備える。例えば、図1に示された符号化装置100の複数の構成要素は、図67に示された回路160及びメモリ162によって実装される。
図69は、実施の形態1に係る復号装置200の実装例を示すブロック図である。復号装置200は、回路260及びメモリ262を備える。例えば、図41に示された復号装置200の複数の構成要素は、図69に示された回路260及びメモリ262によって実装される。
また、本実施の形態における符号化装置100及び復号装置200は、それぞれ、画像符号化装置及び画像復号装置として利用されてもよいし、動画像符号化装置及び動画像復号装置として利用されてもよい。
以上の各実施の形態において、機能的又は作用的なブロックの各々は、通常、MPU(micro proccessing unit)及びメモリ等によって実現可能である。また、機能ブロックの各々による処理は、ROM等の記録媒体に記録されたソフトウェア(プログラム)を読み出して実行するプロセッサなどのプログラム実行部として実現されてもよい。当該ソフトウェアは、配布されてもよい。当該ソフトウェアは、半導体メモリなどの様々な記録媒体に記録されてもよい。なお、各機能ブロックをハードウェア(専用回路)によって実現することも可能である。ハードウェア及びソフトウェアの様々な組み合わせが採用され得る。
図71は、コンテンツ配信サービスを実現する適切なコンテンツ供給システムex100の全体構成を示す図である。通信サービスの提供エリアを所望の大きさに分割し、各セル内にそれぞれ、図示された例における固定無線局である基地局ex106、ex107、ex108、ex109、ex110が設置されている。
また、ストリーミングサーバex103は複数のサーバ又は複数のコンピュータであって、データを分散して処理したり記録したり配信するものであってもよい。例えば、ストリーミングサーバex103は、CDN(Contents Delivery Network)により実現され、世界中に分散された多数のエッジサーバとエッジサーバ間をつなぐネットワークによりコンテンツ配信が実現されていてもよい。CDNでは、クライアントに応じて物理的に近いエッジサーバが動的に割り当てられ得る。そして、当該エッジサーバにコンテンツがキャッシュ及び配信されることで遅延を減らすことができる。また、いくつかのタイプのエラーが発生した場合又はトラフィックの増加などにより通信状態が変わる場合に複数のエッジサーバで処理を分散したり、他のエッジサーバに配信主体を切り替えたり、障害が生じたネットワークの部分を迂回して配信を続けることができるので、高速かつ安定した配信が実現できる。
互いにほぼ同期した複数のカメラex113及び/又はスマートフォンex115などの端末により撮影された異なるシーン、又は、同一シーンを異なるアングルから撮影した画像或いは映像を統合して利用することが増えてきている。各端末で撮影した映像は、別途取得した端末間の相対的な位置関係、又は、映像に含まれる特徴点が一致する領域などに基づいて統合され得る。
コンテンツの切り替えに関して、図72に示す、上記各実施の形態で示した動画像符号化方法を応用して圧縮符号化されたスケーラブルなストリームを用いて説明する。サーバは、個別のストリームとして内容は同じで質の異なるストリームを複数有していても構わないが、図示するようにレイヤに分けて符号化を行うことで実現される時間的/空間的スケーラブルなストリームの特徴を活かして、コンテンツを切り替える構成であってもよい。つまり、復号側が性能という内的要因と通信帯域の状態などの外的要因とに応じてどのレイヤを復号するかを決定することで、復号側は、低解像度のコンテンツと高解像度のコンテンツとを自由に切り替えて復号できる。例えばユーザが移動中にスマートフォンex115で視聴していた映像の続きを、例えば帰宅後にインターネットTV等の機器で視聴したい場合には、当該機器は、同じストリームを異なるレイヤまで復号すればよいので、サーバ側の負担を軽減できる。
図74は、コンピュータex111等におけるwebページの表示画面例を示す図である。図75は、スマートフォンex115等におけるwebページの表示画面例を示す図である。図74及び図75に示すようにwebページが、画像コンテンツへのリンクであるリンク画像を複数含む場合があり、閲覧するデバイスによってその見え方は異なっていてもよい。画面上に複数のリンク画像が見える場合には、ユーザが明示的にリンク画像を選択するまで、又は画面の中央付近にリンク画像が近付く或いはリンク画像の全体が画面内に入るまで、表示装置(復号装置)は、リンク画像として各コンテンツが有する静止画又はIピクチャを表示してもよいし、複数の静止画又はIピクチャ等でgifアニメのような映像を表示してもよいし、ベースレイヤのみを受信し、映像を復号及び表示してもよい。
また、車の自動走行又は走行支援のため2次元又は3次元の地図情報などのような静止画又は映像データを送受信する場合、受信端末は、1以上のレイヤに属する画像データに加えて、メタ情報として天候又は工事の情報なども受信し、これらを対応付けて復号してもよい。なお、メタ情報は、レイヤに属してもよいし、単に画像データと多重化されてもよい。
また、コンテンツ供給システムex100では、映像配信業者による高画質で長時間のコンテンツのみならず、個人による低画質で短時間のコンテンツのユニキャスト、又はマルチキャスト配信が可能である。このような個人のコンテンツは今後も増加していくと考えられる。個人コンテンツをより優れたコンテンツにするために、サーバは、編集処理を行ってから符号化処理を行ってもよい。これは、例えば、以下のような構成を用いて実現できる。
また、これらの符号化又は復号処理は、一般的に各端末が有するLSIex500において処理される。LSI(large scale integration circuitry)ex500(図71参照)は、ワンチップであっても複数チップからなる構成であってもよい。なお、動画像符号化又は復号用のソフトウェアをコンピュータex111等で読み取り可能な何らかの記録メディア(CD-ROM、フレキシブルディスク、又はハードディスクなど)に組み込み、そのソフトウェアを用いて符号化又は復号処理を行ってもよい。さらに、スマートフォンex115がカメラ付きである場合には、そのカメラで取得した動画データを送信してもよい。このときの動画データはスマートフォンex115が有するLSIex500で符号化処理されたデータであってもよい。
図76は、図71に示されたスマートフォンex115のさらに詳細を示す図である。また、図77は、スマートフォンex115の構成例を示す図である。スマートフォンex115は、基地局ex110との間で電波を送受信するためのアンテナex450と、映像及び静止画を撮ることが可能なカメラ部ex465と、カメラ部ex465で撮像した映像、及びアンテナex450で受信した映像等が復号されたデータを表示する表示部ex458とを備える。スマートフォンex115は、さらに、タッチパネル等である操作部ex466と、音声又は音響を出力するためのスピーカ等である音声出力部ex457と、音声を入力するためのマイク等である音声入力部ex456と、撮影した映像或いは静止画、録音した音声、受信した映像或いは静止画、メール等の符号化されたデータ、又は、復号化されたデータを保存可能なメモリ部ex467と、ユーザを特定し、ネットワークをはじめ各種データへのアクセスの認証をするためのSIMex468とのインタフェース部であるスロット部ex464とを備える。なお、メモリ部ex467の代わりに外付けメモリが用いられてもよい。
102 分割部
104 減算部
106 変換部
108 量子化部
110 エントロピー符号化部
112、204 逆量子化部
114、206 逆変換部
116、208 加算部
118、210 ブロックメモリ
120、212 ループフィルタ部
122、214 フレームメモリ
124、216 イントラ予測部
126、218 インター予測部
128、220 予測制御部
200 復号装置
202 エントロピー復号部
1201 境界判定部
1202、1204、1206 スイッチ
1203 フィルタ判定部
1205 フィルタ処理部
1207 フィルタ特性決定部
1208 処理判定部
a1、b1 プロセッサ
a2、b2 メモリ
Claims (12)
- 動画像を符号化する符号化装置であって、
回路と、
前記回路に接続されたメモリと、を備え、
前記回路は、動作において、
符号化対象のピクチャを2つ以上のタイルに分割し、
分割したタイルの一部または1つ以上のタイルから構成される矩形形状のスライスごとに符号化することで、前記ピクチャを符号化し、
前記ピクチャを符号化する際、前記ピクチャの右下角に位置するスライスが占める領域に関する情報をヘッダ情報に含めない、
符号化装置。 - 前記領域に関する情報は、前記スライスの右下角の位置を示す情報である、
請求項1に記載の符号化装置。 - 前記領域に関する情報は、前記スライスの左上角の位置及び右下角の位置を示す情報である、
請求項1に記載の符号化装置。 - 前記領域に関する情報は、シンタックスで表される情報である、
請求項1~3のいずれか1項に記載の符号化装置。 - 前記回路は、前記動作において、
前記ピクチャを符号化する際、前記ピクチャの先頭に位置するスライスの左上角の位置情報を、前記ピクチャの左上角の位置を示す情報としてヘッダ情報に含める、
請求項1~4のいずれか1項に記載の符号化装置。 - 動画像を復号する復号装置であって、
回路と、
前記回路に接続されたメモリと、を備え、
前記回路は、動作において、
復号対象のピクチャを2つ以上のタイルに分割し、
分割したタイルの一部または1つ以上のタイルから構成される矩形形状のスライスごとに復号することで、前記ピクチャを復号し、
前記ピクチャを復号する際、前記ピクチャの右下角に位置するスライスが占める領域に関する情報を、ヘッダ情報を用いない所定の方法で設定し、
前記領域に関する情報は、前記ヘッダ情報に含まれていない、
復号装置。 - 前記領域に関する情報は、前記スライスの右下角の位置を示す情報である、
請求項6に記載の復号装置。 - 前記領域に関する情報は、前記スライスの左上角の位置及び右下角の位置を示す情報である、
請求項6に記載の復号装置。 - 前記領域に関する情報は、シンタックスで表される情報である、
請求項6~8のいずれか1項に記載の復号装置。 - 前記回路は、前記動作において、
前記ピクチャを復号する際、前記ピクチャの先頭に位置するスライスの左上角の位置情報を、ヘッダ情報に含まれる前記ピクチャの左上角の位置を示す情報から復号する、
請求項6~9のいずれか1項に記載の復号装置。 - 動画像を符号化する符号化方法であって、
符号化対象のピクチャを2つ以上のタイルに分割し、
分割したタイルの一部または1つ以上のタイルから構成される矩形形状のスライスごとに符号化することで、前記ピクチャを符号化し、
前記ピクチャを符号化する際、前記ピクチャの右下角に位置するスライスが占める領域に関する情報をヘッダ情報に含めない、
符号化方法。 - 動画像を復号する復号方法であって、
復号対象のピクチャを2つ以上のタイルに分割し、
分割したタイルの一部または1つ以上のタイルから構成される矩形形状のスライスごとに復号することで、前記ピクチャを復号し、
前記ピクチャを復号する際、前記ピクチャの右下角に位置するスライスが占める領域に関する情報を、ヘッダ情報を用いない所定の方法で設定し、
前記領域に関する情報は、前記ヘッダ情報に含まれていない、
復号方法。
Priority Applications (14)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2020560059A JPWO2020116630A1 (ja) | 2018-12-07 | 2019-12-06 | 復号装置及び復号方法 |
MX2021004194A MX2021004194A (es) | 2018-12-07 | 2019-12-06 | Decodificador, y metodo de decodificacion. |
BR112021005443-0A BR112021005443A2 (pt) | 2018-12-07 | 2019-12-06 | codificador, decodificador, método de codificação, e método de decodificação |
CN202410432963.2A CN118200565A (zh) | 2018-12-07 | 2019-12-06 | 编码装置、解码装置和非暂时性的计算机可读介质 |
CN202410432959.6A CN118200564A (zh) | 2018-12-07 | 2019-12-06 | 编码装置、解码装置和非暂时性的计算机可读介质 |
KR1020217013690A KR20210093877A (ko) | 2018-12-07 | 2019-12-06 | 부호화 장치, 복호 장치, 부호화 방법 및 복호 방법 |
CN202410432957.7A CN118200563A (zh) | 2018-12-07 | 2019-12-06 | 编码装置、解码装置和非暂时性的计算机可读介质 |
CN201980073220.8A CN112997502B (zh) | 2018-12-07 | 2019-12-06 | 编码装置、解码装置、编码方法和解码方法 |
CN202410432954.3A CN118200562A (zh) | 2018-12-07 | 2019-12-06 | 编码装置、解码装置和非暂时性的计算机可读介质 |
CN202410432964.7A CN118200566A (zh) | 2018-12-07 | 2019-12-06 | 编码装置、解码装置、编码方法和解码方法 |
US17/241,670 US11388429B2 (en) | 2018-12-07 | 2021-04-27 | Decoder and decoding method |
US17/833,986 US11812045B2 (en) | 2018-12-07 | 2022-06-07 | Decoder and decoding method |
US18/368,642 US20240007661A1 (en) | 2018-12-07 | 2023-09-15 | Decoder and decoding method |
JP2023174437A JP2023168625A (ja) | 2018-12-07 | 2023-10-06 | 復号装置及び復号方法 |
Applications Claiming Priority (8)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US201862776792P | 2018-12-07 | 2018-12-07 | |
US201862776780P | 2018-12-07 | 2018-12-07 | |
US62/776,792 | 2018-12-07 | ||
US62/776,780 | 2018-12-07 | ||
US201962808540P | 2019-02-21 | 2019-02-21 | |
US62/808,540 | 2019-02-21 | ||
US201962839033P | 2019-04-26 | 2019-04-26 | |
US62/839,033 | 2019-04-26 |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US17/241,670 Continuation US11388429B2 (en) | 2018-12-07 | 2021-04-27 | Decoder and decoding method |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2020116630A1 true WO2020116630A1 (ja) | 2020-06-11 |
Family
ID=70973918
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2019/047886 WO2020116630A1 (ja) | 2018-12-07 | 2019-12-06 | 符号化装置、復号装置、符号化方法及び復号方法 |
Country Status (8)
Country | Link |
---|---|
US (3) | US11388429B2 (ja) |
JP (2) | JPWO2020116630A1 (ja) |
KR (1) | KR20210093877A (ja) |
CN (6) | CN118200565A (ja) |
BR (1) | BR112021005443A2 (ja) |
MX (1) | MX2021004194A (ja) |
TW (1) | TW202029764A (ja) |
WO (1) | WO2020116630A1 (ja) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112572796A (zh) * | 2020-12-23 | 2021-03-30 | 姜敬伟 | 一种基于互联网水利用可多处水源取样的无人机 |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
BR112021010326A2 (pt) * | 2018-11-30 | 2021-08-24 | Sharp Kabushiki Kaisha | Método de decodificar dados de vídeo, método de codificar dados de vídeo e dispositivo para decodificar dados de vídeo |
CN113228519A (zh) * | 2018-12-14 | 2021-08-06 | 华为技术有限公司 | 任意和环绕分块分组 |
CN112789860A (zh) | 2019-04-17 | 2021-05-11 | 株式会社 Xris | 用于对图像信号进行编码/解码的方法及其装置 |
CN113439439A (zh) * | 2019-12-17 | 2021-09-24 | 株式会社 Xris | 用于对图像信号进行编码/解码的方法及其装置 |
Family Cites Families (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103281527B (zh) * | 2010-04-15 | 2015-12-23 | 华为技术有限公司 | 图像编解码方法及相关装置 |
US8718389B2 (en) * | 2011-04-13 | 2014-05-06 | Huawei Technologies Co., Ltd. | Image encoding and decoding methods and related devices |
US9584819B2 (en) | 2011-10-24 | 2017-02-28 | Qualcomm Incorporated | Grouping of tiles for video coding |
US10244246B2 (en) * | 2012-02-02 | 2019-03-26 | Texas Instruments Incorporated | Sub-pictures for pixel rate balancing on multi-core platforms |
JP6214235B2 (ja) | 2012-07-02 | 2017-10-18 | キヤノン株式会社 | ファイル生成方法、ファイル生成装置、及びプログラム |
CN104584555B (zh) * | 2012-09-26 | 2018-07-17 | 太阳专利托管公司 | 图像解码方法、图像解码装置 |
ES2716579T3 (es) * | 2012-09-26 | 2019-06-13 | Velos Media Int Ltd | Procedimiento de decodificación de imágenes y aparato de decodificación de imágenes |
WO2014156708A1 (ja) * | 2013-03-29 | 2014-10-02 | ソニー株式会社 | 画像復号装置および方法 |
JP6363088B2 (ja) | 2013-10-08 | 2018-07-25 | シャープ株式会社 | 画像復号装置、画像復号方法、画像符号化装置、および画像符号化方法 |
US9998739B2 (en) * | 2015-03-06 | 2018-06-12 | Qualcomm Incorporated | Optimization for encoding video data using non-square partitions |
US10542258B2 (en) * | 2016-01-25 | 2020-01-21 | Google Llc | Tile copying for video compression |
CN108510441B (zh) * | 2018-03-19 | 2022-03-08 | 东南大学 | 一种基于交错网格的影像多分辨率显示方法 |
CN112236998A (zh) * | 2019-01-02 | 2021-01-15 | 株式会社 Xris | 用于对视频信号进行编码/解码的方法及其装置 |
WO2020197290A1 (ko) * | 2019-03-26 | 2020-10-01 | 인텔렉추얼디스커버리 주식회사 | 영상 부호화/복호화 방법 및 장치 |
CN112789860A (zh) * | 2019-04-17 | 2021-05-11 | 株式会社 Xris | 用于对图像信号进行编码/解码的方法及其装置 |
-
2019
- 2019-12-06 CN CN202410432963.2A patent/CN118200565A/zh active Pending
- 2019-12-06 CN CN202410432957.7A patent/CN118200563A/zh active Pending
- 2019-12-06 MX MX2021004194A patent/MX2021004194A/es unknown
- 2019-12-06 CN CN202410432959.6A patent/CN118200564A/zh active Pending
- 2019-12-06 JP JP2020560059A patent/JPWO2020116630A1/ja active Pending
- 2019-12-06 KR KR1020217013690A patent/KR20210093877A/ko unknown
- 2019-12-06 TW TW108144786A patent/TW202029764A/zh unknown
- 2019-12-06 BR BR112021005443-0A patent/BR112021005443A2/pt unknown
- 2019-12-06 CN CN201980073220.8A patent/CN112997502B/zh active Active
- 2019-12-06 CN CN202410432964.7A patent/CN118200566A/zh active Pending
- 2019-12-06 WO PCT/JP2019/047886 patent/WO2020116630A1/ja active Application Filing
- 2019-12-06 CN CN202410432954.3A patent/CN118200562A/zh active Pending
-
2021
- 2021-04-27 US US17/241,670 patent/US11388429B2/en active Active
-
2022
- 2022-06-07 US US17/833,986 patent/US11812045B2/en active Active
-
2023
- 2023-09-15 US US18/368,642 patent/US20240007661A1/en active Pending
- 2023-10-06 JP JP2023174437A patent/JP2023168625A/ja active Pending
Non-Patent Citations (5)
Title |
---|
BORDES, PHILIPPE ET AL.: "AHG17: On brick index signalling", JOINT VIDEO EXPERTS TEAM (JVET) OF ITU-T SG 16 WP 3 AND ISO/IEC JTC 1/SC 29/WG 11 15TH MEETING, no. JVET-O0403-v1, 25 June 2019 (2019-06-25), Gothenburg, SE, XP030219465 * |
CHOI, BYEONGDOO ET AL.: "AHG12: Improvements on Slice, Tile and Brick signaling", JOINT VIDEO EXPERTS TEAM (JVET) OF ITU-T SG 16 WP 3 AND ISO/IEC JTC 1/SC 29/WG 11 15TH MEETING, no. JVET-O0338-v2, 2 July 2019 (2019-07-02), Gothenburg, SE, XP030219289 * |
DRUGEON, VIRGINIE ET AL.: "AHG17: On signalling of bottom right brick for rectangular slices", JOINT VIDEO EXPERTS TEAM (JVET) OF ITU-T SG 16 WP 3 AND ISO/IEC JTC 1/SC 29/WG 11 15TH MEETING, no. JVET-O0225, 28 June 2019 (2019-06-28), Gothenburg, SE, XP030218904 * |
LIM, WOONG ET AL.: "AHG12: On brick signaling", JOINT VIDEO EXPERTS TEAM (JVET) OF ITU-T SG 16 WP 3 AND ISO/IEC JTC 1/SC 29/WG 11 15TH MEETING, no. JVET-O0156-v1, 20 June 2019 (2019-06-20), Gothenburg, SE, XP030205717 * |
SJÖBERG, RICKARD ET AL.: "Tile groups for VVC", JOINT VIDEO EXPERTS TEAM (JVET) OF ITU-T SG 16 WP 3 AND ISO/IEC JTC 1/SC 29/WG 11 12TH MEETING, no. JVET-L0415-v1, 25 September 2018 (2018-09-25), Macao, CN, XP030193912 * |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112572796A (zh) * | 2020-12-23 | 2021-03-30 | 姜敬伟 | 一种基于互联网水利用可多处水源取样的无人机 |
CN112572796B (zh) * | 2020-12-23 | 2022-10-18 | 南京拓恒无人***研究院有限公司 | 一种基于互联网水利用可多处水源取样的无人机 |
Also Published As
Publication number | Publication date |
---|---|
CN118200562A (zh) | 2024-06-14 |
US20220312025A1 (en) | 2022-09-29 |
CN118200565A (zh) | 2024-06-14 |
US11812045B2 (en) | 2023-11-07 |
US11388429B2 (en) | 2022-07-12 |
CN118200566A (zh) | 2024-06-14 |
CN112997502B (zh) | 2024-04-26 |
CN118200564A (zh) | 2024-06-14 |
JP2023168625A (ja) | 2023-11-24 |
MX2021004194A (es) | 2021-05-27 |
CN112997502A (zh) | 2021-06-18 |
JPWO2020116630A1 (ja) | 2021-10-07 |
CN118200563A (zh) | 2024-06-14 |
US20210250598A1 (en) | 2021-08-12 |
BR112021005443A2 (pt) | 2021-06-15 |
US20240007661A1 (en) | 2024-01-04 |
TW202029764A (zh) | 2020-08-01 |
KR20210093877A (ko) | 2021-07-28 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2020166643A1 (ja) | 符号化装置、復号装置、符号化方法、および復号方法 | |
JP7304404B2 (ja) | 符号化装置、復号装置、符号化方法及び復号方法 | |
JP7389283B2 (ja) | 符号化装置及び復号装置 | |
JP7202394B2 (ja) | 符号化装置、復号装置、符号化方法及び復号方法 | |
WO2020116630A1 (ja) | 符号化装置、復号装置、符号化方法及び復号方法 | |
WO2020141591A1 (ja) | 符号化装置、復号装置、符号化方法、及び復号方法 | |
JP7189234B2 (ja) | 符号化装置及び復号装置 | |
WO2019240050A1 (ja) | 符号化装置、復号装置、符号化方法および復号方法 | |
JP7337222B2 (ja) | 符号化装置及び復号装置 | |
JP2023017026A (ja) | 非一時的記憶媒体 | |
JP2022168052A (ja) | 復号装置及び符号化装置 | |
WO2020116242A1 (ja) | 符号化装置、復号装置、符号化方法及び復号方法 | |
JP2023001298A (ja) | 復号装置及び復号方法 | |
JP7079377B2 (ja) | 符号化装置、復号装置、符号化方法、および復号方法 | |
WO2020235586A1 (ja) | 符号化装置、復号装置、符号化方法及び復号方法 | |
WO2020179715A1 (ja) | 符号化装置、復号装置、符号化方法及び復号方法 | |
WO2020121879A1 (ja) | 符号化装置、復号装置、符号化方法、および復号方法 | |
JP7482864B2 (ja) | 符号化装置、復号装置、符号化方法、および復号方法 | |
WO2020171224A1 (ja) | 符号化装置、復号装置、符号化方法及び復号方法 | |
WO2020256048A1 (ja) | 符号化装置、復号装置、符号化方法、および復号方法 | |
WO2021006196A1 (ja) | 符号化装置、復号装置、符号化方法、および復号方法 | |
WO2021025080A1 (ja) | 符号化装置、復号装置、符号化方法、および復号方法 | |
WO2020122232A1 (ja) | 符号化装置、復号装置、符号化方法、および復号方法 | |
WO2020085400A1 (ja) | 符号化装置、復号装置、符号化方法及び復号方法 |
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: 19893317 Country of ref document: EP Kind code of ref document: A1 |
|
ENP | Entry into the national phase |
Ref document number: 2020560059 Country of ref document: JP Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: 122021017386 Country of ref document: BR |
|
REG | Reference to national code |
Ref country code: BR Ref legal event code: B01A Ref document number: 112021005443 Country of ref document: BR |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
ENP | Entry into the national phase |
Ref document number: 112021005443 Country of ref document: BR Kind code of ref document: A2 Effective date: 20210322 |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 19893317 Country of ref document: EP Kind code of ref document: A1 |