WO2018221946A1 - Procédé et dispositif de traitement de signal vidéo - Google Patents

Procédé et dispositif de traitement de signal vidéo Download PDF

Info

Publication number
WO2018221946A1
WO2018221946A1 PCT/KR2018/006119 KR2018006119W WO2018221946A1 WO 2018221946 A1 WO2018221946 A1 WO 2018221946A1 KR 2018006119 W KR2018006119 W KR 2018006119W WO 2018221946 A1 WO2018221946 A1 WO 2018221946A1
Authority
WO
WIPO (PCT)
Prior art keywords
quantization parameter
region
block
related information
unit
Prior art date
Application number
PCT/KR2018/006119
Other languages
English (en)
Korean (ko)
Inventor
이배근
Original Assignee
주식회사 케이티
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 주식회사 케이티 filed Critical 주식회사 케이티
Publication of WO2018221946A1 publication Critical patent/WO2018221946A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/124—Quantisation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/167—Position within a video image, e.g. region of interest [ROI]
    • 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/189—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding
    • H04N19/196—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding being specially adapted for the computation of encoding parameters, e.g. by averaging previously computed encoding parameters
    • 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/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/597—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding specially adapted for multi-view video sequence encoding
    • 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

Definitions

  • the present invention relates to a video signal processing method and apparatus.
  • High efficiency image compression techniques can be used to solve these problems caused by high resolution and high quality image data.
  • An inter-screen prediction technique for predicting pixel values included in the current picture from a picture before or after the current picture using an image compression technique an intra prediction technique for predicting pixel values included in a current picture using pixel information in the current picture
  • An object of the present invention is to improve the encoding / decoding efficiency of 360-degree video by providing a method for determining a quantization parameter suitable for an attribute of a region.
  • the image decoding method and apparatus divide a 360 degree projection image into a plurality of areas including a current area, determine quantization parameter related information of the current area based on the location of the current area, The quantization parameter of the current region or blocks included in the current region may be determined using the quantization parameter related information.
  • the image encoding method and apparatus divide a 360 degree projection image into a plurality of areas including a current area, determine quantization parameter related information of the current area based on the location of the current area, The quantization parameter of the current region or blocks included in the current region may be determined using the quantization parameter related information.
  • the quantization parameter related information may be determined based on at least one of x-axis coordinates or y-axis coordinates of a specific sample in the current region.
  • the specific sample may be located at the upper left corner, the lower left corner, the lower right corner, or the center of the current area.
  • a coordinate reference axis of the specific sample may be adaptively determined according to the shape of the current region or the position of a face to which the current region belongs.
  • the quantization parameter related information is obtained in units of a sub region, and the quantization parameter related information of a second sub region included in the current region is included in the current region. It can be obtained by adding or subtracting an offset to the quantization parameter of the first sub-region.
  • the quantization parameter may be obtained by adding or subtracting an offset derived based on the quantization parameter related information to a quantization parameter of a specific level.
  • the quantization parameter of a block adjacent to a face boundary among the blocks included in the current region may be determined by subtracting a predetermined offset from the determined quantization parameter.
  • the quantization parameter of a block adjacent to a tile boundary among the blocks included in the current region may be set to be the same as the quantization parameter of the neighboring block included in the neighboring tile.
  • the 360-degree projection image may be divided into a plurality of regions based on a coding tree unit (CTU) row, a CTU column, a face, or a block unit.
  • CTU coding tree unit
  • the encoding / decoding efficiency of a 360 degree video can be improved by determining the quantization parameter suitable for the attribute of the region.
  • the quantization parameter variably according to the position of the region, it is possible to improve the encoding / decoding efficiency of 360 degree non-degree.
  • FIG. 1 is a block diagram illustrating an image encoding apparatus according to an embodiment of the present invention.
  • FIG. 2 is a block diagram illustrating an image decoding apparatus according to an embodiment of the present invention.
  • FIG. 3 is a diagram illustrating a partition mode that can be applied to a coding block when the coding block is encoded by inter-screen prediction.
  • 4 to 6 are diagrams illustrating a camera apparatus for generating a panoramic image.
  • FIG. 7 is a block diagram of a 360 degree video data generating device and a 360 degree video playing device.
  • FIG. 8 is a flowchart illustrating operations of a 360 degree video data generating device and a 360 degree video playing device.
  • FIG. 10 illustrates a 2D projection method using a cube projection technique.
  • FIG. 11 illustrates a 2D projection method using a icosahedron projection technique.
  • FIG. 12 illustrates a 2D projection method using an octahedron projection technique.
  • FIG. 13 illustrates a 2D projection method using a truncated pyramid projection technique.
  • 14 is a diagram for explaining the conversion between the face 2D coordinates and the three-dimensional coordinates.
  • FIG. 15 is a diagram for describing a face index of a 360 degree projection image based on CMP.
  • 16 is a diagram for explaining a viewport mode.
  • 17 is a diagram illustrating an example in which a position and a size of a view port are specified.
  • 18 is a diagram illustrating syntax associated with a viewport encoded in a bitstream.
  • 19 is a diagram illustrating an example in which a syntax indicating the number of view ports is encoded.
  • 20 is a flowchart illustrating a process of obtaining a residual sample in a decoder according to an embodiment to which the present invention is applied.
  • 21 is a flowchart illustrating a process of obtaining a quantization parameter according to an embodiment to which the present invention is applied.
  • FIG. 22 is a diagram for explaining an example of deriving a quantization parameter using position quantization parameter weight.
  • FIG. 23 is a diagram illustrating the position of a sample used to derive position quantization parameter weights.
  • FIG. 26 illustrates an example in which position quantization parameter weights are set differently for each subregion.
  • FIG. 27 illustrates an example in which a position of a specific sample used to derive position quantization parameter weights is variably determined according to a position of a face.
  • FIG. 28 is a diagram illustrating an example in which quantization parameters are differently set according to the position of a block.
  • 29 is a diagram for describing an example of determining a quantization parameter of blocks adjacent to a tile boundary.
  • FIG. 30 is a diagram illustrating an example in which a syntax indicating an initial quantization parameter value of a view port is encoded.
  • first and second may be used to describe various components, but the components should not be limited by the terms. The terms are used only for the purpose of distinguishing one component from another.
  • the first component may be referred to as the second component, and similarly, the second component may also be referred to as the first component.
  • FIG. 1 is a block diagram illustrating an image encoding apparatus according to an embodiment of the present invention.
  • the image encoding apparatus 100 may include a picture splitter 110, a predictor 120 and 125, a transformer 130, a quantizer 135, a realigner 160, and an entropy encoder. 165, an inverse quantizer 140, an inverse transformer 145, a filter 150, and a memory 155.
  • each of the components shown in FIG. 1 is independently illustrated to represent different characteristic functions in the image encoding apparatus, and does not mean that each of the components is made of separate hardware or one software component unit.
  • each component is included in each component for convenience of description, and at least two of the components may be combined into one component, or one component may be divided into a plurality of components to perform a function.
  • Integrated and separate embodiments of the components are also included within the scope of the present invention without departing from the spirit of the invention.
  • the components may not be essential components for performing essential functions in the present invention, but may be optional components for improving performance.
  • the present invention can be implemented including only the components essential for implementing the essentials of the present invention except for the components used for improving performance, and the structure including only the essential components except for the optional components used for improving performance. Also included in the scope of the present invention.
  • the picture dividing unit 110 may divide the input picture into at least one processing unit.
  • the processing unit may be a prediction unit (PU), a transform unit (TU), or a coding unit (CU).
  • the picture dividing unit 110 divides one picture into a combination of a plurality of coding units, prediction units, and transformation units, and combines one coding unit, prediction unit, and transformation unit on a predetermined basis (eg, a cost function). You can select to encode the picture.
  • one picture may be divided into a plurality of coding units.
  • a recursive tree structure such as a quad tree structure may be used, and coding is divided into other coding units by using one image or a largest coding unit as a root.
  • the unit may be split with as many child nodes as the number of split coding units. Coding units that are no longer split according to certain restrictions become leaf nodes. That is, when it is assumed that only square division is possible for one coding unit, one coding unit may be split into at most four other coding units.
  • a coding unit may be used as a unit for encoding or may be used as a unit for decoding.
  • the prediction unit may be split in the form of at least one square or rectangle having the same size in one coding unit, or the prediction unit of any one of the prediction units split in one coding unit is different from one another. It may be divided to have a different shape and / or size than the unit.
  • the intra prediction may be performed without splitting into a plurality of prediction units NxN.
  • the predictors 120 and 125 may include an inter predictor 120 that performs inter prediction and an intra predictor 125 that performs intra prediction. Whether to use inter prediction or intra prediction on the prediction unit may be determined, and specific information (eg, an intra prediction mode, a motion vector, a reference picture, etc.) according to each prediction method may be determined. In this case, the processing unit in which the prediction is performed may differ from the processing unit in which the prediction method and the details are determined. For example, the method of prediction and the prediction mode may be determined in the prediction unit, and the prediction may be performed in the transform unit. The residual value (residual block) between the generated prediction block and the original block may be input to the transformer 130.
  • specific information eg, an intra prediction mode, a motion vector, a reference picture, etc.
  • prediction mode information and motion vector information used for prediction may be encoded by the entropy encoder 165 together with the residual value and transmitted to the decoder.
  • the original block may be encoded as it is and transmitted to the decoder without generating the prediction block through the prediction units 120 and 125.
  • the inter prediction unit 120 may predict the prediction unit based on the information of at least one of the previous picture or the next picture of the current picture. In some cases, the inter prediction unit 120 may predict the prediction unit based on the information of the partial region in which the encoding is completed in the current picture. You can also predict units.
  • the inter predictor 120 may include a reference picture interpolator, a motion predictor, and a motion compensator.
  • the reference picture interpolator may receive reference picture information from the memory 155 and generate pixel information of an integer pixel or less in the reference picture.
  • a DCT based 8-tap interpolation filter having different filter coefficients may be used to generate pixel information of integer pixels or less in units of 1/4 pixels.
  • a DCT-based interpolation filter having different filter coefficients may be used to generate pixel information of an integer pixel or less in units of 1/8 pixels.
  • the motion predictor may perform motion prediction based on the reference picture interpolated by the reference picture interpolator.
  • various methods such as full search-based block matching algorithm (FBMA), three step search (TSS), and new three-step search algorithm (NTS) may be used.
  • FBMA full search-based block matching algorithm
  • TSS three step search
  • NTS new three-step search algorithm
  • the motion vector may have a motion vector value of 1/2 or 1/4 pixel units based on the interpolated pixels.
  • the motion prediction unit may predict the current prediction unit by using a different motion prediction method.
  • various methods such as a skip method, a merge method, an advanced motion vector prediction (AMVP) method, an intra block copy method, and the like may be used.
  • AMVP advanced motion vector prediction
  • the intra predictor 125 may generate a prediction unit based on reference pixel information around the current block, which is pixel information in the current picture. If the neighboring block of the current prediction unit is a block that has performed inter prediction, and the reference pixel is a pixel that has performed inter prediction, the reference pixel of the block that has performed intra prediction around the reference pixel included in the block where the inter prediction has been performed Can be used as a substitute for information. That is, when the reference pixel is not available, the unavailable reference pixel information may be replaced with at least one reference pixel among the available reference pixels.
  • a prediction mode may have a directional prediction mode using reference pixel information according to a prediction direction, and a non-directional mode using no directional information when performing prediction.
  • the mode for predicting the luminance information and the mode for predicting the color difference information may be different, and the intra prediction mode information or the predicted luminance signal information used for predicting the luminance information may be utilized to predict the color difference information.
  • intra prediction When performing intra prediction, if the size of the prediction unit and the size of the transform unit are the same, the intra prediction on the prediction unit is performed based on the pixels on the left of the prediction unit, the pixels on the upper left, and the pixels on the top. Can be performed. However, when performing intra prediction, if the size of the prediction unit is different from that of the transform unit, intra prediction may be performed using a reference pixel based on the transform unit. In addition, intra prediction using NxN division may be used only for a minimum coding unit.
  • the intra prediction method may generate a prediction block after applying an adaptive intra smoothing (AIS) filter to a reference pixel according to a prediction mode.
  • AIS adaptive intra smoothing
  • the type of AIS filter applied to the reference pixel may be different.
  • the intra prediction mode of the current prediction unit may be predicted from the intra prediction mode of the prediction unit existing around the current prediction unit.
  • the prediction mode of the current prediction unit is predicted by using the mode information predicted from the neighboring prediction unit, if the intra prediction mode of the current prediction unit and the neighboring prediction unit is the same, the current prediction unit and the neighboring prediction unit using the predetermined flag information If the prediction modes of the current prediction unit and the neighboring prediction unit are different, entropy encoding may be performed to encode the prediction mode information of the current block.
  • a residual block may include a prediction unit performing prediction based on the prediction units generated by the prediction units 120 and 125 and residual information including residual information that is a difference from an original block of the prediction unit.
  • the generated residual block may be input to the transformer 130.
  • the transform unit 130 converts the residual block including residual information of the original block and the prediction unit generated by the prediction units 120 and 125 into a discrete cosine transform (DCT), a discrete sine transform (DST), and a KLT. You can convert using the same conversion method. Whether to apply DCT, DST, or KLT to transform the residual block may be determined based on intra prediction mode information of the prediction unit used to generate the residual block.
  • DCT discrete cosine transform
  • DST discrete sine transform
  • KLT KLT
  • the quantization unit 135 may quantize the values converted by the transformer 130 into the frequency domain.
  • the quantization coefficient may change depending on the block or the importance of the image.
  • the value calculated by the quantization unit 135 may be provided to the inverse quantization unit 140 and the reordering unit 160.
  • the reordering unit 160 may reorder coefficient values with respect to the quantized residual value.
  • the reordering unit 160 may change the two-dimensional block shape coefficients into a one-dimensional vector form through a coefficient scanning method. For example, the reordering unit 160 may scan from DC coefficients to coefficients in the high frequency region by using a Zig-Zag scan method and change them into one-dimensional vectors.
  • a vertical scan that scans two-dimensional block shape coefficients in a column direction instead of a zig-zag scan may be used, and a horizontal scan that scans two-dimensional block shape coefficients in a row direction. That is, according to the size of the transform unit and the intra prediction mode, it is possible to determine which scan method among the zig-zag scan, the vertical scan, and the horizontal scan is used.
  • the entropy encoder 165 may perform entropy encoding based on the values calculated by the reordering unit 160. Entropy encoding may use various encoding methods such as, for example, Exponential Golomb, Context-Adaptive Variable Length Coding (CAVLC), and Context-Adaptive Binary Arithmetic Coding (CABAC).
  • Entropy encoding may use various encoding methods such as, for example, Exponential Golomb, Context-Adaptive Variable Length Coding (CAVLC), and Context-Adaptive Binary Arithmetic Coding (CABAC).
  • the entropy encoder 165 receives residual value coefficient information, block type information, prediction mode information, partition unit information, prediction unit information, transmission unit information, and motion of the coding unit from the reordering unit 160 and the prediction units 120 and 125.
  • Various information such as vector information, reference frame information, interpolation information of a block, and filtering information can be encoded.
  • the entropy encoder 165 may entropy encode a coefficient value of a coding unit input from the reordering unit 160.
  • the inverse quantizer 140 and the inverse transformer 145 inverse quantize the quantized values in the quantizer 135 and inversely transform the transformed values in the transformer 130.
  • the residual value generated by the inverse quantizer 140 and the inverse transformer 145 is reconstructed by combining the prediction units predicted by the motion estimator, the motion compensator, and the intra predictor included in the predictors 120 and 125. You can create a Reconstructed Block.
  • the filter unit 150 may include at least one of a deblocking filter, an offset correction unit, and an adaptive loop filter (ALF).
  • a deblocking filter may include at least one of a deblocking filter, an offset correction unit, and an adaptive loop filter (ALF).
  • ALF adaptive loop filter
  • the deblocking filter may remove block distortion caused by boundaries between blocks in the reconstructed picture.
  • it may be determined whether to apply a deblocking filter to the current block based on the pixels included in several columns or rows included in the block.
  • a strong filter or a weak filter may be applied according to the required deblocking filtering strength.
  • horizontal filtering and vertical filtering may be performed in parallel when vertical filtering and horizontal filtering are performed.
  • the offset correction unit may correct the offset with respect to the original image on a pixel-by-pixel basis for the deblocking image.
  • the pixels included in the image are divided into a predetermined number of areas, and then, an area to be offset is determined, an offset is applied to the corresponding area, or offset considering the edge information of each pixel. You can use this method.
  • Adaptive Loop Filtering may be performed based on a value obtained by comparing the filtered reconstructed image with the original image. After dividing the pixels included in the image into a predetermined group, one filter to be applied to the group may be determined and filtering may be performed for each group. For information related to whether to apply ALF, a luminance signal may be transmitted for each coding unit (CU), and the shape and filter coefficient of an ALF filter to be applied may vary according to each block. In addition, regardless of the characteristics of the block to be applied, the same type (fixed form) of the ALF filter may be applied.
  • ALF Adaptive Loop Filtering
  • the memory 155 may store the reconstructed block or picture calculated by the filter unit 150, and the stored reconstructed block or picture may be provided to the predictors 120 and 125 when performing inter prediction.
  • FIG. 2 is a block diagram illustrating an image decoding apparatus according to an embodiment of the present invention.
  • the image decoder 200 includes an entropy decoder 210, a reordering unit 215, an inverse quantizer 220, an inverse transformer 225, a predictor 230, 235, and a filter unit ( 240, a memory 245 may be included.
  • the input bitstream may be decoded by a procedure opposite to that of the image encoder.
  • the entropy decoder 210 may perform entropy decoding in a procedure opposite to that of the entropy encoding performed by the entropy encoder of the image encoder. For example, various methods such as Exponential Golomb, Context-Adaptive Variable Length Coding (CAVLC), and Context-Adaptive Binary Arithmetic Coding (CABAC) may be applied to the method performed by the image encoder.
  • various methods such as Exponential Golomb, Context-Adaptive Variable Length Coding (CAVLC), and Context-Adaptive Binary Arithmetic Coding (CABAC) may be applied to the method performed by the image encoder.
  • the entropy decoder 210 may decode information related to intra prediction and inter prediction performed by the encoder.
  • the reordering unit 215 may reorder the entropy decoded bitstream by the entropy decoding unit 210 based on a method of rearranging the bitstream. Coefficients expressed in the form of a one-dimensional vector may be reconstructed by reconstructing the coefficients in a two-dimensional block form.
  • the reordering unit 215 may be realigned by receiving information related to coefficient scanning performed by the encoder and performing reverse scanning based on the scanning order performed by the corresponding encoder.
  • the inverse quantization unit 220 may perform inverse quantization based on the quantization parameter provided by the encoder and the coefficient values of the rearranged block.
  • the inverse transform unit 225 may perform an inverse transform, i.e., an inverse DCT, an inverse DST, and an inverse KLT, for a quantization result performed by the image encoder, that is, a DCT, DST, and KLT. Inverse transformation may be performed based on a transmission unit determined by the image encoder.
  • the inverse transform unit 225 of the image decoder may selectively perform a transform scheme (eg, DCT, DST, KLT) according to a plurality of pieces of information such as a prediction method, a size of a current block, and a prediction direction.
  • a transform scheme eg, DCT, DST, KLT
  • the prediction units 230 and 235 may generate the prediction block based on the prediction block generation related information provided by the entropy decoder 210 and previously decoded blocks or picture information provided by the memory 245.
  • Intra prediction is performed on a prediction unit based on a pixel, but when intra prediction is performed, when the size of the prediction unit and the size of the transformation unit are different, intra prediction may be performed using a reference pixel based on the transformation unit. Can be. In addition, intra prediction using NxN division may be used only for a minimum coding unit.
  • the predictors 230 and 235 may include a prediction unit determiner, an inter predictor, and an intra predictor.
  • the prediction unit determiner receives various information such as prediction unit information input from the entropy decoder 210, prediction mode information of the intra prediction method, and motion prediction related information of the inter prediction method, and distinguishes the prediction unit from the current coding unit, and predicts It may be determined whether the unit performs inter prediction or intra prediction.
  • the inter prediction unit 230 predicts the current prediction based on information included in at least one of a previous picture or a subsequent picture of the current picture including the current prediction unit by using information required for inter prediction of the current prediction unit provided by the image encoder. Inter prediction may be performed on a unit. Alternatively, inter prediction may be performed based on information of some regions pre-restored in the current picture including the current prediction unit.
  • a motion prediction method of a prediction unit included in a coding unit based on a coding unit includes a skip mode, a merge mode, an AMVP mode, and an intra block copy mode. It can be determined whether or not it is a method.
  • the intra predictor 235 may generate a prediction block based on pixel information in the current picture.
  • intra prediction may be performed based on intra prediction mode information of the prediction unit provided by the image encoder.
  • the intra predictor 235 may include an adaptive intra smoothing (AIS) filter, a reference pixel interpolator, and a DC filter.
  • the AIS filter is a part of filtering the reference pixel of the current block and determines whether to apply the filter according to the prediction mode of the current prediction unit.
  • AIS filtering may be performed on the reference pixel of the current block by using the prediction mode and the AIS filter information of the prediction unit provided by the image encoder. If the prediction mode of the current block is a mode that does not perform AIS filtering, the AIS filter may not be applied.
  • the reference pixel interpolator may generate a reference pixel having an integer value or less by interpolating the reference pixel. If the prediction mode of the current prediction unit is a prediction mode for generating a prediction block without interpolating the reference pixel, the reference pixel may not be interpolated.
  • the DC filter may generate the prediction block through filtering when the prediction mode of the current block is the DC mode.
  • the reconstructed block or picture may be provided to the filter unit 240.
  • the filter unit 240 may include a deblocking filter, an offset correction unit, and an ALF.
  • Information about whether a deblocking filter is applied to a corresponding block or picture, and when the deblocking filter is applied to the corresponding block or picture, may be provided with information about whether a strong filter or a weak filter is applied.
  • the deblocking filter related information provided by the image encoder may be provided and the deblocking filtering of the corresponding block may be performed in the image decoder.
  • the offset correction unit may perform offset correction on the reconstructed image based on the type of offset correction and offset value information applied to the image during encoding.
  • the ALF may be applied to a coding unit based on ALF application information, ALF coefficient information, and the like provided from the encoder. Such ALF information may be provided included in a specific parameter set.
  • the memory 245 may store the reconstructed picture or block to use as a reference picture or reference block, and may provide the reconstructed picture to the output unit.
  • a coding unit is used as a coding unit for convenience of description, but may also be a unit for performing decoding as well as encoding.
  • the current block represents a block to be encoded / decoded, and according to the encoding / decoding step, a coding tree block (or a coding tree unit), an encoding block (or a coding unit), a transform block (or a transform unit), or a prediction block. (Or prediction unit) or the like.
  • 'unit' may indicate a basic unit for performing a specific encoding / decoding process
  • 'block' may indicate a sample array having a predetermined size.
  • 'block' and 'unit' may be used interchangeably.
  • the coding block (coding block) and the coding unit (coding unit) may be understood to have the same meaning.
  • One picture may be divided into square or non-square basic blocks and encoded / decoded.
  • the basic block may be referred to as a coding tree unit.
  • a coding tree unit may be defined as the largest coding unit allowed in a sequence or slice. Information regarding whether the coding tree unit is square or non-square or the size of the coding tree unit may be signaled through a sequence parameter set, a picture parameter set or a slice header.
  • the coding tree unit may be divided into smaller sized partitions.
  • the partition generated by dividing the coding tree unit is called depth 1
  • the partition generated by dividing the partition having depth 1 may be defined as depth 2. That is, a partition generated by dividing a partition that is a depth k in a coding tree unit may be defined as having a depth k + 1.
  • a partition of any size generated as the coding tree unit is split may be defined as a coding unit.
  • the coding unit may be split recursively or split into basic units for performing prediction, quantization, transform, or in-loop filtering.
  • an arbitrary size partition generated as a coding unit is divided may be defined as a coding unit or a transform unit or a prediction unit that is a basic unit for performing prediction, quantization, transform, or in-loop filtering.
  • a prediction block having the same size as the coding block or a size smaller than the coding block may be determined through prediction division of the coding block.
  • Predictive partitioning of a coding block may be performed by a partition mode (Part_mode) indicating a partition type of a coding block.
  • Part_mode partition mode
  • the size or shape of the prediction block may be determined according to the partition mode of the coding block.
  • the division type of the coding block may be determined through information specifying any one of partition candidates.
  • the partition candidates available to the coding block may include an asymmetric partition shape (eg, nLx2N, nRx2N, 2NxnU, 2NxnD) according to the size, shape, or coding mode of the coding block.
  • a partition candidate available to a coding block may be determined according to an encoding mode of the current block.
  • FIG. 3 is a diagram illustrating a partition mode that may be applied to a coding block when the coding block is encoded by inter prediction.
  • any one of eight partition modes may be applied to the coding block, as shown in the example illustrated in FIG. 3.
  • partition mode PART_2Nx2N or PART_NxN may be applied to the coding block.
  • PART_NxN may be applied when the coding block has a minimum size.
  • the minimum size of the coding block may be predefined in the encoder and the decoder.
  • information about the minimum size of the coding block may be signaled through the bitstream.
  • the minimum size of the coding block is signaled through the slice header, and accordingly, the minimum size of the coding block may be defined for each slice.
  • the partition candidates available to the coding block may be determined differently according to at least one of the size or shape of the coding block.
  • the number or type of partition candidates that a coding block may use may be differently determined according to at least one of the size or shape of the coding block.
  • the type or number of asymmetric partition candidates among partition candidates available to the coding block may be limited according to the size or shape of the coding block.
  • the number or type of asymmetric partition candidates that a coding block may use may be differently determined according to at least one of the size or shape of the coding block.
  • the size of the prediction block may have a size of 64x64 to 4x4.
  • the prediction block may not have a 4x4 size in order to reduce the memory bandwidth.
  • FIGS. 4 to 6 illustrate an example of capturing up, down, left, and right sides simultaneously using a plurality of cameras.
  • a video generated by stitching a plurality of videos may be referred to as a panoramic video.
  • an image having a degree of freedom based on a predetermined central axis may be referred to as 360 degree video.
  • the 360 degree video may be an image having rotation degrees of freedom for at least one of Yaw, Roll, and Pitch.
  • the camera structure (or camera arrangement) for acquiring 360-degree video has a circular arrangement, as in the example shown in FIG. 4, or a one-dimensional vertical / horizontal arrangement, as in the example shown in FIG. 5A.
  • a two-dimensional arrangement that is, a mixture of vertical and horizontal arrangements
  • a spherical device may be equipped with a plurality of cameras.
  • FIG. 7 is a block diagram of a 360 degree video data generating apparatus and a 360 degree video playing apparatus
  • FIG. 8 is a flowchart illustrating operations of the 360 degree video data generating apparatus and 360 degree video playing apparatus.
  • the 360-degree video data generating apparatus includes a projection unit 710, a frame packing unit 720, an encoding unit 730, and a transmission unit 740. It may include a parser 750, a decoder 760, a frame depacking unit 770, and a reverse projection unit 780.
  • the encoding unit and the decoding unit illustrated in FIG. 7 may correspond to the image encoding apparatus and the image decoding apparatus illustrated in FIGS. 1 and 2, respectively.
  • the data generating apparatus may determine a projection conversion technique of the 360 degree image generated by stitching the images photographed by the plurality of cameras.
  • the projection unit 710 may determine the 3D form of the 360 degree video according to the determined projection transformation technique, and project the 360 degree video onto the 2D plane according to the determined 3D form (S801).
  • the projection transformation technique may represent an aspect in which the 360 degree video is developed on the 3D form and the 2D plane of the 360 degree video.
  • the 360-degree image may be approximated as having a form of sphere, cylinder, cube, octahedron or icosahedron in 3D space, according to a projection transformation technique.
  • an image generated by projecting a 360 degree video onto a 2D plane may be referred to as a 360 degree projection image.
  • the 360 degree projection image may be composed of at least one face according to a projection conversion technique.
  • each face constituting the polyhedron may be defined as a face.
  • the specific surface constituting the polyhedron may be divided into a plurality of regions, and the divided regions may be set to form separate faces.
  • the 360 degree video approximated in the shape of a sphere may have a plurality of faces according to the projection transformation technique.
  • the frame packing may be performed in the frame packing unit 720 (S802).
  • Frame packing may include at least one of reordering, resizing, warping, rotating, or flipping a face.
  • the 360-degree projection image may be converted into a form (eg, a rectangle) having high encoding / decoding efficiency, or discontinuity data between faces may be removed.
  • Frame packing may also be referred to as frame reordering or region-wise packing. Frame packing may be selectively performed to improve encoding / decoding efficiency for the 360 degree projection image.
  • the encoding unit 730 may perform encoding on the 360 degree projection image or the 360 degree projection image on which the frame packing is performed (S803).
  • the encoder 730 may encode information indicating a projection transformation technique for the 360 degree video.
  • the information indicating the projection transformation technique may be index information indicating any one of the plurality of projection transformation techniques.
  • the encoder 730 may encode information related to frame packing for the 360 degree video.
  • the information related to the frame packing may include at least one of whether frame packing is performed, the number of faces, the position of the face, the size of the face, the shape of the face, or the rotation information of the face.
  • the transmitter 740 may encapsulate the bitstream and transmit the encapsulated data to the player terminal (S804).
  • the file parsing unit 750 may parse the file received from the content providing device (S805).
  • the decoding unit 760 may decode the 360 degree projection image using the parsed data (S806).
  • the frame depacking unit 760 may perform frame depacking (Region-wise depacking) opposite to the frame packing performed on the content providing side (S807).
  • Frame depacking may be to restore the frame packed 360 degree projection image to before frame packing is performed.
  • frame depacking may be to reverse the reordering, resizing, warping, rotation, or flipping of a face performed in the data generating device.
  • the inverse projection unit 780 may inversely project the 360 degree projection image on the 2D plane in a 3D form according to a projection transformation technique of the 360 degree video (S808).
  • Projection transformation techniques include isotropic rectangular projection (ERP), cubic projection transformation (Cube Map Projection, CMP), isosahedral projection transformation (ISP), octahedron projection transformation (Octahedron Projection, OHP), truncated pyramid It may include at least one of a projection transform (Truncated Pyramid Projection (TPP)), a Sharpe Segment Projection (SSP), an Equatorial cylindrical projection (ECP), or a rotated sphere projection (RSP).
  • the isotropic method is a method of projecting a pixel corresponding to a sphere into a rectangle having an aspect ratio of N: 1, which is the most widely used 2D transformation technique.
  • N may be two, and may be two or less or two or more real numbers.
  • the actual length of the sphere corresponding to the unit length on the 2D plane becomes shorter toward the pole of the sphere.
  • the coordinates of both ends of the unit length on the 2D plane may correspond to a distance difference of 20 cm near the equator of the sphere, while corresponding to a distance difference of 5 cm near the pole of the sphere.
  • the isotropic rectangular method has a disadvantage in that the image distortion is large and coding efficiency is lowered near the poles of the sphere.
  • the example shown in FIG. 9 may be rotated clockwise or counterclockwise, so that the anode of the sphere corresponds to the left and right of the 2D plane.
  • the 360 degree image may be projected into a rectangle having an aspect ratio of 1: N.
  • FIG. 10 illustrates a 2D projection method using a cube projection technique.
  • the cube projection technique involves approximating a 360-degree video to a cube and then converting the cube into 2D.
  • one face or plane
  • the cube projection method has an advantage of higher coding efficiency than the isotonic diagram method.
  • the 2D projection-converted image may be rearranged into a quadrangular shape to perform encoding / decoding.
  • FIG. 11 illustrates a 2D projection method using a icosahedron projection technique.
  • the icosahedron projection technique is a method of approximating a 360 degree video to an icosahedron and converting it into 2D.
  • the icosahedral projection technique is characterized by strong continuity between faces.
  • encoding / decoding may be performed by rearranging faces in the 2D projection-converted image.
  • FIG. 12 illustrates a 2D projection method using an octahedron projection technique.
  • the octahedral projection method is a method of approximating a 360 degree video to an octahedron and converting it into 2D.
  • the octahedral projection technique is characterized by strong continuity between faces.
  • encoding / decoding may be performed by rearranging faces in the 2D projection-converted image.
  • FIG. 13 illustrates a 2D projection method using a truncated pyramid projection technique.
  • the truncated pyramid projection technique is a method of approximating a 360 degree video to a truncated pyramid and converting it into 2D.
  • frame packing may be performed such that the face at a particular point in time has a different size than the neighboring face.
  • the front face may have a larger size than the side face and the back face.
  • SSP is a method of dividing a spherical 360-degree video into high- and mid-latitude regions and performing 2D projection transformation. Specifically, when the SSP is followed, the two high latitude regions of the sphere may be mapped to two circles on the 2D plane, and the mid-latitude regions of the sphere may be mapped to the rectangles on the 2D plane like the ERP.
  • ECP converts spherical 360-degree video into cylindrical form and then converts cylindrical 360-degree video into 2D projection. Specifically, when the ECP is followed, the top and bottom of the cylinder can be mapped to two circles on the 2D plane, and the body of the cylinder can be mapped to the rectangle on the 2D plane.
  • RSP represents a method of converting a spherical 360 degree video of a tennis ball into two ellipses on a 2D plane.
  • Each sample of the 360 degree projection image may be identified by face 2D coordinates.
  • the face 2D coordinates may include an index f for identifying the face where the sample is located, a coordinate (m, n) representing a sample grid in a 360 degree projection image.
  • FIG. 14 is a diagram illustrating a conversion between a face 2D coordinate and a 3D coordinate.
  • conversion between three-dimensional coordinates (x, y, z) and face 2D coordinates (f, m, n) may be performed using Equations 1 to 3 below. have.
  • the current picture in the 360 degree projection image may include at least one or more faces.
  • the number of faces may be 1, 2, 3, 4 or more natural numbers, depending on the projection method.
  • f may be set to a value equal to or smaller than the number of faces.
  • the current picture may include at least one or more faces having the same temporal order or output order (POC).
  • the number of faces constituting the current picture may be fixed or variable.
  • the number of faces constituting the current picture may be limited not to exceed a predetermined threshold.
  • the threshold value may be a fixed value previously promised by the encoder and the decoder.
  • information about the maximum number of faces constituting one picture may be signaled through a bitstream.
  • the faces may be determined by partitioning the current picture using at least one of a horizontal line, a vertical line, or a diagonal line, depending on the projection method.
  • FIG. 15 is a diagram for describing a face index of a 360 degree projection image based on CMP.
  • the CMP may be defined as a method of approximating 3D 3D data to correspond to a cube and converting it into 2D.
  • different face indices may be assigned to each face constituting the cube.
  • a face corresponding to the front face of the cube front face (the face with the PX label shown in FIG. 15)
  • face index 1 a face corresponding to the back face of the cube
  • the back face (NX label in FIG. 15) refers to the weapon face.
  • Table 1 is a diagram illustrating a face index assigned to each surface shown in FIG.
  • Each face may be parallel processed, such as a tile or a slice. Accordingly, when performing intra prediction or inter prediction of the current block, neighboring blocks belonging to different faces from the current block may be determined to be unavailable.
  • Paces (or non-parallel regions) where parallelism is not allowed may be defined, or faces with interdependencies may be defined. For example, faces that do not allow parallel processing or faces with interdependencies may be coded / decoded sequentially instead of being parallel coded / decoded. Accordingly, even neighboring blocks belonging to a different face from the current block may be set to be available for intra prediction or inter prediction of the current block according to whether or not inter-phase parallelism is possible or dependencies.
  • the play device may decode the 360 degree image and render a portion corresponding to the view port in the 360 degree video.
  • View ports may be classified into static view ports and dynamic view ports according to fluidity.
  • the static view port refers to a view port with no change in position
  • the dynamic view port refers to a view port whose position changes as the user's gaze changes. It is rare to use static viewports for an entire sequence of 360-degree video, and most of them use dynamic viewports that change position as the user's eyes move.
  • the area in the 360 degree video that the user should watch carefully can be set.
  • the content producer may set a view port trajectory that should be viewed in a 360 degree video.
  • a viewport corresponding to an area of interest to a producer or viewer in a 360 degree video may be referred to as a region of interest (ROI), a recommended view port, a director's cut, or the like. .
  • ROI region of interest
  • 360 degree video may be encoded around a view port among 360 degree videos.
  • the meaning of encoding the 360 degree video around the view port may mean encoding a rectangular area corresponding to the view port, a predetermined size area including the view port, or a tile / slice including the view port. .
  • the 360 degree video may be encoded based on the ROI of the entire area of the 360 degree video. Encoding the 360 degree video around the ROI may be referred to as ROI mode.
  • a view port mode after encoding and decoding the entire 360-degree video, only the partial image corresponding to the view port may be extracted from the decoded 360-degree image, and the extracted partial image may be re-encoded.
  • recoding only a portion corresponding to the view port in the decoded 360-degree image may be referred to as a view port mode.
  • the region of interest mode there is a limit to watching the region of interest provided by the content producer instead of watching the region to which the user's eyes are directed.
  • the viewport mode there is an advantage of providing a dynamic viewport according to the viewer's eye movement.
  • 16 is a diagram for explaining a viewport mode.
  • the encoders (Encoder A) 1610 of the server may encode the entire 360 degree video.
  • the encoded 360 degree video may be transmitted to an intermediate node via a network.
  • the decoder A (Decoder A) 1620 of the intermediate node may decode the entire 360 degree video through the bitstream received from the server.
  • the intermediate node may include a media aware network element (MANE) complying with the MMT transmission standard.
  • the linear region extractor 1630 of the intermediate node may receive position data related to the view port from the play device, and extract a rectangular area corresponding to the view port from the decoded 360 degree video.
  • the encoder B (1640) of the intermediate node may encode the extracted rectangular partial image and transmit a bitstream of the encoded partial image through a network. .
  • the decoder B (Decoder B) 1650 of the play device may receive a bitstream of a partial image received through a network and decode the received partial image.
  • the play device may output an area corresponding to the view port in the 360 degree video.
  • the location and size (or width) of the viewport may be defined based on at least one of the coordinates of the viewport, the width and height of the viewport, and the angle between the predetermined central axis and the viewport.
  • the location and size of the view port may be determined by an angle difference between the view point center point and the view port center point and the view port boundary.
  • the center point of the viewport may be specified by spherical coordinates including a rotation angle Yaw about the z axis, a rotation angle Pitch about the x axis, and a rotation angle Roll about the z axis.
  • the width and height of the viewport may be specified by information indicating the range of the viewport.
  • the range of the view port may include a Yaw range indicating an angle between the left boundary and the right boundary of the view port and a pitch range indicating the angle between the upper boundary and the lower boundary of the view port.
  • 17 is a diagram illustrating an example in which a position and a size of a view port are specified.
  • the position and size of the view port may be specified by the center point of the view port and the view port range.
  • the position and size of the viewport may be specified by the center coordinates (Yaw, Roll, Pitch) of the viewport, the Yaw range and the Pitch range.
  • the left and right ranges of the view port may be specified using the Yaw range
  • the upper and lower ranges of the view port may be specified using the pitch range.
  • the image encoding apparatus encoding the 360 degree image may encode view port related information in order to specify the position and size of the view port, and transmit the information to the image decoding apparatus through the bitstream.
  • the view port related information may include information indicating the position of the view port center point and information for specifying the view port range.
  • the view port related information may further include at least one of angular precision related information, information for determining a picture range to which the view port is applied, and encoding mode information related to the view port.
  • 18 is a diagram illustrating syntax associated with a viewport encoded in a bitstream.
  • the video encoding apparatus may encode information indicating the angle precision.
  • spherical_viewport_precision may be a syntax indicating angular precision.
  • the angular precision may be set to a value obtained by multiplying the value of spherical_viewport_precision by 10 ⁇ 2 .
  • the angular precision may be set to 0.01 degree. This indicates that the position and range of the viewport can be displayed in units of 0.01 degree.
  • one of the plurality of angular precision candidates may be selected based on the signaled information.
  • spherical_viewport_precision may be an index specifying any one of a plurality of angular precision candidates.
  • the video encoding apparatus may encode information indicating the center point of the viewport.
  • spherical_viewport_yaw may represent Yaw coordinates of the viewport center point
  • spherical_viewport_pitch may represent Pitch coordinates of the viewport center point
  • spherical_viewport_roll may represent Roll coordinates of the viewport center point.
  • the video encoding apparatus may encode information for specifying the viewport range.
  • spherical_viewport_range_yaw is for specifying a left and right range (ie, Yaw range) of the view port
  • spherical_viewport_range_pitch is for specifying an upper and lower range (ie, Pitch range) of the view port.
  • spherical_viewport_range_yaw and spherical_viewport_range_pictch may indicate angles from the viewport center point to one side boundary of the viewport.
  • spherical_viewport_range_yaw may represent an angle from the center of the viewport to the left or right border of the viewport
  • spherical_viewport_range_pictch may represent an angle from the center of the viewport to the top or bottom boundary of the viewport.
  • the Yaw range can be extended to the left and right symmetrical regions of the region designated by spherical_viewport_range_yaw, and the pitch range can be extended to the vertically symmetrical region of the region designated by spherical_viewport_range_pitch.
  • the amount of bits required to determine the view port range may be reduced.
  • the image encoding apparatus may encode information representing a picture range to which the view port information is applied.
  • spherical_viewport_persistence_flag is a syntax indicating whether view port information is applied only to the current picture or to other pictures.
  • view port related syntax eg, angular precision, view port center point, and view port range related information
  • the view port syntax of the current picture may be applied to other pictures until a new view port syntax is introduced.
  • the other picture may be a picture having a different output order (eg, Picture Order Count, POC) or decoding order from the current picture.
  • POC Picture Order Count
  • the view port related syntax of the current picture may be applied to a POC larger than the current picture or a picture decoded later than the current picture.
  • the image encoding apparatus may encode information associated with an encoding mode.
  • spherical_viewport_mode may indicate an encoding mode of a current sequence or a current picture.
  • spherical_viewport_mode 0 (or 1) may indicate that region of interest mode is applied to the current sequence or current picture
  • spherical_viewport_mode 1 (or 0) indicates that view port mode is applied to the current sequence or current picture. Can be represented.
  • the encoding / decoding for the angle precision may be omitted, and the angle precision predefined in the encoding apparatus and the decoding apparatus may be used.
  • the view port related information illustrated in FIG. 18 may be encoded through at least one of a Supplementary Enhancement Information (SEI) message, a sequence header, a picture header, or a slice header.
  • SEI Supplementary Enhancement Information
  • the viewport mode as an example, when a plurality of viewers watch a 360 degree video, the view ports of the plurality of viewers may be different.
  • the intermediate node may re-encode the partial region corresponding to each viewer's view port from the decoded 360 degree video and transmit the re-encoded plural partial images to each play apparatus.
  • a plurality of ROIs may be set in the 360 degree video.
  • the viewer may select one of the plurality of regions of interest and watch a partial image corresponding to the selected region of interest.
  • the encoding apparatus may encode a partial image corresponding to each ROI, and transmit any one of the encoded plurality of partial images to the play apparatus according to the ROI selected by the user.
  • the view port information may further include information about the number of view ports.
  • the image encoding apparatus may further encode information about the number of view ports.
  • 19 is a diagram illustrating an example in which a syntax indicating the number of view ports is encoded.
  • the video encoding apparatus may encode information indicating the number of view ports.
  • viewport_num may represent the number of view ports.
  • viewport_num_minus1 may represent a value obtained by subtracting 1 from the number of view ports.
  • the number of view ports may represent at least one of the maximum number or the minimum number of view ports allowable in the current picture.
  • the number of view ports may represent a number applied at at least one level of a sequence, a temporal layer, a picture, or a slice including a current picture.
  • position and range information of each view port may be encoded.
  • Different view port indexes viewport_idx
  • location and range information may be encoded for each view port index.
  • spherical_viewport_yaw [viewport_idx] represent center point spherical coordinates (Yaw, Pitch, Roll) of the viewport having the viewport index [viewport_idx], respectively.
  • spherical_viewport_range_yaw [viewport_idx] and spherical_viewport_range_pitch [viewport_idx] are used to determine the Yaw range and the Pitch range of the viewport having the viewport index [viewport_idx], respectively.
  • the image decoding apparatus may decode information indicating the number of view ports, and when the number of view ports is plural, may decode position and range information of each view port and determine the position and size of each view port.
  • information eg, a flag
  • information indicating whether a plurality of view ports are allowed may be signaled via the bitstream.
  • the 360 degree projection image may be encoded / decoded on a block basis as in a general 2D image. Accordingly, in the encoder, when intra prediction or inter prediction is performed on the current block, a residual sample may be obtained by subtracting the prediction sample from the original sample. The obtained residual sample may be transmitted to the decoder through a bitstream through Transform and Quantization. The decoder can obtain a residual sample by obtaining a residual coefficient from the bitstream and inverse-quantizing and inverse-transforming the obtained residual coefficient. A reconstruction sample for the current block may be obtained by adding the residual sample and the prediction sample obtained through intra prediction or inter prediction.
  • 20 is a flowchart illustrating a process of obtaining a residual sample in a decoder according to an embodiment to which the present invention is applied.
  • a residual coefficient of the current block may be obtained (S2010).
  • the decoder may acquire the residual coefficients through the coefficient scanning method. For example, the decoder may perform coefficient scanning using diagonal scan, zigzag scan, up-write scan, vertical scan, or horizontal scan, and as a result, obtain a residual coefficient in the form of a two-dimensional block.
  • a quantization parameter of the current block may be obtained (S2020), and inverse quantization may be performed on the residual coefficient using the obtained quantization parameter (S2030).
  • the quantization parameter may be derived by adding a quantization parameter difference value to the quantization parameter prediction value.
  • the quantization parameter prediction value may be derived from the quantization parameter of the neighboring block. For example, the quantization parameter prediction value may be derived based on at least one quantization parameter of the top neighbor block or the left neighbor block of the current block.
  • the quantization parameter difference value may be derived based on the information signaled through the bitstream.
  • the decoder may determine whether to skip an inverse transform in at least one of the horizontal direction and the vertical direction of the current block.
  • a residual sample of the current block may be obtained by inversely transforming an inverse quantized residual coefficient of the current block (S2050).
  • Inverse transformation may be performed using at least one of DCT, DST, or KLT.
  • the residual quantized residual coefficient may be scaled to obtain a residual sample of the current block (S2060).
  • the residual sample and the prediction sample may be summed to restore the current sample.
  • the degree of distortion of the image may appear differently.
  • a 360-degree projection image may have a region where distortion is greater than other regions.
  • an area for example, a screen boundary
  • an area with less interest of the viewer may be set in the image.
  • the region corresponding to the pole region of the ERP where the distortion is large or the region of less interest of the viewer will not have a high frequency of viewers, so it is not necessary to encode / decode these regions with the same quality as that of the other region. Accordingly, by setting the encoding / decoding quality of the region corresponding to the polar region of the ERP or the region of less interest to the viewer, that is, lower than other regions (that is, the region where the distortion of the image is small or the region of which the viewer is mainly interested), Consider lowering the overall bitrate of the system.
  • a method of adaptively determining a quantization parameter according to a position in a 360 degree projection image may be considered. If the quantization parameter is large, there is a problem that an error between the original image and the reconstructed image increases, while if the quantization parameter is small, the number of bits required for compressing the image increases, causing a problem that the compression ratio is degraded.
  • a region with a high distortion or a region of less interest to the viewer may use a method of reducing the number of bits required to compress the image by setting the quantization parameter to a large value even if the image quality is deteriorated.
  • the quantization parameter of the region where the distortion of the image is large in the 360-degree projection image based on the ERP technique or the region where the viewer is less interested in the 360-degree image than other regions the number of bits required for encoding these regions is increased. Can be lowered.
  • the quantization parameter is obtained using at least one of the x-axis position or the y-axis position of the region.
  • quantization parameter related information for determining the quantization parameter is obtained in area units.
  • the quantization parameter related information may include at least one of quantization parameter, position quantization parameter weight, or quantization parameter offset.
  • a region may be defined as a spatial region having a single quantization parameter related information. For example, when a plurality of blocks is included in one region, at least one of quantization parameters, position quantization parameter weights, or quantization parameter offsets of the plurality of blocks included in the region may be set to be the same.
  • the area may be the same as the predetermined block.
  • a transform unit, a coding unit, or a coding tree unit may be defined as one region.
  • the region may have a different size or shape than a given block.
  • the region may be one sample.
  • the region may appear in the form of a sample line (eg, sample row or sample column), a block including a plurality of samples, a face, a tile, or a slice.
  • a plurality of blocks may be defined as one region.
  • the plurality of blocks may be included in an area of a predetermined size or may be a collection of blocks constituting a predetermined shape.
  • the predetermined size or shape may be predefined in the encoder and the decoder, and information for specifying the signals may be encoded and signaled.
  • the predetermined shape may include not only a quadrangle but also a polygonal shape such as an annular shape, an angled shape, or an irregular shape.
  • At least one block line may be defined as one region, or a set of blocks that are not spatially continuous may be defined as one region.
  • at least one CTU row may be defined as one region, or a set of blocks adjacent to a corner of a face may be defined as one region.
  • the view port corresponding area may be defined as one area.
  • each view port corresponding area may be defined as a separate area.
  • the viewport corresponding area may be divided into a plurality of areas.
  • the 360 degree projection image is composed of a plurality of faces
  • one face may be divided into a plurality of regions.
  • the attributes of the region may be predefined in the encoder and the decoder.
  • properties of each region may be predefined in the encoder and the decoder according to the projection transformation technique.
  • the position and size of the region may be determined using the encoded information to determine the attribute of the region.
  • 21 is a flowchart illustrating a process of obtaining a quantization parameter according to an embodiment to which the present invention is applied.
  • the process shown in FIG. 21 is performed as part of the quantization parameter obtaining step S2020 of FIG. 20, or for correcting or updating the quantization parameter obtained by performing the quantization parameter obtaining step S2020 of FIG. 20. It may be an additional process.
  • a 360-degree projection image may be divided into a plurality of regions (S2110).
  • Each region may have a uniform size or shape, or may have a non-uniform size or shape.
  • the quantization parameter related information of each region may be obtained based on the positions of the divided regions (S2120).
  • the location of the area used to obtain quantization parameter related information may be the location of a sample at a particular location within the area or a sample adjacent to the boundary of the area.
  • the quantization parameter related information of the region may be obtained using at least one of the x-axis or y-axis coordinates of a sample at a specific position in the region or a sample adjacent to the boundary of the region.
  • a quantization parameter of an area or blocks belonging to the area may be obtained (S2130).
  • the quantization parameter of the block may be different for each region.
  • the quantization parameter of each region may be determined based on the quantization parameter of the block (eg, the initial quantization parameter of the block) and the quantization parameter related information obtained at the region level.
  • the quantization parameter of the region may be derived by applying a position quantization parameter weight or a quantization parameter offset to the quantization parameter obtained at the block level.
  • the quantization parameter of the region may be obtained by multiplying the quantization parameter of the block by the position quantization parameter weight, or by adding or subtracting an offset or a quantization parameter offset derived based on the position quantization parameter weight to the previously derived quantization parameter.
  • the quantization parameter of the block may be obtained based on information signaled from the bitstream, or may be obtained by summing a quantization parameter prediction value and a quantization parameter difference value.
  • the blocks included in the region may share a quantization parameter determined at the region level.
  • the quantization parameter of the region may be derived based on at least one of a position quantization parameter weight, a quantization parameter offset, or a quantization parameter initial value at a specific level that is determined according to the position of the region.
  • the quantization parameter of the region may be derived by applying a position quantization parameter weight or a quantization parameter offset to the previously obtained quantization parameter.
  • the quantization parameter of the region may be obtained by multiplying the previously obtained quantization parameter by the position quantization parameter or by adding or subtracting the offset or quantization parameter offset derived based on the position quantization parameter to the previously obtained quantization parameter.
  • the previously obtained quantization parameter may be a quantization parameter of a specific level (eg, a block, an area, a face, a slice, or a tile).
  • the quantization parameter of the blocks included in the region may be derived by applying the quantization parameter related information obtained at the region level to the previously obtained quantization parameter.
  • the quantization parameter of the block may be derived by applying a position quantization parameter weight or a quantization parameter offset to the previously obtained quantization parameter.
  • the quantization parameter of the block may be obtained by multiplying the previously obtained quantization parameter by the position quantization parameter, or by adding or subtracting the offset or quantization parameter offset derived based on the position quantization parameter to the previously obtained quantization parameter.
  • the previously obtained quantization parameter may be a quantization parameter of a specific level (eg, a block, an area, a face, a slice, or a tile).
  • the block level quantization quantization parameter may be obtained based on a quantization parameter prediction value and a quantization parameter difference value.
  • information representing a specific level of quantization parameter may be signaled through the bitstream.
  • the quantization parameter is obtained at the region or block level.
  • a method of determining a quantization parameter based on quantization parameter related information will be described in detail with reference to the accompanying drawings.
  • FIG. 22 is a diagram for explaining an example of deriving a quantization parameter using position quantization parameter weight.
  • each region of the 360 degree projection image is configured with one CTU row (that is, a plurality of CTUs having the same y-axis position).
  • each region is illustrated as including one CTU row in FIG. 22, when each region includes one or more CTU rows or the number of CTU rows included in any one region is different. The present embodiment may be applied even when the number of CTU rows is included differently.
  • the quantization parameter related information may be determined according to the location of each region.
  • the quantization parameter related information may be determined based on at least one of a specific sample in a region or a position of a specific sample adjacent to a boundary of the region (eg, an x-axis position or a y-axis position), or a size of a 360 degree projection image. .
  • the position quantization parameter weight of each region may be derived in consideration of the y-axis position of the region. Equation 4 below shows an equation for deriving the position quantization parameter weight.
  • Equation 4 a denotes a height of a picture (that is, a 360 degree projection image), and j denotes a y-axis position of an area.
  • the quantization parameter may be derived based on at least one of quantization parameter and quantization parameter related information at a specific level.
  • the specific level may mean at least one of a picture level, a slice level, a face level, or a block level.
  • the number of quantization parameters at a particular level may be one, two or more.
  • Equations 5 and 6 show examples of deriving quantization parameters based on quantization parameters and position quantization parameter weights at specific levels.
  • Equation 5 shows an example of deriving the quantization parameter Q P using the quantization parameter Q Pslice and the position quantization parameter weight w at the slice level.
  • An example of deriving a quantization parameter Q P using a parameter Q PBlock and a position quantization parameter weight w is shown.
  • the quantization parameter may be obtained by differentially offsetting an offset value derived from the position quantization parameter weight (i.e., 3log 2 (w)) at a certain level of quantization parameter.
  • the level of quantization parameter to use for deriving the quantization parameter may be determined according to the position of the block.
  • the quantization parameter may be derived using the quantization parameter at the slice level for the first block in the region or the first block in the slice, and the quantization parameter may be derived using the quantization parameter at the block level for the remaining blocks.
  • the block level quantization parameter may be derived by using a quantization parameter prediction value and a quantization parameter difference value or may be derived through information encoded through a bitstream.
  • the quantization parameter may be limited below a certain value.
  • Equation 7 shows an example of limiting a quantization parameter value to a specific value or less.
  • the offset derived based on the position quantization parameter weight may have the largest value in the center, and may be set to have a smaller value near the polar region. Accordingly, the polar region quantization parameter in the ERP-based 360 degree projection image may be set to have a larger value than the central region quantization parameter.
  • the particular sample used to derive the quantization parameter related information may be a sample at a specific location in the area or a sample at a particular location adjacent to the boundary of the area.
  • FIG. 23 is a diagram illustrating the position of a sample used to derive position quantization parameter weights.
  • Position quantization parameter weights can be derived.
  • the location of a specific sample used to derive quantization parameter related information may be predefined in the encoder and the decoder. For example, a location of a specific sample used to derive quantization parameter related information in a slice unit, a face unit, or a coding block unit may be defined.
  • information for determining the location of a specific sample used to derive quantization parameter related information may be encoded and transmitted to the decoder through a bitstream.
  • the location of a specific sample used to derive quantization parameter related information in a slice unit, a face unit, or a coding block unit may be signaled.
  • the position of the sample used to derive the quantization parameter related information may be set differently according to the region, picture, slice, face or block. As an example, when an area is divided into units of a CTU row or a CTU column, positions of specific samples used to derive quantization parameter related information may be differently determined according to the CTU row or the CTU column.
  • the position quantization parameter weight is derived using the position of the sample located at the center point, not the upper left sample of the CTU, while in the remaining CTU rows, the position quantization is performed using the position of the upper left sample. Parameter weights are shown as being derived.
  • the position quantization parameter weight is derived using the position of the lower right sample, not the upper left sample of the CTU, while in the remaining CTU rows, the position quantization parameter weight is used using the position of the upper left sample. Is shown to be derived.
  • the position of the sample used to derive the position quantization parameter weight in a particular region may be set differently from the other regions.
  • the position quantization parameter weight is derived in consideration of the y-axis position of the region.
  • the position quantization parameter weight may be derived in consideration of the x-axis position of the region. For example, when a region is divided by a CTU column, quantization parameter related information may be derived by considering the x-axis position of a specific sample or a specific sample adjacent to the region boundary.
  • the quantization parameter related information may be derived by considering both the x-axis position and the y-axis position of the region. Specifically, after dividing one region into a plurality of sub-regions, the quantization parameter related information is derived on a sub-region basis, wherein the quantization parameter related information of at least one sub-block includes the x-axis position and the y-axis position of the sub-block. It can be derived in consideration of both. Accordingly, when at least one of the x-axis position or the y-axis position of the first sub-region and the second sub-region belonging to the same region is different, the quantization parameter related information of the first sub-region and the second sub-region may be different. .
  • the quantization parameter related information of the sub region may be derived based on the quantization parameter related information of the neighboring sub region.
  • the position quantization parameter weight of the second subregion may be derived by adding or subtracting an offset to the position quantization parameter weight of the first subregion.
  • the offset may be a fixed constant predefined in the encoder and the decoder, or may be a value derived by the same rule in the encoder and the decoder.
  • the offset may be an integer of 1, 2, or more, or may be a value determined according to the x-axis position or the y-axis position of the subregion.
  • the offset may be derived by information signaled through the bitstream.
  • FIG. 26 illustrates an example in which position quantization parameter weights are set differently for each subregion.
  • the position quantization parameter weight of the subregion including the central four CTUs of each region is set to a value obtained by subtracting offset 2 from the offset quantization parameter weight of the remaining subregion.
  • Equation 8 shows an example of deriving the position quantization parameter weights w (i, j) of the subregion and the quantization parameter of the subregion.
  • Equation 8 i denotes the x-axis position of a specific sample or block in the sub-region, and j denotes the y-axis position of the specific sample or block in the sub-region.
  • the x-axis position of the subregion or the y-axis position of the subregion used to derive the position quantization parameter weight may have the same value for all subregions in the region.
  • f (i) may represent a predefined i-th offset.
  • the 360 degree projection image including a plurality of faces may be divided into a plurality of areas based on a face unit. For example, one face may be set as one region or a plurality of faces may be set as one region. Alternatively, one face may be divided into a plurality of regions, or a 360-degree projection image may be divided into a plurality of faces regardless of the size / shape of the face.
  • the quantization parameter may be determined in consideration of the position of the region. Specifically, after deriving the position quantization parameter weight using at least one of the x-axis position or the y-axis position of the region, the quantization parameter may be determined using the derived position quantization parameter.
  • the position of the region used to derive the quantization parameter related information may be adaptively determined.
  • the quantization parameter related information may be derived by using the x-axis position of the region, the y-axis position of the region, or the x-axis position and the y-axis position of the region according to the position of the region.
  • FIG. 27 illustrates an example in which a position of a specific sample used to derive position quantization parameter weights is variably determined according to a position of a face.
  • the 360 degree projection image When the 360 degree projection image is generated using a cube projection technique, six faces may exist in the 360 degree projection image.
  • the six faces may be arranged in the form of 3 ⁇ 2, as in the example shown in FIG. 27.
  • the images shown in FIG. 27 may be rotated 90 degrees clockwise or counterclockwise to arrange the faces in the form of 2 ⁇ 3.
  • Information about the quantization parameter of a region included in a specific face may be derived based on the position of the region.
  • the position quantization parameter weight of the region may be derived using at least one of the x-axis position and the y-axis position of the region.
  • the position of the specific sample used to derive the quantization parameter related information may be adaptively selected according to the position of the face including the region.
  • the position of the face indicates whether the face is located at the top or the bottom of the 360 degree projection image, or whether the face is located at the left side, the middle point, or the right side of the 360 degree projection image. Can be represented.
  • an area belonging to the 4th, 1st, or 5th face located at the top of the 360 degree projection image derives the position quantization parameter weight using the y-axis position (ie, j).
  • an area belonging to a face number 3, 0 or 2 located at the bottom of the 360-degree projection image may derive a position quantization parameter weight using an x-axis position (ie, i).
  • the position quantization parameter weight w is derived based on the position of the predetermined region. Unlike in the example shown, it is also possible to derive a quantization parameter offset based on the location of a given region. In this case, the quantization parameter may be determined by adding or subtracting a quantization parameter offset to a specific level of quantization parameter.
  • blocks belonging to a predetermined region may have the same quantization parameter.
  • blocks belonging to a CTU or a face may have the same quantization parameter.
  • an example of adjusting the size of the quantization parameter according to the attributes of the block will be described in detail.
  • the image quality deterioration occurring at the face boundary may be defined as a face artifact.
  • a method of encoding the image quality less at the face boundary than the surroundings may be considered. Specifically, by setting the quantization parameter of the block adjacent to the face boundary smaller than the periphery, the image quality deterioration at the face boundary can be reduced.
  • FIG. 28 is a diagram illustrating an example in which quantization parameters are differently set according to the position of a block.
  • a quantization parameter of a block such as a CTU or a CU located at a face boundary may be set to have a smaller value than that of the block that is not.
  • the quantization parameter of the block located at the face boundary may be determined as a value obtained by subtracting an offset value from the quantization parameter of the neighboring block.
  • the offset value may be a fixed constant predefined in the encoder and the decoder.
  • the offset may be determined according to the position, the shape of the block, the position of the boundary adjacent to the block, the position of the face, and the face index.
  • the offset may be applied to the quantization parameter of the block adjacent to the boundary.
  • the face to which the offset is applied may be determined according to the projection transformation method, and information about the face to which the offset is applied may be signaled through the bitstream.
  • the quantization parameter of both blocks of the tile boundary may be set to be the same, or the quantization parameter of one block of the tile boundary may be changed similarly to the quantization parameter of the opposite block.
  • 29 is a diagram for describing an example of determining a quantization parameter of blocks adjacent to a tile boundary.
  • the quantization parameter of a coding block may be derived based on the quantization parameter of a higher level (eg, coding tree block) that includes the coding block. However, when the coding block is adjacent to the tile boundary, the quantization parameter of the coding block may be determined by further considering the quantization parameter of the block (eg, coding block or coding tree block) belonging to the neighboring tile adjacent to the tile boundary. As an example, the quantization parameter of a coding block neighboring a tile boundary may include a quantization parameter obtained at a higher level (eg, coding tree block) and a block (eg, neighboring coding block or neighboring coding tree) belonging to a previous tile adjacent to the tile boundary. Can be determined by comparing the quantization parameters of the block).
  • a higher level eg, coding tree block
  • the quantization parameter of the coding block adjacent to the tile boundary is equal to the quantization parameter of the neighboring block.
  • a quantization parameter of a coding block adjacent to a tile boundary may be derived by setting or adding or subtracting an offset value to a quantization parameter obtained at a higher level.
  • the offset value may be predefined in the encoder and the decoder, or may be a variable that is determined based on a difference value of a quantization parameter of a higher level and a neighboring block.
  • the quantization parameter of the coding block adjacent to the tile boundary may be determined using a mode, a maximum value, an average value, or a weighted sum of the quantization parameter obtained at the higher level and the quantization parameter of the neighboring block.
  • the quantization parameter of the coding block adjacent to the tile boundary may be set to be the same as the quantization parameter of the neighboring block belonging to the previous tile without comparing the quantization parameter obtained at the higher level with the quantization parameter of the neighboring block.
  • FIG. 29 illustrates a block adjacent to a tile boundary as an example, the described embodiment may be applied not only to tiles but also to an area unit capable of parallel processing such as a slice.
  • the quantization parameter may be derived through the initial quantization parameter.
  • the quantization parameter of the region included in the face may be derived based on the initial quantization parameter of the face and the quantization parameter related information of the corresponding region.
  • the initial quantization parameter may be adaptively determined according to the position, size, or index of the face. For example, in a CMP-based 360 degree projection image, the initial quantization parameter of the rear face (face with face index 1) is set to the largest size, while the faces (face index with face index 0) are adjacent to the front face (face with face index 0).
  • the initial quantization parameter of faces 2 to 5 may be set to have a larger value than the initial quantization parameter of the front face.
  • the initial quantization parameter value of the first face may be derived based on the initial quantization parameter of the second face.
  • the initial quantization parameter value of the first face may be derived by adding or subtracting an offset n to the value of the initial quantization parameter of the second face.
  • n may be 0 or an integer greater than 0.
  • Equation 9 shows an example of deriving the initial quantization parameter of the remaining faces using the initial quantization parameter and the offset of the front face.
  • Equation 9 it is illustrated that an initial quantization parameter of a predetermined face is derived by adding an offset 2 or 1 of a predetermined face to the initial quantization parameter InitQp front of the front face.
  • the offset may be predefined in the encoder and the decoder or may be determined based on the encoded information. For example, according to the projection transformation method, an offset of each face may be predefined.
  • the offset of the faces may be set to have the same value or a different value. For example, as shown in Equation 9, the offset of the rear face may have a value different from that of other faces.
  • the quantization parameter of the region may be determined based on the initial quantization parameter of the face and the quantization parameter related information of the region. For example, when an area is configured in a face unit, the quantization parameter of the face may be determined based on the initial quantization parameter of the face and the position quantization parameter weight of the face.
  • the quantization parameter related information may be variably determined according to the attribute of the face.
  • the attribute of the face may include at least one of a position, a size, a shape, a face identifier, or a discontinuous boundary of the face. Discontinuous boundaries may mean that the boundaries on the 2D plane are not continuous in 3D space.
  • the position quantization parameter weights of the first face and the second face may have different values.
  • the front face and the rear face have different sizes, and thus the position quantization parameter weights of the front face and the rear face may have different values.
  • the position quantization parameter of the rear face may be derived by adding or subtracting a predetermined offset to the position quantization parameter weight of the front face.
  • the method of deriving the quantization parameter may be set differently according to the nature of the face.
  • the rear face may derive the quantization parameter by applying Equation 10 below, while the other face may derive the quantization parameter by applying Equation 11 below.
  • the quantization parameter related information of the faces may be set to have the same value.
  • the position quantization parameter weights of the front face and the rear face are set to be the same in a TSP-based 360 degree projection image, but by applying different quantization parameter derivation methods, the quantization parameters of each face may be set to have different values. .
  • the region corresponding to the viewport will be more interested to the viewer than the other regions. Therefore, it is necessary to set the quantization parameter of the region corresponding to the viewport smaller than other regions to increase the image quality. Accordingly, a method of adaptively setting the value of the quantization parameter according to the view port may be considered.
  • the initial quantization parameter value to be used in the region corresponding to the view port may be encoded and signaled.
  • FIG. 30 is a diagram illustrating an example in which a syntax indicating an initial quantization parameter value of a view port is encoded.
  • an initial quantization parameter value may be signaled for each view port.
  • init_Qp_viewport [viewport_idx] represents an initial quantization parameter in the viewport whose index is viewport_idx.
  • the quantization parameter of the viewport whose index is viewport_idx may be derived by adding or subtracting an initial quantization parameter of the corresponding viewport and a previously derived offset.
  • the quantization parameter of the viewport or the region included in the viewport may be determined based on information about the initial quantization parameter of the viewport and the quantization parameter of the region.
  • the quantization parameter is shown to be derived.
  • the quantization parameter related information may be used to derive a quantization parameter difference value and a quantization parameter may be derived based on the derived quantization parameter difference value.
  • the derivation unit of the quantization parameter difference value may be the same as or a smaller unit than the unit in which the quantization parameter related information is obtained. For example, as shown in the example shown in FIG. 22, if quantization parameter related information is obtained for each CTU row, the quantization parameter difference value for the CTU row or each CTU included in the CTU row is obtained using the obtained quantization parameter related information. A quantization parameter difference value can be derived.
  • Equation 12 shows an example of deriving a quantization parameter difference value deltaQp when the unit in which the position quantization parameter is obtained and the unit in which the quantization parameter difference value is derived are the same.
  • Equation 13 illustrates an example of obtaining an average quantization parameter difference value deltaQp avg using an average of position quantization parameter weights obtained in each CTU row.
  • the position quantization parameter of each CTU row may be obtained based on Equation 14 below.
  • Equation 14 w (j) represents the weight of the CTU row located in the j th column.
  • the average quantization parameter difference value of the CTU row may be used to derive the quantization parameter offset of the unit blocks included in the CTU row.
  • the quantization parameter offset may be derived by subtracting the average quantization parameter difference value from the quantization parameter difference value of each unit block. Equation 15 shows an example of deriving a quantization parameter offset.
  • the quantization parameter of the unit block may be derived by obtaining a quantization parameter offset to a quantization parameter of a predetermined level.
  • Equation 16 shows an example of deriving a quantization parameter of a unit block.
  • a quantization parameter difference value may be defined at at least one or more block levels.
  • the quantization parameter difference value may be signaled in units of CTU.
  • the quantization parameter of the slice level or the preset quantization parameter initial value may be added to the quantization parameter of the CTU level.
  • a CU level quantization parameter difference value may be signaled.
  • the CU level quantization parameter may be derived by adding the CU level quantization parameter difference value to the CTU level quantization parameter.
  • the quantization parameter may be derived using all or some level quantization parameter difference values. That is, as in the above example, when the quantization parameter difference values are defined at both the CTU level and the CU level, both of them may be used to derive the quantization parameter, or only one of them is used to derive the quantization parameter. You may.
  • each component for example, a unit, a module, etc. constituting the block diagram may be implemented as a hardware device or software, and a plurality of components are combined into one hardware device or software. It may be implemented.
  • the above-described embodiments may be implemented in the form of program instructions that may be executed by various computer components, and may be recorded in a computer-readable recording medium.
  • the computer-readable recording medium may include program instructions, data files, data structures, etc. alone or in combination.
  • Examples of computer-readable recording media include magnetic media such as hard disks, floppy disks and magnetic tape, optical recording media such as CD-ROMs, DVDs, and magneto-optical media such as floptical disks. media), and hardware devices specifically configured to store and execute program instructions, such as ROM, RAM, flash memory, and the like.
  • the hardware device may be configured to operate as one or more software modules to perform the process according to the invention, and vice versa.
  • the present invention can be applied to an electronic device capable of encoding / decoding an image.

