IP Library › Granted Patent US 11,006,110
Granted Patent B2
US 11,006,110 · App. 16/809,216 · Granted May 11, 2021

Encoder, decoder, encoding method, and decoding method

Inventors: Ryuichi Kanoh (Osaka, JP); Takahiro Nishi (Nara, JP); Tadamasa Toma (Osaka, JP); Kiyofumi Abe (Osaka, JP)
Assignee: Panasonic Intellectual Property Corporation of America
H04N19/117H04N19/146H04N19/176
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,006,110
App. No.
16/809,216
Granted
May 11, 2021
Kind
B2
Abstract

An encoder determines a filter to be used for deblocking filtering from among a plurality of filters including a first filter and a second filter. The first filter uses M pixels located at an upper side of the block boundary and M pixels located at a lower side of the block boundary, and the second filter uses first pixels located at the upper side of the block boundary and second pixels located at the lower side of the block boundary, where M is an integer of at least 2. The number of the first pixels is any one of a plurality of first candidate values, and the number of the second pixels is any one of a plurality of second candidate values. The plurality of first pixel candidate values and the plurality of second pixel candidate values are each a value greater than or equal to M.

Claims (43)

1. A decoder, comprising:

circuitry; and

memory, wherein

using the memory, the circuitry:

determines a filter to be used in a deblocking filtering process from among a plurality of filters including a first filter and a second filter,

the first filter using M pixels located at an upper side of a block boundary and M pixels located at a lower side of the block boundary,

the second filter using K pixels located at the upper side of the block boundary and L pixels located at the lower side of the block boundary, wherein K is selected from candidates, including M and N larger than M, each of M and N being an integer greater than two, and L is selected from the candidates; and

performs the deblocking filtering process on the block boundary using the determined filter, wherein

responsive to a location of the block boundary being a predetermined location, K equals M, and the determined filter is the second filter.

2. The decoder according to claim 1 , wherein cases for the second filter include a case where K equals L; and a case where K is different from L.

3. The decoder according to claim 1 , wherein each of the candidates is greater than or equal to 4.

4. The decoder according to claim 1 , wherein among the plurality of filters, a filter other than the second filter uses a same number of pixels located at the upper side of the block boundary and pixels located at the lower side of the block boundary.

5. The decoder according to claim 1 , wherein the predetermined location is an upper edge of a coding tree unit (CTU).

6. The decoder according to claim 1 , wherein the predetermined location is an upper edge of a coding unit (CU).

7. The decoder according to claim 1 , wherein the largest possible value of K is at most the number of pixels that are located at the upper side of the block boundary and are used by a filter using a second largest number of pixels after the second filter among the plurality of filters.

8. The decoder according to claim 1 , wherein the largest possible value of K is at most the number of pixels that are located at the upper side of the block boundary and are used in a process using a largest number of pixels located at the upper side, among processes which are included in loop filtering and which include the deblocking filtering process and exclude a process using the second filter.

9. The decoder according to claim 1 , wherein in the case where K is different from L, a filter tap-length on one side of the block boundary is different from a filter tap-length on the other side of the block boundary.

10. The decoder according to claim 1 , wherein in the case where K is different from L, the second filter:

generates third pixels that are sequentially located above the K pixels, using the K pixels; and

uses the K pixels, the L pixels, and the third pixels,

wherein a sum of K and the number of the third pixels equals L.

11. A decoding method, comprising:

determining a filter to be used in a deblocking filtering process from among a plurality of filters including a first filter and a second filter,

the first filter using M pixels located at an upper side of a block boundary and M pixels located at a lower side of the block boundary,

the second filter using K pixels located at the upper side of the block boundary and L pixels located at the lower side of the block boundary, wherein K is selected from candidates including M and N larger than M, each of M and N being an integer greater than two, and L is selected from the candidates; and

performing the deblocking filtering process on the block boundary using the determined filter, wherein

responsive to a location of the block boundary being a predetermined location, K equals M, and the determined filter is the second filter.

12. The decoding method according to claim 11 , wherein

cases for the second filter include a case where K equals L; and a case where K is different from L.

13. The decoding method according to claim 11 , wherein each of the candidates is greater than or equal to 4.

14. The decoding method according to claim 11 , wherein among the plurality of filters, a filter other than the second filter uses a same number of pixels located at the upper side of the block boundary and pixels located at the lower side of the block boundary.

15. The decoding method according to claim 11 , wherein the predetermined location is an upper edge of a coding tree unit (CTU).

16. The decoding method according to claim 11 , wherein the predetermined location is an upper edge of a coding unit (CU).

17. The decoding method according to claim 11 , wherein the largest possible value of K is at most the number of pixels that are located at the upper side of the block boundary and are used by a filter using a second largest number of pixels after the second filter among the plurality of filters.

18. The decoding method according to claim 11 , wherein the

largest possible value of K is at most the number of pixels that are located at the upper side of the block boundary and are used in a process using a largest number of pixels located at the upper side, among processes which are included in loop filtering and which include the deblocking filtering process and exclude a process using the second filter.

19. The decoding method according to claim 11 , wherein

in the case where K is different from L, a filter tap-length on one side of the block boundary is different from a filter tap-length on the other side of the block boundary.

20. The decoding method according to claim 11 , wherein

in the case where K is different from L, the second filter:

generates third pixels that are sequentially located above the K pixels, using the K pixels; and

uses the K pixels, the L pixels, and the third pixels,

wherein a sum of K and the number of the third pixels equals L.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 21, 2020
From: KANOH, RYUICHI; NISHI, TAKAHIRO; TOMA, TADAMASA; ABE, KIYOFUMI
To: PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMERICA
Reel/Frame 052730/0380 →
Continuity (3)
Continuation PCTJP2019019453 · May 16, 2019
Provisional Application 62675303 · May 23, 2018
Related Publication 20200204802A1 · Jun 25, 2020
Cited By (1)
US 12,519,952