WO2018174531A1 - 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
WO2018174531A1
WO2018174531A1 PCT/KR2018/003243 KR2018003243W WO2018174531A1 WO 2018174531 A1 WO2018174531 A1 WO 2018174531A1 KR 2018003243 W KR2018003243 W KR 2018003243W WO 2018174531 A1 WO2018174531 A1 WO 2018174531A1
Authority
WO
WIPO (PCT)
Prior art keywords
image
polar region
degree
region
block
Prior art date
Application number
PCT/KR2018/003243
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 WO2018174531A1 publication Critical patent/WO2018174531A1/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/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/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/12—Selection from among a plurality of transforms or standards, e.g. selection between discrete cosine transform [DCT] and sub-band transform or selection between H.263 and H.264
    • H04N19/122—Selection of transform size, e.g. 8x8 or 2x4x8 DCT; Selection of sub-band transforms of varying structure or type
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/172—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a picture, frame or field
    • 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/85—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression

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 provide a method and apparatus for projection-converting a 360 degree image in two dimensions in generating / playing a video signal.
  • An object of the present invention is to provide a method of performing frame packing using continuity between faces in generating / playing a video signal.
  • An object of the present invention is to perform frame packing by dividing a 360 degree image into a polar region and an intermediate region in generating / playing a video signal.
  • the method and apparatus for generating 360-degree image data determine a projection conversion method for a 360-degree image, and based on the projection conversion method, a 360-degree projection image in which the 360-degree image is projected onto a 2D plane Acquire, perform frame packing on the 360 degree projection image, and encode the frame packed 360 degree projection image.
  • the 360-degree image playback method and apparatus perform decoding on a frame-packed 360-degree projection image, perform frame depacking on the decoded 360-degree projection image, and 360-degree image. And a projection conversion method for the projection, and based on the projection conversion method, a 360-degree image obtained by projecting the 360-degree projection image on which the frame depacking is performed on the 3D space may be obtained.
  • the frame packing may include dividing the 360-degree image into a polar region and a central region, and converting the polar region into a predefined form. Can be.
  • the polar region includes a first polar region and a second polar region which are not adjacent to each other, and the frame packing includes a converted first polar region and And rearranging the converted second polar region on one side of the central region.
  • the rearrangement comprises arranging the converted first polar region adjacent to a predetermined direction boundary of the central region, and converting the converted second polar region. And arranging adjacent to the predetermined direction boundary of the converted first polar region.
  • the rearrangement comprises arranging both the converted first polar region and the converted second polar region adjacent to a predetermined boundary of a central region. It may include.
  • the frame packing may include rotating the rearranged image by a predetermined angle.
  • the polar region includes a plurality of stripes
  • converting the polar region into a predefined form includes converting the first stripe into a predetermined form. Resampling into lines, and resampling a second stripe adjacent to the first stripe and farther away from the first stripe into a predetermined shape line surrounding the resampled first stripe.
  • the encoding / decoding efficiency can be improved by projecting and converting a 360 degree image in two dimensions.
  • frame packing is performed by dividing a 360-degree image into a polar region and an intermediate region, thereby improving encoding / decoding efficiency.
  • 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.
  • 23 and 24 illustrate examples of rearranging polar regions in square blocks.
  • 25 to 28 are views illustrating an example of a frame packing method according to the present invention.
  • FIG. 29 is a diagram illustrating an example of rearranging polar regions in a non-square block.
  • FIGS. 30 and 31 are views illustrating an example of a frame packing method according to the present invention.
  • 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 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.
  • 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 continuity between the faces is high, and the cube projection method has an advantage of higher coding efficiency than the isotonic diagram method.
  • encoding / decoding may be performed by rearranging the 2D projection-converted image into a quadrangle form.
  • 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.
  • Each face within a picture may be assigned an index to identify each face.
  • Each face may be parallelized, 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 different faces from the current block may be determined to be available for intra prediction or inter prediction of the current block, depending on whether parallel processing between faces or dependencies is possible.
  • the left boundary of face 5 is adjacent to the right boundary of face 1 that does not have continuity in 3D space, and the right boundary of face 5 has a left boundary of face 2 that does not have continuity in 3D space. It is shown to be located adjacent to.
  • frame packing may be performed such that three faces having continuity in 3D space are disposed adjacent to each other.
  • the top faces 2, 3, and 4 positioned at the top of the 2D development view may be arranged to have mutual continuity.
  • the upper faces 2 and 4 of the upper and lower faces 3 may be rotated.
  • the two or more faces may be mutually continuous, thereby placing at least some of the remaining faces.
  • the bottom faces 5 and 6 positioned at the bottom on the 2D development view may be arranged to have mutual continuity, and the bottom faces 7 and 8 may be arranged to have mutual continuity. It is also possible to rotate the bottom faces such that the bottom faces are continuous.
  • the remaining one face may be arranged on the left side, the right side, or the empty space of the image.
  • the upper face 1 is disposed on the left or right side of the image, or in the example shown in (b) or (c) of FIG. 15. Similarly, you can place top face 1 between two faces.
  • the bottom faces 6, 7, 8 located at the bottom on the 2D development view may be arranged to have mutual continuity.
  • the lower faces 6 and 8 of the lower face 7 may be rotated.
  • the two or more faces may be mutually continuous, thereby placing at least some of the remaining faces.
  • the top faces 1 and 2 positioned at the top of the 2D development view may be arranged to have mutual continuity, and the top faces 3 and 4 may be arranged to have the mutual continuity. It is also possible to rotate the bottom faces such that the top faces are continuous.
  • the remaining one face may be arranged on the left side, the right side, or the empty space of the image.
  • the lower face 5 is disposed on the left or right side of the image, or in the example shown in (b) or (c) of FIG. 16. Likewise, you can place the lower face 5 between the two faces.
  • Each face is a triangle under the OHP technique, and the problem is that the image obtained by arranging the faces in a line is not rectangular. Accordingly, by dividing the predetermined face into two, frame packing may be performed in which the divided first portion and the second portion are disposed at both ends of the image.
  • FIG. 17 is a view showing an example in which the upper faces 2, 3, 4 are arranged to have continuity
  • FIG. 18 is a view showing an example in which the lower faces 6, 7, 8 are arranged to have continuity.
  • frame packing may be performed by dividing a face disposed on the left side or the right side of the image in two, and arranging the divided first portion on the left side of the image and the divided second portion on the right side of the image.
  • the upper face 1 is divided into two, and the divided first portion 1-R is disposed on the left side or the top of the image.
  • the divided second portion 1 -L may be disposed on the right side of the image or the bottom of the image.
  • 17 (c) and (d) show an example in which the lower face 7 and the lower face 8 are divided into two, respectively.
  • the lower face 5 is divided into two, the divided first portion 5-R is disposed on the left side of the image or the top of the image, and divided.
  • the second portion 5-L may be disposed on the right side of the image or the bottom of the image.
  • 18 (c) and (d) show an example in which the upper face 4 and the upper face 3 are divided into two, respectively.
  • Frame packing may be performed by rotating the 2D projection image illustrated in FIGS. 15 to 18 in a clockwise or counterclockwise direction.
  • frame packing may be performed to rotate the 2D projection image 90 degrees, 180 degrees, or 270 degrees in a clockwise or counterclockwise direction.
  • FIGS. 19 and 20 are views showing an example in which the upper faces 2, 3, and 4 are arranged in continuity
  • FIGS. 21 and 22 are views showing an example in which the lower faces 6, 7, and 8 are arranged in continuity.
  • a 360-degree projection image having a width longer than the height may be obtained through rotation.
  • the memory footage can be reduced in encoding / decoding the 360-degree projected image, thereby maintaining a small data bus capacity in the implementation.
  • the memory footage may refer to a basic unit for fetching memory from one sample array.
  • the 2D projection-converted 360 degree projection image may be divided into a plurality of regions using the ERP technique.
  • the plurality of regions may include two polar regions and a remaining central region, or may include N regions having the same size.
  • N may be two or more natural numbers.
  • the 360-degree projection image which is converted by projection based on the ERP technique, may be divided into three regions, such as two polar regions and a remaining center region.
  • the polar region may include a region corresponding to a predetermined height from the upper boundary of the 360 degree projection image (North pole region) and a region corresponding to a predetermined height from the bottom boundary of the 360 degree projection image (Antarctic region).
  • North pole region a region corresponding to a predetermined height from the upper boundary of the 360 degree projection image
  • Antarctic region a region corresponding to a predetermined height from the bottom boundary of the 360 degree projection image
  • the region where the latitude value is above a predetermined reference value is defined as the polar region in the northern and southern hemispheres
  • the remaining region except the two polar regions is defined as the central region. Can be.
  • the shape or size of at least some of the divided regions may be changed.
  • two polar regions may be modified (or rearranged) in a predetermined form.
  • the predetermined form may be a square block such as square or non-square, or may be a polygonal shape other than a circle or a square.
  • 23 and 24 illustrate examples of rearranging polar regions in square blocks.
  • the polar region is shown to include at least one stripe (or line).
  • one stripe (or line) may include one sample row or a predetermined number of sample rows.
  • the number of stripes constituting the polar region may be set to a predefined value, or may be adaptively set for each sequence or slice.
  • the size (height) of the arctic region and the south pole region is set to H / 4
  • the size (height) of the central ERP region is Can be set to H / 2.
  • the region with the latitude value of 45 degrees or more in the northern and southern hemispheres is defined as the polar region, and the remaining region except the two polar regions is defined as the central region, so that the height is H /.
  • Polar regions of 4 and central ERP regions of height H / 2 may be obtained.
  • the size (height) of the north pole region and the south pole region is set to H / 6
  • the size (height) of the central ERP region is 2H.
  • the region with the latitude value of 30 degrees or more in the northern and southern hemispheres is defined as the polar region, and the remaining region except the two polar regions is defined as the central region, so that the height is H /.
  • a polar region of 6 and a central ERP region of 2H / 3 can also be obtained.
  • the stripe corresponding to the pole (that is, the top / bottom stripe of the ERP projection converted image) is resampled to the sample corresponding to the center point of the rectangular block, and the residual The stripe can be resampled into square lines in the square block.
  • the stripe located at the pole may be resampled into a sample corresponding to the center point of the rectangular block, and the stripe adjacent to the stripe located at the pole may be resampled into a rectangular line surrounding the sample corresponding to the center point.
  • the rectangular block may be configured by resampling the second stripe adjacent to the first stripe and farther away from the first stripe into the rectangular line surrounding the first stripe.
  • a rectangular block formed by rearranging polar regions is referred to as a 'resampling block'.
  • a rectangular block formed by rearranging the arctic regions is referred to as a first resampling block
  • a rectangular block formed by rearranging the south polar regions is referred to as a second resampling block.
  • the size of the resampling block may be variably determined based on at least one of the size of the polar region (eg, the width or height of the polar region) or the size of the central ERP region (eg, the width or height of the central ERP region). have.
  • a square block having a height and a width twice the height of the polar region may be generated.
  • the polar region of H / 4 height may be rearranged into a forward block having a size of H / 2 on one side, or the polar region of H / 6 height may be rearranged into a square block having a size of H / 3 on one side.
  • the height of the square block generated by rearranging the polar region may be the same as the central ERP region.
  • the height of the square block generated by rearranging the polar region has a size 1/2 of the height of the central ERP region. Can be.
  • At least one of information indicating the size of the polar region, the size of the central ERP region, or the size ratio between the central ERP region and the resampling block may be encoded and transmitted to the decoder through the bitstream.
  • the decoder may determine the size of the resampling block using at least one of the size of the polar region, the size of the central ERP region, or information indicating the size ratio between the central ERP region and the resampling block.
  • At least one of the size of the resampling block, the size of the central ERP region, or the size ratio between the central ERP region and the resampling block may be predefined.
  • a frame rearrangement or frame packing may be performed to rearrange faces in a two-dimensional space.
  • each of the two resampling blocks may be defined at different faces.
  • the central ERP region may be defined as one face, or the central ERP region may be divided into a plurality of regions, and each partitioned region may be defined as a face.
  • Frame packing may be performed by arranging the resampling blocks corresponding to the polar region and one side of the central ERP region.
  • 25 to 28 are views illustrating an example of a frame packing method according to the present invention.
  • Frame packing may be performed such that the resampling blocks corresponding to the polar region are arranged in line with the central ERP region. For example, if the height of the resampling block is the same as the height of the central ERP region, as shown in the example shown in FIG. 25, the first resampling block or the second resampling block is disposed on one side of the central ERP region, and the remaining resampling block is written. Frame packing adjacent to the arranged first resampling block or the second resampling block may be performed. Accordingly, either one of the first resampling block or the second resampling block may be adjacent to one boundary of the central ERP region while the other may be spaced apart from the central ERP region.
  • frame packing may be performed such that all of the resampling blocks corresponding to the polar region are adjacent to one boundary of the central ERP region.
  • the height of the resampling block is 1/2 of the height of the central ERP region, as shown in FIG. 26, one side of the central ERP region is divided into two portions, and the first resampling block is adjacent to one portion.
  • the second resampling block may be disposed adjacent to each other. In this case, positions of the first resampling block and the second resampling block may be predefined.
  • the resampling blocks are arranged on the right side of the central ERP region.
  • the present invention is not limited thereto, and the resampling blocks may be disposed on the left side, the upper side, or the bottom side of the central ERP region.
  • the resampling blocks may be disposed on both sides of the central ERP region.
  • one of the first resampling block or the second resampling block may be disposed on the left side of the central ERP region, and the other one may be disposed on the right side of the central ERP region.
  • the faces may be rotated.
  • frame packing may be performed by rotating the image illustrated in FIGS. 25 and 26 by 90 degrees.
  • the resampling blocks are shown disposed at the lower end of the central ERP region rotated 90 degrees, but it is also possible to arrange the resampling blocks at the upper end of the central ERP region rotated 90 degrees.
  • frame packing may be performed by rotating the image illustrated in FIGS. 25 and 26 by 90 degrees, 180 degrees, or 270 degrees in a clockwise or counterclockwise direction.
  • the memory footage is encoded when the 360-degree projected image is encoded / decoded. It can be made small, which has the advantage of keeping the data bus capacity small at implementation.
  • the memory footage may refer to a basic unit for fetching memory from one stripe.
  • the polar regions are shown to be rearranged into square shaped blocks. As another example, polar regions may be rearranged into non-square blocks.
  • FIG. 29 is a diagram illustrating an example of rearranging polar regions in a non-square block.
  • the stripes corresponding to the poles may be resampled to samples at specific positions, and the stripes adjacent to the poles may be resampled to surround the samples at particular positions.
  • the stripe located at the pole may be resampled into a sample adjacent to the block boundary, and then the stripe adjacent to the stripe located at the pole may be resampled into an uneven line surrounding the sample adjacent to the block boundary.
  • the non-square block can be configured by resampling the second stripe adjacent to the first stripe and farther away from the first stripe into the uneven line surrounding the first stripe.
  • the resampling block shown in FIG. 29 is rotated (eg, rotated 90 degrees, 180 degrees or 270 degrees) in a specific direction.
  • frame packing may be performed in which the non-square block is arranged on one side of the central ERP region.
  • FIGS. 30 and 31 are views illustrating an example of a frame packing method according to the present invention.
  • frame packing may be performed in which resampling blocks corresponding to the polar region are arranged up and down at one boundary of the central ERP region.
  • a first resampling block having a width of H / 2 and a height of H / 4 is adjacent to an upper portion of the right boundary of the central ERP region, and a width of H / 2 and a height of H / 4 at a lower portion of the right boundary of the central ERP region.
  • the second resampling block may be adjacent to each other.
  • frame packing may be performed by rotating the image illustrated in FIG. 30 by 90 degrees.
  • the resampling blocks are disposed at the lower end of the central ERP region rotated by 90 degrees.
  • the resampling blocks may be disposed at the upper end of the central ERP region rotated by 90 degrees.
  • frame packing may be performed by rotating the image shown in FIG. 30 in a clockwise or counterclockwise direction by 90 degrees, 180 degrees, or 270 degrees.
  • the polar regions are shown to be rearranged into rectangular blocks.
  • a square face including a polar region converted into a circle or a polygonal shape is defined, and frame packing as in the example shown in FIGS. 25 to 28 or 30 and 31 described above may be performed.
  • the sample value of the area not filled by the circle or polygonal shape among the square faces is at least one of a predefined sample value, a sample value located at the boundary of the polar region, or a sample value located at the boundary of the central ERP region. Can be determined based on one.
  • the predetermined space is set when a portion corresponding to a predetermined spatial region of the 360 degree image is set as the first region and the 360 degree image is rotated in a predetermined direction / predetermined angle. It is also possible to set the part located in the area as the second area. For example, a second 360-degree projection obtained after obtaining a first region from a first 360-degree projection image generated by converting a 360-degree image through an ERP technique, and rotating the 360-degree image by a predetermined direction / predetermined angle. A second area may be obtained from the image.
  • the location and size of the first area and the second area on the first 360 degree projection image and the second 360 degree projection image may be the same, but the space corresponding to the first area and the second area in 3D space
  • the regions may be different from each other.
  • a projection transformation method of dividing a 360 degree image into two polar regions and a central region may be defined as a new projection transformation method.
  • a projection transformation method of dividing a 360 degree image into two polar regions and a central region may be defined as a nested polygon ERP.
  • the square nested polygon ERP, the non-square nested polygon ERP, and the like may be separately defined according to the transformation form of the polar region.
  • An index for identifying the nested polygon ERP technique among a plurality of projection transformation techniques may be allocated.
  • index information indicating the nested polygon ERP scheme may be encoded and transmitted through a bitstream.
  • 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)
  • Physics & Mathematics (AREA)
  • Discrete Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