Landscapes

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

Abstract

La présente invention concerne un procédé de décodage d'image pouvant comprendre les étapes consistant à : diviser une image projetée à 360 degrés en une pluralité de zones comprenant une zone actuelle ; déterminer des informations relatives à un paramètre de quantification de la zone actuelle sur la base de la position de la zone actuelle ; et déterminer un paramètre de quantification de la zone actuelle ou de blocs contenus dans la zone actuelle à l'aide des informations relatives au paramètre de quantification.
PCT/KR2018/006119 2017-05-30 2018-05-30 Procédé et dispositif de traitement de signal vidéo WO2018221946A1 (fr)

Applications Claiming Priority (6)

Application Number Priority Date Filing Date Title
KR10-2017-0066847 2017-05-30
KR10-2017-0066848 2017-05-30
KR10-2017-0066850 2017-05-30
KR20170066850 2017-05-30
KR20170066847 2017-05-30
KR20170066848 2017-05-30

Publications (1)

Publication Number Publication Date
WO2018221946A1 true WO2018221946A1 (fr) 2018-12-06

Family

ID=64454730

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2018/006119 WO2018221946A1 (fr) 2017-05-30 2018-05-30 Procédé et dispositif de traitement de signal vidéo

Country Status (2)

Country Link
KR (1) KR20180131454A (fr)
WO (1) WO2018221946A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115022638A (zh) * 2022-06-30 2022-09-06 电子科技大学 一种面向全景视频编码的率失真优化方法

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113711596A (zh) * 2019-09-10 2021-11-26 株式会社 Xris 图像信号编码/解码方法及其装置
WO2023182776A1 (fr) * 2022-03-22 2023-09-28 엘지전자 주식회사 Procédé et dispositif de codage et décodage d'image basés sur une région saillante, et support d'enregistrement stockant un flux binaire

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20140073472A (ko) * 2014-05-22 2014-06-16 인텔렉추얼디스커버리 주식회사 쿼드트리 구조 기반의 적응적 양자화 파라미터 부호화 및 복호화 방법 및 장치
US20140241422A1 (en) * 2011-06-28 2014-08-28 Samsung Electronics Co., Ltd. Method and apparatus for image encoding and decoding using adaptive quantization parameter differential
KR20160053879A (ko) * 2016-04-28 2016-05-13 디지털인사이트 주식회사 화면 내 펄스 부호 변조 블록을 위한 문맥 기반 적응적 양자화 및 역 양자화 방법 및 장치
KR20160079357A (ko) * 2014-12-26 2016-07-06 주식회사 케이티 파노라믹 비디오 영상의 관심 영역의 영상 전송 방법, 장치 및 디바이스
KR20170031202A (ko) * 2014-07-24 2017-03-20 후아웨이 테크놀러지 컴퍼니 리미티드 비디오 코딩에서의 적응형 역양자화 방법 및 장치

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140241422A1 (en) * 2011-06-28 2014-08-28 Samsung Electronics Co., Ltd. Method and apparatus for image encoding and decoding using adaptive quantization parameter differential
KR20140073472A (ko) * 2014-05-22 2014-06-16 인텔렉추얼디스커버리 주식회사 쿼드트리 구조 기반의 적응적 양자화 파라미터 부호화 및 복호화 방법 및 장치
KR20170031202A (ko) * 2014-07-24 2017-03-20 후아웨이 테크놀러지 컴퍼니 리미티드 비디오 코딩에서의 적응형 역양자화 방법 및 장치
KR20160079357A (ko) * 2014-12-26 2016-07-06 주식회사 케이티 파노라믹 비디오 영상의 관심 영역의 영상 전송 방법, 장치 및 디바이스
KR20160053879A (ko) * 2016-04-28 2016-05-13 디지털인사이트 주식회사 화면 내 펄스 부호 변조 블록을 위한 문맥 기반 적응적 양자화 및 역 양자화 방법 및 장치

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115022638A (zh) * 2022-06-30 2022-09-06 电子科技大学 一种面向全景视频编码的率失真优化方法

