METHOD AND APPARATUS FOR VIDEO CODING - Patent application

Abstract

To provide a method, an apparatus, and a non-transitory computer-readable storage medium for video encoding / decoding.SOLUTION: An apparatus includes processing circuitry that decodes prediction information of a current block in a current picture that is a part of a coded video bitstream. The prediction information indicates a non-directional intra prediction mode for the current block. The processing circuitry partitions the current block into a plurality of partitions. The plurality of partitions include at least one L-shaped partition. The processing circuitry reconstructs one of the plurality of partitions based on at least one of (i) neighboring reconstructed samples of the one of the plurality of partitions or (ii) neighboring reconstructed samples of the current block.SELECTED DRAWING: Figure 25A

Description

[Technical field]

[0001] Incorporation by Reference This application claims benefit of priority to U.S. Provisional Application No. 63 / 084,460, entitled "Non-Directional Intra Prediction for L-Shape Partitioning," filed September 28, 2020, which claims benefit of priority to U.S. Provisional Application No. 17 / 469,500, entitled "Method and Apparatus for Video Coding," filed September 8, 2021, which is incorporated by reference in its entirety herein.

[0002] This disclosure describes embodiments generally related to video coding. [Background technology]

[0003] The background discussion provided herein is intended to generally present the context of the present disclosure. The inventors' work, to the extent that this work is described in this background section, and aspects of the description that may not be considered prior art at the time of filing, are not admitted expressly or impliedly as prior art to the present disclosure.

[0004] Video coding and decoding may be performed using inter-picture prediction with motion compensation. Uncompressed digital video may include a sequence of pictures, each having spatial dimensions of, for example, 1920x1080 luminance samples and associated chrominance samples. The sequence of pictures may have a fixed or variable picture rate (also informally known as frame rate), for example, 60 pictures per second or 60 Hz. Uncompressed video has significant bitrate requirements. For example, 1080p60 4:2:0 video (1920x1080 luminance sample resolution at a frame rate of 60 Hz) with 8 bits per sample requires a bandwidth approaching 1.5 Gbit / s. One hour of such video requires more than 600 GByte of storage space.

[0005] One objective of video coding and decoding may be the reduction of redundancy in the input video signal through compression. Compression may help reduce the aforementioned bandwidth or storage space requirements, in some cases by more than two orders of magnitude. Both lossless and lossy compression, as well as combinations of these, may be used. 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 the original and reconstructed signals is small enough to utilize the reconstructed signal for its intended application. For video, lossy compression is widely used. The amount of acceptable distortion depends on the application, for example, a user of a particular consumer streaming application may tolerate higher distortion than a user of a television distribution application. The achievable compression ratio may reflect that a higher acceptable / tolerable distortion may result in a higher compression ratio.

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

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

[0008] Conventional intra-coding, for example as known from MPEG-2 generation coding techniques, does not use intra-prediction. However, some newer video compression techniques include techniques that try from surrounding sample data and / or metadata obtained during encoding and / or decoding of spatially adjacent and preceding data blocks in decoding order. Such techniques are hereafter referred to as "intra-prediction" techniques. It should be noted that, at least in some cases, intra-prediction uses only reference data from the current picture being reconstructed, and not from reference pictures.

[0009] There may be many different forms of intra-prediction. If more than one of such techniques may be used in a given video coding technique, the technique in use may be coded in an intra-prediction mode. In some cases, the mode may have sub-modes and / or parameters, which may be coded separately or included in the mode codeword. Which codeword is used for a given mode, sub-mode, and / or parameter combination may affect the coding efficiency / gain with intra-prediction, and therefore may also affect the entropy coding technique used to convert the codeword into a bitstream.

[0010] A specific mode of intra prediction was introduced in H.264, improved in H.265, and further refined in newer coding techniques such as the joint exploration model (JEM), versatile video coding (VVC), and benchmark sets (BMS). A predictor block may be formed using neighboring sample values ​​belonging to already available samples. The sample values ​​of the neighboring samples are copied to the predictor block according to the direction. The reference to the direction in use may be coded in the bitstream or may itself be predicted.

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

[0012] 1A, at the top left is shown a square block (104) of 4×4 samples (indicated by a thick dashed line). The square block (104) contains 16 samples, each of which is labeled 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 (from the top) in the Y dimension and the first sample (from the left) in the X dimension. Similarly, sample S44 is the fourth sample in both the Y and X dimensions in the block (104). Since the size of the block is 4×4 samples, S44 is at the bottom right. Also shown are reference samples that follow a similar numbering scheme. The reference samples are labeled with R, their Y position (e.g., row index), and X position (column index) relative to the block (104). In both H.264 and H.265, the prediction samples are adjacent to the block being reconstructed, so negative values ​​do not need to be used.

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

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

[0015] The number of possible directions is increasing as video coding techniques develop. In H.264 (2003), nine different directions can be represented. This has increased to 33 in H.265 (2013), and at the time of this disclosure, JEM / VVC / BMS can support up to 65 directions. Experiments have been conducted to identify the most likely directions, and certain techniques of entropy coding are used to represent those likely directions with a small number of bits, accepting a certain penalty for the less likely directions. Furthermore, the direction itself may be predicted from neighboring directions used in neighboring already decoded blocks.

[0016] FIG. 1B shows a schematic diagram (105) showing 65 intra prediction directions with JEM to illustrate the increasing number of prediction directions over time.

[0017] The mapping of intra-prediction direction bits in a coded video bitstream that represent the direction may vary from one video coding technique to another, ranging from simple direct mappings from prediction directions to intra-prediction modes, to complex adaptation schemes involving codewords, most likely modes, and similar techniques. In all cases, however, there may be certain directions that are statistically less likely than certain other directions in the video content. Because the goal of video compression is to reduce redundancy, these less likely directions are represented by more bits than the more likely directions in a video coding technique that works well.

[0018] Motion compensation may be a lossy compression technique and may refer to a technique used to predict a newly reconstructed picture or picture portion after blocks of sample data from a previously reconstructed picture or portion thereof (reference picture) are spatially shifted in a direction indicated by a motion vector (hereinafter MV). In some cases, the reference picture may be the same as the picture currently being reconstructed. The MV may have two dimensions X and Y, or three dimensions, with the third dimension being an indication of the reference picture in use (the latter may indirectly be a temporal dimension).

[0019] In some video compression techniques, the MV applicable to a particular region of sample data may be predicted from other MVs, e.g., from an MV associated with another region of sample data that is spatially adjacent to the region being reconstructed and precedes that MV in decoding order. Doing so may significantly reduce the amount of data required to code the MV, resulting in the elimination of redundancy and increased compression. For example, when coding an input video signal derived from a camera (known as natural video), MV prediction may work effectively because there is a statistical likelihood that regions larger than the region to which a single MV is applicable move in similar directions and therefore, in some cases, may be predicted using similar MVs derived from MVs of neighboring regions. This results in the MV found for a given region being similar or the same as the MV predicted from the surrounding MVs, and as a result, after entropy coding, it may be represented with fewer bits than would be used if coding the MV directly. In some cases, MV prediction may be an example of lossless compression of a signal (i.e., MV) derived from the original signal (i.e., sample stream). In other cases, the MV prediction itself may be lossy, e.g., due to rounding errors when computing a predictor from some surrounding MVs.

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

[0021] Referring to FIG. 1C, the current block (111) may include samples found by the encoder during a motion search process that are predictable from a previous block of the same size but spatially shifted. Instead of coding its MV directly, the MV may be derived from metadata associated with one or more reference pictures, e.g., the most recent reference picture (in decoding order), using MVs associated with any one of the five surrounding samples represented by A0, A1 and B0, B1, B2 (112 to 116, respectively). In H.265, MV prediction may use predictors from the same reference picture that neighboring blocks are using. Summary of the Invention [Means for solving the problem]

[0022] An aspect of the present disclosure provides an apparatus for video encoding / decoding. The apparatus includes a processing circuit that decodes prediction information of a current block in a current picture that is part of a coded video bitstream. The prediction information indicates a non-directional intra-prediction mode for the current block. The processing circuit partitions the current block into a plurality of partitions. The plurality of partitions includes at least one L-shaped partition. The processing circuit reconstructs one of the plurality of partitions based on (i) neighboring reconstructed samples of one of the plurality of partitions or (ii) at least one of neighboring reconstructed samples of the current block.

[0023] In one embodiment, at least one of the adjacent reconstructed samples is located adjacent to one of the right or below one of the multiple sections.

[0024] In one embodiment, one of the plurality of segments is an L-shaped segment, and the number of adjacent reconstructed samples depends on a dimension of the L-shaped segment. In one example, the number of adjacent reconstructed samples is the sum of a width and a height of the L-shaped segment. In another example, the number of adjacent reconstructed samples is the sum of a shorter width and a shorter height of the L-shaped segment. In another example, the number of adjacent reconstructed samples is the maximum value of a width and a height of the L-shaped segment. In another example, the number of adjacent reconstructed samples is the minimum value of a width and a height of the L-shaped segment.

[0025] In one embodiment, at least one of the adjacent reconstructed samples is located in another one of the plurality of partitions that was reconstructed before one of the plurality of partitions. In one example, the other one of the plurality of partitions is an L-shaped partition, and at least one of the adjacent reconstructed samples is located adjacent to one of the right side or below one of the plurality of partitions.

[0026] In one embodiment, the processing circuit determines a plurality of adjacent reference samples of the one of the plurality of partitions based on at least one of (i) adjacent reconstructed samples of the one of the plurality of partitions, or (ii) adjacent reconstructed samples of the current block. The processing circuit reconstructs the one of the plurality of partitions based on the plurality of adjacent reference samples.

[0027] In one example, the adjacent reconstructed samples include adjacent reconstructed samples of a left column and a right column of one of the multiple partitions. The processing circuit determines adjacent reference samples of a lower row of one of the multiple partitions based on the adjacent reconstructed samples of the left column and the right column of one of the multiple partitions. The processing circuit reconstructs one of the multiple partitions based on the adjacent reference samples of a lower row of one of the multiple partitions.

[0028] In one example, the adjacent reconstructed samples include adjacent reconstructed samples in upper and lower rows of one of the multiple partitions. The processing circuit determines adjacent reference samples in a left column of one of the multiple partitions based on the adjacent reconstructed samples in the upper and lower rows of one of the multiple partitions. The processing circuit reconstructs one of the multiple partitions based on the adjacent reference samples in the left column of one of the multiple partitions.

[0029] In one embodiment, one of the multiple partitions is an L-shaped partition, and the processing circuit reconstructs one of the multiple partitions based on adjacent reconstructed samples in a left column and an upper row of the current block.

[0030] In one embodiment, based on one of the plurality of partitions being an L-shaped partition, the processing circuit determines, for each sample of the L-shaped partition, a plurality of adjacent reference samples based on a position of the respective sample. The processing circuit reconstructs each sample of the L-shaped partition based on the plurality of adjacent reference samples of the respective sample.

[0031] In one embodiment, the multiple neighboring reference samples for each sample include reconstructed neighboring samples and neighboring samples reconstructed based on the reconstructed neighboring samples.

[0032] An aspect of the present disclosure provides a method for video encoding / decoding. In the method, prediction information of a current block in a current picture that is part of a coded video bitstream is decoded. The prediction information indicates a non-directional intra-prediction mode for the current block. The current block is partitioned into a plurality of partitions. The plurality of partitions includes at least one L-shaped partition. One of the plurality of partitions is determined based on at least one of (i) neighboring reconstructed samples of one of the plurality of partitions, or (ii) neighboring reconstructed samples of the current block.

[0033] Aspects of the present disclosure also provide a non-transitory computer-readable medium storing instructions that, when executed by at least one processor, cause the at least one processor to perform any one or combination of methods for video decoding.

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

[0035] [Figure 1A] FIG. 2 is a schematic diagram of an example subset of intra-prediction modes. [Figure 1B] FIG. 2 is a diagram of an example intra-prediction direction. [Figure 1C] FIG. 2 is a schematic diagram of a current block and its surrounding spatial merge candidates in one example. [Diagram 2] FIG. 1 is a schematic diagram of a simplified block diagram of a communication system according to one embodiment. [Diagram 3] FIG. 1 is a schematic diagram of a simplified block diagram of a communication system according to one embodiment. [Figure 4] FIG. 2 is a schematic diagram of a simplified block diagram of a decoder according to one embodiment. [Diagram 5] FIG. 2 is a schematic diagram of a simplified block diagram of an encoder according to one embodiment. [Figure 6] 4 shows a block diagram of an encoder according to another embodiment; [Figure 7] 4 shows a block diagram of a decoder according to another embodiment; [Figure 8] 1 illustrates an example block partition according to some embodiments of the present disclosure. [Figure 9] 1 illustrates an exemplary quadtree having a nested binary tree structure, according to one embodiment of the present disclosure. [Figure 10] 1 illustrates an example block partitioning in a multi-type tree structure in accordance with some embodiments of the present disclosure. [Figure 11] 1 illustrates an exemplary L-section according to one embodiment of the present disclosure. [Figure 12] 1 illustrates an example block partition using L-type partitioning, according to some embodiments of the present disclosure. [Figure 13] 1 illustrates an exemplary nominal angle according to one embodiment of the present disclosure. [Figure 14] 1 illustrates the locations of the top, left, and top-left samples relative to a pixel in the current block, according to one embodiment of the present disclosure. [Figure 15] 1 illustrates an exemplary recursive filter intra mode according to one embodiment of the present disclosure. [Figure 16] 1 illustrates an exemplary multi-line intra prediction using four reference lines adjacent to a coding block unit according to one embodiment of the present disclosure. [Figure 17A] 1 illustrates an exemplary reference sample chain (RSC) according to some embodiments of the present disclosure. [Figure 17B] 1 illustrates an exemplary reference sample chain (RSC) according to some embodiments of the present disclosure. [Figure 17C] 1 illustrates an exemplary reference sample chain (RSC) according to some embodiments of the present disclosure. [Figure 17D] 1 illustrates an exemplary reference sample chain (RSC) according to some embodiments of the present disclosure. [Figure 17E] 1 illustrates an exemplary reference sample chain (RSC) according to some embodiments of the present disclosure. [Figure 17F] 1 illustrates an exemplary reference sample chain (RSC) according to some embodiments of the present disclosure. [Figure 18] 1 illustrates an exemplary RSC according to one embodiment of the present disclosure. [Figure 19A] 1 illustrates an exemplary RSC according to some embodiments of the present disclosure. [Figure 19B] 1 illustrates an exemplary RSC according to some embodiments of the present disclosure. [Figure 20A] 1 illustrates an exemplary RSC according to some embodiments of the present disclosure. [Figure 20B] 1 illustrates an exemplary RSC according to some embodiments of the present disclosure. [Figure 20C]1 illustrates an exemplary RSC according to some embodiments of the present disclosure. [Figure 20D] 1 illustrates an exemplary RSC according to some embodiments of the present disclosure. [Figure 21] 1 illustrates an exemplary RSC according to one embodiment of the present disclosure. [Figure 22A] 1 illustrates an exemplary RSC according to some embodiments of the present disclosure. [Figure 22B] 1 illustrates an exemplary RSC according to some embodiments of the present disclosure. [Figure 23A] 1 illustrates an exemplary RSC according to some embodiments of the present disclosure. [Figure 23B] 1 illustrates an exemplary RSC according to some embodiments of the present disclosure. [Figure 24] 1 illustrates an exemplary RSC according to one embodiment of the present disclosure. [Figure 25A] 1 illustrates an exemplary RSC according to some embodiments of the present disclosure. [Figure 25B] 1 illustrates an exemplary RSC according to some embodiments of the present disclosure. [Figure 26] 1 illustrates an exemplary flow chart according to one embodiment of the present disclosure. [Figure 27] FIG. 1 is a schematic diagram of a computer system according to one embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0036] I. Video Decoder and Encoder Systems FIG. 2 shows a simplified block diagram of a communication system (200) according to one embodiment of the present disclosure. The communication system (200) includes a plurality of terminal devices that may communicate with each other, for example, via a network (250). For example, the communication system (200) includes a first pair of terminal devices (210) and (220) interconnected via the network (250). In the example of FIG. 2, the first pair of terminal devices (210) and (220) perform unidirectional transmission of data. For example, the terminal device (210) may code video data (e.g., a stream of video pictures captured by the terminal device (210)) for transmission to another terminal device (220) via the network (250). The encoded video data may be transmitted in the form of one or more coded video bitstreams. The terminal device (220) may receive the coded video data from the network (250), decode the coded video data to reconstruct the video pictures, and display the video pictures according to the reconstructed video data. Unidirectional data transmission may be common, such as in media serving applications.

[0037] In another example, the communication system (200) includes a second pair of terminal devices (230) and (240) performing bidirectional transmission of coded video data, which may take place, for example, during a video conference. For the bidirectional transmission of data, in one example, each of the terminal devices (230) and (240) may code video data (e.g., a stream of video pictures captured by the terminal device) for transmission to the other of the terminal devices (230) and (240) over the network (250). Each of the terminal devices (230) and (240) may also receive coded video data transmitted by the other of the terminal devices (230) and (240), decode the coded video data to recover the video pictures, and display the video pictures on an accessible display device according to the recovered video data.

[0038] In the example of FIG. 2, the terminal devices (210), (220), (230), and (240) may be depicted as a server, a personal computer, and a smartphone, although the principles of the present disclosure may not be so limited. The embodiments of the present disclosure apply to laptop computers, tablet computers, media players, and / or dedicated video conferencing equipment. The network (250) represents any number of networks that convey coded video data between the terminal devices (210), (220), (230), and (240), including, for example, wired and / or wireless communication networks. The communication network (250) may exchange data over circuit-switched and / or packet-switched channels. Representative networks include telecommunications networks, local area networks, wide area networks, and / or the Internet. For purposes of this discussion, the architecture and topology of the network (250) may not be important to the operation of the present disclosure unless otherwise described herein below.

[0039] 3 shows an arrangement of a video encoder and a video decoder in a streaming environment as an example of an application of the disclosed subject matter. The disclosed subject matter may be equally applicable to other video-enabled applications including, for example, video conferencing, digital TV, storage of compressed video on digital media including CDs, DVDs, memory sticks, and the like.

[0040] The streaming system may include a video source (301), which may include, for example, a digital camera, that creates a stream of uncompressed video pictures (302). In one example, the stream of video pictures (302) includes samples taken by a digital camera. The stream of video pictures (302), shown as a thick line to emphasize its large data volume compared to the encoded video data (304) (or coded video bitstream), may be processed by an electronic device (320) coupled to the video source (301) that includes a video encoder (303). The video encoder (303) may include hardware, software, or a combination thereof to enable or achieve aspects of the disclosed subject matter, as described in more detail below. The encoded video data (304) (or encoded video bitstream (304)), shown as a thin line to emphasize its smaller data volume compared to the stream of video pictures (302), may be stored in a streaming server (305) for future use. One or more streaming client subsystems, such as the client subsystems (306) and (308) of FIG. 3, may access the streaming server (305) to retrieve copies (307) and (309) of the encoded video data (304). The client subsystem (306) may include a video decoder (310), for example within an electronic device (330). The video decoder (310) decodes an input copy (307) of the encoded video data and creates an output stream (311) of video pictures that may be rendered on a display (312) (e.g., a display screen) or other rendering device (not shown). In some streaming systems, the encoded video data (304), (307), and (309) (e.g., a video bitstream) may be coded according to a particular video coding / compression standard. Examples of such standards include ITU-T Recommendation H.265.In one example, a video coding standard under development is informally known as Versatile Video Coding (VVC), and the disclosed subject matter may be used in the context of VVC.

[0041] It should be noted that the electronic devices (320) and (330) may include other components (not shown). For example, the electronic device (320) may include a video decoder (not shown), and the electronic device (330) may also include a video encoder (not shown).

[0042] 4 shows a block diagram of a video decoder (410) according to one embodiment of the present disclosure. The video decoder (410) may be included in an electronic device (430). The electronic device (430) may include a receiver (431) (e.g., a receiving circuit). The video decoder (410) may be used in place of the video decoder (310) of the example of FIG. 3.

[0043] The receiver (431) may receive one or more coded video sequences to be decoded by the video decoder (410), in the same or another embodiment, one coded video sequence at a time, where the decoding of each coded video sequence is independent of the other coded video sequences. The coded video sequences may be received from a channel (401), which may be a hardware / software link to a storage device that stores the encoded video data. The receiver (431) may receive the encoded video data along with other data, such as a coded audio data stream and / or an auxiliary data stream, that may be forwarded to a respective using entity (not shown). The receiver (431) may separate the coded video sequences from the other data. To combat network jitter, a buffer memory (415) may be coupled between the receiver (431) and the entropy decoder / parser (420) (hereinafter "parser (420)"). In certain applications, the buffer memory (415) is part of the video decoder (410). In others, it may be external to the video decoder (410) (not shown). In still others, there may be a buffer memory (not shown) external to the video decoder (410), e.g., to combat network jitter, plus another buffer memory (415) internal to the video decoder (410), e.g., to handle playout timing. If the receiver (431) is receiving data from a storage / forwarding device with sufficient bandwidth and controllability, or from an isosynchronous network, the buffer memory (415) may not be needed or may be small. For use with best-effort packet networks such as the Internet, the buffer memory (415) may be needed and may be relatively large, preferably adaptively sized, and may be implemented at least in part in an operating system or similar element (not shown) external to the video decoder (410).

