WO2018038492A1 - 영상 부호화/복호화 방법 및 이를 위한 장치 - Google Patents
영상 부호화/복호화 방법 및 이를 위한 장치 Download PDFInfo
- Publication number
- WO2018038492A1 WO2018038492A1 PCT/KR2017/009106 KR2017009106W WO2018038492A1 WO 2018038492 A1 WO2018038492 A1 WO 2018038492A1 KR 2017009106 W KR2017009106 W KR 2017009106W WO 2018038492 A1 WO2018038492 A1 WO 2018038492A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- filtering
- block
- edge
- type
- deblocking
- Prior art date
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/117—Filters, e.g. for pre-processing or post-processing
-
- 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/119—Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
-
- 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/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
- H04N19/136—Incoming video signal characteristics or properties
- H04N19/14—Coding unit complexity, e.g. amount of activity or edge presence estimation
-
- 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/182—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 pixel
-
- 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/186—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 colour or a chrominance component
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/85—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression
- H04N19/86—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression involving reduction of coding artifacts, e.g. of blockiness
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
- H04N19/96—Tree coding, e.g. quad-tree coding
Definitions
- the present invention relates to a still image or moving image processing method, and more particularly, to a method for performing de-blocking filtering and an apparatus supporting the same.
- Compression coding refers to a series of signal processing techniques for transmitting digitized information through a communication line or for storing in a form suitable for a storage medium.
- Media such as an image, an image, an audio, and the like may be a target of compression encoding.
- a technique of performing compression encoding on an image is called video image compression.
- Next-generation video content will be characterized by high spatial resolution, high frame rate and high dimensionality of scene representation. Processing such content would result in a tremendous increase in terms of memory storage, memory access rate, and processing power.
- An object of the present invention is to propose a method and an apparatus for supporting the post-filter (or in-loop filter) effectively in a quad-tree and quad-tree binary-tree (QTBT) structure.
- a method of filtering an image by the decoding apparatus includes: deriving a boundary of a block divided into quad-tree and binary-tree structures; Determining an edge to which de-blocking filtering is applied among boundaries, determining a type of deblocking filtering to be applied to the edge, and deblocking a reconstructed picture sample according to the deblocking filtering type. And performing the filtering, and considering the width or height of the block, a type of the edge or the deblocking filtering may be determined.
- a decoding apparatus for filtering an image comprising: a block boundary derivation unit deriving a boundary of a block divided into quad-tree and binary-tree structures, According to the edge determination unit for determining the edge (edge) to which de-blocking filtering is applied among the boundary of the block, the filtering type determination unit for determining the type of deblocking filtering to be applied to the edge and the deblocking filtering type And a filtering unit configured to perform deblocking filtering on the reconstructed picture sample, and the type of the edge or the deblocking filtering may be determined in consideration of the width or height of the block.
- the edge when the type of the edge is a vertical edge, if the width of the block is 4 or less, the edge may be determined based on pixels that have already been subjected to deblocking filtering.
- the edge when the type of the edge is a horizontal edge, if the height of the block is 4 or less, the edge may be determined based on pixels that have already been subjected to deblocking filtering.
- the type of the edge is a vertical edge
- the width of the block is 4 or less
- the type of the deblocking filtering may be determined based on a pixel to which the deblocking filtering is already applied.
- the type of the edge is a horizontal edge
- the type of the deblocking filtering may be determined based on a pixel to which the deblocking filtering is already applied.
- the edge (edge) can be determined only among the boundaries of the block of which the width of the block (8) or more.
- the edge when the type of the edge is a horizontal edge, the edge can be determined only among the boundaries of blocks having a height of 8 or more.
- the type of deblocking filtering may be determined by weak filtering.
- the type of deblocking filtering may be determined by weak filtering.
- the type of the edge is a vertical edge
- the width of the block is 4 or less
- the type of deblocking filtering is determined as strong filtering, and the strong filtering is to the left of the edge. And only two pixel columns adjacent to the right side.
- the type of the edge is a horizontal edge
- the type of deblocking filtering is determined as strong filtering, and the strong filtering is at the upper side of the edge. And only two pixel columns adjacent to the bottom, respectively.
- the edge may be determined based on the pixel before deblocking filtering is applied.
- the type of deblocking filtering may be determined based on the pixels before the deblocking filtering is applied.
- the type of the edge and the deblocking filtering may be determined regardless of whether the block is a chroma block. Can be.
- the subjective picture quality and the objective picture quality of the still or moving picture may be improved by efficiently applying the deblocking filter in the QTBT structure.
- FIG. 1 is a schematic block diagram of an encoder in which encoding of a video signal is performed as an embodiment to which the present invention is applied.
- FIG. 2 is a schematic block diagram of a decoder in which decoding of a video signal is performed as an embodiment to which the present invention is applied.
- FIG. 3 is a diagram for describing a division structure of a coding unit according to an embodiment to which the present invention is applied.
- FIG. 4 is a diagram for describing a quad-tree binary-tree among division structures of a coding unit according to an embodiment to which the present invention is applied.
- FIG. 5 is a schematic internal block diagram of an in-loop filtering unit as an embodiment to which the present invention is applied.
- FIG. 6 is a diagram illustrating a method of performing filtering of a deblocking filter of HEVC.
- FIG. 7 is a diagram illustrating a filtering performing boundary of a deblocking filter of HEVC.
- FIG. 8 is a diagram for describing a method of determining whether to perform filtering of HEVC.
- FIG. 9 is a diagram illustrating a pixel region to which deblocking filtering of HEVC is applied.
- FIG. 10 is a diagram illustrating a QTBT splitting structure in an embodiment to which the present invention is applied.
- 11 to 21 are diagrams for explaining a problem when the HEVC deblocking filtering method is applied to a QTBT splitting structure.
- 22 is a diagram illustrating a method for determining the type of deblocking filter according to an embodiment of the present invention.
- FIG. 23 is a diagram illustrating a deblocking filtering method according to an embodiment of the present invention.
- FIG. 24 is a diagram illustrating a deblocking filtering method according to an embodiment of the present invention.
- 25 is a diagram illustrating a deblocking filtering method according to an embodiment of the present invention.
- 26 is a diagram illustrating a deblocking filtering method according to an embodiment of the present invention.
- FIG. 27 is a diagram illustrating a strong filtering method according to an embodiment of the present invention.
- FIG. 28 is a diagram illustrating a strong filtering method according to an embodiment of the present invention.
- FIG. 29 is a diagram illustrating a result of filtering in a block having a length of 4 or less in vertical edge filtering.
- FIG. 30 is a diagram illustrating whether to perform filtering and a filter selection method according to an embodiment of the present invention.
- FIG. 31 is a diagram illustrating a deblocking filtering method according to an embodiment of the present invention.
- 32 is a diagram illustrating a problem caused when HEVC deblocking filtering is equally applied to a QTBT block division structure.
- FIG 33 is a diagram illustrating a deblocking filtering method according to an embodiment of the present invention.
- FIG. 34 is a diagram illustrating a deblocking filtering unit according to an embodiment of the present invention.
- 35 is a diagram illustrating a deblocking filtering unit according to an embodiment of the present invention.
- the term 'block' or 'unit' refers to a unit in which a process of encoding / decoding such as prediction, transformation, and / or quantization is performed, and may be configured as a multidimensional array of samples (or pixels, pixels).
- 'Block' or 'unit' may mean a multi-dimensional array of samples for luma components, or may mean a multi-dimensional array of samples for chroma components.
- the multi-dimensional arrangement of the sample for the luma component and the multi-dimensional arrangement of the sample for the chroma component may also be included.
- 'block' or 'unit' refers to a coding block (CB) that represents an array of samples to be encoded / decoded, and a coding tree block composed of a plurality of coding blocks (CTB).
- CB coding block
- CB coding block
- CB coding tree block composed of a plurality of coding blocks
- PB Prediction Block
- PU Prediction Unit
- TB Transform Block
- a 'block' or 'unit' is a syntax structure used in encoding / decoding an array of samples for a luma component and / or a chroma component. can be interpreted to include a sturcture.
- the syntax structure refers to zero or more syntax elements existing in the bitstream in a specific order, and the syntax element refers to an element of data represented in the bitstream.
- a 'block' or 'unit' includes a coding unit (CU) including a coding block (CB) and a syntax structure used for encoding the coding block (CB), and a plurality of coding units.
- TUs transform units
- the 'block' or 'unit' is not necessarily limited to an array of square or rectangular samples (or pixels or pixels), and polygonal samples having three or more vertices (or pixels or pixels). It can also mean an array of. In this case, it may also be referred to as a polygon block or a polygon unit.
- FIG. 1 is a schematic block diagram of an encoder in which encoding of a video signal is performed as an embodiment to which the present invention is applied.
- the encoder 100 may include an image splitter 110, a transformer 120, a quantizer 130, an inverse quantizer 140, an inverse transformer 150, a filter 160, and a decoder. It may include a decoded picture buffer (DPB) 170, an inter predictor 180, an intra predictor 185, and an entropy encoder 190.
- DPB decoded picture buffer
- the image divider 110 may divide the input image (or a picture or a frame) input to the encoder 100 into one or more processing units.
- the processing unit may be a Coding Tree Unit (CTU), a Coding Unit (CU), a Prediction Unit (PU), or a Transform Unit (TU).
- CTU Coding Tree Unit
- CU Coding Unit
- PU Prediction Unit
- TU Transform Unit
- the encoder 100 may generate a residual signal by subtracting the prediction signal output from the inter prediction unit 180 or the intra prediction unit 185 from the input image signal, and the generated residual signal is converted into a conversion unit ( 120).
- the transformer 120 may generate a transform coefficient by applying a transform technique to the residual signal.
- the transformation technique may include at least one of a discrete cosine transform (DCT), a discrete sine transform (DST), a karhunen-loeve transform (KLT), a graph-based transform (GBT), or a conditionally non-linear transform (CNT).
- DCT discrete cosine transform
- DST discrete sine transform
- KLT karhunen-loeve transform
- GBT graph-based transform
- CNT conditionally non-linear transform
- GBT means a conversion obtained from this graph when the relationship information between pixels is represented by a graph.
- CNT refers to a transform that is generated based on and generates a prediction signal using all previously reconstructed pixels.
- the conversion process may be applied to pixel blocks having the same size as the square, or may be applied to blocks of variable size rather than square.
- the quantization unit 130 may quantize the transform coefficients and transmit them to the entropy encoding unit 190, and the entropy encoding unit 190 may entropy code the quantized signal and output the bitstream.
- the quantized signal output from the quantization unit 130 may be used to generate a prediction signal.
- the quantized signal may reconstruct the residual signal by applying inverse quantization and inverse transformation through inverse quantization unit 140 and inverse transformation unit 150 in a loop.
- the reconstructed signal may be generated by adding the reconstructed residual signal to the prediction signal output from the inter predictor 180 or the intra predictor 185.
- the filtering unit 160 applies filtering to the reconstruction signal and outputs it to the reproduction apparatus or transmits the decoded picture buffer to the decoding picture buffer 170.
- the filtered signal transmitted to the decoded picture buffer 170 may be used as the reference picture in the inter predictor 180. As such, by using the filtered picture as a reference picture in the inter prediction mode, not only image quality but also encoding efficiency may be improved.
- the decoded picture buffer 170 may store the filtered picture for use as a reference picture in the inter prediction unit 180.
- the inter prediction unit 180 performs temporal prediction and / or spatial prediction to remove temporal redundancy and / or spatial redundancy with reference to the reconstructed picture.
- the motion information may be predicted based on the correlation of the motion information between the neighboring block and the current block.
- the intra predictor 185 may predict the current block by referring to samples around the block to which current encoding is to be performed.
- the intra prediction unit 185 may perform the following process to perform intra prediction. First, reference samples necessary for generating a prediction signal may be prepared. The prediction signal may be generated using the prepared reference sample. Then, the prediction mode is encoded. In this case, the reference sample may be prepared through reference sample padding and / or reference sample filtering. Since the reference sample has been predicted and reconstructed, there may be a quantization error. Accordingly, the reference sample filtering process may be performed for each prediction mode used for intra prediction to reduce such an error.
- the prediction signal generated by the inter predictor 180 or the intra predictor 185 may be used to generate a reconstruction signal or to generate a residual signal.
- FIG. 2 is a schematic block diagram of a decoder in which decoding of a video signal is performed as an embodiment to which the present invention is applied.
- the decoder 200 may include an entropy decoding unit 210, an inverse quantization unit 220, an inverse transform unit 230, a filtering unit 240, and a decoded picture buffer unit (DPB) 250. ), An inter predictor 260, and an intra predictor 265.
- the reconstructed video signal output through the decoder 200 may be reproduced through the reproducing apparatus.
- the decoder 200 may receive a signal output from the encoder 100 of FIG. 1, and the received signal may be entropy decoded through the entropy decoding unit 210.
- the inverse quantization unit 220 obtains a transform coefficient from the entropy decoded signal using the quantization step size information.
- the inverse transformer 230 inversely transforms a transform coefficient to obtain a residual signal.
- the reconstruction signal is generated by adding the obtained residual signal to the prediction signal output from the inter prediction unit 260 or the intra prediction unit 265.
- the filtering unit 240 applies filtering to the reconstruction signal and outputs it to the reproduction apparatus or transmits the decoded picture buffer unit 250 to the reproduction device.
- the filtered signal transmitted to the decoded picture buffer unit 250 may be used as the reference picture in the inter predictor 260.
- the embodiments described by the filtering unit 160, the inter prediction unit 180, and the intra prediction unit 185 of the encoder 100 are respectively the filtering unit 240, the inter prediction unit 260, and the decoder. The same may be applied to the intra predictor 265.
- FIG. 3 is a diagram for describing a division structure of a coding unit according to an embodiment to which the present invention is applied.
- the encoder may split one image (or picture) in units of a rectangular Coding Tree Unit (CTU).
- CTU Coding Tree Unit
- one CTU is sequentially encoded according to a raster scan order.
- One CTU may be decomposed into a quadtree (QT) structure.
- QT quadtree
- one CTU may be divided into four units having a square shape and each side is reduced by half in length.
- the decomposition of this QT structure can be done recursively.
- a root node of a QT may be associated with a CTU.
- the QT may be split until it reaches a leaf node, where the leaf node may be referred to as a coding unit (CU).
- CU coding unit
- the CTU corresponds to a root node and has the smallest depth (ie, level 0) value.
- the CTU may not be divided according to the characteristics of the input image. In this case, the CTU corresponds to a CU.
- the CTU may be decomposed in QT form, and as a result, lower nodes having a depth of level 1 may be generated. And, a node that is no longer partitioned (ie, a leaf node) in a lower node having a depth of level 1 corresponds to a CU.
- CU (a), CU (b) and CU (j) corresponding to nodes a, b and j are divided once in the CTU and have a depth of level 1.
- information indicating whether the corresponding CU is split may be delivered to the decoder.
- the information may be defined as a split flag and may be represented by a syntax element "split_cu_flag".
- the division flag may be included in all CUs except the SCU. For example, if the split flag value is '1', the corresponding CU is divided into four CUs again. If the split flag value is '0', the CU is not divided any more and the coding process for the CU is not divided. Can be performed.
- the division process of the CU has been described as an example, but the QT structure described above may also be applied to the division process of a transform unit (TU) which is a basic unit for performing transformation.
- TU transform unit
- the TU may be hierarchically divided into a QT structure from a CU to be coded.
- a CU may correspond to a root node of a tree for a transform unit (TU).
- the TU divided from the CU may be divided into smaller lower TUs.
- the size of the TU may be determined by any one of 32x32, 16x16, 8x8, and 4x4.
- the present invention is not limited thereto, and in the case of a high resolution image, the size of the TU may be larger or more diverse.
- information indicating whether the corresponding TU is divided may be delivered to the decoder.
- the information may be defined as a split transform flag and may be represented by a syntax element "split_transform_flag".
- a CU is a basic unit of coding in which intra prediction or inter prediction is performed.
- a CU may be divided into prediction units (PUs).
- the PU is a basic unit for generating a prediction block, and may generate different prediction blocks in PU units within one CU.
- the PU may be divided differently according to whether an intra prediction mode or an inter prediction mode is used as a coding mode of a CU to which the PU belongs.
- FIG. 4 is a diagram for describing a quad-tree binary-tree among division structures of a coding unit according to an embodiment to which the present invention is applied.
- the encoder may split one image (or picture) in units of a rectangular Coding Tree Unit (CTU).
- CTU Coding Tree Unit
- one CTU is sequentially encoded according to a raster scan order.
- One CTU may be decomposed into a quadtree (QT) structure and a binarytree (BT).
- QT quadtree
- BT binarytree
- one CTU may be divided into four units having a square shape and each side is reduced by half in length, or divided into two units having a rectangular shape and having a width or height length reduced by half.
- the decomposition of this QT BT structure can be performed recursively.
- a root node of a QT may be associated with a CTU.
- the QT may be split until it reaches a QT leaf node, and the leaf node of the QT may be split into BT and split until it reaches the BT leaf node.
- the CTU corresponds to a root node and has a smallest depth (ie, level 0) value.
- the CTU may not be divided according to the characteristics of the input image. In this case, the CTU corresponds to a CU.
- CTU can be decomposed into QT form and QT leaf node can be divided into BT form.
- lower nodes having a depth of level n may be generated.
- a node (ie, leaf node) that is no longer divided in a lower node having a depth of level n corresponds to a CU.
- information indicating whether the corresponding CU is split may be delivered to the decoder.
- the information may be defined as a split flag and may be represented by a syntax element "split_cu_flag”.
- information indicating whether to be split into BT in the QT leaf node may be transmitted to the decoder.
- the information may be defined as a BT split flag and may be represented by a syntax element “bt_split_flag”.
- the BT splitting shape may be transmitted to the decoder to be split into a rectangle having a half size width or a rectangle having a half size height.
- the information may be defined in a BT split mode and may be represented by a syntax element “bt_split_mode”.
- FIG. 5 is a schematic internal block diagram of an in-loop filtering unit as an embodiment to which the present invention is applied.
- the in-loop filtering unit may include at least one of a deblocking filtering unit 510, an adaptive offset filtering unit 520, and an adaptive loop filtering unit 530.
- the in-loop filtering unit may apply filtering to the reconstructed picture and output the filtered picture to the reproduction device, or store the result in a buffer to use as a reference picture in the inter prediction mode.
- the deblocking filtering unit 510 performs a function of improving distortion occurring at the boundary of the reconstructed picture. For example, blocking degradation occurring at the boundary of the prediction unit or the transform unit may be improved.
- the deblocking filtering unit 510 may check whether a reconstructed pixel value is discontinuous at a block boundary, and may perform deblocking filtering at a corresponding edge boundary when blocking degradation occurs. For example, it may be determined whether a block boundary is an 8x8 block boundary and a boundary of a prediction unit or a transform unit, and a boundary strength (BS) value may be calculated based on the block boundary. It may be determined whether to perform filtering based on the boundary strength (BS) value, and the filtering parameter may be used together.
- BS boundary strength
- the adaptive offset filtering unit 520 may perform a function of minimizing an error between the reconstructed image and the original image by adding an offset to the reconstructed pixel.
- the reconstructed image may mean a deblocking filtered image.
- an offset parameter for correcting an error between the reconstructed image and the original image may be calculated and transmitted to the decoder.
- the transmitted offset parameter may be entropy decoded and then filtered based on the pixel.
- the adaptive loop filtering unit 530 may perform filtering by calculating an optimal coefficient that minimizes an error between the original image and the reconstructed image.
- the encoder it is possible to derive filter coefficients that minimize the error between the original image and the reconstructed image, and adaptively transmit information and filter coefficients about whether adaptive loop filtering is applied to each decoder to the decoder.
- filtering may be performed based on information on whether the transmitted adaptive loop filtering is applied and filter coefficients.
- FIG. 6 is a diagram illustrating a method of performing filtering of a deblocking filter of HEVC.
- the deblocking filter determines a boundary for applying the deblocking filtering.
- the boundary determination is to determine only the position (that is, the boundary) that needs deblocking filtering, and whether to perform the actual filtering is determined in the filter on / off step in step S604.
- the types of boundaries for the deblocking filter can be classified into three types: a coding unit (CU) boundary, a PU (prediction unit) boundary, and a TU (transform unit) boundary. Since one CU boundary may correspond to a PU or TU boundary, it may correspond to a boundary object to which filtering is to be performed.
- CU coding unit
- PU prediction unit
- TU transform unit
- the deblocking filter calculates a BS (S602). That is, the deblocking filter determines the boundary strength BS to perform the deblocking filter of different strength according to the characteristics of the block adjacent to the boundary.
- the deblocking filter determines ⁇ , t_c, which are parameters used as thresholds such as whether filtering is performed and filtering selection (S603).
- the deblocking filter performs a filter on / off decision (S604). That is, the deblocking filter determines whether to perform filtering in units of filtering units.
- the deblocking filter determines whether to apply a strong filter or a weak filter at the boundary at which the filtering is to be performed (S605).
- the deblocking filter filters the pixels with a predetermined filter (S606 and S607).
- the HEVC deblocking filter performs filtering at the boundary of a prediction block (PB) and the boundary of a transform block (TB).
- PB prediction block
- TB transform block
- filtering may be performed at the boundary of the coding block (CB).
- the deblocking filter of HEVC and QTBT does not perform unconditional filtering at all interfaces, but only strong filtering and weak filtering only when certain conditions are satisfied (as determined in step S604 in FIG. 6 above). ) Is performed selectively. On the other hand, if the condition is not satisfied, the filtering is not performed even if the interface corresponds to this.
- FIG. 7 is a diagram illustrating a filtering performing boundary of a deblocking filter of HEVC.
- FIG. 7A illustrates a vertical edge as the filtering performance boundary of the deblocking filter
- FIG. 7B illustrates a horizontal edge as the filtering performance boundary of the deblocking filter.
- the deblocking filter of HEVC is performed at the boundary of the prediction block and the boundary of the transform block.
- filtering is not performed at every prediction block boundary or transform block boundary, but only at a block boundary of 8x8 or more. It can be seen that the parallelism of the deblocking filter is considered.
- the strong filter and the weak filter are selectively performed.
- the value of the pixel adjacent to the block boundary is checked to determine whether to perform filtering. This will be described in more detail with reference to FIG. 8 below.
- FIG. 8 is a diagram for describing a method of determining whether to perform filtering of HEVC.
- Solid lines in FIG. 8 represent block boundaries, and each circle represents one pixel (e.g., a luma component sample or a chroma component sample).
- 3 pixels (shaded pixels in FIG. 8) adjacent to the block boundary surface are defined by p (x, y) (or q (x, y)) with the X and Y axis components relative to the block boundary. It may be expressed in the same form as shown in FIG. 8.
- the values of the parameters (parameters) dp0, dp3, dq0, dq3, dpq0, dpq3, and d may be calculated according to Equation 1 below indicating the filtering execution condition.
- the deblocking filtering is performed only when the d value is smaller than ⁇ compared to the variable (parameter) ⁇ value determined by Equation 1 based on the quantization parameter Q.
- the ITU-T H.265 document is incorporated herein by reference.
- pixels on the block boundary correspond to a condition in which filtering is performed by a specific condition, it is determined whether to apply a strong filter or a weak filter according to Equation 2 below. do.
- Equation 2 if all the conditions of Equation 2 are satisfied, the strong filter is applied, otherwise the weak filter is applied.
- Equation 2 the variable (parameter) tc (that is, t_c) is determined based on the quantization parameter Q.
- the pixel region to which filtering is applied depends on the type of filter determined by the condition of Equation 2 (ie, a strong filter or a weak filter).
- FIG. 9 is a diagram illustrating a pixel region to which deblocking filtering of HEVC is applied.
- each pixel region to which a strong filter or a weak filter is applied is different based on a block boundary.
- whether to apply the deblocking filtering is determined by using three pixels on the left and right or top and bottom on the block boundary.
- the deblocking filter type is determined by using four pixels on the left, right, and top of the block boundary once again on the boundary surface to which the deblocking filtering is applied.
- HEVC can generate 4x4 prediction blocks or transform blocks, 8x4 and 4x8 size prediction blocks, deblocking filtering is applied only at block boundaries of 8x8 or more for parallelization.
- QTBT differs in the block structure of luma and chroma in the intra slice (I-slice: Intra slice), that is, the slice that is decoded using only intra prediction.
- I-slice Intra slice
- the coding tree of various shapes and sizes may be generated by the tree.
- FIG. 10 is a diagram illustrating a QTBT splitting structure in an embodiment to which the present invention is applied.
- an image may be divided into structures of various sizes and shapes by QTBT.
- the present invention proposes a method for performing the deblocking filter in parallel in various block partitioning structures (that is, partitioning structures having various block sizes and shapes).
- the deblocking filter of QTBT applies the same deblocking filter of HEVC, but the deblocking filter may be performed at block boundaries such as 4x4, 4x8, 8x4, 4x16 as well as 8x8 or more block boundaries. have.
- the filtering at the corresponding block boundary may cause a problem that the parallelization condition is not satisfied due to the pixel value change by the filtering at the adjacent block boundary.
- 11 to 21 are diagrams for explaining a problem when the HEVC deblocking filtering method is applied to a QTBT splitting structure.
- the black pixels of FIG. 14 are applied twice by the low-pass filter of the deblocking filter. .
- the pixel indicated by the dotted line is referred to to determine whether to perform filtering in the block boundary 2.
- the weak filtering is performed in the block boundary 2 because the strong filtering condition is not satisfied in the block boundary 2, the overlapping filtering will not occur as shown in FIG. 19, but the strong filtering condition is satisfied and the strong filtering condition is strong in the block boundary 2. If filtering is performed, a darkly shaded pixel as shown in FIG. 20 may overlap and be filtered.
- a vertical edge is mainly illustrated as an example, but this is for convenience of description and the present invention is not limited thereto. That is, in the case of a horizontal edge, the process may be performed in the same manner, except that the pixels are positioned above and below the block boundary.
- One embodiment of the present invention proposes a method for effectively performing a deblocking filter of a QTBT structure.
- the present invention provides a block in which the vertical size of the block is 4 or less at the boundary of a block having a horizontal size / length of 4 or less (ie, a block having 4 or less horizontal samples) in the vertical-edge.
- a method for performing deblocking filtering at a boundary ie, a block having a number of vertical samples of 4 or less.
- a block having a length of 4 or less for a vertical edge and a block having a length of 4 or less for a horizontal edge are proposed. do.
- problems that may occur when performing deblocking filtering in the QTBT structure may be classified into a parallelization problem and filtering of reference pixels when filtering and adaptive filter selection are performed.
- an embodiment of the present invention proposes a filtering method at a block boundary when a specific condition is satisfied.
- the specific condition may mean a case in which the block width is 4 or less in the process of filtering the vertical edge and / or the block length is 4 or less in the process of filtering the horizontal edge.
- pixels that have been filtered out and noise disappears may be used.
- 21 is a diagram illustrating a method for determining whether to perform deblocking filtering according to an embodiment of the present invention.
- d represents the sum of the amount of change of pixel values of the block boundary.
- the pixels of the P block (that is, the shaded pixels among the pixels indicated by the dotted lines in FIG. 22) have already been filtered and smoothed, so that a smaller value is obtained compared to the difference value of the unfiltered pixels.
- the probability is high.
- Equation 3 the final value of d calculated according to Equation 3 may be reduced, and thus, the rate at which the filtering should be performed probabilistically may be increased when checking whether the filtering is performed.
- the type of filter may be determined by referring to the pixels filtered by the filtering.
- 22 is a diagram illustrating a method for determining the type of deblocking filter according to an embodiment of the present invention.
- an equation referred to for adaptively selecting a strong filter and a weak filter also takes into account changes in pixel values of a block boundary.
- This may apply a strong filter to the already filtered pixels, which may cause the edges to aggregate at the block boundary.
- a deblocking filter in the QTBT structure, filtering of blocks having a length of 4 or less for vertical edge filtering or blocks having a length of 4 or less for horizontal edge filtering is performed. Suggest ways not to do it.
- the deblocking filter has a lot of issues in filtering the boundary of a block of a specific size.
- an embodiment of the present invention proposes a method as shown in FIG. 23.
- FIG. 23 is a diagram illustrating a deblocking filtering method according to an embodiment of the present invention.
- the decoder determines whether it corresponds to a boundary of a coding unit (or coding block) (S2301).
- step S2301 If it does not correspond to the boundary of the coding unit (or coding block) in step S2301, the decoder ends the deblocking filtering.
- step S2301 it is determined whether the boundary corresponds to the vertical edge (S2302).
- step S2302 it is determined whether a width of the corresponding coding unit (or coding block) is 8 or more (S2303).
- step S2302 it is determined whether the height of the corresponding coding unit (or coding block) is 8 or more (S2304).
- step S2303 If the width of the coding unit (or coding block) is 8 or more in step S2303 or if the height of the coding unit (or coding block) is 8 or more in step S2304, the decoder is conventional. Deblocking filtering is performed (S2305).
- the decoder may perform conventional deblocking filtering as shown in the example of FIG. 6.
- the decoder Terminate deblocking filtering.
- filtering may be performed only on a coding unit (or coding block) having a vertical length of 8 or more, and no filtering may be performed on a coding unit (or coding block) that is not 8 or more.
- the present embodiment determines whether to apply filtering by considering only the block size, it is possible to parallelize the deblocking filtering.
- a deblocking filter of a QTBT structure weak for a block having a length of 4 or less for vertical edge filtering or a block having a length of 4 or less for horizontal edge filtering.
- FIG. 24 is a diagram illustrating a deblocking filtering method according to an embodiment of the present invention.
- the decoder determines whether it corresponds to a boundary of a coding unit (or coding block) (S2401).
- step S2401 If it does not correspond to the boundary of the coding unit (or coding block) in step S2401, the decoder ends the deblocking filtering.
- step S2401 if it corresponds to the boundary of the coding unit (or coding block) in step S2401, it is determined whether the boundary corresponds to the vertical edge (S2402).
- step S2402 it is determined whether a width of the corresponding coding unit (or coding block) is 8 or more (S2403).
- step S2402 it is determined whether the height of the corresponding coding unit (or coding block) is 8 or more (S2404).
- step S2403 If the width of the coding unit (or coding block) is 8 or more in step S2403 or if the height of the coding unit (or coding block) is 8 or more in step S2404, the decoder is conventional. Deblocking filtering is performed (S2405).
- the decoder may perform conventional deblocking filtering as shown in the example of FIG. 6.
- the decoder may apply a weak filter to the corresponding vertical edge (S2406).
- the decoder may apply a weak filter to the corresponding horizontal edge (S2407).
- an ITU-T H.265 document may be incorporated by reference herein.
- conventional deblocking filtering may be applied to a coding unit (or a coding block) having a vertical length of 8 or more
- a weak filter may be applied to a coding unit (or a coding block) that is not to be 8 or more.
- the deblocking filter of the QTBT structure has left and right sides of a boundary of a block having a length of 4 or less for a vertical edge, and a top and bottom of a block boundary having a length of 4 or less for a horizontal edge.
- 25 is a diagram illustrating a deblocking filtering method according to an embodiment of the present invention.
- the decoder determines whether it corresponds to a boundary of a coding unit (or coding block) (S2501).
- step S2501 If it does not correspond to the boundary of the coding unit (or coding block) in step S2501, the decoder ends the deblocking filtering.
- step S2501 if it corresponds to the boundary of the coding unit (or coding block) in step S2501, the deblocking filter application condition is checked (S2502), and the decoder determines whether to apply the deblocking filter on the boundary based on the deblocking filter application condition. Determine (S2503).
- Equation 1 may be used as a condition for applying the deblocking filter.
- step S2503 If it is determined in step S2503 not to apply the deblocking filter at the boundary of the coding unit (or coding block) (ie, the deblocking filter application condition is not satisfied), the decoder terminates the deblocking filtering.
- step S2503 determines whether the corresponding boundary corresponds to the vertical edge (S2504).
- step S2504 it is determined whether the width of the corresponding coding unit (or coding block) is 8 or more (S2505).
- step S2504 it is determined whether the height of the corresponding coding unit (or coding block) is 8 or more (S2506).
- the decoder performs this embodiment.
- the deblocking filtering is performed by applying the strong filter proposed in the example (S2507).
- the decoder sets the filter set selection condition.
- Check (S2508) the decoder determines whether to apply a strong filter on the edge based on the filter set selection condition (S2509).
- Equation 2 may be used as the deblocking filter set selection condition.
- step S2509 If it is determined in step S2509 to apply a strong filter (for example, if all of the conditions of Equation 2 above are satisfied), the decoder may apply an existing strong filter at the corresponding edge (S2510).
- an ITU-T H.265 document may be incorporated by reference herein.
- step S2509 if it is determined in step S2509 not to apply a strong filter (for example, if any one of the conditions of Equation 2 above) is not satisfied, the decoder may apply a weak filter at the corresponding edge (S2511).
- an ITU-T H.265 document may be incorporated by reference herein.
- a method for applying a strong filter proposed in the present invention is proposed for a block boundary to which a strong filter should be applied while maintaining an existing performance structure.
- 26 is a diagram illustrating a deblocking filtering method according to an embodiment of the present invention.
- the decoder determines whether it corresponds to a boundary of a coding unit (or coding block) (S2601).
- step S2601 If it does not correspond to the boundary of the coding unit (or coding block) in step S2601, the decoder ends the deblocking filtering.
- step S2601 if it corresponds to the boundary of the coding unit (or coding block) in step S2601, the deblocking filter application condition is checked (S2602), and the decoder determines whether to apply the deblocking filter on the boundary based on the deblocking filter application condition. Determine (S2603).
- Equation 1 may be used as a condition for applying the deblocking filter.
- step S2603 If it is determined in step S2603 not to apply the deblocking filter at the boundary of the coding unit (or coding block) (ie, the deblocking filter application condition is not satisfied), the decoder ends the deblocking filtering.
- step S2603 if it is determined in step S2603 to apply the deblocking filter at the boundary of the coding unit (or coding block) (that is, satisfying the deblocking filter application condition), the decoder checks the filter set selection condition (S2604), and the decoder Based on the set selection condition, it is determined whether a strong filter is to be applied at the corresponding boundary (S2605).
- Equation 2 may be used as the deblocking filter set selection condition.
- step S2605 If it is determined in step S2605 not to apply a strong filter (for example, if any one of the conditions of Equation 2 above is not satisfied), the decoder may apply a weak filter at the boundary (S2606).
- an ITU-T H.265 document may be incorporated by reference herein.
- step S2605 determines whether the corresponding boundary corresponds to the vertical edge (S2607).
- step S2607 If the corresponding boundary corresponds to the vertical edge in step S2607, it is determined whether a width of the corresponding coding unit (or coding block) is 8 or more (S2608).
- step S2607 it is determined whether the height of the corresponding coding unit (or coding block) is 8 or more (S2609).
- the decoder performs the present embodiment. Deblocking filtering is performed by applying the strong filter proposed in the example (S2610).
- the decoder is the existing at the edge A strong filter of can be applied (S2611).
- an ITU-T H.265 document may be incorporated by reference herein.
- the filter of the HEVC can be applied to the left and right of each pixel only (in the case of vertical prediction) based on the boundary (or edge). Conversely, in the case of the horizontal edge, filtering may be applied to only two pixels on the left and right of the boundary.
- FIG. 27 is a diagram illustrating a strong filtering method according to an embodiment of the present invention.
- FIG. 27A illustrates a pre-filtering pixel according to an embodiment of the present invention
- FIG. 27B illustrates a post-filtering pixel (shaded pixel) according to an embodiment of the present invention.
- Equation 5 shows a strong filtering result for P (0,0), P (1,0), Q (0,0), Q (1,0), that is, P '(0,0) for convenience of explanation.
- P '(1,0), Q' (0,0), and Q '(1,0) are illustrated, but in the same way, P (0,1), P (1,1), P (0) , P (1,2), P (0,3), P (1,3), Q (0,1), Q (1,1), Q (0,2), Q (1, 2), strong filtering is also applied to Q (0,3) and Q (1,3) so that P '(0,1), P' (1,1), P '(0,2), P' (1 , P '(0,3), P' (1,3), Q '(0,1), Q' (1,1), Q '(0,2), Q' (1,2) ), Q '(0,3), Q' (1,3) can be derived.
- the strong filtering method proposed in the present invention proposes a method using a new filter set as shown in FIG.
- FIG. 28 is a diagram illustrating a strong filtering method according to an embodiment of the present invention.
- FIG. 28A illustrates a pre-filtering pixel according to an embodiment of the present invention
- FIG. 28B illustrates a post-filtering pixel (shaded pixel) according to an embodiment of the present invention.
- Equation 6 strong filtering results for P (0,0), P (1,0), Q (0,0), and Q (1,0), that is, P '(0,0) , Only P '(1,0), Q' (0,0), and Q '(1,0) are illustrated, but in the same way, P (0,1), P (1,1), P (0) , P (1,2), P (0,3), P (1,3), Q (0,1), Q (1,1), Q (0,2), Q (1, 2), strong filtering is also applied to Q (0,3) and Q (1,3) so that P '(0,1), P' (1,1), P '(0,2), P' (1 , P '(0,3), P' (1,3), Q '(0,1), Q' (1,1), Q '(0,2), Q' (1,2) ), Q '(0,3), Q' (1,3) can be derived.
- Equations 5 and 6 p0, p1, and p2 correspond to P (0,0), P (1,0), and P (2,0), respectively, and q1, q2, and q3 are each Q (0). , 0), Q (1,0), and Q (2,0).
- Equation 7 Clip 3 may be calculated as in Equation 7.
- x means Arithmetic right shift for calculating a two's complement integer representation of x by y binary digits. This function is defined only for non-negative integer values of y.
- MSB most significant bit
- Equations 5 and 6 the variable (parameter) tc (ie, t_c) is determined based on the quantization parameter Q.
- this embodiment also has the effect of minimizing the subjective image quality deterioration that may occur because the deblocking filter is not applied to the existing small block, and also unlike the embodiment 1-3, the filter is adaptively applied. By doing so, image quality deterioration can be minimized.
- the problem occurs because the condition is checked by referring to the pixel value filtered at the previous block boundary when checking and selecting filtering in the QTBT block division structure.
- a block having a length of 4 or less for vertical edge filtering and a block having a length of 4 or less for horizontal edge filtering in a deblocking filter of a QTBT structure proposes a method for determining whether to perform filtering with reference to an unfiltered pixel and a method for determining an adaptive filter.
- the filtering process of the horizontal edge has only the difference of considering the vertical pixel and the vertical length of the block boundary, and the process is the same.
- FIG. 29 is a diagram illustrating a result of filtering in a block having a length of 4 or less in vertical edge filtering.
- FIG. 29 (a) illustrates pixels before filtering in a block having a horizontal length of 4 or less at vertical edge filtering
- FIG. 29 (b) illustrates pixels (shaded pixels) filtered by filtering. .
- An embodiment of the present invention proposes a method of using unfiltered pixels as shown in FIG. 30 to select whether to perform filtering and to select a filter.
- FIG. 30 is a diagram illustrating whether to perform filtering and a filter selection method according to an embodiment of the present invention.
- the decoder checks whether the block performing the filtering of (b) and the adaptive filter selection condition of (c) use the unfiltered pixel as shown in FIG. 30 (a).
- the decoder may determine whether to perform filtering as shown in Equation 8 below by using pixels before filtering is performed in a block having a horizontal length of 4 or less in vertical edge filtering.
- the decoder may determine the filtering type as shown in Equation 9 below by using pixels before filtering at another adjacent block boundary is performed in a block having a horizontal length of 4 or less.
- the block size for example, a block having a length of 4 or less or a block having a length of 4 or less
- determining a pixel to be referred to when determining whether to perform filtering and the type of the filter as shown in FIG.
- FIG. 31 is a diagram illustrating a deblocking filtering method according to an embodiment of the present invention.
- the decoder determines whether it corresponds to a boundary of a coding unit (or coding block) (S3101).
- step S3101 If it does not correspond to the boundary of the coding unit (or coding block) in step S3101, the decoder ends the deblocking filtering.
- step S3101 if it corresponds to the boundary of the coding unit (or coding block) in step S3101, the deblocking filter application condition is checked (S3102), and the decoder determines whether to apply the deblocking filter at the boundary based on the deblocking filter application condition. Determine (S3103).
- the decoder may use the picture of the unfiltered pixel as an input.
- Equation 8 may be used as a condition for applying the deblocking filter.
- step S3103 If it is determined in step S3103 not to apply the deblocking filter at the boundary of the coding unit (or coding block) (ie, the deblocking filter application condition is not satisfied), the decoder ends the deblocking filtering.
- step S3103 determines whether a strong filter is to be applied at the corresponding boundary (S3105).
- the decoder can use the picture of the unfiltered pixel as input.
- Equation 9 may be used as the deblocking filter set selection condition.
- step S3105 If it is determined in step S3105 to apply a strong filter (for example, if all of the conditions of Equation 9 are satisfied above), the decoder may apply a strong filter at the corresponding boundary (S3106).
- the decoder may use a reconstructed picture as an input.
- the method proposed in Examples 1-4 may be used in connection with the application of the strong filter.
- an ITU-T H.265 document may be incorporated herein by reference.
- the decoder may apply a weak filter at the boundary (S3107).
- the decoder may use a reconstructed picture as an input.
- an ITU-T H.265 document may be incorporated by reference herein.
- the pixel to which the strong filter is applied and the pixel to which the weak filter is applied may be reflected in the reconstructed picture as an output.
- the decoder determines with reference to an unfiltered pixel to determine whether to apply a filter and to satisfy a condition for selecting a filter set, and the actual filtering may filter the decoded pixel.
- One embodiment of the present invention proposes a method for adaptively performing a deblocking filter on color components in a QTBT structure.
- a block structure of a luma region and a chroma region may be divided differently in I-Slice.
- filtering is performed by separately identifying block boundaries to which filtering is to be applied.
- the BS is calculated under the same condition as the luminance component, and then a block boundary corresponding to the condition where the BS is 2 may be filtered.
- 32 is a diagram illustrating a problem caused when HEVC deblocking filtering is equally applied to a QTBT block division structure.
- the decoder starts a loop filter picture (loopFilterPic) process, and if the luminance of the channel type is luma (S3201), the decoder performs a CU deblocking (xDeblockCU) process (S3202 and S3203).
- loopFilterPic loop filter picture
- xDeblockCU CU deblocking
- the decoder determines whether the slice type is I-Slice (S3204).
- a CU deblocking (xDeblockCU) process is performed (S3202 and S3203).
- the decoder terminates the picture loop filter (loopFilterPic) process.
- the decoder determines whether the current block (eg, a CTU or a block divided into QTBTs in the CTU) is divided into a quad-tree (QT) structure (S3206).
- the current block eg, a CTU or a block divided into QTBTs in the CTU
- QT quad-tree
- step S3206 If the current block is divided into quad-tree (QT) structures in step S3206, the width value is shifted right by 1 (width >> 1), and the height value is shifted by 1 right. (Height >> 1) (S3207). That is, the current block is divided in half in the vertical and horizontal directions.
- QT quad-tree
- the decoder performs a CU deblocking (xDeblockCU) process on each of the four divided blocks (S3208, 3209).
- the decoder determines whether the current block is divided into the binary-tree (BT) structure (S3210).
- the decoder determines whether the BT mode is horizontal division (S3211).
- the decoder right-shifts only the height value by 1 (height >> 1) (S3212). That is, the current block is divided in half in the horizontal direction.
- the decoder performs a CU deblocking (xDeblockCU) process on each of the two divided blocks (S3213 and S3214).
- the decoder right-shifts only the width value by 1 (width >> 1) (S3215). That is, the current block is divided in half in the vertical direction.
- the decoder performs a CU deblocking (xDeblockCU) process on each of the two divided blocks (S3216 and S3217).
- the decoder calculates boundary strength (BS) or boundary filtering strength (S3218).
- the decoder determines whether the current block is a luminance block (S3219).
- the decoder performs filtering (xEdgeFilterLuma) on the edge of the luma block (S3220).
- the decoder determines whether to apply the deblocking filter, and when the deblocking filter is applied, determines the type of the filter and then performs the deblocking filtering according to the determined filter type. Can be.
- the decoder Performs filtering on the edge of the chroma block (xEdgeFilterChroma) (S3222).
- the decoder determines whether to apply the deblocking filter, and when the deblocking filter is applied, determines the type of the filter and then performs the deblocking filtering according to the determined filter type. Can be.
- the edge of the Chroma block may be added to the edge of the Chroma block without calculating whether to perform filtering on the edge of the Chroma block.
- a filtering process (xEdgeFilterChroma) is performed.
- an embodiment of the present invention proposes a method of applying a deblocking filter of chroma components, as shown in FIG. 33.
- FIG 33 is a diagram illustrating a deblocking filtering method according to an embodiment of the present invention.
- the decoder starts a picture loop filter (loopFilterPic) process, and if the luminance of the channel type is luma (S3301), the decoder performs a CU deblocking (xDeblockCU) process (S3302 and S3303).
- loopFilterPic picture loop filter
- xDeblockCU CU deblocking
- the decoder determines whether the slice type is I-Slice (S3304).
- a CU deblocking (xDeblockCU) process is performed (S3302 and S3303).
- the decoder terminates the picture loop filter (loopFilterPic) process.
- the decoder determines whether the current block (for example, a CTU or a block divided into QTBT in the CTU) is divided into a quad-tree (QT) structure (S3306).
- the current block for example, a CTU or a block divided into QTBT in the CTU
- QT quad-tree
- step S3306 If the current block is divided into quad-tree (QT) structures in step S3306, the width value is shifted right by 1 (width >> 1), and the height value is shifted by 1 by right. (Height >> 1) (S3307). That is, the current block is divided in half in the vertical and horizontal directions.
- the decoder performs a CU deblocking (xDeblockCU) process on each of the four divided blocks (S3308 and 3309).
- the decoder determines whether the current block is divided into the binary-tree (BT) structure (S3310).
- the decoder determines whether the BT mode is horizontal division (S3311).
- the decoder right-shifts only the height value by 1 (height >> 1) (S3312). That is, the current block is divided in half in the horizontal direction.
- the decoder performs a CU deblocking (xDeblockCU) process on each of the two divided blocks (S3313 and S3314).
- the decoder right-shifts only the width value by 1 (width >> 1) (S3315). That is, the current block is divided in half in the vertical direction.
- the decoder performs a CU deblocking (xDeblockCU) process on each of the two divided blocks (S3316 and S3317).
- the decoder calculates boundary strength (BS) or boundary filtering strength (S3318).
- the decoder determines whether the slice to which the current block belongs is an I-Slice (S3319).
- the decoder determines whether the current block is a luminance block (S3320).
- the decoder performs filtering (xEdgeFilterLuma) on the edge of the luma block (S3221).
- the decoder additionally calculates (determines) whether to perform filtering at the block boundary and performs strong filtering and weak filtering in the same way as the existing luminance component. Optionally applicable.
- Embodiment 1 and / or Embodiment 2 may be used as a method for determining whether to perform filtering and / or a type of filtering (eg, strong filtering and weak filtering). .
- a type of filtering eg, strong filtering and weak filtering.
- an ITU-T H.265 document is incorporated herein by reference. by reference).
- the decoder is a color ( Chroma) is performed on the edge of the block (xEdgeFilterChroma) (S3223).
- filtering may be performed at a block boundary of two or more BSs as in the past.
- FIG 33 is a diagram illustrating a deblocking filtering method according to an embodiment of the present invention.
- the decoder derives a boundary of a block divided into quad-tree and binary-tree structures (S3301).
- the decoder determines an edge to which de-blocking filtering is applied among block boundaries (S3302).
- the decoder determines the edge at which the deblocking filtering is applied at the boundary of the block.
- an edge may be determined in consideration of the width or height of the block.
- the edge type when the edge type is a vertical edge, if the width of the block is 4 or less, the edge is based on a pixel to which deblocking filtering is already applied. ) Can be determined.
- the type of the edge when the type of the edge is a horizontal edge, if the height of the block is 4 or less, the edge may be determined based on pixels that have already been subjected to deblocking filtering.
- the edge when the type of the edge is a vertical edge (edge), the edge (edge) can be determined only among the boundaries of the block having a block width of 8 or more (that is, No filtering is applied on the boundaries of blocks with a width of 4 or less).
- the edge type when the edge type is a horizontal edge, the edge may be determined only among the boundaries of blocks having a height of 8 or more blocks (that is, at the boundaries of blocks having a height of 4 or less blocks). No filtering is applied).
- an edge may be determined based on a pixel before deblocking filtering is applied.
- the decoder determines the type of deblocking filtering to be applied to the edge (S3303).
- the decoder can determine whether strong or weak filtering is applied to the edge.
- the type of deblocking filtering may be determined in consideration of the width or height of the block.
- the edge type when the edge type is a vertical edge, if the block width is 4 or less, deblocking filtering based on pixels that have already been subjected to deblocking filtering.
- the type of can be determined.
- the type of the edge when the type of the edge is a horizontal edge, if the height of the block is 4 or less, the type of deblocking filtering may be determined based on a pixel to which the deblocking filtering is already applied.
- the type of the edge when the type of the edge is a vertical edge, if the block width is 4 or less, the type of deblocking filtering may be determined as weak filtering. In addition, when the type of edge is a horizontal edge, if the height of the block is 4 or less, the type of deblocking filtering may be determined as weak filtering.
- the edge type is a vertical edge, as in Embodiments 1-4, if the block width is 4 or less, the type of deblocking filtering is determined as strong filtering, and strong filtering. Can only be applied to the two pixel columns adjacent to the left and right sides of the edge, respectively.
- the type of the edge is a horizontal edge, if the height of the block is 4 or less, the type of deblocking filtering is determined as strong filtering, and the strong filtering is 2 adjacent to the upper and lower sides of the edge, respectively. May be applied to only one column of pixels.
- the type of deblocking filtering may be determined based on pixels before the deblocking filtering is applied.
- an edge is determined at step S3302 regardless of whether the block is a chroma block, and the deblocking is performed at step S3303.
- the type of filtering may be determined.
- the decoder performs deblocking filtering on the reconstructed picture sample according to the deblocking filtering type (S3304).
- 35 is a diagram illustrating a deblocking filtering unit according to an embodiment of the present invention.
- the deblocking filtering unit implements the functions, processes, and / or methods proposed in FIGS. 6 to 34.
- the deblocking filtering unit may be implemented as an encoding apparatus in combination with all or some of the components of the encoder illustrated in FIG. 1, or may be combined with all or some of the components of the decoder illustrated in FIG. 2. It can be implemented as a decoding device.
- the deblocking filtering unit may include a block boundary derivation unit 3501, an edge determination unit 3502, a filtering type determination unit 3503, and a filtering unit 3504.
- the block boundary derivation unit 3501 derives a boundary of blocks divided into quad-tree and binary-tree structures.
- the edge determiner 3502 determines an edge to which de-blocking filtering is applied among the block boundaries.
- the edge determiner 3502 determines an edge to which deblocking filtering is applied at the boundary of the block.
- an edge may be determined in consideration of the width or height of the block.
- the edge type when the edge type is a vertical edge, if the width of the block is 4 or less, the edge is based on a pixel to which deblocking filtering is already applied. ) Can be determined.
- the type of the edge when the type of the edge is a horizontal edge, if the height of the block is 4 or less, the edge may be determined based on pixels that have already been subjected to deblocking filtering.
- the edge when the type of the edge is a vertical edge (edge), the edge (edge) can be determined only among the boundaries of the block having a block width of 8 or more (that is, No filtering is applied on the boundaries of blocks with a width of 4 or less).
- the edge type when the edge type is a horizontal edge, the edge may be determined only among the boundaries of blocks having a height of 8 or more blocks (that is, at the boundaries of blocks having a height of 4 or less blocks). No filtering is applied).
- an edge may be determined based on a pixel before deblocking filtering is applied.
- the filtering type determiner 3503 determines the type of deblocking filtering to be applied to the edge.
- the filtering type determiner 3503 may determine whether strong or weak filtering is applied to the edge.
- the type of deblocking filtering may be determined in consideration of the width or height of the block.
- the edge type when the edge type is a vertical edge, if the block width is 4 or less, deblocking filtering based on pixels that have already been subjected to deblocking filtering.
- the type of can be determined.
- the type of the edge when the type of the edge is a horizontal edge, if the height of the block is 4 or less, the type of deblocking filtering may be determined based on a pixel to which the deblocking filtering is already applied.
- the type of the edge when the type of the edge is a vertical edge, if the block width is 4 or less, the type of deblocking filtering may be determined as weak filtering. In addition, when the type of edge is a horizontal edge, if the height of the block is 4 or less, the type of deblocking filtering may be determined as weak filtering.
- the edge type is a vertical edge, as in Embodiments 1-4, if the block width is 4 or less, the type of deblocking filtering is determined as strong filtering, and strong filtering. Can only be applied to the two pixel columns adjacent to the left and right sides of the edge, respectively.
- the type of the edge is a horizontal edge, if the height of the block is 4 or less, the type of deblocking filtering is determined as strong filtering, and the strong filtering is 2 adjacent to the upper and lower sides of the edge, respectively. May be applied to only one column of pixels.
- the type of deblocking filtering may be determined based on pixels before the deblocking filtering is applied.
- an edge is determined at step S3302 regardless of whether the block is a chroma block, and the deblocking is performed at step S3303.
- the type of filtering may be determined.
- the filtering unit 3504 performs deblocking filtering on the reconstructed picture samples according to the deblocking filtering type.
- each component or feature is to be considered optional unless stated otherwise.
- Each component or feature may be embodied in a form that is not combined with other components or features. It is also possible to combine some of the components and / or features to form an embodiment of the invention.
- the order of the operations described in the embodiments of the present invention may be changed. Some components or features of one embodiment may be included in another embodiment or may be replaced with corresponding components or features of another embodiment. It is obvious that the claims may be combined to form an embodiment by combining claims that do not have an explicit citation relationship in the claims or as new claims by post-application correction.
- Embodiments according to the present invention may be implemented by various means, for example, hardware, firmware, software, or a combination thereof.
- an embodiment of the present invention may include one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), FPGAs ( field programmable gate arrays), processors, controllers, microcontrollers, microprocessors, and the like.
- ASICs application specific integrated circuits
- DSPs digital signal processors
- DSPDs digital signal processing devices
- PLDs programmable logic devices
- FPGAs field programmable gate arrays
- processors controllers, microcontrollers, microprocessors, and the like.
- an embodiment of the present invention may be implemented in the form of a module, procedure, function, etc. that performs the functions or operations described above.
- the software code may be stored in memory and driven by the processor.
- the memory may be located inside or outside the processor, and may exchange data with the processor by various known means.
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
Description
Claims (15)
- 복호화 장치가 영상을 필터링하는 방법에 있어서,쿼드-트리(quad-tree) 및 바이너리-트리(binary-tree) 구조로 분할된 블록의 경계를 도출하는 단계;상기 블록의 경계 중에서 디블록킹(de-blocking) 필터링이 적용되는 에지(edge)를 결정하는 단계;상기 에지에 적용될 디블록킹 필터링의 타입을 결정하는 단계; 및상기 디블록킹 필터링 타입에 따라 복원된 픽쳐 샘플에 디블록킹 필터링을 수행하는 단계를 포함하고,상기 블록의 너비(width) 또는 높이(height)를 고려하여 상기 에지(edge) 또는 상기 디블록킹 필터링의 타입이 결정되는 영상 필터링 방법.
- 제1항에 있어서,상기 에지의 타입이 수직 에지(vertical edge)인 경우, 상기 블록의 너비(width)가 4 이하이면, 이미 디블록킹 필터링이 적용된 픽셀을 기반으로 상기 에지(edge)가 결정되는 영상 필터링 방법.
- 제1항에 있어서,상기 에지의 타입이 수평 에지(horizontal edge)인 경우, 상기 블록의 높이(height)가 4 이하이면, 이미 디블록킹 필터링이 적용된 픽셀을 기반으로 상기 에지(edge)가 결정되는 영상 필터링 방법.
- 제1항에 있어서,상기 에지의 타입이 수직 에지(vertical edge)인 경우, 상기 블록의 너비(width)가 4 이하이면, 이미 디블록킹 필터링이 적용된 픽셀을 기반으로 상기 디블록킹 필터링의 타입이 결정되는 영상 필터링 방법.
- 제1항에 있어서,상기 에지의 타입이 수평 에지(horizontal edge)인 경우, 상기 블록의 높이(height)가 4 이하이면, 이미 디블록킹 필터링이 적용된 픽셀을 기반으로 상기 디블록킹 필터링의 타입이 결정되는 영상 필터링 방법.
- 제1항에 있어서,상기 에지의 타입이 수직 에지(vertical edge)인 경우, 상기 블록의 너비(width)가 8 이상인 블록의 경계 중에서만 상기 에지(edge)가 결정되는 영상 필터링 방법.
- 제1항에 있어서,상기 에지의 타입이 수평 에지(horizontal edge)인 경우, 상기 블록의 높이(height)가 8 이상인 블록의 경계 중에서만 상기 에지(edge)가 결정되는 영상 필터링 방법.
- 제1항에 있어서,상기 에지의 타입이 수직 에지(vertical edge)인 경우, 상기 블록의 너비(width)가 4 이하이면, 상기 디블록킹 필터링의 타입은 약한 필터링으로 결정되는 영상 필터링 방법.
- 제1항에 있어서,상기 에지의 타입이 수평 에지(horizontal edge)인 경우, 상기 블록의 높이(height)가 4 이하이면, 상기 디블록킹 필터링의 타입은 약한 필터링으로 결정되는 영상 필터링 방법.
- 제1항에 있어서,상기 에지의 타입이 수직 에지(vertical edge)인 경우, 상기 블록의 너비(width)가 4 이하이면, 상기 디블록킹 필터링의 타입은 강한 필터링으로 결정되고,상기 강한 필터링은 상기 에지의 좌측 및 우측에 각각 인접한 2개의 픽셀 열에만 적용되는 영상 필터링 방법.
- 제1항에 있어서,상기 에지의 타입이 수평 에지(horizontal edge)인 경우, 상기 블록의 높이(height)가 4 이하이면, 상기 디블록킹 필터링의 타입은 강한 필터링으로 결정되고,상기 강한 필터링은 상기 에지의 상측 및 하측에 각각 인접한 2개의 픽셀 열에만 적용되는 영상 필터링 방법.
- 제1항에 있어서,디블록킹 필터링이 적용되기 전 픽셀을 기반으로 상기 에지(edge)가 결정되는 영상 필터링 방법.
- 제1항에 있어서,디블록킹 필터링이 적용되기 전 픽셀을 기반으로 상기 디블록킹 필터링의 타입이 결정되는 영상 필터링 방법.
- 제1항에 있어서,상기 블록이 속한 슬라이스가 인트라 슬라이스(I-slice: Intra slice)인 경우, 상기 블록이 색채 블록(chroma block)인지 여부와 무관하게 상기 에지(edge) 및 상기 디블록킹 필터링의 타입이 결정되는 영상 필터링 방법.
- 영상을 필터링하는 복호화 장치에 있어서,쿼드-트리(quad-tree) 및 바이너리-트리(binary-tree) 구조로 분할된 블록의 경계를 도출하는 블록 경계 도출부;상기 블록의 경계 중에서 디블록킹(de-blocking) 필터링이 적용되는 에지(edge)를 결정하는 에지 결정부;상기 에지에 적용될 디블록킹 필터링의 타입을 결정하는 필터링 타입 결정부; 및상기 디블록킹 필터링 타입에 따라 복원된 픽쳐 샘플에 디블록킹 필터링을 수행하는 필터링부를 포함하고,상기 블록의 너비(width) 또는 높이(height)를 고려하여 상기 에지(edge) 또는 상기 디블록킹 필터링의 타입이 결정되는 장치.
Priority Applications (8)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
KR1020197005634A KR102437742B1 (ko) | 2016-08-21 | 2017-08-21 | 영상 부호화/복호화 방법 및 이를 위한 장치 |
KR1020227029371A KR102508723B1 (ko) | 2016-08-21 | 2017-08-21 | 영상 부호화/복호화 방법 및 이를 위한 장치 |
US16/327,192 US11240495B2 (en) | 2016-08-21 | 2017-08-21 | Image coding/decoding method and apparatus therefor |
CN201780063381.XA CN109891895A (zh) | 2016-08-21 | 2017-08-21 | 图像编码/解码方法及其装置 |
JP2019510414A JP7173961B2 (ja) | 2016-08-21 | 2017-08-21 | 映像符号化/復号化方法及びそのための装置 |
EP17843912.1A EP3503556B1 (en) | 2016-08-21 | 2017-08-21 | Image coding/decoding method and apparatus therefor |
US17/570,086 US11956428B2 (en) | 2016-08-21 | 2022-01-06 | Image coding/decoding method and apparatus therefor |
JP2022177296A JP7472234B2 (ja) | 2016-08-21 | 2022-11-04 | 映像符号化/復号化方法及びそのための装置 |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US201662377671P | 2016-08-21 | 2016-08-21 | |
US62/377,671 | 2016-08-21 |
Related Child Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US16/327,192 A-371-Of-International US11240495B2 (en) | 2016-08-21 | 2017-08-21 | Image coding/decoding method and apparatus therefor |
US17/570,086 Continuation US11956428B2 (en) | 2016-08-21 | 2022-01-06 | Image coding/decoding method and apparatus therefor |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2018038492A1 true WO2018038492A1 (ko) | 2018-03-01 |
Family
ID=61246171
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/KR2017/009106 WO2018038492A1 (ko) | 2016-08-21 | 2017-08-21 | 영상 부호화/복호화 방법 및 이를 위한 장치 |
Country Status (6)
Country | Link |
---|---|
US (2) | US11240495B2 (ko) |
EP (1) | EP3503556B1 (ko) |
JP (2) | JP7173961B2 (ko) |
KR (2) | KR102437742B1 (ko) |
CN (1) | CN109891895A (ko) |
WO (1) | WO2018038492A1 (ko) |
Cited By (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2020011024A1 (en) * | 2018-07-12 | 2020-01-16 | Huawei Technologies Co., Ltd. | Boundary block partitioning in video coding |
WO2020043193A1 (en) | 2018-08-31 | 2020-03-05 | Mediatek Inc. | Method and apparatus of subblock deblocking in video coding |
WO2020057516A1 (en) * | 2018-09-18 | 2020-03-26 | Huawei Technologies Co., Ltd. | Partitioning with high level constraint |
WO2020183849A1 (ja) * | 2019-03-08 | 2020-09-17 | ソニー株式会社 | 情報処理装置、情報処理方法及びプログラム |
US11477494B2 (en) | 2018-09-03 | 2022-10-18 | Huawei Technologies Co., Ltd. | Relation between partition constraint elements |
RU2786746C2 (ru) * | 2018-07-12 | 2022-12-26 | Хуавей Текнолоджиз Ко., Лтд. | Разделение граничных блоков при кодировании видео |
US11539945B2 (en) | 2019-07-19 | 2022-12-27 | Lg Electronics Inc. | Image encoding/decoding method and device using filtering, and method for transmitting bitstream |
US11641466B2 (en) | 2018-09-03 | 2023-05-02 | Huawei Technologies Co., Ltd. | Video encoder, a video decoder and corresponding methods |
Families Citing this family (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10999602B2 (en) | 2016-12-23 | 2021-05-04 | Apple Inc. | Sphere projected motion estimation/compensation and mode decision |
US11259046B2 (en) | 2017-02-15 | 2022-02-22 | Apple Inc. | Processing of equirectangular object data to compensate for distortion by spherical projections |
US10924747B2 (en) | 2017-02-27 | 2021-02-16 | Apple Inc. | Video coding techniques for multi-view video |
US11093752B2 (en) | 2017-06-02 | 2021-08-17 | Apple Inc. | Object tracking in multi-view video |
US10754242B2 (en) | 2017-06-30 | 2020-08-25 | Apple Inc. | Adaptive resolution and projection format in multi-direction video |
US20190005709A1 (en) * | 2017-06-30 | 2019-01-03 | Apple Inc. | Techniques for Correction of Visual Artifacts in Multi-View Images |
MX2020006500A (es) * | 2017-12-29 | 2020-09-17 | Ericsson Telefon Ab L M | Metodos que proporcionan codificacion y/o decodificacion de video usando valores de referencia y dispositivos relacionados. |
US11483555B2 (en) * | 2018-01-11 | 2022-10-25 | Telefonaktiebolaget Lm Ericsson (Publ) | Multiple boundary filtering |
CN113711603A (zh) * | 2019-08-23 | 2021-11-26 | 华为技术有限公司 | 对使用联合色度译码的块执行色度去块效应滤波的编码器、解码器及对应方法 |
CN114270848A (zh) | 2019-08-23 | 2022-04-01 | 北京字节跳动网络技术有限公司 | 在去方块滤波中使用边界强度 |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2011129619A2 (ko) * | 2010-04-13 | 2011-10-20 | 삼성전자 주식회사 | 트리 구조 부호화 단위에 기반한 디블록킹 필터링을 수행하는 비디오 부호화 방법과 그 장치 및 복호화 방법과 그 장치 |
US20120287994A1 (en) * | 2011-05-12 | 2012-11-15 | Qualcomm Incorporated | Filtering blockiness artifacts for video coding |
KR20130129380A (ko) * | 2010-12-07 | 2013-11-28 | 소니 주식회사 | 화상 처리 장치 및 화상 처리 방법 |
KR20140071316A (ko) * | 2011-09-09 | 2014-06-11 | 파나소닉 주식회사 | 저복잡도 디블로킹 필터 결정 |
KR20140098672A (ko) * | 2011-11-25 | 2014-08-08 | 파나소닉 인텔렉츄얼 프로퍼티 코포레이션 오브 아메리카 | 화상 처리 방법 및 화상 처리 장치 |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP2486731B1 (en) * | 2009-10-05 | 2018-11-07 | InterDigital Madison Patent Holdings | Methods and apparatus for adaptive filtering of prediction pixels for chroma components in video encoding and decoding |
ES2562009T3 (es) * | 2011-03-01 | 2016-03-02 | Telefonaktiebolaget Lm Ericsson (Publ) | Control del filtrado de desbloqueo |
US8964833B2 (en) * | 2011-07-19 | 2015-02-24 | Qualcomm Incorporated | Deblocking of non-square blocks for video coding |
US10038919B2 (en) * | 2014-05-29 | 2018-07-31 | Apple Inc. | In loop chroma deblocking filter |
-
2017
- 2017-08-21 KR KR1020197005634A patent/KR102437742B1/ko active IP Right Grant
- 2017-08-21 WO PCT/KR2017/009106 patent/WO2018038492A1/ko active Application Filing
- 2017-08-21 CN CN201780063381.XA patent/CN109891895A/zh active Pending
- 2017-08-21 JP JP2019510414A patent/JP7173961B2/ja active Active
- 2017-08-21 EP EP17843912.1A patent/EP3503556B1/en active Active
- 2017-08-21 US US16/327,192 patent/US11240495B2/en active Active
- 2017-08-21 KR KR1020227029371A patent/KR102508723B1/ko active IP Right Grant
-
2022
- 2022-01-06 US US17/570,086 patent/US11956428B2/en active Active
- 2022-11-04 JP JP2022177296A patent/JP7472234B2/ja active Active
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2011129619A2 (ko) * | 2010-04-13 | 2011-10-20 | 삼성전자 주식회사 | 트리 구조 부호화 단위에 기반한 디블록킹 필터링을 수행하는 비디오 부호화 방법과 그 장치 및 복호화 방법과 그 장치 |
KR20130129380A (ko) * | 2010-12-07 | 2013-11-28 | 소니 주식회사 | 화상 처리 장치 및 화상 처리 방법 |
US20120287994A1 (en) * | 2011-05-12 | 2012-11-15 | Qualcomm Incorporated | Filtering blockiness artifacts for video coding |
KR20140071316A (ko) * | 2011-09-09 | 2014-06-11 | 파나소닉 주식회사 | 저복잡도 디블로킹 필터 결정 |
KR20140098672A (ko) * | 2011-11-25 | 2014-08-08 | 파나소닉 인텔렉츄얼 프로퍼티 코포레이션 오브 아메리카 | 화상 처리 방법 및 화상 처리 장치 |
Cited By (20)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
RU2786746C2 (ru) * | 2018-07-12 | 2022-12-26 | Хуавей Текнолоджиз Ко., Лтд. | Разделение граничных блоков при кодировании видео |
US11750810B2 (en) | 2018-07-12 | 2023-09-05 | Huawei Technologies Co., Ltd. | Boundary block partitioning in video coding |
WO2020011024A1 (en) * | 2018-07-12 | 2020-01-16 | Huawei Technologies Co., Ltd. | Boundary block partitioning in video coding |
US11425375B2 (en) | 2018-07-12 | 2022-08-23 | Huawei Technologies Co., Ltd. | Boundary block partitioning in video coding |
CN113225564A (zh) * | 2018-07-12 | 2021-08-06 | 华为技术有限公司 | 视频译码中的边界块分割 |
CN113039782A (zh) * | 2018-08-31 | 2021-06-25 | 联发科技股份有限公司 | 视频编解码中的子块去块方法及装置 |
EP3841743A4 (en) * | 2018-08-31 | 2022-10-05 | HFI Innovation Inc. | METHOD AND APPARATUS FOR UNGROUPING SUBGROUPS IN VIDEO CODING |
US11765365B2 (en) | 2018-08-31 | 2023-09-19 | Hfi Innovation Inc. | Method and apparatus of subblock deblocking in video coding |
WO2020043193A1 (en) | 2018-08-31 | 2020-03-05 | Mediatek Inc. | Method and apparatus of subblock deblocking in video coding |
US11924444B2 (en) | 2018-08-31 | 2024-03-05 | Hfi Innovation Inc. | Method and apparatus of subblock deblocking in video coding |
US11641466B2 (en) | 2018-09-03 | 2023-05-02 | Huawei Technologies Co., Ltd. | Video encoder, a video decoder and corresponding methods |
US11910027B2 (en) | 2018-09-03 | 2024-02-20 | Huawei Technologies Co., Ltd. | Relation between partition constraint elements |
US11477494B2 (en) | 2018-09-03 | 2022-10-18 | Huawei Technologies Co., Ltd. | Relation between partition constraint elements |
US11445188B2 (en) | 2018-09-18 | 2022-09-13 | Huawei Technologies Co., Ltd. | Partitioning with high level constraint |
WO2020057516A1 (en) * | 2018-09-18 | 2020-03-26 | Huawei Technologies Co., Ltd. | Partitioning with high level constraint |
US11909964B2 (en) | 2019-03-08 | 2024-02-20 | Sony Group Corporation | Information processing device, information processing method, and program |
WO2020183849A1 (ja) * | 2019-03-08 | 2020-09-17 | ソニー株式会社 | 情報処理装置、情報処理方法及びプログラム |
US11539945B2 (en) | 2019-07-19 | 2022-12-27 | Lg Electronics Inc. | Image encoding/decoding method and device using filtering, and method for transmitting bitstream |
RU2809518C2 (ru) * | 2019-07-19 | 2023-12-12 | ЭлДжи ЭЛЕКТРОНИКС ИНК. | Способ и устройство кодирования/декодирования изображений с использованием фильтрации и способ для передачи потока битов |
US11924419B2 (en) | 2019-07-19 | 2024-03-05 | Lg Electronics Inc. | Image encoding/decoding method and device using filtering, and method for transmitting bitstream |
Also Published As
Publication number | Publication date |
---|---|
KR102508723B1 (ko) | 2023-03-14 |
JP7472234B2 (ja) | 2024-04-22 |
US20190200016A1 (en) | 2019-06-27 |
JP2022190128A (ja) | 2022-12-22 |
CN109891895A (zh) | 2019-06-14 |
US11956428B2 (en) | 2024-04-09 |
KR20190034276A (ko) | 2019-04-01 |
JP7173961B2 (ja) | 2022-11-16 |
EP3503556B1 (en) | 2024-05-01 |
EP3503556A4 (en) | 2020-04-15 |
US20220182619A1 (en) | 2022-06-09 |
KR20220122804A (ko) | 2022-09-02 |
EP3503556A1 (en) | 2019-06-26 |
JP2019525671A (ja) | 2019-09-05 |
US11240495B2 (en) | 2022-02-01 |
KR102437742B1 (ko) | 2022-08-29 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2018038492A1 (ko) | 영상 부호화/복호화 방법 및 이를 위한 장치 | |
WO2020145805A1 (ko) | 다중 변환 커널을 사용하는 비디오 신호 처리 방법 및 장치 | |
WO2018030599A1 (ko) | 인트라 예측 모드 기반 영상 처리 방법 및 이를 위한 장치 | |
WO2018044142A1 (ko) | 영상 부호화/복호화 방법 및 이를 위한 장치 | |
WO2017018664A1 (ko) | 인트라 예측 모드 기반 영상 처리 방법 및 이를 위한 장치 | |
WO2019235797A1 (ko) | 축소된 변환을 이용하여 비디오 신호를 처리하는 방법 및 장치 | |
WO2018199675A1 (ko) | 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체 | |
WO2018097693A2 (ko) | 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체 | |
WO2019172705A1 (ko) | 샘플 필터링을 이용한 영상 부호화/복호화 방법 및 장치 | |
WO2018026166A1 (ko) | 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체 | |
WO2020076143A1 (ko) | 다중 가정 예측을 사용하는 비디오 신호 처리 방법 및 장치 | |
WO2018012886A1 (ko) | 영상 부호화/복호화 방법 및 이를 위한 기록 매체 | |
WO2017204427A1 (ko) | 영상 처리 방법, 그를 이용한 영상 복호화 및 부호화 방법 | |
WO2018070809A1 (ko) | 영상 처리 방법, 그를 이용한 영상 복호화 및 부호화 방법 | |
WO2017086747A1 (ko) | 기하 변환 픽처를 이용한 영상의 부호화/복호화 방법 및 장치 | |
WO2016204478A1 (ko) | 인트라 예측 모드 기반 영상 처리 방법 및 이를 위한 장치 | |
WO2017026681A1 (ko) | 비디오 코딩 시스템에서 인터 예측 방법 및 장치 | |
WO2018097607A1 (ko) | 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체 | |
WO2018124843A1 (ko) | 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체 | |
WO2018097692A2 (ko) | 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체 | |
WO2018131982A1 (ko) | 영상 신호 부호화/복호화 방법 및 장치 | |
WO2015122549A1 (ko) | 동영상 처리 방법 및 장치 | |
WO2018047995A1 (ko) | 인트라 예측 모드 기반 영상 처리 방법 및 이를 위한 장치 | |
WO2016159631A1 (ko) | 비디오 신호의 인코딩/디코딩 방법 및 장치 | |
WO2020071616A1 (ko) | Cclm에 기반한 인트라 예측 방법 및 그 장치 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 17843912 Country of ref document: EP Kind code of ref document: A1 |
|
ENP | Entry into the national phase |
Ref document number: 2019510414 Country of ref document: JP Kind code of ref document: A |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
ENP | Entry into the national phase |
Ref document number: 20197005634 Country of ref document: KR Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2017843912 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref document number: 2017843912 Country of ref document: EP Effective date: 20190321 |