Also Published As

Publication number Publication date
KR20180131454A (ko) 2018-12-10

Similar Documents

Publication Publication Date Title
WO2018048078A1 (fr) Procédé de codage/décodage d'image multivue synchronisée à l'aide d'informations de structure spatiale et appareil associé
WO2018106047A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2021040480A1 (fr) Dispositif et procédé de codage vidéo sur la base d'un filtrage en boucle
WO2019132577A1 (fr) Procédé et dispositif d'encodage et de décodage d'image, et support d'enregistrement avec un train de bits stocké dedans
WO2018066958A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2021096172A1 (fr) Procédé de codage d'image basé sur une transformée, et dispositif associé
WO2018044089A1 (fr) Procédé et dispositif pour traiter un signal vidéo
WO2018056701A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2019216714A1 (fr) Procédé de traitement d'image fondé sur un mode de prédiction inter et appareil correspondant
WO2020036390A1 (fr) Procédé et appareil de traitement de signal d'image
WO2020242183A1 (fr) Procédé et dispositif de codage d'image sur la base d'une intraprédiction à grand angle et d'une transformée
WO2020180119A1 (fr) Procédé de décodage d'image fondé sur une prédiction de cclm et dispositif associé
WO2021040482A1 (fr) Dispositif et procédé de codage d'image à base de filtrage de boucle adaptatif
WO2018124819A1 (fr) Procédé et appareil pour traiter des signaux vidéo
WO2018221946A1 (fr) Procédé et dispositif de traitement de signal vidéo
WO2019009667A1 (fr) Procédé de traitement d'image synchronisée et appareil associé
WO2018131830A1 (fr) Procédé et dispositif de traitement de signal vidéo
WO2021034117A1 (fr) Procédé de décodage d'image et dispositif associé
WO2020262960A1 (fr) Procédé et dispositif de codage/décodage d'image utilisant une limitation de taille de transformée maximale d'un bloc de codage de composante de chrominance et procédé de transmission de flux binaire
WO2020262962A1 (fr) Procédé et appareil pour coder/décoder une vidéo en utilisant une limitation de taille maximale de bloc de transformée de saturation, et procédé de transmission de flux binaire
WO2020262963A1 (fr) Procédé et appareil de codage/décodage d'image utilisant maximum pour un bloc de chrominance, et procédé de transmission de flux binaire
WO2022182174A1 (fr) Procédé et dispositif de prédiction intra sur la base d'une dérivation d'un mode de prédiction intra
WO2018174542A1 (fr) Procédé et dispositif de traitement de signal vidéo
WO2021133100A1 (fr) Procédé et appareil de codage/décodage de vidéo permettant d'effectuer une pdpc, et procédé de transmission de flux binaire
WO2019182293A1 (fr) Procédé et appareil de traitement de signal vidéo

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 16.03.2020)

122 Ep: pct application non-entry in european phase

Ref document number: 18810847

Country of ref document: EP

Kind code of ref document: A1