WO2020130514A1 - 고주파 제로잉을 기반으로 변환 계수 스캔 순서를 결정하는 방법 및 장치 - Google Patents

고주파 제로잉을 기반으로 변환 계수 스캔 순서를 결정하는 방법 및 장치 Download PDF

Info

Publication number
WO2020130514A1
WO2020130514A1 PCT/KR2019/017723 KR2019017723W WO2020130514A1 WO 2020130514 A1 WO2020130514 A1 WO 2020130514A1 KR 2019017723 W KR2019017723 W KR 2019017723W WO 2020130514 A1 WO2020130514 A1 WO 2020130514A1
Authority
WO
WIPO (PCT)
Prior art keywords
transform coefficient
current block
transform coefficients
coefficient region
block
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/KR2019/017723
Other languages
English (en)
French (fr)
Korean (ko)
Inventor
최정아
김승환
허진
유선미
이령
최장원
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
LG Electronics Inc
Original Assignee
LG Electronics Inc
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 to CN202211053759.7A priority Critical patent/CN115442608B/zh
Priority to KR1020207011528A priority patent/KR102388807B1/ko
Priority to CN202211046061.2A priority patent/CN115426495B/zh
Priority to EP19874755.2A priority patent/EP3700206A4/en
Priority to KR1020237001450A priority patent/KR102595372B1/ko
Priority to KR1020227012763A priority patent/KR102489599B1/ko
Priority to KR1020237036592A priority patent/KR102768903B1/ko
Priority to CN201980006034.2A priority patent/CN111587575B/zh
Application filed by LG Electronics Inc filed Critical LG Electronics Inc
Priority to JP2020526132A priority patent/JP2021510943A/ja
Priority to US16/855,785 priority patent/US11838512B2/en
Publication of WO2020130514A1 publication Critical patent/WO2020130514A1/ko
Anticipated expiration legal-status Critical
Priority to US18/383,327 priority patent/US12294711B2/en
Ceased legal-status Critical Current

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/129—Scanning of coding units, e.g. zig-zag scan of transform coefficients or flexible macroblock ordering [FMO]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/12—Selection from among a plurality of transforms or standards, e.g. selection between discrete cosine transform [DCT] and sub-band transform or selection between H.263 and H.264
    • H04N19/122—Selection of transform size, e.g. 8x8 or 2x4x8 DCT; Selection of sub-band transforms of varying structure or type
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/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/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/46—Embedding additional information in the video signal during the compression process
    • 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/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/70—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by syntax aspects related to video coding, e.g. related to compression standards

Definitions

  • the present disclosure relates to image coding technology, and more particularly, to a method and apparatus for determining a transform coefficient scan order based on high frequency zeroing in an image coding system.
  • VR Virtual Reality
  • AR Artificial Realtiy
  • holograms video/video having a video characteristic different from a real video such as a game video
  • video/video having a video characteristic different from a real video such as a game video
  • the broadcast for is increasing.
  • a high-efficiency video/video compression technology is required to effectively compress, transmit, store, and reproduce information of a high-resolution, high-quality video/video having various characteristics as described above.
  • the technical problem of the present disclosure is to provide a method and apparatus for improving image coding efficiency.
  • Another technical problem of the present disclosure is to provide a method and apparatus for increasing the efficiency of residual coding.
  • Another technical problem of the present disclosure is to provide a method and apparatus for improving the efficiency of transform coefficient level coding.
  • Another technical problem of the present disclosure when coding transform coefficients for a current block (or a current transform block) based on high frequency zeroing, a transform coefficient group based on information of a region to which the high frequency zeroing is not applied in the current block It is to provide a method and apparatus for changing the method of scanning.
  • Another technical problem of the present disclosure is a method of omitting a transform coefficient scan for a transform coefficient group associated with a region to which high frequency zeroing is applied, and omitting signaling of a coded subblock flag for the transform coefficient group. And devices.
  • an image decoding method performed by a decoding apparatus comprises: receiving a bitstream including residual information, deriving quantized transform coefficients for a current block based on the residual information included in the bitstream, an inverse quantization process Deriving transform coefficients for the current block from the quantized transform coefficients based on ), and applying residual inverse transform to the derived transform coefficients to derive residual samples for the current block And generating a reconstructed picture based on the residual samples for the current block, wherein each of the transform coefficients for the current block is a high-frequency transform coefficient region consisting of transform coefficient 0 or at least one valid transform. Characterized in that the transform coefficient scanning is performed on transform coefficients associated with the low-frequency transform coefficient region associated with the low-frequency transform coefficient region, and among the transform coefficients for the current block.
  • a decoding apparatus for performing image decoding.
  • the decoding apparatus receives an bitstream including residual information, and an entropy decoding unit for deriving quantized transform coefficients for a current block based on the residual information included in the bitstream, an inverse quantization process (inverse an inverse quantization unit that derives transform coefficients for the current block from the quantized transform coefficients based on a quantization process, and applies a inverse transform to the derived transform coefficients, resulting in a residual sample for the current block
  • An inverse transform unit for deriving them and an adder for generating a reconstructed picture based on the residual samples for the current block, wherein each of the transform coefficients for the current block includes a high-frequency transform coefficient region consisting of a transform coefficient of 0 or Characterized in that the transform coefficient scanning is performed on transform coefficients associated with the low frequency transform coefficient region associated with the low frequency transform coefficient region including at least one effective transform coefficient, and among the transform coefficients for the current block.
  • a video encoding method performed by an encoding device comprises: deriving residual samples for the current block, transforming the residual samples for the current block to derive transform coefficients for the current block, from the transform coefficients based on a quantization process Deriving quantized transform coefficients and encoding residual information including information about the quantized transform coefficients, wherein each of the transform coefficients for the current block is high frequency composed of transform coefficients 0
  • the transform coefficient scanning is performed on transform coefficient regions or low frequency transform coefficient regions including at least one effective transform coefficient and transform coefficients associated with the low frequency transform coefficient region among transform coefficients for the current block.
  • an encoding apparatus for performing video encoding.
  • the encoding apparatus includes a subtraction unit for deriving residual samples for the current block, a transformation unit for transforming the residual samples for the current block to derive transform coefficients for the current block, and the transformation based on a quantization process
  • Transform coefficient scanning for transform coefficients associated with the low frequency transform coefficient region associated with the low frequency transform coefficient region associated with the high frequency transform coefficient region composed of coefficients 0 or a low frequency transform coefficient region including at least one effective transform coefficient It is characterized by being performed.
  • a decoder readable storage medium stores information about instructions that cause a video decoding apparatus to perform decoding methods according to some embodiments.
  • a decoder readable storage medium that stores information on instructions that cause a video decoding apparatus to perform a decoding method according to an embodiment.
  • the decoding method according to the embodiment may include receiving a bitstream including residual information, and deriving quantized transform coefficients for a current block based on the residual information included in the bitstream, inverse Deriving transform coefficients for the current block from the quantized transform coefficients based on an inverse quantization process, and applying an inverse transform to the derived transform coefficients to register the current block Deriving dual samples and generating a reconstructed picture based on the residual samples for the current block, wherein each of the transform coefficients for the current block is a high frequency transform coefficient region consisting of a transform coefficient of 0 Alternatively, the transform coefficient scanning is performed on transform coefficients associated with the low-frequency transform coefficient region associated with the low-frequency transform coefficient region including at least one effective transform coefficient, and among the transform coefficients for the current block.
  • the efficiency of residual coding can be increased.
  • the efficiency of transform coefficient level coding can be increased.
  • more efficient coding is performed by performing binarization on a syntax element based on the size of a high frequency zeroing region (more precisely, a region where high frequency zeroing is not applied), and context coding bin ( By reducing the number of context-coded bins, the throughput of CABAC can be improved.
  • an image is generated by scanning a group of transform coefficients based on information of a region to which the high-frequency zeroing is not applied in the current block. Coding efficiency can be improved.
  • image coding efficiency is increased by omitting a transform coefficient scan for a transform coefficient group associated with a region to which high frequency zeroing is applied and omitting signaling of a coded subblock flag for the transform coefficient group.
  • FIG. 1 schematically shows an example of a video/image coding system to which the present disclosure can be applied.
  • FIG. 2 is a diagram schematically illustrating a configuration of a video/video encoding apparatus to which the present disclosure can be applied.
  • FIG. 3 is a diagram schematically illustrating a configuration of a video/video decoding apparatus to which the present disclosure can be applied.
  • FIG. 4 is a view for explaining high-frequency zeroing according to an embodiment.
  • FIG. 5 is a diagram for explaining an example of a method of scanning transform coefficients for a current block to which high-frequency zeroing is applied.
  • FIG. 6 is a view for explaining another example of a method of scanning transform coefficients for a current block to which high-frequency zeroing is applied.
  • FIG. 7A and 7B are diagrams for explaining the configuration and operation of an entropy encoding unit according to an embodiment.
  • 8A and 8B are diagrams for describing a configuration and operation method of an entropy decoding unit according to an embodiment.
  • FIG. 9 is a flowchart illustrating an operation of an encoding apparatus according to an embodiment.
  • FIG. 10 is a block diagram showing the configuration of an encoding apparatus according to an embodiment.
  • FIG. 11 is a flowchart illustrating an operation of a decoding apparatus according to an embodiment.
  • FIG. 12 is a block diagram showing the configuration of a decoding apparatus according to an embodiment.
  • FIG. 13 shows an example of a content streaming system to which the disclosure of this document can be applied.
  • an image decoding method performed by a decoding apparatus comprises: receiving a bitstream including residual information, deriving quantized transform coefficients for a current block based on the residual information included in the bitstream, an inverse quantization process Deriving transform coefficients for the current block from the quantized transform coefficients based on ), and applying residual inverse transform to the derived transform coefficients to derive residual samples for the current block And generating a reconstructed picture based on the residual samples for the current block, wherein each of the transform coefficients for the current block is a high-frequency transform coefficient region consisting of transform coefficient 0 or at least one valid transform. Characterized in that the transform coefficient scanning is performed on transform coefficients associated with the low-frequency transform coefficient region associated with the low-frequency transform coefficient region, and among the transform coefficients for the current block.
  • each configuration in the drawings described in the present disclosure is independently illustrated for convenience of description of different characteristic functions, and does not mean that each configuration is implemented with separate hardware or separate software.
  • two or more components of each component may be combined to form one component, or one component may be divided into a plurality of components.
  • Embodiments in which each configuration is integrated and/or separated are also included in the scope of the present disclosure without departing from the essence of the present disclosure.
  • FIG. 1 schematically shows an example of a video/image coding system to which the present disclosure can be applied.
  • VVC versatile video coding
  • EVC essential video coding
  • AV1 AOMedia Video 1
  • AVS2 2nd generation of audio video coding standard
  • next-generation video it can be applied to the method disclosed in the video coding standard (ex. H.267 or H.268, etc.).
  • video may refer to a set of images over time.
  • a picture generally refers to a unit representing one image in a specific time period, and a slice/tile is a unit constituting a part of a picture in coding.
  • the slice/tile may include one or more coding tree units (CTUs).
  • CTUs coding tree units
  • One picture may be composed of one or more slices/tiles.
  • One picture may be composed of one or more tile groups.
  • One tile group may include one or more tiles.
  • the brick may represent a rectangular region of CTU rows within a tile in a picture. Tiles can be partitioned into multiple bricks, and each brick can be composed of one or more CTU rows in the tile (A tile may be partitioned into multiple bricks, each of which consisting of one or more CTU rows within the tile ).
  • a tile that is not partitioned into multiple bricks may be also referred to as a brick.
  • a brick scan can indicate a specific sequential ordering of CTUs partitioning a picture, the CTUs can be aligned with a CTU raster scan within a brick, and bricks in a tile can be aligned sequentially with a raster scan of the bricks of the tile.
  • A, and tiles in a picture can be sequentially aligned with a raster scan of the tiles of the picture
  • a brick scan is a specific sequential ordering of CTUs partitioning a picture in which the CTUs are ordered consecutively in CTU raster scan in a brick , bricks within a tile are ordered consecutively in a raster scan of the bricks of the tile, and tiles in a picture are ordered consecutively in a raster scan of the tiles of the picture).
  • a tile is a rectangular region of CTUs within a particular tile column and a particular tile row in a picture.
  • the tile column is a rectangular area of CTUs, the rectangular area has a height equal to the height of the picture, and the width can be specified by syntax elements in a picture parameter set (The tile column is a rectangular region of CTUs having a height equal to the height of the picture and a width specified by syntax elements in the picture parameter set).
  • the tile row is a rectangular region of CTUs, the rectangular region has a width specified by syntax elements in a picture parameter set, and the height can be the same as the height of the picture (The tile row is a rectangular region of CTUs having a height specified by syntax elements in the picture parameter set and a width equal to the width of the picture).
  • a tile scan can indicate a specific sequential ordering of CTUs partitioning a picture, the CTUs can be successively aligned with a CTU raster scan in a tile, and the tiles in a picture can be successively aligned with a raster scan of the tiles of the picture.
  • a tile scan is a specific sequential ordering of CTUs partitioning a picture in which the CTUs are ordered consecutively in CTU raster scan in a tile whereas tiles in a picture are ordered consecutively in a raster scan of the tiles of the picture).
  • a slice may include an integer number of bricks of a picture, and the integer number of bricks may be included in one NAL unit (A slice includes an integer number of bricks of a picture that may be exclusively contained in a single NAL unit). A slice may consist of either a number of complete tiles or only a consecutive sequence of complete bricks of one tile ).
  • Tile groups and slices are used interchangeably in this document. For example, the tile group/tile group header in this document may be referred to as a slice/slice header.
  • a pixel or pel may mean a minimum unit constituting one picture (or image).
  • sample' may be used as a term corresponding to a pixel.
  • the sample may generally represent a pixel or a pixel value, may represent only a pixel/pixel value of a luma component, or may represent only a pixel/pixel value of a chroma component.
  • the unit may represent a basic unit of image processing.
  • the unit may include at least one of a specific region of a picture and information related to the region.
  • One unit may include one luma block and two chroma (ex. cb, cr) blocks.
  • the unit may be used interchangeably with terms such as a block or area depending on the case.
  • the MxN block may include samples (or sample arrays) of M columns and N rows or a set (or array) of transform coefficients.
  • a video/image coding system may include a first device (source device) and a second device (receiving device).
  • the source device may transmit the encoded video/image information or data to a receiving device through a digital storage medium or network in the form of a file or streaming.
  • the source device may include a video source, an encoding device, and a transmission unit.
  • the receiving device may include a receiving unit, a decoding apparatus, and a renderer.
  • the encoding device may be called a video/video encoding device, and the decoding device may be called a video/video decoding device.
  • the transmitter can be included in the encoding device.
  • the receiver may be included in the decoding device.
  • the renderer may include a display unit, and the display unit may be configured as a separate device or an external component.
  • the video source may acquire a video/image through a capture, synthesis, or generation process of the video/image.
  • the video source may include a video/image capture device and/or a video/image generation device.
  • the video/image capture device may include, for example, one or more cameras, a video/image archive including previously captured video/images, and the like.
  • the video/image generating device may include, for example, a computer, a tablet, and a smartphone, and may (electronically) generate a video/image.
  • a virtual video/image may be generated through a computer or the like, and in this case, a video/image capture process may be replaced by a process of generating related data.
  • the encoding device can encode the input video/video.
  • the encoding apparatus may perform a series of procedures such as prediction, transformation, and quantization for compression and coding efficiency.
  • the encoded data (encoded video/image information) may be output in the form of a bitstream.
  • the transmitting unit may transmit the encoded video/video information or data output in the form of a bitstream to a receiving unit of a receiving device through a digital storage medium or a network in a file or streaming format.
  • the digital storage media may include various storage media such as USB, SD, CD, DVD, Blu-ray, HDD, SSD.
  • the transmission unit may include an element for generating a media file through a predetermined file format, and may include an element for transmission through a broadcast/communication network.
  • the receiver may receive/extract the bitstream and deliver it to a decoding device.
  • the decoding apparatus may decode the video/image by performing a series of procedures such as inverse quantization, inverse transformation, and prediction corresponding to the operation of the encoding apparatus.
  • the renderer can render the decoded video/image.
  • the rendered video/image may be displayed through the display unit.
  • the video encoding device may include a video encoding device.
  • the encoding apparatus 200 includes an image partitioner 210, a predictor 220, a residual processor 230, and an entropy encoder 240. It may be configured to include an adder (250), a filtering unit (filter, 260) and a memory (memory, 270).
  • the prediction unit 220 may include an inter prediction unit 221 and an intra prediction unit 222.
  • the residual processing unit 230 may include a transformer 232, a quantizer 233, a dequantizer 234, and an inverse transformer 235.
  • the residual processing unit 230 may further include a subtractor 231.
  • the adder 250 may be referred to as a reconstructor or a recontructged block generator.
  • the above-described image segmentation unit 210, prediction unit 220, residual processing unit 230, entropy encoding unit 240, adding unit 250, and filtering unit 260 may include one or more hardware components (for example, it may be configured by an encoder chipset or processor). Also, the memory 270 may include a decoded picture buffer (DPB), or may be configured by a digital storage medium. The hardware component may further include a memory 270 as an internal/external component.
  • DPB decoded picture buffer
  • the image division unit 210 may divide an input image (or picture, frame) input to the encoding apparatus 200 into one or more processing units.
  • the processing unit may be called a coding unit (CU).
  • the coding unit is recursively divided according to a quad-tree binary-tree ternary-tree (QTBTTT) structure from a coding tree unit (CTU) or a largest coding unit (LCU).
  • QTBTTT quad-tree binary-tree ternary-tree
  • CTU coding tree unit
  • LCU largest coding unit
  • one coding unit may be divided into a plurality of coding units of a deeper depth based on a quad tree structure, a binary tree structure, and/or a ternary structure.
  • a quad tree structure may be applied first, and a binary tree structure and/or a ternary structure may be applied later.
  • a binary tree structure may be applied first.
  • the coding procedure according to the present disclosure can be performed based on the final coding unit that is no longer split.
  • the maximum coding unit may be directly used as a final coding unit based on coding efficiency according to image characteristics, or the coding unit may be recursively divided into coding units having a lower depth than optimal, if necessary.
  • the coding unit of the size of can be used as the final coding unit.
  • the coding procedure may include procedures such as prediction, transformation, and reconstruction, which will be described later.
  • the processing unit may further include a prediction unit (PU) or a transform unit (TU).
  • the prediction unit and the transform unit may be partitioned or partitioned from the above-described final coding unit, respectively.
  • the prediction unit may be a unit of sample prediction
  • the transformation unit may be a unit for deriving a transform coefficient and/or a unit for deriving a residual signal from the transform coefficient.
  • the unit may be used interchangeably with terms such as a block or area depending on the case.
  • the MxN block may represent samples of M columns and N rows or a set of transform coefficients.
  • the sample may generally represent a pixel or a pixel value, and may indicate only a pixel/pixel value of a luma component or only a pixel/pixel value of a saturation component.
  • the sample may be used as a term for one picture (or image) corresponding to a pixel or pel.
  • the encoding device 200 subtracts a prediction signal (a predicted block, a prediction sample array) output from the inter prediction unit 221 or the intra prediction unit 222 from the input image signal (original block, original sample array).
  • a signal residual signal, residual block, residual sample array
  • the generated residual signal is transmitted to the conversion unit 232.
  • a unit for subtracting a prediction signal (a prediction block, a prediction sample array) from an input image signal (original block, original sample array) in the encoder 200 may be referred to as a subtraction unit 231.
  • the prediction unit may perform prediction on a block to be processed (hereinafter, referred to as a current block) and generate a predicted block including prediction samples for the current block.
  • the prediction unit may determine whether intra prediction is applied to the current block or CU or inter prediction is applied. As described later in the description of each prediction mode, the prediction unit may generate various information about prediction, such as prediction mode information, and transmit it to the entropy encoding unit 240.
  • the prediction information may be encoded by the entropy encoding unit 240 and output in the form of a bitstream.
  • the intra prediction unit 222 may predict the current block by referring to samples in the current picture.
  • the referenced samples may be located in the neighbor of the current block or may be located apart depending on a prediction mode.
  • prediction modes may include a plurality of non-directional modes and a plurality of directional modes.
  • the non-directional mode may include, for example, a DC mode and a planar mode (Planar mode).
  • the directional mode may include, for example, 33 directional prediction modes or 65 directional prediction modes according to the degree of detail of the prediction direction. However, this is an example, and more or less directional prediction modes may be used depending on the setting.
  • the intra prediction unit 222 may determine a prediction mode applied to the current block using a prediction mode applied to neighboring blocks.
  • the inter prediction unit 221 may derive the predicted block for the current block based on a reference block (reference sample array) specified by a motion vector on the reference picture.
  • motion information may be predicted in units of blocks, subblocks, or samples based on the correlation of motion information between a neighboring block and a current block.
  • the motion information may include a motion vector and a reference picture index.
  • the motion information may further include inter prediction direction (L0 prediction, L1 prediction, Bi prediction, etc.) information.
  • the neighboring block may include a spatial neighboring block present in the current picture and a temporal neighboring block present in the reference picture.
  • the reference picture including the reference block and the reference picture including the temporal neighboring block may be the same or different.
  • the temporal neighboring block may be referred to by a name such as a collocated reference block or a colCU, and a reference picture including the temporal neighboring block may be called a collocated picture (colPic).
  • the inter prediction unit 221 constructs a motion information candidate list based on neighboring blocks, and provides information indicating which candidates are used to derive the motion vector and/or reference picture index of the current block. Can be created. Inter prediction may be performed based on various prediction modes. For example, in the case of the skip mode and the merge mode, the inter prediction unit 221 may use motion information of neighboring blocks as motion information of the current block.
  • the residual signal may not be transmitted.
  • the motion vector of the current block is obtained by using the motion vector of the neighboring block as a motion vector predictor and signaling a motion vector difference. I can order.
  • the prediction unit 220 may generate a prediction signal based on various prediction methods described below.
  • the prediction unit may apply intra prediction or inter prediction as well as intra prediction and inter prediction at the same time for prediction for one block. This can be called combined inter and intra prediction (CIIP).
  • the prediction unit may be based on an intra block copy (IBC) prediction mode or a palette mode for prediction of a block.
  • the IBC prediction mode or palette mode may be used for content video/video coding such as a game, such as screen content coding (SCC).
  • SCC screen content coding
  • IBC basically performs prediction in the current picture, but can be performed similarly to inter prediction in that a reference block is derived in the current picture. That is, the IBC can use at least one of the inter prediction techniques described in this document.
  • the palette mode can be regarded as an example of intra coding or intra prediction. When the palette mode is applied, a sample value in a picture may be signaled based on information on the palette table and palette index.
  • the prediction signal generated through the prediction unit may be used to generate a reconstructed signal or may be used to generate a residual signal.
  • the transform unit 232 may generate transform coefficients by applying a transform technique to the residual signal. For example, at least one of a DCT (Discrete Cosine Transform), DST (Discrete Sine Transform), KLT (Karhunen-Loeve Transform), GBT (Graph-Based Transform), or CNT (Conditionally Non-linear Transform) It can contain.
  • GBT refers to a transformation obtained from this graph when it is said to graphically represent relationship information between pixels.
  • CNT means a transform obtained by generating a prediction signal using all previously reconstructed pixels and based on it.
  • the transform process may be applied to pixel blocks having the same size of a square, or may be applied to blocks of variable sizes other than squares.
  • the quantization unit 233 quantizes the transform coefficients and transmits them to the entropy encoding unit 240, and the entropy encoding unit 240 encodes a quantized signal (information about quantized transform coefficients) and outputs it as a bitstream. have. Information about the quantized transform coefficients may be referred to as residual information.
  • the quantization unit 233 may rearrange block-type quantized transform coefficients into a one-dimensional vector form based on a coefficient scan order, and quantize the quantized transform coefficients based on the one-dimensional vector form. Information regarding transform coefficients may be generated.
  • the entropy encoding unit 240 may perform various encoding methods such as exponential Golomb (CAVLC), context-adaptive variable length coding (CAVLC), and context-adaptive binary arithmetic coding (CABAC).
  • CAVLC exponential Golomb
  • CAVLC context-adaptive variable length coding
  • CABAC context-adaptive binary arithmetic coding
  • the entropy encoding unit 240 may encode information necessary for video/image reconstruction (eg, a value of syntax elements, etc.) together with the quantized transform coefficients together or separately.
  • the encoded information (ex. encoded video/video information) may be transmitted or stored in units of network abstraction layer (NAL) units in the form of a bitstream.
  • NAL network abstraction layer
  • the video/image information may further include information regarding various parameter sets such as an adaptation parameter set (APS), a picture parameter set (PPS), a sequence parameter set (SPS), or a video parameter set (VPS).
  • the video/image information may further include general constraint information.
  • information and/or syntax elements transmitted/signaled from an encoding device to a decoding device may be included in video/video information.
  • the video/video information may be encoded through the above-described encoding procedure and included in the bitstream.
  • the bitstream can be transmitted over a network or stored on a digital storage medium.
  • the network may include a broadcasting network and/or a communication network
  • the digital storage medium may include various storage media such as USB, SD, CD, DVD, Blu-ray, HDD, SSD.
  • the signal output from the entropy encoding unit 240 may be configured as an internal/external element of the encoding device 200 by a transmitting unit (not shown) and/or a storing unit (not shown) for storing, or the transmitting unit It may be included in the entropy encoding unit 240.
  • the quantized transform coefficients output from the quantization unit 233 may be used to generate a prediction signal.
  • a residual signal residual block or residual samples
  • the adder 155 adds the reconstructed residual signal to the predicted signal output from the inter predictor 221 or the intra predictor 222, so that the reconstructed signal (restored picture, reconstructed block, reconstructed sample array) Can be generated. If there is no residual for the block to be processed, such as when the skip mode is applied, the predicted block may be used as a reconstructed block.
  • the adder 250 may be called a restoration unit or a restoration block generation unit.
  • the generated reconstructed signal may be used for intra prediction of a next processing target block in a current picture, or may be used for inter prediction of a next picture through filtering as described below.
  • LMCS luma mapping with chroma scaling
  • the filtering unit 260 may apply subjective/objective filtering to improve subjective/objective image quality.
  • the filtering unit 260 may generate a modified restoration picture by applying various filtering methods to the restoration picture, and the modified restoration picture may be a DPB of the memory 270, specifically, the memory 270. Can be stored in.
  • the various filtering methods may include, for example, deblocking filtering, sample adaptive offset, adaptive loop filter, bilateral filter, and the like.
  • the filtering unit 260 may generate various information regarding filtering as described later in the description of each filtering method, and transmit the generated information to the entropy encoding unit 240.
  • the filtering information may be encoded by the entropy encoding unit 240 and output in the form of a bitstream.
  • the modified reconstructed picture transmitted to the memory 270 may be used as a reference picture in the inter prediction unit 221.
  • inter prediction When the inter prediction is applied through the encoding apparatus, prediction mismatch between the encoding apparatus 100 and the decoding apparatus can be avoided, and encoding efficiency can be improved.
  • the memory 270 DPB may store the modified reconstructed picture for use as a reference picture in the inter prediction unit 221.
  • the memory 270 may store motion information of a block from which motion information in a current picture is derived (or encoded) and/or motion information of blocks in a picture that has already been reconstructed.
  • the stored motion information may be transmitted to the inter prediction unit 221 to be used as motion information of a spatial neighboring block or motion information of a temporal neighboring block.
  • the memory 270 may store reconstructed samples of blocks reconstructed in the current picture, and may transmit the reconstructed samples to the intra prediction unit 222.
  • FIG. 3 is a diagram schematically illustrating a configuration of a video/video decoding apparatus to which the present disclosure can be applied.
  • the decoding apparatus 300 includes an entropy decoder (310), a residual processor (320), a prediction unit (predictor, 330), an adder (340), and a filtering unit (filter, 350) and memory (memoery, 360).
  • the prediction unit 330 may include an inter prediction unit 331 and an intra prediction unit 332.
  • the residual processing unit 320 may include a deequantizer (321) and an inverse transformer (321).
  • the entropy decoding unit 310, the residual processing unit 320, the prediction unit 330, the adding unit 340, and the filtering unit 350 described above may include one hardware component (eg, a decoder chipset or processor) according to an embodiment. ).
  • the memory 360 may include a decoded picture buffer (DPB), or may be configured by a digital storage medium.
  • the hardware component may further include a memory 360 as an internal/external component.
  • the decoding apparatus 300 may restore an image corresponding to a process in which the video/image information is processed in the encoding apparatus of FIG. 2.
  • the decoding apparatus 300 may derive units/blocks based on block partitioning related information obtained from the bitstream.
  • the decoding apparatus 300 may perform decoding using a processing unit applied in the encoding apparatus.
  • the processing unit of decoding may be, for example, a coding unit, and the coding unit may be divided along a quad tree structure, a binary tree structure and/or a ternary tree structure from a coding tree unit or a largest coding unit.
  • One or more transform units can be derived from the coding unit. Then, the decoded video signal decoded and output through the decoding device 300 may be reproduced through the reproduction device.
  • the decoding apparatus 300 may receive the signal output from the encoding apparatus of FIG. 2 in the form of a bitstream, and the received signal may be decoded through the entropy decoding unit 310.
  • the entropy decoding unit 310 may parse the bitstream to derive information (eg, video/image information) necessary for image reconstruction (or picture reconstruction).
  • the video/image information may further include information regarding various parameter sets such as an adaptation parameter set (APS), a picture parameter set (PPS), a sequence parameter set (SPS), or a video parameter set (VPS).
  • the video/image information may further include general constraint information.
  • the decoding apparatus may decode a picture further based on the information on the parameter set and/or the general restriction information.
  • Signaling/receiving information and/or syntax elements described later in this document may be decoded through the decoding procedure and obtained from the bitstream.
  • the entropy decoding unit 310 decodes information in a bitstream based on a coding method such as exponential Golomb coding, CAVLC, or CABAC, and quantizes a value of a syntax element required for image reconstruction and a transform coefficient for residual.
  • a coding method such as exponential Golomb coding, CAVLC, or CABAC
  • the CABAC entropy decoding method receives bins corresponding to each syntax element in a bitstream, and decodes syntax element information to be decoded and decoding information of neighboring and decoded blocks or symbol/bin information decoded in the previous step.
  • the context model is determined by using, and the probability of occurrence of the bin is predicted according to the determined context model, and arithmetic decoding of the bin is performed to generate a symbol corresponding to the value of each syntax element. have.
  • the CABAC entropy decoding method may update the context model using the decoded symbol/bin information for the next symbol/bin context model after determining the context model.
  • prediction information is provided to a prediction unit (inter prediction unit 332 and intra prediction unit 331), and the entropy decoding unit 310 performs entropy decoding.
  • the dual value, that is, quantized transform coefficients and related parameter information may be input to the residual processor 320.
  • the residual processing unit 320 may derive a residual signal (residual block, residual samples, residual sample array). Also, information related to filtering among information decoded by the entropy decoding unit 310 may be provided to the filtering unit 350. Meanwhile, a receiving unit (not shown) receiving a signal output from the encoding device may be further configured as an internal/external element of the decoding device 300, or the receiving unit may be a component of the entropy decoding unit 310.
  • the decoding device may be called a video/picture/picture decoding device, and the decoding device may be classified into an information decoder (video/picture/picture information decoder) and a sample decoder (video/picture/picture sample decoder). It might be.
  • the information decoder may include the entropy decoding unit 310, and the sample decoder may include the inverse quantization unit 321, an inverse transformation unit 322, an addition unit 340, a filtering unit 350, and a memory 360 ), at least one of an inter prediction unit 332 and an intra prediction unit 331.
  • the inverse quantization unit 321 may inverse quantize the quantized transform coefficients to output transform coefficients.
  • the inverse quantization unit 321 may rearrange the quantized transform coefficients in a two-dimensional block form. In this case, the reordering may be performed based on the coefficient scan order performed by the encoding device.
  • the inverse quantization unit 321 may perform inverse quantization on the quantized transform coefficients by using a quantization parameter (for example, quantization step size information), and obtain transform coefficients.
  • a quantization parameter for example, quantization step size information
  • the inverse transform unit 322 inversely transforms the transform coefficients to obtain a residual signal (residual block, residual sample array).
  • the prediction unit may perform prediction on the current block and generate a predicted block including prediction samples for the current block.
  • the prediction unit may determine whether intra prediction or inter prediction is applied to the current block based on information about the prediction output from the entropy decoding unit 310, and may determine a specific intra/inter prediction mode.
  • the prediction unit 320 may generate a prediction signal based on various prediction methods described below.
  • the prediction unit may apply intra prediction or inter prediction as well as intra prediction and inter prediction at the same time for prediction for one block. This can be called combined inter and intra prediction (CIIP).
  • the prediction unit may be based on an intra block copy (IBC) prediction mode or a palette mode for prediction of a block.
  • the IBC prediction mode or palette mode may be used for content video/video coding such as a game, such as screen content coding (SCC).
  • SCC screen content coding
  • IBC basically performs prediction in the current picture, but can be performed similarly to inter prediction in that a reference block is derived in the current picture. That is, the IBC can use at least one of the inter prediction techniques described in this document.
  • the palette mode can be regarded as an example of intra coding or intra prediction. When the pallet mode is applied, information on the pallet table and pallet index may be included in the video/image information and signaled.
  • the intra prediction unit 331 may predict the current block by referring to samples in the current picture.
  • the referenced samples may be located in the neighbor of the current block or may be located apart depending on a prediction mode.
  • prediction modes may include a plurality of non-directional modes and a plurality of directional modes.
  • the intra prediction unit 331 may determine a prediction mode applied to the current block using a prediction mode applied to neighboring blocks.
  • the inter prediction unit 332 may derive a predicted block for the current block based on a reference block (reference sample array) specified by a motion vector on the reference picture.
  • motion information may be predicted in units of blocks, subblocks, or samples based on the correlation of motion information between a neighboring block and a current block.
  • the motion information may include a motion vector and a reference picture index.
  • the motion information may further include inter prediction direction (L0 prediction, L1 prediction, Bi prediction, etc.) information.
  • the neighboring block may include a spatial neighboring block present in the current picture and a temporal neighboring block present in the reference picture.
  • the inter prediction unit 332 may construct a motion information candidate list based on neighboring blocks, and derive a motion vector and/or reference picture index of the current block based on the received candidate selection information.
  • Inter prediction may be performed based on various prediction modes, and information on the prediction may include information indicating a mode of inter prediction for the current block.
  • the adding unit 340 reconstructs the obtained residual signal by adding it to the prediction signal (predicted block, prediction sample array) output from the prediction unit (including the inter prediction unit 332 and/or the intra prediction unit 331).
  • a signal (restored picture, reconstructed block, reconstructed sample array) can be generated. If there is no residual for the block to be processed, such as when the skip mode is applied, the predicted block may be used as a reconstructed block.
  • the adding unit 340 may be called a restoration unit or a restoration block generation unit.
  • the generated reconstructed signal may be used for intra prediction of a next processing target block in a current picture, may be output through filtering as described below, or may be used for inter prediction of a next picture.
  • LMCS luma mapping with chroma scaling
  • the filtering unit 350 may improve subjective/objective image quality by applying filtering to the reconstructed signal.
  • the filtering unit 350 may generate a modified reconstructed picture by applying various filtering methods to the reconstructed picture, and the modified reconstructed picture may be a DPB of the memory 360, specifically, the memory 360 Can be transferred to.
  • the various filtering methods may include, for example, deblocking filtering, sample adaptive offset, adaptive loop filter, bilateral filter, and the like.
  • the (corrected) reconstructed picture stored in the DPB of the memory 360 may be used as a reference picture in the inter prediction unit 332.
  • the memory 360 may store motion information of a block from which motion information in a current picture is derived (or decoded) and/or motion information of blocks in a picture that has already been reconstructed.
  • the stored motion information may be transmitted to the inter prediction unit 260 to be used as motion information of a spatial neighboring block or motion information of a temporal neighboring block.
  • the memory 360 may store reconstructed samples of blocks reconstructed in the current picture, and may transmit the reconstructed samples to the intra prediction unit 331.
  • the embodiments described in the filtering unit 260, the inter prediction unit 221, and the intra prediction unit 222 of the encoding device 100 are respectively the filtering unit 350 and the inter prediction of the decoding device 300.
  • the unit 332 and the intra prediction unit 331 may be applied to the same or corresponding.
  • a predicted block including prediction samples for a current block which is a block to be coded
  • the predicted block includes prediction samples in a spatial domain (or pixel domain).
  • the predicted block is derived equally from an encoding device and a decoding device, and the encoding device decodes information (residual information) about the residual between the original block and the predicted block, not the original sample value itself of the original block. Signaling to the device can improve video coding efficiency.
  • the decoding apparatus may derive a residual block including residual samples based on the residual information, and combine the residual block and the predicted block to generate a reconstructed block including reconstructed samples, and reconstruct the reconstructed blocks. It is possible to generate a reconstructed picture that includes.
  • the residual information may be generated through transformation and quantization procedures.
  • the encoding device derives a residual block between the original block and the predicted block, and derives transformation coefficients by performing a transformation procedure on residual samples (residual sample array) included in the residual block And, by performing a quantization procedure on the transform coefficients, the quantized transform coefficients are derived to signal related residual information (via a bitstream) to a decoding apparatus.
  • the residual information may include information such as value information of the quantized transform coefficients, location information, a transform technique, a transform kernel, and quantization parameters.
  • the decoding apparatus may perform an inverse quantization/inverse transformation procedure based on the residual information and derive residual samples (or residual blocks).
  • the decoding apparatus may generate a reconstructed picture based on the predicted block and the residual block.
  • the encoding device may also dequantize/inverse transform quantized transform coefficients for reference for inter prediction of a picture to derive a residual block, and generate a reconstructed picture based thereon.
  • FIG. 4 is a view for explaining high-frequency zeroing according to an embodiment.
  • High frequency zeroing herein refers to zero transform coefficients related to frequencies above a certain value in a (transformation) block having a first horizontal size (or length) W1 and a first vertical size (or length) H1. It means the process (that is, it is decided as 0).
  • all of the transform coefficients of the transform coefficients outside the low-frequency transform coefficient region configured based on the second horizontal size W2 and the second vertical size H2 among the transform coefficients in the (transformation) block are 0. Can be determined (set).
  • the outside of the low-frequency transform coefficient region may be referred to as a high-frequency transform coefficient region.
  • the low-frequency transform coefficient region may be a square-shaped region positioned from the upper left of the (transformed) block.
  • high frequency zeroing may be replaced with various terms such as high frequency zeroing, high frequency zeroing, high frequency zeroing, and the “high frequency conversion coefficient region” may be replaced with various terms such as high frequency zeroing application region, high frequency region, and high frequency coefficient region.
  • the "low frequency conversion coefficient region” may be replaced with various terms such as a high frequency zeroing unapplied region, a low frequency region, a low frequency coefficient region, and a restricted region, and is used herein to define specific information or concepts.
  • a method of performing binarization of syntax elements last_sig_coeff_x_prefix and last_sig_coeff_y_prefix for a (transformation) block (TB, TU or CB) to which high frequency zeroing is applied may be proposed.
  • last_sig_coeff_x_prefix and last_sig_coeff_y_prefix can be binarized with a truncated rice code, where the value of cRiceParam can be 0.
  • cMax used for binarization for the truncated rice code may be determined based on Equation 1 when performing binarization of last_sig_coeff_x_prefix, and based on Equation 2 when performing binarization of last_sig_coeff_y_prefix.
  • W1 may represent the horizontal length (or width) of the (converted) block
  • H1 may represent the vertical length (or height) of the transform block.
  • W1 is 64 and H1 is 32. Accordingly, a value of cMax for binarization of last_sig_coeff_x_prefix may be 11, and a value of cMax for binarization of last_sig_coeff_y_prefix may be 9.
  • Table 1 below shows the binarization when W1 or H1 is 32
  • Table 2 below shows the binarization codeword when W1 or H1 is 64.
  • last_sig_coeff_x_prefix for encoding a case where the values of LastSignificantCoeffX or LastSignificantCoeffY are 32 to 47 as shown in Table 2 below.
  • the codeword of last_sig_coeff_y_prefix may be '11111111110', and the codeword for encoding the cases of 48 to 63 may be '11111111111', in both cases based on 11 bins.
  • the codeword may be called an empty string.
  • the encoding apparatus may perform a residual coding procedure on (quantized) transform coefficients.
  • the encoding apparatus may residual code (quantized) transform coefficients in a current block (current coding block (CB) or current transform block (TB)) according to a scan order.
  • the encoding apparatus may generate and encode various syntax elements related to residual information, for example, as described in Table 3 below.
  • numSbCoeff 1 ⁇ (log2SbSize ⁇ 1)
  • numSbCoeff 1 ⁇ (log2SbSize ⁇ 1)
  • LastSignificantCoeffX may be derived based on the value of last_sig_coeff_x_suffix.
  • the codeword of last_sig_coeff_x_prefix for encoding a case where the value of LastSignificantCoeffX is 32 to 47 may be '11111111110', and whether any value from 32 to 47 is used may be determined based on the value of last_sig_coeff_x_suffix have.
  • LastSignificantCoeffY may be derived based on the value of last_sig_coeff_y_suffix.
  • the codeword of last_sig_coeff_x_prefix for encoding a case where the value of LastSignificantCoeffY is 32 to 47 is '11111111110', and which value from 32 to 47 is used may be determined based on the value of last_sig_coeff_y_suffix.
  • LastSignificantCoeffX or LastSignificantCoeffY may be performed, for example, as shown in Table 4 below.
  • High-frequency zeroing zeroes the coefficients of frequencies higher than a certain level (ie, is determined as 0) in the transform block having the first horizontal size W1 or the first vertical size H1 to determine the residual transform coefficients as the second horizontal size ( W2) or the second vertical size (H2).
  • the size of the restricted region (second horizontal size) derived through high-frequency zeroing
  • a method of performing binarization based on the truncated rice code based on the second vertical size may be considered.
  • the truncated rice code derived based on Equation 3 or Equation 4 is It may be as shown in Table 5 below.
  • Table 5 the truncated rice code derived based on Equation 3 or Equation 4
  • Table 6 the binary codeword design as shown in Table 6 below may be possible.
  • W2 and H2 may be set to fixed values. Alternatively, W2 and H2 may be determined based on W1 and H1. Alternatively, information indicating W2 and H2 may be signaled from the encoding device to the decoding device. In one example, the W2 and H2 may be set to 32 or 16, respectively. In another example, W2 and H2 may be derived as 1/2 of W1 and 1/2 of H1, respectively. In another example, W2 and H2 may be derived as 1/2 of max(W1,H1). However, this is an example, and W2 and H2 may be determined by another various methods set in the encoding device and the decoding device.
  • the proposed method can effectively reduce the codeword length for some values of LastSignificantCoeffX or LastSignificantCoeffY.
  • the coding bin saved through this is a context coding bin, it may have an advantage in terms of throughput.
  • the residual coding method described later in FIGS. 7A to 8B may be performed based on the embodiments described in FIG. 4.
  • an encoding method described later in FIG. 9 or a decoding method described later in FIG. 11 may be performed.
  • FIG. 5 is a view for explaining an example of a method of scanning transform coefficients for a current block to which high-frequency zeroing is applied
  • FIG. 6 is another example of a method of scanning transform coefficients for a current block to which high-frequency zeroing is applied. It is a drawing for doing.
  • residual coding may be performed while scanning the transform coefficient group in the inverse diagonal direction from the position of the last transform coefficient group including the last non-zero coefficient.
  • the scan order of the transform coefficient group may be changed for a transform block to which high frequency zeroing is applied.
  • FIG. 5 shows how a 4x4 transform coefficient group is scanned in a 64x64 transform block to which high-frequency zeroing is applied.
  • the part indicated by L means a 4x4 transform coefficient group including the last non-zero coefficient.
  • High frequency zeroing zeroes (or zeros out) the transform coefficients associated with high frequencies above a certain frequency in a transform block having a first horizontal dimension W1 and/or a first vertical dimension H1 to convert the residual transform coefficients to a second horizontal dimension It means to be limited to (W2) and/or the second vertical size (H2), and the 4x4 blocks marked with dots in FIG. 5 represent areas that are zeroed out through high-frequency zeroing.
  • the hatched area may be referred to as a low frequency conversion coefficient area
  • the dot-marked area may be referred to as a high frequency conversion coefficient area.
  • W2 and/or H2 may be set to a fixed value, or may be determined based on W1 and/or H1. Alternatively, information indicating W2 and/or H2 may be signaled from the encoding device to the decoding device. In one example, the W2 and H2 may be set to 32 or 16, respectively. In another example, the W2 and/or H2 may be derived from 1/2 of W1 and/or 1/2 of H1, respectively. In another example, W2 and/or H2 may be derived by 1/2 of max(W1,H1). However, the above examples are only a part, and the W2 and/or H2 may be determined based on various methods in an encoding device and a decoding device.
  • the encoding device is a coded sub-block for a sub-block located in a region (ie, a high-frequency transform coefficient region) that exceeds W2 and/or H2 in a current (transformed) block.
  • the flag may not be included in the residual coding syntax (or bitstream). That is, the bit related to the syntax element coded_sub_block_flag for the sub-block located in the area exceeding W2 and/or H2 may not be allocated.
  • the decoding apparatus may infer that the last effective coefficient is not located in the area exceeding W2 and/or H2 without performing a scan for the subblock located in the area exceeding W2 and/or H2. .
  • the decoding apparatus does not parse the syntax element coded_sub_block_flag for the subblock located in the region exceeding W2 and/or H2 from the residual coding syntax (or bitstream), and sets the value of the syntax element coded_sub_block_flag. Can be inferred as 0.
  • the residual coding method described below in FIGS. 7A to 8B may be performed based on the embodiments described with reference to FIGS. 5 and 6.
  • the encoding methods described later in FIG. 9 or the decoding methods described later in FIG. 11 may be performed based on the embodiments described with reference to FIGS. 5 and 6.
  • FIG. 7A and 7B are diagrams for explaining the configuration and operation of an entropy encoding unit according to an embodiment.
  • the encoding apparatus may perform a residual coding procedure on (quantized) transform coefficients.
  • the (quantized) transform coefficients may be transform coefficients to which high-frequency zeroing is applied in one example, and may include non-zero high-frequency coefficients in another example, wherein the high-frequency in the residual coding procedure performed by the entropy encoding unit Coefficients can be considered or treated as zero.
  • the encoding apparatus may residual code (quantized) transform coefficients in a current block (current coding block (CB) or current transform block (TB)) according to a scan order.
  • the encoding apparatus may generate and encode various syntax elements related to residual information, for example, as described in Table 3 above. S700 and S710 may be included in the residual information encoding procedure of FIG. 2.
  • the encoding apparatus may perform binarization for residual related syntax elements (S700).
  • binarization according to the above-described embodiments in FIG. 4 may be performed on last_sig_coeff_x_prefix and last_sig_coeff_y_prefix.
  • the last_sig_coeff_x_prefix and the last_sig_coeff_y_prefix may be derived based on the position of the last valid coefficient in the current block.
  • binarization may be performed according to a predetermined method with respect to the remaining syntex elements of Table 3 above.
  • last_sig_coeff_x_prefix and last_sig_coeff_y_prefix may represent examples of last significant coefficient prefix information for the position of the last non-zero transform coefficient among the transform coefficients for the current block. More specifically, last_sig_coeff_x_prefix may represent an example of x-axis prefix information that is one of the last valid coefficient prefix information, and last_sig_coeff_y_prefix may represent an example of y-axis prefix information that is one of the last valid coefficient prefix information.
  • a value of cRiceParam may be 0.
  • the encoding apparatus may derive an empty string for each of the last_sig_coeff_x_prefix and last_sig_coeff_y_prefix through the binarization procedure.
  • the binarization procedure may be performed by the binarization unit 242 in the entropy encoding unit 240.
  • cMax values for each of last_sig_coeff_x_prefix and last_sig_coeff_y_prefix may be derived based on whether high-frequency zeroing is applied.
  • the specific equation for deriving cMax has been described above in FIG. 4.
  • the cMax may indicate the maximum length of a codeword (empty string) derived in the binarization process for last_sig_coeff_x_prefix or last_sig_coeff_y_prefix.
  • the encoding apparatus may perform entropy encoding for the syntax elements related to the residual coding (S710).
  • the encoding apparatus may omit the transform coefficient scan for the region to which the high frequency zeroing is applied, and may not encode coded_sub_block_flag for the region to which the high frequency zeroing is applied. That is, in generating a residual coding syntax (or bitstream), the encoding device may not include the syntax element coded_sub_block_flag for a sub-block located in a region to which high-frequency zeroing is applied.
  • the encoding apparatus may encode coded_sub_block_flag only in a region to which high-frequency zeroing is not applied, that is, a left upper transform coefficient region (or a low frequency transform coefficient region) and include it in a residual coding syntax (or bitstream). Through this, the number of bits allocated to residual coding can be reduced.
  • the encoding device may context- or bypass-based encode the empty string based on entropy coding techniques such as CABAC (context-adaptive arithmetic coding) or CAVLC (context-adaptive variable length coding). Can be included.
  • the entropy encoding procedure may be performed by the entropy encoding processing unit 244 in the entropy encoding unit 240.
  • the bitstream may include various information for video/video decoding, such as prediction information, in addition to residual information including information about last_sig_coeff_x_prefix and last_sig_coeff_y_prefix.
  • the bitstream may be delivered to a decoding device through a (digital) storage medium or a network.
  • 8A and 8B are diagrams for describing a configuration and operation method of an entropy decoding unit according to an embodiment.
  • the decoding apparatus may decode the encoded residual information to derive (quantized) transform coefficients.
  • the decoding apparatus may derive (quantized) transform coefficients by decoding the encoded residual information for the current block (current coding block or current transform block) as described above in FIG. 4. .
  • the decoding apparatus decodes various syntax elements related to residual information as described in Table 3 above, interprets values of related syntax elements, and is based on the (quantized) value of the interpreted syntax element stone.
  • the transform coefficients can be derived.
  • S800 to S810 may be included in the procedure for deriving the (quantized) transform coefficients of FIG. 3 described above.
  • the decoding apparatus may perform binarization on residual related syntax elements (S800). For example, binarization based on the above-described embodiments in FIG. 4 may be performed on last_sig_coeff_x_prefix and last_sig_coeff_y_prefix. At this time, the value of cRiceParam may be 0. In the binarization procedure, the decoding apparatus may derive available empty strings for available values of each of the last_sig_coeff_x_prefix and last_sig_coeff_y_prefix through the binarization procedure. The binarization procedure may be performed by the binarization unit 312 in the entropy decoding unit 310.
  • S800 residual related syntax elements
  • cMax values for each of last_sig_coeff_x_prefix and last_sig_coeff_y_prefix may be derived based on whether high-frequency zeroing is applied.
  • the specific equation for deriving cMax has been described above in FIG. 4.
  • the cMax may indicate the maximum length of a codeword (empty string) derived in the binarization process for last_sig_coeff_x_prefix or last_sig_coeff_y_prefix.
  • binarization may be performed according to a predetermined method with respect to the remaining syntex elements of Table 3. For example, transform_skip_flag, last_sig_coeff_x_suffix, last_sig_coeff_y_suffix, coded_sub_block_flag, sig_coeff_flag, par_level_flag, rem_abs_gt1_flag, rem_abs_gt2_flag, fixed-length for the number of times, fixed for the length of the number of times, the number of times for the fixed number of times, Binarization can be performed.
  • the decoding apparatus may perform entropy decoding on the syntax elements related to the residual coding (S810).
  • the decoding apparatus may parse and decode each bin for each syntax element sequentially, and compare the derived bin string with the available bin strings. If the derived empty string is equal to one of the available empty strings, a value corresponding to the empty string may be derived as the value of the syntax element. If the derived empty string is not equal to any of the available empty strings, the comparison procedure may be performed after further parsing and decoding the next bit in the bitstream. Through this process, the corresponding information can be signaled using a variable length bit without using a start bit or an end bit for specific information (a specific syntax element) in the bitstream, and through this, relatively fewer bits for low values. Allocating can improve overall coding efficiency.
  • the decoding apparatus may omit the transform coefficient scan for an area to which high-frequency zeroing is applied, and may parse and/or decode coded_sub_block_flag for an area to which high-frequency zeroing is applied, and regard it as 0. That is, the decoding apparatus may infer that the last effective coefficient is not located without performing a scan on the sub-block located in the region to which high-frequency zeroing is applied, and syntax for the sub-block located in the region to which high-frequency zeroing is applied.
  • the element coded_sub_block_flag may not be parsed from the residual coding syntax (or bitstream), and the value of the syntax element coded_sub_block_flag may be inferred as 0.
  • the decoding apparatus may infer that the syntax element coded_sub_block_flag parsed and/or decoded in residual information (eg, residual coding syntax) for the current block is not for an area to which high frequency zeroing is applied, It can be inferred that the syntax element coded_sub_block_flag first parsed and/or decoded in the residual information (eg, residual syntax) for the upper left transform block is for the first subblock derived based on the scan order.
  • residual information eg, residual coding syntax
  • the decoding apparatus may decode each bin in the bin string from the bitstream based on context or bypass based on an entropy coding technique such as CABAC or CAVLC.
  • the entropy decoding procedure may be performed by the entropy decoding processing unit 314 in the entropy decoding unit 310.
  • the decoding apparatus may derive the position of the last valid coefficient based on the value of last_sig_coeff_x_prefix and the value of last_sig_coeff_y_prefix. Specific calculation may be performed based on, for example, Table 6 below.
  • LastSignificantCoeffX represents the x-axis position of the last non-zero effective coefficient in the current (transformed) block
  • LastSignificantCoeffY represents the y-axis position of the last non-zero effective coefficient in the current (transformed) block.
  • the bitstream may include various information for video/video decoding, such as prediction information, in addition to residual information including information about last_sig_coeff_x_prefix and last_sig_coeff_y_prefix.
  • prediction information such as prediction information
  • residual information including information about last_sig_coeff_x_prefix and last_sig_coeff_y_prefix.
  • the bitstream can be transmitted to a decoding device through a (digital) storage medium or a network.
  • the decoding apparatus may derive residual samples for the current block by performing an inverse quantization and/or inverse transformation procedure based on the (quantized) transform coefficients.
  • Restoration samples may be generated based on the residual samples and prediction samples derived through inter/intra prediction, and a reconstruction picture including the reconstruction samples may be generated.
  • FIG. 9 is a flowchart illustrating an operation of an encoding device according to an embodiment
  • FIG. 10 is a block diagram showing a configuration of an encoding device according to an embodiment.
  • the encoding device according to FIGS. 9 and 10 may perform operations corresponding to the decoding device according to FIGS. 11 and 12. Therefore, the operations of the decoding apparatus to be described later in FIGS. 11 and 12 can be applied to the encoding apparatus according to FIGS. 9 and 10 as well.
  • Each step disclosed in FIG. 9 may be performed by the encoding apparatus 200 disclosed in FIG. 2. More specifically, S900 may be performed by the subtraction unit 231 illustrated in FIG. 2, S910 may be performed by the conversion unit 232 illustrated in FIG. 2, and S920 may be performed by the quantization unit 233 illustrated in FIG. 2. ), and S930 may be performed by the entropy encoding unit 240 illustrated in FIG. 2.
  • the operations according to S900 to S930 are based on some of the contents described in FIGS. 4 to 8. Therefore, detailed descriptions that overlap with those described above in FIGS. 2 and 4 to 8B will be omitted or simplified.
  • the encoding apparatus may include a subtraction unit 231, a conversion unit 232, a quantization unit 233, and an entropy encoding unit 240.
  • the encoding apparatus may be implemented by more or fewer components than those illustrated in FIG. 10.
  • the subtraction unit 231, the conversion unit 232, the quantization unit 233, and the entropy encoding unit 240 may be implemented as separate chips, or at least two or more components may be used. It can also be implemented through a single chip.
  • the encoding apparatus may derive residual samples for the current block (S900). More specifically, the subtraction unit 231 of the encoding device may derive residual samples for the current block.
  • the encoding apparatus may transform the residual samples for the current block to derive transform coefficients for the current block (S910). More specifically, the conversion unit 232 of the encoding device may convert the residual samples for the current block to derive conversion coefficients for the current block.
  • the encoding apparatus may derive quantized transform coefficients from the transform coefficients based on a quantization process (S920 ). More specifically, the quantization unit 233 of the encoding apparatus may derive quantized transform coefficients from the transform coefficients based on a quantization process.
  • the encoding apparatus may encode residual information including information about the quantized transform coefficients (S930). More specifically, the entropy encoding unit 240 of the encoding device may encode residual information including information about the quantized transform coefficients.
  • the current block may represent a current transform block (TB or TU) or a current coding block (CB or CU).
  • TB or TU current transform block
  • CB or CU current coding block
  • each of the transform coefficients for the current block may be related to a high frequency transform coefficient region composed of transform coefficients 0 or a low frequency transform coefficient region including at least one effective transform coefficient.
  • transform coefficient scanning may be performed on transform coefficients related to the low frequency transform coefficient region among transform coefficients for the current block.
  • the residual information includes a coded subblock flag indicating whether the transform coefficient level of transform coefficients for a subblock in the current block is all 0, and the subblock is the It may be associated with a low frequency transform coefficient region.
  • the coded sub-block flag may be indicated as coded_sub_block_flag.
  • the transform coefficient scanning may not be performed on transform coefficients related to the high frequency transform coefficient region.
  • the width of the low-frequency transform coefficient region or the height of the low-frequency transform coefficient region may be 32 or less.
  • the width of the low-frequency transform coefficient region may be determined to be the same as the width of the current block. Based on the determination that the height of the current block is less than 32, the height of the low-frequency transform coefficient region may be determined to be the same as the height of the current block. Based on the determination that the width of the current block is 32 or more, the width of the low-frequency transform coefficient region may be determined as 32. Based on the determination that the height of the current block is 32 or more, the height of the low-frequency transform coefficient region may be determined as 32.
  • the width of the low frequency transform coefficient region and the height of the low frequency transform coefficient region may be determined based on Equation 5 below.
  • the ZoTbWidth represents the width of the low frequency transform coefficient region
  • the ZoTbHeight represents the height of the low frequency transform coefficient region
  • the TbWidth represents the width of the current block
  • the TbHeight is the current block Can indicate the height of
  • zeroing is applied to transform coefficients related to the high frequency transform coefficient region, and the number of transform coefficients to which the zeroing is applied is based on the width of the low frequency transform coefficient region or the height of the low frequency transform coefficient region. Can be determined.
  • the encoding apparatus derives residual samples for the current block (S900), converts the residual samples for the current block, and converts the residual samples to the current block.
  • Transform coefficient scanning may be performed on transform coefficients related to the low frequency transform coefficient region among transform coefficients. That is, image coding efficiency can be increased by omitting the transform coefficient scan for a transform coefficient group associated with a region to which high-frequency zeroing is applied and omitting signaling of a coded subblock flag for the transform
  • FIG. 11 is a flowchart illustrating an operation of a decoding apparatus according to an embodiment
  • FIG. 12 is a block diagram showing a configuration of a decoding apparatus according to an embodiment.
  • Each step disclosed in FIG. 11 may be performed by the decoding apparatus 300 disclosed in FIG. 3. More specifically, S1100 and S1110 may be performed by the entropy decoding unit 310 disclosed in FIG. 3, S1120 may be performed by the inverse quantization unit 321 illustrated in FIG. 3, and S1130 disclosed by FIG. 3 It may be performed by the inverse transform unit 322, S1140 may be performed by the adder 340 disclosed in FIG. In addition, the operations according to S1100 to S1140 are based on some of the contents described in FIGS. 4 to 8B. Therefore, detailed descriptions that overlap with those described above in FIGS. 3 to 8B will be omitted or simplified.
  • the decoding apparatus may include an entropy decoding unit 310, an inverse quantization unit 321, an inverse transformation unit 322, and an addition unit 340.
  • an entropy decoding unit 310 may be included in the decoding apparatus, and the decoding apparatus may be implemented by more or less components than those illustrated in FIG. 12.
  • the entropy decoding unit 310, the inverse quantization unit 321, the inverse conversion unit 322, and the addition unit 340 are each implemented as separate chips, or at least two or more components May be implemented through a single chip.
  • the decoding apparatus may receive a bitstream including residual information (S1100). More specifically, the entropy decoding unit 310 of the decoding apparatus may receive a bitstream including residual information.
  • the decoding apparatus may derive quantized transform coefficients for the current block based on residual information included in the bitstream (S1110). More specifically, the entropy decoding unit 310 of the decoding apparatus may derive a quantized transform coefficient for the current block based on residual information included in the bitstream.
  • the decoding apparatus may derive transform coefficients from quantized transform coefficients based on an inverse quantization process (S1120 ). More specifically, the inverse quantization unit 321 of the decoding apparatus may derive transform coefficients from quantized transform coefficients based on an inverse quantization process.
  • the decoding apparatus may derive residual samples for a current block by applying an inverse transform to the derived transform coefficients (S1130). More specifically, the inverse transform unit 322 of the decoding apparatus may derive residual samples for the current block by applying an inverse transform to the derived transform coefficients.
  • the decoding apparatus may generate a reconstructed picture based on the residual sample for the current block (S1140). More specifically, the adder 340 of the decoding apparatus may generate a reconstructed picture based on the residual sample for the current block.
  • the unit of the current block may be a transform block (TB). In another embodiment, the unit of the current block may be a coding block (CB).
  • TB transform block
  • CB coding block
  • each of the transform coefficients for the current block may be related to a high frequency transform coefficient region composed of transform coefficients 0 or a low frequency transform coefficient region including at least one effective transform coefficient.
  • transform coefficient scanning may be performed on transform coefficients related to the low frequency transform coefficient region among transform coefficients for the current block.
  • the residual information includes a coded subblock flag indicating whether the transform coefficient level of transform coefficients for a subblock in the current block is all 0, and the subblock is the It may be associated with a low frequency transform coefficient region.
  • the coded sub-block flag may be indicated as coded_sub_block_flag.
  • the transform coefficient scanning may not be performed on transform coefficients related to the high frequency transform coefficient region.
  • the width of the low-frequency transform coefficient region or the height of the low-frequency transform coefficient region may be 32 or less.
  • the width of the low-frequency transform coefficient region may be determined to be the same as the width of the current block. Based on the determination that the height of the current block is less than 32, the height of the low-frequency transform coefficient region may be determined to be the same as the height of the current block. Based on the determination that the width of the current block is 32 or more, the width of the low-frequency transform coefficient region may be determined as 32. Based on the determination that the height of the current block is 32 or more, the height of the low-frequency transform coefficient region may be determined as 32.
  • the width of the low frequency transform coefficient region and the height of the low frequency transform coefficient region may be determined based on Equation 6 below.
  • the ZoTbWidth represents the width of the low frequency transform coefficient region
  • the ZoTbHeight represents the height of the low frequency transform coefficient region
  • the TbWidth represents the width of the current block
  • the TbHeight is the current block Can indicate the height of
  • zeroing is applied to transform coefficients related to the high frequency transform coefficient region, and the number of transform coefficients to which the zeroing is applied is the width of the low frequency transform coefficient region or the width of the low frequency transform coefficient region. It can be determined based on the height.
  • the decoding apparatus receives a bitstream including residual information (S1100), and is currently based on the residual information included in the bitstream.
  • Derive quantized transform coefficients for the block S1110), derive transform coefficients from the quantized transform coefficients based on the inverse quantization process (S1120), and apply an inverse transform to the derived transform coefficients to register the current block
  • Dual samples may be derived (S1130), and a reconstructed picture may be generated based on residual samples for the current block (S1140), wherein each of the transform coefficients for the current block is a high frequency transform composed of a transform coefficient of 0 Transform coefficient scanning is performed on a coefficient region or a low frequency transform coefficient region including at least one effective transform coefficient, and transform coefficients related to the low frequency transform coefficient region among transform coefficients for the current block.
  • the residual coding process described above in FIGS. 4 to 10 may be based on the contents of the English specification below.
  • the binarization of last significant coefficient position is modified to reduce the maximum number of context coded bins.
  • the number of context coded bins for large block ie, 64 ⁇ 64, 64 ⁇ N, N ⁇ 64
  • Experimental results show 0.01%, 0%, and -0.02% BD-rate reductions on Y, Cb, and Cr components, respectively, compared to VTM3.0 in all-intra configuration, and 0.01%, -0.01%, and -0.01% BD-rate reductions in random access configuration.
  • cMax (log2TbSize ⁇ 1)-1.
  • log2TbSize is set equal to log2
  • log2TbSize is set equal to log2TbHeight. That is, the maximum possible magnitude is determined by the transform block width or height.
  • a last position coding scheme is proposed for large block-size transforms. Compared to VTM3.0, the proposed coding scheme uses less context coded bins in the worst case scenario.
  • the codeword in the proposed scheme still starts with a truncated Rice code and followed by a fixed length code. After high-frequency zeroing, for a W ⁇ H transform block, only the top-left min(W, 32) ⁇ min(H, 32) transform coefficients are kept.
  • the maximum possible codeword length of the prefix last_sig_coeff_x_prefix or last_sig_coeff_y_prefix is derived as:
  • cMax (min(log2TbSize, 5) ⁇ 1)-1.
  • the context coded bins can be as long as 9 in the proposed method, while it is up to 11 bins in VTM3.0. Note that when the magnitude of the last position component in the range of 24-31, the number of context coded bins is reduced from 10 to 9. 3.
  • the proposed method has been implemented on the VTM3.0 software.
  • the simulations were performed following the common test conditions defined in JVET-L1010 [3].
  • the anchor is the VTM3.0 software.
  • Encoding time and decoding time come from the cross-check results [4].
  • Table 10 shows Experimental results for all-intra (AI) test condition; anchor is VTM3.0.
  • Table 11 shows Experimental results for random-access (RA) test condition; anchor is VTM3.0.
  • LG Electronics Inc. may have current or pending patent rights relating to the technology described in this contribution and, conditioned on reciprocity, is prepared to grant licenses under reasonable and non-discriminatory terms as necessary for implementation of the resulting ITU-T Recommendation
  • ISO/IEC International Standard per box 2 of the ITU-T/ITU-R/ISO/IEC patent statement and licensing declaration form).
  • last_sig_coeff_x_prefix specifies the prefix of the column position of the last significant coefficient in scanning order within a transform block.
  • the values of last_sig_coeff_x_prefix shall be in the range of 0 to (Min( log2TbWidth, 5) ⁇ 1) 1, inclusive.
  • last_sig_coeff_y_prefix specifies the prefix of the row position of the last significant coefficient in scanning order within a transform block.
  • the values of last_sig_coeff_y_prefix shall be in the range of 0 to (Min( log2TbHeight, 5) ⁇ 1) 1, inclusive.
  • Table 13 below shows syntax elements and associated binarizations.
  • the above-described method according to the present disclosure may be implemented in software form, and the encoding device and/or the decoding device according to the present disclosure may perform image processing, such as a TV, computer, smartphone, set-top box, display device, etc. Device.
  • the above-described method may be implemented as a module (process, function, etc.) performing the above-described function.
  • Modules are stored in memory and can be executed by a processor.
  • the memory may be internal or external to the processor, and may be connected to the processor by various well-known means.
  • the processor may include an application-specific integrated circuit (ASIC), other chipsets, logic circuits, and/or data processing devices.
  • the memory may include read-only memory (ROM), random access memory (RAM), flash memory, memory cards, storage media and/or other storage devices. That is, the embodiments described in the present disclosure may be implemented and implemented on a processor, microprocessor, controller, or chip.
  • the functional units shown in each figure may be implemented and implemented on a computer, processor, microprocessor, controller, or chip. In this case, information for implementation (ex. information on instructions) or an algorithm may be stored in a digital storage medium.
  • the decoding device and encoding device to which the present disclosure is applied include a multimedia broadcast transmission/reception device, a mobile communication terminal, a home cinema video device, a digital cinema video device, a surveillance camera, a video communication device, a real-time communication device such as video communication, mobile streaming Devices, storage media, camcorders, video-on-demand (VoD) service providers, OTT video (Over the top video) devices, Internet streaming service providers, 3D (3D) video devices, VR (virtual reality) devices, AR (argumente) reality) devices, video telephony video devices, transportation terminal (ex.
  • a multimedia broadcast transmission/reception device a mobile communication terminal, a home cinema video device, a digital cinema video device, a surveillance camera, a video communication device, a real-time communication device such as video communication, mobile streaming Devices, storage media, camcorders, video-on-demand (VoD) service providers, OTT video (Over the top video) devices, Internet streaming service providers, 3D (3D) video devices,
  • the OTT video (Over the top video) device may include a game console, a Blu-ray player, an Internet-connected TV, a home theater system, a smartphone, a tablet PC, or a digital video recorder (DVR).
  • a game console a Blu-ray player
  • an Internet-connected TV a home theater system
  • a smartphone a tablet PC
  • DVR digital video recorder
  • the processing method to which the present disclosure is applied can be produced in the form of a computer-implemented program and stored in a computer-readable recording medium.
  • Multimedia data having a data structure according to the present disclosure can also be stored in a computer-readable recording medium.
  • the computer-readable recording medium includes all kinds of storage devices and distributed storage devices in which computer-readable data is stored.
  • the computer-readable recording medium includes, for example, Blu-ray Disc (BD), Universal Serial Bus (USB), ROM, PROM, EPROM, EEPROM, RAM, CD-ROM, magnetic tape, floppy disk and optical. It may include a data storage device.
  • the computer-readable recording medium includes media implemented in the form of a carrier wave (for example, transmission via the Internet).
  • the bitstream generated by the encoding method may be stored in a computer-readable recording medium or transmitted through a wired or wireless communication network.
  • embodiments of the present disclosure may be implemented as computer program products using program codes, and the program codes may be executed on a computer by embodiments of the present disclosure.
  • the program code can be stored on a computer readable carrier.
  • FIG. 13 shows an example of a content streaming system to which the disclosure of this document can be applied.
  • a content streaming system to which the present disclosure is applied may largely include an encoding server, a streaming server, a web server, a media storage, a user device, and a multimedia input device.
  • the encoding server serves to compress a content input from multimedia input devices such as a smart phone, a camera, and a camcorder into digital data to generate a bitstream and transmit it to the streaming server.
  • multimedia input devices such as a smart phone, a camera, and a camcorder directly generate a bitstream
  • the encoding server may be omitted.
  • the bitstream may be generated by an encoding method or a bitstream generation method to which the present disclosure is applied, and the streaming server may temporarily store the bitstream in the process of transmitting or receiving the bitstream.
  • the streaming server transmits multimedia data to a user device based on a user request through a web server, and the web server serves as an intermediary to inform the user of the service.
  • the web server delivers it to the streaming server, and the streaming server transmits multimedia data to the user.
  • the content streaming system may include a separate control server, in which case the control server serves to control commands/responses between devices in the content streaming system.
  • the streaming server may receive content from a media storage and/or encoding server. For example, when content is received from the encoding server, the content may be received in real time. In this case, in order to provide a smooth streaming service, the streaming server may store the bitstream for a predetermined time.
  • Examples of the user device include a mobile phone, a smart phone, a laptop computer, a terminal for digital broadcasting, a personal digital assistants (PDA), a portable multimedia player (PMP), navigation, a slate PC, Tablet PC, ultrabook, wearable device (e.g., smartwatch, smart glass, head mounted display (HMD)), digital TV, desktop Computers, digital signage, and the like.
  • PDA personal digital assistants
  • PMP portable multimedia player
  • slate PC slate PC
  • Tablet PC tablet
  • ultrabook ultrabook
  • wearable device e.g., smartwatch, smart glass, head mounted display (HMD)
  • digital TV desktop Computers, digital signage, and the like.
  • Each server in the content streaming system can be operated as a distributed server, and in this case, data received from each server can be distributed.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Discrete Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
PCT/KR2019/017723 2018-12-17 2019-12-13 고주파 제로잉을 기반으로 변환 계수 스캔 순서를 결정하는 방법 및 장치 Ceased WO2020130514A1 (ko)

Priority Applications (11)

Application Number Priority Date Filing Date Title
KR1020237036592A KR102768903B1 (ko) 2018-12-17 2019-12-13 고주파 제로잉을 기반으로 변환 계수 스캔 순서를 결정하는 방법 및 장치
CN202211046061.2A CN115426495B (zh) 2018-12-17 2019-12-13 图像编码/解码方法及发送数据的方法
EP19874755.2A EP3700206A4 (en) 2018-12-17 2019-12-13 METHOD AND APPARATUS FOR DECISION OF THE TRANSFORMATION COEFFICIENT SCANNING SEQUENCE BASED ON THE HIGH-FREQUENCY ZERO-POINT RESET
KR1020237001450A KR102595372B1 (ko) 2018-12-17 2019-12-13 고주파 제로잉을 기반으로 변환 계수 스캔 순서를 결정하는 방법 및 장치
KR1020227012763A KR102489599B1 (ko) 2018-12-17 2019-12-13 고주파 제로잉을 기반으로 변환 계수 스캔 순서를 결정하는 방법 및 장치
CN202211053759.7A CN115442608B (zh) 2018-12-17 2019-12-13 图像编码/解码方法及发送数据的方法
KR1020207011528A KR102388807B1 (ko) 2018-12-17 2019-12-13 고주파 제로잉을 기반으로 변환 계수 스캔 순서를 결정하는 방법 및 장치
CN201980006034.2A CN111587575B (zh) 2018-12-17 2019-12-13 基于高频归零确定变换系数扫描顺序的方法及其设备
JP2020526132A JP2021510943A (ja) 2018-12-17 2019-12-13 高周波ゼロイングに基づいて変換係数スキャン順序を決定する方法及び装置
US16/855,785 US11838512B2 (en) 2018-12-17 2020-04-22 Method of determining transform coefficient scan order based on high frequency zeroing and apparatus thereof
US18/383,327 US12294711B2 (en) 2018-12-17 2023-10-24 Method of determining transform coefficient scan order based on high frequency zeroing and apparatus thereof

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US201862780925P 2018-12-17 2018-12-17
US62/780,925 2018-12-17
US201962792826P 2019-01-15 2019-01-15
US62/792,826 2019-01-15

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/855,785 Continuation US11838512B2 (en) 2018-12-17 2020-04-22 Method of determining transform coefficient scan order based on high frequency zeroing and apparatus thereof

Publications (1)

Publication Number Publication Date
WO2020130514A1 true WO2020130514A1 (ko) 2020-06-25

Family

ID=71102256

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2019/017723 Ceased WO2020130514A1 (ko) 2018-12-17 2019-12-13 고주파 제로잉을 기반으로 변환 계수 스캔 순서를 결정하는 방법 및 장치

Country Status (6)

Country Link
US (2) US11838512B2 (https=)
EP (1) EP3700206A4 (https=)
JP (1) JP2021510943A (https=)
KR (4) KR102489599B1 (https=)
CN (3) CN115442608B (https=)
WO (1) WO2020130514A1 (https=)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023191261A1 (ko) * 2022-03-30 2023-10-05 엘지전자 주식회사 영상 코딩 시스템에서 레지듀얼 정보를 코딩하는 방법 및 장치
CN114742950B (zh) * 2022-04-19 2024-02-02 上海海事大学 船舶外形3d数字重构方法、装置、存储介质及电子设备
CN119545022B (zh) * 2022-04-28 2026-03-17 Oppo广东移动通信有限公司 视频编码中的子块编码推断

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20110046016A (ko) * 2009-10-28 2011-05-04 삼성전자주식회사 레지듀얼 블록의 부호화 방법 및 장치, 복호화 방법 및 장치
US20120140822A1 (en) * 2010-12-03 2012-06-07 Qualcomm Incorporated Video coding using function-based scan order for transform coefficients
US9167253B2 (en) * 2011-06-28 2015-10-20 Qualcomm Incorporated Derivation of the position in scan order of the last significant transform coefficient in video coding
KR101743665B1 (ko) * 2016-02-02 2017-06-05 세종대학교산학협력단 인트라 예측 기반의 비디오 신호 처리 방법 및 장치
KR20180048739A (ko) * 2015-09-30 2018-05-10 엘지전자 주식회사 비디오 코딩 시스템에서 레지듀얼 신호 코딩 방법 및 장치

Family Cites Families (52)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6226327B1 (en) * 1992-06-29 2001-05-01 Sony Corporation Video coding method and apparatus which select between frame-based and field-based predictive modes
JP3732867B2 (ja) * 1995-03-09 2006-01-11 株式会社ルネサステクノロジ 画像伸張装置
FR2830157A1 (fr) * 2001-09-25 2003-03-28 Koninkl Philips Electronics Nv Procede de conversion de donnees video codees
US7760808B2 (en) * 2005-06-21 2010-07-20 Nokia Corporation Image processing of DCT-based video sequences in compressed domain
US8665943B2 (en) * 2005-12-07 2014-03-04 Sony Corporation Encoding device, encoding method, encoding program, decoding device, decoding method, and decoding program
US8275045B2 (en) * 2006-07-12 2012-09-25 Qualcomm Incorporated Video compression using adaptive variable length codes
MX2011004850A (es) * 2008-11-07 2011-05-30 Mitsubishi Electric Corp Codificador de imagenes y decodificador de imagenes.
US8902988B2 (en) * 2010-10-01 2014-12-02 Qualcomm Incorporated Zero-out of high frequency coefficients and entropy coding retained coefficients using a joint context model
KR101483179B1 (ko) * 2010-10-06 2015-01-19 에스케이 텔레콤주식회사 주파수 마스크 테이블을 이용한 주파수변환 블록 부호화 방법 및 장치와 그를 이용한 영상 부호화/복호화 방법 및 장치
CN102231830B (zh) * 2010-11-23 2013-04-17 浙江大学 用于上下文算术编解码的运算单元
US8976861B2 (en) * 2010-12-03 2015-03-10 Qualcomm Incorporated Separately coding the position of a last significant coefficient of a video block in video coding
KR101763113B1 (ko) * 2010-12-06 2017-08-01 에스케이 텔레콤주식회사 노이즈성분을 위한 공간영역에서의 영상 부호화/복호화 방법 및 장치
US9706214B2 (en) * 2010-12-24 2017-07-11 Microsoft Technology Licensing, Llc Image and video decoding implementations
US9106913B2 (en) * 2011-03-08 2015-08-11 Qualcomm Incorporated Coding of transform coefficients for video coding
HUE050522T2 (hu) * 2011-06-28 2020-12-28 Samsung Electronics Co Ltd Video kódolási és dekódolási eljárás felhasználva aritmetikai kódolást az utolsó szignifikáns együttható kétdimenziós jelzésével
KR101955374B1 (ko) * 2011-06-30 2019-05-31 에스케이 텔레콤주식회사 고속 코딩 단위(Ｃｏｄｉｎｇ Ｕｎｉｔ) 모드 결정을 통한 부호화/복호화 방법 및 장치
KR101943049B1 (ko) * 2011-06-30 2019-01-29 에스케이텔레콤 주식회사 영상 부호화/복호화 방법 및 장치
KR101762294B1 (ko) * 2011-10-18 2017-07-28 주식회사 케이티 영상 부호화 방법, 영상 복호화 방법, 영상 부호화기 및 영상 복호화기
AU2011236109B2 (en) * 2011-10-18 2015-02-19 Canon Kabushiki Kaisha Method, apparatus and system for encoding and decoding the significance map for residual coefficients of a transform unit
JPWO2013065702A1 (ja) * 2011-11-04 2015-04-02 シャープ株式会社 算術復号装置、画像復号装置、算術符号化装置、画像符号化装置、および、算術復号方法
US9357185B2 (en) * 2011-11-08 2016-05-31 Qualcomm Incorporated Context optimization for last significant coefficient position coding
CN108471535A (zh) * 2011-11-08 2018-08-31 三星电子株式会社 用于对视频进行解码的方法
CN104956674B (zh) * 2012-01-20 2019-02-15 谷歌技术控股有限责任公司 用于最末重要系数位置编解码中的上下文减少的设备和方法
WO2013116849A1 (en) * 2012-02-04 2013-08-08 General Instrument Corporation Devices and methods for context reduction in last significant coefficient position coding
EP2866443A4 (en) * 2012-06-22 2016-06-15 Sharp Kk ARITHMETIC DECODING DEVICE, ARITHMETIC CODING DEVICE, IMAGE DECODING DEVICE AND IMAGE DEVICES
US10257520B2 (en) * 2012-06-26 2019-04-09 Velos Media, Llc Modified coding for transform skipping
CN108632611A (zh) * 2012-06-29 2018-10-09 韩国电子通信研究院 视频解码方法、视频编码方法和计算机可读介质
WO2014007524A1 (ko) * 2012-07-02 2014-01-09 삼성전자 주식회사 비디오의 엔트로피 부호화 방법 및 장치, 비디오의 엔트로피 복호화 방법 및 장치
CN104272735B (zh) * 2013-01-16 2018-04-13 黑莓有限公司 针对视频的上下文自适应二进制熵编码的变换系数编码
JP6197496B2 (ja) * 2013-08-30 2017-09-20 富士通株式会社 量子化装置、量子化方法および量子化プログラム
US9215464B2 (en) * 2013-09-19 2015-12-15 Blackberry Limited Coding position data for the last non-zero transform coefficient in a coefficient group
US9432696B2 (en) * 2014-03-17 2016-08-30 Qualcomm Incorporated Systems and methods for low complexity forward transforms using zeroed-out coefficients
KR102333000B1 (ko) * 2015-01-15 2021-12-01 한국전자통신연구원 고속 변환 계수 부호화 방법 및 장치
US10306229B2 (en) * 2015-01-26 2019-05-28 Qualcomm Incorporated Enhanced multiple transforms for prediction residual
US10284849B2 (en) * 2015-04-13 2019-05-07 Qualcomm Incorporated Quantization parameter (QP) calculation for display stream compression (DSC) based on complexity measure
KR102230264B1 (ko) * 2015-08-28 2021-03-22 삼성전자주식회사 비디오 부호화 방법 및 장치, 비디오 복호화 방법 및 장치
US10616604B2 (en) * 2015-09-01 2020-04-07 Qualcomm Incorporated Coefficient level coding in video coding
CN106162184B (zh) * 2016-07-28 2020-01-10 华为技术有限公司 一种数据块编码方法及装置
CN106331715B (zh) * 2016-08-24 2019-04-12 上海富瀚微电子股份有限公司 基于视频压缩编码标准h.265的熵编码系统及其编码方法
US10880564B2 (en) * 2016-10-01 2020-12-29 Qualcomm Incorporated Transform selection for video coding
KR20260027320A (ko) * 2016-10-04 2026-02-27 주식회사 비원영상기술연구소 영상 데이터 부호화/복호화 방법 및 장치
EP3306924A1 (en) * 2016-10-05 2018-04-11 Thomson Licensing Method and device for context-adaptive binary arithmetic coding a sequence of binary symbols representing a syntax element related to picture data
KR20180096194A (ko) * 2017-02-20 2018-08-29 한국전자통신연구원 변환 계수 부호화 및 복호화 장치와 이를 구비하는 부호화 장치 및 복호화 장치
JP2018182444A (ja) * 2017-04-07 2018-11-15 株式会社Ｊｖｃケンウッド 画像符号化装置、画像符号化方法及び画像符号化プログラム、画像復号装置、画像復号方法及び画像復号プログラム
MX2019012293A (es) * 2017-04-13 2020-01-20 Lg Electronics Inc Metodo y dispositivo para codificacion y decodificacion de entropia de señal de video.
CN108810552B (zh) * 2017-04-28 2021-11-09 华为技术有限公司 图像预测方法和相关产品
CN107580224B (zh) * 2017-08-08 2019-11-22 西安理工大学 一种面向hevc熵编码的自适应扫描方法
WO2019132577A1 (ko) * 2017-12-28 2019-07-04 한국전자통신연구원 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
CN108235013B (zh) * 2018-01-22 2020-03-17 合肥工业大学 一种基于hevc的低周期cabac解码器及其解码方法
US11051036B2 (en) * 2018-07-14 2021-06-29 Mediatek Inc. Method and apparatus of constrained overlapped block motion compensation in video coding
US11039139B2 (en) * 2018-09-14 2021-06-15 Tencent America LLC Method and apparatus for identity transform in multiple transform selection
EP3709658B1 (en) * 2018-11-12 2025-03-26 LG Electronics Inc. Method for coding transform coefficient on basis of high frequency zeroing and apparatus therefor

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20110046016A (ko) * 2009-10-28 2011-05-04 삼성전자주식회사 레지듀얼 블록의 부호화 방법 및 장치, 복호화 방법 및 장치
US20120140822A1 (en) * 2010-12-03 2012-06-07 Qualcomm Incorporated Video coding using function-based scan order for transform coefficients
US9167253B2 (en) * 2011-06-28 2015-10-20 Qualcomm Incorporated Derivation of the position in scan order of the last significant transform coefficient in video coding
KR20180048739A (ko) * 2015-09-30 2018-05-10 엘지전자 주식회사 비디오 코딩 시스템에서 레지듀얼 신호 코딩 방법 및 장치
KR101743665B1 (ko) * 2016-02-02 2017-06-05 세종대학교산학협력단 인트라 예측 기반의 비디오 신호 처리 방법 및 장치

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
B. BROSS ET AL.: "Versatile Video Coding (Draft 3", JOINT VIDEO EXPLORATION TEAM (JVET) OF ITU-T SG 16 WP 3 AND ISO/IEC JTC1/SC 29/WG 11 JVET-L1001, 12TH MEETING, 3 October 2018 (2018-10-03)
F. BOSSEN ET AL.: "JVET common test conditions and software reference configurations for SDR video", JOINT VIDEO EXPLORATION TEAM (JVET) OF ITU-T SG 16 WP 3 AND ISO/IEC JTC1/SC 29/WG 11 JVET-L1010, 12TH MEETING, 3 October 2018 (2018-10-03)
H. SCHWARZ: "Crosscheck of JVET-M0251 (Non-CE7: Last position coding for large block-size transforms", JOINT VIDEO EXPLORATION TEAM (JVET) OF ITU-T SG 16 WP 3 AND ISO/IEC JTC1/SC 29/WG 11 JVET-M0646, 13TH MEETING, 9 January 2019 (2019-01-09)
J. CHOI ET AL.: "Non-CE7: Simplified CSBF coding for large block-size transforms", JOINT VIDEO EXPLORATION TEAM (JVET) OF ITU-T SG 16 WP 3 AND ISO/IEC JTC1/SC 29/WG 11 JVET-M0250, 13TH MEETING, 9 January 2019 (2019-01-09)

Also Published As

Publication number Publication date
KR102388807B1 (ko) 2022-04-20
CN111587575B (zh) 2022-09-16
CN115442608A (zh) 2022-12-06
CN115426495B (zh) 2024-05-28
EP3700206A4 (en) 2020-11-18
KR20230154085A (ko) 2023-11-07
US20200252615A1 (en) 2020-08-06
EP3700206A1 (en) 2020-08-26
US20240056579A1 (en) 2024-02-15
KR102489599B1 (ko) 2023-01-18
KR20230013164A (ko) 2023-01-26
JP2021510943A (ja) 2021-04-30
US12294711B2 (en) 2025-05-06
CN111587575A (zh) 2020-08-25
CN115426495A (zh) 2022-12-02
CN115442608B (zh) 2024-05-24
KR102595372B1 (ko) 2023-10-27
KR20220053051A (ko) 2022-04-28
US11838512B2 (en) 2023-12-05
KR20200078501A (ko) 2020-07-01
KR102768903B1 (ko) 2025-02-18

Similar Documents

Publication Publication Date Title
WO2020246849A1 (ko) 변환에 기반한 영상 코딩 방법 및 그 장치
WO2020101321A1 (ko) 고주파 제로잉을 기반으로 변환 계수를 코딩하는 방법 및 그 장치
WO2021040400A1 (ko) 팔레트 모드 기반 영상 또는 비디오 코딩
WO2020256344A1 (ko) 영상 코딩에서 변환 커널 세트를 나타내는 정보의 시그널링
WO2020060282A1 (ko) 변환 계수 레벨 코딩 방법 및 그 장치
WO2021040402A1 (ko) 팔레트 코딩 기반 영상 또는 비디오 코딩
WO2020071879A1 (ko) 변환 계수 코딩 방법 및 그 장치
WO2020256346A1 (ko) 변환 커널 세트에 관한 정보에 대한 코딩
WO2021145728A1 (ko) 인루프 필터링 기반 영상 코딩 장치 및 방법
WO2021096057A1 (ko) 비디오 또는 영상 코딩 시스템에서의 엔트리 포인트 관련 정보에 기반한 영상 코딩 방법
WO2021040398A1 (ko) 팔레트 이스케이프 코딩 기반 영상 또는 비디오 코딩
WO2021118295A1 (ko) 루프 필터링을 제어하기 위한 영상 코딩 장치 및 방법
WO2021118293A1 (ko) 필터링 기반 영상 코딩 장치 및 방법
WO2020141856A1 (ko) 영상 코딩 시스템에서 레지듀얼 정보를 사용하는 영상 디코딩 방법 및 그 장치
WO2020071832A1 (ko) 변환 계수 코딩 방법 및 그 장치
WO2020130514A1 (ko) 고주파 제로잉을 기반으로 변환 계수 스캔 순서를 결정하는 방법 및 장치
WO2021145725A1 (ko) 필터링 관련 정보 시그널링 기반 영상 코딩 장치 및 방법
WO2020256345A1 (ko) 영상 코딩 시스템에서 변환 커널 세트에 관한 정보에 대한 컨텍스트 코딩
WO2020180043A1 (ko) Lmcs에 기반한 영상 코딩 방법 및 그 장치
WO2020076028A1 (ko) 변환 계수 코딩 방법 및 장치
WO2020209478A1 (ko) 픽처를 복수의 타일들로 분할하는 방법 및 장치
WO2020060259A1 (ko) 영상 코딩 시스템에서 블록 파티셔닝을 사용하는 영상 디코딩 방법 및 그 장치
WO2021145726A1 (ko) 적응적 루프 필터링 기반 영상 코딩 장치 및 방법
WO2021137589A1 (ko) 영상 디코딩 방법 및 그 장치
WO2021118297A1 (ko) 필터링을 위한 정보의 시그널링 기반 영상 코딩 장치 및 방법

Legal Events

Date Code Title Description
ENP Entry into the national phase

Ref document number: 20207011528

Country of ref document: KR

Kind code of ref document: A

ENP Entry into the national phase

Ref document number: 2020526132

Country of ref document: JP

Kind code of ref document: A

ENP Entry into the national phase

Ref document number: 2019874755

Country of ref document: EP

Effective date: 20200428

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19874755

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE