Harmonized design for offset based refinement and multiple reference line selection

Offset-based refinement and multiple reference line selection schemes enhance video encoding efficiency by dynamically adjusting intra-prediction, addressing inefficiencies in traditional methods and improving compression ratios.

JP2024161467AActive Publication Date: 2024-11-19TENCENT AMERICA LLC
View PDF 7 Cites 0 Cited by

Patent Information

Application Number
JP2024135189
Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
Priority Date
2022-01-12
Filing Date
2024-08-14
Publication Date
2024-11-19
Estimated Expiration
2042-01-27

AI Technical Summary

Technical Problem

Existing video coding techniques face inefficiencies in intra-prediction due to the use of fixed reference lines and lack of refinement in directional prediction modes, leading to suboptimal compression ratios and increased bit usage for unlikely prediction directions.

Method used

Implementing offset-based refinement and multiple reference line selection schemes for intra-prediction in video encoding and decoding, which dynamically adjust prediction based on block mode information, reference line index, and block size to improve prediction accuracy and reduce bit usage.

Benefits of technology

Enhances video encoding efficiency by reducing bit usage and improving compression ratios through more accurate intra-prediction, particularly in scenarios where traditional methods struggle with unlikely prediction directions.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 2024161467000001_ABST
    Figure 2024161467000001_ABST
Patent Text Reader

Abstract

To provide a method for offset refinement for intra prediction and multiple reference line intra prediction in video decoding, an apparatus for video coding and / or decoding, and a computer readable storage medium.SOLUTION: A method 1500 includes: receiving, by a device, a coded video bitstream for a block (step 1510); determining, by the device, whether offset refinement for intra prediction applies to the block, based on mode information of the block, the mode information of the block including at least one of a reference line index of the block, an intra prediction mode of the block, and a size of the block (step 1520); and, in response to determining that the offset refinement for intra prediction applies to the block, performing, by the device, the offset refinement to generate an intra predictor for intra prediction of the block (step 1530).SELECTED DRAWING: Figure 15
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001]

[0001] Related Applications This application claims priority to U.S. Provisional Application No. 63 / 217,061, filed June 30, 2021, and U.S. Nonprovisional Application No. 17 / 573,823, filed January 12, 2022, which are incorporated herein by reference in their entireties.

[0002]

[0002] TECHNICAL FIELD The present disclosure relates to video coding and / or decoding techniques, and in particular to an improved design and signaling of offset-based refinement and multiple reference line selection schemes. [Background technology]

[0003] Background of the Disclosure The background discussion provided herein is intended to generally present the context of the present disclosure. Work under the name of the current inventor is not admitted, expressly or impliedly, as prior art to the present disclosure to the extent that such work is described in this background section or in a descriptive manner that may not otherwise qualify as prior art as of the filing date.

[0004]

[0004] Video coding and decoding can be performed using inter-picture prediction with motion compensation. Uncompressed digital video can include a sequence of pictures, each having spatial dimensions of, for example, 1920x1080 luminance samples and associated full or subsampled chrominance samples. The sequence of pictures can have a fixed or variable picture rate (alternatively called frame rate) of, for example, 60 pictures / second, i.e., frames per second. Uncompressed video has specific bitrate requirements for streaming or data processing. For example, a video with a pixel resolution of 1920x1080, a frame rate of 60 frames / second, and chroma subsampling of 4:2:0 at 8 bits / pixel / color channel requires a bandwidth approaching 1.5 Gbit / s. One hour of such video requires more than 600 Gbytes of storage space.

[0005]

[0005] One of the goals of video coding and decoding can be said to be the reduction of redundancy in the input image and / or video signal through compression. Compression can help reduce the aforementioned bandwidth and / or storage space requirements, in some cases by more than one order of magnitude. Both lossless and non-lossless compression, as well as combinations thereof, can be used. Lossless compression refers to techniques where an exact copy of the original signal can be reconstructed from the compressed original signal by the decoding process. Non-lossless compression refers to coding / decoding processes where the original video information is not fully preserved during coding and is not fully recoverable during decoding. When using non-lossless compression, the reconstructed signal may not be identical to the original signal, but the distortion between the original and reconstructed signals is small enough to make the reconstructed signal useful for the intended application despite some information loss. For video, non-lossless compression is widely used in many applications. The amount of distortion that is tolerated depends on the application. For example, a user of a particular consumer video streaming application may be able to tolerate higher distortion than a user of a movie or television broadcast application. The compression ratio achievable by a particular coding algorithm can be selected or adjusted to reflect different distortion tolerances: higher tolerable distortion generally allows for coding algorithms that result in higher loss and higher compression ratios.

[0006]

[0006] Video encoders and decoders may utilize techniques from a number of broad categories and steps, including, for example, motion compensation, Fourier transform, quantization, and entropy coding.

[0007]

[0007] Video codec techniques may include a technique known as intra-coding. In intra-coding, sample values ​​are represented without reference to samples or other data from previously reconstructed reference pictures. In some video codecs, a picture is spatially subdivided into blocks of samples. If all blocks of samples are coded in intra mode, the picture may be referred to as an intra picture. Intra pictures and their derivatives (e.g., independent decoder refresh pictures) may be used to reset the decoder state and thus may be used as the first picture in a coded video bitstream and video session or as a still image. The samples of the block after intra prediction may be subjected to a transform to the frequency domain, and the transform coefficients so generated may be quantized before entropy coding. Intra prediction refers to a technique that minimizes the sample values ​​in the pre-transform domain. In some cases, the smaller the transformed DC value and the smaller the AC coefficients, the fewer bits needed for a given quantization step size to represent the block after entropy coding.

[0008]

[0008] Traditional intra-coding, such as that known from MPEG-2 generation coding techniques, does not use intra-prediction. However, some newer video compression techniques include techniques that attempt to code / decode a block based on, for example, spatially adjacent surrounding sample data and / or metadata obtained during encoding / decoding that precede in decoding order the block of data being coded or decoded. Such techniques are hereafter referred to as "intra-prediction" techniques. Note that, at least in some cases, intra-prediction uses only reference data from the current picture being reconstructed, and not from a reference picture.

[0009]

[0009] There may be many different forms of intra prediction. If more than one such technique may be used in a given video coding technique, the technique used may be coded in an intra prediction mode. One or more intra prediction modes may be provided in a particular codec. In some cases, a mode may have sub-modes and / or may be associated with various parameters, and the mode / sub-mode information and intra coding parameters for a block of video may be coded individually or collectively included in a mode codeword. The codeword used for a given mode, sub-mode, and / or parameter combination may affect the coding efficiency gain from intra prediction, and therefore may also affect the entropy coding technique used to convert the codeword into a bitstream.

[0010]

[0010] Certain modes of intra prediction were introduced in H.264, improved in H.265, and further improved in new coding techniques such as Joint Search Model (JEM), Versatile Video Coding (VVC), and Benchmark Set (BMS). In general, for intra prediction, a prediction block can be formed using available neighboring sample values. For example, available values ​​of a particular set of neighboring samples along a particular direction and / or line can be copied to a predictor block.

[0011]

[0011] Referring to FIG. 1A, shown at the bottom right is a subset of 9 predictor directions specified among the 33 possible intra predictor directions of H.265 (corresponding to the 33 angle modes of the 35 intra modes specified in H.265). The point (101) where the arrows converge represents the sample to be predicted. The arrows indicate the direction from which nearby samples are used to predict the sample at 101. For example, arrow (102) indicates that sample (101) is predicted from one or more nearby samples toward the upper right at an angle of 45 degrees from the horizontal. Similarly, arrow (103) indicates that sample (101) is predicted from one or more nearby samples toward the lower left of sample (101) at an angle of 22.5 degrees from the horizontal.

[0012]

[0012] With further reference to FIG. 1A, a square block (104) of 4x4 samples is shown at the top left (indicated by a thick dashed line). The square block (104) contains 16 samples, each of which is labeled with "S" and its position in the Y dimension (e.g., row index) and its position in the X dimension (e.g., column index). For example, sample S21 is the second sample (from the top) in the Y dimension and the first sample (from the left) in the X dimension. Similarly, sample S44 is the fourth sample in the block (104) in both the Y and X dimensions. Since the block is 4x4 samples in size, S44 is at the bottom right. Also shown are exemplary reference samples following a similar numbering scheme. The reference samples are labeled with R and their Y position (e.g., row index) and X position (column index) relative to the block (104). In both H.264 and H.265, predicted samples that are adjacent to the block being reconstructed are used.

[0013]

[0013] Intra-picture prediction of block 104 may start by copying reference sample values ​​from nearby samples according to the signaled prediction direction. For example, assume that the coded video bitstream includes signaling for this block 104 indicating a prediction direction of arrow (102) - i.e., the sample is predicted from one or more prediction samples pointing to the upper right at an angle of 45 degrees from the horizontal. Then samples S41, S32, S23, and S14 are predicted from the same reference sample R05. And sample S44 is predicted from reference sample R08.

[0014] In some cases, values ​​of multiple reference samples may be combined, for example by interpolation, to calculate the reference sample; especially when the orientation is not evenly divisible by 45 degrees.

[0015]

[0015] The number of possible directions continues to grow as video coding techniques continue to develop. For example, in H.264 (2003), nine different directions were available for intra prediction. This increased to 33 in H.265 (2013), and JEM / VVC / BMS at the time of this disclosure can support up to 65 directions. Experimental studies have been conducted to help identify the most likely intra prediction direction, and certain techniques in entropy coding can be used to code the most likely direction with fewer bits, while accepting a certain bit penalty for the direction. Furthermore, the direction itself can often be predicted from nearby directions used in intra prediction of nearby blocks being decoded.

[0016] FIG. 1B shows a schematic diagram (180) illustrating the 65 intra prediction directions according to the JEM, illustrating the increasing number of prediction directions in different coding techniques that have evolved over time.

[0017]

[0017] The mapping of bits representing intra-prediction directions to prediction directions in the coded video bitstream may vary from one video coding technique to another; for example, they may range from simple direct mappings of prediction directions to complex adaptive schemes involving intra-prediction modes, codewords, most-probable modes, and similar techniques. However, in any given case, there may be certain directions of intra-prediction that are statistically less likely to occur in the video content than certain other directions. Since the goal of video compression is to reduce redundancy, these unlikely directions may be represented with more bits than the more likely directions in a well-designed video coding technique.

[0018]

[0018] Inter-picture prediction or intra-prediction can be based on motion compensation, in which sample data from a previously reconstructed picture or part of it (reference picture) can be used to predict a newly reconstructed picture or part of a picture (e.g., a block) after a spatial shift in the direction indicated by a motion vector (hereinafter MV). In some cases, the reference picture can be the same as the picture currently being reconstructed. MV can have two dimensions X and Y, or three dimensions, the third dimension being an indication of the reference picture in use (the latter is analogous to the temporal dimension).

