IP Library › Granted Patent US 11,057,627
Granted Patent B2
US 11,057,627 · App. 16/496,253 · Granted Jul 6, 2021

In-loop filtering method according to adaptive pixel classification standard

Inventors: Ki Baek Kim (Seoul, KR); Je Chang Jeong (Seoul, KR)
Assignee: Industry-University Cooperation Foundation Hanyang University
H04N19/14H04N19/117H04N19/182H04N19/82
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,057,627
App. No.
16/496,253
Granted
Jul 6, 2021
Kind
B2
Abstract

The in-loop filtering method performed by a video decoding apparatus includes: classifying reconstructed samples according to an absolute classification standard or relative classification standard; acquiring offset data on the basis of results of classifying the reconstructed samples; adding an offset value to the reconstructed samples by referencing the acquired offset data; and outputting the offset value-added reconstructed samples. Accordingly, errors in the reconstructed image can be corrected.

Claims (42)

1. A method of performing in-loop filtering according to a sample classification standard, wherein the method is performed in an image decoding apparatus, the method comprising:

dividing, based on division information signaled through a bitstream, a picture including a current block into tiles, one of the tiles being divided into tile segments by at least one division boundary line in only one of a vertical direction or a horizontal direction independently of other tiles, and each of the tile segments being composed of an integer number of consecutive complete coding tree unit rows and having a rectangular shape;

reconstructing the current block, the current block resulting from partitioning a coding block based on at least one of a quad-tree partition or a binary-tree partition;

classifying a reconstructed sample in the current block based on the sample classification standard, the sample classification standard being an absolute classification standard or a relative classification standard;

obtaining offset information based on a result of classifying the reconstructed sample;

adding an offset value to the reconstructed sample based on the obtained offset information; and

outputting the reconstructed sample to which the offset value is added,

wherein, when a size of the coding block is greater than or equal to a pre-defined threshold size, only the quad-tree partition is performed for the partitioning of the coding block,

wherein the pre-defined threshold size is 128×128,

wherein the binary-tree partition is performed based on a binary-tree partition flag indicating whether to perform the binary-tree partition and a binary-tree partition direction flag indicating horizontal partition or vertical partition, and

wherein the binary-tree partition is performed only when the quad-tree partition is no longer performed.

2. The method of claim 1 ,

wherein the classifying of the reconstructed sample includes:

when the sample classification standard is the absolute classification standard, classifying the reconstructed sample according to a band to which a brightness value of the reconstructed sample belongs.

3. The method of claim 1 ,

wherein the classifying of the reconstructed sample includes:

when the sample classification standard is the relative classification standard, classifying the reconstructed sample on the basis of at least one of gradient information or edge information derived by comparing a pixel value of the reconstructed sample with pixel values of neighboring samples adjacent to the reconstructed sample.

4. A method of performing in-loop filtering according to a sample classification standard, wherein the method is performed in an image encoding apparatus, the method comprising:

dividing a picture including a current block into tiles, one of the tiles being divided into tile segments by at least one division boundary line in only one of a vertical direction or a horizontal direction independently of other tiles, and each of the tile segments being composed of an integer number of consecutive complete coding tree unit rows and having a rectangular shape;

reconstructing the current block, the current block resulting from partitioning a coding block based on at least one of a quad-tree partition or a binary-tree partition;

classifying a reconstructed sample in the current block based on the sample classification standard, the sample classification standard being an absolute classification standard or a relative classification standard;

obtaining offset information based on a result of classifying the reconstructed sample;

adding an offset value to the reconstructed sample based on the obtained offset information; and

outputting the reconstructed sample to which the offset value is added,

wherein division information on the dividing of the picture is encoded in a bitstream,

wherein, when a size of the coding block is greater than or equal to a pre-defined threshold size, only the quad-tree partition is performed for the partitioning of the coding block,

wherein the pre-defined threshold size is 128×128,

wherein the binary-tree partition is performed only when the quad-tree partition is no longer performed, and

wherein, when the binary-tree partition is performed, a binary-tree partition flag indicating whether to perform the binary-tree partition and a binary-tree partition direction flag indicating horizontal partition or vertical partition are encoded in the bitstream.

5. A non-transitory computer readable medium having stored thereon instructions that when executed by a processor perform a decoding method, including:

dividing, based on division information signaled through a bitstream, a picture including a current block into tiles, one of the tiles being divided into tile segments by at least one division boundary line in only one of a vertical direction or a horizontal direction independently of other tiles, and each of the tile segments being composed of an integer number of consecutive complete coding tree unit rows and having a rectangular shape;

reconstructing the current block, the current block resulting from partitioning a coding block based on at least one of a quad-tree partition or a binary-tree partition;

classifying a reconstructed sample in the current block based on a sample classification standard, the sample classification standard being an absolute classification standard or a relative classification standard,

obtaining offset information based on a result of classifying the reconstructed sample;

adding an offset value to the reconstructed sample based on the obtained offset information; and

outputting the reconstructed sample to which the offset value is added,

wherein, when a size of the coding block is greater than or equal to a pre-defined threshold size, only the quad-tree partition is performed for the partitioning the coding block,

wherein the pre-defined threshold size is 128×128,

wherein the binary-tree partition is performed based on a binary-tree partition flag indicating whether to perform the binary-tree partition and a binary-tree partition direction flag indicating horizontal partition or vertical partition, and

wherein the binary-tree partition is performed only when the quad-tree partition is no longer performed.

6. The method of claim 1 ,

wherein a first division boundary line for a first tile of the tiles and a second division boundary line for a second tile adjacent to the first tile are discontinuous at a boundary between the first tile and the second tile.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 23, 2019
From: KIM, KI BAEK; JEONG, JE CHANG
To: INDUSTRY-UNIVERSITY COOPERATION FOUNDATION HANYANG UNIVERSITY
Reel/Frame 050464/0131 →
Priority Claims (1)
KR 10-2017-0036370 · Mar 22, 2017 · national
Continuity (1)
Related Publication 20200029080A1 · Jan 23, 2020
Cited By (2)
US 12,256,074 US 12,464,125