Un procédé de génération de données d'image à 360 degrés, selon la présente invention, peut comprendre les étapes consistant à : déterminer un procédé de transformation projective pour une image à 360 degrés ; sur la base du procédé de transformation projective, acquérir une image projetée à 360 degrés ayant l'image à 360 degrés projetée sur un plan 2D ; opérer un garnissage de trame sur l'image projetée à 360 degrés ; et encoder l'image projetée à 360 degrés ayant fait l'objet d'un garnissage de trame. Selon l'invention, l'étape de garnissage de trame peut comprendre les étapes consistant à : cloisonner l'image à 360 degrés en régions extrêmes et en une région centrale ; et transformer les régions extrêmes en formes prédéfinies.
PCT/KR2018/003243 2017-03-21 2018-03-20 Procédé et dispositif de traitement de signal vidéo WO2018174531A1 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
KR20170035277 2017-03-21
KR20170035276 2017-03-21
KR10-2017-0035277 2017-03-21
KR10-2017-0035276 2017-03-21

Publications (1)

Publication Number Publication Date
WO2018174531A1 true WO2018174531A1 (fr) 2018-09-27

Family

ID=63585477

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2018/003243 WO2018174531A1 (fr) 2017-03-21 2018-03-20 Procédé et dispositif de traitement de signal vidéo