[0019]

[0019] In some video compression techniques, the current MV applicable to a particular area of ​​sample data can be predicted from other MVs, e.g., those related to other areas of sample data that are spatially adjacent to the area being reconstructed and that precede the current MV in the decoding order. In this way, the amount of data required to code the MV can be significantly reduced, thereby increasing compression efficiency, by relying on the reduction of redundancy in the interrelated MVs. MV prediction can work effectively because, for example, when coding an input video signal derived from a camera (known as natural video), there is a statistical likelihood that areas larger than the area to which a single MV is applicable will move in a similar direction in the video sequence and can therefore possibly be predicted using similar motion vectors derived from the MVs of neighboring areas. This results in an actual MV for a given area that is similar or identical to the MV predicted from the surrounding MVs. Such MVs can be represented with fewer bits than would be used if the MVs were coded directly, rather than predicted from nearby MVs, after entropy coding. In some cases, MV prediction may be an example of lossless compression of a signal (i.e., the MV) derived from the original signal (i.e., the sample stream). In other cases, the MV prediction itself may be non-lossless, for example due to rounding errors when computing the predictor from some surrounding MVs.

[0020]

[0020] Various MV prediction mechanisms are described in H.265 / HEVC (ITU-T Rec. H.265, "High Efficiency Video Coding", December 2016). Among the many MV prediction mechanisms specified by H.265, the one described in this application is a technique hereafter referred to as "spatial merge".

[0021]

[0021] Specifically, referring to Fig. 2, a current block (201) contains samples that have been found by the encoder during the motion search process to be predictable from a previous block of the same size but spatially shifted. Instead of coding its MV directly, the MV can be derived from metadata associated with one or more reference pictures, for example, from the most recent reference picture (in decoding order) using MVs associated with any of the five surrounding samples (202 to 206, respectively), designated A0, A1, and B0, B1, B2. In H.265, MV prediction can use predictors from the same reference picture as neighboring blocks use. Summary of the Invention

[0022] This disclosure describes various embodiments of methods, apparatus, and computer-readable storage media for video encoding and / or decoding.

[0023]

[0023] According to one aspect, an embodiment of the present disclosure provides an offset refinement method for intra prediction and multiple reference line intra prediction in video decoding. The method includes a step of a device receiving a coded video bitstream for a block. The device includes a memory storing instructions and a processor in communication with the memory. The method includes a step of the device determining whether offset refinement for intra prediction is applied to the block based on mode information of the block, the mode information of the block including at least one of a reference line index of the block, an intra prediction mode of the block, and a size of the block; and a step of the device performing offset refinement to generate an intra predictor for intra prediction of the block in response to a determination that offset refinement for intra prediction is applied to the block.

[0024]

[0024] According to another aspect, an embodiment of the present disclosure provides an apparatus for video encoding and / or decoding, the apparatus including a memory storing instructions and a processor in communication with the memory, the processor being configured to, when the processor executes the instructions, cause the apparatus to perform the above-described method for video encoding and / or decoding.

[0025]

[0025] According to another aspect, an embodiment of the present disclosure provides a non-transitory computer-readable storage medium storing instructions that, when executed by a computer for video encoding and / or decoding, cause the computer to perform a method relating to video encoding and / or decoding.

[0026]

[0026] These and other aspects and their implementations are described in more detail in the drawings, specification, and claims. [Brief description of the drawings]

[0027] Further features, nature and various advantages of the disclosed subject matter will become more apparent from the following detailed description and the accompanying drawings. [Figure 1A]

[0028] FIG. 1A shows a schematic diagram of an example subset of intra-prediction direction modes. [Figure 1B]

[0029] FIG. 1B shows an example of an exemplary intra-prediction direction. [Diagram 2]

[0030] FIG. 2 shows a schematic diagram of a current block and its surrounding spatial merging candidates for motion vector prediction in one example. [Diagram 3]

[0031] FIG. 3 illustrates a simplified block diagram of a communication system (300) in accordance with an example embodiment. [Figure 4]

[0032] FIG. 4 illustrates a simplified block diagram of a communication system (400) in accordance with an example embodiment. [Diagram 5]

[0033] FIG. 5 shows a schematic diagram of a simplified block diagram of a video decoder according to an exemplary embodiment. [Figure 6]

[0034] FIG. 6 shows a schematic diagram of a simplified block diagram of a video encoder according to an exemplary embodiment. [Figure 7]

[0035] FIG. 7 shows a block diagram of a video encoder according to another exemplary embodiment. [Figure 8]

[0036] FIG. 8 shows a block diagram of a video decoder according to another exemplary embodiment. [Figure 9]

[0037] FIG. 9 illustrates directional intra-prediction modes according to an exemplary embodiment of the present disclosure. [Figure 10]

[0038] FIG. 10 illustrates a non-directional intra-prediction mode according to an exemplary embodiment of this disclosure. [Figure 11]

[0039] FIG. 11 illustrates a recursive intra prediction mode according to an exemplary embodiment of this disclosure. [Figure 12]

[0040] FIG. 12 illustrates various reference line based intra prediction schemes according to an exemplary embodiment of the present disclosure. [Figure 13]

[0041] FIG. 13 illustrates offset-based refinement for intra prediction according to an exemplary embodiment of the present disclosure. [Figure 14A]

[0042] FIG. 14A illustrates another example of offset-based refinement for intra prediction according to an exemplary embodiment of the present disclosure. [Figure 14B]

[0043] FIG. 14B illustrates another example of offset-based refinement for intra prediction according to an exemplary embodiment of the present disclosure. [Figure 15]

[0044] FIG. 15 illustrates a flow chart of a method according to an exemplary embodiment of the present disclosure. [Figure 16]

[0045] FIG. 16 illustrates a schematic diagram of a computer system according to an embodiment of the present disclosure. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0028]

[0046] The present invention will now be described in detail with reference to the accompanying drawings, which form a part hereof and which show by way of illustration certain specific examples of embodiments. It should be noted, however, that the present invention may be embodied in many different forms, and thus the subject matter covered or claimed is not intended to be construed as being limited to any of the embodiments described below. It should also be noted that the present invention may be embodied as a method, device, component or system. Thus, embodiments of the present invention may take the form of, for example, hardware, software, firmware, or any combination thereof.

[0029]

[0047] Throughout the specification and claims, terms may have a nuanced meaning beyond that explicitly stated, as suggested or implied by the context. The phrases "in one embodiment" or "in some embodiments" as used herein do not necessarily refer to the same embodiment, and the phrases "in another embodiment" or "in other embodiments" as used herein do not necessarily refer to different embodiments. Similarly, the phrases "in one implementation" or "in some implementations" as used herein do not necessarily refer to the same implementation, and the phrases "in another implementation" or "in other implementations" as used herein do not necessarily refer to different implementations. For example, it is intended that the claimed subject matter includes, in whole or in part, a combination of example embodiments / implementations.

[0030]

[0048] Generally, terms may be understood, at least in part, from their usage in the context. For example, terms such as "and," "or," or "and / or," when used herein, may include various meanings that may depend, at least in part, on the context in which such terms are used. Typically, when used to relate a list such as A, B, or C, "or" is intended to mean "A, B, or C" used in an exclusive sense in addition to "A, B, and C" used in an inclusive sense. Furthermore, the terms "one or more" or "at least one" as used herein may be used to describe any feature, structure, or characteristic in a singular sense, or may be used to describe a combination of features, structures, or characteristics in a plural sense, depending, at least in part, on the context. Similarly, terms such as "a," "an," or "the" may also be understood to convey a singular use or a plural use, depending, at least in part, on the context. Moreover, the terms "based on" or "determined by" are not necessarily intended to convey an exclusive set of factors, but rather, again depending at least in part on the context, may allow for the existence of additional factors not necessarily explicitly stated.

[0031]

[0049] FIG. 3 illustrates a simplified block diagram of a communication system (300) according to an embodiment of the present disclosure. The communication system (300) includes a plurality of terminal devices capable of communicating with each other, for example, via a network (350). For example, the communication system (300) includes a first pair of terminal devices (310) and (320) interconnected via the network (350). In the example of FIG. 3, the first pair of terminal devices (310) and (320) are capable of unidirectional transmission of data. For example, the terminal device (310) may code video data (e.g., a stream of video pictures captured by the terminal device (310)) for transmission to the other terminal device (320) via the network (350). The encoded video data may be transmitted in the form of one or more coded video bitstreams. The terminal device (320) can receive the coded video data from the network (350), decode the coded video data to reconstruct the video picture, and display the video picture according to the reconstructed video data. The unidirectional data transmission may be realized in a media serving application, etc.

[0032]

[0050] In another example, the communication system (300) includes a second pair of terminal devices (330) and (340) for bidirectional transmission of coded video data, such as may occur during a video conferencing application. For bidirectional data transmission, for example, each of the terminal devices (330) and (340) may code video data (e.g., a stream of video pictures captured by the terminal device) for transmission over the network (350) to the other of the terminal devices (330) and (340). Each of the terminal devices (330) and (340) may also receive coded video data transmitted by the other of the terminal devices (330) and (340), decode the coded video data to reconstruct the video pictures, and display the video pictures on an accessible display device according to the reconstructed video data.

[0033]

[0051] In the example of FIG. 3, terminal devices (310), (320), (330), and (340) are embodied as a server, a personal computer, and a smartphone, although applicability of the principles of the present disclosure need not be so limited. Embodiments of the present disclosure may be implemented in desktop computers, laptop computers, tablet computers, media players, wearable computers, dedicated video conferencing equipment, and / or the like. Network (350) represents any number or type of network that carries coded video data between terminal devices (310), (320), (330), and (340), including, for example, wired (wired) and / or wireless communication networks. Communications network (350) may exchange data over circuit-switched, packet-switched, and / or other types of channels. Exemplary networks include telecommunications networks, local area networks, wide area networks, and / or the Internet. For purposes of this disclosure, the architecture and topology of network 350 may not be important to the operation of the disclosure unless explicitly described below.

[0034]

[0052] Figure 4 illustrates the placement of a video encoder and video decoder in a streaming environment as an example application of the disclosed subject matter. The disclosed subject matter is equally applicable to other video-enabled applications including, for example, video conferencing, digital TV broadcasting, gaming, virtual reality, storage of compressed video on digital media (including CDs, DVDs, memory sticks, etc.), etc.

