[go: up one dir, main page]

WO2018174541A1 - 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
WO2018174541A1
WO2018174541A1 PCT/KR2018/003261 KR2018003261W WO2018174541A1 WO 2018174541 A1 WO2018174541 A1 WO 2018174541A1 KR 2018003261 W KR2018003261 W KR 2018003261W WO 2018174541 A1 WO2018174541 A1 WO 2018174541A1
Authority
WO
WIPO (PCT)
Prior art keywords
face
current
information
block
prediction
Prior art date
Application number
PCT/KR2018/003261
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 WO2018174541A1 publication Critical patent/WO2018174541A1/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/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/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • 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/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 perform motion compensation in consideration of continuity between faces in encoding / decoding a video signal.
  • An object of the present invention is to derive coding parameters from neighboring faces in consideration of continuity between faces in encoding / decoding video signals.
  • An object of the present invention is to adaptively determine the size of an image stored in a decoded picture buffer in consideration of continuity between faces in encoding / decoding a video signal.
  • An image decoding method and apparatus decodes reference face related information from a bitstream, and determines whether a face different from a current face including a current block is available as a reference face based on the information. , Motion information for the current block may be obtained, and motion compensation for the current block may be performed based on the determination and the motion information.
  • the video encoding method and apparatus determine whether a face different from the current face including the current block is available as a reference face, obtain motion information for the current block, and determine the determination and the motion information. Based on the motion compensation for the current block, the reference face related information may be encoded based on the determination.
  • the reference face related information may be information indicating whether a face located beyond a discontinuous face boundary from the current face can be used as a reference face.
  • the method and apparatus for image decoding / coding according to the present invention may reconstruct the current block by using the prediction sample obtained through the motion compensation and store the reconstructed current picture in a reconstructed picture buffer.
  • a face positioned beyond the discontinuous face boundary from the current face cannot be used as a reference face, only a part of the current picture may be stored in the reconstructed picture buffer.
  • the discontinuous face boundaries may indicate boundaries between faces that are adjacent to each other in the 2D plane but not adjacent to each other in 3D space.
  • the reference face related information may be information indicating whether a face having an index different from the current face can be used as the reference face.
  • the motion information of the current block may be derived from a face that is vertically or symmetrical with the current face.
  • the motion information includes a motion vector, and in the 2D plane, when the current face and the symmetrical face have different rotation angles, the motion vector of the current block is
  • the motion vector of the block included in the symmetrical face may be derived from a value that compensates for the rotational difference between the current face and the symmetrical face.
  • the encoding / decoding efficiency of a 360 degree video can be improved by allowing the coding parameter to be derived from a neighboring face according to the continuity between faces.
  • the buffer size can be reduced.
  • 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.
  • 15 and 16 illustrate an example in which frame packing is applied to a 360 degree projection image to which an OHP technique is applied.
  • FIG 17 illustrates a motion compensation method according to an embodiment of the present invention.
  • FIG. 18 illustrates an example of a picture unit stored in a reconstructed picture buffer when motion compensation for a discontinuous face is limited.
  • 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 encoding / decoding efficiency of the 360 degree projection image may be increased.
  • 15 and 16 illustrate an example in which frame packing is applied to a 360 degree projection image to which an OHP technique is applied.
  • the frame packing may be performed such that a continuous face is disposed adjacent to each other in the horizontal and horizontal directions.
  • 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.
  • frame packing may be performed such that a face continuous in a vertical direction in a 3D space is disposed adjacent to each other.
  • faces 2 and 6 having continuity in 3D space may be arranged to have continuity.
  • the face 1 and 3 which have the continuity of the face 2 and the horizontal direction can be arrange
  • the face 5 and 7 which have the continuity of the face 6 and the horizontal direction can be arrange
  • a triangular face located at the left, right, top or bottom boundary of the image may be divided into two parts.
  • the face 7 may be divided into two regions, and each divided region may be disposed on the left and right sides of the image.
  • faces 4 and 8 may be divided into two regions, and each divided region may be disposed at the top and bottom of the image.
  • Faces continuous in the left and right or horizontal directions in 3D space or faces continuous in the vertical and vertical directions in 3D space may be defined as symmetrical faces.
  • face 2 and face 6 may be defined as vertically symmetrical faces.
  • Face 3 and Face 2 neighboring each other in the frame-packed 360-degree projection image also neighbor each other in the 360-degree image restored to the octahedron.
  • the boundary between faces having continuity in both the frame-packed 360 degree projection image and the 3D reconstructed image may be defined as a continuous face boundary.
  • the frame-packed 360 degree projection image may be divided into a plurality of regions by a predetermined boundary represented by a vertical line, a horizontal line, or an angular line having a predetermined angle.
  • the predetermined boundary may be at least one of a discontinuous face boundary, a continuous face boundary determined based on the continuity of the image, or a straight line extending from the discontinuous face boundary or the continuous face boundary toward a predetermined direction (eg, vertical or horizontal direction).
  • a predetermined direction eg, vertical or horizontal direction.
  • the frame packed image shown in FIG. 15 may include a discrete face boundary between 7-R and face 5, a discrete face boundary between face 6 and face 2, a discrete face boundary between face 4 and face 1 or face 1. And divided into two or more regions based on at least one of the discontinuous face boundaries between face 8.
  • the frame packed image shown in FIG. 16 has a discontinuous face boundary between faces 8-L and 4-R and faces 1 and 5, and a discontinuous face boundary between faces 3 and 7 and faces 8-R and 4-L. It may be divided into two or more regions based on at least one of the.
  • Each divided area may consist of one or more faces.
  • segmentation related information of the 360 degree projection image may be predefined.
  • the segmentation related information may include at least one of a position, a number, an interval, and an angle of a predetermined boundary for dividing the 360 degree projection image.
  • the segmentation related information of the 360 degree projection image may be signaled through the bitstream.
  • the 360 degree projection image may be encoded / decoded in units of regions divided by a predetermined boundary.
  • encoding / decoding may be performed with interdependencies between regions, or encoding / decoding may be performed independently without interdependencies between regions.
  • the dependency may indicate that the encoding / decoding parameter in the predetermined region is determined by referring to the encoding / decoding parameter of the previously encoded / decoded region.
  • encoding / decoding of a predetermined region may include reconstructed texture data (eg, pixel value, residual value, or prediction value) of the region previously encoded / decoded, intra prediction related information (eg, mode candidate list, intra prediction). Mode or splitting technique), inter prediction related information (eg, a motion vector, a reference picture index, a prediction direction, a reference picture list, or a motion candidate list), a quantization parameter, or a transformation technique. .
  • information indicating inter-region dependencies may be signaled through the bitstream. For example, at least one of a flag indicating whether a predetermined region has a dependency on another region, an index for identifying another region having a dependency on the predetermined region, or information indicating symmetry between faces may be signaled through the bitstream.
  • the encoding parameter of the current face may be derived from the adjacent face according to whether or not it has symmetry with the adjacent face.
  • the motion information of the block belonging to the predetermined face can be derived from the face symmetrical with the predetermined face.
  • the motion information may include at least one of a motion vector, a reference picture index, or prediction direction information.
  • the motion information of a block belonging to a predetermined face may be derived from a block belonging to a face that is left or right or up and down symmetrical while having a continuous face boundary.
  • motion information of a block belonging to face 3 may be derived from motion information of a block belonging to face 2, which is a symmetrical face.
  • motion information of a block belonging to face 2 may be derived from motion information of a block belonging to face 6, which is a vertically symmetrical face.
  • the motion vector of the block belonging to the predetermined face may be obtained by compensating the rotation angle difference to the motion vector of the block belonging to the symmetrical face.
  • the motion vector of the block belonging to face 3 may be derived based on a value of the angular rotation of the motion vector of the block belonging to face 2.
  • a motion vector of a block belonging to a predetermined face may be derived in the same manner as a motion vector of a block belonging to a symmetrical face, or may be derived by multiplying a motion vector of a block belonging to a symmetrical face by scaling, offsetting, or weighting.
  • information specifying a position of a face having a dependency may not be signaled separately.
  • Intra / intra prediction of a block belonging to a given face may be performed using a sample belonging to a face different from the given face.
  • motion compensation of the current block may be performed using a reference block belonging to a face different from the current face in the reference picture (that is, a face different from the current face and the face index).
  • a reference block belonging to a face different from the current face in the reference picture that is, a face different from the current face and the face index
  • continuity of a face boundary may be considered.
  • motion prediction, motion compensation, or intra prediction may be limited based on continuity of a face boundary.
  • the motion compensation for the current block may be limited such that the motion compensation is not performed through the face located beyond the discontinuous face boundary from the current face including the current block. That is, a block belonging to a face located beyond the discontinuous face boundary from the co-located face corresponding to the current face in the reference picture may be restricted from being used as a reference block of the current block. Accordingly, the motion vector of the current block may also be restricted so as not to point to a face located beyond the discrete face boundary from the current face.
  • a block belonging to a face located beyond the continuous face boundary from the current face may be used as a reference block of the current block without limitation.
  • discontinuous face a face located beyond the discontinuous boundary from the current face.
  • FIG 17 illustrates a motion compensation method according to an embodiment of the present invention.
  • the image encoding apparatus may encode information indicating whether motion compensation using a discontinuous face is limited to the bitstream.
  • the apparatus for encoding an image may determine whether to use a discontinuous face during motion compensation by comparing cost values when the motion compensation using the discontinuous face is limited and the motion compensation using the discontinuous face. have.
  • isDisConti_MC_enabled_flag may be a syntax indicating whether motion compensation is limited through discontinuous paces.
  • Decoding may decode isDisConti_MC_enabled_flag from the bitstream, and determine whether motion compensation through discontinuous faces is limited based on the value of the decoded isDisConti_MC_enabled_flag. For example, an isDisConti_MC_enabled_flag of 0 (or 1) may indicate that motion compensation using a discontinuous face is limited, and an isDisConti_MC_enabled_flag of 1 (or 0) may indicate that motion compensation using a discontinuous face is allowed.
  • the information may be encoded in a sequence unit, picture unit, slice unit, face unit, or block unit.
  • a syntax inter_face_idc [i] [j] indicating whether a face of index i can be referred to from a face of index i may be signaled.
  • a value of 0 (or 1) of inter_face_idc [i] [j] indicates that blocks included in face i cannot refer to blocks included in face j
  • a value of inter_face_idc [i] [j] is 1 (Or 0) indicates that blocks included in face i may perform motion compensation with reference to blocks included in face j.
  • face j may be an adjacent face of face i, having a discontinuous face boundary with face i.
  • inter_face_idc information may be signaled for each of the plurality of faces.
  • inter_face_idc information may be signaled for a face that is not adjacent to face i.
  • motion information on the current block may be obtained (S1702).
  • the motion information of the current block may be derived from a block included in a face associated with the current face including the current block.
  • the motion information of the current block may be derived from a block included in a face that is symmetrical with the current face.
  • the reference block in the symmetrical face used to derive the motion information of the current block may have the same position as the current block in the symmetrical face or a position symmetrical with the current block based on the symmetry point of the current face and the symmetrical face.
  • the predefined position is a block adjacent to the boundary of the symmetrical face, and may be a block located on the same horizontal line as the current block or on the same vertical line as the current block.
  • the motion information of the current block may be derived based on the merge or the AMVP mode.
  • the motion information of the current block may be derived in the same manner as the motion information of the merge candidate specified by the merge index among the plurality of merge candidates.
  • the merge candidate may be derived from at least one of a neighboring block and a collocated block neighboring the current block.
  • the neighboring block may include at least one of neighboring blocks on the left side, the upper side, the upper left side, the upper right side, and the lower left side of the current block.
  • the reference picture index and the motion prediction direction of the current block may be determined based on the information signaled through the bitstream.
  • the motion vector of the current block may be derived based on a motion vector prediction value specified by a prediction index (or a prediction flag) among a plurality of motion vector prediction candidates.
  • the motion vector of the current block may be derived based on the motion prediction value and the motion vector difference signaled through the bitstream.
  • the motion vector prediction candidate may be derived from at least one of a neighboring block and a collocated block neighboring the current block.
  • the neighboring block may include at least one of neighboring blocks on the left side, the upper side, the upper left side, the upper right side, and the lower left side of the current block.
  • the neighboring block belonging to the face located beyond the discontinuous boundary from the current face including the current block may be determined to be unavailable as a motion vector candidate for the current block.
  • the motion vector candidate may indicate a merge candidate under a merge mode or a motion prediction candidate under an AMVP mode.
  • An unavailable motion vector candidate may be replaced with a block included in a face that is continuous with the current face in 3D space.
  • a prediction sample for the current block may be obtained (S1703), and the current block may be reconstructed using the prediction sample of the current block (S1704).
  • the reconstructed picture may be stored in a reconstructed picture buffer (DPB) and used as a reference picture.
  • the picture unit stored in the decoded picture buffer may be adaptively determined according to whether motion compensation for the discontinuous face is limited. For example, when it is determined whether motion compensation for discontinuous faces is limited in units of sequences, the reconstructed picture buffer may be adaptively used according to the determination in units of sequences.
  • FIG. 18 illustrates an example of a picture unit stored in a reconstructed picture buffer when motion compensation for a discontinuous face is limited.
  • a part of the entire picture may be stored in the reconstructed picture buffer.
  • a rectangular sub picture including a continuous face boundary between faces 5 and 6 and a continuous face boundary between faces 2, 3, and 4 is stored in the reconstructed picture buffer.
  • a rectangular sub picture including phases 1-R, 8, and 7-L may not be stored in the reconstructed picture buffer.
  • inter prediction may be set not to be allowed, or only inter prediction in which a reference picture is a current picture is allowed.
  • the entire picture can be stored in the reconstructed picture buffer.
  • the continuity of the face boundary may be considered. For example, a sample belonging to a face located beyond a discontinuous boundary from a current face including a current block may be determined to be unavailable as a reference sample for intra prediction of the current block. An unavailable sample may be replaced with a sample included in a face that is continuous with the current face in 3D space.
  • 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

La présente invention concerne un procédé de décodage d'image pouvant comprendre les étapes consistant à : décoder, à partir d'un flux binaire, des informations associées à une face de reference ; sur la base des informations, déterminer si une face différente d'une face actuelle comprenant un bloc actuel peut être utilisée en tant que face de référence ; acquérir des informations de mouvement du bloc actuel ; et effectuer une compensation de mouvement sur le bloc actuel sur la base de la détermination et des informations de mouvement.
PCT/KR2018/003261 2017-03-21 2018-03-21 Procédé et dispositif de traitement de signal vidéo WO2018174541A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
KR10-2017-0035278 2017-03-21
KR20170035278 2017-03-21

Publications (1)

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

Family

ID=63584630

Family Applications (1)

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

Country Status (2)

Country Link
KR (1) KR20180107006A (fr)
WO (1) WO2018174541A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11102503B2 (en) 2019-01-07 2021-08-24 Electronics And Telecommunications Research Institute Motion information prediction method and apparatus for distortion due to projection formation conversion

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20050092306A (ko) * 2004-03-15 2005-09-21 삼성전자주식회사 회전 매칭을 통해 움직임을 예측하는 영상 부호화 장치 및방법
CN105409220A (zh) * 2013-07-15 2016-03-16 高通股份有限公司 用于视频译码的经解码图片缓冲器操作
WO2016056821A1 (fr) * 2014-10-08 2016-04-14 엘지전자 주식회사 Procédé et dispositif de compression d'informations de mouvement pour un codage de vidéo tridimensionnelle (3d)

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20050092306A (ko) * 2004-03-15 2005-09-21 삼성전자주식회사 회전 매칭을 통해 움직임을 예측하는 영상 부호화 장치 및방법
CN105409220A (zh) * 2013-07-15 2016-03-16 高通股份有限公司 用于视频译码的经解码图片缓冲器操作
WO2016056821A1 (fr) * 2014-10-08 2016-04-14 엘지전자 주식회사 Procédé et dispositif de compression d'informations de mouvement pour un codage de vidéo tridimensionnelle (3d)

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
HUNG-CHIH LIN: "AHG8: An efficient compact layout for octahedron format", JOINT VIDEO EXPLORATION TEAM (JVET) OF ITU-T SG 16 WP 3, 21 October 2016 (2016-10-21), Chengdu, CN, XP055506578 *
PHILIPPE HANHART: "AHG8: Reference samples derivation using geometry padding for intra coding", JOINT VIDEO EXPLORATION TEAM (JVET) OF ITU-T SG 16 WP 3, 21 October 2016 (2016-10-21), Chengdu, CN, XP030150329 *

Also Published As

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

Similar Documents

Publication Publication Date Title
WO2018117706A1 (fr) Procédé et dispositif de traitement de signal vidéo
WO2018062921A1 (fr) Procédé et appareil de partitionnement et de prédiction intra de blocs dans un système de codage d'image
WO2018044088A1 (fr) Procédé et dispositif de traitement d'un signal vidéo
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
WO2019198997A1 (fr) Procédé de codage d'image à base d'intraprédiction et appareil pour cela
WO2020189960A1 (fr) Procédé et dispositif de signalisation d'informations sur un format de chrominance
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
WO2020149630A1 (fr) Procédé et dispositif de décodage d'image basé sur une prédiction cclm dans un système de codage d'image
WO2020141932A1 (fr) Procédé et appareil de prédiction inter utilisant des mmvd de cpr
WO2018124819A1 (fr) Procédé et appareil pour traiter des signaux 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
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
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
WO2018074813A1 (fr) Procédé et dispositif de codage ou de dé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
WO2018174542A1 (fr) Procédé et dispositif de traitement de signal vidéo
WO2018174541A1 (fr) Procédé et dispositif de traitement de signal vidéo
WO2020141884A1 (fr) Procédé et appareil de codage d'image en utilisant une mmvd sur la base d'un cpr
WO2020130629A1 (fr) Procédé de codage d'image basé sur une prédiction intra de ligne de référence multiple et dispositif associé
WO2019045393A1 (fr) Procédé et dispositif de traitement de signal vidéo
WO2023132623A1 (fr) Procédé de codage/décodage de signal vidéo, et support d'enregistrement sur lequel est stocké un train de bits
WO2023068731A1 (fr) Procédé de décodage d'image et appareil associé

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

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

122 Ep: pct application non-entry in european phase

Ref document number: 18770856

Country of ref document: EP

Kind code of ref document: A1