TEMPLATE MATCHING FOR JVET INTRA PREDICTION

• US 20200137383A1
• Filed: 12/24/2019
• Published: 04/30/2020
• Est. Priority Date: 05/17/2016
• Status: Active Grant

• Current Assignee: ARRIS Enterprises LLC (CommScope Holding Company, Inc.)
• Original Assignee: ARRIS Enterprises LLC (CommScope Holding Company, Inc.)
• Inventors: Panusopone, Krit, Wang, Limin, Minoo, Koohyar
• Granted Patent: US 10,958,902 B2
• Time in Patent Office: Days
• CPC Class Codes: H04N 19/105 Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction
• CPC Class Codes: H04N 19/107 between spatial and temporal predictive coding, e.g. picture refresh
• CPC Class Codes: H04N 19/11 among a plurality of spatial predictive coding modes
• CPC Class Codes: H04N 19/149 by estimating the code amount by means of a model, e.g. mathematical model or statistical model
• CPC Class Codes: H04N 19/176 the region being a block, e.g. a macroblock
• CPC Class Codes: H04N 19/197 including determination of the initial value of an encoding parameter H04N19/56 takes precedence
• CPC Class Codes: H04N 19/503 involving temporal prediction adaptive coding with adaptive selection between spatial and temporal predictive coding H04N19/107; adaptive coding with adaptive selection among a plurality of temporal predictive coding modes H04N19/109
• CPC Class Codes: H04N 19/593 involving spatial prediction techniques
• CPC Class Codes: H04N 19/647 using significance based coding, e.g. Embedded Zerotrees of Wavelets [EZW] or Set Partitioning in Hierarchical Trees [SPIHT]
• CPC Class Codes: H04N 19/91 Entropy coding, e.g. variable length coding [VLC] or arithmetic coding

Abstract

A method of decoding JVET video, comprising defining a coding unit (CU) template within a decoded area of a video frame, the CU template being positioned above and/or to the left of a current decoding position for which data was intra predicted, defining a search window within the decoded area, the search window being adjacent to the CU template, generating a plurality of candidate prediction templates based on pixel values in the search window, each of the plurality of candidate prediction templates being generated using different intra prediction modes, calculating a matching cost between the CU template and each of the plurality of candidate prediction templates, selecting an intra prediction mode that generated the candidate prediction template that had the lowest matching cost relative to the CU template, and generating a prediction CU for the current decoding position based on the intra prediction mode.

Claims

1. A method of decoding JVET video, comprising:

defining a coding unit (CU) template within a decoded area of a video frame, said CU template being positioned above and/or to the left of a current decoding position for which data was intra predicted;

defining a search window within said decoded area, said search window being adjacent to said CU template;

generating a plurality of candidate prediction templates based on pixel values in said search window, each of said plurality of candidate prediction templates being generated using different intra prediction modes;

calculating a matching cost between said CU template and each of the plurality of candidate prediction templates;

selecting an intra prediction mode that generated the candidate prediction template that had the lowest matching cost relative to said CU template; and

generating a prediction CU for said current decoding position based on said intra prediction mode.

2. The method of claim 1, wherein said CU template is shaped with a row of pixels immediately above the top of the current decoding position and a column of pixels immediately to the left of the current decoding position.

3. The method of claim 2, wherein said row of pixels has a length that is one pixel less than the length of the current decoding position and said column of pixels has a height that is one pixel less than the height of the current decoding position.

4. The method of claim 1, wherein calculating said matching costs comprises calculating the sum of absolute differences between said CU template and each of said plurality of candidate prediction templates.

5. The method of claim 1, wherein said search window is spaced apart from the current decoding position by the CU template and extends beyond the ends of the CU template.

6. The method of claim 1, wherein the steps of defining said CU template and said search window, calculating said matching costs, selecting intra prediction mode, and generating said prediction CU based on said intra prediction mode are performed when information identifying an intra prediction mode for the current decoding position is absent from a bitstream.

7. The method of claim 1, further comprising adding said prediction CU to a reconstructed residual CU to generate a reconstructed CU for output video.

8. The method of claim 1, wherein the different intra prediction modes for which candidate prediction templates are considered are at least a subset of the allowed JVET intra prediction modes.

9. A method of decoding JVET video, comprising:

defining a plurality of coding unit (CU) templates within a decoded area of a video frame, each of the CU templates being positioned above and/or to the left of a current decoding position for which data was intra predicted and being spaced apart from the current decoding position by a different number of reference lines;

defining a search window within said decoded area for each of said plurality of CU templates, each search window being within an associated reference line;

generating a plurality of candidate prediction templates for each of said plurality of CU templates based on pixel values in the search window associated with the CU template, each of said plurality of candidate prediction templates being generated using different intra prediction modes;

calculating a matching cost between each of said plurality of CU templates and each of said plurality of candidate prediction templates;

selecting an intra prediction mode that generated the candidate prediction template that had the lowest matching cost relative to one of said plurality of CU templates; and

generating a prediction CU for said current decoding position based on said intra prediction mode.

10. The method of claim 9, wherein each of said plurality of CU templates is shaped with a row of pixels immediately above an associated reference line and a column of pixels immediately to the left of the associated reference line.

11. The method of claim 9, wherein calculating said matching costs comprises calculating the sum of absolute differences between the CU templates and their associated plurality of candidate prediction templates.

12. The method of claim 9, wherein each search window extend beyond the ends of the associated CU template.

13. The method of claim 9, wherein the steps of defining said CU templates and said search windows, calculating said matching costs, selecting said intra prediction mode, and generating said prediction CU based on said intra prediction mode are performed when information identifying an intra prediction mode for the current decoding position is absent from a bitstream.

14. The method of claim 9, further comprising adding said prediction CU to a reconstructed residual CU to generate a reconstructed CU for output video.

15. The method of claim 9, wherein the different intra prediction modes for which candidate prediction templates are considered are at least a subset of the allowed JVET intra prediction modes.

16. A method of decoding JVET video, comprising:

receiving a bitstream identifying a plurality of coding units (CUs), at least some of which were encoded with intra prediction, wherein said bitstream omits an indication of which intra prediction mode was used to encode those CUs;

defining at least one CU template within a decoded area of a video frame, the at least one CU template being positioned above and/or to the left of a current decoding position for a coding unit encoded with intra prediction;

defining at least one search window within said decoded area, said at least one search window being adjacent to said at least one CU template within said decoded area;

generating a plurality of candidate prediction templates for said at least one CU template based on pixel values in the search window associated with said at least one CU template, each of said plurality of candidate prediction templates being generated using different intra prediction modes;

calculating a matching cost between said at least one CU template and each of said plurality of candidate prediction templates;

selecting an intra prediction mode that generated the candidate prediction template that had the lowest matching cost relative to said at least one CU template;

generating a prediction CU for said current decoding position based on said intra prediction mode;

decoding a reconstructed residual CU from said bitstream for said current decoding position; and

generating a reconstructed CU by adding said prediction CU to said reconstructed residual CU.

17. The method of claim 16, wherein said at least one CU template is shaped with a row of pixels immediately above the top of the current decoding position and a column of pixels immediately to the left of the current decoding position.

18. The method of claim 16, wherein each of said at least one CU templates is shaped with a row of pixels immediately above a different associated reference line and a column of pixels immediately to the left of the associated reference line.

19. The method of claim 16, wherein calculating said matching costs comprises calculating the sum of absolute differences between said at least one CU template and each of said plurality of candidate prediction templates.

20. The method of claim 16, wherein the different intra prediction modes for which candidate prediction templates are considered are at least a subset of the allowed JVET intra prediction modes.