[0053] The streaming system may include a video source (401) and a capture subsystem (413) that may include, for example, a digital camera, generating a stream of uncompressed video pictures or images (402). In one example, the stream of video pictures (402) includes samples recorded by the digital camera of the video source 401. The stream of video pictures (402), depicted as a thick line to emphasize the larger amount of data compared to the encoded video data (404) (or coded video bitstream), may be processed by an electronic device (420) that includes a video encoder (403) coupled to the video source (401). The video encoder (403) may include hardware, software, or a combination thereof to enable or implement aspects of the disclosed subject matter as described in more detail below. The encoded video data (404) (or encoded video bitstream (404)), depicted as thin lines to emphasize the smaller amount of data compared to the stream of uncompressed video pictures (402), can be stored directly on the streaming server (405) or on a downstream video device (not shown) for future use. One or more streaming client subsystems, such as the client subsystems (406) and (408) of FIG. 4, can access the streaming server (405) to retrieve copies (407) and (409) of the encoded video data (404). The client subsystem (406) can include a video decoder (410), for example within the electronic device (430). The video decoder (410) decodes the incoming copy of the encoded video data (407) and generates an output stream of decompressed video pictures (411) that can be rendered on a display (412) (e.g., a display screen) or other rendering device (not shown). Video decoder 410 may be configured to perform some or all of the various functions described in this disclosure.In some streaming systems, the encoded video data (404), (407), and (409) (e.g., video bitstreams) may be encoded according to a particular video coding / compression standard. Examples of these standards include ITU-T Recommendation H.265. In one example, a video coding standard under development is informally known as Versatile Video Coding (VVC). The disclosed subject matter may be used in the context of VVC and other video coding standards.

[0035]

[0054] It should be noted that electronic devices 420 and 430 may include other components (not shown), such as electronic device 420 including a video decoder (not shown) and electronic device 430 including a video encoder (not shown).

[0036]

[0055] 5 shows a block diagram of a video decoder (510) according to one embodiment of the present disclosure. The video decoder (510) may be included in an electronic device (530). The electronic device (530) may include a receiver (531) (e.g., receiving circuitry). The video decoder (510) may be used in place of the video decoder (410) in the example of FIG. 4.

[0037]

[0056] The receiver (531) can receive one or more coded video sequences that are to be decoded by the video decoder (510). In the same or another embodiment, it is possible to receive one coded video sequence at a time, where the decoding of each coded video sequence is independent of the other coded video sequences. A coded video sequence may relate to multiple video frames or images. The coded video sequences can be received from a channel (501), which may be a hardware / software link to a storage device that stores the coded video data or a streaming source that transmits the coded video data. The receiver (531) can receive the coded video data together with other data, e.g. coded audio data and / or auxiliary data streams, which can be transferred using respective entities (not shown). The receiver (531) can separate the coded video sequences from the other data. To deal with network jitter, a buffer memory (515) may be placed between the receiver (531) and the entropy decoder / parser (520), hereafter referred to as the parser (520). In certain applications, the buffer memory (515) may be implemented as part of the video decoder (510). In other applications, it may be separate and external to the video decoder (510) (not shown). In yet other applications, there may be a buffer memory (not shown) external to the video decoder (510), e.g. to deal with network jitter, and there may be another additional buffer memory (515) inside the video decoder (510), e.g. to handle playback timing.If the receiver (531) is receiving data from a store / forward device with sufficient bandwidth and controllability or from an isochronous network, the buffer memory (515) may not be needed or may be small. For use with best effort packet networks such as the Internet, a buffer memory (515) of sufficient size may be needed, and may be relatively large in size. Such a buffer memory may be implemented with an adaptive size and may be implemented at least in part in an operating system or similar element (not shown) outside the video decoder (510).

[0038]

[0057] The video decoder (510) may include a parser (520) to reconstruct symbols (521) from the coded video sequence. These symbol categories include information used to manage the operation of the video decoder (510) and potentially information for controlling a rendering device such as a rendering device (512) (e.g., a display screen) that may or may not be an integral part of the electronic device (530) as shown in FIG. 5, but may be coupled to the electronic device (530). The rendering device control information may be in the form of a Supplemental Enhancement Information (SEI) message or a Video Usability Information (VUI) parameter set fragment (not shown). The parser (520) may parse / entropy decode the coded video sequence received by the parser (520). The entropy coding of the coded video sequence may follow a video coding technique or standard and may follow various principles including variable length coding, Huffman coding, arithmetic coding with or without context effects, etc. The parser (520) may extract from the coded video sequence a set of subgroup parameters for at least one subgroup of pixels in the video decoder based on at least one parameter corresponding to the subgroup. The subgroups may include Groups of Pictures (GOP), pictures, tiles, slices, macroblocks, coding units (CUs), blocks, transform units (TUs), prediction units (PUs), etc. The parser (520) may also extract from the coded video sequence information such as transform coefficients (e.g., Fourier transform coefficients), quantization parameter values, motion vectors, etc.

[0039]

[0058] The parser (520) is capable of performing an entropy decoding / parsing process on the video sequence received from the buffer memory (515) to generate symbols (521).

[0040]

[0059] The reconstruction of the symbols (521) may involve several different processing or functional units, depending on the type of coded video picture or part thereof (inter and intra picture, inter and intra block) and other factors. Which units are involved and how can be controlled by subgroup control information parsed by the parser (520) from the coded video sequence. The flow of such subgroup control information between the parser (520) and the following several processing or functional units is not depicted for the sake of clarity.

[0041]

[0060] Beyond the functional blocks already mentioned, the video decoder (510) may be conceptually subdivided into a number of functional units as described below. In a practical implementation operating under commercial constraints, many of these units may interact closely with each other and may be at least partially integrated with each other. However, for purposes of describing various functions of the disclosed subject matter, a conceptual subdivision into functional units is adopted in the following disclosure.

[0042]

[0061] The first unit may be a scalar / inverse transform unit (551), which may receive quantized transform coefficients as well as control information (including what type of inverse transform to use, block size, quantization factors / parameters, quantization scaling matrix, etc.) as symbols (521) from the parser (520). The scalar / inverse transform unit (551) may output blocks containing sample values ​​that may be input to an aggregator (555).

[0043]

[0062] In some cases, the output samples of the scalar / inverse transform (551) may relate to intra-coded blocks, i.e., blocks that do not use prediction information from a previously reconstructed picture, but may use prediction information from a previously reconstructed part of the current picture. Such prediction information may be provided by an intra picture prediction unit (552). In some cases, the intra picture prediction unit (552) may generate a block of the same size and shape as the block being reconstructed using surrounding block information already reconstructed and stored in the current picture buffer (558). The current picture buffer (558) may, for example, buffer a partially reconstructed current picture and / or a fully reconstructed current picture. The aggregator (555) may add, possibly on a sample-by-sample basis, the prediction information generated by the intra prediction unit (552) to the output sample information as provided by the scalar / inverse transform unit (551).

[0044]

[0063] In other cases, the output samples of the scalar / inverse transform unit (551) may relate to a block that may be inter-coded and motion compensated. In such a case, the motion compensation prediction unit (553) may access the reference picture memory (557) to retrieve samples used for inter-picture prediction. After motion compensating the retrieved samples according to the symbols (521) related to the block, these samples are added by the aggregator (555) to the output of the scalar / inverse transform unit (551) (the output of unit 551 may be called residual samples or residual signals) to generate output sample information. The addresses in the reference picture memory (557) from which the motion compensation prediction unit (553) fetches prediction samples may be controlled by motion vectors available to the motion compensation prediction unit (553), for example in the form of symbols (521) that may have X, Y components (shift), and reference picture components (time). Motion compensation may also involve interpolation of sample values ​​taken from a reference picture memory (557) when sub-sample accurate motion vectors are used, and may also involve motion vector prediction mechanisms, etc.

[0045]

[0064] The output samples of the aggregator (555) may be subjected to various loop filtering techniques in the loop filter unit (556). The video compression techniques may include in-loop filter techniques controlled by parameters contained in the coded video sequence (also called the coded video bitstream) and made available to the loop filter unit (556) as symbols (521) from the parser (520), which may be responsive to meta information obtained during the decoding of a previous portion (in decoding order) of the coded picture or coded video sequence, as well as to previously reconstructed loop filtered sample values. As will be described in more detail below, several types of loop filters may be included as part of the loop filter unit 556 in various orders.

[0046]

[0065] The output of the loop filter unit (556) may be a sample stream that can be output to a rendering device (512) or can be stored in a reference picture memory (557) for use in future inter-picture prediction.

[0047]

[0066] Once a given coded picture is fully reconstructed, it can be used as a reference picture for future inter-picture prediction. For example, once a coded picture corresponding to a current picture is fully reconstructed and the coded picture is identified as a reference picture (e.g., by the parser (520)), the current picture buffer (558) can become part of the reference picture memory (557) and a fresh current picture buffer can be reallocated before starting the reconstruction of a future coded picture.

[0048]

[0067] The video decoder (510) may perform decoding operations according to a given video compression technique adopted in a standard such as ITU-T Rec. H.265. The coded video sequence may conform to the syntax specified by the video compression technique or standard used in the sense that the coded video sequence conforms to both the syntax of the video compression technique or standard and the profile as documented in the video compression technique or standard. In particular, the profile may select a particular tool from among all tools available in the video compression technique or standard as the only tool that may be used under that profile. Also, to conform to a standard, the complexity of the coded video sequence may be within a range defined by the level of the video compression technique or standard. In some cases, the level limits the maximum picture size, the maximum frame rate, the maximum reconstruction sample rate (e.g., measured in units of megasamples per second), the maximum reference picture size, etc. The limits set by the levels may in some cases be further constrained by Hypothetical Reference Decoder (HRD) specifications and metadata for HRD buffer management signaled in the coded video sequence.

[0049]

[0068] In some example embodiments, the receiver (531) may receive additional (redundant) data along with the encoded video. The additional data may be included as part of the coded video sequence. The additional data may be used by the video decoder (510) to properly decode the data and / or to more accurately reconstruct the original video data. The additional data may be in the form of, for example, temporal, spatial, or signal-to-noise ratio (SNR) enhancement layers, redundant slices, redundant pictures, forward error correction codes, etc.

[0050]

[0069] 6 shows a block diagram of a video encoder (603) according to an exemplary embodiment of the present disclosure. The video encoder (603) may be included in an electronic device (620). The electronic device (620) may include a transmitter (640) (e.g., a transmitting circuit). The video encoder (603) may be used in place of the video encoder (403) in the example of FIG. 4.

[0051]

[0070] The video encoder (603) may receive video samples from a video source (601) (which in the example of FIG. 6 is not part of the electronic device (620)) capable of capturing video images to be coded by the video encoder (603). In another example, the video source (601) may be implemented as part of the electronic device (620).

[0052]

[0071] The video source (601) may provide a source video sequence to be coded by the video encoder (603) in the form of a digital video sample stream that may be of any suitable bit depth (e.g., 8-bit, 10-bit, 12-bit, ...), any color space (e.g., BT.601 YCrCB, RGB, ...), and any suitable sampling structure (e.g., YCrCb 4:2:0, YCrCb 4:4:4). In a media serving system, the video source (601) may be a storage device capable of storing pre-prepared video. In a video conferencing system, the video source (601) may be a camera that captures local image information as a video sequence. The video data may be provided as a number of individual pictures or images that convey motion when viewed in sequence. The picture itself may be organized as a spatial array of pixels, where each pixel may contain one or more samples depending on the sampling structure, color space, etc. in use. Those skilled in the art can readily understand the relationship between pixels and samples, and the following discussion focuses on samples.

[0053]

[0072] According to some example embodiments, the video encoder (603) is capable of coding and compressing pictures of a source video sequence into a coded video sequence (643) in real-time or under any other time constraint required by an application. Imposing an appropriate coding rate is one function of the controller (650). In some embodiments, the controller (650) may be operatively coupled to and control other functional units as described below, which couplings are not depicted for clarity. Parameters set by the controller (650) may include rate control related parameters (picture skip, quantizer, lambda value for rate distortion optimization techniques, ...), picture size, group of pictures (GOP) layout, maximum motion vector search range, etc. The controller (650) may be configured to have other suitable functions associated with the video encoder (603) optimized for a particular system design.

[0054]

[0073] In some example embodiments, the video encoder (603) can be configured to operate in a coding loop. As a simplified explanation, in one example, the coding loop can include a source coder (630) (e.g., responsible for generating a symbol-like symbol stream based on an input picture to be coded and reference pictures) and a (local) decoder (533) built into the video encoder (603). Even though the built-in decoder 633 processes the video stream coded by the source coder 630 without entropy coding, the decoder (633) reconstructs the symbols to generate sample data in a similar manner to that generated by the (remote) decoder (since any compression between the symbols and the coded video bitstream is lossless in the video compression techniques contemplated in the disclosed subject matter). The reconstructed sample stream (sample data) is input to a reference picture memory (634). Since the decoding of the symbol stream produces bit-exact results independent of the location of the decoder (local or remote), the contents in the reference picture memory (634) are also bit-exact between the local and remote encoders. In other words, the prediction part of the encoder "sees" exactly the same sample values ​​as the reference picture samples that the decoder would "see" if it used prediction during decoding. This basic principle of reference picture synchronization (and the resulting drift if synchrony cannot be maintained, e.g. due to channel errors) is used to improve coding quality.

[0055]

[0074] The operation of the "local" decoder (633) may be the same as that of a "remote" decoder, such as the video decoder (510) already described in detail above in connection with Figure 5. However, with brief reference to Figure 5 as well, because symbols are available and the encoding / decoding of the symbols into a coded video sequence by the entropy coder (645) and parser (520) may be lossless, the entropy decoding portion of the video decoder (510), including the buffer memory (515) and parser (520), may not be fully implemented in the local decoder (633) at the encoder.

[0056]

[0075] An insight that can be made at this point is that any decoder technique, except analysis / entropy decoding, which may only exist in the decoder, may also need to exist in substantially the same functional form in the corresponding encoder. For this reason, the disclosed subject matter may often focus on the decoder operation associated with the decoder portion of the encoder. A description of the encoder technique may be omitted, since it is the reverse of the decoder technique described generically. Only in certain areas or aspects will a more detailed description of the encoder be provided below.

[0057]

[0076] During operation, in some example implementations, the source coder (630) may perform motion-compensated predictive coding, which predictively codes an input picture with reference to one or more previously coded pictures from the video sequence that have been designated as “reference pictures.” In this manner, the coding engine (632) codes differences (or residuals) in chroma channels between pixel blocks of the input picture and pixel blocks of reference pictures that may be selected as predictive references for the input picture.

[0058]

[0077] The local video decoder (633) can decode the coded video data of the pictures that can be designated as reference pictures based on the symbols generated by the source coder (630). The operation of the coding engine (632) can advantageously be a non-lossless process. If the coded video data can be decoded by a video decoder (not shown in FIG. 6), the reconstructed video sequence can be a replica of the source video sequence, typically with some errors. The local video decoder (633) can repeat the decoding process that can be performed by the video decoder with respect to the reference pictures, causing the reconstructed reference pictures to be stored in the reference picture cache (634). In this way, the video encoder (603) can locally store copies of reconstructed reference pictures that have common content as reconstructed reference pictures obtained by the far-end video decoder (assuming there are no transmission errors).

[0059]

[0078] The predictor (635) can perform a prediction search for the coding engine (632). That is, for a new picture to be coded, the predictor (635) can search the reference picture memory (534) for sample data (as candidate reference pixel blocks) or predefined metadata (reference picture motion vectors, block shapes, etc.), which may serve as suitable prediction references for the new picture. The predictor (535) can operate on a sample block-pixel block basis to find suitable prediction references. In some cases, as determined by the search results obtained by the predictor (635), an input picture may have prediction references drawn from multiple reference pictures stored in the reference picture memory (634).

[0060]

[0079] The controller (650) may manage the coding operations of the source coder (630), including, for example, setting the parameters and subgroup parameters used to encode the video data.

[0061]

[0080] All outputs of the aforementioned functional units can be subjected to entropy coding in an entropy coder (645), which converts the symbols produced by the various functional units into a coded video sequence by lossless compression of the symbols according to techniques such as Huffman coding, variable length coding, arithmetic coding, etc.

[0062]

[0081] The transmitter (640) can buffer the coded video sequence, as produced by the entropy coder (645), and prepare it for transmission over a communication channel (660), which may be a hardware / software link to a storage device that stores the coded video data. The transmitter (640) can merge the coded video data from the video encoder (603) with other data to be transmitted, such as coded audio data and / or auxiliary data streams (sources not shown).

[0063]

[0082] The controller (650) may manage the operation of the video encoder (603). During coding, the controller (650) may assign a particular coded picture type to each of the coded pictures, which may affect the coding technique that may be applied to each picture. For example, a picture may often be assigned as one of the following picture types:

[0064]

[0083] An Intra picture (I-picture) is one that can be coded and decoded without using any other picture in a sequence as a source of prediction. Some video codecs allow different types of Intra pictures, including, for example, Independent Decoder Refresh ("IDR") pictures. Those skilled in the art are aware of these variations of I-pictures and their respective uses and characteristics.

[0065]

[0084] A predictive picture (P-picture) is one that can be coded and decoded using intra- or inter-prediction, which uses at most one motion vector and reference index to predict the sample values ​​of each block.

[0066]

[0085] Bi-directionally predicted pictures (B-pictures) are those that can be coded and decoded using intra- or inter-prediction, which uses at most two motion vectors and reference indices to predict the sample values ​​of each block. Similarly, multiple predicted pictures can use more than two reference pictures and associated metadata for the reconstruction of a block.

[0067]

[0086] A source picture is usually spatially subdivided into multiple sample coding blocks (e.g., into blocks of 4x4, 8x8, 4x8, or 16x16 samples, respectively) and can be coded block by block. Blocks can be predictively coded with reference to other (already coded) blocks, as determined by the coding assignment applied to the respective picture. For example, blocks of an I picture may be non-predictively coded or they may be predictively coded with reference to already coded blocks of the same picture (spatial or intra prediction). Pixel blocks of a P picture may be predictively coded by spatial or temporal prediction with reference to one previously coded reference picture. Blocks of a B picture may be predictively coded by spatial or temporal prediction with reference to one or two previously coded reference pictures. Source pictures or intermediate processing pictures may be subdivided into other types of blocks for other purposes. The division of coding blocks and other types of blocks may or may not follow the same method as described in more detail below.

[0068]

[0087] The video encoder (603) may perform coding operations according to a given video coding technique or standard, such as ITU-T Rec. H.265, in which the video encoder (603) may perform various compression operations, including predictive coding operations that exploit temporal and spatial redundancy in the input video sequence. The coded video data may accordingly conform to a syntax specified by the video coding technique or standard being used.

[0069]

[0088] In some example embodiments, the transmitter (640) can transmit additional data along with the encoded video. The source coder (630) can include such data as part of the coded video sequence. The additional data can include temporal / spatial / SNR enhancement layers, other forms of redundant data (redundant pictures and slices, SEI messages, VUI parameter set fragments, etc.).

[0070]

[0089] Video can be captured as multiple source pictures (video pictures) in a time sequence. Intra-picture prediction (often abbreviated as intra prediction) exploits spatial correlation in a given picture, while inter-picture prediction exploits temporal or other correlation between pictures. For example, a particular picture under encoding / decoding, referred to as the current picture, may be partitioned into blocks. A block in the current picture can be coded by a vector, called a motion vector, if it resembles a reference block in a reference picture that was previously coded and is still buffered in the video. A motion vector points to a reference block in a reference picture and can have a third dimension that identifies the reference picture if multiple reference pictures are used.

[0071]

[0090] In some example embodiments, bi-prediction techniques may be used for inter-picture prediction. According to bi-prediction techniques, two reference pictures are used, such as a first reference picture and a second reference picture, both preceding in decoding order (but possibly past and future, respectively, in display order) a current picture in a video. A block in the current picture may be coded with a first motion vector that points to a first reference block in the first reference picture and a second motion vector that points to a second reference block in the second reference picture. A block may be jointly predicted by a combination of the first and second reference blocks.

[0072]

[0091] Furthermore, to improve coding efficiency, it is possible to use merge mode techniques for inter-picture prediction.

[0073]

[0092] According to some embodiments of the present disclosure, predictions such as inter-picture prediction and intra-picture prediction are performed on a block-by-block basis. For example, a picture in a sequence of video pictures may be partitioned into coding tree units (CTUs) for compression, and the CTUs in a picture may have the same size, such as 64x64 pixels, 32x32 pixels, or 16x16 pixels. In general, a CTU may include three parallel coding tree blocks (CTBs), one luma CTB and two chroma CTBs. Each CTU may be recursively quad-tree partitioned into one or more coding units (CUs). For example, a 64x64 pixel CTU may be partitioned into one CU of 64x64 pixels and four CUs of 32x32 pixels. Each of the one or more 32x32 blocks may be further partitioned into four CUs of 16x16 pixels. In some example embodiments, each CU may be analyzed during encoding to determine a prediction type of the CU among various prediction types, such as an inter prediction type or an intra prediction type. The CU may be divided into one or more prediction units (PUs) depending on temporal and / or spatial predictability. In general, each PU includes a luma prediction block (PB) and two chroma PBs. In one embodiment, the prediction process in coding (encoding / decoding) is performed in units of prediction blocks. The division of the CU into PUs (or PBs of different color channels) may be performed in various spatial patterns. For example, a luma or chroma PB may include a matrix of values ​​(e.g., luma values) for pixels, such as 8x8 pixels, 16x16 pixels, 8x16 pixels, 16x8 pixels, etc.

[0074]

[0093] 7 shows a diagram of a video encoder (703) according to another embodiment of the present disclosure. The video encoder (703) is configured to receive a processed block of sample values ​​(e.g., a predictive block) in a current video picture in a sequence of video pictures and to encode the processed block into a coded picture that is part of a coded video sequence. For example, the video encoder (703) can be used in place of the example video encoder (403) of FIG. 4.

[0075]

[0094] For example, the video encoder (703) receives a matrix of sample values ​​for a processing block, such as a predicted block of 8x8 samples. The video encoder (703) then determines whether the processing block is best coded using intra-mode, inter-mode, or bi-prediction mode, e.g., using rate-distortion optimization (RDO). If it is determined that the processing block should be coded in intra-mode, the video encoder (703) may use intra-prediction techniques to code the processing block into a coded picture; if it is determined that the processing block should be coded in inter-mode or bi-prediction mode, the video encoder (703) may use inter-prediction techniques or bi-prediction techniques, respectively, to code the processing block into a coded picture. In some exemplary embodiments, a merge mode may be used as a sub-mode of inter-picture prediction, in which case motion vectors are derived from one or more motion vector predictors without benefit of coded motion vector components outside the predictors. In some other exemplary embodiments, there may be motion vector components applicable to the current block. Accordingly, the video encoder (703) may include components not explicitly shown in FIG. 7, such as a mode decision module to determine the prediction mode of a processing block.

[0076]

[0095] In the example of FIG. 7, the video encoder (703) includes an inter-encoder (730), an intra-encoder (722), a residual calculator (723), a switch (726), a residual encoder (724), a general controller (721), and an entropy encoder (725) coupled together as shown in the exemplary arrangement of FIG. 7.

[0077]

[0096] The inter encoder (730) is configured to receive samples of a current block (e.g., a processing block), compare the block to one or more reference blocks in a reference picture (e.g., blocks in previous and subsequent pictures in display order), generate inter prediction information (e.g., an account of redundant information due to inter coding techniques, motion vectors, merge mode information), and calculate an inter prediction result (e.g., a prediction block) based on the inter prediction information using any suitable technique. In some examples, the reference picture is a decoded reference picture that has been decoded based on the encoded video information using a decoding unit 633 (such as shown as a residual decoder 728 in FIG. 7, described in more detail below) incorporated in the example encoder 620 of FIG. 6.

[0078]

[0097] The intra encoder (722) is configured to receive samples of a current block (e.g., a processing block), compare the block with previously coded blocks in the same picture, generate quantized coefficients after transformation, and possibly also generate intra prediction information (e.g., intra prediction direction information according to one or more intra coding techniques). The intra encoder (722) is capable of computing an intra prediction result (e.g., a prediction block) based on the intra prediction information and reference blocks in the same picture.

[0079]

[0098] The generic controller (721) may be configured to determine generic control data and control other components of the video encoder (703) based on the generic control data. In one example, the generic controller (721) determines a prediction mode of a block and provides a control signal to a switch (726) based on the prediction mode. For example, if the prediction mode is an intra mode, the generic controller (721) controls the switch (726) to select an intra mode result for use by the residual calculator (723) and controls the entropy encoder (725) to select intra prediction information and include the intra prediction information in the bitstream; and if the prediction mode of the block is an inter mode, the generic controller (721) controls the switch (726) to select an inter prediction result for use by the residual calculator (723) and controls the entropy encoder (725) to select inter prediction information and include the inter prediction information in the bitstream.

[0080]

[0099] The residual calculator (723) may be configured to calculate a difference (residual data) between a received block and a prediction result for a block selected from the intra-encoder (722) or the inter-encoder (730). The residual encoder (724) may be configured to encode the residual data to generate transform coefficients. For example, the residual encoder (724) may be configured to transform the residual data from a spatial domain to a frequency domain to generate transform coefficients. The transform coefficients are then subjected to a quantization process to obtain quantized transform coefficients. In various embodiments, the video encoder (703) also includes a residual decoder (728). The residual decoder (728) is configured to perform an inverse transform to generate decoded residual data. The decoded residual data may be used by the intra-encoder (722) and the inter-encoder (730) as appropriate. For example, the inter-encoder (730) may generate decoded blocks based on the decoded residual data and the inter-prediction information, and the intra-encoder (722) may generate decoded blocks based on the decoded residual data and the intra-prediction information. The decoded blocks are appropriately processed to generate decoded pictures, which may be buffered in a memory circuit (not shown) and used as reference pictures.

[0081]

[0100] The entropy encoder (725) may be configured to format a bitstream to include the encoded blocks and perform entropy coding. The entropy encoder (725) may be configured to include various information in the bitstream. For example, the entropy encoder (725) may be configured to include general control data, selected prediction information (e.g., intra-prediction information or inter-prediction information), residual information, and other suitable information in the bitstream. Residual information may not be present when coding blocks in a merged sub-mode of either the inter mode or the bi-prediction mode.

[0082]

[0101] 8 shows a diagram of an exemplary video decoder (810) according to another embodiment of the present disclosure. The video decoder (810) is configured to receive coded pictures that are part of a coded video sequence and to decode the coded pictures to generate reconstructed pictures. In one example, the video decoder (810) may be used in place of the video decoder (410) in the example of FIG. 4.

[0083]

[0102] In the example of FIG. 8, the video decoder (810) includes an entropy decoder (871), an inter decoder (880), a residual decoder (873), a reconstruction module (874), and an intra decoder (872) coupled together as shown in the exemplary arrangement of FIG. 8.

[0084]

[0103] The entropy decoder (871) can be configured to reconstruct certain symbols from the coded picture that represent syntax elements from which the coded picture is constructed. Such symbols can include, for example, the mode in which the block is coded (e.g., intra mode, inter mode, bi-predictive mode, merged submode, or another submode), prediction information (e.g., intra prediction information or inter prediction information) that can identify certain samples or metadata used for prediction by the intra decoder (872) or the inter decoder (880), residual information (e.g., in the form of quantized transform coefficients), etc. In one example, if the prediction mode is an inter or bi-predictive mode, the inter prediction information is provided to the inter decoder (880); if the prediction type is an intra prediction type, the intra prediction information is provided to the intra decoder (872). The residual information can be inverse quantized and provided to the residual decoder (873).

[0085]

[0104] The inter decoder (880) can be configured to receive the inter prediction information and generate inter prediction results based on the inter prediction information.

[0086]

[0105] The intra decoder (872) may be configured to receive intra prediction information and generate a prediction result based on the intra prediction information.

[0087]

[0106] The residual decoder (873) may be configured to perform inverse quantization to extract un-quantized transform coefficients and process the un-quantized transform coefficients to transform the residual from the frequency domain to the spatial domain. The residual decoder (873) may also use certain control information (including a quantization parameter (QP)), which may be provided by the entropy decoder (871) (this may only be a small amount of control information, so a data path is not depicted).

[0088]

[0107] The reconstruction module (874) may be configured to combine, in the spatial domain, the residual as output by the residual decoder (873) and the prediction result (possibly output by an inter- or intra-prediction module) to form reconstructed blocks that form part of the reconstructed picture as part of the reconstructed video. It should be noted that other suitable processes, such as deblocking processes, may also be performed to improve visual quality.

[0089]

[0108] The video encoders (403), (603), and (703) and the video decoders (410), (510), and (810) may be implemented using any suitable technology. In some exemplary embodiments, the video encoders (403), (603), and (703) and the video decoders (410), (510), and (810) may be implemented using one or more integrated circuits. In other embodiments, the video encoders (403), (603), and (703) and the video decoders (410), (510), and (810) may be implemented using one or more processors executing software instructions.

[0090]

[0109] Returning to the intra prediction process, samples within a block (e.g., a luma or chroma prediction block, or a coding block if not further divided into prediction blocks) are predicted by samples of adjacent, next adjacent, or other line or lines, or a combination thereof, to generate a prediction block. The residual between the actual coded block and the prediction block is then processed by a transform followed by quantization. Various intra prediction modes may be available, and parameters regarding the selection of the intra mode and other parameters may be signaled in the bitstream. The various intra prediction modes may be associated, for example, with the line position(s) for which the samples are predicted, the direction along which the prediction samples are selected from the line(s), and other special intra prediction modes.

[0091]

[0110] For example, the set of intra-prediction modes (interchangeably referred to as "intra modes") may include a predefined number of directional intra-prediction modes. As described above in connection with the example implementation of FIG. 1, these intra-prediction modes may correspond to a predefined number of directions along which out-of-block samples are selected as predictions for samples predicted within a particular block. In another particular example implementation, eight main directional modes may be supported and predefined, corresponding to angles from 45 to 207 degrees relative to the horizontal axis.

[0092]

[0111] In some other implementations of intra prediction, the directional intra modes can be further extended to a set of angles with finer granularity to further exploit the greater variety of spatial redundancies in the directional texture. For example, the eight angle implementation described above can be configured to provide eight nominal angles, designated V_PRED, H_PRED, D45_PRED, D135_PRED, D113_PRED, D157_PRED, D203_PRED, and D67_PRED, as shown in FIG. 9, where a predefined number (e.g., 7) of finer angles may be added to each nominal angle. In such an extension, a larger total number of directional angles (e.g., 56 in this example) are available for intra prediction, corresponding to the same number of given directional intra modes. The prediction angle may be expressed by the nominal intra angle plus an angle delta. In the particular example above with seven finer angle directions for each nominal angle, the angle delta may be -3 to 3, multiplied by the step size of 3 degrees.

[0093]

[0112] The above directional intra-prediction may also be referred to as unidirectional intra-prediction, which is distinct from bi-directional intra-prediction (also referred to as intra-bidirectional prediction) described in a later part of this disclosure.

[0094]

[0113] In some implementations, alternatively or in addition to the above directional intra modes, a predetermined number of non-directional intra prediction modes may also be predefined and available. For example, five non-directional intra modes called smooth intra prediction modes may be specified. These non-directional intra mode prediction modes may be specifically called DC, PAETH, SMOOTH, SMOOTH_V, and SMOOTH_H intra modes. Prediction of samples of a particular block under these exemplary non-directional modes is shown in FIG. 10. As an example, FIG. 10 shows a 4x4 block 1002 predicted by samples from an upper-neighboring line and / or a left-neighboring line. A particular sample 1010 in block 1002 may correspond to sample 1004 directly above sample 1010 in the top-neighboring line of block 1002, sample 1006 above and to the left of sample 1010 as the intersection of the top and left-neighboring lines, and sample 1008 directly to the left of sample 1010 in the left-neighboring line of block 1002. For example, for a DC intra-prediction mode, the average of left and top neighboring samples 1008 and 1004 may be used as a predictor for sample 1010. For example, for a PAETH intra-prediction mode, the top, left, and top-left reference samples 1004, 1008, and 1006 may be taken, and then the value of these three reference samples that is closest to (top+left-top-left) may be set as the predictor for sample 1010. For example, for a SMOOTH_V intra-prediction mode, sample 1010 may be predicted by quadratic interpolation in the vertical direction of the top-left neighbor sample 1006 and the left neighbor sample 1008. For example, for a SMOOTH_H intra-prediction mode, sample 1010 may be predicted by quadratic interpolation in the horizontal direction of the top-left neighbor sample 1006 and the above neighbor sample 1004.For example, for SMOOTH_H intra prediction mode, sample 1010 can be predicted by an average of quadratic interpolations in the vertical and horizontal directions. The above implementation of the non-directional intra mode is merely illustrated as a non-limiting example. Other adjacent lines, other non-directional selections of samples, and methods of combining prediction samples to predict a particular sample in a prediction block are also possible.

[0095]

[0114] The selection of a particular intra-prediction mode by the encoder from the above directional or non-directional modes at various coding levels (picture, slice, block, unit, etc.) can be signaled in the bitstream. In some example implementations, the eight example nominal directional modes can be signaled first along with the five non-angle smooth modes (for a total of 13 options). Then, if the signaled mode is one of the eight nominal angle intra modes, an index is further signaled to specify the selected angle delta relative to the corresponding signaled nominal angle. In some other example implementations, all intra-prediction modes may be indexed together for signaling (e.g., 56 directional modes plus five non-directional modes resulting in 61 intra-prediction modes).

[0096]

[0115] In some example implementations, for example 56 or any other number of directional intra-prediction modes may be implemented using a unified directional predictor, which projects each sample of a block to a reference sub-sample location and interpolates the reference sample with a 2-tap bilinear filter.

[0097]

[0116] In some implementations, additional filter modes, called FILTER INTRA modes, may be designed to capture decaying spatial correlation with edge references. In these modes, samples predicted within a block in addition to out-of-block samples can be used as intra prediction reference samples for some patches within the block. These modes can, for example, be predefined and made available for intra prediction at least for the luma block (or only for the luma block). A predefined number (e.g., 5) of FILTER INTRA modes may be predesigned, each represented by a set of n-tap filters (e.g., 7-tap filters) that reflect the correlation between a 4x2 patch and its n neighboring samples, for example. In other words, the weighting coefficients of the n-tap filters may be position-dependent. As shown in FIG. 11, taking an 8x8 block, a 4x2 patch, and 7-tap filtering as an example, the 8x8 block 1102 can be divided into eight 4x2 patches. These patches are denoted in FIG. 11 by B0, B1, B1, B3, B4, B5, B6, and B7. For each patch, the seven neighbors of the patch, denoted in FIG. 11 by R0-R7, may be used to predict samples in the current patch. For patch B0, all neighbors may already be reconstructed. However, for other patches, some of the neighbors may be in the current block and therefore not reconstructed, and therefore predictions of immediate neighbors are used as reference. For example, as shown in FIG. 11, not all of the neighbors of patch B7 have been reconstructed, and therefore some of the predicted samples of the neighbors, e.g., B4, B5, and / or B6, are used instead.

[0098]

[0117] In some implementations of intra prediction, one color component may be predicted using one or more other color components. The color components may be any of the components in YCrCb, RGB, XYZ color space, etc. For example, prediction of a chroma component (e.g., a chroma block) from a luma component (e.g., a luma reference sample) may be called Chroma from Luma (CfL) and may be implemented. In some example implementations, cross-color prediction may only be allowed from luma to chroma. For example, the chroma samples in a chroma block may be modeled as a linear function of the luma samples with which they are reconstructed. CfL prediction may be implemented as follows:

[0099]

number

[0118] Here, L AC α denotes the AC contribution of the luma component, α is a parameter of the linear model, and DC denotes the DC contribution of the chroma component. The AC components are obtained, for example, for each sample of the block, while the DC components are obtained for the entire block. Specifically, the reconstructed luma samples can be subsampled to the chroma resolution, and then the average luma value (DC of luma) can be subtracted from each luma value to form the AC contribution in luma. The luma AC contributions are then used in the linear mode of Eq. (1) to predict the AC values ​​of the chroma components. Instead of requiring the decoder to calculate scaling parameters to approximate or predict the chroma AC components from the luma AC contributions, for example, an implementation of CfL may determine the parameter α based on the original chroma samples and signal them in the bitstream. This reduces the complexity of the decoder and results in a more accurate prediction. Regarding the DC contribution of the chroma components, this may be calculated using an intra DC mode in the chroma components in some exemplary implementations.

[0100]

[0119] Returning to the description of intra prediction, in some example implementations, prediction of a sample in a coding block or a prediction block may be based on one of a set of reference lines. In other words, instead of always using the closest neighboring line (e.g., the neighboring line immediately above or immediately to the left of the prediction block as shown in FIG. 1 above), multiple reference lines may be provided as selection options for intra prediction. Such an implementation of intra prediction may be referred to as Multiple Reference Line Selection (MRLS). In these implementations, the encoder determines and signals which reference line of the multiple reference lines is used to generate the intra predictor. At the decoder side, after analyzing the reference line index, it is possible to generate an intra prediction of the current intra prediction block by identifying a reconstructed reference sample by searching for the designated reference line according to the intra prediction mode (e.g., directional, non-directional, and other intra prediction modes). In some implementations, the reference line index may be signaled at the coding block level, and only one of the multiple reference lines may be selected and used for intra prediction of a coding block. In some examples, multiple reference lines may be selected together for intra prediction. For example, more than one reference line may be combined, averaged, interpolated, or in some other manner with or without weighting to generate a prediction. In some implementations, MRLS may only be applied to the luma component and not to the chroma components.

[0101]

[0120] In FIG. 12, an example of four reference lines MRLS is shown. As shown in the example of FIG. 12, an intra-coding block 1202 can be predicted based on one of four horizontal reference lines 1204, 1206, 1208, and 1210, and four vertical reference lines 1212, 1214, 1216, and 1218. Among these reference lines, 1210 and 1218 are immediate neighboring reference lines. The reference lines may be indexed according to their distance from the coding block. For example, the reference lines 1210 and 1218 may be referred to as zero reference lines, and the other reference lines may be referred to as non-zero reference lines. Specifically, Reference lines 1208 and 1216 may be referred to as first reference lines; Reference lines 1206 and 1214 may be referred to as second reference lines; Reference lines 1204 and 1212 may be referred to as third reference lines.

[0102]

[0121] In some embodiments, to improve video encoding / decoding performance, offset-based refinement for intra prediction (ORIP) may be used after generating intra prediction samples. When ORIP is applied, the prediction samples are refined by adding offset values.

[0103]

[0122] As shown in FIG. 13, intra prediction (1330) is performed based on reference samples. The reference samples may include samples from one or more left reference lines (1312) and / or one or more top reference lines (1310). Offset-based refinement for intra prediction (ORIP) may generate offset values ​​using nearby reference samples. In some implementations, the nearby reference samples for ORIP may be the same set as the reference samples for intra prediction. In some other implementations, the nearby reference samples for ORIP may be set differently from the reference samples for intra prediction.

[0104]

[0123] In some implementations related to Figures 14A and 14B, ORIP may be performed at the 4x4 sub-block level. For each 4x4 sub-block (1471, 1472, 1473, and / or 1474), an offset is generated from its neighboring samples. For example, for the first sub-block (1471), the offset is generated from its neighboring samples above (P1, P2, P3, and P4 in 1420), its neighboring samples to the left (P5, P6, P7, and P8 in 1410), and / or its neighboring sample to the top left (P0) (1401). In some implementations, the neighboring samples above may include both the neighboring samples above (P1, P2, P3, and P4 in 1420) and the neighboring sample to the top left (P0) (1401). In some other implementations, the left neighboring samples may include both the left neighboring samples (P5, P6, P7, and P8 in 1410) and the top left neighboring sample (P0) (1401).

[0105]

[0124] The first sub-block (1471) includes 4x4 pixels, where each pixel corresponds to predN, the Nth nearest prediction sample before refinement, e.g., pred0, pred1, pred2, ..., pred16.

[0106]

[0125] In various embodiments, the offset value for each pixel of a given sub-block can be calculated based on neighboring samples according to a formula, which may be a predefined formula or a formula specified by a parameter coded in the coded bitstream.

[0107]

[0126] In some implementations related to FIG. 14B , the offset value for the kth position of a given sub-block (offset(k)) may be generated as follows:

[0108]

number

[0127] W kn is a predefined weight for offset calculation. P n are the values ​​of the nearby samples (eg, P0, P1, P2, ..., P8). k is the predicted value for a pixel after application of intra prediction or other prediction (e.g., inter prediction). k is the refined value for a pixel after application of ORIP. clip3() is the clip3 math function. n is an integer between 0 and 8, inclusive. k is an integer between 0 and 15, inclusive.

[0109]

[0128] In some implementations, W kn may be predefined or may be obtained according to Table 1.

[0110] Table 1: Predefined weights for offset calculation

[0111]

number

[0129] In some other implementations, sub-block-based ORIP may only be applied for a predefined set of intra prediction modes and / or may be different for luma and chroma depending on the intra prediction mode. Table 2 shows an example implementation of sub-block-based ORIP with various intra prediction modes and either luma or chroma channels. Using the luma channel as an example: if the prediction mode is either DC or SMOOTH, ORIP is always ON and no additional signaling is required; if the prediction mode is HOR / VER and angle_delta is equal to 0, block-level signaling is required to enable / disable ORIP; and / or if the intra prediction mode is any other mode, ORIP is always OFF and no additional signaling is required.

[0112] Table 2: Mode-dependent ON / OFF of the proposed method

[0113]

number

[0130] Returning to the description of the second 4x4 sub-block (1473), due to its position relative to the first 4x4 sub-block (1471), the samples in the vicinity of the second sub-block may be several pixels of the first sub-block; P1 of the second sub-block may be pred12 of the first sub-block, P2 of the second sub-block may be pred13 of the first sub-block, P3 of the second sub-block may be pred14 of the first sub-block, P4 of the second sub-block may be pred15 of the first sub-block. The top-left neighboring sample (P0) of the second sub-block may be the left neighboring sample (P8) of the first sub-block.

[0114]

[0131] There may be some issues / problems associated with some ORIP implementations. For example, if the intra prediction mode of the luma component of a block is either a vertical or horizontal intra prediction mode, there may be three different options: 1) Selecting an adjacent reference line and applying ORIP to the block; 2) Select an adjacent reference line and do not apply ORIP to the block; and / or 3) Select a non-adjacent reference line and do not apply ORIP to the block. Since the reference samples from adjacent and non-adjacent reference lines may usually be similar, there may be some redundancy between option 2) and option 3, which may degrade the video encoding / decoding performance.

[0115]

[0132] This disclosure describes various embodiments related to offset refinement for intra prediction and multi-reference line intra prediction in video encoding and / or decoding, which addresses at least one of the challenges / problems discussed above.

[0116]

[0133] In various embodiments, referring to FIG. 15, an offset refinement method 1500 for intra prediction and multiple reference line intra prediction in video decoding is shown, and the method 1500 may include all or some of the following steps: step S1510, a device having a memory for storing instructions and a processor in communication with the memory receiving a coded video bitstream for a block; step S1520, the device determining whether offset refinement for intra prediction is applied to the block based on mode information of the block, the mode information of the block including at least one of a reference line index of the block, an intra prediction mode of the block, and a size of the block; step S1530, in response to a determination that offset refinement for intra prediction is applied to the block, the device performing offset refinement to generate an intra predictor for intra prediction of the block. In some implementations, step 1520 may include the device determining whether offset refinement for intra prediction is applied to the block based on mode information of the block, where the mode information of the block includes at least one of a reference line index of the block, an intra prediction mode of the block, or a size of the block.

[0117]

[0134] In various embodiments of this disclosure, the size of a block (e.g., but not limited to, a coding block, a prediction block, or a transform block) may refer to the width or height of the block, which may be an integer number of pixels.

[0118]

[0135] In various embodiments of this disclosure, the size of a block (e.g., but not limited to, a coding block, a prediction block, or a transform block) may refer to the area size of the block, which may be an integer calculated in pixels as the width of the block multiplied by the height of the block.

[0119]

[0136] In various embodiments of this disclosure, the size of a block (e.g., but not limited to, a coding block, a prediction block, or a transform block) may refer to the maximum width or height of the block, the minimum width or height of the block, or the aspect ratio of the block, which may be calculated as the width of the block divided by the height, or the height of the block divided by the width.

[0120]

[0137] In this disclosure, a reference line index designates a reference line among a plurality of reference lines. In various embodiments, a reference line index of 0 for a block may indicate a neighboring reference line for the block, which is also the closest reference line to the block. For example, referring to block (1202) in FIG. 12, the top reference line (1210) is the top neighboring reference line for block (1202), which is also the top closest reference line to the block; the left reference line (1218) is the left neighboring reference line for block (1202), which is also the left closest reference line to the block. A reference line index greater than 0 for a block indicates a non-nearest reference line for the block, which is the non-nearest reference line to the block. For example, referring to block (1202) in FIG. 12, The reference line index being 1 may indicate the top reference line (1208) and / or the left reference line (1216); The reference line index, which is 2, may indicate the top reference line (1206) and / or the left reference line (1214); and / or The reference line index, which is 3, can indicate the top reference line (1204) and / or the left reference line (1212).

[0121]

[0138] In various embodiments for video coding and / or decoding, when a directional intra-prediction mode is selected for a block (e.g., a coding block or a coded block) to generate an intra-predictor from samples in a non-adjacent reference line, it may be possible to determine whether or not offset refinement for intra-prediction (ORIP) is applied to the block. This determination may depend on mode information of the block, which may include, but is not limited to, a reference line index, one or more intra-prediction angles, and / or a size(s) of the block. When this determination is made based on the mode information of the block, no additional signaling is required to indicate whether or not ORIP is applied, reducing overhead in the video encoding / decoding process and / or improving video encoding / decoding performance. In various embodiments, offset refinement for intra-prediction (ORIP) may refer to offset-based refinement for intra-prediction, which is a type of intra-prediction in which a prediction result is further refined (or modified) according to an offset value generated based on one or more nearby reference samples.

[0122]

[0139] Referring to step 1510, the device may be the electronic device (530) of FIG. 5 or the video decoder (810) of FIG. 8. In some implementations, the device may be a decoder (633) in the encoder (620) of FIG. 6. In other implementations, the device may be part of the electronic device (530) of FIG. 5, part of the video decoder (810) of FIG. 8, or part of the decoder (633) in the encoder (620) of FIG. 6. The coded video bitstream may be a coded video sequence of FIG. 8, intermediate coded data of FIG. 6 or FIG. 7. A block may refer to a coding block or a coded block.

[0123]

[0140] Referring to step 1520, the device may determine whether offset refinement for intra prediction is applied to a block based on mode information of the block, which may include at least one of a reference line index of the block, an intra prediction mode of the block, and a size of the block.

[0124]

[0141] In various embodiments, step 1520 may include determining that offset refinement for intra prediction is applied to the block in response to the block's reference line index being smaller than a predefined threshold and the block's intra prediction mode belonging to a directional intra prediction mode; and / or determining that offset refinement for intra prediction is not applied to the block in response to the block's reference line index being not smaller than a predefined threshold or the block's intra prediction mode belonging to a directional intra prediction mode.

[0125]

[0142] In some implementations, for a set of directional intra-prediction modes, if the value of the reference line index is less than a predetermined value, then the ORIP is always applied; and / or if the value of the reference line index is greater than or equal to the predetermined value, then the ORIP is never applied. In one example, the set of directional intra-prediction modes includes vertical and horizontal modes. In another example, the set of directional intra-prediction modes includes vertical, horizontal, 45 degree, and 135 degree directional modes. In another example, the predetermined value is N and is set to 1. In another example, N is set to 2. In another example, N is set to 0 or 3.

[0126]

[0143] In various embodiments, step 1520 may include determining that offset refinement for intra prediction is applied to the block in response to the block's reference line index being even and the block's intra prediction mode belonging to a directional intra prediction mode; and / or determining that offset refinement for intra prediction is not applied to the block in response to the block's reference line index being odd and the block's intra prediction mode belonging to a directional intra prediction mode.

[0127]

[0144] In some implementations, for a set of directional intra prediction modes, the determination of whether ORIP is applied depends on whether the value of the reference line index is even or odd. In one example, for a set of directional intra prediction modes, if the value of the reference line index is even, ORIP is applied; if the value of the reference line index is odd, ORIP is not applied. In another example, for a set of directional intra prediction modes, if the value of the reference line index is odd, ORIP is applied; if the value of the reference line index is even, ORIP is not applied. In another example, the set of directional intra prediction modes includes a vertical mode and a horizontal mode. In another example, the set of directional intra prediction modes includes vertical, horizontal, 45 degree, and 135 degree directional modes.

[0128]

[0145] In various embodiments, step 1520 may include determining that an offset refinement for intra prediction is applied to the block in response to the intra prediction mode of the block belonging to a first selected set of intra prediction modes; determining that an offset refinement for intra prediction is applied to the block in response to the intra prediction mode of the block belonging to a second selected set of intra prediction modes and the reference line index indicating a neighboring reference line; and / or determining that an offset refinement for intra prediction is not applied to the block in response to the intra prediction mode of the block belonging to the second selected set of intra prediction modes and the reference line index indicating a non-neighboring reference line. In some implementations, the first selected set of intra prediction modes does not overlap with the second selected set of intra prediction modes. In some other implementations, the first selected set of intra prediction modes may include a diagonal intra prediction mode.

[0129]

[0146] In some implementations, for a selected set of intra-prediction modes, ORIP is applied to both adjacent and non-adjacent reference lines, while for the remaining set of intra-prediction modes, ORIP is applied only to adjacent reference lines. In one example, when intra-prediction is applied by using only integer samples, e.g., for diagonal (45 / 225 degree) intra-prediction modes, ORIP may also be applied to non-adjacent reference lines; and / or when intra-prediction does not use integer samples, ORIP is applied only to adjacent reference lines.

[0130]

[0147] In various embodiments, step 1520 may include determining that offset reference for intra prediction is applied to the block if the intra prediction mode of the block belongs to a directional intra prediction mode and the reference line index of the block indicates a non-adjacent reference line.

[0131]

[0148] In some implementations, step 1520 may further include using the mode information of the block as a parameter context for offset refinement for intra prediction during entropy decoding.

[0132]

[0149] In some other implementations, when a directional intra-prediction mode is selected for a block and an intra-predictor is generated from samples in non-adjacent reference lines, the ORIP may still be applicable and / or the ORIP may be signaled by a parameter in the coded bitstream (e.g., an ORIP flag or an ORIP index) regardless of the value of the block's mode information.

[0133]

[0150] In some other implementations, during video encoding, the context used for entropy coding of the ORIP parameters (e.g., flags / indexes) indicating whether and how ORIP is applied depends on the mode information of the current block. In some implementations, the context for entropy coding of the syntax values ​​indicating whether and how other modes of the current block are applied depends on the ORIP flags / indexes indicating whether and how ORIP is applied to the block. Examples of syntax for other modes of the current block include, but are not limited to, a reference line index, one or more intra prediction angles, and / or a size of the block.

[0134]

[0151] Referring to step 1530, in response to determining that offset refinement for intra prediction is applied to the block, the device performs offset refinement for intra prediction on the block. In some implementations, the block is a 4x4 block or includes multiple 4x4 blocks, and offset refinement for intra prediction is performed on the block according to a predetermined method, such as the method described above with reference to Eq. (2) and Eq. (3).

[0135]

[0152] In various embodiments, step 1530 may include determining a predictor from a non-adjacent reference line specified by a reference line index of the block; determining a predicted value of the block according to intra prediction based on the predictor; and / or modifying the predicted value according to offset refinement for intra prediction based on samples from the adjacent reference lines. In some implementations, the non-adjacent reference line and the adjacent reference line are from two sides; the two sides include an upper side and a left side.

[0136]

[0153] In some implementations, when ORIP is applied to generate an intra predictor from samples in non-adjacent reference lines, a predictor (e.g., predictor A) is generated from samples in a non-adjacent reference line selected by the MRLS, and then ORIP further modifies the predicted value from predictor A by using samples from adjacent reference lines.

[0137]

[0154] In some other implementations, the reference samples used to generate predictor A and further modify the value of the predictor from (or based on) predictor A are from different sides of the nearby reference samples. Examples of sides of nearby reference samples include, but are not limited to, upper reference samples and left reference samples. In one example, one or more upper reference samples are used to generate predictor A and one or more left reference samples are used to modify the value of the predictor from (or based on) predictor A. In another example, one or more left reference samples are used to generate predictor A and one or more upper reference samples are used to modify the value of the predictor from (or based on) predictor A.

[0138]

[0155] In various embodiments, step 1530 may include determining a predictor from a non-adjacent reference line specified by a reference line index for the block; determining a predicted value for the block according to intra prediction based on the predictor; and / or refining the predicted value according to offset refinement for intra prediction based on a plurality of samples from a plurality of reference lines.

[0139]

[0156] In some implementations, step 1530 may further include using a linear weighted average to obtain a sample based on a plurality of samples and corresponding weights, the corresponding weights being predetermined according to the relative positions of the samples.

[0140]

[0157] In some other implementations, when ORIP is applied, to generate an intra predictor from samples in non-adjacent reference lines, the predicted samples are refined by ORIP using samples from multiple (more than one) reference lines. In one example, ORIP is generated using a linear weighted sum of samples from multiple reference lines, with the weights being predetermined according to the relative positions of the samples.

[0141]

[0158] The embodiments of the present disclosure may be used separately or in combination in any order. Furthermore, each method (or embodiment), encoder, and decoder may be implemented by processing circuitry (e.g., one or more processors, or one or more integrated circuits). In one example, the one or more processors execute a program stored on a non-transitory computer-readable medium. The embodiments of the present disclosure may be applied to a luma block or a chroma block; in a chroma block, the embodiments may be applied to two or more color components separately or to two or more color components together.

[0142]

[0159] In the present disclosure, any steps or processes in the various embodiments may be combined in any amount or order as desired. In the present disclosure, two or more steps or processes in the various embodiments may be performed in parallel.

[0143]

[0160] The techniques described above may be implemented as computer software using computer readable instructions and may be physically stored on one or more computer readable media. For example, Figure 16 illustrates a computer system (2600) suitable for implementing certain embodiments of the disclosed subject matter.

[0144]

[0161] Computer software may be coded using any suitable machine code or computer language that may be subject to assembly, compilation, linking, or similar mechanisms to produce code that contains instructions that may be executed directly by one or more computer central processing units (CPUs), graphics processing units (GPUs), etc., or instructions that may be executed via interpretation, microcode execution, etc.

[0145]

[0162] The instructions may be executed on various types of computers or components thereof, including, for example, personal computers, tablet computers, servers, smartphones, gaming devices, Internet of Things devices, etc.

[0146]

[0163] 16 with respect to the computer system (2600) are exemplary in nature and are not intended to suggest any limitations on the scope of use or functionality of the computer software implementing the embodiments of the present disclosure, nor should the arrangement of components be interpreted as having any dependency or requirement regarding any one or combination of components illustrated in the exemplary embodiment of the computer system (2600).

[0147]

[0164] The computer system (2600) may include certain human interface input devices that may be responsive to input by one or more human users, for example, via tactile input (e.g., keystrokes, swipes, data glove movements), auditory input (e.g., voice, clapping), visual input (e.g., gestures), or olfactory input (not shown). Human interface devices may also be used to capture certain media that are not necessarily directly related to conscious human input, such as audio (e.g., speech, music, ambient sounds), images (e.g., scanned images, photographic images obtained from still image cameras), and video (e.g., two-dimensional video, three-dimensional video including stereoscopic pictures).

[0148]

[0165] The input human interface devices may include one or more of (although only one of each is depicted) a keyboard (2601), a mouse (2602), a trackpad (2603), a touch screen (2610), a data glove (not shown), a joystick (2605), a microphone (2606), a scanner (2607), and a camera (2608).

[0149]

[0166] The computer system (2600) may also include certain human interface output devices that may stimulate one or more of the senses of a human user, for example, through tactile output, sound, light, and smell / taste. Such human interface output devices may include haptic output devices (e.g., haptic feedback via a touch screen (2610), data gloves (not shown), joystick (2605), although there may be haptic feedback devices that do not serve as input), auditory output devices (e.g., speakers (2609), headphones (not shown)), visual output devices (e.g., screens (2610), including CRT screens, LCD screens, plasma screens, OLED screens, each with or without touch screen input capability, each with or without haptic feedback capability, some of which may be capable of outputting two-dimensional visual output, three or more dimensional output by means such as stereoscopic output; virtual reality glasses (not shown), holographic displays, and smoke tanks (not shown)), and printers (not shown).

[0150]

[0167] The computer system (2600) may also include human accessible storage devices and their associated media, such as optical media including CD / DVD ROM / RW (2620) using media such as CD / DVD (2621), thumb drives (2622), removable hard drives or solid state drives (2623), legacy magnetic media (not shown) such as tapes and floppy disks (not shown), and specialized ROM / ASIC / PLD based devices such as security dongles (not shown).

[0151]

[0168] Those skilled in the art will also understand that the term "computer-readable medium" as used in connection with the subject matter disclosed herein does not encompass transmission media, carrier waves, or other transitional signals.

[0152]

[0169] The computer system (2600) may also include a network interface (2654) to one or more communication networks (2655). The networks may be, for example, wireless, wired, or optical. The networks may further be local, wide area, metropolitan, vehicular and industrial, real-time, delay tolerant, etc. Examples of networks include Ethernet, wireless LANs, cellular networks (including GSM, 3G, 4G, 5G, LTE, etc.), TV wired or wireless wide area digital networks (including cable TV, satellite TV, and terrestrial TV), vehicular and industrial including CANBus, etc. Certain networks typically require an external network interface adapter that is attached to a particular general-purpose data port or peripheral bus (2649) (e.g., a USB port on the computer system (2600)); others are typically integrated into the core of the computer system (2600) by attaching to a system bus as described below (e.g., an Ethernet interface is integrated in a PC computer system, a cellular network interface is integrated in a smartphone computer system). Using any of these networks, the computer system (2600) can communicate with other entities. Such communications can be one-way receive only (e.g., broadcast television), one-way transmit only (e.g., CANbus to certain CANbus devices), or bi-directional, such as to other computer systems using local or wide area digital networks. Specific protocols and protocol stacks can be used with each of these networks and network interfaces, as described above.

[0153]

[0170] The aforementioned human interface devices, human accessible storage devices, and network interfaces may be attached to a core (2640) of the computer system (2600).

[0154]

[0171] The core (2640) may include one or more central processing units (CPUs) (2641), graphics processing units (GPUs) (2642), specialized programmable processing devices in the form of field programmable gate arrays (FPGAs) (2643), hardware accelerators for specific tasks (2644), graphics adapters (2650), etc. These devices may be connected via a system bus (2648), along with read only memory (ROM) (2645), random access memory (2646), and internal mass storage devices (e.g., internal non-user accessible hard drives, SSDs, etc.) (2647). In some computer systems, the system bus (2648) may be accessible in the form of one or more physical plugs to allow expansion with additional CPUs, GPUs, etc. Peripheral devices may be attached directly to the core's system bus (2648) or via a peripheral bus (2649). In one example, a screen (2610) may be connected to a graphics adapter (2650). Peripheral bus architectures include PCI, USB, etc.

[0155]

[0172] The CPU (2641), GPU (2642), FPGA (2643), and accelerator (2644) may combine to execute certain instructions that may constitute the aforementioned computer code. The computer code may be stored in a ROM (2645) or a RAM (2646). Temporary data may be stored in the RAM (2646), while persistent data may be stored in, for example, an internal mass storage (2647). Fast storage and retrieval from any memory device may be made possible by utilizing a cache memory, which may be closely associated with one or more of the CPU (2641), GPU (2642), mass storage (2647), ROM (2645), RAM (2646), etc.

[0156]

[0173] The computer-readable medium can have computer code thereon for performing various computer-implemented operations. The medium and computer code can be specially designed and constructed for the purposes of the present disclosure, or they can be of the kind well known and available to those having skill in the computer software arts.

[0157]

[0174] As a non-limiting example, a computer system having the architecture (2600), specifically the core (2640), as a result of a processor (including a CPU, GPU, FPGA, accelerator, etc.), can provide the functionality to execute software embodied in one or more tangible computer-readable media. Such computer-readable media can be media associated with user-accessible mass storage as described above, as well as specific storage of the core (2640) of a non-transitory nature, such as mass storage (2647) within the core or ROM (2645). Software implementing various embodiments of the present disclosure can be stored in such devices and executed by the core (2640). The computer-readable media can include one or more memory devices or chips, depending on the particular needs. The software can cause the core (2640), specifically the processor (including a CPU, GPU, FPGA, etc.) therein, to execute certain processes or certain parts of certain processes described herein, including defining data structures stored in RAM (2646) and modifying such data structures according to processes defined by the software. Additionally or alternatively, a computer system may provide functionality as a result of logic hardwired or otherwise embodied in circuitry (e.g., accelerator (2644)) that may perform in place of or in conjunction with software to perform particular processes or portions of particular processes described herein. References to software include logic, and vice versa, where appropriate. References to computer-readable media may include circuitry (such as an integrated circuit (IC)) that stores software for execution, circuitry embodying logic for execution, or both, as appropriate. The present disclosure encompasses any appropriate combination of hardware and software.

[0158]

[0175] Although a particular invention has been described in connection with exemplary embodiments, the description is not intended to be limiting. Various modifications of the exemplary and additional embodiments of the invention will be apparent to those skilled in the art from this description. Those skilled in the art will readily appreciate that these and various other modifications may be made to the exemplary embodiments shown and described herein without departing from the spirit and scope of the invention. It is therefore envisaged that the appended claims will cover any such modifications and alternative embodiments. Certain proportions in the figures may be exaggerated, while others may be minimized. Thus, the present disclosure and drawings are to be interpreted as illustrative rather than limiting.

Claims

[Claim 1] 1. A method for offset refinement for intra prediction and multiple reference line intra prediction in video decoding, comprising: A device having a memory storing instructions and a processor in communication with the memory receives a coded video bitstream for a block; determining, by the device, whether offset refinement for intra prediction is applied to the block based on mode information of the block, the mode information of the block including at least one of a reference line index of the block, an intra prediction mode of the block, and a size of the block; in response to determining that offset refinement for the intra prediction is applied to the block, the device performing the offset refinement to generate an intra predictor for intra prediction of the block; The method includes:

Citation Information

Patent Citations

  • Video signal encoding and decoding methods and apparatus

    JP2022504552A

  • Method and apparatus for intra prediction

    JP2022526304A

  • Image encoding / decoding method and device for performing PDPC, and bitstream transmission method

    JP2023508178A

  • Method and apparatus for processing video signal

    US20200053385A1

  • Method for encoding / decoding image signal and device for same

    US20220094912A1