Method and apparatus for video coding

Abstract

Aspects of the disclosure provide methods and apparatuses for video encoding/decoding. Processing circuitry decodes prediction information of a block from a coded video bitstream. The prediction information is indicative of a matrix based intra prediction for the block. The processing circuitry determines entries of a vector based on neighboring samples of the block. An entry can be determined based on one or more neighboring samples of the block. The processing circuitry converts the entries into a reduced bit form with a number of bits satisfying a requirement of using a first multiplication tool that processes fewer bits than a second multiplication tool. Then, the processing circuitry multiplies, using the first multiplication tool, the entries of the vector in the reduced bit form with entries of a matrix to calculate a subset of prediction samples of the block, and determines other prediction samples of the block based on the subset.

Description

TECHNICAL FIELD

The present disclosure describes embodiments generally related to video coding.

BACKGROUND

The background description provided herein is for the purpose of generally presenting the context of the disclosure. Work of the presently named inventors, to the extent the work is described in this background section, as well as aspects of the description that may not otherwise qualify as prior art at the time of filing, are neither expressly nor impliedly admitted as prior art against the present disclosure.

Video coding and decoding can be performed using inter-picture prediction with motion compensation. Uncompressed digital video can include a series of pictures, each picture having a spatial dimension of, for example, 1920×1080 luminance samples and associated chrominance samples. The series of pictures can have a fixed or variable picture rate (informally also known as frame rate), of, for example 60 pictures per second or 60 Hz. Uncompressed video has specific bitrate requirements. For example, 1080p60 4:2:0 video at 8 bit per sample (1920×1080 luminance sample resolution at 60 Hz frame rate) requires close to 1.5 Gbit/s bandwidth. An hour of such video requires more than 600 GBytes of storage space.

One purpose of video coding and decoding can be the reduction of redundancy in the input video signal, through compression. Compression can help reduce the aforementioned bandwidth and/or storage space requirements, in some cases by two orders of magnitude or more. Both lossless compression and lossy compression, as well as a combination thereof can be employed. Lossless compression refers to techniques where an exact copy of the original signal can be reconstructed from the compressed original signal. When using lossy compression, the reconstructed signal may not be identical to the original signal, but the distortion between original and reconstructed signals is small enough to make the reconstructed signal useful for the intended application. In the case of video, lossy compression is widely employed. The amount of distortion tolerated depends on the application; for example, users of certain consumer streaming applications may tolerate higher distortion than users of television distribution applications. The compression ratio achievable can reflect that: higher allowable/tolerable distortion can yield higher compression ratios.

A video encoder and decoder can utilize techniques from several broad categories, including, for example, motion compensation, transform, quantization, and entropy coding.

Video codec technologies can include techniques 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, the picture is spatially subdivided into blocks of samples. When all blocks of samples are coded in intra mode, that picture can be an intra picture. Intra pictures and their derivations such as independent decoder refresh pictures, can be used to reset the decoder state and can, therefore, be used as the first picture in a coded video bitstream and a video session, or as a still image. The samples of an intra block can be exposed to a transform, and the transform coefficients can be quantized before entropy coding. Intra prediction can be a technique that minimizes sample values in the pre-transform domain. In some cases, the smaller the DC value after a transform is, and the smaller the AC coefficients are, the fewer the bits that are required at a given quantization step size to represent the block after entropy coding.

Traditional intra coding such as known from, for example MPEG-2 generation coding technologies, does not use intra prediction. However, some newer video compression technologies include techniques that attempt, from, for example, surrounding sample data and/or metadata obtained during the encoding/decoding of spatially neighboring, and preceding in decoding order, blocks of data. Such techniques are henceforth called “intra prediction” techniques. Note that in at least some cases, intra prediction is using reference data only from the current picture under reconstruction and not from reference pictures.

There can be many different forms of intra prediction. When more than one of such techniques can be used in a given video coding technology, the technique in use can be coded in an intra prediction mode. In certain cases, modes can have submodes and/or parameters, and those can be coded individually or included in the mode codeword. Which codeword to use for a given mode/submode/parameter combination can have an impact in the coding efficiency gain through intra prediction, and so can the entropy coding technology used to translate the codewords into a bitstream.

A certain mode of intra prediction was introduced with H.264, refined in H.265, and further refined in newer coding technologies such as joint exploration model (JEM), versatile video coding (VVC), and benchmark set (BMS). A predictor block can be formed using neighboring sample values belonging to already available samples. Sample values of neighboring samples are copied into the predictor block according to a direction. A reference to the direction in use can be coded in the bitstream or may itself be predicted.

Referring to FIG. 1, depicted in the lower right is a subset of nine predictor directions known from H.265's 33 possible predictor directions (corresponding to the 33 angular modes of the 35 intra modes). The point where the arrows converge (101) represents the sample being predicted. The arrows represent the direction from which the sample is being predicted. For example, arrow (102) indicates that sample (101) is predicted from a sample or samples to the upper right, at a 45 degree angle from the horizontal. Similarly, arrow (103) indicates that sample (101) is predicted from a sample or samples to the lower left of sample (101), in a 22.5 degree angle from the horizontal.

Still referring to FIG. 1, on the top left there is depicted a square block (104) of 4×4 samples (indicated by a dashed, boldface line). The square block (104) includes 16 samples, each labelled with an “S”, 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 in the Y dimension (from the top) and the first (from the left) sample in the X dimension. Similarly, sample S44 is the fourth sample in block (104) in both the Y and X dimensions. As the block is 4×4 samples in size, S44 is at the bottom right. Further shown are reference samples that follow a similar numbering scheme. A reference sample is labelled with an R, its Y position (e.g., row index) and X position (column index) relative to block (104). In both H.264 and H.265, prediction samples neighbor the block under reconstruction; therefore no negative values need to be used.

Intra picture prediction can work by copying reference sample values from the neighboring samples as appropriated by the signaled prediction direction. For example, assume the coded video bitstream includes signaling that, for this block, indicates a prediction direction consistent with arrow (102)—that is, samples are predicted from a prediction sample or samples to the upper right, at a 45 degree angle from the horizontal. In that case, samples S41, S32, S23, and S14 are predicted from the same reference sample R05. Sample S44 is then predicted from reference sample R08.

In certain cases, the values of multiple reference samples may be combined, for example through interpolation, in order to calculate a reference sample; especially when the directions are not evenly divisible by 45 degrees.

The number of possible directions has increased as video coding technology has developed. In H.264 (year 2003), nine different direction could be represented. That increased to 33 in H.265 (year 2013), and JEM/VVC/BMS, at the time of disclosure, can support up to 65 directions. Experiments have been conducted to identify the most likely directions, and certain techniques in the entropy coding are used to represent those likely directions in a small number of bits, accepting a certain penalty for less likely directions. Further, the directions themselves can sometimes be predicted from neighboring directions used in neighboring, already decoded, blocks.

FIG. 2 shows a schematic (201) that depicts 65 intra prediction directions according to JEM to illustrate the increasing number of prediction directions over time.

The mapping of intra prediction directions bits in the coded video bitstream that represent the direction can be different from video coding technology to video coding technology; and can range, for example, from simple direct mappings of prediction direction to intra prediction mode, to codewords, to complex adaptive schemes involving most probable modes, and similar techniques. In all cases, however, there can be certain directions that are statistically less likely to occur in video content than certain other directions. As the goal of video compression is the reduction of redundancy, those less likely directions will, in a well working video coding technology, be represented by a larger number of bits than more likely directions.

SUMMARY

Aspects of the disclosure provide methods and apparatuses for video encoding/decoding. In some examples, an apparatus for video decoding includes receiving circuitry and processing circuitry. The processing circuitry decodes prediction information of a block from a coded video bitstream. The prediction information is indicative of a matrix based intra prediction for the block. Then, the processing circuitry determines entries of a vector based on neighboring samples of the block. In an example, each entry is determined based on one or more neighboring samples of the block. The processing circuitry converts the entries of the vector into a reduced bit form with a number of bits satisfying a requirement of using a first multiplication tool that processes fewer bits than a second multiplication tool. Then, the processing circuitry multiplies, using the first multiplication tool, the entries of the vector in the reduced bit form with entries of a matrix to calculate a subset of prediction samples of the block, and determines other prediction samples of the block based on the subset of the prediction samples of the block.

In some embodiments, the processing circuitry performs at least one of right shifting an entry by one or more bits and clipping the entry to a range corresponding to fewer bits.

In an embodiment, the processing circuitry right shifts the entries of the vector by a number of bits and modifies, based on the number of bits, a weight shifting variable that is used for aligning multiplication results.

In some embodiments, the processing circuitry uses a filtering tool to determine the entries of the vector based on the neighboring samples of the block, the filtering tool being used in a non-matrix based intra prediction. In some embodiments, the processing circuitry selects a subset of the neighboring samples of the block as the entries of the vector based on positions of the neighboring samples with reference to the block. In an embodiment, the processing circuitry filters first neighboring samples on a first side of the block to determine a first portion of the entries of the vector, and selects a second portion of the entries of the vector from second neighboring samples on a second side of the block.

In an embodiment, the processing circuitry sets one or more other prediction samples between two prediction samples in the subset to be an average of the two samples.

In some examples, the processing circuitry modifies a factor parameter to have a power of two value. The factor parameter is used to unify the entries of the matrix to have a same sign.

In some embodiments, the number of bits to shift is determined based on at least one of an internal bit depth, a signal in a high level syntax, and a look-up table. In an example, the processing circuitry decodes a lookup table from a high level syntax. The lookup table associates shifting bits with internal bit depths. The processing circuitry determines the number of bits from the lookup table.

Aspects of the disclosure also provide a non-transitory computer-readable medium storing instructions which when executed by a computer for video decoding cause the computer to perform the method for video decoding.

BRIEF DESCRIPTION OF THE DRAWINGS

Further features, the nature, and various advantages of the disclosed subject matter will be more apparent from the following detailed description and the accompanying drawings in which:

FIG. 1 is a schematic illustration of an exemplary subset of intra prediction modes.

FIG. 2 is an illustration of exemplary intra prediction directions.

FIG. 3 is a schematic illustration of a simplified block diagram of a communication system (300) in accordance with an embodiment.

FIG. 4 is a schematic illustration of a simplified block diagram of a communication system (400) in accordance with an embodiment.

FIG. 5 is a schematic illustration of a simplified block diagram of a decoder in accordance with an embodiment.

FIG. 6 is a schematic illustration of a simplified block diagram of an encoder in accordance with an embodiment.

FIG. 7 shows a block diagram of an encoder in accordance with another embodiment.

FIG. 8 shows a block diagram of a decoder in accordance with another embodiment.

FIG. 9 shows an illustration of intra prediction directions and the intra prediction modes in some examples.

FIG. 10 shows another illustration of intra prediction directions and intra prediction modes in some examples.

FIG. 11 shows a diagram illustrating a first step of matrix based intra prediction in some examples.

FIG. 12 shows a diagram illustrating a second step of matrix based intra prediction in some examples.

FIG. 13 shows a diagram illustrating a third step of matrix based intra prediction in some examples.

FIG. 14 shows a diagram of a current block having a size of 8×8 and neighboring samples.

FIG. 15 shows a diagram of a current block having a size of 16×16 and neighboring samples.

FIG. 16 shows a flow chart outlining a process example according to an embodiment of the disclosure.

FIG. 17 is a schematic illustration of a computer system in accordance with an embodiment.

DETAILED DESCRIPTION OF EMBODIMENTS

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 that can communicate with each other, via, for example, 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 FIG. 3 example, the first pair of terminal devices (310) and (320) performs unidirectional transmission of data. For example, the terminal device (310) may code video data (e.g., a stream of video pictures that are captured by the terminal device (310)) for transmission to the other terminal device (320) via the network (350). The encoded video data can be transmitted in the form of one or more coded video bitstreams. The terminal device (320) may receive the coded video data from the network (350), decode the coded video data to recover the video pictures and display video pictures according to the recovered video data. Unidirectional data transmission may be common in media serving applications and the like.

In another example, the communication system (300) includes a second pair of terminal devices (330) and (340) that performs bidirectional transmission of coded video data that may occur, for example, during videoconferencing. For bidirectional transmission of data, in an example, each terminal device of the terminal devices (330) and (340) may code video data (e.g., a stream of video pictures that are captured by the terminal device) for transmission to the other terminal device of the terminal devices (330) and (340) via the network (350). Each terminal device of the terminal devices (330) and (340) also may receive the coded video data transmitted by the other terminal device of the terminal devices (330) and (340), and may decode the coded video data to recover the video pictures and may display video pictures at an accessible display device according to the recovered video data.

In the FIG. 3 example, the terminal devices (310), (320), (330) and (340) may be illustrated as servers, personal computers and smart phones but the principles of the present disclosure may be not so limited. Embodiments of the present disclosure find application with laptop computers, tablet computers, media players and/or dedicated video conferencing equipment. The network (350) represents any number of networks that convey coded video data among the terminal devices (310), (320), (330) and (340), including for example wireline (wired) and/or wireless communication networks. The communication network (350) may exchange data in circuit-switched and/or packet-switched channels. Representative networks include telecommunications networks, local area networks, wide area networks and/or the Internet. For the purposes of the present discussion, the architecture and topology of the network (350) may be immaterial to the operation of the present disclosure unless explained herein below.

FIG. 4 illustrates, as an example for an application for the disclosed subject matter, the placement of a video encoder and a video decoder in a streaming environment. The disclosed subject matter can be equally applicable to other video enabled applications, including, for example, video conferencing, digital TV, storing of compressed video on digital media including CD, DVD, memory stick and the like, and so on.

A streaming system may include a capture subsystem (413), that can include a video source (401), for example a digital camera, creating for example a stream of video pictures (402) that are uncompressed. In an example, the stream of video pictures (402) includes samples that are taken by the digital camera. The stream of video pictures (402), depicted as a bold line to emphasize a high data volume when compared to encoded video data (404) (or coded video bitstreams), can be processed by an electronic device (420) that includes a video encoder (403) coupled to the video source (401). The video encoder (403) can 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 a thin line to emphasize the lower data volume when compared to the stream of video pictures (402), can be stored on a streaming server (405) for future use. One or more streaming client subsystems, such as client subsystems (406) and (408) in FIG. 4 can access the streaming server (405) to retrieve copies (407) and (409) of the encoded video data (404). A client subsystem (406) can include a video decoder (410), for example, in an electronic device (430). The video decoder (410) decodes the incoming copy (407) of the encoded video data and creates an outgoing stream of video pictures (411) that can be rendered on a display (412) (e.g., display screen) or other rendering device (not depicted). In some streaming systems, the encoded video data (404), (407), and (409) (e.g., video bitstreams) can be encoded according to certain video coding/compression standards. Examples of those standards include ITU-T Recommendation H.265. In an 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.

It is noted that the electronic devices (420) and (430) can include other components (not shown). For example, the electronic device (420) can include a video decoder (not shown) and the electronic device (430) can include a video encoder (not shown) as well.

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

The receiver (531) may receive one or more coded video sequences to be decoded by the video decoder (510); in the same or another embodiment, one coded video sequence at a time, where the decoding of each coded video sequence is independent from other coded video sequences. The coded video sequence may be received from a channel (501), which may be a hardware/software link to a storage device which stores the encoded video data. The receiver (531) may receive the encoded video data with other data, for example, coded audio data and/or ancillary data streams, that may be forwarded to their respective using entities (not depicted). The receiver (531) may separate the coded video sequence from the other data. To combat network jitter, a buffer memory (515) may be coupled in between the receiver (531) and an entropy decoder/parser (520) (“parser (520)” henceforth). In certain applications, the buffer memory (515) is part of the video decoder (510). In others, it can be outside of the video decoder (510) (not depicted). In still others, there can be a buffer memory (not depicted) outside of the video decoder (510), for example to combat network jitter, and in addition another buffer memory (515) inside the video decoder (510), for example to handle playout timing. When the receiver (531) is receiving data from a store/forward device of sufficient bandwidth and controllability, or from an isosynchronous network, the buffer memory (515) may not be needed, or can be small. For use on best effort packet networks such as the Internet, the buffer memory (515) may be required, can be comparatively large and can be advantageously of adaptive size, and may at least partially be implemented in an operating system or similar elements (not depicted) outside of the video decoder (510).

The video decoder (510) may include the parser (520) to reconstruct symbols (521) from the coded video sequence. Categories of those symbols include information used to manage operation of the video decoder (510), and potentially information to control a rendering device such as a render device (512) (e.g., a display screen) that is not an integral part of the electronic device (530) but can be coupled to the electronic device (530), as was shown in FIG. 5. The control information for the rendering device(s) may be in the form of Supplemental Enhancement Information (SEI messages) or Video Usability Information (VUI) parameter set fragments (not depicted). The parser (520) may parse/entropy-decode the coded video sequence that is received. The coding of the coded video sequence can be in accordance with a video coding technology or standard, and can follow various principles, including variable length coding, Huffman coding, arithmetic coding with or without context sensitivity, and so forth. The parser (520) may extract from the coded video sequence, a set of subgroup parameters for at least one of the subgroups of pixels in the video decoder, based upon at least one parameter corresponding to the group. Subgroups can include Groups of Pictures (GOPs), pictures, tiles, slices, macroblocks, Coding Units (CUs), blocks, Transform Units (TUs), Prediction Units (PUs) and so forth. The parser (520) may also extract from the coded video sequence information such as transform coefficients, quantizer parameter values, motion vectors, and so forth.

The parser (520) may perform an entropy decoding/parsing operation on the video sequence received from the buffer memory (515), so as to create symbols (521).

Reconstruction of the symbols (521) can involve multiple different units depending on the type of the coded video picture or parts thereof (such as: inter and intra picture, inter and intra block), and other factors. Which units are involved, and how, can be controlled by the subgroup control information that was parsed from the coded video sequence by the parser (520). The flow of such subgroup control information between the parser (520) and the multiple units below is not depicted for clarity.

Beyond the functional blocks already mentioned, the video decoder (510) can be conceptually subdivided into a number of functional units as described below. In a practical implementation operating under commercial constraints, many of these units interact closely with each other and can, at least partly, be integrated into each other. However, for the purpose of describing the disclosed subject matter, the conceptual subdivision into the functional units below is appropriate.

A first unit is the scaler/inverse transform unit (551). The scaler/inverse transform unit (551) receives a quantized transform coefficient as well as control information, including which transform to use, block size, quantization factor, quantization scaling matrices, etc. as symbol(s) (521) from the parser (520). The scaler/inverse transform unit (551) can output blocks comprising sample values, that can be input into aggregator (555).

In some cases, the output samples of the scaler/inverse transform (551) can pertain to an intra coded block; that is: a block that is not using predictive information from previously reconstructed pictures, but can use predictive information from previously reconstructed parts of the current picture. Such predictive information can be provided by an intra picture prediction unit (552). In some cases, the intra picture prediction unit (552) generates a block of the same size and shape of the block under reconstruction, using surrounding already reconstructed information fetched from the current picture buffer (558). The current picture buffer (558) buffers, for example, partly reconstructed current picture and/or fully reconstructed current picture. The aggregator (555), in some cases, adds, on a per sample basis, the prediction information the intra prediction unit (552) has generated to the output sample information as provided by the scaler/inverse transform unit (551).

In other cases, the output samples of the scaler/inverse transform unit (551) can pertain to an inter coded, and potentially motion compensated block. In such a case, a motion compensation prediction unit (553) can access reference picture memory (557) to fetch samples used for prediction. After motion compensating the fetched samples in accordance with the symbols (521) pertaining to the block, these samples can be added by the aggregator (555) to the output of the scaler/inverse transform unit (551) (in this case called the residual samples or residual signal) so as to generate output sample information. The addresses within the reference picture memory (557) from where the motion compensation prediction unit (553) fetches prediction samples can be controlled by motion vectors, available to the motion compensation prediction unit (553) in the form of symbols (521) that can have, for example X, Y, and reference picture components. Motion compensation also can include interpolation of sample values as fetched from the reference picture memory (557) when sub-sample exact motion vectors are in use, motion vector prediction mechanisms, and so forth.

The output samples of the aggregator (555) can be subject to various loop filtering techniques in the loop filter unit (556). Video compression technologies can include in-loop filter technologies that are controlled by parameters included in the coded video sequence (also referred to as coded video bitstream) and made available to the loop filter unit (556) as symbols (521) from the parser (520), but can also be responsive to meta-information obtained during the decoding of previous (in decoding order) parts of the coded picture or coded video sequence, as well as responsive to previously reconstructed and loop-filtered sample values.

The output of the loop filter unit (556) can be a sample stream that can be output to the render device (512) as well as stored in the reference picture memory (557) for use in future inter-picture prediction.

Certain coded pictures, once fully reconstructed, can be used as reference pictures for future prediction. For example, once a coded picture corresponding to a current picture is fully reconstructed and the coded picture has been identified as a reference picture (by, for example, the parser (520)), the current picture buffer (558) can become a part of the reference picture memory (557), and a fresh current picture buffer can be reallocated before commencing the reconstruction of the following coded picture.

The video decoder (510) may perform decoding operations according to a predetermined video compression technology in a standard, such as ITU-T Rec. H.265. The coded video sequence may conform to a syntax specified by the video compression technology or standard being used, in the sense that the coded video sequence adheres to both the syntax of the video compression technology or standard and the profiles as documented in the video compression technology or standard. Specifically, a profile can select certain tools as the only tools available for use under that profile from all the tools available in the video compression technology or standard. Also necessary for compliance can be that the complexity of the coded video sequence is within bounds as defined by the level of the video compression technology or standard. In some cases, levels restrict the maximum picture size, maximum frame rate, maximum reconstruction sample rate (measured in, for example megasamples per second), maximum reference picture size, and so on. Limits set by levels can, in some cases, be further restricted through Hypothetical Reference Decoder (HRD) specifications and metadata for HRD buffer management signaled in the coded video sequence.

In an embodiment, the receiver (531) may receive additional (redundant) data with the encoded video. The additional data may be included as part of the coded video sequence(s). 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. Additional data can be in the form of, for example, temporal, spatial, or signal noise ratio (SNR) enhancement layers, redundant slices, redundant pictures, forward error correction codes, and so on.

FIG. 6 shows a block diagram of a video encoder (603) according to an embodiment of the present disclosure. The video encoder (603) is included in an electronic device (620). The electronic device (620) includes a transmitter (640) (e.g., transmitting circuitry). The video encoder (603) can be used in the place of the video encoder (403) in the FIG. 4 example.

The video encoder (603) may receive video samples from a video source (601) (that is not part of the electronic device (620) in the FIG. 6 example) that may capture video image(s) to be coded by the video encoder (603). In another example, the video source (601) is a part of the electronic device (620).

The video source (601) may provide the source video sequence to be coded by the video encoder (603) in the form of a digital video sample stream that can be of any suitable bit depth (for example: 8 bit, 10 bit, 12 bit, . . . ), any colorspace (for example, BT.601 Y CrCB, RGB, . . . ), and any suitable sampling structure (for example Y CrCb 4:2:0, Y CrCb 4:4:4). In a media serving system, the video source (601) may be a storage device storing previously prepared video. In a videoconferencing system, the video source (601) may be a camera that captures local image information as a video sequence. Video data may be provided as a plurality of individual pictures that impart motion when viewed in sequence. The pictures themselves may be organized as a spatial array of pixels, wherein each pixel can comprise one or more samples depending on the sampling structure, color space, etc. in use. A person skilled in the art can readily understand the relationship between pixels and samples. The description below focuses on samples.

According to an embodiment, the video encoder (603) may code and compress the pictures of the source video sequence into a coded video sequence (643) in real time or under any other time constraints as required by the application. Enforcing appropriate coding speed is one function of a controller (650). In some embodiments, the controller (650) controls other functional units as described below and is functionally coupled to the other functional units. The coupling is not depicted for clarity. Parameters set by the controller (650) can include rate control related parameters (picture skip, quantizer, lambda value of rate-distortion optimization techniques, . . . ), picture size, group of pictures (GOP) layout, maximum motion vector search range, and so forth. The controller (650) can be configured to have other suitable functions that pertain to the video encoder (603) optimized for a certain system design.

In some embodiments, the video encoder (603) is configured to operate in a coding loop. As an oversimplified description, in an example, the coding loop can include a source coder (630) (e.g., responsible for creating symbols, such as a symbol stream, based on an input picture to be coded, and a reference picture(s)), and a (local) decoder (633) embedded in the video encoder (603). The decoder (633) reconstructs the symbols to create the sample data in a similar manner as a (remote) decoder also would create (as any compression between symbols and coded video bitstream is lossless in the video compression technologies considered in the disclosed subject matter). The reconstructed sample stream (sample data) is input to the reference picture memory (634). As the decoding of a symbol stream leads to bit-exact results independent of decoder location (local or remote), the content in the reference picture memory (634) is also bit exact between the local encoder and remote encoder. In other words, the prediction part of an encoder “sees” as reference picture samples exactly the same sample values as a decoder would “see” when using prediction during decoding. This fundamental principle of reference picture synchronicity (and resulting drift, if synchronicity cannot be maintained, for example because of channel errors) is used in some related arts as well.

The operation of the “local” decoder (633) can be the same as of a “remote” decoder, such as the video decoder (510), which has already been described in detail above in conjunction with FIG. 5. Briefly referring also to FIG. 5, however, as symbols are available and encoding/decoding of symbols to a coded video sequence by an entropy coder (645) and the parser (520) can be lossless, the entropy decoding parts of the video decoder (510), including the buffer memory (515), and parser (520) may not be fully implemented in the local decoder (633).

An observation that can be made at this point is that any decoder technology except the parsing/entropy decoding that is present in a decoder also necessarily needs to be present, in substantially identical functional form, in a corresponding encoder. For this reason, the disclosed subject matter focuses on decoder operation. The description of encoder technologies can be abbreviated as they are the inverse of the comprehensively described decoder technologies. Only in certain areas a more detail description is required and provided below.

During operation, in some examples, the source coder (630) may perform motion compensated predictive coding, which codes an input picture predictively with reference to one or more previously coded picture from the video sequence that were designated as “reference pictures.” In this manner, the coding engine (632) codes differences between pixel blocks of an input picture and pixel blocks of reference picture(s) that may be selected as prediction reference(s) to the input picture.

The local video decoder (633) may decode coded video data of pictures that may be designated as reference pictures, based on symbols created by the source coder (630). Operations of the coding engine (632) may advantageously be lossy processes. When the coded video data may be decoded at a video decoder (not shown in FIG. 6), the reconstructed video sequence typically may be a replica of the source video sequence with some errors. The local video decoder (633) replicates decoding processes that may be performed by the video decoder on reference pictures and may cause reconstructed reference pictures to be stored in the reference picture cache (634). In this manner, the video encoder (603) may store copies of reconstructed reference pictures locally that have common content as the reconstructed reference pictures that will be obtained by a far-end video decoder (absent transmission errors).

The predictor (635) may perform prediction searches for the coding engine (632). That is, for a new picture to be coded, the predictor (635) may search the reference picture memory (634) for sample data (as candidate reference pixel blocks) or certain metadata such as reference picture motion vectors, block shapes, and so on, that may serve as an appropriate prediction reference for the new pictures. The predictor (635) may operate on a sample block-by-pixel block basis to find appropriate prediction references. In some cases, as determined by 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).

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

Output of all aforementioned functional units may be subjected to entropy coding in the entropy coder (645). The entropy coder (645) translates the symbols as generated by the various functional units into a coded video sequence, by lossless compressing the symbols according to technologies such as Huffman coding, variable length coding, arithmetic coding, and so forth.

The transmitter (640) may buffer the coded video sequence(s) as created by the entropy coder (645) to prepare for transmission via a communication channel (660), which may be a hardware/software link to a storage device which would store the encoded video data. The transmitter (640) may merge coded video data from the video coder (603) with other data to be transmitted, for example, coded audio data and/or ancillary data streams (sources not shown).

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

An Intra Picture (I picture) may be one that may be coded and decoded without using any other picture in the sequence as a source of prediction. Some video codecs allow for different types of intra pictures, including, for example Independent Decoder Refresh (“IDR”) Pictures. A person skilled in the art is aware of those variants of I pictures and their respective applications and features.

A predictive picture (P picture) may be one that may be coded and decoded using intra prediction or inter prediction using at most one motion vector and reference index to predict the sample values of each block.

A bi-directionally predictive picture (B Picture) may be one that may be coded and decoded using intra prediction or inter prediction using at most two motion vectors and reference indices to predict the sample values of each block. Similarly, multiple-predictive pictures can use more than two reference pictures and associated metadata for the reconstruction of a single block.

Source pictures commonly may be subdivided spatially into a plurality of sample blocks (for example, blocks of 4×4, 8×8, 4×8, or 16×16 samples each) and coded on a block-by-block basis. Blocks may be coded predictively with reference to other (already coded) blocks as determined by the coding assignment applied to the blocks' respective pictures. For example, blocks of I pictures may be coded non-predictively or they may be coded predictively with reference to already coded blocks of the same picture (spatial prediction or intra prediction). Pixel blocks of P pictures may be coded predictively, via spatial prediction or via temporal prediction with reference to one previously coded reference picture. Blocks of B pictures may be coded predictively, via spatial prediction or via temporal prediction with reference to one or two previously coded reference pictures.

The video encoder (603) may perform coding operations according to a predetermined video coding technology or standard, such as ITU-T Rec. H.265. In its operation, the video encoder (603) may perform various compression operations, including predictive coding operations that exploit temporal and spatial redundancies in the input video sequence. The coded video data, therefore, may conform to a syntax specified by the video coding technology or standard being used.

In an embodiment, the transmitter (640) may transmit additional data with the encoded video. The source coder (630) may include such data as part of the coded video sequence. Additional data may comprise temporal/spatial/SNR enhancement layers, other forms of redundant data such as redundant pictures and slices, SEI messages, VUI parameter set fragments, and so on.

A video may be captured as a plurality of source pictures (video pictures) in a temporal sequence. Intra-picture prediction (often abbreviated to intra prediction) makes use of spatial correlation in a given picture, and inter-picture prediction makes uses of the (temporal or other) correlation between the pictures. In an example, a specific picture under encoding/decoding, which is referred to as a current picture, is partitioned into blocks. When a block in the current picture is similar to a reference block in a previously coded and still buffered reference picture in the video, the block in the current picture can be coded by a vector that is referred to as a motion vector. The motion vector points to the reference block in the reference picture, and can have a third dimension identifying the reference picture, in case multiple reference pictures are in use.

In some embodiments, a bi-prediction technique can be used in the inter-picture prediction. According to the bi-prediction technique, two reference pictures, such as a first reference picture and a second reference picture that are both prior in decoding order to the current picture in the video (but may be in the past and future, respectively, in display order) are used. A block in the current picture can be coded by 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. The block can be predicted by a combination of the first reference block and the second reference block.

Further, a merge mode technique can be used in the inter-picture prediction to improve coding efficiency.

According to some embodiments of the disclosure, predictions, such as inter-picture predictions and intra-picture predictions are performed in the unit of blocks. For example, according to the HEVC standard, a picture in a sequence of video pictures is partitioned into coding tree units (CTU) for compression, the CTUs in a picture have the same size, such as 64×64 pixels, 32×32 pixels, or 16×16 pixels. In general, a CTU includes three coding tree blocks (CTBs), which are one luma CTB and two chroma CTBs. Each CTU can be recursively quadtree split into one or multiple coding units (CUs). For example, a CTU of 64×64 pixels can be split into one CU of 64×64 pixels, or 4 CUs of 32×32 pixels, or 16 CUs of 16×16 pixels. In an example, each CU is analyzed to determine a prediction type for the CU, such as an inter prediction type or an intra prediction type. The CU is split into one or more prediction units (PUs) depending on the temporal and/or spatial predictability. Generally, each PU includes a luma prediction block (PB), and two chroma PBs. In an embodiment, a prediction operation in coding (encoding/decoding) is performed in the unit of a prediction block. Using a luma prediction block as an example of a prediction block, the prediction block includes a matrix of values (e.g., luma values) for pixels, such as 8×8 pixels, 16×16 pixels, 8×16 pixels, 16×8 pixels, and the like.

FIG. 7 shows a diagram of a video encoder (703) according to another embodiment of the disclosure. The video encoder (703) is configured to receive a processing block (e.g., a prediction block) of sample values within a current video picture in a sequence of video pictures, and encode the processing block into a coded picture that is part of a coded video sequence. In an example, the video encoder (703) is used in the place of the video encoder (403) in the FIG. 4 example.

In an HEVC example, the video encoder (703) receives a matrix of sample values for a processing block, such as a prediction block of 8×8 samples, and the like. The video encoder (703) determines whether the processing block is best coded using intra mode, inter mode, or bi-prediction mode using, for example, rate-distortion optimization. When the processing block is to be coded in intra mode, the video encoder (703) may use an intra prediction technique to encode the processing block into the coded picture; and when the processing block is to be coded in inter mode or bi-prediction mode, the video encoder (703) may use an inter prediction or bi-prediction technique, respectively, to encode the processing block into the coded picture. In certain video coding technologies, merge mode can be an inter picture prediction submode where the motion vector is derived from one or more motion vector predictors without the benefit of a coded motion vector component outside the predictors. In certain other video coding technologies, a motion vector component applicable to the subject block may be present. In an example, the video encoder (703) includes other components, such as a mode decision module (not shown) to determine the mode of the processing blocks.

In the FIG. 7 example, the video encoder (703) includes the inter encoder (730), an intra encoder (722), a residue calculator (723), a switch (726), a residue encoder (724), a general controller (721), and an entropy encoder (725) coupled together as shown in FIG. 7.

The inter encoder (730) is configured to receive the samples of the current block (e.g., a processing block), compare the block to one or more reference blocks in reference pictures (e.g., blocks in previous pictures and later pictures), generate inter prediction information (e.g., description of redundant information according to inter encoding technique, motion vectors, merge mode information), and calculate inter prediction results (e.g., predicted block) based on the inter prediction information using any suitable technique. In some examples, the reference pictures are decoded reference pictures that are decoded based on the encoded video information.

The intra encoder (722) is configured to receive the samples of the current block (e.g., a processing block), in some cases compare the block to blocks already coded in the same picture, generate quantized coefficients after transform, and in some cases also intra prediction information (e.g., an intra prediction direction information according to one or more intra encoding techniques). In an example, the intra encoder (722) also calculates intra prediction results (e.g., predicted block) based on the intra prediction information and reference blocks in the same picture.

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

The residue calculator (723) is configured to calculate a difference (residue data) between the received block and prediction results selected from the intra encoder (722) or the inter encoder (730). The residue encoder (724) is configured to operate based on the residue data to encode the residue data to generate the transform coefficients. In an example, the residue encoder (724) is configured to convert the residue data from a spatial domain to a frequency domain, and generate the transform coefficients. The transform coefficients are then subject to quantization processing to obtain quantized transform coefficients. In various embodiments, the video encoder (703) also includes a residue decoder (728). The residue decoder (728) is configured to perform inverse-transform, and generate the decoded residue data. The decoded residue data can be suitably used by the intra encoder (722) and the inter encoder (730). For example, the inter encoder (730) can generate decoded blocks based on the decoded residue data and inter prediction information, and the intra encoder (722) can generate decoded blocks based on the decoded residue data and the intra prediction information. The decoded blocks are suitably processed to generate decoded pictures and the decoded pictures can be buffered in a memory circuit (not shown) and used as reference pictures in some examples.

The entropy encoder (725) is configured to format the bitstream to include the encoded block. The entropy encoder (725) is configured to include various information according to a suitable standard, such as the HEVC standard. In an example, the entropy encoder (725) is configured to include the general control data, the selected prediction information (e.g., intra prediction information or inter prediction information), the residue information, and other suitable information in the bitstream. Note that, according to the disclosed subject matter, when coding a block in the merge submode of either inter mode or bi-prediction mode, there is no residue information.

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

In the FIG. 8 example, the video decoder (810) includes an entropy decoder (871), an inter decoder (880), a residue decoder (873), a reconstruction module (874), and an intra decoder (872) coupled together as shown in FIG. 8.

The entropy decoder (871) can be configured to reconstruct, from the coded picture, certain symbols that represent the syntax elements of which the coded picture is made up. Such symbols can include, for example, the mode in which a block is coded (such as, for example, intra mode, inter mode, bi-predicted mode, the latter two in merge submode or another submode), prediction information (such as, for example, intra prediction information or inter prediction information) that can identify certain sample or metadata that is used for prediction by the intra decoder (872) or the inter decoder (880), respectively, residual information in the form of, for example, quantized transform coefficients, and the like. In an example, when the prediction mode is inter or bi-predicted mode, the inter prediction information is provided to the inter decoder (880); and when the prediction type is the intra prediction type, the intra prediction information is provided to the intra decoder (872). The residual information can be subject to inverse quantization and is provided to the residue decoder (873).

The inter decoder (880) is configured to receive the inter prediction information, and generate inter prediction results based on the inter prediction information.

The intra decoder (872) is configured to receive the intra prediction information, and generate prediction results based on the intra prediction information.

The residue decoder (873) is configured to perform inverse quantization to extract de-quantized transform coefficients, and process the de-quantized transform coefficients to convert the residual from the frequency domain to the spatial domain. The residue decoder (873) may also require certain control information (to include the Quantizer Parameter (QP)), and that information may be provided by the entropy decoder (871) (data path not depicted as this may be low volume control information only).

The reconstruction module (874) is configured to combine, in the spatial domain, the residual as output by the residue decoder (873) and the prediction results (as output by the inter or intra prediction modules as the case may be) to form a reconstructed block, that may be part of the reconstructed picture, which in turn may be part of the reconstructed video. It is noted that other suitable operations, such as a deblocking operation and the like, can be performed to improve the visual quality.

It is noted that the video encoders (403), (603), and (703), and the video decoders (410), (510), and (810) can be implemented using any suitable technique. In an embodiment, the video encoders (403), (603), and (703), and the video decoders (410), (510), and (810) can be implemented using one or more integrated circuits. In another embodiment, the video encoders (403), (603), and (603), and the video decoders (410), (510), and (810) can be implemented using one or more processors that execute software instructions.

Aspects of the disclosure provide techniques for matrix based intra prediction.

FIG. 9 shows an illustration of exemplary intra prediction directions and the intra prediction modes used in HEVC. In HEVC, there are total 35 intra prediction modes (mode 0 to mode 34). The mode 0 and mode 1 are non-directional modes, among which mode 0 is planar mode and mode 1 is DC mode. The DC mode uses an average of all samples. The planar mode uses an average of two linear predictions. The modes 2-34 are directional modes, among which mode 10 is horizontal mode, mode 26 is vertical mode, and mode 2, mode 18 and mode 34 are diagonal modes. In some examples, the intra prediction modes are signaled by three most probable modes (MPMs) and 32 remaining modes.

FIG. 10 shows an illustration of exemplary intra prediction directions and intra prediction modes in some examples (e.g., VVC). There are total 95 intra prediction modes (mode −14 to mode 80), among which mode 18 is horizontal mode, mode 50 is vertical mode, and mode 2, mode 34 and mode 66 are diagonal modes. Modes −1˜−14 and Modes 67−80 are called wide-angle intra prediction (WAIP) modes (also referred to as wide-angular modes, wide angular direction modes and the like).

In the present disclosure, the direction based intra prediction is referred to as regular intra prediction or non-matrix based intra prediction.

According to some aspects of the disclosure, an intra prediction mode that is referred to as affine linear weighted intra prediction (ALWIP) mode can be used. ALWIP can be also referred to as matrix based intra prediction (MIP). For example, in a version of joint video exploration team (JVET), ALWIP (matrix based intra prediction) can be used to improve the performance of intra prediction process.

Specifically, for predicting the samples of a rectangular block of width W and height H, matrix based intra prediction takes one left column of H reconstructed neighboring boundary samples of the block (denoted by bdry^left) and one above row of W reconstructed neighboring boundary samples of the block (denoted by bdry^top) as input. When the reconstructed samples are unavailable, certain intra prediction techniques, such as padding techniques, can be used to generate padding samples in the bdry^left and bdry^top. Then, the samples of a rectangular block of width W and height H rectangular can be generated based on three steps. The generation of the prediction signal is based on following three steps.

In a first step, out of the boundary samples, four samples in the case of W=H=4, and eight samples in all other cases are extracted based on averaging neighboring samples. The 4 or 8 extracted samples can be referred to as a subsampled set of samples in the original block.

In a second step, a matrix vector multiplication, followed by addition of an offset, can be carried out with the averaged samples as an input. The result is a reduced prediction signal on the subsampled set of samples in the original block.

In a third step, the prediction signal at the remaining positions is generated from the reduced prediction signal on the subsampled set by linear interpolation in each direction.

More specifically, in the first step, the numbers of the neighboring boundary samples of the above row and the left column bdry^top and bdry^left are reduced by averaging neighboring samples. The reduced neighboring boundary samples of the above row can be referred by bdry_red^top and reduced neighboring boundary samples of the left column can be referred by bdry_red^left.

It is noted that when the current block is 4×4 block, the reduced neighboring boundary samples of the above row bdry_red^top includes 2 samples, and the reduced neighboring boundary samples of the left column bdry_red^left includes 2 samples. For other cases (e.g., W>4 and H>4), the reduced neighboring boundary samples of the above row bdry_red^top includes 4 samples, and the reduced neighboring boundary samples of the left column bdry_red^left includes 4 samples.

In the case of a 4×4-block, for 0≤i<2, the reduced neighboring boundary samples of the above row can be defined according to (Eq. 1), the reduced neighboring boundary samples of the left column can be defined similarly.

$\begin{array}{cc}{\mathrm{bdry}}_{\mathrm{red}}^{\mathrm{top}}\left[i\right]=\left(\left({\sum }_{j=0}^1{\mathrm{bdry}}^{\mathrm{top}}\left[i·2+j\right]\right)+1\right)\gg 1& \left(\mathrm{Eq}.1\right)\end{array}$

In the cases that the block width W is given as W=4·2^k, for 0≤i<4, the reduced neighboring boundary samples of the above row can be defined according to (Eq. 2), the reduced neighboring boundary samples of the left column can be defined similarly.

$\begin{array}{cc}{\mathrm{bdry}}_{\mathrm{red}}^{\mathrm{top}}\left[i\right]=\left(\left({\sum }_{j=0}^{2^k-1}{\mathrm{bdry}}^{\mathrm{top}}\left[i·2^k+j\right]\right)+\left(1\ll \left(k-1\right)\right)\right)\gg k& \left(\mathrm{Eq}.2\right)\end{array}$

Further, in the first step, the bdry_red^top and bdry_red^left are concatenated to form bdry_red, which is a vector that can include 4 or 8 elements.

Specifically, in the second step, the reduced prediction signal pred_red is computed by calculating a matrix vector product and adding an offset, such as according to (Eq. 3):

$\begin{array}{cc}{\mathrm{pred}}_{\mathrm{red}}=A·{\mathrm{bdry}}_{\mathrm{red}}+b.& \left(\mathrm{Eq}.3\right)\end{array}$ where A denotes a matrix and b denotes a vector.

The matrix A and the vector b are taken from one of the sets S₀, S₁, S₂, where the subscript of a set idx(W, H) is derived as (Eq. 4):

$\begin{array}{cc}\mathrm{idx}\left(W,H\right)=\{\begin{array}{cc}0& \mathrm{for}W=H=4\\ 1& \mathrm{for}\max \left(W,H\right)=8\\ 2& \mathrm{for}\max \left(W,H\right)>8,\end{array}& \left(\mathrm{Eq}.4\right)\end{array}$

The set S₀ includes 18 matrices A₀ⁱ, i∈{0, . . . , 17} each of which has 16 rows and 4 columns, and 18 offset vectors b₀ⁱ, i∈{0, . . . , 17} each of which is with size 16. Matrices and offset vectors of that set are used for blocks of size 4×4. The set S₁ includes of 10 matrices A₁ⁱ, i∈{0, . . . , 9}, each of which has 16 rows and 8 columns and 10 offset vectors b₁ⁱ, i∈{0, . . . , 9} each of which is with size 16. Matrices and offset vectors of that set are used for blocks of sizes 4×8, 8×4 and 8×8. Finally, the set S₂ consists of 6 matrices A₂ⁱ, i∈{0, . . . , 5}, each of which has 64 rows and 8 columns and of 6 offset vectors b₂ⁱ, i∈{0, . . . , 5} of size 64. Matrices and offset vectors of that set or parts of these matrices and offset vectors are used for all other block-shapes.

Specifically, in the third step, for a W×H block with max(W, H)≥8, the prediction signal can be generated from the reduced prediction signal pred_red on W_red×H_red by linear interpolation. Depending on the block shape, linear interpolation can be performed in vertical direction, horizontal direction or both directions. If linear interpolation is to be applied in both directions, the linear interpolation can be first applied in horizontal direction when W<H and can be first applied in vertical direction when W≥H.

In an example (without loss of generality), a W×H block with max(W, H)≥8 and W≥H. The linear interpolation can be performed as follows. First, the reduced prediction signal is extended to the top by the boundary signal. The extended reduced prediction signal can be defined by (Eq. 5)

$\begin{array}{cc}{\mathrm{pred}}_{\mathrm{red}}\left[x\right]\left[-1\right]={\mathrm{bdry}}^{\mathrm{top}}\left[x\right]& \left(\mathrm{Eq}.5\right)\end{array}$

Then, from this extended reduced prediction signal, the vertically linear interpolated prediction signal is generated by (Eq. 6):

$\begin{array}{cc}{\mathrm{pred}}_{\mathrm{red}}^{\mathrm{up},\mathrm{ver}}\left[x\right]\left[U_{\mathrm{ver}}·y+k\right]=\left(\left(U_{\mathrm{ver}}-k-1\right)·{\mathrm{pred}}_{\mathrm{red}}\left[x\right]\left[y-1\right]+\left(k+1\right)·{\mathrm{pred}}_{\mathrm{red}}\left[x\right]\left[y\right]+\frac{U_{\mathrm{ver}}}{2}\right)⪢U_{\mathrm{ver}}& \left(\mathrm{Eq}.6\right)\end{array}$ for 0≤x<W_red, 0≤y<H_red and 0≤k<U_ver, where W_red denotes the reduced width of the reduced prediction signal, H_red denotes the reduced height of the reduced prediction signal, U_ver denotes the ratio of height (of the block) to the reduced height (of the reduced prediction signal).

It is noted that, in some examples, horizontal linear interpolation can be similarly performed.

Using an 8×8 block as an example, FIG. 11-13 show the three steps of matrix based intra prediction.

FIG. 11 shows a diagram illustrating the first step of matrix based intra prediction in some examples. In the FIG. 11 example, the current block is a 8×8 block. Thus, the left column of the current block includes 8 reconstructed neighboring boundary samples that are referred by bdry^left; the above row of the current block includes 8 reconstructed neighboring boundary samples that are referred by bdry^top. In the first step, the numbers of the neighboring boundary samples of the above row and the left column bdry^top and bdry^left are reduced by averaging neighboring samples as shown in FIG. 11. For example, the number of neighboring boundary samples of the above rows is reduced from 8 to 4, and the number of neighboring boundary samples of the left column is reduced from 8 to 4. The reduced neighboring boundary samples of the above row can be referred by bdry_red^top and reduced neighboring boundary samples of the left column can be referred by bdry_red^left.

The reduced neighboring boundary samples of the above row and the left column are concatenated to form a vector of 8 samples.

FIG. 12 shows a diagram illustrating the second step of matrix based intra prediction in some examples. In the second step, the vector of 8 entries is input to a matrix vector multiplication. The matrix is taken from the set S₁. The output of the matrix vector multiplication includes a vector of 16 samples that are samples for the odd positions of the prediction block. In an example, a total of (8·16)/(8·8)=2 multiplications per sample are performed. It is noted that offsets are also added to the samples.

FIG. 13 shows a diagram illustrating the third step of matrix based intra prediction. After the second steps, 16 samples that are samples for the odd positions (e.g., dark positions in left part of FIG. 13) of the prediction block. In the FIG. 13 example, the 16 samples are interpolated vertically by using the reduced top boundary. Then, horizontal interpolation can be performed by using the original left boundary. It is noted that in the example of 8×8 block, the interpolation process can be performed using addition and shifting operations and does not require any multiplication operations.

According to an aspect of the disclosure, the above matrix based intra prediction can be suitably modified for various benefits, such as easy convergence, saving storage space, and the like.

In some examples (e.g., JVET-00481), residue signals of the reduced neighboring boundary samples for better convergence. For example, after averaging boundary samples, one additional step to obtain residue signals is performed, and the residue signals can be used in the place of the reduced neighboring boundary samples to achieve easy convergence.

For example, when idx(W, H)=0 or idx(W, H)=1, then (Eq. 7)-(Eq. 8) are performed:

$\begin{array}{cc}{\mathrm{input}}_{\mathrm{ref}}\left[0\right]={\mathrm{bdry}}_{\mathrm{red}}\left[0\right]-\left(1\ll \left(\mathrm{bitDepth}-1\right)\right),& \left(\mathrm{Eq}.7\right)\end{array}$ $\begin{array}{cc}{\mathrm{input}}_{\mathrm{red}}\left[j\right]={\mathrm{bdry}}_{\mathrm{red}}\left[j\right]-{\mathrm{bdry}}_{\mathrm{red}}\left[0\right],j=1,\dots ,\mathrm{size}\left({\mathrm{bdry}}_{\mathrm{red}}\right)-1,& \left(\mathrm{Eq}.8\right)\end{array}$

Otherwise, when idx(W, H)=2, (Eq. 9) can be performed:

$\begin{array}{cc}{\mathrm{input}}_{\mathrm{red}}\left[j\right]={\mathrm{bdry}}_{\mathrm{red}}\left[j+1\right]-{\mathrm{bdry}}_{\mathrm{red}}\left[0\right],j=1,\dots ,\mathrm{size}\left({\mathrm{bdry}}_{\mathrm{red}}\right)-2,& \left(\mathrm{Eq}.9\right)\end{array}$

It is noted that bitDepth denotes the luma bit-depth. Thus, for idx(W, H)=0 or idx(W, H)=1, input_red is of the same size (inSize) as bdry_red and, when idx(W, H)=2, size inSize=size(bdry_red)−1. For example, when internal bit-depth is set equal to 10, the bit depth of bdry_red[i] is 10, and the bit depth of input_red[j] is 11 since it's generated by subtracting one 10-bit value from another 10-bit value.

Further, in some embodiments, a matrix A is selected based on the MIP mode. In some examples, the sets S₀, S₁, S₂ of matrices are pre-determined based on training, and are suitably stored. In some embodiments, the sets S₂ can be stored with some rows left out to save storage space.

The set S₀ consists of 18 matrices A₀ⁱ, i∈{0, . . . , 17} each of which has 16 rows and 4 columns. Matrices of set S₀ are used if idx(W, H)=0, i.e., for blocks of size 4×4. The set S₁ consists of 10 matrices A₁ⁱ, i∈{0, . . . , 9}, each of which has 16 rows and 8 columns. Matrices of that set are used if idx(W, H)=1, i.e., for blocks of sizes 4×8, 8×4 and 8×8.

It is noted that, the matrices in the set S₂ can be similarly processed as in (Eq. 9), to make the first column in the matrices to be zero, and then do not need to be stored. Thus, the set S₂ consists of 6 matrices A₂ⁱ, i∈{0, . . . , 5}, each of which has 64 rows and 7 columns. Matrices of set S₂ or parts of these matrices are used if idx(W, H)=2, i.e., for all other block-shapes.

According to an aspect of the disclosure, entries of the matrices belonging to the sets S₀, S₁ and S₂ can be converted to unsigned numbers based on factors fW (e.g., a factor fW for a matrix can be set as an absolute value of the minimum entries in the matrix) and thus can be stored as unsigned numbers. In some examples, the entries of the matrices belonging to the sets S₀, S₁ and S₂ can be stored in 7 bits as unsigned 7-bit numbers, and the factors fW are stored as 7-bit numbers.

In some examples, W_red and H_red denote the width and the height of the reduced prediction signal and sW denotes the shift corresponding to the prediction mode, the reduced prediction signal pred_red can be calculated according to (Eq. 10):

$\begin{array}{cc}{\mathrm{pred}}_{\mathrm{red}}\left[i\right]=\left(\left(\left({\sum }_{j=0}^{\mathrm{inSize}}\left(A\left[i\right]\left[j\right]-\mathrm{fW}\right)·{\mathrm{input}}_{\mathrm{red}}\left[j\right]\right)+\left(1\ll \left(\mathrm{sW}-1\right)\right)\right)\gg \mathrm{sW}\right)+{\mathrm{bdry}}_{\mathrm{red}}\left[0\right],\mathrm{where}i\in \left\{0,\dots ,W_{\mathrm{red}}·H_{\mathrm{red}}-1\right\}.& \left(\mathrm{Eq}.10\right)\end{array}$

In an example, the entries A[i][j] and the factors f W are stored separately (the matrix-vector product can be computed as in JVET-00084), then, the entries A[i][j] and the factors fW can both be stored in 7 bits. In another example, the differences (A[i][j]−fW) can be stored in 8 bits.

In some examples, techniques of internal bit depth increase or decrease can be used. For example, when the input source is 10 bit, and each source sample is scaled to an 8-bit value prior to encoding in a process called internal bit depth decrease (IBDD). This scaling is obtained by applying the function y=(x+2)/4 to the input value x and clipping the result y to the [0,255] range. Oppositely, when the input is an 8-bit source, each sample is scaled to 10-bit value before encoding by applying the y=4×x function to the input values x. This process is called internal bit depth increase (IBDI), and it allows higher precision in the internal video codec operations (improved encoding efficiency) at the cost of an increase in memory requirements, mainly to store reference picture in the decoded picture buffer (DPB), and also an increase of arithmetic bit-depth.

According to an aspect of the disclosure, for matrix based intra prediction (MIP) prediction process, the most time-consuming operation is the multiplication operations in the matrix vector multiplication. For example, a multiplication operation can be represented by A[i][j]·input_red[j]. It is noted that in some examples, A[i][j] can be 7-bit unsigned and input_red[j] can be 9-bit signed (when internal bit depth is set to 8 and because of usage of Eqs. 7-9) or 11-bit signed (when internal bit depth is set to 10 and because of usage of Eqs. 7-9). Since the bit depth of input_red [j] is greater than 8-bit, 16-bit multiplications are required for MIP prediction process, which is not desirable in some examples. The present disclosure can provide techniques to avoid the usage of 16-bit multiplications.

According to another aspect of the disclosure, the boundary reference sample averaging process is a different intra reference sample filtering process from regular intra prediction mode. The coding gain of the added process may not justify the added complexity. The present disclosure can provide techniques to conform the boundary reference sample averaging process with the regular intra prediction mode.

According to another aspect of the disclosure, the variable fW is a 7-bit unsigned value, and for each block, 7 or 8 multiplications are used to compute the following expressions Σ_j=0^inSizefW·input_red[j]. The present disclosure can provide techniques to avoid the multiplication operations.

According to another aspect of the disclosure, the size of generated reduced predicted samples is 4×4 or 8×8. When width and height of current block are larger than 16, the added additional multiplications per sample (e.g., using Eq. 6 for interpolation) is around 2. Especially, when current CU is 64×64, total number of added multiplications is around 64×64×2=8192. The coding gain of this added process may not justify complexity.

The proposed methods may be used separately or combined in any order. Further, each of the methods (or embodiments), 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 that is stored in a non-transitory computer-readable medium.

According to an aspect of the disclosure, the residues of reduced boundary samples input_red[j] in (Eq. 7)-(Eq. 9) can be suitably converted to 8-bit values before the matrix multiplication process, thus 8-bit multiplications (instead of the 16-bit multiplications) can be used. In some examples, the residues of reduced boundary samples input_red [j] in (Eq. 7)-(Eq. 9) can be right shifted or/and clipped to 8-bit value before the matrix multiplication process.

In an embodiment, the reduced boundary samples input_red [j] is right shifted or/and clipped to 8-bit value before the matrix multiplication process when the bit depth of input source and/or internal bit depth is less than or equal to K. K is a positive integer, such as 8, 10, or 12.

In an example, the residues of reduced boundary samples input_red[j] is right shifted to 8-bit value using the following (Eq. 11)-(Eq. 13), and weight shift variable sW is subtracted by (bithdepth+1−8) to align with the bit depth of output of the matrix multiplication process as shown in (Eq. 14).

For example, when idx(W, H)=0 or idx(W, H)=1, (Eq. 11)-(Eq. 12) can be used to convert the residues of the reduced boundary sample inputs:

$\begin{array}{cc}{\mathrm{input}}_{\mathrm{red}}\left[0\right]=\left({\mathrm{bdry}}_{\mathrm{red}}\left[0\right]-\left(1\ll \left(\mathrm{bitDepth}-1\right)\right)\right)\gg \left(\mathrm{bithdepth}+1-8\right)& \left(\mathrm{Eq}.11\right)\end{array}$ $\begin{array}{cc}{\mathrm{input}}_{\mathrm{red}}\left[j\right]=\left({\mathrm{bdry}}_{\mathrm{red}}\left[j\right]-{\mathrm{bdry}}_{\mathrm{red}}\left[0\right]\right)\gg \left(\mathrm{bithdepth}+1-8\right),j=1,\dots ,\mathrm{size}\left({\mathrm{bdry}}_{\mathrm{red}}\right)-1,& \left(\mathrm{Eq}.12\right)\end{array}$

Otherwise, when idx(W, H)=2, (Eq. 13) can be used to convert the residues of the reduced boundary sample inputs:

$\begin{array}{cc}{\mathrm{input}}_{\mathrm{red}}\left[j\right]=\left({\mathrm{bdry}}_{\mathrm{red}}\left[j+1\right]-{\mathrm{bdry}}_{\mathrm{red}}\left[0\right]\right)\gg \left(\mathrm{bithdepth}+1-8\right),j=0,\dots ,\mathrm{size}\left({\mathrm{bdry}}_{\mathrm{red}}\right)-2,& \left(\mathrm{Eq}.13\right)\end{array}$ $\begin{array}{cc}\mathrm{sW}=\mathrm{sW}-\left(\mathrm{BitDepth}+1-8\right)& \left(\mathrm{Eq}.14\right)\end{array}$

In another example, the reduced boundary samples input_red [j] is clipped to range of 8-bit using the following (Eq. 15)-(Eq. 17).

For example, when idx(W, H)=0 or idx(W, H)=1, then (Eq. 15)-(Eq. 16) can be used to convert the residues of the reduced boundary sample inputs:

$\begin{array}{cc}{\mathrm{input}}_{\mathrm{red}}\left[0\right]=\mathrm{clip}\left(-128,127,{\mathrm{bdry}}_{\mathrm{red}}\left[0\right]-\left(1\ll \left(\mathrm{bitDepth}-1\right)\right)\right)& \left(\mathrm{Eq}.15\right)\end{array}$ $\begin{array}{cc}{\mathrm{input}}_{\mathrm{red}}\left[j\right]=\mathrm{clip}\left(-128,127,{\mathrm{bdry}}_{\mathrm{red}}\left[j\right]-{\mathrm{bdry}}_{\mathrm{red}}\left[0\right]\right),j=1,\dots ,\mathrm{size}\left({\mathrm{bdry}}_{\mathrm{red}}\right)-1& \left(\mathrm{Eq}.16\right)\end{array}$

Otherwise, in an example, when idx(W, H)=2, then (Eq. 17) can be used to convert the residues of the reduced boundary sample inputs:

$\begin{array}{cc}{\mathrm{input}}_{\mathrm{red}}\left[j\right]=\mathrm{clip}\left(-128,127,{\mathrm{bdry}}_{\mathrm{red}}\left[j+1\right]-{\mathrm{bdry}}_{\mathrm{red}}\left[0\right]\right),j=0,\dots ,\mathrm{size}\left({\mathrm{bdry}}_{\mathrm{red}}\right)-2,& \left(\mathrm{Eq}.17\right)\end{array}$

In another example, the reduced boundary samples input_red[j] is first clipped to range of (N−L) bit, and then right shifted to 8 bit. N denotes the internal bit depth, L is a positive integer and L is smaller than (N−8), such as 1 or 2. Weight shift variable sW is subtracted by (bithdepth+1−8−L) to align with the bit depth of output of the matrix multiplication process.

In some embodiments, the residues of reduced boundary samples input_red [j] in (Eq. 10) is right shifted by M bits before the matrix multiplication process, example values of M is 1, 2 or 3.

In an embodiment, M is a fixed value regardless of bit depth of input source and/or internal bit depth. In an example, M is fixed to 1 regardless of bit depth of input source and/or internal bit depth. In an example, M is fixed to 2 regardless of bit depth of input source and/or internal bit depth. In an example, M is fixed to 3 regardless of bit depth of input source and/or internal bit depth.

In another embodiment, M can be a configurable value, and the value is signaled in the high level syntax, including, but not limited to SPS, VPS, PPS, APS, or slice header.

In another embodiment, M depends on internal bit depth of the codec. In an example, M is defined by a look-up table, indexed by the internal bit depth. Given the internal bit depth value, the value of M can be derived based on the look-up table that is predefined. In another example, M is defined by a look-up table, indexed by the internal bit depth, and the look-up table can be signaled in the high level syntax, including, but not limited to SPS, VPS, PPS, APS, or slice header.

In another embodiment, the reduced boundary samples input_red[j] is right shifted or/and clipped to 8-bit value before the matrix multiplication process when bit depth of input source and/or internal bit depth is 8.

In another embodiment, the reduced boundary samples input_red[j] is right shifted by 1 bit before the matrix multiplication process when bit depth of input source and/or internal bit depth greater than 8.

According to an aspect of the disclosure, the matrix based intra prediction can use the same reference sample filtering (or smoothing) process as regular intra prediction.

In an embodiment, for 4×4 (or 4×8 or 8×4) blocks, reference sample filtering process (e.g., averaging step) is disabled for MIP modes. The reduced boundary samples can be selected from certain positions.

In another embodiment, 3-tap [1,2,1] reference sample smoothing filter that is used for regular intra prediction process can be used in the place of the reference sample averaging process of MIP modes.

In some examples, when width (or height) of current CU is greater than 4, after reference sample filtering process (e.g., using 3-tap [1,2,1] reference sample smoothing filter), the filtered reference samples at ([1/4, 2/4, 3/4, 4/4]×width) (or [1/4, 2/4, 3/4, 4/4]×height) positions for above (or left) neighboring samples are picked as the reduced boundary samples, denoted by bdry_red[i].

In some examples, when width (or height) of current CU is greater than 4, after reference sample filtering process, the filtered reference samples at ([1/8, 3/8, 5/8, 7/8]×width) (or [1/8, 3/8, 5/8, 7/8]-height) positions respectively for above (or left) neighboring samples are picked as the reduced boundary samples, denoted by bdry_red[i].

FIG. 14 shows a diagram of a current block having a size of 8×8 and neighboring samples. In the FIG. 14 example, the neighboring samples at ([1/8, 3/8, 5/8, 7/8]×width) positions in above neighboring row and ([1/8, 3/8, 5/8, 7/8]×height) positions in left neighboring column are marked with grey color. In an example, after reference sample filtering process, the neighboring samples at the grey color positions are selected as the reduced boundary samples.

FIG. 15 shows a diagram of a current block having a size of 16×16 and neighboring samples. In the FIG. 15 example, the neighboring samples at ([1/8, 3/8, 5/8, 7/8]×width) positions in above neighboring row and ([1/8, 3/8, 5/8, 7/8]×height) positions in left neighboring column are marked with grey color. In an example, after reference sample filtering process, the neighboring samples at the grey color positions are selected as the reduced boundary samples.

In another example, when the current block has a size of 4×4, after reference sample filtering process, the filtered reference samples at ([2/4, 4/4]×width) or ([1/4, 3/4]×width) for the above neighboring samples can be selected and then filtered reference samples at ([2/4, 4/4]×height) or [1/4, 3/4]×height) positions for left neighboring samples can be selected as the reduced boundary samples, denoted by bdry_red[i].

In another example, when width (or height) of current block is greater than 8, after reference sample filtering process, the filtered reference samples at ([3/16, 7/16, 11/16, 15/16]×width) (or [3/16, 7/16, 11/16, 15/16]×height) positions for above (or left) neighboring samples are selected as the reduced boundary samples, denoted by bdry_red[i].

According to another aspect of the disclosure, for MIP prediction process, the above neighboring samples and the left neighboring samples can be processed respectively with or without filtering or averaging. In some embodiments, the above neighboring samples are filtered or averaged, but left neighboring samples are not filtered or averaged. The samples at left neighboring column can be directly selected to form the reduced left boundary samples.

In an embodiment, for MIP prediction process, the above neighboring samples are filtered or averaged, but left neighboring samples are not filtered or averaged, and samples at [1/4, 2/4,3/4,4/4]×height positions or [1/2,2/2]×height positions are directly picked to form the reduced left boundary samples.

In another embodiment, for above neighboring samples, the reduced samples are derived by averaging two samples of every (width/8) sample of the original above boundary when width is equal to or greater than 8.

In another embodiment, for above neighboring samples, the reduced samples are set equal to the original above boundary when width is equal to 4.

According to another aspect of the disclosure, reference sample averaging process for MIP mode is disabled when the current block size is 4×4 (or 4×8 or 8×4). In an embodiment, the un-filtered reference samples at ([1/4, 2/4, 3/4, 4/4]×width) (or [1/4, 2/4, 3/4, 4/4]×height) positions for above (or left) neighboring samples are directly picked as the reduced boundary samples, denoted by bdry_red[0] when current block size is 4×4 (or 4×8 or 8×4).

According to another aspect of the disclosure, for the up-sampling interpolation process of MIP modes, the prediction signal at the remaining positions are set equal to the average of its two adjacent reduced prediction samples for all block sizes. Here, the remaining positions denote the sample positions whose prediction signal are not generated through matrix multiplication process, and needs to be interpolated through up-sampling process. The average operation can be performed by right shifting 1 bit. Thus, no more multiplication operation is needed in the up-sampling operation.

According to another aspect of the disclosure, the value of variable f W is modified to power of 2 for block sizes and all MIP modes. Therefore, additions and shifts can be used to compute the following expressions Σ_j=0^inSize fW·input_red[j], no multiplication operation is needed.

FIG. 16 shows a flow chart outlining a process (1600) according to an embodiment of the disclosure. The process (1600) can be used in the reconstruction of a block, so to generate a prediction block for the block under reconstruction. In various embodiments, the process (1600) are executed by processing circuitry, such as the processing circuitry in the terminal devices (310), (320), (330) and (340), the processing circuitry that performs functions of the video encoder (403), the processing circuitry that performs functions of the video decoder (410), the processing circuitry that performs functions of the video decoder (510), the processing circuitry that performs functions of the video encoder (603), and the like. In some embodiments, the process (1600) is implemented in software instructions, thus when the processing circuitry executes the software instructions, the processing circuitry performs the process (1600). The process starts at (S1601) and proceeds to (S1610).

At (S1610), prediction information of a block is decoded from a coded video bitstream. The prediction information is indicative of a matrix based intra prediction for the block.

At (S1620), entries of a vector are determined based on neighboring samples of the block. In an example, each entry is determined based on one or more neighboring samples of the block.

In an example, a filtering tool is used to determine the entries of the vector based on the neighboring samples of the block. The filtering tool can be the same one used in a non-matrix based intra prediction (e.g., regular intra prediction).

In another example, a subset of the neighboring samples of the block is selected as the entries of the vector based on positions of the neighboring samples with reference to the block.

In another example, a first portion of the entries of the vector is determined based on filtering first neighboring samples on a first side of the block, and a second portion of the entries of the vector is selected from second neighboring samples on a second side of the block.

At (S1630), the entries of the vector are converted into a reduced bit form with a number of bits satisfying a requirement of using a first multiplication tool that processes fewer bits than a second multiplication tool.

In an example, the entries of the vector are right shifted by one or more bits. In another example, the entries of the vector are clipped into a range corresponding to fewer bits. In another example, the entries of the vector are first clipped and then right-shifted. In some examples, a weight shifting variable that is used for aligning multiplication results is modified based on the number of bits in the right-shifting.

In an example, the number of bits to shift is determined based on an internal bit depth. In another example, the number of bits to shift is determined based on a signal in a high level syntax. In another example, the number of bits to shift is determined based on a look-up table indexed. In another example, a lookup table can be decoded from a high level syntax, and the number of bits is determined from the lookup table which is indexed by an internal bit depth.

In some embodiments, the entries of the matrix are adjusted to unify the entries of the matrix to have a same sign based on a factor parameter fW. The factor parameter fW has an integer value that is a power of two (e.g., 64, 128).

At (S1640), the entries of the vector in the reduced bit form are multiplied, using the first multiplication tool, with entries of a matrix to calculate a subset of prediction samples of the block.

At (S1650), other prediction samples of the block are determined based on the subset of the prediction samples of the block. In an embodiment, one or more other prediction samples between two prediction samples in the subset are determined based on the two samples, such as a linear interpolation of the two samples. In another embodiment, one or more other prediction samples between two prediction samples in the subset are determined based on an average of the two samples. Then, the process proceeds to (S1699) and terminates.

The techniques described above, can be implemented as computer software using computer-readable instructions and physically stored in one or more computer-readable media. For example, FIG. 17 shows a computer system (1700) suitable for implementing certain embodiments of the disclosed subject matter.

The computer software can be coded using any suitable machine code or computer language, that may be subject to assembly, compilation, linking, or like mechanisms to create code comprising instructions that can be executed directly, or through interpretation, micro-code execution, and the like, by one or more computer central processing units (CPUs), Graphics Processing Units (GPUs), and the like.

The instructions can 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, and the like.

The components shown in FIG. 17 for computer system (1700) are exemplary in nature and are not intended to suggest any limitation as to the scope of use or functionality of the computer software implementing embodiments of the present disclosure. Neither should the configuration of components be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary embodiment of a computer system (1700).

Computer system (1700) may include certain human interface input devices. Such a human interface input device may be responsive to input by one or more human users through, for example, tactile input (such as: keystrokes, swipes, data glove movements), audio input (such as: voice, clapping), visual input (such as: gestures), olfactory input (not depicted). The human interface devices can also be used to capture certain media not necessarily directly related to conscious input by a human, such as audio (such as: speech, music, ambient sound), images (such as: scanned images, photographic images obtain from a still image camera), video (such as two-dimensional video, three-dimensional video including stereoscopic video).

Input human interface devices may include one or more of (only one of each depicted): keyboard (1701), mouse (1702), trackpad (1703), touch screen (1710), data-glove (not shown), joystick (1705), microphone (1706), scanner (1707), camera (1708).

Computer system (1700) may also include certain human interface output devices. Such human interface output devices may be stimulating the senses of one or more human users through, for example, tactile output, sound, light, and smell/taste. Such human interface output devices may include tactile output devices (for example tactile feedback by the touch-screen (1710), data-glove (not shown), or joystick (1705), but there can also be tactile feedback devices that do not serve as input devices), audio output devices (such as: speakers (1709), headphones (not depicted)), visual output devices (such as screens (1710) to include CRT screens, LCD screens, plasma screens, OLED screens, each with or without touch-screen input capability, each with or without tactile feedback capability-some of which may be capable to output two dimensional visual output or more than three dimensional output through means such as stereographic output; virtual-reality glasses (not depicted), holographic displays and smoke tanks (not depicted)), and printers (not depicted).

Computer system (1700) can also include human accessible storage devices and their associated media such as optical media including CD/DVD ROM/RW (1720) with CD/DVD or the like media (1721), thumb-drive (1722), removable hard drive or solid state drive (1723), legacy magnetic media such as tape and floppy disc (not depicted), specialized ROM/ASIC/PLD based devices such as security dongles (not depicted), and the like.

Those skilled in the art should also understand that term “computer readable media” as used in connection with the presently disclosed subject matter does not encompass transmission media, carrier waves, or other transitory signals.

Computer system (1700) can also include an interface to one or more communication networks. Networks can for example be wireless, wireline, optical. Networks can further be local, wide-area, metropolitan, vehicular and industrial, real-time, delay-tolerant, and so on. Examples of networks include local area networks such as Ethernet, wireless LANs, cellular networks to include GSM, 3G, 4G, 5G, LTE and the like, TV wireline or wireless wide area digital networks to include cable TV, satellite TV, and terrestrial broadcast TV, vehicular and industrial to include CANBus, and so forth. Certain networks commonly require external network interface adapters that attached to certain general purpose data ports or peripheral buses (1749) (such as, for example USB ports of the computer system (1700)); others are commonly integrated into the core of the computer system (1700) by attachment to a system bus as described below (for example Ethernet interface into a PC computer system or cellular network interface into a smartphone computer system). Using any of these networks, computer system (1700) can communicate with other entities. Such communication can be uni-directional, receive only (for example, broadcast TV), uni-directional send-only (for example CANbus to certain CANbus devices), or bi-directional, for example to other computer systems using local or wide area digital networks. Certain protocols and protocol stacks can be used on each of those networks and network interfaces as described above.

Aforementioned human interface devices, human-accessible storage devices, and network interfaces can be attached to a core (1740) of the computer system (1700).

The core (1740) can include one or more Central Processing Units (CPU) (1741), Graphics Processing Units (GPU) (1742), specialized programmable processing units in the form of Field Programmable Gate Areas (FPGA) (1743), hardware accelerators for certain tasks (1744), and so forth. These devices, along with Read-only memory (ROM) (1745), Random-access memory (1746), internal mass storage such as internal non-user accessible hard drives, SSDs, and the like (1747), may be connected through a system bus (1748). In some computer systems, the system bus (1748) can be accessible in the form of one or more physical plugs to enable extensions by additional CPUs, GPU, and the like. The peripheral devices can be attached either directly to the core's system bus (1748), or through a peripheral bus (1749). Architectures for a peripheral bus include PCI, USB, and the like.

CPUs (1741), GPUs (1742), FPGAs (1743), and accelerators (1744) can execute certain instructions that, in combination, can make up the aforementioned computer code. That computer code can be stored in ROM (1745) or RAM (1746). Transitional data can be also be stored in RAM (1746), whereas permanent data can be stored for example, in the internal mass storage (1747). Fast storage and retrieve to any of the memory devices can be enabled through the use of cache memory, that can be closely associated with one or more CPU (1741), GPU (1742), mass storage (1747), ROM (1745), RAM (1746), and the like.

The computer readable media can have computer code thereon for performing various computer-implemented operations. The media and computer code can be those 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.

As an example and not by way of limitation, the computer system having architecture (1700), and specifically the core (1740) can provide functionality as a result of processor(s) (including CPUs, GPUs, FPGA, accelerators, and the like) executing software embodied in one or more tangible, computer-readable media. Such computer-readable media can be media associated with user-accessible mass storage as introduced above, as well as certain storage of the core (1740) that are of non-transitory nature, such as core-internal mass storage (1747) or ROM (1745). The software implementing various embodiments of the present disclosure can be stored in such devices and executed by core (1740). A computer-readable medium can include one or more memory devices or chips, according to particular needs. The software can cause the core (1740) and specifically the processors therein (including CPU, GPU, FPGA, and the like) to execute particular processes or particular parts of particular processes described herein, including defining data structures stored in RAM (1746) and modifying such data structures according to the processes defined by the software. In addition or as an alternative, the computer system can provide functionality as a result of logic hardwired or otherwise embodied in a circuit (for example; accelerator (1744)), which can operate in place of or together with software to execute particular processes or particular parts of particular processes described herein. Reference to software can encompass logic, and vice versa, where appropriate. Reference to a computer-readable media can encompass a circuit (such as an integrated circuit (IC) storing software for execution, a circuit embodying logic for execution, or both, where appropriate. The present disclosure encompasses any suitable combination of hardware and software.

APPENDIX A: ACRONYMS

• JEM: joint exploration model
• VVC: versatile video coding
• BMS: benchmark set
• MV: Motion Vector
• HEVC: High Efficiency Video Coding
• SEI: Supplementary Enhancement Information
• VUI: Video Usability Information
• GOPs: Groups of Pictures
• TUs: Transform Units,
• PUs: Prediction Units
• CTUs: Coding Tree Units
• CTBs: Coding Tree Blocks
• PBs: Prediction Blocks
• HRD: Hypothetical Reference Decoder
• SNR: Signal Noise Ratio
• CPUs: Central Processing Units
• GPUs: Graphics Processing Units
• CRT: Cathode Ray Tube
• LCD: Liquid-Crystal Display
• OLED: Organic Light-Emitting Diode
• CD: Compact Disc
• DVD: Digital Video Disc
• ROM: Read-Only Memory
• RAM: Random Access Memory
• ASIC: Application-Specific Integrated Circuit
• PLD: Programmable Logic Device
• LAN: Local Area Network
• GSM: Global System for Mobile communications
• LTE: Long-Term Evolution
• CANBus: Controller Area Network Bus
• USB: Universal Serial Bus
• PCI: Peripheral Component Interconnect
• FPGA: Field Programmable Gate Areas
• SSD: solid-state drive
• IC: Integrated Circuit
• CU: Coding Unit

While this disclosure has described several exemplary embodiments, there are alterations, permutations, and various substitute equivalents, which fall within the scope of the disclosure. It will thus be appreciated that those skilled in the art will be able to devise numerous systems and methods which, although not explicitly shown or described herein, embody the principles of the disclosure and are thus within the spirit and scope thereof.

Claims

1. A method for video encoding, comprising: receiving samples of a current block in a current picture;encoding, by processing circuitry of an encoding apparatus, the samples of the current block according to a matrix based intra prediction to obtain encoded data, the encoding the samples of the current block including: determining entries of a vector based on neighboring samples of the current block, each entry of the entries being determined based on corresponding one or more of the neighboring samples of the current block, the entries of the vector being in an internal bit form having an internal bit depth greater than a threshold bit depth for using a first multiplication tool implemented in the encoding apparatus that processes fewer bits than a second multiplication tool implemented in the encoding apparatus;converting the entries of the vector into a reduced bit form having a reduced bit depth satisfying the threshold bit depth for using the first multiplication tool implemented in the encoding apparatus;multiplying, using the first multiplication tool, the entries of the vector in the reduced bit form with entries of a matrix to calculate a subset of prediction samples of the current block;determining other ones of the prediction samples of the current block based on the subset of the prediction samples of the current block; andencoding the samples of the current block according to the prediction samples of the current block; andgenerating a coded video bitstream, the coded video bitstream including the encoded data and prediction information indicative of the matrix based intra prediction for the current block.

2. The method of claim 1, wherein the converting the entries of the vector into the reduced bit form comprises at least one of: right shifting a particular entry of the entries by one or more bits; andclipping the particular entry to a range corresponding to fewer bits.

3. The method of claim 1, wherein the converting the entries of the vector into the reduced bit form comprises right shifting the entries of the vector by a number of bits, andthe method further comprises modifying, based on the number of bits, a weight shifting variable that is used for aligning multiplication results.

4. The method of claim 3, further comprising at least one of: determining the number of bits to shift based on the internal bit depth;determining the number of bits to shift based on a signal in a high level syntax; anddetermining the number of bits to shift based on a look-up table.

5. The method of claim 3, further comprising: decoding a look-up table from a high level syntax; anddetermining the number of bits from the look-up table indexed by the internal bit depth.

6. The method of claim 1, further comprising: using a filtering tool to determine the entries of the vector based on the neighboring samples of the current block, the filtering tool being used in a non-matrix based intra prediction.

7. The method of claim 1, further comprising: selecting a subset of the neighboring samples of the current block as the entries of the vector based on positions of the neighboring samples with reference to the current block.

8. The method of claim 1, further comprising: filtering first neighboring samples on a first side of the current block to determine a first portion of the entries of the vector; andselecting a second portion of the entries of the vector from second neighboring samples on a second side of the current block.

9. The method of claim 1, wherein the other ones of the prediction samples of the current block are determined by applying a linear interpolation based on the subset of the prediction samples of the current block.

10. An apparatus for video encoding, comprising: processing circuitry configured to: receive samples of a current block in a current picture;encode the samples of the current block according to a matrix based intra prediction to obtain encoded data, the samples of the current block are encoded by performing: determination of entries of a vector based on neighboring samples of the current block, each entry of the entries being determined based on corresponding one or more of the neighboring samples of the current block, the entries of the vector being in an internal bit form having an internal bit depth greater than a threshold bit depth for using a first multiplication tool implemented in the apparatus that processes fewer bits than a second multiplication tool implemented in the apparatus;conversion of the entries of the vector into a reduced bit form having a reduced bit depth satisfying the threshold bit depth for using the first multiplication tool implemented in the apparatus;multiplication, using the first multiplication tool, of the entries of the vector in the reduced bit form and entries of a matrix to calculate a subset of prediction samples of the current block;determination of other ones of the prediction samples of the current block based on the subset of the prediction samples of the current block; andencoding of the samples of the current block according to the prediction samples of the current block; andgenerate a coded video bitstream, the coded video bitstream including the encoded data and prediction information indicative of the matrix based intra prediction for the current block.

11. The apparatus of claim 10, wherein the processing circuitry is configured to perform the conversion of the entries of the vector into the reduced bit form by at least one of: right shifting a particular entry of the entries by one or more bits; andclipping the particular entry to a range corresponding to fewer bits.

12. The apparatus of claim 10, wherein the processing circuitry is configured to: perform the conversion of the entries of the vector into the reduced bit form by right shifting the entries of the vector by a number of bits; andmodify, based on the number of bits, a weight shifting variable that is used for aligning multiplication results.

13. The apparatus of claim 12, wherein the processing circuitry is configured to determine the number of bits based on at least one of: the internal bit depth,a signal in a high level syntax, anda look-up table.

14. The apparatus of claim 10, wherein the processing circuitry is configured to: use a filtering tool to determine the entries of the vector based on the neighboring samples of the current block, the filtering tool being used in a non-matrix based intra prediction.

15. The apparatus of claim 10, wherein the processing circuitry is configured to: select a subset of the neighboring samples of the current block as the entries of the vector based on positions of the neighboring samples with reference to the current block.

16. The apparatus of claim 10, wherein the other ones of the prediction samples of the current block are determined by applying a linear interpolation based on the subset of the prediction samples of the current block.

17. A non-transitory computer-readable medium storing instructions which when executed by a computer cause the computer to perform: receiving samples of a current block in a current picture;encoding the samples of the current block according to a matrix based intra prediction to obtain encoded data, the encoding the samples of the current block including: determining entries of a vector based on neighboring samples of the current block, each entry of the entries being determined based on corresponding one or more of the neighboring samples of the current block, the entries of the vector being in an internal bit form having an internal bit depth greater than a threshold bit depth for using a first multiplication tool implemented in the computer that processes fewer bits than a second multiplication tool implemented in the computer;converting the entries of the vector into a reduced bit form having a reduced bit depth satisfying the threshold bit depth for using the first multiplication tool implemented in the computer;multiplying, using the first multiplication tool, the entries of the vector in the reduced bit form with entries of a matrix to calculate a subset of prediction samples of the current block;determining other ones of the prediction samples of the current block based on the subset of the prediction samples of the current block; andencoding the samples of the current block according to the prediction samples of the current block; andgenerating a coded video bitstream, the coded video bitstream including the encoded data and prediction information indicative of the matrix based intra prediction for the current block.

18. The non-transitory computer-readable medium of claim 17, wherein the converting the entries of the vector into the reduced bit form comprises at least one of: right shifting a particular entry of the entries by one or more bits; andclipping the particular entry to a range corresponding to fewer bits.

19. The non-transitory computer-readable medium of claim 17, wherein the converting the entries of the vector into the reduced bit form comprises right shifting the entries of the vector by a number of bits, andthe instructions which when executed by the computer cause the computer to further perform: modifying, based on the number of bits, a weight shifting variable that is used for aligning multiplication results.

20. The non-transitory computer-readable medium of claim 17, wherein the other ones of the prediction samples of the current block are determined by applying a linear interpolation based on the subset of the prediction samples of the current block.