[0044] The video decoder (410) may include a parser (420) for reconstructing symbols (421) from the coded video sequence. These categories of symbols include information used to manage the operation of the video decoder (410) and, in some cases, information for controlling a drawing device (e.g., a display screen), such as a drawing device (412) that is not an integral part of the electronic device (430) but may be coupled to the electronic device (430) as shown in FIG. 4. The drawing device control information may be in the form of a Supplemental Enhancement Information (SEI) message or a Video Usability Information (VUI) parameter set fragment (not shown). The parser (420) may parse / entropy decode the received coded video sequence. The coding of the coded video sequence may conform to a video coding technique or standard and may follow various principles including variable length coding, Huffman coding, and arithmetic coding with or without context dependency, etc. The parser (420) 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 on at least one parameter corresponding to the group. The subgroups may include Group of Pictures (GOPs), pictures, tiles, slices, macroblocks, coding units (CUs), blocks, transform units (TUs), prediction units (PUs), etc. The parser (420) may also extract from the coded video sequence information such as transform coefficients, quantizer parameter values, and MVs.

[0045] The parser (420) may perform an entropy decoding / parsing operation on the video sequence received from the buffer memory (415) to produce symbols (421).

[0046] The reconstruction of the symbols (421) may involve several different units, depending on the type of video picture or portion thereof being coded (inter-picture and intra-picture, inter-block and intra-block, etc.), as well as other factors. Which units are involved and how may be controlled by subgroup control information parsed from the coded video sequence by the parser (420). The flow of such subgroup control information between the parser (420) and the following units is not shown for clarity.

[0047] In addition to the functional blocks already mentioned, the video decoder (410) may be conceptually subdivided into several functional units, as described below. In an actual implementation operating under commercial constraints, many of these units may interact closely with each other and may be at least partially integrated with each other. However, for purposes of describing the disclosed subject matter, a conceptual subdivision into the following functional units is appropriate:

[0048] The first unit is a scalar / inverse transform unit (451), which receives quantized transform coefficients and control information from the parser (420) as symbols (421), including the transform to use, block size, quantization coefficients, quantization scaling matrix, etc. The scalar / inverse transform unit (451) may output blocks containing sample values ​​that may be input to an aggregator (455).

[0049] In some cases, the output samples of the scaler / inverse transform (451) may relate to intra-coded blocks, i.e., blocks that do not use prediction information from a previously reconstructed picture, but may use prediction information from a previously reconstructed portion of the current picture. Such prediction information may be provided by an intra-picture prediction unit (452). In some cases, the intra-picture prediction unit (452) generates a block of the same size and shape as the block being reconstructed using surrounding already reconstructed information fetched from a current picture buffer (458). The current picture buffer (458) buffers, for example, a partially reconstructed current picture and / or a fully reconstructed current picture. The aggregator (455) adds, possibly on a sample-by-sample basis, the prediction information generated by the intra-prediction unit (452) to the output sample information provided by the scaler / inverse transform unit (451).

[0050] In other cases, the output samples of the scaler / inverse transform unit (451) may relate to an inter-coded, possibly motion-compensated block. In such cases, the motion compensated prediction unit (453) may access a reference picture memory (457) to fetch samples used for prediction. After motion compensating the fetched samples according to the symbols (421) related to the block, these samples (in this case referred to as residual samples or residual signals) may be added to the output of the scaler / inverse transform unit (451) by an aggregator (455) to generate output sample information. The addresses in the reference picture memory (457) from which the motion compensated prediction unit (453) fetches the prediction samples may be controlled by the MVs available to the motion compensated prediction unit (453) in the form of symbols (421), which may have, for example, X, Y, and reference picture components. Motion compensation may also include interpolation of sample values ​​fetched from the reference picture memory (457) when sub-sample accurate MVs are used, MV prediction mechanisms, etc.

[0051] The output samples of the aggregator (455) may be subjected to various loop filtering techniques in a loop filter unit (456). Video compression techniques may include in-loop filter techniques controlled by parameters contained in the coded video sequence (also called a coded video bitstream) and made available to the loop filter unit (456) as symbols (421) from the parser (420), but may also be responsive to meta-information obtained during decoding of a previous portion (in decoding order) of the coded picture or coded video sequence, and to previously reconstructed loop filtered sample values.

[0052] The output of the loop filter unit (456) may be a sample stream that can be output to the rendering device (412) as well as stored in a reference picture memory (457) for use in future inter-picture prediction.

[0053] Once a particular coded picture has been fully reconstructed, it may be used as a reference picture for future prediction. For example, once a coded picture corresponding to a current picture has been fully reconstructed and the coded picture has been identified as a reference picture (e.g., by the parser (420)), the current picture buffer (458) may become part of the reference picture memory (457), and a new current picture buffer may be reallocated before beginning reconstruction of a subsequent coded picture.

[0054] The video decoder (410) may perform decoding operations according to a given video compression technique in a standard such as ITU-T Rec. H.265. The coded video sequence may comply with the syntax specified by the video compression technique or standard being used in the sense that the coded video sequence complies with both the syntax and the profile of the video compression technique or standard as documented in the video compression technique or standard. Specifically, the profile may select a particular tool as the only tool available for use under that profile, among all tools available in the video compression technique or standard. Also, what is required for compliance may be that the complexity of the coded video sequence is within a range defined by the level of the video compression technique or standard. In some cases, the level limits the maximum picture size, maximum frame rate, maximum reconstruction sample rate (e.g., measured in megasamples per second), maximum reference picture size, etc. The limits set by the level may be further limited in some cases by the specification of a Hypothetical Reference Decoder (HRD) and metadata of HRD buffer management signaled in the coded video sequence.

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

[0056] 5 shows a block diagram of a video encoder (503) according to one embodiment of the present disclosure. The video encoder (503) is included in an electronic device (520). The electronic device (520) includes a transmitter (540) (e.g., a transmission circuit). The video encoder (503) may be used in place of the example video encoder (303) of FIG.

[0057] The video encoder (503) may receive video samples from a video source (501) (not part of the electronic device (520) in the example of FIG. 5) that may capture video images to be coded by the video encoder (503). In another example, the video source (501) is part of the electronic device (520).

[0058] The video source (501) may provide a source video sequence to be coded by the video encoder (503) in the form of a digital video sample stream that may be of any suitable bit depth (e.g., 8-bit, 10-bit, 12-bit, ...), any color space (e.g., BT.601 Y CrCB, RGB, ...), and any suitable sampling structure (e.g., Y CrCb 4:2:0, Y CrCb 4:4:4). In a media serving system, the video source (501) may be a storage device that stores previously prepared video. In a video conferencing system, the video source (501) may be a camera that captures local image information as a video sequence. The video data may be provided as a number of individual pictures that convey motion when viewed in sequence. The pictures themselves may be organized as a spatial array of pixels, each of which may contain one or more samples depending on the sampling structure, color space, etc. in use. Those skilled in the art may readily understand the relationship between pixels and samples. The following description focuses on samples.

[0059] According to an embodiment, the video encoder (503) may code and compress pictures of a source video sequence into a coded video sequence (543) in real-time or under any other time constraints, depending on the requirements of the application. Achieving an appropriate coding rate is one function of the controller (550). In some embodiments, the controller (550) controls and is functionally coupled to other functional units as described below. For clarity, coupling is not shown. Parameters set by the controller (550) may include rate control related parameters (picture skip, quantizer, lambda value for rate distortion optimization techniques, ...), picture size, Group of Pictures (GOP) layout, and maximum MV allowed reference region, etc. The controller (550) may be configured with other appropriate functions related to the video encoder (503) optimized for a particular system design.

[0060] In some embodiments, the video encoder (503) is configured to operate in a coding loop. As an oversimplified explanation, in one example, the coding loop may include a source coder (530) (e.g., responsible for creating symbols, such as a symbol stream, based on an input picture to be coded and a reference picture) and a (local) decoder (533) embedded in the video encoder (503). The decoder (533) reconstructs the symbols to create sample data in a similar manner to that of the (remote) decoder (when the compression between the symbols and the coded video bitstream is lossless in the video compression techniques considered in the disclosed subject matter). The reconstructed sample stream (sample data) is input to a reference picture memory (534). The decoding of the symbol stream produces bit exact results regardless of the location of the decoder (local or remote), so the contents of the reference picture memory (534) are also bit exact between the local and remote encoders. In other words, the prediction part of the encoder "sees" exactly the same sample values ​​as the reference picture samples that the decoder "sees" when using prediction during decoding. This basic principle of reference picture synchrony (and the resulting drift when synchrony cannot be maintained, e.g., due to channel errors) is also used in some related technologies.

[0061] The operation of the "local" decoder (533) may be the same as that of a "remote" decoder, such as the video decoder (410), already described in detail above in connection with Figure 4. However, with brief reference also to Figure 4, because symbols are available and the encoding / decoding of symbols into / from a coded video sequence by the entropy coder (545) and parser (420) may be lossless, the entropy decoding portion of the video decoder (410), including the buffer memory (415) and parser (420), may not be fully implemented in the local decoder (533).

[0062] An observation that may be made at this point is that decoder techniques other than analysis / entropy decoding present in a decoder must necessarily be present in the corresponding encoder in substantially the same functional form. For this reason, the disclosed subject matter focuses on the decoder operation. A description of the encoder techniques may be omitted, since they are the inverse of the decoder techniques described generically. Only in certain areas are more detailed descriptions required and are provided below.

[0063] In operation, in some examples, the source coder (530) may perform motion-compensated predictive coding, which predictively codes an input picture with reference to one or more previously coded pictures from a video sequence, designated as “reference pictures.” In this manner, the coding engine (532) codes differences between pixel blocks of the input picture and pixel blocks of reference pictures that may be selected as predictive references for the input picture.

[0064] The local video decoder (533) may decode the coded video data of pictures that may be designated as reference pictures based on the symbols created by the source coder (530). The operation of the coding engine (532) may preferably be a lossy process. When the coded video data may be decoded in a video decoder (not shown in FIG. 5), the reconstructed video sequence may usually be a replica of the source video sequence with some errors. The local video decoder (533) may replicate the decoding process that may be performed by the video decoder on the reference pictures and store the reconstructed reference pictures in a reference picture cache (534). In this way, the video encoder (503) may locally store copies of reconstructed reference pictures that have common content with the reconstructed reference pictures obtained by the far-end video decoder (in the absence of transmission errors).

[0065] The predictor (535) may perform a prediction search for the coding engine (532). That is, for a new picture to be coded, the predictor (535) may search the reference picture memory (534) for sample data (as candidate reference pixel blocks) that may serve as suitable prediction references for the new picture, or for specific metadata such as reference picture MV and block shape. The predictor (535) may operate on a sample block-by-pixel block basis to find a suitable prediction reference. In some cases, as determined by the search results obtained by the predictor (535), the input picture may have a prediction reference drawn from among multiple reference pictures stored in the reference picture memory (534).

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

[0067] The output of all the aforementioned functional units may undergo entropy coding in an entropy coder (545), which converts the symbols produced by the various functional units into a coded video sequence by losslessly compressing the symbols according to techniques such as Huffman coding, variable length coding, and arithmetic coding.

[0068] The transmitter (540) may buffer the coded video sequence created by the entropy coder (545) to prepare it for transmission over a communication channel (560), which may be a hardware / software link to a storage device that stores the encoded video data. The transmitter (540) may merge the coded video data from the video coder (503) with other data to be transmitted, such as a coded audio data stream and / or an auxiliary data stream (source not shown).

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

[0070] An intra picture (I-picture) may be one that can be coded and decoded without using other pictures in a sequence as a source of prediction. Some video codecs support various types of intra pictures, including, for example, Independent Decoder Refresh ("IDR") pictures. Those skilled in the art are aware of these variants of I-pictures and their respective uses and characteristics.

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

[0072] Bidirectionally predicted pictures (B-pictures) may be those that can be coded and decoded using intra- or inter-prediction that uses up to two MVs and reference indices to predict the sample values ​​of each block. Similarly, multiple predicted pictures may use more than two reference pictures and associated metadata for the reconstruction of a single block.

[0073] A source picture may generally be spatially subdivided into multiple sample blocks (e.g., blocks of 4x4, 8x8, 4x8, or 16x16 samples each) and coded block by block. A block may be predictively coded with reference to other (already coded) blocks as determined by the coding assignment applied to the respective picture of the block. For example, a block of an I picture may be non-predictively coded or may be predictively coded with reference to already coded blocks of the same picture (spatial or intra prediction). A pixel block of a P picture may be predictively coded with reference to one previously coded reference picture by spatial prediction or by temporal prediction. A block of a B picture may be predictively coded with reference to one or two previously coded reference pictures by spatial prediction or by temporal prediction.

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

[0075] In one embodiment, the transmitter (540) may transmit additional data along with the encoded video. The source coder (530) may include such data as part of the coded video sequence. The additional data may include temporal / spatial / SNR enhancement layers, other forms of redundant data such as redundant pictures and slices, SEI messages, and VUI parameter set fragments, etc.

[0076] Video may be captured as multiple source pictures (video pictures) in a time sequence. Intra-picture prediction (often abbreviated as intra-prediction) exploits spatial correlation in a given picture, while inter-picture prediction exploits correlation (temporal or other) between pictures. In one example, a particular picture being encoded / decoded, called the current picture, is partitioned into blocks. If 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 may be coded by a vector called a MV. The MV refers to a reference block in the reference picture, and may have a third dimension that identifies the reference picture if multiple reference pictures are used.

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

[0078] Furthermore, to improve coding efficiency, merge mode techniques may be used for inter-picture prediction.

[0079] According to some embodiments of the present disclosure, predictions such as inter-picture prediction and intra-picture prediction are performed on a block-by-block basis. For example, according to the HEVC standard, pictures in a sequence of video pictures are partitioned into coding tree units (CTUs) for compression, and 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), one luma CTB and two chroma CTBs. Each CTU may be recursively quadtree partitioned into one or more coding units (CUs). For example, a CTU of 64×64 pixels may be partitioned into one CU of 64×64 pixels, or four CUs of 32×32 pixels, or 16 CUs of 16×16 pixels. In one example, each CU is analyzed to determine a prediction type of the CU, such as an inter-prediction type or an intra-prediction type. A CU is divided into one or more prediction units (PUs) according to temporal and / or spatial predictability. In general, each PU includes a luma prediction block (PB) and two chroma PBs. In one embodiment, prediction operations in coding (encoding / decoding) are performed in units of prediction blocks. Taking a luma prediction block as an example of a prediction block, the prediction block includes a matrix of pixel values ​​(e.g., luma values) such as 8×8 pixels, 16×16 pixels, 8×16 pixels, and 16×8 pixels.

[0080] 6 shows a diagram of a video encoder (603) according to another embodiment of the present disclosure. The video encoder (603) is configured to receive a processed block (e.g., a predictive block) of sample values ​​in a current video picture in a sequence of video pictures and to encode the processed block into a coded picture that is part of a coded video sequence. In one example, the video encoder (603) is used in place of the video encoder (303) of the example of FIG. 3.

[0081] In an HEVC example, the video encoder (603) receives a matrix of sample values ​​for a processing block, such as a predictive block, such as 8×8 samples. The video encoder (603) determines whether the processing block is best coded using intra-mode, inter-mode, or bi-predictive mode, e.g., using rate-distortion optimization. If the processing block is to be coded in intra-mode, the video encoder (603) may use intra-prediction techniques to encode the processing block into a coded picture, and if the processing block is to be coded in inter-mode or bi-predictive mode, the video encoder (603) may use inter-prediction or bi-prediction techniques, respectively, to encode the processing block into a coded picture. In certain video coding techniques, the merge mode may be an inter-picture prediction sub-mode, and the MV is derived from one or more MV predictors without the benefit of coded MV components outside the predictors. In certain other video coding techniques, there may be MV components applicable to the current block. In one example, the video encoder (603) includes other components, such as a mode decision module (not shown) for determining the mode of the processing block.

[0082] In the example of FIG. 6, the video encoder (603) includes an inter-encoder (630), an intra-encoder (622), a residual calculator (623), a switch (626), a residual encoder (624), a general controller (621), and an entropy encoder (625), coupled to each other as shown in FIG. 6.

[0083] The inter-encoder (630) is configured to receive samples of a current block (e.g., a processing block), compare the block with one or more reference blocks in a reference picture (e.g., blocks in a previous picture and a subsequent picture), generate inter-prediction information (e.g., description of redundant information by inter-encoding technique, MV, merge mode information), and calculate an inter-prediction result (e.g., a prediction block) based on the inter-prediction information using any suitable technique. In some examples, the reference picture is a decoded reference picture that is decoded based on the encoded video information.

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

[0085] The generic controller (621) is configured to determine generic control data and control other components of the video encoder (603) based on the generic control data. In one example, the generic controller (621) determines the mode of the block and provides a control signal to the switch (626) based on the mode. For example, if the mode is an intra mode, the generic controller (621) controls the switch (626) to select an intra mode result for use by the residual calculator (623), and controls the entropy encoder (625) to select intra prediction information and include the intra prediction information in the bitstream, and if the mode is an inter mode, the generic controller (621) controls the switch (626) to select an inter prediction result for use by the residual calculator (623), and controls the entropy encoder (625) to select inter prediction information and include the inter prediction information in the bitstream.

[0086] The residual calculator (623) calculates the difference (residual data) between the received block and a prediction result selected from the intra-encoder (622) or the inter-encoder (630). The residual encoder (624) is configured to operate on the residual data to encode the residual data to generate transform coefficients. In one example, the residual encoder (624) is configured to transform the residual data from the spatial domain to the frequency domain and generate transform coefficients. The transform coefficients then undergo a quantization process to obtain quantized transform coefficients. In various embodiments, the video encoder (603) also includes a residual decoder (628). The residual decoder (628) is configured to perform an inverse transform and generate decoded residual data. The decoded residual data may be used by the intra-encoder (622) and the inter-encoder (630) as appropriate. For example, the inter-encoder (630) may generate decoded blocks based on the decoded residual data and the inter-prediction information, and the intra-encoder (622) may generate decoded blocks based on the decoded residual data and the intra-prediction information. In some examples, the decoded blocks are appropriately processed to generate decoded pictures, which may be buffered in a memory circuit (not shown) and used as reference pictures.

[0087] The entropy encoder (625) is configured to format a bitstream to include the encoded block. The entropy encoder (625) is configured to include various information in accordance with an appropriate standard, such as HEVC. In one example, the entropy encoder (625) is configured to include general control data, selected prediction information (e.g., intra-prediction information or inter-prediction information), residual information, and other appropriate information in the bitstream. It should be noted that, according to the disclosed subject matter, when coding a block in a merged sub-mode of either an inter mode or a bi-prediction mode, the residual information is not present.

[0088] 7 shows a diagram of a video decoder (710) according to another embodiment of the present disclosure. The video decoder (710) is configured to receive coded pictures that are part of a coded video sequence and to decode the coded pictures to generate reconstructed pictures. In one example, the video decoder (710) is used in place of the video decoder (310) of the example of FIG. 3.

[0089] In the example of FIG. 7, the video decoder (710) includes an entropy decoder (771), an inter-decoder (780), a residual decoder (773), a reconstruction module (774), and an intra-decoder (772), coupled to each other as shown in FIG. 7.

[0090] The entropy decoder (771) may be configured to reconstruct from the coded picture certain symbols that represent the syntax elements of which the coded picture is composed. Such symbols may include, for example, the mode in which the block is coded (e.g., intra mode, inter mode, bi-predictive mode, etc., the latter two being merged or separate submodes), prediction information (e.g., intra prediction information or inter prediction information, etc.) that may identify certain samples or metadata used for prediction by the intra decoder (772) or the inter decoder (780), respectively, and residual information, for example in the form of quantized transform coefficients. In one example, if the prediction mode is an inter prediction mode or a bi-predictive mode, the inter prediction information is provided to the inter decoder (780), and if the prediction type is an intra prediction type, the intra prediction information is provided to the intra decoder (772). The residual information may undergo inverse quantization and be provided to the residual decoder (773).

[0091] The inter decoder (780) is configured to receive the inter prediction information and to generate inter prediction results based on the inter prediction information.

[0092] The intra decoder (772) is configured to receive intra prediction information and to generate a prediction result based on the intra prediction information.

[0093] The residual decoder (773) is configured to perform inverse quantization to extract inverse quantized transform coefficients and process the inverse quantized transform coefficients to transform the residual from the frequency domain to the spatial domain. The residual decoder (773) may also require certain control information (including Quantizer Parameters (QP)), which may be provided by the entropy decoder (771) (the data path not shown may be only low-capacity control information).

[0094] The reconstruction module (774) is configured to combine, in the spatial domain, the residual output by the residual decoder (773) and the prediction result (possibly output by the inter prediction module or the intra prediction module) to form a reconstructed block that may be part of a reconstructed picture that may be part of the resulting reconstructed video. It should be noted that other suitable operations, such as a deblocking operation, may be performed to improve visual quality.

[0095] It should be noted that the video encoders (303), (503), and (603) and the video decoders (310), (410), and (710) may be implemented using any suitable technology. In one embodiment, the video encoders (303), (503), and (603) and the video decoders (310), (410), and (710) may be implemented using one or more integrated circuits. In another embodiment, the video encoders (303), (503), and (603) and the video decoders (310), (410), and (710) may be realized using one or more processors executing software instructions.

[0096] II. Block Division FIG. 8 illustrates an example block partition according to some embodiments of the present disclosure.

[0097] In some relevant examples, such as VP9 proposed by the Alliance for Open Media (AOMedia), a four-way partition tree may be used, from a 64x64 level to a 4x4 level, with some further restrictions on blocks of 8x8 or less, as shown in Figure 8. Note that the partition designated as R may be called a recursive partition, i.e., the same partition tree is repeated at lower scales until the lowest 4x4 level is reached.