Country Status (2)

Country Link
KR (1) KR20180107001A (fr)
WO (1) WO2018174531A1 (fr)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11394946B2 (en) 2018-10-30 2022-07-19 Lg Electronics Inc. Video transmitting method, video transmitting apparatus, video receiving method, and video receiving apparatus
CN113170104A (zh) 2018-11-15 2021-07-23 韩国电子通信研究院 使用基于区域的帧间/帧内预测的编码/解码方法和设备
US11350074B2 (en) 2019-03-20 2022-05-31 Electronics And Telecommunications Research Institute Method for processing immersive video and method for producing immersive video

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20150029461A (ko) * 2013-09-10 2015-03-18 (주)포스트미디어 파노라마 영상의 스트리밍 서비스 제공 시스템에서 타일링 영상 동기화 방법
WO2016076680A1 (fr) * 2014-11-14 2016-05-19 Samsung Electronics Co., Ltd. Codage de vidéos à 360 degrés grâce à un lissage adaptatif de région
KR20160079357A (ko) * 2014-12-26 2016-07-06 주식회사 케이티 파노라믹 비디오 영상의 관심 영역의 영상 전송 방법, 장치 및 디바이스
KR20170017700A (ko) * 2015-08-07 2017-02-15 삼성전자주식회사 360도 3d 입체 영상을 생성하는 전자 장치 및 이의 방법

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20150029461A (ko) * 2013-09-10 2015-03-18 (주)포스트미디어 파노라마 영상의 스트리밍 서비스 제공 시스템에서 타일링 영상 동기화 방법
WO2016076680A1 (fr) * 2014-11-14 2016-05-19 Samsung Electronics Co., Ltd. Codage de vidéos à 360 degrés grâce à un lissage adaptatif de région
KR20160079357A (ko) * 2014-12-26 2016-07-06 주식회사 케이티 파노라믹 비디오 영상의 관심 영역의 영상 전송 방법, 장치 및 디바이스
KR20170017700A (ko) * 2015-08-07 2017-02-15 삼성전자주식회사 360도 3d 입체 영상을 생성하는 전자 장치 및 이의 방법

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
BYEONGDOO CHOI: "WD on ISO/IEC 23000-20 Omnidirectional Media Application Format", MPEG MEETING 115, GENEVA, MOTION PICTURE EXPERT GROUP OR ISO/IEC JTC1/SC29/WG11, N16189, 3 June 2016 (2016-06-03), pages 1 - 40, XP055516833 *

