US 12,273,567 B2
System and method for reducing blocking artifacts and providing improved coding efficiency
David M. Baylon, San Diego, CA (US); and Ajay Luthra, San Diego, CA (US)
Assigned to ARRIS Enterprises LLC, Suwanee, GA (US)
Filed by ARRIS Enterprises LLC, Suwanee, GA (US)
Filed on Nov. 2, 2023, as Appl. No. 18/386,548.
Application 18/386,548 is a continuation of application No. 17/472,333, filed on Sep. 10, 2021, abandoned.
Application 17/472,333 is a continuation of application No. 16/902,012, filed on Jun. 15, 2020, granted, now 11,146,827, issued on Oct. 12, 2021.
Application 16/902,012 is a continuation of application No. 16/150,250, filed on Oct. 2, 2018, granted, now 10,701,402, issued on Jun. 30, 2020.
Claims priority of provisional application 62/566,860, filed on Oct. 2, 2017.
Prior Publication US 2024/0236379 A1, Jul. 11, 2024
This patent is subject to a terminal disclaimer.
Int. Cl. H04N 19/86 (2014.01); H04N 19/117 (2014.01); H04N 19/119 (2014.01); H04N 19/14 (2014.01); H04N 19/176 (2014.01); H04N 19/182 (2014.01); H04N 19/82 (2014.01); H04N 19/96 (2014.01)
CPC H04N 19/86 (2014.11) [H04N 19/117 (2014.11); H04N 19/119 (2014.11); H04N 19/14 (2014.11); H04N 19/176 (2014.11); H04N 19/182 (2014.11); H04N 19/82 (2014.11); H04N 19/96 (2014.11)] 6 Claims
OG exemplary drawing
 
1. A method for decoding video data comprising:
(a) receiving a bitstream indicating how a coding tree unit was partitioned into coding units according to a partitioning structure that allows nodes to be partitioned with quadtree partitioning, wherein a node is recursively partitionable using said quadtree partitioning into child nodes, where said partitioning structure allows a child node as a result of said quadtree partitioning to be recursively partitionable using symmetric binary partitioning into child nodes that are rectangular coding units;
(b) parsing said bitstream to determine how the coding tree unit was partitioned using quadtree partitioning and said symmetric binary partitioning;
(c) wherein said symmetric binary partitioning splits a parent node of a parent coding unit into two child nodes of equal size that are rectangular in shape, and quadtree partitioning splits a parent node of a parent coding unit in both a horizontal partition and a vertical partition resulting in four equally sized partitions that are square in shape;
(d) identifying each of the child nodes of said partitioning structure;
(e) defining at least one coding boundary of the identified child nodes, and decoding pixels on either side of said at least one boundary based upon,
(i) acquiring first pixel information regarding pixels on a first side of a coding boundary consistent with said partitioning structure;
(ii) acquiring second pixel information regarding pixels on a second side of said coding boundary;
(iii) determining a strength of said boundary based at least in part on said first pixel information and said second pixel information;
(iv) determining a desired deblocking filter based, at least in part, on said boundary strength;
(v) using the determined deblocking filter to determine new first pixel information and new second pixel information based at least in part on said boundary strength;
wherein said step of using the determined deblocking filter to determine said new first pixel information and said new second pixel information is based upon a selection between a no deblocking filter, a weak filter and a strong filter, wherein said weak filter is different than said strong filter, wherein said selection between said no deblocking filter, said weak filter and said strong filter is based upon a boundary strength value, where said boundary strength value of 0 indicates no deblocking filter is used, where said boundary strength value of 1 or 2 indicates one of said weak filter or said strong filter, where said boundary strength value of the other of 1 or 2 indicates the other of said one of said weak filter or said strong filter, where said filter selection is further based upon a factor tc that is a function of a quantization parameter.