WO2020142685A1

WO2020142685A1 - Video coding with triangle prediction

Info

Publication number: WO2020142685A1
Application number: PCT/US2020/012179
Authority: WO
Inventors: Xianglin Wang; Yi-Wen Chen
Original assignee: Beijing Dajia Internet Information Technology Co., Ltd.
Priority date: 2019-01-03
Filing date: 2020-01-03
Publication date: 2020-07-09
Also published as: CN113545050A; CN113545050B

Abstract

A method for video coding is provided. The method includes: partitioning video pictures into a plurality of coding units (CUs), at least one of which is further partitioned into two prediction units (PUs) including at least one triangular shaped PU; constructing a first merge list including a plurality of candidates, each being a motion vector, based on a merge list construction process for regular merge prediction; and constructing a uni-directional prediction merge list for the triangular shaped PU using at least a subset of the candidates in the first merge list.

Description

VIDEO CODING WITH TRIANGLE PREDICTION

CROSS-REFERENCE TO RELATED APPLICATIONS

[0001] The present application claims priority to US Provisional Application No. 62/788,131, entitled“Video Coding with Triangle Prediction” filed on January 3, 2019, and US Provisional Application No. 62/788,765, entitled“Video Coding Using Triangle Prediction” filed on January 4, 2019, which are incorporated by reference in their entirety for all purpose.

FIELD

[0002] The present application generally relates to video coding and compression, and in particular but not limited to, methods and apparatus for motion compensated prediction using triangular prediction unit in video coding.

BACKGROUND

[0003] Digital video is supported by a variety of electronic devices, such as digital televisions, laptop or desktop computers, tablet computers, digital cameras, digital recording devices, digital media players, video gaming consoles, smart phones, video teleconferencing devices, video streaming devices, etc. The electronic devices transmit, receive, encode, decode, and/or store digital video data by implementing video compression/decompression. Digital video devices implement video coding techniques, such as those described in the standards defined by Versatile Video Coding (VVC), Joint Exploration Test Model (JEM), MPEG-2, MPEG-4, ITU-T H.263, ITU-T H.264/MPEG-4, Part 10, Advanced Video Coding (AVC), ITU-T H.265/High Efficiency Video Coding (HEVC), and extensions of such standards.

[0004] Video coding generally utilizes prediction methods (e.g., inter-prediction, intra prediction) that take advantage of redundancy present in video images or sequences. An important goal of video coding techniques is to compress video data into a form that uses a lower bit rate, while avoiding or minimizing degradations to video quality. With ever-evolving video services becoming available, encoding techniques with better coding efficiency are needed.

[0005] Video compression typically includes performing spatial (intra frame) prediction and/or temporal (inter frame) prediction to reduce or remove redundancy inherent in the video data. For block-based video coding, a video frame is partitioned into one or more slices, each slice having multiple video blocks, which may also be referred to as coding tree units (CTUs). Each CTU may contain one coding unit (CU) or recursively split into smaller CUs until the predefined minimum CU size is reached. Each CU (also named leaf CU) contains one or multiple transform units (TUs) and each CU also contains one or multiple prediction units (PUs). Each CU can be coded in intra, inter or IBC modes. Video blocks in an intra coded (I) slice of a video frame are encoded using spatial prediction with respect to reference samples in neighbor blocks within the same video frame. Video blocks in an inter coded (P or B) slice of a video frame may use spatial prediction with respect to reference samples in neighbor blocks within the same video frame or temporal prediction with respect to reference samples in other previous and/or future reference video frames.

[0006] Spatial or temporal prediction based on a reference block that has been previously encoded, e.g., a neighbor block, results in a predictive block for a current video block to be coded. The process of finding the reference block may be accomplished by block matching algorithm. Residual data representing pixel differences between the current block to be coded and the predictive block is referred to as a residual block or prediction errors. An inter-coded block is encoded according to a motion vector that points to a reference block in a reference frame forming the predictive block, and the residual block. The process of determining the motion vector is typically referred to as motion estimation. An intra coded block is encoded according to an intra prediction mode and the residual block. For further compression, the residual block is transformed from the pixel domain to a transform domain, e.g., frequency domain, resulting in residual transform coefficients, which may then be quantized. The quantized transform coefficients, initially arranged in a two-dimensional array, may be scanned to produce a one-dimensional vector of transform coefficients, and then entropy encoded into a video bitstream to achieve even more compression.

[0007] The encoded video bitstream is then saved in a computer-readable storage medium (e.g., flash memory) to be accessed by another electronic device with digital video capability or directly transmitted to the electronic device wired or wirelessly. The electronic device then performs video decompression (which is an opposite process to the video compression described above) by, e.g., parsing the encoded video bitstream to obtain syntax elements from the bitstream and reconstructing the digital video data to its original format from the encoded video bitstream based at least in part on the syntax elements obtained from the bitstream, and renders the reconstructed digital video data on a display of the electronic device.

[0008] With digital video quality going from high definition, to 4Kx2K or even 8Kx4K, the amount of vide data to be encoded/decoded grows exponentially. It is a constant challenge in terms of how the video data can be encoded/decoded more efficiently while maintaining the image quality of the decoded video data.

[0009] In a Joint Video Experts Team (JVET) meeting, JVET defined the first draft of Versatile Video Coding (VVC) and the VVC Test Model 1 (VTM1) encoding method. It was decided to include a quadtree with nested multi-type tree using binary and ternary splits coding block structure as the initial new coding feature of VVC. Since then, the reference software VTM to implement the encoding method and the draft VVC decoding process has been developed during the JVET meetings.

SUMMARY

[0010] In general, this disclosure describes examples of techniques relating to motion compensated prediction using triangular prediction unit in video coding.

[0011] According to a first aspect of the present disclosure, there is provided a method for video coding, including: partitioning video pictures into a plurality of coding units (CUs), at least one of which is further partitioned into two prediction units (PUs) including at least one triangular shaped PU; constructing a first merge list including a plurality of candidates, each being a motion vector, based on a merge list construction process for regular merge prediction; and constructing a uni-directional prediction merge list for the triangular shaped PU using at least a subset of the candidates in the first merge list.

[0012] According to a second aspect of the present disclosure, there is provided a method for video coding, including: partitioning video pictures into a plurality of coding units (CUs), at least one of which is further partitioned into two prediction units (PUs) including at least one triangular shaped PU; and processing the triangular shaped PU with a memory cost reduction algorithm so as to prepare the triangular shaped PU for bi-directional predictions.

[0013] According to a third aspect of the present disclosure, there is provided an apparatus for video coding, including: a processor; and a memory configured to store instructions executable by the processor; where the processor, upon execution of the instructions, is configured to: partition video pictures into a plurality of coding units (CUs), at least one of which is further partitioned into two prediction units (PUs) including at least one triangular shaped PU; construct a first merge list including a plurality of candidates, each being a motion vector, based on a merge list construction process for regular merge prediction; and construct a uni directional prediction merge list for the triangular shaped PU using at least a subset of the candidates in the first merge list.

[0014] According to a fourth aspect of the present disclosure, there is provided an apparatus for video coding, including: a processor; and a memory configured to store instructions executable by the processor; where the processor, upon execution of the instructions, is configured to: partition video pictures into a plurality of coding units (CUs), at least one of which is further partitioned into two prediction units (PUs) including at least one triangular shaped PU; and process the triangular shaped PU with a memory cost reduction algorithm so as to prepare the triangular shaped PU for bi-directional predictions.

BRIEF DESCRIPTION OF DRAWINGS

[0015] A more particular description of the examples of the present disclosure will be rendered by reference to specific examples illustrated in the appended drawings. Given that these drawings depict only some examples and are not therefore considered to be limiting in scope, the examples will be described and explained with additional specificity and details through the use of the accompanying drawings.

[0016] FIG. 1 is a block diagram illustrating an exemplary video encoding and decoding system in accordance with some implementations of the present disclosure.

[0017] FIG. 2 is a block diagram illustrating an exemplary video encoder in accordance with some implementations of the present disclosure.

[0018] FIG. 3 is a block diagram illustrating an exemplary video decoder in accordance with some implementations of the present disclosure.

[0019] FIG. 4 is a schematic diagram illustrating a quadtree plus binary tree (QTBT) structure in accordance with some implementations of the present disclosure.

[0020] FIG. 5 is a schematic diagram illustrating an example of a picture divided into CTUs in accordance with some implementations of the present disclosure.

[0021] FIG. 6 is a schematic diagram illustrating multi-type tree splitting modes in accordance with some implementations of the present disclosure.

[0022] FIG. 7 is a schematic diagram illustrating splitting a CU into triangular prediction units in accordance with some implementations of the present disclosure.

[0023] FIG. 8 is a schematic diagram illustrating positions of neighboring blocks in accordance with some implementations of the present disclosure.

[0024] FIG. 9 is a schematic diagram illustrating an example of weighting with a weighting factor set in accordance with some implementations of the present disclosure.

[0025] FIG. 10 is a schematic diagram illustrating examples of PU partitions in accordance with some implementations of the present disclosure.

[0026] FIG. 11 is a schematic diagram illustrating positions of spatial merge candidates in accordance with some implementations of the present disclosure.

[0027] FIG. 12 is a schematic diagram illustrating motion vector scaling for a temporal merge candidate in accordance with some implementations of the present disclosure. [0028] FIG. 13 is a schematic diagram illustrating candidate positions for a temporal merge candidate in accordance with some implementations of the present disclosure.

[0029] FIG. 14 is a block diagram illustrating an exemplary apparatus for video coding in accordance with some implementations of the present disclosure.

[0030] FIG. 15 is a flowchart illustrating an exemplary process of video coding for motion compensated prediction using triangular prediction unit in accordance with some implementations of the present disclosure.

[0031] FIG. 16 is a flowchart illustrating an exemplary process of video coding for motion compensated prediction using triangular prediction unit in accordance with some implementations of the present disclosure.

DETAILED DESCRIPTION

[0032] Reference will now be made in detail to specific implementations, examples of which are illustrated in the accompanying drawings. In the following detailed description, numerous non-limiting specific details are set forth in order to assist in understanding the subject matter presented herein. But it will be apparent to one of ordinary skill in the art that various alternatives may be used. For example, it will be apparent to one of ordinary skill in the art that the subject matter presented herein can be implemented on many types of electronic devices with digital video capabilities.

[0033] Reference throughout this specification to“one embodiment,”“an embodiment,”“an example,”“some embodiments,”“some examples,” or similar language means that a particular feature, structure, or characteristic described is included in at least one embodiment or example. Features, structures, elements, or characteristics described in connection with one or some embodiments are also applicable to other embodiments, unless expressly specified otherwise.

[0034] Throughout the disclosure, the terms“first,”“second,”“third,” and etc. are all used as nomenclature only for references to relevant elements, e.g. devices, components, compositions, steps, and etc., without implying any spatial or chronological orders, unless expressly specified otherwise. For example, a“first device” and a“second device” may refer to two separately formed devices, or two parts, components or operational states of a same device, and may be named arbitrarily.