Also Published As

Publication number Publication date
KR20180107001A (ko) 2018-10-01

Similar Documents

Publication Publication Date Title
WO2018117706A1 (fr) Procédé et dispositif de traitement de signal vidéo
WO2018044088A1 (fr) Procédé et dispositif de traitement d'un signal vidéo
WO2020246849A1 (fr) Procédé de codage d'image fondé sur une transformée et dispositif associé
WO2013154366A1 (fr) Procédé de transformation faisant appel à des informations de bloc, et appareil utilisant ce procédé
WO2018056702A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2018128247A1 (fr) Procédé et dispositif d'intra-prédiction dans un système de codage d'image pour vidéo à 360 degrés
WO2018124819A1 (fr) Procédé et appareil pour traiter des signaux vidéo
WO2020141932A1 (fr) Procédé et appareil de prédiction inter utilisant des mmvd de cpr
WO2020141928A1 (fr) Procédé et appareil de décodage d'image sur la base d'une prédiction basée sur un mmvd dans un système de codage d'image
WO2018174531A1 (fr) Procédé et dispositif de traitement de signal vidéo
WO2019009600A1 (fr) Procédé et appareil de décodage d'image utilisant des paramètres de quantification basés sur un type de projection dans un système de codage d'image pour une vidéo à 360 degrés
WO2020141885A1 (fr) Procédé et dispositif de décodage d'image au moyen d'un filtrage de dégroupage
WO2020184821A1 (fr) Procédé et dispositif pour configurer une liste mpm
WO2018074813A1 (fr) Procédé et dispositif de codage ou de décodage d'image
WO2021034161A1 (fr) Dispositif et procédé de prédiction intra
WO2018174542A1 (fr) Procédé et dispositif de traitement de signal vidéo
WO2020149616A1 (fr) Procédé et dispositif de décodage d'image sur la base d'une prédiction cclm dans un système de codage d'image
WO2019083119A1 (fr) Procédé et dispositif de décodage d'image utilisant des paramètres de rotation dans un système de codage d'image pour une vidéo à 360 degrés
WO2020055208A1 (fr) Procédé et appareil de prédiction d'image pour prédiction intra
WO2018174541A1 (fr) Procédé et dispositif de traitement de signal vidéo
WO2022039499A1 (fr) Procédé de codage/décodage d'image, dispositif et support d'enregistrement lisible par ordinateur à des fins de signalisation de flux binaire vcm
WO2019190203A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2019182293A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2021034160A1 (fr) Appareil et procédé de codage d'image sur la base d'une prédiction intra matricielle
WO2019190197A1 (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: 18772269

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 02.01.2020)

122 Ep: pct application non-entry in european phase

Ref document number: 18772269

Country of ref document: EP

Kind code of ref document: A1