[0098] In some related examples, such as AV1 proposed by AOMedia, the partition tree may be expanded to a 10-way structure as shown in FIG. 8, and the maximum coding block size (called a superblock in VP9 / AV1 terminology) is increased to start at 128×128. Note that 4:1 / 1:4 rectangular partitions are included in AV1 but not in VP9. None of the rectangular partitions may be further subdivided. In addition, AV1 may support more flexibility in the use of partitions below 8×8 levels, since inter prediction may be performed on 2×2 chroma blocks in some examples.

[0099] In some related examples such as HEVC, CTUs may be divided into CUs using a quadtree structure represented as a coding tree to adapt to various local characteristics. The decision of whether to use inter-picture (temporal) prediction or intra-picture (spatial) prediction to code a picture region may be made at the CU level. Each CU may be further divided into one, two, or four PUs according to the PU partition type. Inside one PU, the same prediction process may be applied, and related information may be transmitted to the decoder on a PU basis. After obtaining the residual block by applying the prediction process based on the PU partition type, the CU may be partitioned into TUs according to another quadtree structure such as the coding tree of the CU. One important feature of the HEVC structure is that it has the concept of multiple partitions including CUs, PUs, and TUs. In HEVC, a CU or TU may only be square in shape, and a PU may be square or rectangular in shape for inter-predicted blocks. In HEVC, one coding block may be further divided into four square sub-blocks, and a transformation process may be performed on each sub-block, i.e., TU. Each TU may be further divided recursively into smaller TUs (e.g., using a quadtree partitioning), which may be referred to as a residual quadtree (RQT).

[0100] At picture boundaries, HEVC uses implicit quadtree partitioning, whereby a block may continue to undergo quadtree partitioning until its size fits into the picture boundary.

[0101] FIG. 9 illustrates an exemplary quadtree having a nested binary tree structure, according to one embodiment of the present disclosure.

[0102] FIG. 10 illustrates an example block partitioning in a multi-type tree structure according to some embodiments of the present disclosure.

[0103] In some related examples, such as VVC, a multi-type-tree (MTT) structure, which is a combination of nested binary trees (BT) and triple trees (TT) with quadtrees (QT), may be used. A CTU or CU may first be partitioned recursively into square-shaped blocks by QT. Then, each QT leaf may be further partitioned by BT or TT, and the BT and TT partitions may be applied recursively and interleaved, but no further QT partitions may be applied. In some examples, TT partitions a rectangular block vertically or horizontally into three blocks using a 1:2:1 ratio to avoid widths and heights that are not powers of two. For partition conflict prevention, additional partition constraints are typically imposed on MTT to avoid overlapping partitions (e.g., prohibiting vertical / horizontal bipartitions at intermediate partitions resulting from vertical / horizontal tripartitions). Further restrictions are set on the maximum depth of BT and TT partitions.

[0104] FIG. 11 illustrates an exemplary L-shaped section according to one embodiment of the present disclosure. Instead of using a rectangular block section, the L-shaped section may divide a block into one or more L-shaped sections and one or more rectangular sections. As illustrated in FIG. 11, an L-shaped (or L-shaped) section may have a width, a height, a shorter width, and a shorter height. A rotated L-shaped section may also be considered an L-shaped section in the present disclosure.

[0105] 12 illustrates an example block partition using L-shaped partitions according to some embodiments of the present disclosure. Based on the L-shaped partitions, one block can be partitioned into two partitions, including one L-shaped partition (partition 1) and one rectangular partition (partition 0).

[0106] III. Intra Prediction In some related examples such as VP9, ​​eight directional modes are supported, corresponding to angles from 45 degrees to 207 degrees. To take advantage of more diverse spatial redundancy in directional textures, in some related examples such as AV1, the directional intra mode is extended to a set of angles with finer granularity. The original eight angles are slightly modified and called nominal angles, and these eight nominal angles are named V_PRED, H_PRED, D45_PRED, D135_PRED, D113_PRED, D157_PRED, D203_PRED, and D67_PRED.

[0107] FIG. 13 shows an exemplary nominal angle according to one embodiment of the present disclosure. Each nominal angle may be associated with seven finer angles, so that in some relevant examples such as AV1, there may be a total of 56 directional angles. The prediction angle may be represented by the nominal intra angle + angle delta. The angle delta may be equal to a coefficient multiplied by a step size of 3 degrees. The coefficient may range from -3 to 3. To implement the directional prediction mode of AV1 in a general way, all of the 56 directional intra prediction angles of AV1 may be implemented with a unified directional predictor that projects each pixel to a reference sub-pixel position and interpolates the reference sub-pixel by a 2-tap bilinear filter.

[0108] In some relevant examples such as AV1, there are five non-directional smooth intra prediction modes, which are DC, PAETH, SMOOTH, SMOOTH_V, and SMOOTH_H. For DC prediction, the average of the left and top neighboring samples is used as the predictor of the block to be predicted. For PAETH prediction, the top, left, and top-left reference samples are fetched first, and then the closest value to (top+left-top-left) is set as the predictor of the pixel to be predicted.

[0109] 14 shows the locations of the top, left, and top-left samples relative to a pixel in the current block, according to one embodiment of the present disclosure. For SMOOTH, SMOOTH_V, and SMOOTH_H modes, the block is predicted using quadratic interpolation in the vertical or horizontal direction, or an average in both directions.

[0110] FIG. 15 illustrates an exemplary recursive filter intra mode according to one embodiment of the present disclosure.

[0111] To capture the decaying spatial correlation with the reference on the edge, FILTER INTRA mode is designed for luma blocks. In AV1, five filter intra modes are defined, each of which is represented by a set of eight 7-tap filters that reflect the correlation between a pixel in a 4×2 patch and its seven neighbors adjacent to the patch. For example, the weight coefficients of the 7-tap filters are position-dependent. As shown in Figure 15, an 8×8 block is divided into eight 4×2 patches, denoted by B0, B1, B2, B3, B4, B5, B6, and B7. For each patch, its seven neighbors, denoted by R0-R7, are used to predict the pixels in the respective patch. For patch B0, all neighbors have already been reconstructed. However, for other patches, not all neighbors have been reconstructed, so the predicted values ​​of the nearest neighbors are used as references. For example, all neighbors of patch B7 have not been reconstructed, so the predicted samples of patch B7's neighbors (i.e., B5 and B6) are used instead.

[0112] For chroma components, a chroma-only intra prediction mode, called chroma from luma (CfL) mode, models chroma pixels as linear functions of the corresponding reconstructed luma pixels. CfL prediction may be expressed as follows: CfL(α)=α×L AC +DC formula (1) However, L ACrepresents the AC contribution of the luma component, α represents a parameter of the linear model, and DC represents the DC contribution of the chroma component. In one example, the reconstructed luma pixels are subsampled to the chroma resolution, and then the average value is subtracted to form the AC contribution. Instead of requiring the decoder to compute scaling parameters as in some related examples to approximate the chroma AC components from the AC contribution, the CfL mode of AC1 determines the parameters α based on the original chroma pixels and signals them in the bitstream. This reduces the decoder complexity and results in more accurate predictions. As for the DC contribution of the chroma components, it is calculated using an intra DC mode, which is sufficient for most chroma content and has a mature and fast implementation.

[0113] FIG. 16 illustrates an exemplary multi-line intra prediction using four reference lines adjacent to a coding block unit according to an embodiment of the present disclosure. For multi-line intra prediction, the encoder determines and signals which reference line is used to generate an intra predictor. The reference line index is signaled before the intra prediction mode, and only the most probable mode is allowed when a non-zero reference line index is signaled. In FIG. 16, an example of four reference lines is illustrated, and each reference line is composed of six segments, namely segments A to F, with a top-left reference sample. In addition, in FIG. 16, the reconstructed samples of different reference lines are filled with different patterns. The multi-line intra prediction mode may also be referred to as a multiple reference line prediction (MRLP) mode.

[0114] IV. Undirectional Intra Prediction for Shape Segmentation With L-type partitioning, neighboring reconstructed samples of the current block may be available from the right and / or bottom of the current block. However, the neighboring reconstructed samples available from the right and / or bottom do not fully fit some related intra prediction schemes that use upper and left reference samples to perform non-directional intra prediction.

[0115] This disclosure includes a method of non-directional intra-prediction mode for L-shaped partitions. The presented methods can be used separately or in any order in combination. In this disclosure, L-shaped (or L-type) partitions can be defined as shown in Figure 11, and rotated L-shaped partitions can also be considered as L-shaped partitions.

[0116] The intra prediction mode may include various intra prediction mode types, such as angular or directional intra prediction mode and angular or non-directional intra prediction mode. For example, if a prediction sample of a mode may be generated according to a given prediction direction, the mode may be referred to as an angular intra prediction mode or a directional intra prediction mode. Otherwise, the mode may be referred to as an angular intra prediction mode or a non-directional intra prediction mode. Examples of angular intra prediction modes include, but are not limited to, DC mode, Planar mode, Plane mode (defined in H.264 / AVC), SMOOTH mode, SMOOTH_H mode, SMOOTH_V mode, Paeth mode, recursive filtering mode, and / or matrix-based intra prediction (MIP) mode. In some embodiments, a mode that is not a smooth mode may be treated as an angular or directional intra prediction mode.

[0117] In the related intra prediction scheme, the upper and / or left neighboring reference samples are used to perform the non-directional intra prediction mode. However, in the case of L-shaped partitions, additional neighboring samples are available and can be reconstructed. For example, the right and / or lower neighboring samples are available and can be reconstructed and thus used for the prediction of the L-shaped partition.

[0118] According to aspects of the present disclosure, when a block is partitioned into at least one L-shaped partition (LP) and at least one rectangular partition (RP), the reference samples used to perform intra-prediction modes of the L-shaped partition may be from neighboring reconstructed samples of another LP or RP or other blocks. In some embodiments, the neighboring reconstructed samples may form a continuous chain of any shape instead of one horizontal straight line and / or one vertical straight line.

[0119] In this disclosure, multiple reference samples may be collectively referred to as a reference sample chain (RSC). All or a subset of the samples in an RSC may be used for non-directional intra-prediction modes. An RSC may include more than one horizontal or vertical straight line of reference samples.

[0120] 17A-17F show six exemplary RSCs according to some embodiments of the present disclosure. Each block in FIG. 17A-17F has a size of 8×8 and is partitioned into two partitions: one LP and one RP. The RP has a size of 4×4 and is located in the upper left corner of each block. The LP has a height of 8 and a width of 8. Each RSC in FIG. 17A-17F includes two horizontal lines of reference samples and two vertical lines of reference samples.

[0121] According to some embodiments of the present disclosure, the total number of reference samples included in the RSC may be a power of 2. One or more samples in the RSC may be excluded from the reference samples so as not to exceed the total number of reference samples. For example, in FIG. 17A-FIG. 17F, the total number of reference samples included in each RSC is 16. For each RSC in FIG. 17A-FIG. 17C, one corner sample of each RSC is excluded from the reference samples so that the total number of reference samples included in each RSC is 16. For each RSC in FIG. 17D and FIG. 17E, one sample at the beginning or end of each RSC is excluded from the reference samples so that the total number of reference samples included in each RSC is 16. For the RSC in FIG. 17F, in an intra prediction mode (e.g., DC mode), two corner samples are excluded from the reference samples, and one middle corner sample is used twice, so that the total number of reference samples included in the RSC is 16.

[0122] In one embodiment, only a subset of the reference samples in the RSC may be used for intra-prediction modes (eg, DC mode).

[0123] In some embodiments, a block may be partitioned into two partitions, one LP and one RP. The RP is located in the upper left corner of the block, and the height and width of the LP may be equal or unequal. When a non-directional intra-prediction mode (e.g., DC mode) is performed for the LP, the total number of reference samples used in the non-directional intra-prediction mode may be the sum of the width and height of the LP (e.g., width+height), in some embodiments, as shown, for example, in Figures 17A-17F. In one embodiment, the total number of reference samples used in the non-directional intra-prediction mode may be the sum of the shorter width and shorter height of the LP (e.g., shorter width+shorter height). One such example is shown in Figure 18, where the reference samples used are shown in gray.

[0124] In some embodiments, a block may be partitioned into two partitions, one LP and one RP. The RP is located at the upper left corner of the block, and the height and width of the LP are not equal. When a non-directional intra-prediction mode (e.g., DC mode) is performed for the LP, the total number of reference samples used in the non-directional intra-prediction mode is the maximum or minimum value (e.g., max(width,height) or min(width,height)) of the width and height of the LP. For example, in FIG. 19A, the width of the LP is greater than the height of the LP, so the width value is selected as the total number of reference samples used in the non-directional intra-prediction mode (e.g., DC mode). In FIG. 19B, the height of the LP is greater than the width of the LP, so the height value is selected as the total number of reference samples used in the non-directional intra-prediction mode (e.g., DC mode). In each of FIG. 19A and FIG. 19B, the total number of reference samples used in the prediction process is 16.

[0125] In some embodiments, a block may be partitioned into two partitions: one LP and one RP. If the height and width of the LP are not equal, or if the RP is not located in the lower right corner of the block, only the reference samples along either the vertical or horizontal edge of the block may be used in a non-directional intra-prediction mode (e.g., DC mode). The total number of reference samples used in a non-directional intra-prediction mode is the maximum or minimum of the width and height of the LP (e.g., max(width,height) or min(width,height)). Figures 20A-20D show some exemplary reference samples used in the LP according to some embodiments of the present disclosure.

[0126] In one embodiment, a block may be partitioned into two partitions: one LP and one RP. The LP may be one of the four L-shape types in FIG. 12. When a non-directional intra-prediction mode (e.g., DC mode) is performed for the LP, the total number of reference samples used in the non-directional intra-prediction mode is the sum of the width and height of the LP (e.g., width+height), and all reference samples are outside the LP partition and the RP partition. FIG. 21 shows an example of a method for selecting reference samples in such an embodiment.

[0127] According to some embodiments of the present disclosure, a block may be partitioned into multiple partitions. For a current partition, if a right or lower neighboring sample from a different partition (either LP or RP) is reconstructed prior to the reconstruction of a sample of the current partition, the right and / or lower neighboring sample may form an RSC and be used to perform a non-directional intra-prediction mode (e.g., DC mode) for the current partition. As shown in Figures 22A-22B, the LP (partition 1) is reconstructed prior to the RP (partition 0). Thus, the samples of the LP may form an RSC and be used for a non-directional intra-prediction mode (e.g., DC mode) for the RP. In Figures 22A-22B, the reference samples in the row above the RP are shown in dark gray, the reference samples in the left column of the RP are shown in gray, and the reference samples in the right column or the row below the RP are shown in white.

[0128] In one embodiment, only one neighboring sample in the top row, left column, right column, or bottom row of the RP block may be used for a non-directional intra-prediction mode of the RP (eg, DC mode).

[0129] In one embodiment, only the neighboring samples in the left column and upper row of the RP may be used for a non-directional intra-prediction mode of the RP (eg, DC mode).

[0130] In one embodiment, as shown in FIG. 22A, when the RP is located in the bottom left corner of the block, only the adjacent samples in the columns to the left and right of the RP may be used for the RP's non-directional intra-prediction mode (e.g., DC mode).

[0131] In one embodiment, as shown in FIG. 22B, when the RP is located in the upper right corner of a block, only adjacent samples in the rows above and below the RP may be used for the RP's non-directional intra-prediction mode (e.g., DC mode).

[0132] According to aspects of the present disclosure, when one of the particular non-directional intra prediction modes (e.g., Planar mode defined in HEVC and VVC, SMOOTH, SMOOTH-H, or SMOOTH-V modes defined in AV1) is performed and a right or bottom neighboring sample is reconstructed, the reconstructed neighboring sample may be used directly in the 4-tap interpolation of the non-directional intra prediction mode instead of extrapolating the right and / or bottom neighboring sample from the reconstructed neighboring samples above and to the left.

[0133] In one embodiment, when one of the specific non-directional intra prediction modes (e.g., Planar mode defined in HEVC and VVC, SMOOTH, SMOOTH-H, or SMOOTH-V mode defined in AV1) is performed and the neighboring sample in the row below is not available, the neighboring sample in the row below may be linearly extrapolated from the neighboring samples in the left column and the right column. As shown in FIG. 23A, when the bottom left neighboring sample (denoted as BL) is available, the BL neighboring sample may be used directly or may be obtained by copying from the nearest neighboring element in the left column, and the bottom right neighboring sample (denoted as BR) may be obtained by copying from the nearest neighboring element in the right column. The remaining neighboring samples in the row below between the BL neighboring sample and the BR neighboring sample may be extrapolated, for example, by using linear interpolation.

[0134] In one embodiment, when one of the specific non-directional intra prediction modes (e.g., Planar mode defined in HEVC and VVC, SMOOTH, SMOOTH-H, or SMOOTH-V mode defined in AV1) is performed and the neighboring sample in the right column is not available, the neighboring sample in the right column may be linearly extrapolated from the neighboring samples in the upper and lower rows. As shown in FIG. 23B, when the top right neighboring sample (denoted as TR) is available, the TR neighboring sample may be used directly or may be obtained by copying from the nearest neighboring element in the left column, and the bottom right neighboring sample (denoted as BR) may be obtained by copying from the nearest neighboring element in the right column. The remaining neighboring samples in the right column between the TR and BR neighboring samples may be extrapolated, for example, by using linear interpolation.

[0135] In one embodiment, when one of the specific non-directional intra prediction modes (e.g., Planar mode defined in HEVC and VVC, SMOOTH, SMOOTH-H, or SMOOTH-V mode defined in AV1) is performed, only the upper and left neighboring samples outside the RP and LP blocks may be used as reference samples, and the right and lower neighboring samples may be obtained by copying or extrapolating from the upper and left neighboring samples. Figure 24 shows an example of how to select the left and upper neighboring samples for the LP in such an embodiment.

[0136] In one embodiment, when one of the particular non-directional intra prediction modes (e.g., Planar mode defined in HEVC and VVC, SMOOTH, SMOOTH-H, or SMOOTH-V modes defined in AV1) is performed, for samples located at different positions within the LP, the left, right, top, and bottom neighboring reference samples may be from different lines, and the right and bottom neighboring reference samples (shown with a diagonal texture in Figures 25A-25B) may be obtained by copying or extrapolating from the top and left neighboring reference samples.

[0137] 25A-25B show two examples of methods for selecting left, right, top, and bottom neighboring reference samples for an LP.

[0138] In FIG. 25A, the block (2501) is partitioned into an LP (denoted as 1) and an RP (denoted as 0). The RP is located in the lower left corner of the block (2501). For a sample (2510) in the LP, the upper adjacent reference sample (2511) is from the upper reference line of the block (2501), the left adjacent reference sample (2512) is from the left reference line of the block (2501), the lower adjacent reference sample (2513) is from the line above the RP, and the right adjacent reference sample (2514) is from the right reference line of the block (2501). It should be noted that the reference samples in the right reference line of the block (2501), such as the right adjacent reference sample (2514), may be obtained by copying or extrapolating from the reference samples in the upper reference line of the block (2501).

[0139] With respect to a sample (2520) in the LP, the upper adjacent reference sample (2521) is from the upper reference line of the block (2501), the left adjacent reference sample (2522) is from the right line of the RP, the lower adjacent reference sample (2523) is from the lower reference line of the block (2501), and the right adjacent reference sample (2524) is from the right reference line of the block (2501). It should be noted that the reference samples in the lower reference line of the block (2501), such as the lower adjacent reference sample (2523), may be obtained by copying or extrapolating from the reference samples in the left reference line of the block (2501).

[0140] In FIG. 25B, the block (2502) is partitioned into an LP (denoted as 1) and an RP (denoted as 0). The RP is located in the upper left corner of the block (2502). For a sample (2530) in the LP, the upper adjacent reference sample (2531) is from the upper reference line of the block (2502), the left adjacent reference sample (2532) is from the right line of the RP, the lower adjacent reference sample (2533) is from the lower reference line of the block (2502), and the right adjacent reference sample (2534) is from the right reference line of the block (2502). It should be noted that the reference samples in the right reference line of the block (2502), such as the right adjacent reference sample (2534), may be obtained by copying or extrapolating from the reference samples in the upper reference line of the block (2502).

[0141] For a sample (2540) in the LP, the upper adjacent reference sample (2541) is from the upper line of the RP, the left adjacent reference sample (2542) is from the right reference line of the block (2502), the lower adjacent reference sample (2543) is from the lower reference line of the block (2502), and the right adjacent reference sample (2544) is from the right reference line of the block (2502). It should be noted that reference samples in the lower reference line of a block, such as the lower adjacent reference sample (2543), may be obtained by copying or extrapolating from reference samples in the left reference line of the block (2502).

[0142] V. Flowchart FIG. 26 shows a flow chart outlining an example process (2600) according to one embodiment of the disclosure. In various embodiments, the process (2600) is performed by processing circuits, such as processing circuits in the terminal devices (210), (220), (230), and (240), processing circuits performing the functions of the video encoder (303), processing circuits performing the functions of the video decoder (310), processing circuits performing the functions of the video decoder (410), processing circuits performing the functions of the intra prediction module (452), processing circuits performing the functions of the video encoder (503), processing circuits performing the functions of the predictor (535), processing circuits performing the functions of the intra encoder (622), and processing circuits performing the functions of the intra decoder (772). In some embodiments, the process (2600) is implemented in software instructions, and thus, when the processing circuits execute the software instructions, the processing circuits perform the process (2600).

[0143] The process (2600) may generally begin at step (S2610), where the process (2600) decodes prediction information for a current block in a current picture that is part of a coded video bitstream. The prediction information indicates a non-directional intra-prediction mode for the current block. The process (2600) then proceeds to step (S2620).

[0144] In step S2620, the process 2600 partitions the current block into a plurality of partitions, the plurality of partitions including at least one L-shaped partition. The process 2600 then proceeds to step S2630.

[0145] In step (S2630), the process (2600) reconstructs one of the plurality of partitions based on at least one of (i) adjacent reconstructed samples of one of the plurality of partitions, or (ii) adjacent reconstructed samples of the current block. The process (2600) then ends.

[0146] In one embodiment, at least one of the adjacent reconstructed samples is located adjacent to one of the right or below one of the multiple sections.

[0147] In one embodiment, one of the plurality of segments is an L-shaped segment, and the number of adjacent reconstructed samples depends on a dimension of the L-shaped segment. In one example, the number of adjacent reconstructed samples is the sum of a width and a height of the L-shaped segment. In another example, the number of adjacent reconstructed samples is the sum of a shorter width and a shorter height of the L-shaped segment. In another example, the number of adjacent reconstructed samples is the maximum value of a width and a height of the L-shaped segment. In another example, the number of adjacent reconstructed samples is the minimum value of a width and a height of the L-shaped segment.

[0148] In one embodiment, at least one of the adjacent reconstructed samples is located in another one of the plurality of partitions that was reconstructed before one of the plurality of partitions. In one example, the other one of the plurality of partitions is an L-shaped partition, and at least one of the adjacent reconstructed samples is located adjacent to one of the right side or below one of the plurality of partitions.

[0149] In one embodiment, the process (2600) determines a plurality of neighboring reference samples of one of the plurality of partitions based on at least one of (i) neighboring reconstructed samples of one of the plurality of partitions, or (ii) neighboring reconstructed samples of the current block. The process (2600) reconstructs one of the plurality of partitions based on the plurality of neighboring reference samples.

[0150] In one example, the adjacent reconstructed samples include adjacent reconstructed samples of a left column and a right column of one of the multiple partitions. The process (2600) determines adjacent reference samples of a lower row of one of the multiple partitions based on the adjacent reconstructed samples of the left column and the right column of one of the multiple partitions. The process (2600) reconstructs one of the multiple partitions based on the adjacent reference samples of a lower row of one of the multiple partitions.

[0151] In one example, the adjacent reconstructed samples include adjacent reconstructed samples of upper and lower rows of one of the multiple partitions. The process (2600) determines adjacent reference samples of a left column of one of the multiple partitions based on the adjacent reconstructed samples of the upper and lower rows of one of the multiple partitions. The process (2600) reconstructs one of the multiple partitions based on the adjacent reference samples of the left column of one of the multiple partitions.

[0152] In one embodiment, one of the multiple partitions is an L-shaped partition, and the process (2600) reconstructs one of the multiple partitions based on adjacent reconstructed samples in the left column and upper row of the current block.

[0153] In one embodiment, based on one of the plurality of partitions being an L-shaped partition, the process (2600) determines, for each sample of the L-shaped partition, a plurality of adjacent reference samples based on the position of the respective sample. The process (2600) reconstructs each sample of the L-shaped partition based on the plurality of adjacent reference samples of the respective sample.

[0154] In one embodiment, the multiple neighboring reference samples for each sample include reconstructed neighboring samples and neighboring samples reconstructed based on the reconstructed neighboring samples.

[0155] VI. Computer Systems The techniques described above may be implemented as computer software using computer-readable instructions physically stored on one or more computer-readable media. For example, Figure 27 illustrates a computer system (2700) suitable for implementing certain embodiments of the disclosed subject matter.

[0156] The computer software may be coded using any suitable machine code or computer language that may undergo assembly, compilation, linking, or similar mechanisms to produce code containing instructions that may be executed, such as by one or more computer central processing units (CPUs) and graphics processing units (GPUs), either directly, or through interpretation and execution of microcode.

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

[0158] 27 with respect to the computer system (2700) 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 the embodiments of the present disclosure. The arrangement of components should not be interpreted as having any dependency or requirement regarding any one or combination of components illustrated in the exemplary embodiment of the computer system (2700).

[0159] The computer system (2700) may include certain human interface input devices. Such human interface input devices may be responsive to input by one or more human users using, for example, tactile input (keystrokes, swipes, data glove movements, etc.), audio input (voice, clapping, etc.), visual input (gestures, etc.), and olfactory input (not shown). The human interface devices may also be used to capture certain media not necessarily directly associated with conscious human input, such as audio (voice, music, ambient sounds, etc.), images (scanned images, photographic images obtained from still image cameras, etc.), and video (two-dimensional video, three-dimensional video including stereoscopic video, etc.).

[0160] The input human interface devices may include one or more of a keyboard (2701), a mouse (2702), a trackpad (2703), a touch screen (2710), a data glove (not shown), a joystick (2705), a microphone (2706), a scanner (2707), and a camera (2708) (only one of each is shown).

[0161] The computer system (2700) may also include certain human interface output devices. Such human interface output devices may stimulate one or more of the senses of a human user, for example, by haptic output, sound, light, and smell / taste. Such human interface output devices may include haptic output devices (e.g., haptic feedback via a touch screen (2710), data gloves (not shown), or joystick (2705), although there may also be haptic feedback devices that do not function as input devices), audio output devices (such as speakers (2709), headphones (not shown)), visual output devices (such as screens (2710) including CRT screens, LCD screens, plasma screens, OLED screens (each with or without touch screen input capability, each with or without haptic feedback capability, some of which may be capable of outputting two-dimensional visual output, or output in more than three dimensions by means of stereographic output, etc.), virtual reality glasses (not shown), holographic displays, and smoke tanks (not shown)), and printers (not shown). These visual output devices, such as a screen 2710 , may be connected to the system bus 2748 via a graphics adapter 2750 .

[0162] The computer system (2700) may also include human accessible storage devices and associated media, such as optical media, including CD / DVD ROM / RW (2720) with CD / DVD or similar media (2721), thumb drives (2722), removable hard drives or solid state drives (2723), legacy magnetic media such as tape and floppy disks (not shown), and dedicated ROM / ASIC / PLD based devices such as security dongles (not shown).

[0163] Those skilled in the art should also understand that the term "computer-readable medium" as used in connection with the subject matter of this disclosure does not encompass transmission media, carrier waves, or other transitory signals.

[0164] The computer system (2700) may also include a network interface (2754) to one or more communication networks (2755). The one or more communication networks (2755) may be, for example, wireless, wired, optical. The one or more communication networks (2755) may further be local, wide area, metropolitan, vehicular and industrial, real-time, and delay tolerant, etc. Examples of the one or more communication networks (2755) include local area networks such as Ethernet, wireless LAN, cellular networks including GSM, 3G, 4G, 5G, and LTE, wired or wireless TV wide area digital networks including cable TV, satellite TV, and terrestrial broadcast TV, and vehicular and industrial networks including CANBus, etc. Certain networks typically require an external network interface adapter that connects to a specific general-purpose data port or peripheral bus (2749) (such as, for example, a USB port on the computer system (2700)), while others are typically integrated into the core of the computer system (2700) by connection to a system bus as described below (e.g., an Ethernet interface to a PC computer system or a cellular network interface to a smartphone computer system). Using any of these networks, the computer system (2700) may communicate with other entities. Such communications may be unidirectional, receive only (e.g., broadcast TV), unidirectional transmit only (e.g., CANbus to certain CANbus devices), or bidirectional, for example, to other computer systems using local or wide area digital networks. Specific protocols and protocol stacks may be used with each of these networks and network interfaces, as described above.

[0165] The aforementioned human interface devices, human accessible storage devices, and network interfaces may be connected to the core (2740) of the computer system (2700).

[0166] The cores (2740) may include one or more central processing units (CPUs) (2741), graphics processing units (GPUs) (2742), dedicated programmable processing units in the form of field programmable gate areas (FPGAs) (2743), hardware accelerators for specific tasks (2744), and graphics adapters (2750), etc. These devices may be connected via a system bus (2748), along with read-only memory (ROM) (2745), random access memory (2746), and internal mass storage (2747) such as internal hard drives and SSDs that are not user accessible. In some computer systems, the system bus (2748) may be accessible in the form of one or more physical plugs to allow expansion with additional CPUs and GPUs, etc. Peripheral devices may be connected directly to the core's system bus (2748) or may be connected via a peripheral bus (2749). In one example, the screen 2710 may be connected to a graphics adapter 2750. Peripheral bus architectures include PCI and USB, among others.

[0167] The CPU (2741), GPU (2742), FPGA (2743), and accelerator (2744) may execute certain instructions that in combination may constitute the aforementioned computer code. This computer code may be stored in ROM (2745) or RAM (2746). Temporary data may also be stored in RAM (2746), while permanent data may be stored, for example, in internal mass storage (2747). Rapid storage and retrieval from any of the memory devices may be made possible by the use of cache memory, which may be closely associated with one or more of the CPU (2741), GPU (2742), mass storage (2747), ROM (2745), and RAM (2746), etc.

[0168] The computer-readable medium may bear computer code for performing various computer-implemented operations. The medium and computer code may be those specially designed and constructed for the purposes of the present disclosure, or they may be of the type well known and available to those skilled in the computer software arts.

[0169] By way of example and not limitation, a computer system (2700) having an architecture, and in particular a core (2740), may provide functionality as a result of a processor (including CPUs, GPUs, FPGAs, accelerators, etc.) executing software embodied in one or more tangible computer-readable media. Such computer-readable media may be the user-accessible mass storage introduced above, and media associated with a particular storage of the core (2740) that has a non-transitory nature, such as mass storage (2747) internal to the core or ROM (2745). Software implementing various embodiments of the present disclosure may be stored in such devices and executed by the core (2740). The computer-readable media may include one or more memory devices or chips, depending on the particular needs. The software may cause the core (2740), and in particular the processors (including CPUs, GPUs, FPGAs, etc.) therein, to perform certain processes or certain parts of certain processes described herein, including defining data structures stored in RAM (2746) and modifying such data structures according to the processes defined by the software. Additionally or alternatively, a computer system may provide functionality as a result of logic hardwired or otherwise embodied in circuitry (e.g., accelerator (2744)) that may operate in place of or in conjunction with software to perform certain processes or certain portions of certain processes described herein. Where appropriate, reference to software may encompass logic and vice versa. Where appropriate, reference to computer-readable medium may encompass circuitry (such as an integrated circuit (IC)) that stores software for execution, circuitry that embodies logic for execution, or both. The present disclosure encompasses any appropriate combination of hardware and software.

[0170] While this disclosure has described several exemplary embodiments, there are modifications, substitutions, and various substitute equivalents that are within the scope of this disclosure. It will thus be appreciated that those skilled in the art will be able to devise numerous systems and methods that, although not explicitly shown or described herein, embody the principles of the present disclosure and are therefore within its spirit and scope. Appendix A: Acronyms ALF: Adaptive Loop Filter AMVP: Advanced Motion Vector Prediction APS: Adaptation Parameter Set ASIC: Application-Specific Integrated Circuit ATMVP: Alternative / Advanced Temporal Motion Vector Prediction AV1:AOMedia Video 1 AV2:AOMedia Video 2 BMS: Benchmark Set BV: Block Vector CANBus: Controller Area Network Bus CB: Coding Block CC-ALF:Cross-Component Adaptive Loop Filter CD: Compact Disc CDEF:Constrained Directional Enhancement Filter CPR: Current Picture Referencing CPU: Central Processing Unit CRT: Cathode Ray Tube CTB: Coding Tree Block CTU: Coding Tree Unit CU: Coding Unit DPB: Decoder Picture Buffer DPS: Decoding Parameter Set DVD: Digital Video Disc FPGA: Field Programmable Gate Area JCCR: Joint CbCr Residual Coding JVET: Joint Video Exploration Team GOP: Group of Picture GPU: Graphics Processing Unit GSM: Global System for Mobile communication HDR: High Dynamic Range HEVC: High Efficiency Video Coding HRD: Hypothetical Reference Decoder IBC: Intra Block Copy IC: Integrated Circuit ISP: Intra Sub-Partition JEM: Joint Exploration Model LAN: Local Area Network LCD: Liquid Crystal Display LR: Loop Restoration Filter LTE: Long-Term Evolution MPM: Most Probable Mode MV: Motion Vector OLED: Organic Light-Emitting Diode PB: Prediction Block PCI: Peripheral Component Interconnect PDPC:Position Dependent Prediction Combination PLD: Programmable Logic Device PPS: Picture Parameter Set PU: Prediction Unit RAM: Random Access Memory ROM: Read-Only Memory SAO: Sample Adaptive Offset SCC: Screen Content Coding SDR: Standard Dynamic Range SEI: Supplementary Enhancement Information SNR: Signal Noise Ratio SPS: Sequence Parameter Set SSD: Solid-state drive TU: Transform Unit USB: Universal Serial Bus VPS: Video Parameter Set VUI: Video Usability Information VVC: Versatile Video Coding WAIP: Wide-Angle Intra Prediction [Explanation of symbols]

[0171] 101 Samples 102 Arrow 103 Arrow 104 Square Block 105 Schematic diagram showing intra prediction direction 111 Current Block 112 Ambient Sample 113 Ambient Sample 114 Ambient Sample 115 Ambient Samples 116 Ambient Samples 200 Communication Systems 210 Terminal Devices 220 Terminal Devices 230 Terminal Devices 240 Terminal Devices 250 Communication Network 301 Video Source 302 Video Picture Stream 303 Video Encoder 304 Encoded Video Data, Encoded Video Bitstream 305 Streaming Server 306 Client Subsystem 307 Input copy, encoded video data 308 Client Subsystem 309 Copy, encoded video data 310 Video Decoder 311 Video Picture Output Stream 312 Display 313 Capture Subsystem 320 Electronic Devices 330 Electronic Devices 401 Channel 410 Video Decoder 412 Drawing Device 415 Buffer Memory 420 Parser 421 Symbols 430 Electronic Devices 431 Receiver 451 Scaler / Descaler Unit 452 Intra Picture Prediction Unit, Intra Prediction Module 453 Motion Compensation Prediction Unit 455 Aggregator 456 Loop Filter Unit 457 Reference Picture Memory 458 Current Picture Buffer 501 Video Sources 503 Video Encoder, Video Coder 520 Electronic Devices 530 Source Coder 532 Coding Engine 533 Local Video Decoder 534 Reference Picture Memory, Reference Picture Cache 535 Predictor 540 Transmitter 543 coded video sequence 545 Entropy Coder 550 Controller 560 Communication Channels 603 Video Encoder 621 General-purpose controller 622 Intra Encoder 623 Residual Calculator 624 Residual Encoder 625 Entropy Encoder 626 Switch 628 Residual Decoder 630 InterEncoder 710 Video Decoder 771 Entropy Decoder 772 Intra Decoder 773 Residual Decoder 774 Reconstruction Module 780 Inter Decoder 2511 Reference Sample 2512 Reference Sample 2513 Reference Sample 2514 Reference Sample 2520 Sample 2521 Reference Sample 2522 Reference Sample 2523 Reference Sample 2524 Reference Sample 2530 Samples 2531 Reference Sample 2532 Reference Sample 2533 Reference Sample 2534 Reference Sample 2540 Samples 2541 Reference Sample 2542 Reference Sample 2543 Reference Sample 2544 Reference Sample 2600 processes 2700 Computer Systems 2701 Keyboard 2702 Mouse 2703 Trackpad 2705 ​​Joystick 2706 Microphone 2707 Scanner 2708 Camera 2709 Speaker 2710 Touch screen, visual output device screen 2720 ​​CD / DVD ROM / RW 2721 CD / DVD or similar media 2722 Thumb Drive 2723 Removable Hard Drive or Solid State Drive 2740 cores 2741 Central Processing Unit 2742 Graphics Processing Unit 2743 Field Programmable Gate Area 2744 Accelerator 2745 Read Only Memory 2746 Random Access Memory 2747 Internal Mass Storage 2748 System Bus 2749 Surrounding bus 2750 Graphics Adapter 2754 Network Interface 2755 Communication Networks

Claims

1. 1. A method of video encoding in an encoder, comprising: Partitioning a current block in a current picture into a plurality of partitions including an L-shaped partition; encoding the L-shaped partition based on neighboring samples adjacent to at least one of: (i) the L-shaped partition; or (ii) the current block; generating a coded video bitstream including the encoded L-shaped partition and prediction information indicating a non-directional intra-prediction mode for the current block; the number of adjacent samples used to encode the L-shaped section depends on at least one dimension of the L-shaped section; the number of adjacent samples is one of: (i) the sum of a width and a height of the L-shaped section; (ii) the sum of a shorter width and a shorter height of the L-shaped section; (iii) the maximum of the width and the height of the L-shaped section; and (iv) the minimum of the width and the height of the L-shaped section. method.

2. The method of claim 1 , wherein at least one of the adjacent samples is located in another one of the plurality of sections to be reconstructed prior to the L-shaped section.

3. 3. The method of claim 2, wherein the other one of the plurality of partitions is an L-shaped partition, and the at least one of the adjacent samples is located adjacent to one of a right side or a bottom side of the L-shaped partition.

4. The adjacent samples include adjacent samples in a left column and a right column of the L-shaped section, and the encoding step includes: determining adjacent reference samples in a row below the L-shaped section based on adjacent samples in the left and right columns of the L-shaped section; encoding the L-shaped partition based on adjacent reference samples in the row below the L-shaped partition; The method of claim 1 , comprising:

5. The adjacent samples include adjacent samples in an upper row and a lower row of the L-shaped section, and the encoding step comprises: determining an adjacent reference sample in a left column of the L-shaped section based on the adjacent samples in the upper row and the lower row of the L-shaped section; encoding the L-shaped partition based on the reference samples of the adjacent left column of the L-shaped partition; The method of claim 1 , comprising:

6. The method of claim 1 , wherein the encoding step comprises encoding the L-shaped partition based on adjacent samples in a left column and a top row of the current block.

7. The encoding step includes: for each sample of the L-shaped section, determining one or more of the neighboring reference samples based on a position of the respective sample; encoding each sample of the L-shaped partition based on one or more of the neighboring samples determined for the respective sample; The method of claim 1 , comprising:

8. 8. The method of claim 7, wherein the step of encoding each sample of the L-shaped partition comprises the step of encoding the respective sample based on adjacent reference samples by copying or extrapolating values ​​of the adjacent reference samples from one or more other adjacent samples.

9. Partitioning the current block in a current picture into a plurality of partitions including an L-shaped partition; encoding the L-shaped partition based on neighboring samples adjacent to at least one of: (i) the L-shaped partition; or (ii) the current block; generating a coded video bitstream including the encoded L-shaped partition and prediction information indicating a non-directional intra-prediction mode for the current block; A processing circuit configured to the number of adjacent samples used to encode the L-shaped section depends on at least one dimension of the L-shaped section; the number of adjacent samples is one of: (i) the sum of the width and height of the L-shaped section, (ii) the sum of the shorter width and shorter height of the L-shaped section, (iii) the maximum of the width and height of the L-shaped section, and (iv) the minimum of the width and height of the L-shaped section.

10. The apparatus of claim 9 , wherein at least one of the adjacent samples is located in another one of the plurality of sections to be reconstructed prior to the L-shaped section.

11. 11. The apparatus of claim 10, wherein the other one of the plurality of sections is an L-shaped section, and the at least one of the adjacent samples is located adjacent one of a right side or a bottom side of the L-shaped section.

12. The adjacent samples include adjacent samples in a left column and a right column of the L-shaped section, and the processing circuitry determining adjacent reference samples in a row below the L-shaped section based on the adjacent samples in the left column and the right column of the L-shaped section; encoding the L-shaped partition based on the adjacent reference samples in the row below the L-shaped partition; The apparatus of claim 9 further configured to:

13. The adjacent samples include adjacent samples in an upper row and a lower row of the L-shaped section, and the processing circuitry determining an adjacent reference sample in a left column of the L-shaped section based on the adjacent samples in the upper row and the lower row of the L-shaped section; encoding the L-shaped partition based on the adjacent reference samples in the left column of the L-shaped partition; The apparatus of claim 9 further configured to:

14. The processing circuitry includes: The apparatus of claim 9 , further configured to encode the L-shaped partition based on adjacent samples in a left column and a top row of the current block.

15. The processing circuitry includes: determining, for each sample of the L-shaped section, one or more neighboring samples based on a position of the respective sample; encoding each sample of the L-shaped section based on one or more of the neighboring samples determined for the respective sample. The apparatus of claim 9 further configured to:

16. When executed by at least one processor, the method causes the at least one processor to: Partitioning a current block in a current picture into a plurality of partitions including an L-shaped partition; encoding the L-shaped partition based on neighboring samples adjacent to at least one of: (i) the L-shaped partition; or (ii) the current block; generating a coded video bitstream including the encoded L-shaped partition and prediction information indicating a non-directional intra-prediction mode for the current block; A non-transitory computer-readable storage medium having stored thereon instructions for causing a computer to execute the number of adjacent samples used to encode the L-shaped section depends on at least one dimension of the L-shaped section; a non-transitory computer-readable storage medium, wherein the number of adjacent samples is one of: (i) a sum of a width and a height of the L-shaped section, (ii) a sum of a shorter width and a shorter height of the L-shaped section, (iii) a maximum value of the width and the height of the L-shaped section, and (iv) a minimum value of the width and the height of the L-shaped section.

Images