[0035] As used herein, the term“if’ or“when” may be understood to mean“upon” or“in response to” depending on the context. These terms, if appear in a claim, may not indicate that the relevant limitations or features are conditional or optional.

[0036] The terms “module,” “sub-module,” “circuit,” “sub-circuit,” “circuitry,” “sub circuitry,”“unit,” or“sub-unit” may include memory (shared, dedicated, or group) that stores code or instructions that can be executed by one or more processors. A module may include one or more circuits with or without stored code or instructions. The module or circuit may include one or more components that are directly or indirectly connected. These components may or may not be physically attached to, or located adjacent to, one another.

[0037] A unit or module may be implemented purely by software, purely by hardware, or by a combination of hardware and software. In a pure software implementation, for example, the unit or module may include functionally related code blocks or software components, that are directly or indirectly linked together, so as to perform a particular function.

[0038] FIG. 1 is a block diagram illustrating an exemplary system 10 for encoding and decoding video blocks in accordance with some implementations of the present disclosure. As shown in FIG. 1, the system 10 includes a source device 12 that generates and encodes video data which is to be decoded at a later time by a destination device 14. The source device 12 and the destination device 14 may be any of a wide variety of electronic devices, including desktop or laptop computers, tablet computers, smart phones, set-top boxes, digital televisions, cameras, display devices, digital media players, video gaming consoles, video streaming device, or the like. In some implementations, the source device 12 and the destination device 14 are equipped with wireless communication capabilities.

[0039] In some implementations, the destination device 14 may receive the encoded video data to be decoded via a link 16. The link 16 may be any type of communication medium or device capable of moving the encoded video data from the source device 12 to the destination device 14. In one example, the link 16 may be a communication medium to enable the source device 12 to transmit the encoded video data directly to the destination device 14 in real-time. The encoded video data may be modulated according to a communication standard, such as a wireless communication protocol, and transmitted to the destination device 14. The communication medium may be any wireless or wired communication medium, such as a radio frequency (RF) spectrum or one or more physical transmission lines. The communication medium may form part of a packet-based network, such as a local area network, a wide-area network, or a global network such as the Internet. The communication medium may include routers, switches, base stations, or any other equipment that may be useful to facilitate communication from the source device 12 to the destination device 14.

[0040] In some other implementations, the encoded video data may be transmitted from an output interface 22 to a storage device 32. Subsequently, the encoded video data in the storage device 32 may be accessed by the destination device 14 via an input interface 28. The storage device 32 may include any of a variety of distributed or locally accessed data storage media such as a hard drive, Blu-ray discs, DVDs, CD-ROMs, flash memory, volatile or non-volatile memory, or any other suitable digital storage media for storing encoded video data. In a further example, the storage device 32 may correspond to a file server or another intermediate storage device that may hold the encoded video data generated by the source device 12. The destination device 14 may access the stored video data from the storage device 32 via streaming or downloading. The file server may be any type of computer capable of storing encoded video data and transmitting the encoded video data to the destination device 14. Exemplary file servers include a web server (e.g., for a website), an FTP server, network attached storage (NAS) devices, or a local disk drive. The destination device 14 may access the encoded video data through any standard data connection, including a wireless channel (e.g., a Wi-Fi connection), a wired connection (e.g., DSL, cable modem, etc.), or a combination of both which is suitable for accessing encoded video data stored on a file server. The transmission of the encoded video data from the storage device 32 may be a streaming transmission, a download transmission, or a combination of both. [0041] As shown in FIG. 1, the source device 12 includes a video source 18, a video encoder 20 and the output interface 22. The video source 18 may include a source such as a video capture device, e.g., a video camera, a video archive containing previously captured video, a video feed interface to receive video from a video content provider, and/or a computer graphics system for generating computer graphics data as the source video, or a combination of such sources. As one example, if the video source 18 is a video camera of a security surveillance system, the source device 12 and the destination device 14 may be camera phones or video phones. However, the implementations described in the present disclosure may be applicable to video coding in general, and may be applied to wireless and/or wired applications.

[0042] The captured, pre-captured, or computer-generated video may be encoded by the video encoder 20. The encoded video data may be transmitted directly to the destination device 14 via the output interface 22 of the source device 12. The encoded video data may also (or alternatively) be stored onto the storage device 32 for later access by the destination device 14 or other devices, for decoding and/or playback. The output interface 22 may further include a modem and/or a transmitter.

[0043] The destination device 14 includes an input interface 28, a video decoder 30, and a display device 34. The input interface 28 may include a receiver and/or a modem and receive the encoded video data over the link 16. The encoded video data communicated over the link 16, or provided on the storage device 32, may include a variety of syntax elements generated by the video encoder 20 for use by the video decoder 30 in decoding the video data. Such syntax elements may be included within the encoded video data transmitted on a communication medium, stored on a storage medium, or stored a file server.

[0044] In some implementations, the destination device 14 may include the display device 34, which may be an integrated display device or an external display device that is configured to communicate with the destination device 14. The display device 34 displays the decoded video data to a user, and may be any of a variety of display devices such as a liquid crystal display (LCD), a plasma display, an organic light emitting diode (OLED) display, or another type of display device. [0045] The video encoder 20 and the video decoder 30 may operate according to proprietary or industry standards, such as VVC, HEVC, MPEG-4, Part 10, Advanced Video Coding (AVC), or extensions of such standards. It should be understood that the present disclosure is not limited to a specific video coding/decoding standard and may be applicable to other video coding/decoding standards. It is generally contemplated that the video encoder 20 of the source device 12 may be configured to encode video data according to any of these current or future standards. Similarly, it is also generally contemplated that the video decoder 30 of the destination device 14 may be configured to decode video data according to any of these current or future standards.

[0046] The video encoder 20 and the video decoder 30 each may be implemented as any of a variety of suitable encoder circuitry, such as one or more microprocessors, digital signal processors (DSPs), application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs), discrete logic, software, hardware, firmware or any combinations thereof. When implemented partially in software, an electronic device may store instructions for the software in a suitable, non-transitory computer-readable medium and execute the instructions in hardware using one or more processors to perform the video coding/decoding operations disclosed in the present disclosure. Each of the video encoder 20 and the video decoder 30 may be included in one or more encoders or decoders, either of which may be integrated as part of a combined encoder/decoder (CODEC) in a respective device.

[0047] FIG. 2 is a block diagram illustrating an exemplary video encoder 20 in accordance with some implementations described in the present disclosure. The video encoder 20 may perform intra and inter predictive coding of video blocks within video frames. Intra predictive coding relies on spatial prediction to reduce or remove spatial redundancy in video data within a given video frame or picture. Inter predictive coding relies on temporal prediction to reduce or remove temporal redundancy in video data within adjacent video frames or pictures of a video sequence.

[0048] As shown in FIG. 2, the video encoder 20 includes a video data memory 40, a prediction processing unit 41, a decoded picture buffer (DPB) 64, a summer 50, a transform processing unit 52, a quantization unit 54, and an entropy encoding unit 56. The prediction processing unit 41 further includes a motion estimation unit 42, a motion compensation unit 44, a partition unit 45, an intra prediction processing unit 46, an intra block copy (IBC) unit 48, and an intra/inter mode decision unit 49. In some implementations, the video encoder 20 also includes an inverse quantization unit 58, an inverse transform processing unit 60, and a summer 62 for video block reconstruction. A deblocking filter may be positioned between the summer 62 and the DPB 64 to filter block boundaries to remove blockiness artifacts from a reconstructed video. An in loop filter 63 may also be used in addition to the deblocking filter to filter the output of summer 62. The video encoder 20 may take the form of a fixed or programmable hardware unit or may be divided among one or more of the fixed or programmable hardware units.

[0049] The video data memory 40 may store video data to be encoded by the components of the video encoder 20. The video data in the video data memory 40 may be obtained, for example, from the video source 18. The DPB 64 is a buffer that stores reference video data for use in encoding video data by the video encoder 20 (e.g., in intra or inter predictive coding modes). The video data memory 40 and DPB 64 may be any of a variety of memory devices. In various examples, the video data memory 40 may be on-chip with other components of the video encoder 20, or off-chip relative to those components.

[0050] As shown in FIG. 2, after receiving video data, the partition unit 45 within the prediction processing unit 41 partitions the video data into video blocks. This partitioning may also include partitioning a video frame into slices, tiles, or other larger coding units (CUs) according to a predefined splitting structures such as quad-tree structure associated with the video data. The video frame may be divided into multiple video blocks (or sets of video blocks referred to as tiles). The prediction processing unit 41 may select one of a plurality of possible predictive coding modes, such as one of a plurality of intra predictive coding modes or one of a plurality of inter predictive coding modes, for the current video block based on error results (e.g., coding rate and the level of distortion). The prediction processing unit 41 may provide the resulting intra or inter prediction coded block to the summer 50 to generate a residual block and to the summer 62 to reconstruct the encoded block for use as part of a reference frame subsequently. The prediction processing unit 41 also provides syntax elements, such as motion vectors, intra-mode indicators, partition information, and other such syntax information, to the entropy encoding unit 56.

[0051] In order to select an appropriate intra predictive coding mode for the current video block, the intra prediction processing unit 46 within the prediction processing unit 41 may perform intra predictive coding of the current video block relative to one or more neighbor blocks in the same frame as the current block to be coded to provide spatial prediction. The motion estimation unit 42 and the motion compensation unit 44 within the prediction processing unit 41 perform inter predictive coding of the current video block relative to one or more predictive blocks in one or more reference frames to provide temporal prediction. The video encoder 20 may perform multiple coding passes, e.g., to select an appropriate coding mode for each block of the video data.

[0052] In some implementations, the motion estimation unit 42 determines the inter prediction mode for a current video frame by generating a motion vector, which indicates the displacement of a prediction unit (PU) of a video block within the current video frame relative to a predictive block within a reference video frame, according to a predetermined pattern within a sequence of video frames. Motion estimation, performed by the motion estimation unit 42, is the process of generating motion vectors, which estimate motion for video blocks. A motion vector, for example, may indicate the displacement of a PU of a video block within a current video frame or picture relative to a predictive block within a reference frame (or other coded unit) relative to the current block being coded within the current frame (or other coded unit). The predetermined pattern may designate video frames in the sequence as P frames or B frames. The intra BC unit 48 may determine vectors, e.g., block vectors, for intra BC coding in a manner similar to the determination of motion vectors by the motion estimation unit 42 for inter prediction, or may utilize the motion estimation unit 42 to determine the block vector.

[0053] A predictive block is a block of a reference frame that is deemed as closely matching the PU of the video block to be coded in terms of pixel difference, which may be determined by sum of absolute difference (SAD), sum of square difference (SSD), or other difference metrics. In some implementations, the video encoder 20 may calculate values for sub-integer pixel positions of reference frames stored in the DPB 64. For example, the video encoder 20 may interpolate values of one-quarter pixel positions, one-eighth pixel positions, or other fractional pixel positions of the reference frame. Therefore, the motion estimation unit 42 may perform a motion search relative to the full pixel positions and fractional pixel positions, and output a motion vector with fractional pixel precision.

[0054] The motion estimation unit 42 calculates a motion vector for a PU of a video block in an inter prediction coded frame by comparing the position of the PU to the position of a predictive block of a reference frame selected from a first reference frame list (e.g., List 0) or a second reference frame list (e.g., List 1), each of which identifies one or more reference frames stored in the DPB 64. The motion estimation unit 42 sends the calculated motion vector to the motion compensation unit 44 and then to the entropy encoding unit 56.

[0055] Motion compensation, performed by the motion compensation unit 44, may involve fetching or generating the predictive block based on the motion vector determined by the motion estimation unit 42. Upon receiving the motion vector for the PU of the current video block, the motion compensation unit 44 may locate a predictive block to which the motion vector points in one of the reference frame lists, retrieve the predictive block from the DPB 64, and forward the predictive block to the summer 50 The summer 50 then forms a residual video block of pixel difference values by subtracting pixel values of the predictive block provided by the motion compensation unit 44 from the pixel values of the current video block being coded. The pixel difference values forming the residual vide block may include luma or chroma difference components or both. The motion compensation unit 44 may also generate syntax elements associated with the video blocks of a video frame for use by the video decoder 30 in decoding the video blocks of the video frame. The syntax elements may include, for example, syntax elements defining the motion vector used to identify the predictive block, any flags indicating the prediction mode, or any other syntax information described herein. Note that the motion estimation unit 42 and the motion compensation unit 44 may be highly integrated, but they are illustrated separately for conceptual purposes. [0056] In some implementations, the intra BC unit 48 may generate vectors and fetch predictive blocks in a manner similar to that described above in connection with the motion estimation unit 42 and the motion compensation unit 44, but with the predictive blocks being in the same frame as the current block being coded and with the vectors being referred to as block vectors as opposed to motion vectors. In particular, the intra BC unit 48 may determine an intra-prediction mode to use to encode a current block. In some examples, the intra BC unit 48 may encode a current block using various intra-prediction modes, e.g., during separate encoding passes, and test their performance through rate-distortion analysis. Next, the intra BC unit 48 may select, among the various tested intra-prediction modes, an appropriate intra prediction mode to use and generate an intra-mode indicator accordingly. For example, the intra BC unit 48 may calculate rate-distortion values using a rate-distortion analysis for the various tested intra-prediction modes, and select the intra-prediction mode having the best rate- distortion characteristics among the tested modes as the appropriate intra-prediction mode to use. Rate-distortion analysis generally determines an amount of distortion (or error) between an encoded block and an original, unencoded block that was encoded to produce the encoded block, as well as a bitrate (i.e., a number of bits) used to produce the encoded block. The intra BC unit 48 may calculate ratios from the distortions and rates for the various encoded blocks to determine which intra-prediction mode exhibits the best rate-distortion value for the block.

[0057] In other examples, the intra BC unit 48 may use the motion estimation unit 42 and the motion compensation unit 44, in whole or in part, to perform such functions for intra BC prediction according to the implementations described herein. In either case, for intra block copy, a predictive block may be a block that is deemed as closely matching the block to be coded, in terms of pixel difference, which may be determined by sum of absolute difference (SAD), sum of squared difference (SSD), or other difference metrics, and identification of the predictive block may include calculation of values for sub-integer pixel positions.

[0058] Whether the predictive block is from the same frame according to the intra prediction, or a different frame according to the inter prediction, the video encoder 20 may form a residual video block by subtracting pixel values of the predictive block from the pixel values of the current video block being coded, forming pixel difference values. The pixel difference values forming the residual video block may include both luma and chroma component differences.

[0059] The intra prediction processing unit 46 may intra-predict a current video block, as an alternative to the inter-prediction performed by the motion estimation unit 42 and the motion compensation unit 44, or the intra block copy prediction performed by the intra BC unit 48, as described above. In particular, the intra prediction processing unit 46 may determine an intra prediction mode to use to encode a current block. To do so, the intra prediction processing unit 46 may encode a current block using various intra prediction modes, e.g., during separate encoding passes, and the intra prediction processing unit 46 (or a mode select unit, in some examples) may select an appropriate intra prediction mode to use from the tested intra prediction modes. The intra prediction processing unit 46 may provide information indicative of the selected intra-prediction mode for the block to the entropy encoding unit 56. The entropy encoding unit 56 may encode the information indicating the selected intra-prediction mode in the bitstream.

[0060] After the prediction processing unit 41 determines the predictive block for the current video block via either inter prediction or intra prediction, the summer 50 forms a residual video block by subtracting the predictive block from the current video block. The residual video data in the residual block may be included in one or more transform units (TUs) and is provided to the transform processing unit 52. The transform processing unit 52 transforms the residual video data into residual transform coefficients using a transform, such as a discrete cosine transform (DCT) or a conceptually similar transform.

[0061] The transform processing unit 52 may send the resulting transform coefficients to the quantization unit 54. The quantization unit 54 quantizes the transform coefficients to further reduce bit rate. The quantization process may also reduce the bit depth associated with some or all of the coefficients. The degree of quantization may be modified by adjusting a quantization parameter. In some examples, the quantization unit 54 may then perform a scan of a matrix including the quantized transform coefficients. Alternatively, the entropy encoding unit 56 may perform the scan. [0062] Following quantization, the entropy encoding unit 56 entropy encodes the quantized transform coefficients into a video bitstream using, e.g., context adaptive variable length coding (CAVLC), context adaptive binary arithmetic coding (CABAC), syntax-based context- adaptive binary arithmetic coding (SBAC), probability interval partitioning entropy (PIPE) coding or another entropy encoding methodology or technique. The encoded bitstream may then be transmitted to the video decoder 30, or archived in the storage device 32 for later transmission to or retrieval by the video decoder 30. The entropy encoding unit 56 may also entropy encode the motion vectors and the other syntax elements for the current video frame being coded.

[0063] The inverse quantization unit 58 and the inverse transform processing unit 60 apply inverse quantization and inverse transformation, respectively, to reconstruct the residual video block in the pixel domain for generating a reference block for prediction of other video blocks. As noted above, the motion compensation unit 44 may generate a motion compensated predictive block from one or more reference blocks of the frames stored in the DPB 64. The motion compensation unit 44 may also apply one or more interpolation filters to the predictive block to calculate sub-integer pixel values for use in motion estimation.

[0064] The summer 62 adds the reconstructed residual block to the motion compensated predictive block produced by the motion compensation unit 44 to produce a reference block for storage in the DPB 64. The reference block may then be used by the intra BC unit 48, the motion estimation unit 42 and the motion compensation unit 44 as a predictive block to inter predict another video block in a subsequent video frame.

[0065] In an example of video coding using the video encoder 20, a video frame is partitioned into blocks for processing. For each given video block, a prediction is formed based on either inter prediction or intra prediction. In inter prediction, predictors or predictive blocks may be formed through motion estimation and motion compensation, based on pixels from previously reconstructed frames. In intra prediction, predictors may be formed based on reconstructed pixels in the current frame. Through mode decision, a best predictor may be chosen to predict a current block. [0066] The prediction residual or the residual block (i.e. the difference between a current block and its predictor) is sent to a transform module, for example, the transform processing unit 52. Transform coefficients are then sent to a quantization module, e.g., the quantization unit 54, for entropy reduction. Quantized coefficients are fed to an entropy coding module, e.g., the entropy encoding unit 56, to generate compressed video bitstream. As shown in FIG. 2, prediction related information from inter and/or intra prediction modules, such as block partition information, motion vectors, reference picture index, and intra prediction mode, etc., is also going through an entropy coding module, e.g., the entropy encoding unit 56, and then saved into the bitstream.

[0067] In the video encoder 20, decoder related modules may be needed in order to reconstruct pixels for prediction purpose. First, the prediction residual is reconstructed through inverse quantization and inverse transform. The reconstructed prediction residual is then combined with the predictor to generate unfiltered reconstructed pixels for a current block.

[0068] To improve coding efficiency and visual quality, an in-loop filter 63 is commonly used. For example, a deblocking filter is available in AVC, HEVC as well as VVC. In HEVC, an additional in-loop filter called SAO (sample adaptive offset) may be defined to further improve coding efficiency. In VVC, an in-loop filter 63 called ALF (adaptive loop filter) may be employed.

[0069] These in-loop filter operations are optional. Turning on the in-loop filters usually helps improve coding efficiency and visual quality. They may also be turned-off as an encoder decision to save computation complexity.

[0070] It should be noted that intra prediction is usually based on unfiltered reconstructed pixels, while inter prediction is based on filtered reconstructed pixels if these filters are turned on by the encoder.

[0071] FIG. 3 is a block diagram illustrating an exemplary video decoder 30 in accordance with some implementations of the present disclosure. The video decoder 30 includes a video data memory 79, an entropy decoding unit 80, a prediction processing unit 81, an inverse quantization unit 86, an inverse transform processing unit 88, a summer 90, and a DPB 92. The prediction processing unit 81 further includes a motion compensation unit 82, an intra prediction processing unit 84, an intra BC unit 85, and an intra/inter mode selection unit 87. The video decoder 30 may perform a decoding process generally reciprocal to the encoding process described above with respect to the video encoder 20 in connection with FIG. 2. For example, the motion compensation unit 82 may generate prediction data based on motion vectors received from the entropy decoding unit 80, while the intra-prediction unit 84 may generate prediction data based on intra-prediction mode indicators received from the entropy decoding unit 80.

[0072] In an example of video decoding using the video decoder 30, the bitstream received is decoded through the entropy decoding unit 80 to derive quantized coefficient levels (or quantized coefficients) and prediction related information. Quantized coefficient levels are then processed through the inverse quantization unit 86 and the inverse transform processing unit 88 to obtain reconstructed residual block. A predictor or predictive block is formed through either intra prediction or motion compensation process based on prediction related information decoded. The unfiltered reconstructed pixels are obtained by summing up the reconstructed residual block and the predictor. In the case that an in-loop filter is turned on, filtering operations are performed on these pixels to derive the final reconstructed video for output.

[0073] In some examples, a unit of the video decoder 30 may be tasked to perform the implementations of the present disclosure. Also, in some examples, the implementations of the present disclosure may be divided among one or more of the units of the video decoder 30. For example, the intra BC unit 85 may perform the implementations of the present disclosure, alone, or in combination with other units of the video decoder 30, such as the motion compensation unit 82, the intra prediction processing unit 84, and the entropy decoding unit 80. In some examples, the video decoder 30 may not include the intra BC unit 85 and the functionality of the intra BC unit 85 may be performed by other components of the prediction processing unit 81, such as the motion compensation unit 82.

[0074] The video data memory 79 may store video data, such as an encoded video bitstream, to be decoded by the other components of the video decoder 30. The video data stored in the video data memory 79 may be obtained, for example, from the storage device 32, from a local video source, such as a camera, via wired or wireless network communication of video data, or by accessing physical data storage media (e.g., a flash drive or hard disk). The video data memory 79 may include a coded picture buffer (CPB) that stores encoded video data from an encoded video bitstream. The decoded picture buffer (DPB) 92 of video decoder 30 stores reference video data for use in decoding video data by the video decoder 30 (e.g., in intra or inter predictive coding modes). The video data memory 79 and the DPB 92 may be formed by any of a variety of memory devices, such as dynamic random access memory (DRAM), including synchronous DRAM (SDRAM), magneto-resistive RAM (MRAM), resistive RAM (RRAM), or other types of memory devices. For illustrative purpose, the video data memory 79 and the DPB 92 are depicted as two distinct components of the video decoder 30 in FIG. 3. But it will be apparent to one skilled in the art that the video data memory 79 and the DPB 92 may be provided by the same memory device or separate memory devices. In some examples, the video data memory 79 may be on-chip with other components of the video decoder 30, or off-chip relative to those components.

[0075] During the decoding process, the video decoder 30 receives an encoded video bitstream that represents video blocks of an encoded video frame and associated syntax elements. The video decoder 30 may receive the syntax elements at the video frame level and/or the video block level. The entropy decoding unit 80 of the video decoder 30 entropy decodes the bitstream to generate quantized coefficients, motion vectors or intra-prediction mode indicators, and other syntax elements. The entropy decoding unit 80 then forwards the motion vectors and other syntax elements to the prediction processing unit 81.

[0076] When the video frame is coded as an intra predictive coded (I) frame or for intra coded predictive blocks in other types of frames, the intra prediction processing unit 84 of the prediction processing unit 81 may generate prediction data for a video block of the current video frame based on a signaled intra prediction mode and reference data from previously decoded blocks of the current frame. [0077] When the video frame is coded as an inter-predictive coded (i.e., B or P) frame, the motion compensation unit 82 of the prediction processing unit 81 produces one or more predictive blocks for a video block of the current video frame based on the motion vectors and other syntax elements received from the entropy decoding unit 80. Each of the predictive blocks may be produced from a reference frame within one of the reference frame lists. The video decoder 30 may construct the reference frame lists, e.g., ListO and Listl, using default construction techniques based on reference frames stored in the DPB 92.

[0078] In some examples, when the video block is coded according to the intra BC mode described herein, the intra BC unit 85 of the prediction processing unit 81 produces predictive blocks for the current video block based on block vectors and other syntax elements received from the entropy decoding unit 80. The predictive blocks may be within a reconstructed region of the same picture as the current video block defined by the video encoder 20.

[0079] The motion compensation unit 82 and/or the intra BC unit 85 determines prediction information for a video block of the current video frame by parsing the motion vectors and other syntax elements, and then uses the prediction information to produce the predictive blocks for the current video block being decoded. For example, the motion compensation unit 82 uses some of the received syntax elements to determine a prediction mode (e.g., intra or inter prediction) used to code video blocks of the video frame, an inter prediction frame type (e.g., B or P), construction information for one or more of the reference frame lists for the frame, motion vectors for each inter predictive encoded video block of the frame, inter prediction status for each inter predictive coded video block of the frame, and other information to decode the video blocks in the current video frame.

[0080] Similarly, the intra BC unit 85 may use some of the received syntax elements, e.g., a flag, to determine that the current video block was predicted using the intra BC mode, construction information of which video blocks of the frame are within the reconstructed region and should be stored in the DPB 92, block vectors for each intra BC predicted video block of the frame, intra BC prediction status for each intra BC predicted video block of the frame, and other information to decode the video blocks in the current video frame. [0081] The motion compensation unit 82 may also perform interpolation using the interpolation filters as used by the video encoder 20 during encoding of the video blocks to calculate interpolated values for sub-integer pixels of reference blocks. In this case, the motion compensation unit 82 may determine the interpolation filters used by the video encoder 20 from the received syntax elements and use the interpolation filters to produce predictive blocks.

[0082] The inverse quantization unit 86 inverse quantizes the quantized transform coefficients provided in the bitstream and entropy decoded by the entropy decoding unit 80 using the same quantization parameter calculated by the video encoder 20 for each video block in the video frame to determine a degree of quantization. The inverse transform processing unit 88 applies an inverse transform, e.g., an inverse DCT, an inverse integer transform, or a conceptually similar inverse transform process, to the transform coefficients in order to reconstruct the residual blocks in the pixel domain.

[0083] After the motion compensation unit 82 or the intra BC unit 85 generates the predictive block for the current video block based on the vectors and other syntax elements, the summer 90 reconstructs decoded video block for the current video block by summing the residual block from the inverse transform processing unit 88 and a corresponding predictive block generated by the motion compensation unit 82 and the intra BC unit 85. An in-loop filter 91 may be positioned between the summer 90 and the DPB 92 to further process the decoded video block. The decoded video blocks in a given frame are then stored in the DPB 92, which stores reference frames used for subsequent motion compensation of next video blocks. The DPB 92, or a memory device separate from the DPB 92, may also store the decoded video for later presentation on a display device, such as display device 34 of FIG. 1.

[0084] In a typical video coding process, a video sequence typically includes an ordered set of frames or pictures. Each frame may include three sample arrays, denoted SL, SCb, and SCr. SL is a two-dimensional array of luma samples. SCb is a two-dimensional array of Cb chroma samples. SCr is a two-dimensional array of Cr chroma samples. In other instances, a frame may be monochrome and therefore includes only one two-dimensional array of luma samples. [0085] FIG. 4 is a schematic diagram illustrating a quadtree plus binary tree (QTBT) structure in accordance with some implementations of the present disclosure.

[0086] Video coding/decoding standards mentioned above, such as VVC, JEM, HEVC, MPEG-4, Part 10, are conceptually similar. For example, they all use block-based processing. Block partitioning schemes in some standards are elaborated below.

[0087] HEVC is based on a hybrid block-based motion-compensated transform coding architecture. The basic unit for compression is termed coding tree unit (CTU). The maximum CTU size is defined as up to 64 by 64 luma pixels, and two blocks of 32 by 32 chroma pixels for 4:2:0 chroma format. Each CTU may contain one coding unit (CU) or recursively split into four smaller CUs until the predefined minimum CU size is reached. Each CU (also named leaf CU) contains one or multiple prediction units (PUs) and a tree of transform units (TUs).

[0088] In general, except for monochrome content, a CTU may include one luma coding tree block (CTB) and two corresponding chroma CTBs; a CU may include one luma coding block (CB) and two corresponding chroma CBs; a PU may include one luma prediction block (PB) and two corresponding chroma PBs; and a TU may include one luma transform block (TB) and two corresponding chroma TBs. However, exceptions may occur because the minimum TB size is 4x4 for both luma and chroma (i.e., no 2x2 chroma TB is supported for 4:2:0 color format) and each intra chroma CB always has only one intra chroma PB regardless of the number of intra luma PBs in the corresponding intra luma CB.

[0089] For an intra CU, the luma CB can be predicted by one or four luma PBs, and each of the two chroma CBs is always predicted by one chroma PB, where each luma PB has one intra luma prediction mode and the two chroma PBs share one intra chroma prediction mode. Moreover, for the intra CU, the TB size cannot be larger than the PB size. In each PB, the intra prediction is applied to predict samples of each TB inside the PB from neighboring reconstructed samples of the TB. For each PB, in addition to 33 directional intra prediction modes, DC and planar modes are also supported to predict flat regions and gradually varying regions, respectively. [0090] For each inter PU, one of three prediction modes including inter, skip, and merge, may be selected. Generally speaking, a motion vector competition (MVC) scheme is introduced to select a motion candidate from a given candidate set that includes spatial and temporal motion candidates. Multiple references to the motion estimation allow finding the best reference in 2 possible reconstructed reference picture lists (namely List 0 and List 1). For the inter mode (termed AMVP mode, where AMVP stands for advanced motion vector prediction), inter prediction indicators (List 0, List 1, or bi-directional prediction), reference indices, motion candidate indices, motion vector differences (MVDs) and prediction residual are transmitted. As for the skip mode and the merge mode, only merge indices are transmitted, and the current PU inherits the inter prediction indicator, reference indices, and motion vectors from a neighboring PU referred by the coded merge index. In the case of a skip coded CU, the residual signal is also omitted.

[0091] The Joint Exploration Test Model (JEM) is built up on top of the HEVC test model. The basic encoding and decoding flowchart of HEVC is kept unchanged in the JEM; however, the design elements of most important modules, including the modules of block structure, intra and inter prediction, residue transform, loop filter and entropy coding, are somewhat modified and additional coding tools are added. The following new coding features are included in the JEM.

[0092] In HEVC, a CTU is split into CUs by using a quadtree structure denoted as coding tree to adapt to various local characteristics. The decision whether to code a picture area using inter picture (temporal) or intra-picture (spatial) prediction is made at the CU level. Each CU can be further split into one, two or four PUs according to the PU splitting type. Inside one PU, the same prediction process is applied and the relevant information is transmitted to the decoder on a PU basis. After obtaining the residual block by applying the prediction process based on the PU splitting type, a CU can be partitioned into transform units (TUs) according to another quadtree structure similar to the coding tree for the CU. One of key features of the HEVC structure is that it has the multiple partition conceptions including CU, PU, and TU. [0093] The QTBT structure removes the concepts of multiple partition types, i.e., it removes the separation of the CU, PU and TU concepts, and supports more flexibility for CU partition shapes. In the QTBT block structure, a CU may have either a square or rectangular shape. As shown in FIG. 4, a coding tree unit (CTU) is first partitioned by a quaternary tree (i.e., quadtree) structure. The quadtree leaf nodes may be further partitioned by a binary tree structure. There are two splitting types in the binary tree splitting: symmetric horizontal splitting and symmetric vertical splitting. The binary tree leaf nodes are called coding units (CUs), and that segmentation is used for prediction and transform processing without any further partitioning. This means that the CU, PU and TU have the same block size in the QTBT coding block structure. In the JEM, a CU sometimes consists of coding blocks (CBs) of different colour components, e.g., one CU contains one luma CB and two chroma CBs in the case of P and B slices of the 4:2:0 chroma format, and sometimes consists of a CB of a single component, e.g., one CU contains only one luma CB or just two chroma CBs in the case of I slices.

[0094] The following parameters are defined for the QTBT partitioning scheme.

- CTU size: the root node size of a quadtree, the same concept as in the HEVC;

- MinQTSize: the minimum allowed quadtree leaf node size;

- MaxBTSize: the maximum allowed binary tree root node size;

- MaxBTDepth: the maximum allowed binary tree depth;

- MinBTSize: the minimum allowed binary tree leaf node size.

[0095] In one example of the QTBT partitioning structure, the CTU size is set as 128x128 luma samples with two corresponding 64x64 blocks of chroma samples (with a 4:2:0 chroma format), the MinQTSize is set as 16x16, the MaxBTSize is set as 64x64, the MinBTSize (for both width and height) is set as 4x4, and the MaxBTDepth is set as 4. The quadtree partitioning is applied to the CTU first to generate quadtree leaf nodes. The quadtree leaf nodes may have a size from 16x 16 (i.e., the MinQTSize) to 128x128 (i.e., the CTU size). If the quadtree leaf node is 128x 128, it will not be further split by the binary tree since the size exceeds the MaxBTSize (i.e., 64x64). Otherwise, the quadtree leaf node could be further partitioned by the binary tree. Therefore, the quadtree leaf node is also the root node for the binary tree and it has the binary tree depth as 0. When the binary tree depth reaches MaxBTDepth (i.e., 4), no further splitting is considered. When the binary tree node has a width equal to MinBTSize (i.e., 4), no further horizontal splitting is considered. Similarly, when the binary tree node has a height equal to MinBTSize, no further vertical splitting is considered. The leaf nodes of the binary tree are further processed by prediction and transform processing without any further partitioning. In the JEM, the maximum CTU size is 256x256 luma samples.

[0096] FIG. 4 illustrates an example of block partitioning by using the QTBT scheme, and the corresponding tree representation. The solid lines indicate quadtree splitting and dotted lines indicate binary tree splitting. As shown in FIG. 4, the coding tree unit (CTU) 400 is first partitioned by a quadtree structure, and three of the four quadtree leaf nodes 402, 404, 406, 408 are further partitioned by either a quadtree structure or a binary tree structure. For example, the quadtree leaf node 406 is further partitioned by quadtree splitting; the quadtree leaf node 404 is further partitioned into two leaf nodes 404a, 404b by binary tree splitting; and the quadtree leaf node 402 is also further partitioned by binary tree splitting. In each splitting (i.e., non-leaf) node of the binary tree, one flag is signaled to indicate which splitting type (i.e., horizontal or vertical) is used, where 0 indicates horizontal splitting and 1 indicates vertical splitting. For example, for the quadtree leaf node 404, 0 is signaled to indicate horizontal splitting, and for the quadtree leaf node 402, 1 is signaled to indicate vertical splitting. For quadtree splitting, there is no need to indicate the splitting type since quadtree splitting always splits a block both horizontally and vertically to produce 4 sub-blocks with an equal size.

[0097] In addition, the QTBT scheme supports the ability for the luma and chroma to have a separate QTBT structure. Currently, for P and B slices, the luma and chroma CTBs in one CTU share the same QTBT structure. However, for I slices, the luma CTB is partitioned into CUs by a QTBT structure, and the chroma CTBs are partitioned into chroma CUs by another QTBT structure. This means that a CU in an I slice consists of a coding block of the luma component or coding blocks of two chroma components, and a CU in a P or B slice consists of coding blocks of all three colour components. [0098] In a Joint Video Experts Team (JVET) meeting, the JVET defined the first draft of the Versatile Video Coding (VVC) and the VVC Test Model 1 (VTM1) encoding method. It was decided to include a quadtree with nested multi-type tree using binary and ternary splits coding block structure as the initial new coding feature of VVC.

[0099] In VVC, the picture partitioning structure divides the input video into blocks called coding tree units (CTUs). A CTU is split using a quadtree with nested multi-type tree structure into coding units (CUs), with a leaf coding unit (CU) defining a region sharing the same prediction mode (e.g. intra or inter). Here, the term“unit” defines a region of an image covering all components; the term“block” is used to define a region covering a particular component (e.g. luma), and may differ in spatial location when considering the chroma sampling format such as 4:2:0.

Partitioning of the picture into CTUs

[0100] FIG. 5 is a schematic diagram illustrating an example of a picture divided into CTUs in accordance with some implementations of the present disclosure.

[0101] In VVC, pictures are divided into a sequence of CTUs, and the CTU concept is the same as that of the HEVC. For a picture that has three sample arrays, a CTU consists of an NxN block of luma samples together with two corresponding blocks of chroma samples. FIG. 5 shows the example of a picture 500 divided into CTUs 502.

[0102] The maximum allowed size of the luma block in a CTU is specified to be 128x128 (although the maximum size of the luma transform blocks is 64x64).

Partitioning of the CTUs using a tree structure

[0103] FIG. 6 is a schematic diagram illustrating multi-type tree splitting modes in accordance with some implementations of the present disclosure.

[0104] In HEVC, a CTU is split into CUs by using a quaternary -tree structure denoted as coding tree to adapt to various local characteristics. The decision whether to code a picture area using inter-picture (temporal) or intra-picture (spatial) prediction is made at the leaf CU level. Each leaf CU can be further split into one, two or four PUs according to the PU splitting type. Inside one PU, the same prediction process is applied, and the relevant information is transmitted to the decoder on a PU basis. After obtaining the residual block by applying the prediction process based on the PU splitting type, a leaf CU can be partitioned into transform units (TUs) according to another quaternary -tree structure similar to the coding tree for the CU. One of key feature of the HEVC structure is that it has the multiple partition conceptions including CU, PU, and TU.

[0105] In VVC, a quadtree with nested multi-type tree using binary and ternary splits segmentation structure replaces the concepts of multiple partition unit types, i.e. it removes the separation of the CU, PU and TU concepts except as needed for CUs that have a size too large for the maximum transform length, and supports more flexibility for CU partition shapes. In the coding tree structure, a CU may have either a square or rectangular shape. A coding tree unit (CTU) is first partitioned by a quaternary tree (i.e., quadtree) structure. Then the quaternary tree leaf nodes can be further partitioned by a multi-type tree structure. As shown in FIG. 6, there are four splitting types in multi-type tree structure: vertical binary splitting 602 (SPLIT BT VER), horizontal binary splitting 604 (SPLIT BT HOR), vertical ternary splitting 606 (SPLIT TT VER), and horizontal ternary splitting 608 (SPLIT TT HOR). The multi-type tree leaf nodes are called coding units (CUs), and unless the CU is too large for the maximum transform length, this segmentation is used for prediction and transform processing without any further partitioning. This means that, in most cases, the CU, PU and TU have the same block size in the quadtree with nested multi-type tree coding block structure. The exception occurs when the maximum supported transform length is smaller than the width or height of the color component of the CU. In VTM1, a CU consists of coding blocks (CBs) of different color components, e.g., one CU contains one luma CB and two chroma CBs (unless the video is monochrome, i.e., having only one color component).

Partitioning CUs into multiple prediction units

[0106] In VVC, for each CU partitioned based on the structure illustrated above, prediction of the block content can be performed either on the whole CU block or in a sub-block manner explained in the following paragraphs. The operation unit of such prediction is called prediction unit (or PU).

[0107] In the case of intra prediction (or intra-frame prediction), usually the size of the PU is equal to the size of the CU. In other words, the prediction is performed on the whole CU block. For inter prediction (or inter-frame prediction), the size of the PU can be equal or less than the size of the CU. In other words, there are cases where a CU may be split into multiple PUs for prediction.

[0108] Some examples of having the PU size smaller than the CU size include an affine prediction mode, an Advanced Temporal Level Motion Vector Prediction (ATMVP) mode, and a triangle prediction mode, etc.

[0109] Under the affine prediction mode, a CU may be split into multiple 4x4 PUs for prediction. Motion vectors can be derived for each 4x4 PU and motion compensation can be performed accordingly on the 4x4 PU. Under the ATMVP mode, a CU may be split into one or multiple 8x8 PUs for prediction. Motion vectors are derived for each 8x8 PU and motion compensation can be performed accordingly on the 8x8 PU. Under the triangle prediction mode, a CU may be split into two triangular shape prediction units. Motion vectors are derived for each PU and motion compensation is performed accordingly. The triangle prediction mode is supported for inter prediction. More details of the triangle prediction mode are illustrated below.

Triangle prediction mode

[0110] FIG. 7 is a schematic diagram illustrating splitting a CU into triangular prediction units in accordance with some implementations of the present disclosure.

[0111] The concept of the triangle prediction mode is to introduce triangular partitions for motion compensated prediction. The triangle prediction mode may also be named the triangular prediction unit mode. As shown in FIG. 7, a CU 702, 704 is split into two triangular prediction units PUi and PU2, in either the diagonal or the inverse diagonal direction (i.e., either splitting from top-left comer to bottom-right comer or splitting from top-right comer to bottom-left comer). Each triangular prediction unit in the CU is inter-predicted using its own uni -prediction motion vector and reference frame index which are derived from a uni-prediction candidate list. An adaptive weighting process is performed to the diagonal edge after predicting the triangular prediction units. Then, the transform and quantization process are applied to the whole CU. It is noted that this mode is only applied to skip and merge modes in the current VVC. Although in FIG. 7, the CU is shown as a square block, the triangle prediction mode may be applied to non-square (i.e. rectangular) shape CUs as well.

[0112] The uni-prediction candidate list may comprise one or more candidates, and each candidate may be a motion vector. Thus, throughout this disclosure, the terms“uni-prediction candidate list,”“uni-prediction motion vector candidate list,” and“uni-prediction merge list” may be used interchangeably.

Uni-prediction motion vector candidate list

[0113] FIG. 8 is a schematic diagram illustrating positions of the neighboring blocks in accordance with some implementations of the present disclosure.

[0114] In some examples, the uni-prediction motion vector candidate list may include two to five uni-prediction motion vector candidates. In some other examples, other number may also be possible. It is derived from neighboring blocks. The uni-prediction motion vector candidate list is derived from seven neighboring blocks including five spatial neighboring blocks (1 to 5) and two temporal co-located blocks (6 to 7), as shown in FIG. 8. The motion vectors of the seven neighboring blocks are collected into a first merge list. Then, a uni-prediction candidate list is formed based on the first merge list motion vectors according to a specific order. Based on the order, the uni-prediction motion vectors from the first merge list are put in the uni prediction motion vector candidate list first, followed by reference picture List 0 or L0 motion vector of bi-prediction motion vectors, and then reference picture List 1 or LI motion vector of bi-prediction motion vectors, and then followed by the averaged motion vector of the L0 and LI motion vectors of bi-prediction motion vectors. At that point, if the number of candidates is still less than a target number (which is five in the current VVC), zero motion vectors are added to the list to meet the target number.

[0115] A predictor is derived for each of the triangular PUs based on its motion vector. It is worth noting that the predictor derived covers a larger area than the actual triangular PU so that there is an overlapped area of the two predictors along the shared diagonal edge of the two triangular PUs. An adaptive weighting process is applied to the diagonal edge area between the two predictors to derive a final prediction for the CU. Two sets of weighting factors are currently used as follows:

1st weighting factor set: {7/8, 6/8, 4/8, 2/8, 1/8} and {7/8, 4/8, 1/8} are used for the luminance and the chrominance samples, respectively;

2nd weighting factor set: {7/8, 6/8, 5/8, 4/8, 3/8, 2/8, 1/8} and {6/8, 4/8, 2/8} are used for the luminance and the chrominance samples, respectively.

[0116] Selection of the weighting factor set is based on the comparison of the motion vectors of the two triangular prediction units. More specifically, the 2nd weighting factor set is used when the reference pictures of the two triangular prediction units are different from each other or their motion vector difference is larger than 16 pixels. Otherwise, the 1st weighting factor set is used. FIG. 9 shows an example of weighting with a weighting factor set in accordance with some implementations of the present disclosure. In FIG. 9, the 1st weighting factor is used for the luminance samples 902 and the chrominance samples 904.

[0117] In the current VVC standard draft, to extend and/or simplify the triangle prediction mode, the idea of the triangular PU is extended to other partitions of prediction units, as shown in FIG. 10 which illustrates examples of PU partitions in accordance with some implementations of the present disclosure. In addition to the two diagonal triangular PU partitions, the method or concept used in the triangle prediction mode may be applied to other PU partitions. Basically, given a type of partition shown in FIG. 10, two uni-directional predictors are derived for each partition (e.g., PU0 and PU1), and adaptive weighting is applied around the border area of the two partitions. For example, the method used for triangular PUs may be applied to horizontal and/or vertical PUs. Regular merge mode motion vector candidate list

[0118] According to the current VVC, under the regular merge mode where a whole CU is predicted without splitting into more than one PU, the motion vector candidate list or the merge candidate list is constructed using a different procedure than that for the triangle prediction mode.

[0119] Firstly, spatial motion vector candidates are selected based on motion vectors from neighboring blocks as indicated in FIG. 11, which is a schematic diagram illustrating positions of spatial merge candidates in accordance with some implementations of the present disclosure. In the derivation of spatial merge candidates, a maximum of four merge candidates are selected among candidates that are located in positions as depicted in FIG. 11. The order of derivation is Ai - Bi - Bo - Ao -> (B2). The position B2 is considered only when any PU of positions Ai, Bi, Bo, Ao is not available or is intra coded.

[0120] Next, a temporal merge candidate is derived. In the derivation of the temporal merge candidate, a scaled motion vector is derived based on the co-located PU belonging to the picture which has the smallest Picture Order Count (POC) difference with the current picture within the given reference picture list. The reference picture list to be used for derivation of the co located PU is explicitly signaled in the slice header. The scaled motion vector for the temporal merge candidate is obtained as illustrated by the dotted line in FIG. 12 which illustrates motion vector scaling for the temporal merge candidate in accordance with some implementations of the present disclosure. The scaled motion vector for the temporal merge candidate is scaled from the motion vector of the co-located PU col PU using the POC distances, tb and td, where tb is defined to be the POC difference between the reference picture of the current picture curr ref and the current picture curr_pic and td is defined to be the POC difference between the reference picture of the co-located picture col ref and the co-located picture col_pic. The reference picture index of the temporal merge candidate is set equal to zero. A practical realization of the scaling process is described in the HEVC draft specification. For a B-slice, two motion vectors, one for reference picture List 0 and the other for reference picture List 1, are obtained and combined to make the bi-predictive merge candidate. [0121] FIG. 13 is a schematic diagram illustrating candidate positions for the temporal merge candidate in accordance with some implementations of the present disclosure.

[0122] The position of co-located PU is selected between two candidate positions, C3 and H, as depicted in FIG. 13. If the PU at position H is not available, or is intra coded, or is outside of the current CTU, position C3 is used for the derivation of the temporal merge candidate. Otherwise, position H is used for the derivation of the temporal merge candidate.

[0123] After inserting both spatial and temporal motion vectors into the merge candidate list as described above, history-based merge candidates are added. The so-called history-based merge candidates include those motion vectors from previously coded CUs, which are maintained in a separate motion vector list, and managed based on certain rules.

[0124] After inserting history-based candidates, if the merge candidate list is not full, pairwise average motion vector candidates are further added into the list. As its name indicates, this type of candidates is constructed by averaging candidates already in the current list. More specifically, based on a certain order or rule, two candidates in the merge candidate list are taken each time and the average motion vector of the two candidates is appended to the current list.

[0125] After inserting pairwise average motion vectors, if the merge candidate list is still not full, zero motion vectors will be added to make the list full.

Using regular merge list construction process to construct a first merge list for triangle prediction

[0126] The triangle prediction mode in the current VVC shares some similarities with the regular merge prediction mode, in its overall procedures in forming a predictor. For example, under both prediction modes, a merge list needs to be constructed based on at least the current CU’s neighboring spatial motion vectors and the co-located motion vectors. At the same time, the triangle prediction mode also has some aspects that are different from the regular merge prediction mode. [0127] For example, although a merge list needs to be constructed under both the triangle prediction mode and the regular merge prediction mode, the detailed procedures of constructing such a list are different.

[0128] These differences incur additional cost to codec implementation as additional logics are needed. The procedures and logics of constructing a merge list may be unified and shared between the triangle prediction mode and the regular merge prediction mode.

[0129] In some examples, in forming the uni-directional prediction (also called uni-prediction) merge list for the triangle prediction mode, before adding a new motion vector into the merge list, the new motion vector is fully pruned against those motion vectors already in the list. In other words, the new motion vector is compared with each motion vector that is already in the uni-prediction merge list, and is added into the list only when it is different from every motion vector in that merge list. Otherwise, the new motion vector is not added into the list.

[0130] According to some examples of the present disclosure, under the triangle prediction mode, the uni-directional prediction merge list is constructed from the regular merge mode motion vector candidate list, which may be referred to as a regular merge list.

[0131] More specifically, to construct a merge candidate list for the triangle prediction mode, a first merge list is firstly constructed based on the merge list construction process for the regular merge prediction. The first merge list including a plurality of candidates, each being a motion vector. Then, the uni-directional prediction merge list for the triangle prediction mode is further constructed using the motion vectors in the first merge list.

[0132] It should be noted that the first merge list constructed in this case may choose a different list size than that for the general merge mode or regular merge mode. In one example of the present disclosure, the first merge list has the same size as that for the general merge mode. In another example of the present disclosure, the first merge list constructed has a list size different from that for the general merge mode. Constructing uni-directional prediction merge list from the first merge list

[0133] According to some examples of the present disclosure, the uni-directional prediction merge list for triangle prediction mode may be constructed from the first merge list based on one of the following methods.

[0134] In an example of the present disclosure, to construct the uni-directional prediction merge list, prediction list 0 motion vectors of the candidates in the first merge list are checked and selected into the uni-directional prediction merge list first. If the uni-directional prediction merge list is not full (e.g., the number of candidates in this list is still less than the target number) after this process, prediction list 1 motion vectors of the candidates in the first merge list are checked and selected into the uni-directional prediction merge list. If the uni-directional prediction merge list is still not full, prediction list 0 zero vectors are added into the uni directional prediction merge list. If the uni-directional prediction merge list still not full, prediction list 1 zero vectors are added into the uni-directional prediction merge list.

[0135] In another example of the present disclosure, for each candidate in the first merge list, its prediction list 0 motion vector and prediction list 1 motion vector are added in an interleaving manner into the uni-directional prediction merge list. More specifically, for each candidate in the first merge list, if a candidate is a uni-directional prediction motion vector, it is added directly into the uni-directional prediction merge list. Otherwise, if the candidate is a bi-directional prediction motion vector in the first merge list, its prediction list 0 motion vector is first added into the uni-directional prediction merge list, followed by its prediction list 1 motion vector. Once all motion vector candidates in the first merge list are checked and added, but the uni-directional prediction merge list is not full yet, uni-directional prediction zero motion vectors may be added. For example, for each reference frame index, a prediction list 0 zero motion vector and a prediction list 1 zero motion vector may be separately added into the uni-directional prediction merge list until the list is full.

[0136] In yet another example of the present disclosure, the uni-directional prediction motion vectors from the first merge list are selected into the uni-directional prediction merge list first. If the uni-directional prediction merge list is not full after this process, for each bi-directional prediction motion vectors in the first merge list, its prediction list 0 motion vector is first added into the uni-directional prediction merge list, followed by its prediction list 1 motion vector. After this process, if the uni-directional prediction merge list is not full yet, uni-directional prediction zero motion vectors may be added. For example, for each reference frame index, a prediction list 0 zero motion vector and a prediction list 1 zero motion vector may be separately added into the uni-directional prediction merge list until the list is full.

[0137] In the descriptions above, when a uni-directional prediction motion vector is added into the uni-directional prediction merge list, a motion vector pruning process may be performed to make sure that the new motion vector to be added is different from those motion vectors already in the uni-directional prediction merge list. Such motion vector pruning process may also be performed in a partial manner for lower complexity, e.g., checking the new motion vector to be added only against some but not all motion vectors already in the uni-directional prediction merge list. In an extreme case, no motion vector pruning (i.e., motion vector comparison operation) is performed in the process.

Constructing uni-directional prediction merge list from the first merge list based on picture prediction configuration

[0138] In some examples of the present disclosure, the uni-prediction merge list may be constructed in an adaptive manner based on whether a current picture uses backward prediction. For example, the uni-prediction merge list may be constructed using different methods depending on whether a current picture uses backward prediction. If the Picture Order Count (POC) values of all the reference pictures are not greater than the current picture’s POC value, it means that the current picture does not use backward prediction.

[0139] In an example of the present disclosure, when a current picture does not use backward prediction, or upon determining that the current picture does not use backward prediction, prediction list 0 motion vectors of the candidates in the first merge list are checked and selected into the uni-directional prediction merge list first, followed by prediction list 1 motion vectors of those candidates; and if the uni-directional prediction merge list is still not full, uni- prediction zero motion vectors may be added. Otherwise, if the current picture uses backward prediction, prediction list 0 and list 1 motion vectors of each candidate in the first merge list may be checked and selected into the uni-directional prediction merge list in an interleaving manner as described above, i.e., the prediction list 0 motion vector of the first candidate in the first merge list is added, followed by the prediction list 1 motion vector of the first candidate, and then the prediction list 0 motion vector of the second candidate is added, followed by the prediction list 1 motion vector of the second candidate, and so on. At the end of the process, if the uni-directional prediction merge list is still not full, uni-prediction zero vectors may be added.

[0140] In another example of the present disclosure, if a current picture does not use backward prediction, prediction list 1 motion vectors of the candidates in the first merge list are checked and selected into the uni -directional prediction merge list first, followed by prediction list 0 motion vectors of those candidates; and if the uni-directional prediction merge list is still not full, uni-prediction zero motion vectors may be added. Otherwise, if the current picture uses backward prediction, prediction list 0 and list 1 motion vectors of each candidate in the first merge list may be checked and selected into the uni-directional prediction merge list in an interleaving manner as described above, i.e., the prediction list 0 motion vector of the first candidate in the first merge list is added, followed by the prediction list 1 motion vector of the first candidate, and then the prediction list 0 motion vector of the second candidate is added, followed by the prediction list 1 motion vector of the second candidate, and so on. At the end of the process, if the uni-directional prediction merge list is still not full, uni-prediction zero vectors may be added.

[0141] In yet another example of the present disclosure, if a current picture does not use backward prediction, only prediction list 0 motion vectors of the candidates in the first merge list are checked and selected into the uni-directional prediction merge list first, and if the uni directional prediction merge list is still not full, uni-prediction zero motion vectors may be added. Otherwise, if the current picture uses backward prediction, prediction list 0 and list 1 motion vectors of each candidate in the first merge list may be checked and selected into the uni-directional prediction merge list in an interleaving manner as described above, i.e., the prediction list 0 motion vector of the first candidate in the first merge list is added, followed by the prediction list 1 motion vector of the first candidate, and then the prediction list 0 motion vector of the second candidate is added, followed by the prediction list 1 motion vector of the second candidate, and so on. At the end of the process, if the uni-directional prediction merge list is still not full, uni-prediction zero vectors may be added.

[0142] In still another example of the present disclosure, if a current picture does not use backward prediction, only prediction list 1 motion vectors of the candidates in the first merge list are checked and selected into the uni-directional prediction merge list first, and if the uni directional prediction merge list is still not full, uni-prediction zero motion vectors may be added. Otherwise, if the current picture uses backward prediction, prediction list 0 and list 1 motion vectors of each candidate in the first merge list may be checked and selected into the uni-directional prediction merge list in an interleaving manner as described above, i.e., the prediction list 0 motion vector of the first candidate in the first merge list is added, followed by the prediction list 1 motion vector of the first candidate, and then the prediction list 0 motion vector of the second candidate is added, followed by the prediction list 1 motion vector of the second candidate, and so on. At the end of the process, if the uni-directional prediction merge list is still not full, uni-prediction zero vectors may be added.

[0143] In the above processes, when checking a new motion vector to be added into the uni directional prediction merge list, pruning may be performed fully, or partially. When it is performed partially, it means that the new motion vector is compared against some, but not all, of the motion vectors that are already in the uni-prediction merge list. In an extreme case, no motion vector pruning (i.e. motion vector comparison operation) is performed in the process.

[0144] The motion vector pruning may also be performed adaptively in forming the uni prediction merge list, based on whether the current picture uses backward prediction or not. For example, for the examples of the present disclosure relating to uni-directional prediction merge list construction based on picture prediction configuration, when the current picture does not use backward prediction, motion vector pruning operation is performed, either fully or partially. When the current picture uses backward prediction, motion vector pruning operation is not performed in forming the uni-prediction merge list.

Allowing bi-directional motion compensation for triangle prediction mode

[0145] The triangle prediction mode is only enabled in B-slice. In order to avoid high memory bandwidth requirement during motion compensation, in the current VVC, only uni-directional prediction is allowed for each of the triangular partitions. However, the uni-directional prediction may be inferior to bi-directional prediction in many cases, and therefore, such a restriction on the triangle prediction mode may sacrifice potential coding efficiency gain.

[0146] In some examples of the present disclosure, under the triangle prediction mode, both uni-directional and bi-directional predictions are allowed for each of the two triangular partitions or triangular shaped PUs. The triangular shaped PUs may be processed with a memory cost reduction algorithm so as to prepare the triangular shaped PU for bi-directional predictions. In order to still limit the memory bandwidth requirement for motion compensation under the triangle prediction mode, a short interpolation filter, such as 2-tap or 4-tap filters, may be used for sub-pixel interpolation under bi-directional prediction. When a short tap filter is used for sub-pixel interpolation, the number of pixels fetched during motion compensation is much less than that in the case where a long interpolation filter is used.

[0147] In an example of the present disclosure, under the triangle prediction mode, both uni directional and bi-directional predictions are allowed for each of the two partitions. To still limit the memory bandwidth requirement for motion compensation under the triangle prediction mode, only integer-pixel prediction is allowed under the bi-directional prediction mode for each of the two triangular partitions. The term“integer-pixel prediction” refers to that the motion vectors for prediction are each rounded to a respective integer-pixel location, or a position having coordination of integer values. Since the integer-pixel prediction does not require interpolation operation, the number of pixels fetched during motion compensation is much less than that in the case where sub-pixel interpolation is needed. Merge list construction for triangle prediction mode

[0148] The merge list for the triangle prediction mode (or the triangle prediction merge list) may also be constructed differently when bi-directional prediction is allowed for the triangle prediction mode.

[0149] In an example of the present disclosure, the triangle prediction merge list may be simply formed in the same manner as the merge list under the regular merge mode. When a bi prediction sub-pixel motion vector candidate in the list is used for triangle prediction, a short- tap interpolation filter or a short interpolation filter may be used.

[0150] In another example of the present disclosure, the triangle prediction merge list may be simply formed in the same manner as the merge list under the regular merge mode. When a bi prediction sub-pixel motion vector candidate in the list is used for triangle prediction, the motion vector is rounded to its closest integer-pixel location before used.

[0151] In yet another example of the present disclosure, a preliminary merge list may be first formed based on the same merge list construction process for the regular merge mode. Then, motion vectors in the preliminary merge list may be prioritized based on certain rules to form a final merge list for the triangle prediction mode.

[0152] In one example of such rules, uni -prediction motion vectors and/or integer-pixel bi prediction motion vectors in the preliminary merge list may be selected first into the final merge list, followed by sub-pixel bi-prediction motion vectors. When a bi-prediction sub-pixel motion vector candidate in the list is used for triangle prediction, a short-tap interpolation filter may be used.

[0153] In another example of such rules, integer-pixel bi-prediction motion vectors and/or uni prediction motion vectors in the preliminary merge list may be selected first into the final triangle merge list, followed by sub-pixel bi-prediction motion vectors that are rounded to the respective closest integer-pixel locations.

[0154] The merge list may also be constructed differently when only integer motion vectors (MVs) are allowed for triangle prediction mode. [0155] In an example of the present disclosure, to construct a merge candidate list for triangle prediction mode, a first merge list is firstly constructed based on the merge list construction process for regular merge prediction. Then, a uni-directional prediction merge list for the triangle prediction mode is further constructed using the motion vectors in the first merge list. In one example, the selected uni-directional motion vector is rounded to its closest integer- pixel location before being inserted into the final triangle merge list.

[0156] In another example, integer-pixel motion vectors in the preliminary merge list may be selected first into the final triangle merge list, followed by sub-pixel motion vectors that are rounded to the respective closest integer-pixel locations.

[0157] A motion vector pruning process may be performed to make sure that the new motion vector to be added is different from those motion vectors already in the uni-directional prediction merge list. Such motion vector pruning process may also be performed in a partial manner for lower complexity, e.g., checking the new motion vector to be added only against some but not all motion vectors already in the uni-directional prediction merge list. In an extreme case, no pruning operation is performed. Such motion vector pruning process may also be performed on the rounded MVs.

[0158] FIG. 14 is a block diagram illustrating an apparatus for video coding in accordance with some implementations of the present disclosure. The apparatus 1400 may be a terminal, such as a mobile phone, a tablet computer, a digital broadcast terminal, a tablet device, or a personal digital assistant.

[0159] As shown in FIG. 14, the apparatus 1400 may include one or more of the following components: a processing component 1402, a memory 1404, a power supply component 1406, a multimedia component 1408, an audio component 1410, an input/output (I/O) interface 1412, a sensor component 1414, and a communication component 1416.

[0160] The processing component 1402 usually controls overall operations of the apparatus 1400, such as operations relating to display, a telephone call, data communication, a camera operation and a recording operation. The processing component 1402 may include one or more processors 1420 for executing instructions to complete all or a part of steps of the above method. Further, the processing component 1402 may include one or more modules to facilitate interaction between the processing component 1402 and other components. For example, the processing component 1402 may include a multimedia module to facilitate the interaction between the multimedia component 1408 and the processing component 1402.

[0161] The memory 1404 is configured to store different types of data to support operations of the apparatus 1400. Examples of such data include instructions, contact data, phonebook data, messages, pictures, videos, and so on for any application or method that operates on the apparatus 1400. The memory 1404 may be implemented by any type of volatile or non-volatile storage devices or a combination thereof, and the memory 1404 may be a Static Random Access Memory (SRAM), an Electrically Erasable Programmable Read-Only Memory (EEPROM), an Erasable Programmable Read-Only Memory (EPROM), a Programmable Read-Only Memory (PROM), a Read-Only Memory (ROM), a magnetic memory, a flash memory, a magnetic disk or a compact disk.

[0162] The power supply component 1406 supplies power for different components of the apparatus 1400. The power supply component 1406 may include a power supply management system, one or more power supplies, and other components associated with generating, managing and distributing power for the apparatus 1400.

[0163] The multimedia component 1408 includes a screen providing an output interface between the apparatus 1400 and a user. In some examples, the screen may include a Liquid Crystal Display (LCD) and a Touch Panel (TP). If the screen includes a touch panel, the screen may be implemented as a touch screen receiving an input signal from a user. The touch panel may include one or more touch sensors for sensing a touch, a slide and a gesture on the touch panel. The touch sensor may not only sense a boundary of a touching or sliding actions, but also detect duration and pressure related to the touching or sliding operation. In some examples, the multimedia component 1408 may include a front camera and/or a rear camera. When the apparatus 1400 is in an operation mode, such as a shooting mode or a video mode, the front camera and/or the rear camera may receive external multimedia data. [0164] The audio component 1410 is configured to output and/or input an audio signal. For example, the audio component 1410 includes a microphone (MIC). When the apparatus 1400 is in an operating mode, such as a call mode, a recording mode and a voice recognition mode, the microphone is configured to receive an external audio signal. The received audio signal may be further stored in the memory 1404 or sent via the communication component 1416. In some examples, the audio component 1410 further includes a speaker for outputting an audio signal.

[0165] The I/O interface 1412 provides an interface between the processing component 1402 and a peripheral interface module. The above peripheral interface module may be a keyboard, a click wheel, a button, or the like. These buttons may include but not limited to, a home button, a volume button, a start button and a lock button.

[0166] The sensor component 1414 includes one or more sensors for providing a state assessment in different aspects for the apparatus 1400. For example, the sensor component 1414 may detect an on/off state of the apparatus 1400 and relative locations of components. For example, the components are a display and a keypad of the apparatus 1400. The sensor component 1414 may also detect a position change of the apparatus 1400 or a component of the apparatus 1400, presence or absence of a contact of a user on the apparatus 1400, an orientation or acceleration/deceleration of the apparatus 1400, and a temperature change of apparatus 1400. The sensor component 1414 may include a proximity sensor configured to detect presence of a nearby object without any physical touch. The sensor component 1414 may further include an optical sensor, such as a CMOS or CCD image sensor used in an imaging application. In some examples, the sensor component 1414 may further include an acceleration sensor, a gyroscope sensor, a magnetic sensor, a pressure sensor, or a temperature sensor.

[0167] The communication component 1416 is configured to facilitate wired or wireless communication between the apparatus 1400 and other devices. The apparatus 1400 may access a wireless network based on a communication standard, such as WiFi, 4G, or a combination thereof. In an example, the communication component 1416 receives a broadcast signal or broadcast related information from an external broadcast management system via a broadcast channel. In an example, the communication component 1416 may further include a Near Field Communication (NFC) module for promoting short-range communication. For example, the NFC module may be implemented based on Radio Frequency Identification (RFID) technology, infrared data association (IrDA) technology, Ultra-Wide Band (UWB) technology, Bluetooth (BT) technology and other technology.

[0168] In an example, the apparatus 1400 may be implemented by one or more of Application Specific Integrated Circuits (ASIC), Digital Signal Processors (DSP), Digital Signal Processing Devices (DSPD), Programmable Logic Devices (PLD), Field Programmable Gate Arrays (FPGA), controllers, microcontrollers, microprocessors or other electronic elements to perform the above method.

[0169] A non-transitory computer readable storage medium may be, for example, a Hard Disk Drive (HDD), a Solid-State Drive (SSD), Flash memory, a Hybrid Drive or Solid-State Hybrid Drive (SSHD), a Read-Only Memory (ROM), a Compact Disc Read-Only Memory (CD- ROM), a magnetic tape, a floppy disk and etc.

[0170] FIG. 15 is a flowchart illustrating an exemplary process of video coding for motion compensated prediction using triangular prediction unit in accordance with some implementations of the present disclosure.

[0171] In step 1502, the processor 1420 partitions video pictures into a plurality of coding units (CUs), at least one of which is further partitioned into two prediction units (PUs) including at least one triangular shaped PU.

[0172] In step 1504, the processor 1420 constructs a first merge list including a plurality of candidates, each being a motion vector, based on a merge list construction process for regular merge prediction.

[0173] In step 1506, the processor 1420 constructs a uni-directional prediction merge list for the triangular shaped PU using at least a subset of the candidates in the first merge list.

[0174] The step of constructing the uni-directional prediction merge list may include: checking and selecting prediction list 0 motion vectors of the candidates in the first merge list into the uni-directional prediction merge list; checking and selecting prediction list 1 motion vectors of the candidates in the first merge list into the uni-directional prediction merge list, upon determining that the uni-directional prediction merge list is not full; adding prediction list 0 zero vectors into the uni-directional prediction merge list, upon determining that the uni directional prediction merge list is still not full; and adding prediction list 1 zero vectors are added into the uni-directional prediction merge list, upon determining that the uni-directional prediction merge list still not full.

[0175] FIG. 16 is a flowchart illustrating an exemplary process of video coding for motion compensated prediction using triangular prediction unit in accordance with some implementations of the present disclosure.

[0176] In step 1602, the processor 1420 partitions video pictures into a plurality of coding units (CUs), at least one of which is further partitioned into two prediction units (PUs) including at least one triangular shaped PU.

[0177] In step 1604, the processor 1420 processes the triangular shaped PU with a memory cost reduction algorithm so as to prepare the triangular shaped PU for bi-directional predictions.

[0178] The memory cost reduction algorithm may include at least one select from a group consisting of: applying a short interpolation filter for sub-pixel interpolation under bi directional prediction; and rounding motion vectors associated with the triangular shaped PU to integer-pixel locations.

[0179] In some examples, there is provided an apparatus for video coding. The apparatus includes a processor 1420; and a memory 1404 configured to store instructions executable by the processor; where the processor, upon execution of the instructions, is configured to perform a method as illustrated in FIG. 15, or a method as illustrated in FIG. 16.

[0180] In some other examples, there is provided a non-transitory computer readable storage medium 1404, having instructions stored therein. When the instructions are executed by a processor 1420, the instructions cause the processor to perform a method as illustrated in FIG. 15, or a method as illustrated in FIG. 16. [0181] The description of the present disclosure has been presented for purposes of illustration, and is not intended to be exhaustive or limited to the present disclosure. Many modifications, variations, and alternative implementations will be apparent to those of ordinary skill in the art having the benefit of the teachings presented in the foregoing descriptions and the associated drawings.

[0182] The examples were chosen and described in order to explain the principles of the disclosure, and to enable others skilled in the art to understand the disclosure for various implementations and to best utilize the underlying principles and various implementations with various modifications as are suited to the particular use contemplated. Therefore, it is to be understood that the scope of the disclosure is not to be limited to the specific examples of the implementations disclosed and that modifications and other implementations are intended to be included within the scope of the present disclosure.

Claims

WHAT IS CLAIMED IS:

1. A method for video coding, comprising:

partitioning video pictures into a plurality of coding units (CUs), at least one of which is further partitioned into two prediction units (PUs) including at least one triangular shaped PU;

constructing a first merge list comprising a plurality of candidates, each being a motion vector, based on a merge list construction process for regular merge prediction; and constructing a uni-directional prediction merge list for the triangular shaped PU using at least a subset of the candidates in the first merge list.

2. The method of claim 1, wherein the first merge list constructed has a list size different from that for a general merge mode.

3. The method of claim 1, wherein constructing the uni-directional prediction merge list comprises:

checking and selecting prediction list 0 motion vectors of the candidates in the first merge list into the uni-directional prediction merge list;

checking and selecting prediction list 1 motion vectors of the candidates in the first merge list into the uni-directional prediction merge list, upon determining that the uni directional prediction merge list is not full;

adding prediction list 0 zero vectors into the uni-directional prediction merge list, upon determining that the uni-directional prediction merge list is still not full; and

adding prediction list 1 zero vectors are added into the uni-directional prediction merge list, upon determining that the uni-directional prediction merge list still not full.

4. The method of claim 1, wherein constructing the uni-directional prediction merge list comprises: determining whether a candidate in the first merge list is a uni-directional prediction motion vector; and

adding the candidate into the uni-directional prediction merge list upon determining that it is a uni-directional prediction motion vector.

5. The method of claim 4, wherein constructing the uni-directional prediction merge list further comprises:

upon determining that the candidate is a bi-directional prediction motion vector, adding prediction list 0 motion vector of the candidate and prediction list 1 motion vector of the candidate into the uni-directional prediction merge list, in an interleaving manner.

6. The method of claim 1, wherein constructing the uni-directional prediction merge list comprises:

determining whether a current picture uses backward prediction; and

constructing the uni-directional prediction merge list in an adaptive manner based on whether the current picture uses backward prediction.

7. The method of claim 6, wherein constructing the uni-directional prediction merge list in an adaptive manner comprises:

upon determining that the current picture uses backward prediction:

determining whether a candidate in the first merge list is a uni-directional prediction motion vector;

adding the candidate into the uni-directional prediction merge list upon determining that it is a uni-directional prediction motion vector; and

upon determining that the candidate is a bi-directional prediction motion vector, adding prediction list 0 motion vector of the candidate and prediction list 1 motion vector of the candidate into the uni-directional prediction merge list, in an interleaving manner; and upon determining that the current picture does not use backward prediction: checking and selecting prediction list 0 motion vectors of the candidates in the first merge list into the uni-directional prediction merge list;

checking and selecting prediction list 1 motion vectors of the candidates in the first merge list into the uni-directional prediction merge list, upon determining that the uni directional prediction merge list is not full; and

adding uni-prediction zero vectors into the uni-directional prediction merge list, upon determining that the uni-directional prediction merge list is still not full.

8. A method for video coding, comprising:

partitioning video pictures into a plurality of coding units (CUs), at least one of which is further partitioned into two prediction units (PUs) including at least one triangular shaped PU; and

processing the triangular shaped PU with a memory cost reduction algorithm so as to prepare the triangular shaped PU for bi-directional predictions.

9. The method of claim 8, further comprising: enabling bi-directional predictions for the triangular shaped PU.

10. The method of claim 8, wherein the memory cost reduction algorithm comprises at least one select from a group consisting of:

applying a short interpolation filter for sub-pixel interpolation under bi-directional prediction; and

rounding motion vectors associated with the triangular shaped PU to integer-pixel locations.

11. An apparatus for video coding, comprising:

a processor; and

a memory configured to store instructions executable by the processor; wherein the processor, upon execution of the instructions, is configured to:

partition video pictures into a plurality of coding units (CUs), at least one of which is further partitioned into two prediction units (PUs) including at least one triangular shaped PU;

construct a first merge list comprising a plurality of candidates, each being a motion vector, based on a merge list construction process for regular merge prediction; and

construct a uni-directional prediction merge list for the triangular shaped PU using at least a subset of the candidates in the first merge list.

12. The apparatus of claim 11, wherein the first merge list constructed has a list size different from that for a general merge mode.

13. The apparatus of claim 11, wherein the processor is further configured to:

check and select prediction list 0 motion vectors of the candidates in the first merge list into the uni-directional prediction merge list;

check and select prediction list 1 motion vectors of the candidates in the first merge list into the uni-directional prediction merge list, upon determining that the uni-directional prediction merge list is not full;

add prediction list 0 zero vectors into the uni-directional prediction merge list, upon determining that the uni-directional prediction merge list is still not full; and

add prediction list 1 zero vectors are added into the uni-directional prediction merge list, upon determining that the uni-directional prediction merge list still not full.

14. The apparatus of claim 11, wherein the processor is further configured to:

determine whether a candidate in the first merge list is a uni-directional prediction motion vector; and

add the candidate into the uni-directional prediction merge list upon determining that it is a uni-directional prediction motion vector.

15. The apparatus of claim 14, wherein the processor is further configured to:

16. The apparatus of claim 11, wherein the processor is further configured to:

determine whether a current picture uses backward prediction; and

construct the uni-directional prediction merge list in an adaptive manner based on whether the current picture uses backward prediction.

17. The apparatus of claim 16, wherein the processor is further configured to:

upon determining that the current picture uses backward prediction:

determine whether a candidate in the first merge list is a uni-directional prediction motion vector;

add the motion vector into the uni-directional prediction merge list upon determining that it is a uni-directional prediction motion vector; and

upon determining that the candidate is a bi-directional prediction motion vector, add prediction list 0 motion vector of the candidate and prediction list 1 motion vector of the candidate into the uni-directional prediction merge list, in an interleaving manner; and upon determining that the current picture does not use backward prediction:

check and select prediction list 1 motion vectors of the candidates in the first merge list into the uni-directional prediction merge list, upon determining that the uni-directional prediction merge list is not full; and

add uni-prediction zero vectors into the uni-directional prediction merge list, upon determining that the uni-directional prediction merge list is still not full.

18. An apparatus for video coding, comprising:

a processor; and

a memory configured to store instructions executable by the processor;

wherein the processor, upon execution of the instructions, is configured to:

partition video pictures into a plurality of coding units (CUs), at least one of which is further partitioned into two prediction units (PUs) including at least one triangular shaped PU; and

process the triangular shaped PU with a memory cost reduction algorithm so as to prepare the triangular shaped PU for bi-directional predictions.

19. The apparatus of claim 18, wherein the processor is further configured to: enable bi-directional predictions for the triangular shaped PU.

20. The apparatus of claim 18, wherein the memory cost reduction algorithm comprises at least one select from a group consisting of: