[go: up one dir, main page]

WO2018143670A1 - Procédé et dispositif de codage/décodage d'image - Google Patents

Procédé et dispositif de codage/décodage d'image Download PDF

Info

Publication number
WO2018143670A1
WO2018143670A1 PCT/KR2018/001341 KR2018001341W WO2018143670A1 WO 2018143670 A1 WO2018143670 A1 WO 2018143670A1 KR 2018001341 W KR2018001341 W KR 2018001341W WO 2018143670 A1 WO2018143670 A1 WO 2018143670A1
Authority
WO
WIPO (PCT)
Prior art keywords
information
coefficient
decoding
region
probability
Prior art date
Application number
PCT/KR2018/001341
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
Priority claimed from KR1020180007285A external-priority patent/KR20180089290A/ko
Priority to EP18747331.9A priority Critical patent/EP3579557A4/fr
Priority to CN202210973259.9A priority patent/CN115379222A/zh
Priority to CN202210975749.2A priority patent/CN115379226A/zh
Priority to JP2019541229A priority patent/JP2020505870A/ja
Priority to CN202210975650.2A priority patent/CN115379225A/zh
Priority to CN202210973907.0A priority patent/CN115379224A/zh
Priority to CN201880009395.8A priority patent/CN110235445B/zh
Application filed by 세종대학교 산학협력단 filed Critical 세종대학교 산학협력단
Priority to CN202210973319.7A priority patent/CN115379223A/zh
Priority to US16/482,457 priority patent/US11425426B2/en
Priority to EP23195330.8A priority patent/EP4270956A3/fr
Publication of WO2018143670A1 publication Critical patent/WO2018143670A1/fr
Priority to JP2022078472A priority patent/JP2022106982A/ja
Priority to US17/857,470 priority patent/US11882315B2/en
Priority to US18/529,455 priority patent/US12238345B2/en
Priority to JP2024107527A priority patent/JP2024125421A/ja
Priority to US19/036,648 priority patent/US20250175653A1/en

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/132—Sampling, masking or truncation of coding units, e.g. adaptive resampling, frame skipping, frame interpolation or high-frequency transform coefficient masking
    • 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/13—Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/167—Position within a video image, e.g. region of interest [ROI]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/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/18—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 a set of transform coefficients
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/70—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by syntax aspects related to video coding, e.g. related to compression standards
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/91—Entropy coding, e.g. variable length coding [VLC] or arithmetic coding

Definitions

  • the present invention relates to a method and apparatus for encoding / decoding video signals, and more particularly, to entropy encoding and decoding.
  • HEVC has a variety of technologies such as intra picture prediction, inter picture prediction, transform, quantization, entropy coding, and in-loop filters.
  • Information that is input of entropy encoding is generated using various methods. As the size of an input image or a unit block to be encoded or decoded is increased, data to be entropy-encoded may rapidly increase.
  • the present invention has a main object to provide a more efficient entropy encoding and decoding technique.
  • the present invention has a main object to reduce the amount of data to be encoded by entropy encoding or decoding using a skip region.
  • the present invention has a main object to improve arithmetic coding and arithmetic decoding performance by effectively selecting probability information applied to encoding or decoding each symbol during context-adaptive arithmetic coding and decoding.
  • An image encoding method or encoding apparatus encodes a position of a reference coefficient in a current transform block to be encoded and encodes skip region information on a skipped region selected based on the position of the reference coefficient. Can be.
  • the skip region information may indicate whether the coefficients in the skip region have the same coefficient value.
  • a video encoding method or encoding apparatus obtains binarized information by binarizing a value of a transform coefficient, and encodes the binarized information according to a position of the transform coefficient in a transform block. Probability information to be applied can be determined.
  • the probability information to be applied to the encoding of the binarized information may be determined according to which region the transform coefficient is located in a transform block divided into a plurality of regions.
  • An image encoding method or encoding apparatus encodes a position of a reference coefficient in a current transform block to be encoded and encodes skip region information on a skipped region selected based on the position of the reference coefficient.
  • binarized information may be obtained by binarizing a value of a transform coefficient not included in the skip region, and a probability information table to be applied to encoding the binarized information may be selected from a plurality of probability information tables.
  • the probability information table to be applied to the encoding of the binarized information may be selected according to whether the skip region is used to encode the current transform block.
  • An image decoding method or apparatus may decode positions of reference coefficients in a current transform block to be decoded, and decode skip region information on skip regions selected based on the positions of the reference coefficients. Can be.
  • the skip region information may indicate whether the coefficients in the skip region have the same coefficient value.
  • An image decoding method or decoding apparatus obtains a value of an arithmetic-coded transform coefficient from a bitstream, and according to a position of the transform coefficient in a transform block, Probability information to be applied to the decoding can be determined.
  • Probability information to be applied to the decoding of the arithmetic coded transform coefficients may be determined according to which region the transform coefficient is located in a transform block divided into a plurality of regions.
  • An image decoding method or decoding apparatus decodes a position of a reference coefficient in a current transform block to be decoded, and decodes skip region information on a skipped region selected based on the position of the reference coefficient.
  • an arithmetic encoded value of a transform coefficient not included in the skip region may be obtained, and a probability information table may be selected from among a plurality of probability information tables to be applied to decoding an arithmetic encoded value of the transform coefficient.
  • one of the plurality of probability information tables may be selected depending on whether the skip region is used to decode the current transform block.
  • a method of decoding an image includes decoding a position of a reference coefficient in a current transform block, deriving probability information of a coding parameter based on the position of the reference coefficient, and determining the derived probability information. And decoding the coding parameter by using the same.
  • the reference coefficient may be a first non-zero coefficient in an inverse scan order of coefficients in the current transform block.
  • the current transform block is divided into a first region and a second region, and the probability information of the coding parameter may be determined based on which region the reference coefficient exists.
  • a method of decoding an image comprising: decoding partial information of a DC coefficient of a current transform block, deriving probability information of a coding parameter based on the partial information of the DC coefficient, and the derived probability And decoding the coding parameter using the information.
  • the DC coefficient may be a coefficient located at the upper left of the current transform block.
  • the partial information of the DC coefficient may be at least one piece of information for decoding the DC coefficient.
  • the decoding method of the image further comprising: decoding a position of a reference coefficient in the current transform block, wherein the probability information of the coding parameter includes distance information between the DC coefficient and the reference coefficient and partial information of the DC coefficient. Can be derived based on.
  • a method of encoding an image comprising: encoding positions of reference coefficients in a current transform block, deriving probability information of coding parameters based on positions of the reference coefficients, and using the derived probability information And encoding the coding parameter.
  • the reference coefficient may be a first non-zero coefficient in an inverse scan order of coefficients in the current transform block.
  • the current transform block is divided into a first region and a second region, and the probability information of the coding parameter may be determined based on which region the reference coefficient exists.
  • the DC coefficient may be a coefficient located at the upper left of the current transform block.
  • the partial information of the DC coefficient may be at least one piece of information for encoding the DC coefficient.
  • the coding method of the image further comprising: encoding a position of a reference coefficient in the current transform block, wherein the probability information of the coding parameter includes distance information between the DC coefficient and the reference coefficient and partial information of the DC coefficient. Can be derived based on.
  • the amount of encoded information generated as a result of encoding a video can be reduced, thereby improving the encoding efficiency.
  • arithmetic coding and arithmetic decoding performance can be improved by effectively selecting probability information applied to encoding or decoding each symbol during context-adaptive arithmetic coding and decoding.
  • 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 flowchart illustrating a method of encoding a transform block, according to an embodiment of the present invention.
  • 4A to 4D are diagrams illustrating a diagonal reverse scan, a vertical reverse scan, and a horizontal reverse scan in sub-block units.
  • FIG. 5 is a flowchart illustrating a method of decoding a transform block according to an embodiment of the present invention.
  • FIG. 6 is a flowchart illustrating a video encoding method using a skip region according to an embodiment of the present invention.
  • FIG. 7 is a diagram illustrating a skip region according to an embodiment of the present invention.
  • FIG. 8 is a diagram illustrating a skip region according to another embodiment of the present invention.
  • FIG. 9 is a diagram illustrating an additional skip area according to an embodiment of the present invention.
  • FIG. 10 is a flowchart illustrating a method of encoding a transform block including a skip region or an additional skip region according to an embodiment of the present invention.
  • FIG. 11 is a flowchart illustrating a method of decoding an image using a skip region according to an embodiment of the present invention.
  • FIG. 12 is a flowchart illustrating a method of decoding a transform block including a skip region or an additional skip region according to an embodiment of the present invention.
  • FIG. 13 is a flowchart illustrating a context-adaptive binarization arithmetic coding method according to an embodiment of the present invention.
  • FIG. 14 is a flowchart illustrating a context-adaptive binarization arithmetic decoding method according to an embodiment of the present invention.
  • 15A to 15C are diagrams illustrating an example in which probability information is differently applied according to information of neighboring coefficients.
  • 16A to 16C illustrate various embodiments of dividing a transform block of a frequency domain into a plurality of regions.
  • 17 is a flowchart illustrating an arithmetic coding method according to an embodiment of the present invention.
  • FIG. 18 is a flowchart illustrating an arithmetic decoding method according to an embodiment of the present invention.
  • 19A to 19C are diagrams for describing arithmetic encoding and arithmetic decoding according to another embodiment of the present invention.
  • 20 is a flowchart illustrating an arithmetic coding method or a decoding method according to another embodiment of the present invention.
  • 21 is a flowchart illustrating a context-adaptive binarization arithmetic coding method according to an embodiment of the present invention.
  • 22 is a flowchart illustrating a context-adaptive binarization arithmetic decoding method according to an embodiment of the present invention.
  • 23A and 24B illustrate an example in which probability information is differently applied according to information of neighboring coefficients.
  • 24 is a flowchart illustrating a method of deriving probability information based on a reference coefficient according to an embodiment of the present invention.
  • 25 is a diagram illustrating a reference counting position according to an embodiment of the present invention.
  • 26A and 26B illustrate an example in which probability information is differently applied according to information of neighboring coefficients.
  • FIG. 27 is a decoding flowchart illustrating a method of deriving probability information based on a reference coefficient according to an embodiment of the present invention.
  • 28 is a flowchart illustrating a method of deriving probability information based on partial information of DC according to an embodiment of the present invention.
  • 29 is a flowchart illustrating a method of encoding transform block coefficients using partial information of DC coefficients.
  • FIG. 30 is a decoding flowchart illustrating a method of deriving probability information based on partial information of a DC according to an embodiment of the present invention.
  • 31 is a flowchart illustrating a method of decoding transform block coefficients using partial information of DC coefficients.
  • 32 is a flowchart illustrating a method of deriving probability information based on a distance between a DC coefficient and a reference coefficient and partial information of the DC coefficient.
  • 33 is a diagram illustrating an example in which probability information is differently applied according to information of peripheral coefficients.
  • 34 is a decoding flowchart illustrating a method of deriving probability information based on a distance between a DC coefficient and a reference coefficient and partial information of the DC coefficient.
  • 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 an image splitter 101, an intra picture predictor 102, an inter picture predictor 103, a subtractor 104, a transformer 105, and a quantizer. 106, an entropy encoding unit 107, an inverse quantization unit 108, an inverse transform unit 109, an increase unit 110, a filter unit 111, and a memory 112.
  • 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 image divider 100 may divide the input image into at least one block.
  • the input image may have various shapes and sizes, such as a picture, a slice, a tile, and a segment.
  • a block may mean a coding unit (CU), a prediction unit (PU), or a transformation unit (TU).
  • the partitioning may be performed based on at least one of a quadtree or a binary tree.
  • Quad tree is a method of dividing an upper block into lower blocks having a width and a height of half of the upper block.
  • the binary tree divides the upper block into lower blocks, which are half of the upper block in either width or height.
  • a block may have a square as well as a non-square shape.
  • the predictors 102 and 103 may include an inter prediction unit 103 that performs inter prediction and an intra prediction unit 102 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 105.
  • prediction mode information and motion vector information used for prediction may be encoded by the entropy encoder 107 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 102 and 103.
  • the intra prediction unit 102 may generate a prediction block based on reference pixel information around the current block, which is pixel information in the current picture.
  • a reference pixel included in the neighboring block to which inter prediction is applied may be replaced with a reference pixel in another block around to which intra prediction is applied. 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.
  • the intra prediction unit 102 may include an adaptive intra smoothing (AIS) filter, a reference pixel interpolator, and a DC filter.
  • AIS filter is a filter that filters the reference pixels of the current block and may adaptively determine whether to apply the filter according to the prediction mode of the current prediction unit. 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 interpolation unit of the intra prediction unit 102 interpolates the reference pixel when the intra prediction mode of the prediction unit performs the intra prediction based on the pixel value interpolated with the reference pixel. Can be generated. 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 inter prediction unit 103 generates a prediction block by using the reconstructed reference image and motion information stored in the memory 112.
  • the motion information may include, for example, a motion vector, a reference picture index, a list 1 prediction flag, a list 0 prediction flag, and the like.
  • a residual block including residual information which is a difference between the prediction unit generated by the prediction units 102 and 103 and the original block of the prediction unit, may be generated.
  • the generated residual block may be input to the converter 130 and converted.
  • the inter prediction unit 103 may induce a prediction block based on information of at least one of a previous picture or a subsequent picture of the current picture.
  • a prediction block of the current block may be derived based on information of a partial region in which encoding in the current picture is completed.
  • the inter prediction unit 103 may include a reference picture interpolator, a motion predictor, and a motion compensator.
  • the reference picture interpolation unit may receive reference picture information from the memory 112 and generate pixel information of less than an integer pixel 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 prediction block of the current block by using a different motion prediction method.
  • various methods such as a skip method, a merge method, and an advanced motion vector prediction (AMVP) method may be used.
  • AMVP advanced motion vector prediction
  • the subtraction unit 104 generates a residual block of the current block by subtracting the block to be currently encoded from the prediction block generated by the intra prediction unit 102 or the inter prediction unit 103.
  • the transform unit 105 may transform the residual block including the residual data by using a transformation method such as DCT, DST, or Karhunen Loeve Transform (KLT).
  • the transformation method may be determined based on the intra prediction mode of the prediction unit used to generate the residual block. For example, depending on the intra prediction mode, DCT may be used in the horizontal direction and DST may be used in the vertical direction.
  • the quantization unit 106 may quantize the values converted in the frequency domain by the transformer 105.
  • the quantization coefficient may change depending on the block or the importance of the image.
  • the value calculated by the quantization unit 106 may be provided to the inverse quantization unit 108 and the entropy encoding unit 107.
  • the transform unit 105 and / or the quantization unit 106 may be selectively included in the image encoding apparatus 100. That is, the image encoding apparatus 100 may encode the residual block by performing at least one of transform or quantization on the residual data of the residual block, or skipping both transform and quantization. Even if neither the transformation nor the quantization is performed or neither the transformation nor the quantization is performed in the image encoding apparatus 100, a block entering the input of the entropy encoder 107 is generally referred to as a transform block.
  • the entropy encoder 107 entropy encodes the input data. 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 107 may be configured to perform various operations such as coefficient information, block type information, prediction mode information, split unit information, prediction unit information, transmission unit information, motion vector information, reference frame information, interpolation information of a transform block, filtering information, and the like. Information can be encoded.
  • the coefficients of the transform block may be encoded in units of sub blocks within the transform block.
  • Last_sig a syntax element that indicates the position of the first non-zero coefficient in reverse scan order, for encoding the coefficients of the transform block, Coded_sub_blk_flag, which is a flag indicating whether there is at least one non-zero coefficient in the subblock, Sig_coeff_flag, a flag that indicates whether the coefficient is non-zero, Abs_greater1_flag, which indicates whether the absolute value of the coefficient is greater than 1, Abs_greater2_flag, which indicates whether the absolute value of the coefficient is greater than 2, Sign_flag, which indicates the sign of the coefficient, etc. Syntax elements may be encoded. Residual values of coefficients not encoded with only the syntax elements may be encoded through the syntax element remaining_coeff.
  • the inverse quantization unit 108 and the inverse transformer 109 inverse quantize the quantized values in the quantization unit 106 and inverse transform the transformed values in the transformer 105.
  • the residual values generated by the inverse quantizer 108 and the inverse transformer 109 are predicted by the motion estimator, the motion compensator, and the intra prediction unit 102 included in the predictors 102 and 103. It may be combined with the prediction unit to generate a reconstructed block.
  • the transcriptor 110 generates a reconstructed block by multiplying the prediction blocks generated by the predictors 102 and 103 and the residual blocks generated by the inverse transform unit 109.
  • the filter unit 111 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 112 may store a reconstructed block or picture calculated by the filter unit 111, and the stored reconstructed block or picture may be provided to the predictors 102 and 103 when performing inter prediction.
  • FIG. 2 is a block diagram illustrating an image decoding apparatus 200 according to an embodiment of the present invention.
  • the image decoding apparatus 200 may include an entropy decoder 201, an inverse quantizer 202, an inverse transform unit 203, an increase unit 204, a filter unit 205, a memory 206, and the like.
  • the prediction unit 207 and 208 may be included.
  • the input bitstream may be decoded according to a process opposite to that performed by the image encoding apparatus 100.
  • the entropy decoding unit 201 may perform entropy decoding in a procedure opposite to that of the entropy encoding unit 107 of the image encoding apparatus 100. 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.
  • the entropy decoding unit 201 may decode the syntax elements described above, that is, Last_sig, Coded_sub_blk_flag, Sig_coeff_flag, Abs_greater1_flag, Abs_greater2_flag, Sign_flag, and remaining_coeff. Also, the entropy decoder 201 may decode information related to intra prediction and inter prediction performed by the image encoding apparatus 100.
  • the inverse quantizer 202 generates a transform block by performing inverse quantization on the quantized transform block. It operates substantially the same as the inverse quantizer 108 of FIG.
  • the inverse transform unit 203 performs an inverse transform on the transform block to generate a residual block.
  • the transformation method may be determined based on information on a prediction method (inter or intra prediction), a size and / or shape of a block, an intra prediction mode, and the like. It operates substantially the same as the inverse transform unit 109 of FIG.
  • the increaser 204 generates a reconstructed block by multiplying the prediction block generated by the intra prediction unit 207 or the inter prediction unit 208 and the residual block generated by the inverse transform unit 203. It operates substantially the same as the transpiration section 110 of FIG.
  • the filter unit 205 reduces various kinds of noise generated in the restored blocks.
  • the filter unit 205 may include a deblocking filter, an offset corrector, and an ALF.
  • the image encoding apparatus 100 may receive information about whether a strong filter or a weak filter is applied.
  • the deblocking filter of the image decoding apparatus 200 the deblocking filter related information provided by the image encoding apparatus 100 may be provided, and the image decoding apparatus 200 may perform deblocking filtering on the corresponding block.
  • 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 image encoding apparatus 100. Such ALF information may be provided included in a specific parameter set.
  • the filter unit 205 operates substantially the same as the filter unit 111 of FIG. 1.
  • the memory 206 stores the reconstruction block generated by the multiplier 204. It operates substantially the same as the memory 112 of FIG.
  • the prediction units 207 and 208 may generate the prediction blocks based on the prediction block generation related information provided by the entropy decoding unit 201 and previously decoded blocks or picture information provided by the memory 206.
  • the prediction units 207 and 208 may include an intra prediction unit 207 and an inter prediction unit 208. Although not separately illustrated, the prediction units 207 and 208 may further include a prediction unit determination unit.
  • the prediction unit determination unit receives various information such as prediction unit information input from the entropy decoder 201, 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 208 may include 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 necessary for inter prediction of the current prediction unit provided by the image encoding apparatus 100. Based on the prediction, the inter prediction may be performed on the current prediction unit. Alternatively, inter-screen prediction may be performed based on information of a pre-restored partial region in the current picture including the current prediction unit.
  • Whether the motion prediction method of the prediction unit included in the coding unit based on the coding unit to perform inter prediction is skip mode, merge mode, or AMVP mode. Can be determined.
  • the intra prediction unit 207 generates a prediction block using pixels that are located around the block to be currently encoded and are reconstructed.
  • the intra prediction unit 207 may include an adaptive intra smoothing (AIS) filter, a reference pixel interpolator, and a DC filter.
  • the AIS filter is a filter that filters the reference pixels of the current block and may adaptively determine whether to apply the filter according to the prediction mode of the current prediction unit.
  • the AIS filtering may be performed on the reference pixel of the current block by using the prediction mode of the prediction unit and the AIS filter information provided by the image encoding apparatus 100. 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 interpolation unit of the intra prediction unit 207 interpolates a reference pixel at a fractional position by interpolating the reference pixel when the prediction mode of the prediction unit is a prediction unit that performs intra prediction based on a pixel value interpolating the reference pixel. Can be generated.
  • the generated reference pixel at the fractional unit location may be used as the prediction pixel of the pixel in the current block. 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 intra prediction unit 207 operates substantially the same as the intra prediction unit 102 of FIG. 1.
  • the inter prediction unit 208 generates an inter prediction block using the reference picture and the motion information stored in the memory 206.
  • the inter prediction unit 208 operates substantially the same as the inter prediction unit 103 of FIG. 1.
  • FIG. 3 is a flowchart illustrating a method of encoding a transform block, according to an embodiment of the present invention.
  • the encoding method of the transform block of FIG. 3 may be performed by the entropy encoder 107 of the image encoding apparatus 100.
  • one transform block may be encoded in sub-block units.
  • the current transform block 400 to be encoded or decoded is an 8 ⁇ 8 block
  • the current transform block 400 may be divided into four subblocks 1 401 to 4 block 404 having a size of 4 ⁇ 4.
  • an inverse scan method in a vertical, horizontal, or diagonal direction may be used according to a prediction mode of the current block or the current transform block.
  • the prediction mode may be inter prediction or intra prediction.
  • 4B, 4C and 4D show a diagonal reverse scan, a vertical reverse scan and a horizontal reverse scan, respectively.
  • a diagonal reverse scan is described as an example, but both a vertical reverse scan or a horizontal reverse scan may be applied.
  • non-zero coefficients are determined as reference coefficients when scanning transform coefficients according to an inverse scan order, and the position information Last_sig is encoded (S301).
  • the sub block including the reference coefficient is selected (S302) and the corresponding sub block information is encoded (S303).
  • Coded_sub_blk_flag which is sub block information, is a flag indicating whether there is at least one non-zero coefficient in the current sub block. Thereafter, non-zero coefficient information is encoded (S304).
  • Sig_coeff_flag which is nonzero coefficient information, indicates whether or not the value of each coefficient existing in the subblock is zero.
  • N excess coefficient information indicates whether the absolute value of each coefficient exceeds a value from 1 to N for all coefficients existing in the subblock.
  • N uses arbitrary preset values for encoding and decoding, but may encode the value of N to use the same value for encoding and decoding.
  • the number of N excess coefficient information may use any predetermined value or may be used differently according to the position of the reference coefficient. For example, when N is set to 3, for all coefficients determined to be non-zero in the subblock, whether or not the absolute value of each coefficient is greater than 1 is encoded. To this end, Abs_greater1_flag, a flag indicating whether the absolute value of the coefficient is greater than one, is used.
  • Abs_greater2_flag which is a flag indicating whether the absolute value of the coefficient is greater than 2
  • Abs_greater3_flag a flag indicating whether the absolute value of the coefficient is greater than 3
  • code information indicating whether the coefficient is negative or positive is encoded for each coefficient judged not to be zero (S306).
  • Sign_flag may be used as the sign information. Only remaining coefficients obtained by subtracting N are defined as residual coefficient information only for coefficients determined to be larger than N, and residual value information remaining_coeff of the coefficients is encoded (S307).
  • next subblock exists (S309), and if so, it moves to the next subblock (S310) and the subblock information is encoded (S303).
  • the subblock information Coded_sub_blk_flag is checked (S308). If it is determined that the value of Coded_sub_blk_flag is true, Sig_coeff_flag, which is non-zero coefficient information, is encoded. If the value of the corresponding subblock information Coded_sub_blk_flag is false, it means that there is no coefficient to be encoded in the corresponding subblock. Therefore, the existence of the next subblock is checked.
  • the subblock is a subblock located at the lowest frequency side, it is set to the same value at the time of encoding and decoding as true without encoding and decoding subblock information under the assumption that there is a non-zero coefficient. It is also possible.
  • the decoding method of the transform block of FIG. 5 corresponds to the encoding method of the transform block of FIG. 3.
  • the decoding method of the transform block of FIG. 5 may be performed by the entropy decoding unit 201 of the image decoding apparatus 200.
  • the positional information Last_sig of the reference coefficient which is a non-zero transform coefficient, is first decoded according to the inverse scan order (S501).
  • the sub block including the reference coefficient is selected (S502) and the sub block information Coded_sub_blk_flag is decoded (S503). Thereafter, non-zero coefficient information Sig_coeff_flag is decoded (S504). The N excess coefficient information is then decoded (S505).
  • the N excess coefficient information may include Abs_greater1_flag, Abs_greater2_flag, Abs_greater3_flag, and the like as described above.
  • the sign information Sign_flag of the coefficient is decoded for each coefficient determined to be non-zero (S506). Residual coefficient information remaing_coeff corresponding to the remaining value after subtracting N is only decoded for the coefficient determined to be greater than N (S507). After that, it is checked whether the next subblock exists (S509), and if so, it moves to the next subblock (S510), and the subblock information Coded_sub_blk_flag is decoded (S503). If the subblock information Coded_sub_blk_flag is checked (S508), and it is determined to be true, the non-zero coefficient information Sig_coeff_flag is decoded. do.
  • FIG. 6 is a flowchart illustrating a video encoding method using a skip region according to an embodiment of the present invention.
  • the image encoding method of FIG. 6 may be performed by the entropy encoding unit 107 of the image encoding apparatus 100.
  • the entropy encoder 107 encodes a position of a reference coefficient in a current transform block to be encoded (S601).
  • the reference coefficient refers to the first non-zero coefficient when scanning the coefficients in reverse scan order.
  • skip region information on the selected skip region is encoded based on the position of the reference coefficient (S602).
  • the skip region is an area in the current transform block, which can be determined based on the position of the reference coefficient.
  • the skip region information indicates whether all coefficients in the skip region have the same value.
  • the same value of the coefficients in the skipped region may be zero. If the same value of the coefficients in the skipped region is not 0, information indicating which value is not 0 may be further encoded. It is also possible to use any non-zero predetermined value as the same value of the coefficients in the skip region. In this case, it is possible to encode information of a predetermined value through an upper header rather than a transform block unit.
  • the skip region may be determined in the encoding / decoding process according to a predetermined rule, and the encoding apparatus 100 or the decoding apparatus 200 may further encode a coordinate indicating the range of the skip region in the transform block. The same location may be used.
  • FIG. 7 is a diagram illustrating a skip region according to an embodiment of the present invention. Assume that a diagonal inverse scan is used for coefficient coding of the current transform block 700.
  • the coefficients positioned on the reference line 702 and the reference line 702 are present below the reference line 702.
  • An area containing the coefficients to be specified is designated as a skip area.
  • the skipped region is shaded, and all coefficients in the skipped region have the same value of zero.
  • all the coefficients in the skipped region are located later in the coding order than the reference coefficients.
  • the reverse scan order is not determined based on the reference coefficient.
  • the skip region may be set using one of non-zero coefficients after the phase reference coefficient or a coefficient adjacent to the reference coefficient.
  • the arbitrary area in the transform block in which the reference coefficient is located can be set by comparing the number of sub-blocks calculated in the reverse scan order with a preset threshold.
  • the reference coefficient may be set to determine how far from any arbitrary position of the transform block to compare with a preset threshold. For example, this arbitrary position may be a center point that is halfway between the transverse and vertical sides of the transform block.
  • m and n may be encoded through block units or higher headers, and the same preset values may be used for encoding and decoding.
  • FIG. 8 is a diagram illustrating a skip region according to another embodiment of the present invention.
  • a coefficient including the coefficients existing at the bottom of the reference line 803 are designated as a skip region.
  • the coefficients belonging to the skipped region are located later in the coding order than the reference coefficients.
  • the skip region is indicated by the shade.
  • a skip region may be additionally set in addition to the skip region set by steps S601 and S603.
  • the skip region additionally set may be encoded using additional skip region information.
  • FIG. 9 is a diagram illustrating an additional skip area according to an embodiment of the present invention.
  • An additional skip region is set in FIG. 9 in addition to the skip region illustrated in FIG. 7.
  • An area above the skip area of FIG. 7 is set as an additional skip area, and additional skip area information indicating whether coefficients in the additional skip area are all the same value may be encoded.
  • the same value of the coefficients in the skipped region may be zero. If the same value of the coefficients in the skipped region is not 0, information indicating which value is not 0 may be further encoded. It is also possible to use any preset value other than zero as the same value of the coefficients in the skip region. In this case, it is possible to encode information of a predetermined value through an upper header rather than a transform block unit.
  • the location of the additional skip region may be determined in the encoding and decoding process according to a predetermined rule, or the same position may be used in the encoding apparatus 100 and the decoding apparatus 200 by further encoding the coordinates in the transform block. have.
  • the newly generated additional skip region may be separated by a distance p from the previous skip region.
  • a skip region is set by generating a reference line 702 based on the reference coefficient 701, and an example in which an upper portion of the reference line 702 is additionally set as a skip region.
  • an area including coefficients on the reference line 703 may be an additional skip area. If the distance p is 1, the additional skip region includes an area that includes the coefficients on the baseline 703 and an area that includes the coefficients on the baseline 704.
  • the distance p between the additional skip region and the skip region is 0 or 1, but other values may be used.
  • p may use the same preset value in the encoding / decoding process.
  • the value of p may be encoded in a block unit or may be encoded through an upper header.
  • the additional skip region may be added by a preset method. For example, it is also possible to continue adding additional skip regions or to encode a predetermined number q until the additional skip region information is false. Here, it is possible to set a different p for each additional skip region added.
  • FIG. 10 is a flowchart illustrating a method of encoding a transform block including a skip region or an additional skip region according to an embodiment of the present invention.
  • the method shown in FIG. 10 may be performed after the method shown in FIG. 6.
  • the encoding method of FIG. 10 may be performed by the entropy encoding unit 107 of the image encoding apparatus 100.
  • a reference coefficient is included in a subblock in a current transform block to be encoded, it means that a coefficient to be encoded is included and thus coded_sub_blk_flag, which is subblock information, is not encoded. It is checked whether the skip region information or the additional skip region information is true, and at the same time, whether the subblock to be currently encoded includes the skip region or the additional skip region (S1001). If the above two conditions are true, coefficients located in the current subblock and located outside the skip region in the encoding order are selected (S1002). If not, all coefficients to be coded are selected regardless of the skip region (S1003). Thereafter, the coefficients are encoded in the order of nonzero coefficient information encoding (S1004), N excess coefficient information encoding (S1005), code information encoding (S1006), and residual coefficient information encoding (S1007).
  • next subblock exists (S1008)
  • the control moves to the next subblock (S1009). It is checked whether the skip region information or the additional skip region information is true, and at the same time, whether the subblock to be currently encoded includes the skip region or the additional skip region (S1010). Go to. However, this case can be used only when the values of the coefficients in the skipped region are zero. If the values of the coefficients in the skipped region are not 0, the corresponding subblock information should be encoded.
  • step S1011 If the subblock does not include the skip region or the additional skip region, or if the skip region information is false (S1011), if the sub block information is true (S1012), the process moves to step S1001, and if it is false, Move to S1008. If it is determined after the move to step S1008 that the next subblock does not exist, the algorithm of FIG. 10 ends.
  • the scan method assumes a diagonal reverse scan order, and sets the first nonzero coefficient as a reference coefficient. After setting the coefficients in the lower left direction and the coefficients below the reference region to the skip region based on the reference coefficients, the values of the skip regions are all checked. Since the coefficients of the skipped region all have the same value as 0, the skipped region information is encoded as true. After dividing by the sub-block unit, the sub block including the reference coefficient is encoded.
  • the current transform block is 8x8 and the subblock is 4x4.
  • skip region information of a subblock to be encoded is true, and there are coefficients to be encoded in the subblock. Since only coefficients outside the skipped region are encoded, in the example shown in FIG. 7, only the reference coefficient and 1, 0, 0, -2 existing thereon need to be encoded. In this case, the nonzero coefficient information becomes true, false, false, and true, respectively. Assuming that N is 2, only one information is encoded in only coefficients determined to be non-zero. More than one information of the coefficient values 1 and -2 is set to false and true, respectively.
  • More than 2 information is encoded only if the more than 1 information is true, and more than 2 information of the coefficient value -2 is encoded as false. Thereafter, + and-which are signs of coefficient values 1 and -2 are encoded, respectively. Thereafter, since the next subblock exists, it moves to the next subblock.
  • the skip region information is true, and since the coefficient to be encoded exists in the corresponding subblock, the subblock information is true. Therefore, only coefficients 0, 0, and 1 outside the skipped region are encoded.
  • the non-zero coefficient information of the coefficients 0, 0, and 1 is false, false, and true, respectively, and then only one piece of information of coefficient 1 is falsely encoded.
  • the sign information of the coefficient 1 is encoded by + and moves to the next subblock.
  • the subblock information is true because the skip region information is true and there are coefficients to be encoded in the corresponding subblock. Sorting the coefficients outside the skip region by reverse scan results in 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, -2, -2, 1, -3, 3, 10. These coefficients are encoded using steps S1004 to S1007.
  • FIG. 11 is a flowchart illustrating a method of decoding an image using a skip region according to an embodiment of the present invention.
  • the decoding method of FIG. 11 may be performed by the entropy encoder 201 of the image decoding apparatus 100.
  • the entropy decoding unit 201 decodes a position of a reference coefficient in a current transform block to be decoded (S1101). Thereafter, the skip region information for the selected skip region is decoded based on the position of the reference coefficient (S1103). As described above, the position of the reference coefficient can be derived by decoding Last_sig. Since the skip region and the skip region information are the same as described above, a detailed description thereof will be omitted. In addition, although not separately illustrated in FIG. 11, if there is an additional skip region additionally set in addition to the skip region, the additional skip region may be decoded using additional skip region information.
  • FIG. 12 is a flowchart illustrating a method of decoding a transform block including a skip region or an additional skip region according to an embodiment of the present invention.
  • the method shown in FIG. 12 may be performed after the method shown in FIG.
  • the decoding method of FIG. 12 may be performed by the entropy decoding unit 201 of the image decoding apparatus 200.
  • FIGS. 11 and 12 are further described using the example of FIG. 7.
  • the reference coefficient is set.
  • the skip area is set based on the position of the reference coefficient, and the skip area information is decoded. In this example, the skip region information is true.
  • the first block is decoded from the subblock including the reference coefficient.
  • the current transform block is 8x8 and the subblock is 4x4.
  • the skip region information is true, and there are coefficients to be decoded in the corresponding subblock. Since only coefficients outside the skipped region are decoded, only the reference coefficient and 1, 0, 0, and -2 present in the case illustrated in FIG. 7 need to be decoded. In this case, the decoded values of the nonzero coefficient information become true, false, false, and true, respectively. Assuming that N is 2, only one piece of information is decoded only in coefficients determined to be non-zero. More than one information of the coefficient values 1 and -2 is decoded as false and true, respectively.
  • More than 2 information is decoded only if the more than 1 information is true, and more than 2 information of the coefficient value -2 is decoded false. Thereafter, + and-which are the signs of the coefficient values 1 and -2 are respectively decoded. Thereafter, since the next subblock exists, it moves to the next subblock.
  • the skip region information is true, and since the coefficient to be decoded exists in the corresponding subblock, the subblock information is true. Therefore, only 0, 0, and 1 coefficients outside the skip region are decoded.
  • the non-zero coefficient information of the coefficients 0, 0, and 1 is decoded false, false, and true, respectively, and then only one time information of coefficient 1 is decoded false.
  • the sign information of the coefficient 1 is decoded to + and moved to the next subblock.
  • Context-adaptive binarization arithmetic refers to a process of symbolizing encoded information in a block and applying and encoding the occurrence probability of symbols differently using probability information according to a situation.
  • N symbols N is a natural number of 2 or more may be used.
  • Probability information refers to the probability of occurrence of 0 and 1 in the binarized information.
  • the occurrence probability of the two pieces of information may be the same or different depending on the previously restored information. It may have N probability information according to the information.
  • Probability initialization is a process of dividing the probability section by the probability set in the probability information.
  • the same condition may be used by a predetermined rule in the encoding apparatus or the decoding apparatus, or the probability information may be separately encoded.
  • the initial probability interval may be determined in the same manner in the encoding / decoding process according to a preset rule. Alternatively, the initial probability interval may be newly encoded.
  • the binarized information of the current coding parameter is encoded using the probability interval state up to the step before the step S1302 and the previous probability information of the same coding parameter (S1303).
  • the probability information and the probability interval are updated (S1304) for the binary information to be encoded later (S1305), if the coding parameter information to be encoded next (S1305) moves to the next coding parameter information (S1306), the above-described process is performed. Repeat. If there is no coding parameter information to be encoded next, the flowchart ends.
  • the decoding apparatus decodes binary information of a coding parameter using probability information and an interval (S1402), and then determines binary information of a current coding parameter (S1403).
  • S1402 probability information and an interval
  • S1403 binary information of a current coding parameter
  • encoding or decoding may be performed by selectively using optimal probability information among N pieces of probability information preset by using information reconstructed around each coding parameter.
  • the probability information of the information belonging to the quantized transform block may use probability information having a high probability of generating information according to the size of the transform block.
  • the probability information may be differently applied according to the information of the neighboring coefficients of the coefficient to be currently encoded or decoded, and the probability information of the information currently encoded or decoded may be selected using the probability information of the previously encoded or decoded information.
  • 15A to 15C are diagrams illustrating an example in which probability information is differently applied according to information of neighboring coefficients.
  • 15B is an example of a probability information table used for encoding or decoding a Sig_coeff_flag information value of a current coefficient.
  • the probability of symbol 1 which is the Sig_coeff_flag binary information of the current coefficient 1501
  • the probability of symbol 0 is 39%.
  • the index is assigned to the current coefficient 1501, and the symbol that is the Sig_coeff_flag binary information of the current coefficient 1501 at this time.
  • the probability of 1 is 71% and the probability of symbol 0 is 29%.
  • the index is assigned to the current coefficient 1501 and the probability of symbol 1, which is the Sig_coeff_flag binary information of the current coefficient 1501, is 87.
  • the probability of% and symbol 0 is 13%.
  • probability information having a higher probability of generating non-zero coefficient information may be used closer to the low frequency region.
  • the probability information of the N excess coefficient information is set by using the probability information of the N excess coefficient information previously encoded / decoded, or the N excess coefficient information first encoded / decoded in units of sub blocks. Can be used as is.
  • the subblock information may use neighboring coded / decoded M subblock probability information or use probability information of the immediately encoded / decoded subblock.
  • FIGS. 16A to 16C illustrate various embodiments of dividing a transform block of a frequency domain into a plurality of regions.
  • a transform block may be divided into three regions, a frequency A region 1601, 1604, and 1607, a frequency B region 1602, 1605, and 1608, and a frequency C region 1603, 1606, and 1609. have.
  • Each region may be adaptively determined according to the scan direction of the transform block.
  • FIG. 16A illustrates a diagonal direction
  • FIG. 16B illustrates a scan direction in a horizontal direction
  • FIG. 16C illustrates a scan direction in a vertical direction. This is an example of a frequency domain classification method when.
  • the frequency A regions 1601, 1604, and 1607 are low frequency regions with the highest probability of generating coefficient coefficient information other than zero, and the frequency B regions 1602, 1605, and 1608 have zero values than the A regions 1601, 1604, and 1607. Less non-coefficient information occurs, and the frequency C regions 1603, 1606, and 1609 are high frequency regions, and the non-zero coefficient information is less than that of the A regions 1601, 1604, and 1607, and the B regions 1602, 1605, and 1608. Probability information may be set differently for each region by using the generated region.
  • the frequency A regions 1601, 1604, 1607, the frequency B regions 1602, 1605, and 1608 and the frequency C regions 1603, 1606, and 1609 are divided according to the distance from the DC coefficient located in the upper left corner of the transform block. You can see.
  • the current coefficient to be encoded or decoded belongs to the area A (1601, 1604, 1607)
  • the current coefficient is assigned an index 8
  • the probability of symbol 1 is 61%
  • the symbol 0 is The probability is 39%.
  • an index 5 is assigned to the current coefficient
  • the probability of symbol 1 is 71%
  • the probability of symbol 0 is 29%.
  • index 2 is assigned to the current coefficient
  • the probability of symbol 1 is 87%
  • the probability of symbol 0 is 13%.
  • Probability information of non-zero coefficient information, N excess coefficient information, and sub-block information may use probability information having a higher probability of occurrence as the region A (1601, 1604, 1607) becomes closer. Probability information can be selected by referring to non-zero coefficient information.
  • the frequency domain segmentation may be split under the same condition in the encoding / decoding apparatus, or may be transmitted by encoding separate segmentation information to the decoding apparatus.
  • binarized information is derived by binarizing a value of a transform coefficient to be encoded (S1701).
  • Probability information to be applied to the encoding of the binarized information is determined according to the position of the transform coefficient in the transform block (S1703). Referring to the example illustrated in FIG. 16A, probability information to be applied is determined according to which region of the frequency A region 1601, the frequency B region 1602, or the frequency C region 1603 is included.
  • the frequency A region 1601, the frequency B region 1602, and the frequency C region 1603 may be classified according to distances from the DC coefficients located at the upper left corner of the transform block.
  • FIG. 18 is a flowchart illustrating an arithmetic decoding method according to an embodiment of the present invention.
  • arithmetic encoded transform coefficient values are extracted from the bitstream (S1801).
  • Probability information to be applied to decoding the arithmetic-coded transform coefficient is determined according to the position of the transform coefficient in the transform block (S1803). As described above, referring to the example illustrated in FIG. 16A, the probability information to be applied depends on which of the frequency A region 1601, the frequency B region 1602, or the frequency C region 1603 is included in the decoding. Can be determined.
  • the frequency A region 1601, the frequency B region 1602, and the frequency C region 1603 may be classified according to distances from the DC coefficients located at the upper left corner of the transform block.
  • Arithmetic encoding and arithmetic decoding according to another embodiment of the present invention will be described with reference to FIGS. 19A to 19C and 20.
  • the current information is encoded or decoded according to whether the skip region is used or not.
  • different probability information is used.
  • the probability information table shown in FIG. 19B or 19C is used for encoding or decoding the coefficient current coefficient 1901 shown in FIG. 19A.
  • the probability information table shown in FIG. 19B is a probability information table to be applied when a skip region is not used
  • the probability information table shown in FIG. 19C is a probability information table applied when a skip region is used.
  • the probability information table illustrated in FIG. 19C is applied to encode or decode the current coefficient 1901.
  • index 5 is assigned to the current coefficient 1901.
  • the probability of symbol 1 is 71% and the probability of symbol 0 is 29%.
  • probability information may be applied differently according to the number of N excess coefficients in the peripheral coefficients.
  • Non-zero coefficient information and N excess coefficient information may use probability information having a high probability of occurrence according to the number of encoded / decoded information and the position of the frequency domain, and the coefficients located in the frequency C region and the skip region.
  • Probability information having a low probability of generating non-zero coefficient information, N excess coefficient information, and subblock information may be applied.
  • FIGS. 19A to 19C are flowchart illustrating an arithmetic encoding or decoding method according to another embodiment of the present invention. As described above with reference to FIGS. 19A to 19C, different probability information is used when encoding or decoding current information according to a case where a skip region is used and a case where the skip region is not used.
  • a position of a reference coefficient in a current transform block to be encoded or decoded is encoded or decoded (S2001).
  • skip region information for the skip region selected based on the position of the reference coefficient is encoded or decoded (S2003).
  • a probability information table to be applied to encoding the binarized information is selected from a plurality of probability information tables (S2005).
  • the plurality of probability information tables includes at least two tables for a case where a skip region is used and a table for a case where the skip region is not used.
  • Context-adaptive binarization arithmetic refers to a process of symbolizing encoded information in a block and applying and encoding the occurrence probability of symbols differently using probability information according to a situation.
  • Context-adaptive binarization arithmetic refers to a process of symbolizing encoded information in a block and applying and encoding the occurrence probability of symbols differently using probability information according to a situation.
  • N symbols N is a natural number of 2 or more
  • Probability information refers to the probability of occurrence of 0 and 1 in the binarized information.
  • the occurrence probability of the two pieces of information may be the same or different depending on the previously restored information. It may have N probability information according to the information.
  • probability initialization is a process of dividing the probability section by the probability set in the probability information.
  • Probability initialization is a process of dividing the probability section by the probability set in the probability information.
  • the same condition may be used by a predetermined rule in the encoding apparatus or the decoding apparatus, or the probability information may be separately encoded.
  • the initial probability interval may be determined in the same manner in the encoding / decoding process according to a preset rule. Alternatively, the initial probability interval may be newly encoded.
  • the binarized information of the current coding parameter is encoded using the probability interval state up to the previous step of step S2102 of FIG. 21 and previous probability information of the same coding parameter. (S2103). Probability information and a probability section may be updated (S2104) for binary information to be encoded later.
  • the coding parameter information to be encoded next exists (S2105), the process moves to the next coding parameter information (S2106), and the above-described process is repeated. If there is no coding parameter information to be encoded next, the flowchart ends.
  • FIG. 22 is a flowchart illustrating a context-adaptive binarization arithmetic decoding method. Unlike the encoding apparatus, the decoding apparatus decodes binary information of a coding parameter using probability information and an interval (S2202), and then determines binary information of the current coding parameter (S2203). In addition, since the decoding method of FIG. 22 corresponds to the encoding method of FIG. 21, detailed description thereof will be omitted.
  • steps S2103 and S2202 of FIGS. 21 and 22 described above among the N pieces of probability information preset by using information (or coding parameters) already reconstructed around each coding parameter, encoding or using optimal probability information is selectively used. Decoding may proceed.
  • the probability information of the information (or coding parameter) belonging to the quantized transform block may use probability information having a high probability of generating information according to the size of the transform block.
  • the probability information may be differently applied according to the information of the neighboring coefficients of the coefficient to be currently encoded or decoded, and the probability information of the information currently encoded or decoded may be selected using the probability information of the previously encoded or decoded information.
  • 23A and 23B illustrate an example in which probability information is differently applied according to information of neighboring coefficients.
  • 23A is an example of a probability information table used for encoding or decoding a Sig_coeff_flag information value of a current coefficient. If the number of coefficients having the same information value as the Sig_coeff_flag information value of the current coefficient among the coefficients adjacent to the coefficient to be encoded or decoded is one, the index 8 is assigned to the current coefficient. In this case, the probability of symbol 1, which is Sig_coeff_flag binary information of the current coefficient, is 61%, and the probability of symbol 0 is 39%.
  • index 5 is assigned to the current coefficient, and the probability of symbol 1, which is Sig_coeff_flag binary information of the current coefficient, is 71% and symbol 0 The probability of is 29%. If there are three neighboring coefficients with the same information value as the Sig_coeff_flag information value of the current coefficient, index 2 is assigned to the current coefficient, and the probability of symbol 1, which is Sig_coeff_flag binary information of the current coefficient, is 87%, and symbol 0 is 13%. Becomes
  • the probability information may be updated as shown in FIG. 23B.
  • non-zero coefficient information Sig_coeff_flag probability information having a higher probability of generating non-zero coefficient information Sig_coeff_flag may be used as it is closer to the low frequency region.
  • the probability information of the current N excess coefficient information is set using the probability information of the N excess coefficient information encoded / decoded immediately before, or the N excess that is first encoded / decoded in units of subblocks. Probability information of coefficient information may be used as it is.
  • the N excess coefficient information may include Abs_greater1_flag, Abs_greater2_flag, Abs_greater3_flag, and the like.
  • the sub block information Coded_sub_blk_flag may use probability information of neighboring coded / decoded M subblocks or use probability information of a previously encoded / decoded subblock.
  • FIG. 24 is a flowchart illustrating a method of determining probability information of each coding parameter according to a reference coefficient position and encoding the information of each coding parameter using the same according to an embodiment of the present invention.
  • the flowchart of FIG. 24 may be performed by the entropy encoder 107 of the image encoding apparatus 100.
  • the entropy encoder 107 encodes a position of a reference coefficient in a current transform block to be encoded (S2401).
  • the reference coefficient position may be encoded by reference coefficient position information Last_sig.
  • the reference coefficient may mean the first non-zero coefficient when scanning coefficients in an inverse scan order, but the reference coefficient may be applied to other conditions that are equally set in the image encoding apparatus 100 and the image decoding apparatus 200. It can also be determined by.
  • probability information of each coding parameter is derived based on the position of the reference coefficient, and the corresponding coding parameter is encoded (S2402).
  • the method of setting the probability table according to the position of the reference coefficient refers to the drawing example of FIG. 25.
  • the A region 2500 refers to an arbitrary region close to the DC coefficient in the transform block
  • the B region 2501 refers to a region other than the A region 2500 in the transform block. It is also possible to divide the transform block into N or more regions.
  • arbitrary region information indicating the region A may be transmitted from an upper header, or may be determined under the same condition according to the transform block type in the image encoding apparatus 100 and the image decoding apparatus 200.
  • the probability information of the coding parameters may be differently derived and the probability information of the coding parameters may be updated in a single probability table according to whether the location of the reference coefficient exists in the A region 2500 or the B region 2501. have.
  • the probability information of the coding parameters may be updated by using two or more different initial probability tables or the same initial probability table independently according to whether the position of the reference coefficient exists in the A region or the B region.
  • the reference coefficient of the transform block exists in the region A 2500.
  • the probability information of the Sig_coeff_flag information may be independently updated using the (2601) table of FIG. 26A.
  • the probability table 2260 of FIG. 26B is a result of updating the probability information by determining probability table index information according to the reference coefficient position as 5 in the initial probability table 2260 of FIG. 26A, and the probability table of 2260 of FIG. 26B.
  • the probability table index information according to the reference coefficient position is determined as 8 in the initial probability table (2601) of FIG. 26A, and the probability information is updated.
  • the probability information of the Abs_greater1_flag information indicating whether the absolute value of the coefficient in the transform block is greater than 1 is selected as the probability information having the high probability that the Abs_greater1_flag information is 1 when the reference coefficient is in the A region.
  • the probability information having a high probability that Abs_greater1_flag information is 0 may be selected and encoded.
  • the index information may be determined according to the detailed coordinates of the reference coefficient.
  • index information of the probability table according to the reference coefficient position in the initial probability table of 2600 of FIG. 26A. May be determined as 5.
  • the probability information of the index information 5 may be updated.
  • the index information of the probability table according to the reference coefficient position is 8 in the initial probability table of 2601 of FIG. 26A. Can be determined.
  • the probability information of the index information 8 may be updated as in the probability table of FIG. 26B.
  • 27 is a flowchart illustrating a method of determining probability information of each coding parameter according to a reference coefficient position and decoding the information of each coding parameter using the same according to an embodiment of the present invention.
  • the decoding method of FIG. 27 may be performed by the entropy decoding unit 201 of the image decoding apparatus 200.
  • the entropy decoding unit 201 decodes the position of the reference coefficient in the current transform block to be decoded (S2701).
  • the reference coefficient refers to the first non-zero coefficient when scanning the coefficients in reverse scan order.
  • probability information of each coding parameter is derived based on the position of the reference coefficient and the corresponding parameter information is decoded (S2702).
  • FIG. 28 is a flowchart illustrating a method of deriving and encoding probability information of each coding parameter according to partial information of a DC coefficient according to an embodiment of the present invention.
  • the encoding method of FIG. 28 may be performed by the entropy encoder 107 of the image encoding apparatus 100.
  • partial information of a DC coefficient may be encoded (S2801), and probability information of each coding parameter may be derived based on the partial information of DC, and corresponding parameter information may be encoded (S2802).
  • the DC coefficient may be a coefficient located at the top left of the transform block or may be a non-zero coefficient (non-zero coefficient) that comes last in an inverse scan order.
  • the partial information of the DC coefficient means some partial information necessary for encoding and decoding the DC coefficient.
  • the partial information of the DC coefficient may mean at least one of Sig_coeff_flag information and Abs_greater1_flag information of the DC coefficient.
  • the probability information of the coding parameters except for the partial information of the DC coefficients may be differently derived in the single probability table, and the probability information of the coding parameters may be updated.
  • the probability information of the coding parameters may be updated using two or more different initial probability tables or the same initial probability table independently based on the partial information of the DC coefficients.
  • Sig_coeff_flag information indicating whether each coefficient in the transform block is 0
  • two independent initial probability tables are independently encoded and only partial information of DC coefficients may use Sig_coeff_flag information.
  • the partial information of the DC coefficient is 0, the (2600) table of FIG. 26A is used, and when the DC information is 1, the probability information of the Sig_coeff_flag information is independently updated by using the (2601) table of FIG. 26A. Can be.
  • the probability information of the Abs_greater1_flag information indicating whether the absolute value of the coefficient in the transform block is greater than 1 is the probability information that the Abs_greater1_flag information has a high probability of 1 when Sig_coeff_flag, which is a partial information of the DC coefficient, is 1;
  • Sig_coeff_flag which is partial information of the DC coefficient is 0, probability information having a high probability that Abs_greater1_flag information is 0 may be selected and encoded.
  • the index information may be determined according to the partial information of the DC coefficient.
  • index information of the initial probability table of 2600 of FIG. 26A may be determined as 5.
  • Probability information of index information 5 may be updated as in the probability table 2260 of FIG. 26B.
  • index information of the initial probability table of 2601 of FIG. 26A may be determined as 8.
  • Probability information of index information 8 may be updated as in the probability table of FIG. 26B.
  • 29 is a flowchart illustrating a method of encoding transform block coefficients using partial information of DC coefficients.
  • partial information of the DC coefficient is encoded (S2902).
  • the position encoding process of the DC coefficient may be omitted. If not, the position of the DC coefficient is encoded (S2903). If reference coefficients are included in the subblocks in the transform block, it means that the coefficients to be encoded are included, so coded_sub_blk_flag, which is subblock information, is not encoded.
  • the coefficients are encoded in the order of nonzero coefficient information encoding (S2906), N excess coefficient information encoding (S2907), code information encoding (S2908), and residual coefficient information encoding (S2909).
  • the steps used for the DC coefficient partial information during the DC coefficient encoding in steps S2906 to S2909 may be omitted.
  • FIG. 30 is a flowchart illustrating a method of deriving and decoding probability information of each coding parameter according to partial information of a DC coefficient according to an embodiment of the present invention.
  • the decoding method of FIG. 30 may be performed by the entropy decoding unit 201 of the image decoding apparatus 200.
  • the entropy decoding unit 201 decodes partial information of a DC coefficient (S3001), and then derives probability information of each coding parameter based on the partial information of the DC coefficient and decodes corresponding parameter information. (S3002).
  • 31 is a flowchart illustrating a method of decoding transform block coefficients using partial information of DC coefficients.
  • the partial information of the DC coefficient is decoded (S3102).
  • the position decoding process of the DC coefficient may be omitted. If not, the position of the DC coefficient is decoded (S3103). If the reference coefficient is included in the subblock in the transform block, it means that the coefficient to be decoded is included. Therefore, Coded_sub_blk_flag, which is subblock information, is not decoded. Thereafter, non-zero coefficient information decoding (S3106), N excess coefficient information decoding (S3107), code information decoding (S3108), and residual coefficient information decoding (S3109) are performed in this order. However, since the partial information of the DC coefficient has already been decoded, the steps used for the DC coefficient partial information during the DC coefficient decoding in steps S3106 to S3109 may be omitted.
  • next subblock exists (S3111)
  • the process moves to the next subblock (S3112), and the information is decoded in order from (S3106) to (S3109), and when the next subblock does not exist, the algorithm ends. do.
  • FIG. 32 is a flowchart illustrating a method of deriving and encoding probability information of each coding parameter according to a distance between a DC coefficient and a reference coefficient and partial information of the DC coefficient according to an embodiment of the present invention.
  • the encoding method of FIG. 32 may be performed by the entropy encoder 107 of the image encoding apparatus 100.
  • the entropy encoder 107 encodes the position of the reference coefficient of the current transform block (S3201).
  • the reference coefficient may mean the first non-zero coefficient when scanning coefficients in an inverse scan order, but the reference coefficient may be applied to other conditions that are equally set in the image encoding apparatus 100 and the image decoding apparatus 200. It can also be determined by.
  • the probability information of the coding parameters is derived based on the distance between the DC coefficient and the reference coefficient and the partial information of the DC coefficient, and the corresponding parameter information is encoded (S3202).
  • the DC coefficient may be a coefficient coefficient located at the top left of the transform block or may be a non-zero coefficient (non-zero coefficient) that comes last in an inverse scan order.
  • the partial information of the DC coefficient means some partial information necessary for encoding and decoding the DC coefficient.
  • the partial information of the DC coefficient may mean at least one of Sig_coeff_flag information and Abs_greater1_flag information of the DC coefficient.
  • the probability information of the coding parameters except the partial information of the DC coefficient may be differently derived in the single probability table, and the probability information of the coding parameters may be updated.
  • two or more different initial probability tables or the same initial probability table may be independently used to update probability information of the coding parameters.
  • the distance information may be determined or the distance information may be encoded in the same manner according to a predetermined rule in the encoding / decoding apparatus.
  • Sig_coeff_flag information indicating whether each coefficient in the transform block is 0 or not
  • three independent initial probability tables are independently encoded and only partial information of DC coefficients may use Sig_coeff_flag information. If the distance information of the DC coefficient and the reference coefficient is greater than a predetermined threshold value, the table 3300 of FIG. 33 is used. If the distance between the DC coefficient and the reference coefficient is smaller than the predetermined threshold value, FIG. 33. Use the (3301) or (3302) table of.
  • the predetermined threshold may be a value preset in the encoding / decoding apparatus or a value based on information determined by the encoding apparatus and transmitted to the decoding apparatus.
  • which probability table to use (3301) or (3302) may be determined based on the partial information of the DC coefficient. For example, if Sig_coeff_flag information, which is partial information of the DC coefficient, is 1, the probability information may be determined using the table 3301 of FIG. 33 and using the table 3302 of FIG.
  • the index information is determined based on the distance information between the DC coefficient and the reference coefficient, and then the index information determined based on the partial information of the DC coefficient is corrected. Can be.
  • FIG. 34 is a flowchart illustrating a method of deriving and decoding probability information of each coding parameter according to a distance between a DC coefficient and a reference coefficient and partial information of the DC coefficient according to an embodiment of the present invention.
  • the decoding method of FIG. 34 may be performed by the entropy decoding unit 201 of the image decoding apparatus 200.
  • the entropy decoding unit 201 decodes the position of the reference coefficient of the current transform block and the partial information of the DC coefficient (S3401).
  • the reference coefficient may mean the first non-zero coefficient when scanning the coefficients in the reverse scanning order, but the reference coefficient may be applied to other conditions that are identically set in the image encoding apparatus 100 and the image decoding apparatus 200. It can also be determined by.
  • the probability information of the coding parameters is derived based on the distance between the DC coefficient and the reference coefficient and the partial information of the DC coefficient, and the corresponding parameter information is decoded (S3402).
  • the encoding / decoding algorithms of the image encoding apparatus 100 and the image decoding apparatus 200 may be the same as those of FIGS. 29 and 31.
  • Exemplary methods of the present disclosure are represented as a series of operations for clarity of description, but are not intended to limit the order in which the steps are performed, and each step may be performed simultaneously or in a different order as necessary.
  • the illustrated step may further include other steps, may include other steps except some, or may include additional other steps except some.
  • various embodiments of the present disclosure may be implemented by hardware, firmware, software, or a combination thereof.
  • one or more Application Specific Integrated Circuits (ASICs), Digital Signal Processors (DSPs), Digital Signal Processing Devices (DSPDs), Programmable Logic Devices (PLDs), Field Programmable Gate Arrays (FPGAs), General Purpose It may be implemented by a general processor, a controller, a microcontroller, a microprocessor, and the like.
  • scope of the disclosure include software or machine-executable instructions (eg, an operating system, an application, firmware, a program, etc.) to cause an operation in accordance with various embodiments of the method to be executed on an apparatus or a computer, and such software or Instructions, and the like, including non-transitory computer-readable media that are stored and executable on a device or computer.
  • software or machine-executable instructions eg, an operating system, an application, firmware, a program, etc.
  • the present invention can be used in an apparatus for encoding / decoding an image.

Landscapes

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

Abstract

La présente invention concerne un procédé et un dispositif de codage/décodage d'une image, et un procédé ou dispositif de codage d'une image, selon un mode de réalisation de la présente invention, pouvant coder la position d'un coefficient de référence dans un bloc de conversion courant à coder, et coder des informations de région de saut concernant une région de saut sélectionnée sur la base de la position du coefficient de référence. Les informations de région de saut peuvent indiquer si des coefficients dans la région de saut présentent la même valeur de coefficient.
PCT/KR2018/001341 2017-01-31 2018-01-31 Procédé et dispositif de codage/décodage d'image WO2018143670A1 (fr)

Priority Applications (15)

Application Number Priority Date Filing Date Title
US16/482,457 US11425426B2 (en) 2017-01-31 2018-01-31 Method and apparatus for encoding/decoding image
CN202210973319.7A CN115379223A (zh) 2017-01-31 2018-01-31 影像编码/解码方法及装置
CN202210975749.2A CN115379226A (zh) 2017-01-31 2018-01-31 影像编码/解码方法及装置
JP2019541229A JP2020505870A (ja) 2017-01-31 2018-01-31 画像の符号化／復号化方法及び装置
CN202210975650.2A CN115379225A (zh) 2017-01-31 2018-01-31 影像编码/解码方法及装置
CN202210973907.0A CN115379224A (zh) 2017-01-31 2018-01-31 影像编码/解码方法及装置
CN201880009395.8A CN110235445B (zh) 2017-01-31 2018-01-31 影像编码/解码方法及装置
EP18747331.9A EP3579557A4 (fr) 2017-01-31 2018-01-31 Procédé et dispositif de codage/décodage d'image
EP23195330.8A EP4270956A3 (fr) 2017-01-31 2018-01-31 Procédé et dispositif de codage/décodage d'image
CN202210973259.9A CN115379222A (zh) 2017-01-31 2018-01-31 影像编码/解码方法及装置
JP2022078472A JP2022106982A (ja) 2017-01-31 2022-05-11 画像の符号化／復号化方法及び装置
US17/857,470 US11882315B2 (en) 2017-01-31 2022-07-05 Method and apparatus for encoding/decoding image
US18/529,455 US12238345B2 (en) 2017-01-31 2023-12-05 Method and apparatus for encoding/decoding image
JP2024107527A JP2024125421A (ja) 2017-01-31 2024-07-03 画像の符号化／復号化方法及び装置
US19/036,648 US20250175653A1 (en) 2017-01-31 2025-01-24 Method and apparatus for encoding/decoding image

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
KR10-2017-0013637 2017-01-31
KR20170013637 2017-01-31
KR10-2018-0007285 2018-01-19
KR1020180007285A KR20180089290A (ko) 2017-01-31 2018-01-19 영상의 부호화/복호화 방법 및 장치

Related Child Applications (2)

Application Number Title Priority Date Filing Date
US16/482,457 A-371-Of-International US11425426B2 (en) 2017-01-31 2018-01-31 Method and apparatus for encoding/decoding image
US17/857,470 Continuation US11882315B2 (en) 2017-01-31 2022-07-05 Method and apparatus for encoding/decoding image

Publications (1)

Publication Number Publication Date
WO2018143670A1 true WO2018143670A1 (fr) 2018-08-09

Family

ID=63040927

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2018/001341 WO2018143670A1 (fr) 2017-01-31 2018-01-31 Procédé et dispositif de codage/décodage d'image

Country Status (1)

Country Link
WO (1) WO2018143670A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110839158A (zh) * 2018-08-16 2020-02-25 北京字节跳动网络技术有限公司 变换矩阵选择的系数相关的编码

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101356733B1 (ko) * 2007-03-07 2014-02-05 삼성전자주식회사 컨텍스트 기반 적응적 이진 산술 부호화, 복호화 방법 및장치
US20150181237A1 (en) * 2012-06-22 2015-06-25 Sharp Kabushiki Kaisha Arithmetic decoding device, arithmetic coding device, image decoding apparatus, and image coding apparatus
KR20160038063A (ko) * 2010-04-13 2016-04-06 지이 비디오 컴프레션, 엘엘씨 유효성 맵 및 변환 계수 블록의 코딩
KR101656964B1 (ko) * 2011-08-05 2016-09-12 퀄컴 인코포레이티드 비디오 코딩을 위한 변환 계수들의 코딩
KR20160116006A (ko) * 2011-11-07 2016-10-06 퀄컴 인코포레이티드 변환 스킵 모드에서의 유의 계수 정보의 코딩

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101356733B1 (ko) * 2007-03-07 2014-02-05 삼성전자주식회사 컨텍스트 기반 적응적 이진 산술 부호화, 복호화 방법 및장치
KR20160038063A (ko) * 2010-04-13 2016-04-06 지이 비디오 컴프레션, 엘엘씨 유효성 맵 및 변환 계수 블록의 코딩
KR101656964B1 (ko) * 2011-08-05 2016-09-12 퀄컴 인코포레이티드 비디오 코딩을 위한 변환 계수들의 코딩
KR20160116006A (ko) * 2011-11-07 2016-10-06 퀄컴 인코포레이티드 변환 스킵 모드에서의 유의 계수 정보의 코딩
US20150181237A1 (en) * 2012-06-22 2015-06-25 Sharp Kabushiki Kaisha Arithmetic decoding device, arithmetic coding device, image decoding apparatus, and image coding apparatus

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110839158A (zh) * 2018-08-16 2020-02-25 北京字节跳动网络技术有限公司 变换矩阵选择的系数相关的编码
US11558612B2 (en) 2018-08-16 2023-01-17 Beijing Bytedance Network Technology Co., Ltd. Coefficient dependent coding of transform matrix selection
CN110839158B (zh) * 2018-08-16 2023-03-10 北京字节跳动网络技术有限公司 变换矩阵选择的系数相关的编解码

Similar Documents

Publication Publication Date Title
WO2017222325A1 (fr) Dispositif et procédé de traitement de signal vidéo
WO2018070790A1 (fr) Procédé et dispositif de codage et de décodage d'image
WO2018088805A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2018236028A1 (fr) Procédé de traitement d'image basé sur un mode d'intra-prédiction et appareil associé
WO2017043949A1 (fr) Procédé et dispositif pour traiter un signal vidéo
WO2018070742A1 (fr) Dispositif et procédé de codage et de décodage d'image, et support d'enregistrement dans lequel le flux binaire est stocké
WO2018062880A1 (fr) Procédé de traitement d'image et appareil associé
WO2018056703A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2017086740A1 (fr) Procédé de décodage de vidéo utilisant un filtre de boucle, et dispositif associé
WO2018070713A1 (fr) Procédé et appareil pour dériver un mode de prédiction intra pour un composant de chrominance
WO2019245261A1 (fr) Procédé et appareil de codage/décodage d'images
WO2016159610A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2013157825A1 (fr) Procédé et dispositif de codage/décodage d'image
WO2019194568A1 (fr) Procédé et dispositif de codage/décodage d'image basé sur un modèle affine
WO2020004979A1 (fr) Procédé et appareil de codage/décodage d'image
WO2020096427A1 (fr) Procédé de codage/décodage de signal d'image et appareil associé
WO2020096425A1 (fr) Procédé de codage/décodage de signal d'image, et dispositif associé
WO2018066958A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2018135830A1 (fr) Procédé/dispositif de codage d'image, procédé/dispositif de décodage d'image, et support d'enregistrement sur lequel est stocké un flux binaire
WO2019231206A1 (fr) Procédé et dispositif de codage/décodage d'image
WO2016122253A1 (fr) Procédé et appareil de traitement de signaux vidéo
WO2016064123A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2016190627A1 (fr) Procédé et dispositif pour traiter un signal vidéo
WO2012150849A2 (fr) Procédé de codage/décodage vidéo utilisant un filtre à boucle résiliente d'erreur, et procédé de signalisation pour celui-ci
WO2019182329A1 (fr) Appareil/procédé de décodage d'image, appareil/procédé de codage d'image, et train de bits de stockage de support d'enregistrement

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

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2019541229

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2018747331

Country of ref document: EP

Effective date: 20190902