IP Library › Granted Patent US 11,991,366
Granted Patent B2
US 11,991,366 · App. 18/063,242 · Granted May 21, 2024

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,991,366
App. No.
18/063,242
Granted
May 21, 2024
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, W errors in the reconstructed image can be corrected.

Claims (37)

1. A method of decoding an image, 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; and

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

wherein one of the tiles is divided into tile segments by at least one division boundary line in only one of a vertical direction or a horizontal direction independently of others of the tiles,

wherein each of the tile segments is composed of an integer number of maximum coding unit rows,

wherein each of the maximum coding unit rows includes a plurality of maximum coding units,

wherein the each of the tile segments has a rectangular shape,

wherein the quad-tree partition is performed based on a first partition flag indicating whether to perform the quad-tree partition,

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

wherein the pre-defined threshold size is 128×128, 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 binary-tree partition is performed based on a second partition flag indicating whether to perform the binary-tree partition and a partition direction flag indicating either horizontal partition or vertical partition.

3. A method of encoding an image, wherein the method is performed in an image encoding apparatus, the method comprising:

dividing a picture including a current block into tiles; and

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

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

wherein one of the tiles is divided into tile segments by at least one division boundary line in only one of a vertical direction or a horizontal direction independently of others of the tiles,

wherein each of the tile segments is composed of an integer number of maximum coding unit rows,

wherein each of the maximum coding unit rows includes a plurality of maximum coding units,

wherein the each of the tile segments has a rectangular shape,

wherein a first partition flag indicating whether to perform the quad-tree partition is encoded into the bitstream,

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

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

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

4. A non-transitory computer-readable medium storing a bitstream generated by an encoding method, the method comprising:

dividing a picture including a current block into tiles; and

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

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

wherein one of the tiles is divided into tile segments by at least one division boundary line in only one of a vertical direction or a horizontal direction independently of others of the tiles,

wherein each of the tile segments is composed of an integer number of maximum coding unit rows,

wherein each of the maximum coding unit rows includes a plurality of maximum coding units,

wherein the each of the tile segments has a rectangular shape,

wherein a first partition flag indicating whether to perform the quad-tree partition is encoded into the bitstream,

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

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

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

Priority Claims (1)
KR 10-2017-0036370 · Mar 22, 2017 · national
Continuity (3)
Continuation 17338771 · Jun 4, 2021
Continuation 16496253
Related Publication 20230106301A1 · Apr 6, 2023