Encoding / decoding video picture data
Patent Information
- Application Number
- PCT/CN2024/077149
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2024-01-10
- Filing Date
- 2024-02-09
- Publication Date
- 2026-08-27
Smart Images

Figure CN2024077149_27082026_PF_FP_ABST
Abstract
Description
ENCODING / DECODING VIDEO PICTURE DATAFIELD
[0001] The present application generally relates to video picture encoding and decoding. Particularly, but not exclusively, the technical field of the present application is related to intra coding modes used for coding a current block of a video picture.BACKGROUND
[0002] The present section is intended to introduce the reader to various aspects of art, which may be related to various aspects of at least one exemplary embodiment of the present application that is described and / or claimed below. This discussion is believed to be helpful in providing the reader with background information to facilitate a better understanding of the various aspects of the present application. Accordingly, it should be understood that these statements are to be read in this light, and not as admissions of prior art.
[0003] Current video compression standards or recommendations derive intra coding modes for a current block to be coded based on a Rate-distortion optimization of residual calculated between the current block and a prediction block derived based on already coded blocks in a causal neighborhood of the current block.
[0004] One of the problem is to improve the performance of the prediction of the current block of the current video compression standards and recommendations.SUMMARY
[0005] The following section presents a simplified summary of the at least one exemplary embodiment in order to provide a basic understanding of some aspects of the present application. This summary is not an extensive overview of an exemplary embodiment. It is not intended to identify key or critical elements of an exemplary embodiment. The following summary merely presents some aspects of the at least one exemplary embodiment in a simplified form as a prelude to the more detailed description provided elsewhere in the document.
[0006] According to a first aspect of the present application, there is provided a method of coding a current block of a video picture based on an intra coding mode selected among intra coding modes, comprising:
[0007] - determining an occurrence list of intra coding modes, the occurrence list comprising at least one element, each element comprising an identifier indicating an intra coding mode and comprising an occurrence weight representing use frequency of said intra coding mode for coding at least one block in a causal neighborhood of the current block; and
[0008] - selecting the intra coding mode for coding the current block based on the occurrence weights.
[0009] In some embodiments, the occurrence weight associated with an identifier of an element of the occurrence list is computed as an accumulation of at least one individual occurrence weight, each individual occurrence weight being associated with a block in the causal neighborhood that is coded based on the intra coding mode identified by said identifier.
[0010] In some embodiments, the individual occurrence weight of at least one element of the occurrence list equals to a fixed value.
[0011] In some embodiments, the individual occurrence weight of an element of the occurrence list is determined based on characteristics of a block in the causal neighborhood that is intra coded based on the intra coding mode identified by the identifier of the element.
[0012] In some embodiments, occurrence weight of an element of the occurrence list is modified regardless of the use frequency of the intra coding mode identified by the identifier of the element for coding blocks in the causal neighborhood.
[0013] In some embodiment, a new element comprising an identifier indicating a particular intra coding mode and a pre-determined occurrence weight is forcefully added in the occurrence list if the element does not already exist even though none of the eligible neighboring block is coded based on the particular intra coding mode.
[0014] In some embodiments, an element of the occurrence list comprising an identifier indicating a particular intra coding mode and a pre-determined occurrence weight may be forcefully removed from the occurrence list even though at least one eligible neighboring block is coded based on the particular intra coding mode.
[0015] In some embodiments, the occurrence weight of an element of the occurrence list is increased or decreased based on a pre-determined value.
[0016] In some embodiments, the occurrence weight of an element of the occurrence list is increased based on the occurrence weights associated with a preceding and / or succeeding element of the occurrence list, by filtering the occurrence list thanks to the ordinality of the identifiers.
[0017] In some embodiments, the occurrence list is sorted based on the occurrence weights associated with its elements.
[0018] In some embodiments, the occurrence weight of an element of the occurrence list depend on a template-based coding cost associated with a template-based intra coding mode used for coding at least one block in the causal neighborhood.
[0019] In some embodiments, an occurrence weight comprised in a current element of the sorted occurrence list is increased based on the occurrence weights associated with a preceding and / or succeeding element of the sorted occurrence list.
[0020] In some embodiments, selecting the intra coding mode of the current block based on the occurrence weights comprises selecting at least one intra coding mode identified by the identifier of at least one element of the occurrence list.
[0021] In some embodiments, the intra prediction mode of the current block is the element of the occurrence list having the most important occurrence weight or at least two elements of the occurrence list having the more important occurrence weights are selected and the intra prediction mode of the current block is obtained by fusing the intra coding modes indicated by the identifiers comprised in the at least two elements.
[0022] In some embodiments, fusing the intra coding modes indicated by the identifiers comprised in the at least two elements, depends on characteristics of the eligible neighboring blocks coded by the intra coding modes indicated by the identifiers comprised in the at least two elements or comprises calculating a weighted average of the intra coding modes indicated by the identifiers comprised in the at least two elements.
[0023] In some embodiments, the weights of the weighted average are determined based on template around the current block.
[0024] In some embodiments, fusing the intra coding modes indicated by the identifiers comprised in the at least two elements is based on a linear model whose parameters are learned on a template around the current block.
[0025] In some embodiments, the current block being a current chroma block, the intra coding mode for the current chroma block is selected in an occurrence list of intra coding modes used for coding luma blocks in a cross causal neighborhood of the current chroma block.
[0026] In some embodiments, each element of the occurrence list comprises an identifier indicating an intra coding mode to be signaled in a bitstream for the current block, and an occurrence weight representing use frequency of said intra coding mode for coding at least one block in a causal neighborhood of the current block.
[0027] In some embodiments, each element of the occurrence list comprises an identifier indicating an intra coding mode candidate for coding the current block, and an occurrence weight representing use frequency of said intra coding mode for coding at least one block in a causal neighborhood of the current block.
[0028] According to a second aspect of the present application, there is provided an apparatus comprising means for performing one of the methods according to the first aspect of the present disclosure.
[0029] According to a third aspect of the present application, there is provided a computer program product including instructions which, when the program is executed by one or more processors, causes the one or more processors to carry out a method according to the first aspect of the present application.
[0030] According to a fourth aspect of the present application, there is provided a non-transitory storage medium carrying instructions of program code for executing a method according to the first aspect of the present application.
[0031] The specific nature of at least one of the exemplary embodiments as well as other objects, advantages, features and uses of said at least one of exemplary embodiments will become evident from the following description of examples taken in conjunction with the accompanying drawings.BRIEF DESCRIPTION OF THE DRAWINGS
[0032] Reference will now be made, by way of example, to the accompanying drawings which show exemplary embodiments of the present application, and in which:
[0033] Figure 1 shows an example of coding-tree unit in accordance with HEVC;
[0034] Figure 2 shows an example of partitioning coding units into prediction units in accordance with HEVC;
[0035] Figure 3 shows an example of a CTU division in accordance with VVC;
[0036] Figure 4 shows examples of split modes supported in the multi-type tree partitioning in accordance with VVC;
[0037] Figure 5 shows a schematic block diagram of a method 100 of encoding a video picture VP in accordance with prior art;
[0038] Figure 6 shows a schematic block diagram of a method 200 of decoding a video picture VP in accordance with prior art;
[0039] Figure 7 shows a schematic block diagram of steps of a method 100 of selecting an intra coding mode for coding a current block according to some embodiments of the present disclosure;
[0040] Figure 8 shows an example of casual neighborhood according to some embodiments of the present disclosure;
[0041] Figure 9 shows an example of the occurrence list according to some embodiments of the present disclosure.
[0042] Figure 10 shows an example of deriving at least one pair of identifier and individual occurrence weight for each eligible neighboring block according to some embodiments of the present disclosure;
[0043] Figure 11 shows an example of occurrence list filtered by a five-tap 1-Dimension filter according to some embodiments of the present disclosure;
[0044] Figure 12 shows an example of chroma DM coding mode according to prior art;
[0045] Figure 13 shows an example of selecting an intra prediction mode for a current chroma block in a chroma occurrence list of chroma intra coding modes according to some embodiments of the present disclosure;
[0046] Figure 14 shows an example of BV occurrence list according to some embodiments of the present disclosure.
[0047] Figure 15 shows an example of adaptive signaling order of flags and parameters of intra coding modes of a current block according to embodiments of the present disclosure.
[0048] Figure 16 shows an example of reordering the MPM list based on the occurrence list according to some embodiments of the present disclosure.
[0049] Figure 17 shows an example to signal the usage of occurrence list at the encoder or decoder side as discussed above according to some embodiments of the present disclosure.
[0050] Figure 18 shows a block diagram of an example of a system in which various aspects and exemplary embodiments are implemented.
[0051] Similar or same elements are referenced with the same reference numbers.
[0052] DESCRIPTION OF EXEMPLARY EMBODIMENTS
[0053] At least one of the exemplary embodiments is described more fully hereinafter with reference to the accompanying figures, in which examples of at least one of the exemplary embodiments are depicted. An exemplary embodiment may, however, be embodied in many alternate forms and should not be construed as limited to the examples set forth herein. Accordingly, it should be understood that there is no intent to limit exemplary embodiments to the particular forms disclosed. On the contrary, the present application is intended to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the present application.
[0054] At least one of the aspects generally relates to video picture encoding and decoding, one other aspect generally relates to transmitting a bitstream provided or encoded and one other aspect relates to receiving / accessing a decoded bitstream.
[0055] At least one of the exemplary embodiments is described for encoding / decoding a video picture but extends to the encoding / decoding of video pictures (sequences of pictures) because each video picture is sequentially encoded / decoded as described below.
[0056] Moreover, the at least one exemplary embodiments are not limited to MPEG standards such as AVC (ISO / IEC 14496-10 Advanced Video Coding for generic audio-visual services, ITU-T Recommendation H. 264, https: / / www. itu. int / rec / T-REC-H. 264-202108-P / en) , EVC (ISO / IEC 23094-1 Essential video coding) , HEVC (ISO / IEC 23008-2 High Efficiency Video Coding, ITU-T Recommendation H. 265, https: / / www. itu. int / rec / T-REC-H. 265-202108-P / en) , VVC (ISO / IEC 23090-3 Versatile Video Coding, ITU-T Recommendation H. 266, https: / / www. itu. int / rec / T-REC-H. 266-202008-I / en) , ECM (Algorithm description of Enhanced Compression Model 10 (ECM 10) , JVET-AE2025, Geneva, 11-19 July 2023) but may be applied to other standards and recommendations such as AV1 (AOMedia Video 1, http: / / aomedia. org / av1 / specification / ) for example. The at least one exemplary embodiment may apply to pre-existing or future-developed, and extensions of any such standards and recommendations. Unless indicated otherwise, or technically precluded, the aspects described in the present application may be used individually or in combination.
[0057] A pixel corresponds to the smallest display unit on a screen, which can be composed of one or more sources of light (1 for monochrome screen or 3 or more for colour screens) .
[0058] A video picture, also denoted frame or picture frame, comprises at least one component (also called picture component, or channel) determined by a specific picture / video format which specifies all information relative to pixel values and all information which may be used by a display unit and / or any other device to display and / or to decode video picture data related to said video picture.
[0059] A video picture comprises at least one component usually expressed in the shape of an array of samples.
[0060] A monochrome video picture comprises a single component and a color video picture may comprise three components.
[0061] For example, a color video picture may comprise a luma (or luminance) component and two chroma components when the picture / video format is the well-known (Y, Cb, Cr) format or may comprise three color components (one for Red, one for Green and one for Blue) when the picture / video format is the well-known (R, G, B) format.
[0062] Each component of a video picture may comprise a number of samples relative to a number of pixels of a screen on which the video picture is intended to be display. In variants, the number of samples comprised in a component may be a multiple (or fraction) of a number of samples comprised in another component of a same video picture.
[0063] For example, in the case of a video format comprising a luma component and two chroma component like the (Y, Cb, Cr) format, dependent on the color format considered, the chroma component may contain half the number of samples in width and / or height, relative to the luma component.
[0064] A sample is the smallest visual information unit of a component composing a video picture. A sample value may be, for example a luma or chroma value or a colour value of a (R, G, B) format.
[0065] A pixel value is the value of a pixel of a screen. A pixel value may be represented by one sample for monochrome video picture and by multiple co-located samples for color video picture. Co-located samples associated with a pixel mean samples corresponding to the location of a pixel in the screen.
[0066] It is common to consider a video picture as being a set of pixel values, each pixel being represented by at least one sample.
[0067] A block of a video picture is a set of samples of one component of the video picture. A block of at least one luma sample or a block of at least one chroma sample may be considered when the picture / video format is the well-known (Y, Cb, Cr) format, or a block of at least one color sample when the picture / video format is the well-known (R, G, B) format.
[0068] The at least one exemplary embodiment is not limited to a particular picture / video format.
[0069] In the state-of-the-art video compression systems such as HEVC or VVC low-level and high-level picture partitioning are provided to divide a video picture into picture areas so-called Coding-Tree Units (CTU) which size may be typically between 16x16 and 64x64 pixels for HEVC and 32x32, 64x64, or 128x128 pixels for VVC.
[0070] The CTU division of a video picture forms a grid of fixed size CTUs, namely a CTU grid, which upper and left bounds spatially coincide with the top and left borders of the video picture. The CTU grid represents a spatial partition of the video picture.
[0071] In VVC and HEVC, the CTU size (CTU width and CTU height) of all the CTUs of a CTU grid equals a same default CTU size (default CTU width CTU DW and default CTU height CTU DH) . For example, the default CTU size (default CTU height, default CTU width) may equal to 128 (CTU DW=CTU DH=128) . A default CTU size (height, width) is encoded into the bitstream, for example at a sequence level in the Sequence Parameter Set (SPS) .
[0072] The spatial position of a CTU in a CTU grid is determined from a CTU address ctuAddr defining a spatial position of the top-left corner of a CTU from an origin. As illustrated on Figure 1, the CTU address may define the spatial position from the top-left corner of a higher-level spatial structure S containing the CTU.
[0073] A coding tree is associated with each CTU to determine a tree-division of the CTU.
[0074] As illustrated on Figure 1, in HEVC, the coding tree is a quad-tree division of a CTU, where each node is called a Coding Unit (CU) . The spatial position of a CU in the video picture is defined by a CU index cuIdx indicating a spatial position from the top-left corner of the CTU. A CU is spatially partitioned into one or more Prediction Units (PU) . The spatial position of a PU in the video picture VP is defined by a PU index puIdx defining a spatial position from the top-left corner of the CTU and the spatial position of an element of a partitioned PU is defined by a PU partition index puPartIdx defining a spatial position from the top-left corner of a PU. Each PU is assigned some intra or inter prediction data.
[0075] The coding mode intra or inter is assigned on the CU level. That means that a same intra / inter coding mode is assigned to each PU of a CU, though the prediction parameters varying from PU to PU.
[0076] A CU may be also spatially partitioned into one or more Transform Units (TU) , according to a quad-tree called the transform tree. Transform Units are the leaves of the transform tree. The spatial position of a TU in the video picture is defined by a TU index tuIdx defining a spatial position from the top-left corner of a CU. Each TU is assigned some transform parameters. The transform type is assigned on the TU level, and 2D separate transform is performed at TU level during the coding or decoding of a picture block.
[0077] The PU Partition types existing in HEVC are illustrated on Figure 2. They include square partitions (2Nx2N and NxN) , which are the only ones used in both Intra and Inter predicted CUs, symmetric non-square partitions (2NxN, Nx2N, used only in Inter predicted CUs) , and asymmetric Partitions (used only in Inter predicted CUs) . For instance, the PU type 2NxnU stands for an asymmetric horizontal partitioning of the PU, where the smaller partition lies on the top of the PU. According to another example, PU type 2NxnL stands for an asymmetric horizontal partitioning of the PU, where the smaller partition lies on the top of the PU.
[0078] As illustrated on Figure 3, in VVC, the coding tree starts from a root node, i.e., the CTU. Next, a quad-tree (or quaternary tree) split divides the root node into 4 nodes corresponding to 4 sub-blocks of equal sizes (solid lines) . Next, the quaternary tree (or quad-tree) leaves can then be further partitioned by a so-called multi-type tree, which involves a binary or ternary split according to one of 4 split modes illustrated on Figure 4. These split types are the vertical and horizontal binary split modes, noted SBTV and SBTH and the vertical and horizontal ternary split modes SPTTV and STTH.
[0079] The leaves of the coding tree of a CTU are CU in the case of a joint coding tree shared by luma and chroma components.
[0080] Contrary to HEVC, in VVC, in most cases, CU, PU and TU have equal size, which means coding units are generally not partitioned into PU or TU, except in some specific coding modes.
[0081] Figures 5 and 6 provide an overview of video encoding / decoding methods used in current video standard compression systems like HEVC or VVC for example.
[0082] Figure 5 shows a schematic block diagram of steps of a method 100 of encoding a video picture VP in accordance with prior art.
[0083] In step 110, a video picture VP is partitioned into blocks of samples and partitioning information data is signaled into a bitstream. Each block comprises samples of one component of the video picture VP. The blocks thus comprise samples of each component defining the video picture VP.
[0084] For example, in HEVC, a picture is divided into Coding Tree Units (CTU) . Each CTU may be further subdivided using a quad-tree division, where each leaf of the quad-tree is denoted a Coding Unit (CU) . The partitioning information data may then comprise data describing the CTU and the quad-tree subdivision of each CTU.
[0085] Each block of samples, in short block, may then be either a CU (if the CU comprises a single PU) or a PU of a CU.
[0086] Each block is encoded along an encoding loop also called “in loop” using either an intra or inter prediction mode.
[0087] Intra prediction (step 120) used intra prediction data. Intra prediction consists in predicting a current block by means of an intra-predicted block based on already encoded, decoded and reconstructed samples located around the current block, typically on the top and on the left of the current block. Intra prediction is performed in the spatial domain.
[0088] In inter-prediction mode, motion estimation (step 130) and motion compensation (135) are performed. Motion estimation searches, in one or more reference video picture (s) used to predictively encode the current video picture, a candidate reference block that is a good predictor of the current block. For instance, a good predictor of the current block is a predictor which is similar to the current block. The output of the motion estimation step 130 is inter-prediction data comprising motion information (typically one or more motion vectors and one or more reference video picture indices) associated to the current block and other information used for obtaining a same predicted block at the encoding / decoding side. Next, motion compensation (step 135) obtains a predicted block by means of the motion vector (s) and reference video picture index (indices) determined by the motion estimation step 130. Basically, the block belonging to a selected reference video picture and pointed to by a motion vector may be used as the predicted block of the current block. Furthermore, since motion vectors are expressed in fractions of integer pixel positions (which is known as sub-pel accuracy motion vector representation) , motion compensation generally involves a spatial interpolation of some reconstructed samples of the reference video picture to compute the predicted block.
[0089] Prediction information data is signaled into the bitstream. The prediction information may comprise prediction mode (intra or inter or skip) , intra / inter prediction data and any other information used for obtaining a same predicted CU at the decoding side.
[0090] The method 100 selects one prediction mode (the intra or inter prediction mode) by optimizing a rate-distortion trade-off taking into account the encoding of a prediction residual block calculated, for example, by subtracting a candidate predicted block from the current block, and the signaling of prediction information data required for determining said candidate predicted block at the decoding side.
[0091] Usually, the intra and inter prediction modes are set in a list of Most Probable candidate Modes (MPM list) and the best prediction mode is given as being the prediction mode p*for a current block given by: p*=Argminp∈P {RDcost (p) } (1)
[0092] where P is the MPM list for the current block, p represents a candidate coding mode in that MPM list, RDcost (p) is a rate-distortion cost of candidate prediction mode p, typically expressed as: RDcost (p) =D (p) +λ·R (p)
[0093] D (p) is the distortion between the current block and a reconstructed block obtained after encoding / decoding the current block based on the candidate prediction mode p, R (p) is a rate cost associated with the coding of the current block based on the prediction mode p, and λ is the Lagrange parameter representing the rate constraint for coding the current block and typically computed from a quantization parameter Qp used for encoding the current block.
[0094] The current block is usually encoded from a prediction residual block PR. More precisely, a prediction residual block PR is calculated, for example, by subtracting the best predicted block from the current block. The prediction residual block PR is then transformed (step 140) by using, for example, a DCT (discrete cosine transform) or DST (Discrete Sinus transform) type transform, or any other appropriate transform, and the obtained transformed coefficient block is quantized (step 150) .
[0095] In variant, the method 100 may also skip the transform step 140 and apply quantization (step 150) directly to the prediction residual block PR, according to the so-called transform-skip coding mode.
[0096] Quantized transform coefficient block (or quantized prediction residual block) is entropy encoded into the bitstream (step 160) .
[0097] Next, the quantized transform coefficient block (or the quantized residual block) is de-quantized (step 170) and inverse transformed (180) (or not) as part of the encoding loop, leading to a decoded prediction residual block. The decoded prediction residual block and the predicted block are then combined, typically summed, which provides the reconstructed block.
[0098] Other information data may also be entropy encoded in step 160 for encoding a current block of the video picture VP.
[0099] In-loop filters (step 190) may be applied to a reconstructed picture (comprising reconstructed blocks) to reduce compression artefacts. Loop filters may apply after all picture blocks are reconstructed. For instance, they consist in deblocking filter, Sample Adaptive Offset (SAO) or adaptive loop filter.
[0100] The reconstructed blocks or the filtered reconstructed blocks form a reference picture that may be stored into a decoded picture buffer (DPB) so that it can be used as a reference picture for the encoding of a next current block of the video picture VP, or of a next vide picture to encode.
[0101] Figure 6 shows a schematic block diagram of steps of a method 200 of decoding a video picture VP in accordance with prior art.
[0102] In step 210, partitioning information data, prediction information data and quantized transform coefficient block (or quantized residual block) are obtained by entropy decoding a bitstream of encoded video picture data. For instance, this bitstream has been generated in accordance with the method 100.
[0103] Other information data may also be entropy decoded for decoding from the bitstream a current block of the video picture VP.
[0104] In step 220, a reconstructed picture is divided into current blocks based on the partitioning information. Each current block is entropy decoded from the bitstream along a decoding loop also called “in loop” . Each decoded current block is either a quantized transform coefficient block or quantized prediction residual block.
[0105] In step 230, the current block is de-quantized and possibly inverse transformed (step 240) , to obtain a decoded prediction residual block.
[0106] On the other hand, the prediction information data is used to predict the current block. A predicted block is obtained through its intra prediction (step 250) or its motion-compensated temporal prediction (step 260) . The prediction process performed at the decoding side is identical to that of the encoding side.
[0107] Next, the decoded prediction residual block and the predicted block are then combined, typically summed, which provides a reconstructed block.
[0108] In step 270, in-loop filters may apply to a reconstructed picture (comprising reconstructed blocks) and the reconstructed blocks, or the filtered reconstructed blocks form a reference picture that may be stored into a decoded picture buffer (DPB) as above discussed (Figure 5) .
[0109] Embodiments of the present disclosure relate to the selection of an intra coding mode for coding a current block of a video picture based on use frequency of intra coding mode used for coding at least one block in a causal neighborhood of the current block.
[0110] The method allows selecting an intra coding mode among the most frequently used intra coding modes used for coding blocks in the causal neighborhood of the current block. Such selection of intra coding mode improves the prediction of a current block and thus the overall coding performance.
[0111] FIG. 7 shows a schematic block diagram of steps of a method 300 of selecting an intra coding mode for coding a current block according to some embodiments of the present disclosure. Coding a current block means encoding the current block (FIG. 5) or decoding the current block (FIG. 6) .
[0112] At block 310, an occurrence list of intra coding modes is determined, each intra coding mode of the occurrence list being associated with an occurrence weight representing use frequency of said intra coding mode for coding at least one block in a causal neighborhood of the current block.
[0113] At block 320, the intra coding mode is selected for coding the current block based on the occurrence weights.
[0114] The intra coding modes may be of different types.
[0115] For example, the intra coding modes may include the 67 IPM (Intra prediction mode) as defined in VVC, i.e. 65 angular modes and two modes for plain content (PLANAR and Direct Coding (DC) ) .
[0116] For example the intra coding modes may also include intra coding tools that may be combined with IPM.
[0117] For example, the intra coding modes may also include template-based intra coding modes, i.e. intra coding mode that derives a prediction block of a current block based on a template around the current block.
[0118] For example, template-based intra coding modes may be Decoder-side Intra Mode Derivation (DIMD) or Template-based Intra Mode Derivation (TIMD) as defined in ECM.
[0119] For example, the intra coding modes may also include other types of intra coding modes such as Spatial Geometric Prediction Mode (SGPM) , Most Probable Mode Coding (MPMC) , Matrix-based Intra Prediction (MIP) , Intra Block Copy (IBC) , Template-based Multiple Reference Line intra coding mode (TMRL) , Intra SubPartition coding mode (ISP) , Intra template-based prediction (Intra TMP) , Palette mode (PLT) and Cross Component Prediction (CCP) as defined in ECM.
[0120] In some embodiments, the causal neighborhood of the current block may be defined by a set of at least one already coded block located around the current block.
[0121] The causal neighborhood of the current block may comprise eligible neighboring blocks and non-eligible neighboring blocks. Eligible neighboring blocks are blocks in the causal neighborhood that are coded based on an intra coding mode and non-eligible neighboring blocks are blocks in the causal neighboring blocks that are not coded based on an intra coding mode. A block in the causal neighborhood may also be eligible only if it is coded based on an eligible intra coding mode, i.e. an intra coding mode that is in a set of intra coding modes that may exclude some usual intra coding modes. For example, the set of intra coding modes may comprise only IPM and exclude all other intra coding modes. For example, the set of intra coding modes may comprise DIMD and TIMD are excluded all the other intra coding modes.
[0122] In some embodiments, at least one boundary of the causal neighborhood may depend on a scanning order, e.g. the raster scanning order of the underlying codec.
[0123] In some embodiments, the causal neighborhood may depend on at least one independent area (e.g. Tile, Slice, Sub-picture etc. ) .
[0124] In some embodiments, the causal neighborhood of the current block may include adjacent neighboring blocks.
[0125] In some embodiments, the causal neighborhood of the current block may include non-adjacent neighboring blocks. An adjacent neighboring block is a block that shares at least one pixel with current block.
[0126] In some embodiments, the causal neighborhood of the current block may include both adjacent and non-adjacent neighboring blocks. A non-adjacent neighboring block shares no pixel with current block.
[0127] FIG. 8 shows an example of casual neighborhood according to some embodiments of the present disclosure.
[0128] In some embodiments, the occurrence list may comprise at least one element, each element comprising an identifier id indicating a particular intra coding mode and an occurrence weight cwid representing a use frequency of said particular intra coding mode for coding at least one eligible neighboring block.
[0129] For example, the identifier id may be an index of IPM, e.g. between 0 and 66 in VVC.
[0130] For example, the identifier id may indicate DIMD, TIMD or MIP.
[0131] Basically, once the eligible neighboring blocks are identified in the causal neighborhood of the current block, the occurrence list may be initialized. The eligible neighboring blocks are then considered one by one and the occurrence list is then progressively updated based on intra coding modes used for coding the eligible neighboring blocks.
[0132] In some embodiments, the initial occurrence list is empty. When the intra coding mode used for coding an eligible neighboring block corresponds to an intra coding mode identified by an identifier id of an element of the occurrence list, then the occurrence weight of said element is updated. Otherwise, a new element is added to the occurrence list, said new element comprising an identifier id indicating the intra coding mode and an occurrence weight representing a use frequency of said particular intra coding mode for coding said eligible neighboring block.
[0133] In some embodiments, the eligible neighboring blocks may be considered (visited) arbitrary.
[0134] In some embodiments, an occurrence weight cwid associated with an identifier id of an element of the occurrence list may be computed as an accumulation of at least one individual occurrence weight icwid. Each individual occurrence weight icwid being associated with an eligible neighboring block that is coded based on the intra coding mode identified by the identifier id. cwid=∑icwid
[0135] In some embodiments, the individual occurrence weights icwid of at least one element of the occurrence list may equal to a fixed value.
[0136] For example, the fixed value equals 1 and each occurrence weight associated with a particular identifier id represents the occurrence of eligible neighboring blocks that are intra coded based on an intra coding mode identified by the particular identifier id.
[0137] In some embodiments, the individual occurrence weight icwid of an element of the occurrence list may be determined based on characteristics of a neighboring block that is intra coded based on the intra coding mode identified by the identifier id of the element.
[0138] In some embodiments, the characteristics is a number of pixels of an eligible neighboring block.
[0139] For example, if the intra coding mode is DIMD with six internal blending IPMs, then for each blending IPM, the individual occurrence weight icwid associated with an eligible neighboring block may equal (W×H) / 6 wherein W is the number of rows and H the number of columns of an eligible neighboring block.
[0140] In some embodiments, the individual occurrence weight icwid of an element of the occurrence list may depend on internal settings of the intra coding mode identified by the identifier id of the element.
[0141] For instance, let B be an 8×8 block coded with DIMD, where five angular IPMs are blended using their HoG-based DIMD weights. In this case of intra coding mode, the HoG-based DIMD weights may be normalized so that they sum up to 1. Then, each of the five angular IPM may be treated as an independent element of the occurrence list and identified with a particular identifier id based on the index of the used angular IPM. Next, the normalized HoG-based DIMD weight associated with each of the five identifier id may be the individual occurrence weight icwid associated with a particular identifier id. Consequently, considering each eligible neighboring block leads to five pairs (id, icwid) leading to updating (or creating) five elements of the occurrence list.
[0142] FIG. 9 shows an example of the occurrence list according to some embodiments of the present disclosure. In the exemple, N pairs (idj, icwidj) avec j=1 to N are represented, each pair corresponding to an element of the occurrence list.
[0143] FIG. 10 shows an example of deriving at least one pair (id, icwid) for each eligible neighboring block according to some embodiments of the present disclosure.
[0144] In this exemple, four eligible neighboring blocks CU1 to CU4 are considered one by one. Two pairs (id1, icwid1) , (id2, icwid2) are derived from the eligible neighboring blocks CU1, i.e. the intra coding modes identified by the identifiers id1 and id2 are used for coding the eligible neighboring block CU1 and two individual occurrence weighs icwid1 and icwid2 are derived from the neighboring block CU1. The occurrence weight of the element of the occurrence list corresponding to the identifier id1 is updated based on the individual weight icwid1 or created in the occurrence list if it does not already exist. The occurrence weight of the element of the occurrence list corresponding to the identifier id2 is updated based on the individual weight icwid2 or created in the occurrence list if it does not already exist. Two pairs (id3, icwid3) , (idN, icwidN) are derived from the eligible neighboring blocks CU3, i.e. the intra coding modes identified by the identifiers id3 and idN are used for coding the eligible neighboring block CU3 and two individual occurrence weighs icwid3 and icwidN are derived from the neighboring block CU3. The occurrence weight of the element of the occurrence list corresponding to the identifier id3 is updated based on the individual weigh icwid3 or created in the occurrence list if it does not already exist. The occurrence weight of the element of the occurrence list corresponding to the identifier idN is updated based on the individual weigh icwidN or created in the occurrence list if it does not already exist. Two pairs (id2, icwid2) , (id4, icwid4) are derived from the eligible neighboring blocks CU4, i.e. the intra coding modes identified by the identifiers id2 and id4 are used for coding the eligible neighboring block CU4 and two individual occurrence weighs icwid2 and icwid4 are derived from the neighboring block CU4. The occurrence weight of the element of the occurrence list corresponding to the identifier id2 is updated based on the individual weigh icwid2 or created in the occurrence list if it does not already exist. The occurrence weight of the element of the occurrence list corresponding to the identifier id4 is updated based on the individual weigh icwid4 or created in the occurrence list if it does not already exist.
[0145] In some embodiments, occurrence weight of an element of the occurrence list may be modified regardless of the use frequency of the intra coding mode identified by the identifier of the element for coding eligible neighboring blocks.
[0146] In some embodiments, a new element comprising an identifier id indicating a particular intra coding mode and a pre-determined occurrence weight may be forcefully added in the occurrence list if the element does not already exist even though none of the eligible neighboring blocks is coded based on the particular intra coding mode.
[0147] This allows to introduce the impact of an intra coding mode on the selection of the intra coding mode of the current block.
[0148] For example, a new element comprising an identifier PLANAR_IDX indicating an intra coding mode based on PLANAR may be added to the occurrence list even though the intra coding mode based on PLANAR is not used for coding any eligible neighboring blocks.
[0149] In some embodiments, an element of the occurrence list comprising an identifier id indicating a particular intra coding mode and a pre-determined occurrence weight may be forcefully removed from the occurrence list even though at least one eligible neighboring block is coded based on the particular intra coding mode.
[0150] This allows to remove the impact of an intra coding mode on the selection of the intra coding mode of the current block.
[0151] For example, if a first element comprising an identifier id indicating BIMP based on PLANAR is already present in the occurrence list and if a second element of the occurrence list comprises an identifier id indicating a BIMP based on DC, then the occurrence weight of the second element may be decreased or the second element removed from the occurrence list as these two elements have similar functionalities.
[0152] In some embodiments, the occurrence weight of an element of the occurrence list is increased or decreased based on a pre-determined value.
[0153] This allows to increase or decrease the impact of an intra coding mode on the selection of the intra coding mode of the current block.
[0154] For example, as PLANAR is a most likely useful intra coding mode, the presence of an intra coding mode based on PLANAR in the occurrence list may be forcefully strengthened even if its occurrence weight is not significant.
[0155] For example, let blocks ‘A’ and ‘B’ be two eligible neighboring blocks, both coded using the MPMC. As a result, the occurrence list may comprise a first element comprising an identifier indicating BIPM based on IPM-A and a second element comprising an identifier indicating BIPM based on IPM-B. The occurrence weights of the first and second elements may have been determined as discussed above. When coding the block ‘A’ , it may happen that IPM-A appears in the MPM list of block ‘A’ , while for the block ‘B’ , IPM-B may appear in the non-MPM list. In that case, more privilege may be given to IPM-B than to IPM-B because if an encoder decides to spend a relatively large amount of rate for signaling an IPM from the non-MPM list, then it probably means that the specific IPM was indeed a good predictor for its current block (i.e. significantly reducing the distortion) . The occurrence weight of the second element may then be increased or the occurrence weight of the first element may be decreased or both.
[0156] In some embodiments, the occurrence list may be sorted based on the occurrence weights associated with its elements.
[0157] This enables prioritization of the elements in the occurrence list and facilitate extraction of a subset of the most frequently used intra coding modes from the intra coding modes of the occurrence list.
[0158] In some embodiments, the occurrence weight of an element of the occurrence list depends on a template-based coding cost associated with a template-based intra coding mode used for coding at least one block in the causal neighborhood.
[0159] For example, when an eligible neighboring block is coded based on TIMD (or DIMD) , IPMs may be sorted based on a template based coding costs determined on template defined around the current block. An element of the occurrence list may correspond to each of these IPMs. Such element may comprise an identifier id indicating one of these IPMs and an occurrence weight representing the use frequency of TIMD (or DIMD) for coding at least one block in a causal neighborhood of the current block. Said occurrence weight is then weighted by a template based coding cost determined for said IPM.
[0160] Alternatively, templates independent of the template used in TIMD (or DIMD) may be used to determine the template based coding costs.
[0161] In some embodiments, the occurrence weights of all the elements of the occurrence list are weighted by template-based coding costs associated with the eligible neighboring blocks.
[0162] In some embodiments, the most important occurrence weights of elements of the occurrence list are weighted by template-based coding cost associated with eligible neighboring blocks used for deriving said occurrence weights.
[0163] In some embodiments, occurrence weights of elements of the occurrence derived based on a same number of eligible neighboring blocks are weighted by template-based coding costs associated with said eligible neighboring blocks.
[0164] In some embodiments, an occurrence weight of a current element of the sorted occurrence list may be increased based on the occurrence weights associated with a preceding and / or succeeding element of the sorted occurrence list.
[0165] For example, an occurrence weight of a current element of the sorted occurrence list may be increased when it equals to 0.
[0166] Note, an occurrence weight of a current element of the occurrence list may equal to 0 when the occurrence list is initialized with an element comprising an identifier id indicating an intra coding mode and an occurrence weight equals to 0.
[0167] For example, an occurrence weight of a current element of the sorted occurrence list may be increased based on the occurrence weights associated with a preceding and / or succeeding element of the sorted or unsorted occurrence list, by filtering the occurrence list thanks to the ordinality of the identifiers id.
[0168] Except for the Direct Coding index (DC_IDX) and the planar index (PLANAR_IDX) , the angular IPMs possess a characteristic where consecutive identifier values represent consecutive angles of their associated IPM. For example, if the occurrence list has non-zero occurrence weight for IPM indexes of 55 and 5, while zero occurrence weight for 56, one can derive that the absent IPM index of 56 could also be relevant to the content of the current block.
[0169] In some embodiments, a 1-Dimensional filter may apply on the identifiers of element of the occurrence list.
[0170] FIG. 11 shows an example of occurrence list filtered by a five-tap 1-Dimension filter according to some embodiments of the present disclosure.
[0171] In the example, the five-tap 1-Dimensional filter has coefficients [1, 3, 8, 3, 1] followed by a left bit-wise shift of 4. The occurrence list comprises 65 elements (2 to 66) . A histogram view of the occurrence weights associated with elements 20 to 29 is shown. The occurrence weight of element 25 corresponding to IPM-25 equals to 0 and the five-tap 1-Dimensional filter is applied on the occurrence weight of element 25. The filtered occurrence weight of IPM-25 equals to 30.
[0172] Note that depending on the length of the filter, some filter positions in the beginning as well as the end of the occurrence list would require a special treatment, there is not enough samples to cover the filter area. For example one can simply ignore these filter positions or pad the occurrence list.
[0173] In some embodiments, selecting the intra coding mode of the current block based on the occurrence weights may comprise selecting at least one intra coding mode identified by the identifier id of at least one element of the occurrence list.
[0174] For example, the at least one element of the occurrence list is associated with a high occurrence weight, i.e. at least one most frequent used intra coding mode for coding the eligible neighboring blocks.
[0175] In some embodiments, the intra prediction mode of the current block may be the element of the occurrence list having the most important occurrence weight.
[0176] In some embodiments, at least two elements of the occurrence list having the more important occurrence weights are selected and the intra prediction mode of the current block may be obtained by fusing the intra coding modes indicated by the identifiers id comprised in the at least two elements.
[0177] In some embodiments, fusing the intra coding modes indicated by the identifiers id comprised in the at least two elements, may depend on characteristics of the eligible neighboring blocks coded by the intra coding modes indicated by the identifiers id comprised in the at least two elements.
[0178] In some embodiments, fusing the intra coding modes indicated by the identifiers comprised in the at least two elements comprises calculating a weighted average of the intra coding modes indicated by the identifiers id comprised in the at least two elements.
[0179] In some embodiments, the weights of the weighted average may equal to the occurrence weights of the at least two selected elements.
[0180] In some embodiments, the weights of the weighted average may be determined based on template around the current block.
[0181] In some embodiments, fusing the intra coding modes indicated by the identifiers comprised in the at least two elements may be based on a linear model whose parameters are learned on a template around the current block.
[0182] For example, the linear model may be a constraint conditional model whose parameters are trained during a training session. Parameters of the linear model are optimized on the template around the current block to derive the best fusion scheme among several fusion scheme when the intra coding mode identified by the identifier id of the at least two elements are presented at the input of the linear model.
[0183] In some embodiments, the number of fusion schemes may vary based on the characteristics (e.g. size) of the eligible neighboring blocks corresponding to the intra coding modes identified by the identifiers id of the at least two elements.
[0184] In some embodiments, the number of elements of the occurrence list comprising identifier id indicating intra coding modes to be fused may be adaptive to use frequencies represented by the occurrence weights comprised in the elements of the occurrence list.
[0185] In some embodiments, the number of elements of the occurrence list comprising identifier id indicating intra coding modes to be fused may be adaptive to characteristics, e.g. size, of the eligible neighboring blocks corresponding to the intra coding modes identified by the identifiers id of said elements.
[0186] In well-known chroma DM (Direct Mode) coding, one DM point of IPM derivation is used for all blocks, from where one collocated luma block is fetched and its IPM is derived. This DM point is shown with a black cross in FIG. 12, in dual-tree partitioning mode. As can be seen, the drawback of well-known chroma DM coding is that due to Dual-Tree partitioning, the collocated luma block might not be the most representative luma block in the cross-component causal neighborhood (i.e. gray area in FIG. 12) .
[0187] In some embodiments, the intra coding mode for the current chroma block may be selected in an occurrence list of intra coding modes used for coding luma blocks in a luma causal neighborhood of a collocated luma block of the current chroma block.
[0188] For example, the intra coding mode for the current chroma block may correspond to the most frequently present intra coding mode in the occurrence list computed for the current luma block.
[0189] In some embodiments, the intra coding mode for the current chroma block may be selected in a chroma occurrence list of chroma intra coding modes used by eligible chroma blocks in a chroma causal neighborhood, the eligible chroma blocks and the chroma causal neighborhood being determined based on eligible blocks in a luma causal neighborhood of a collocated luma block of the current chroma block.
[0190] FIG. 13 shows an example of selecting an intra prediction mode for a current chroma block in a chroma occurrence list of chroma intra coding modes according to some embodiments of the present disclosure.
[0191] First, a collocated luma block of the current chroma block is derived (top of FIG. 13) . Assuming the intra coding mode of the collocated luma block is selected in an occurrence list comprising three elements comprising identifiers id indicating an IPM called IPM-18, the IPM PLANAR and the CCLM intra coding mode. Next, a chroma causal neighborhood around the chroma block is determined based on a luma causal neighborhood around the collocated luma block. Eligible neighboring blocks are determined in the chroma causal neighborhood based on the eligible neighboring blocks in the luma causal neighborhood. For example, same rules are used to determine the luma and chroma causal neighborhood and the eligible neighboring blocks in the luma and chroma causal neighborhood. The chroma occurrence list may comprises a first element comprising an identifier id indicating IPM-18 and an occurrence weight equals to 64, a second element comprising an identifier id indicating PLANAR and an occurrence weight 32 and a third element comprising an identifier id and an occurrence weight equals to 32 (bottom of FIG. 13) . The intra coding mode for coding the chroma coding block is then selected among the three intra coding modes of the chroma occurrence list as discussed above.
[0192] Intra coding modes may also be based on Block Vector (BV) such as IBC and IntraTmp coding modes. Information from BV-based intra coding mode used for coding eligible neighboring blocks may be collected and a BV occurrence list may be created. Each element of the occurrence list may comprise an identifier id indicating BV i.e. a pair of displacement coordinates <BV-x, BV-y>) . Occurrence weights may also be computed as above discussed for example based on individual occurrence weights, the computed occurrence weights may be weighted as discussed above and the occurrence list may be sorted based on the occurrence weights.
[0193] The BV occurrence list may improve processing both at the encoding and decoding side.
[0194] For example, at the encoding side, IBC performs a BV search for the best BV of an IBC-based coded current block. The BV search takes place in a BV field that is authorized by the underlying codec (e.g. VVC, ECM etc. ) . However, real-time encoders might not have enough processing capacities to properly explore all potentially efficient BVs in the BV field.
[0195] In some embodiments, the BV search may take into account the BV indicated by the identifier id comprised in at least one element of the BV occurrence list.
[0196] In order to limit the number of possible BVs, hence saving signaling rate, current codecs use pre-defined initial BVs around which a BV of a current block can be selected. This applies both to IBC and IntraTmp for example. These pre-defined initial BVs can either be hard coded or be based on previously IBC-based coded blocks.
[0197] In some embodiments, the initial BV may be the BV identified by the identifier id comprised in a selected element of the BV occurrence list.
[0198] For example, the selected element of the BV occurrence list is the element that comprises the highest occurrence weight.
[0199] This embodiment is advantageous because the initial BV depends on the use frequency the BVs used for coding eligible neighboring blocs, while for the prior art method, the presence of a BV in the neighborhood is merely binary (i.e. exists or does not exist) .
[0200] FIG. 14 shows an example of BV occurrence list according to some embodiments of the present disclosure.
[0201] The causal neighborhood comprises six blocks and 4 of them are eligible neighboring blocks, i.e. block in the causal neighborhood that are coded based on BV-based intra coding modes such as IBC.
[0202] In the example, the BV occurrence list comprises three elements. The first element comprises an identifier id indicating BV coordinates (-4, 5) and an occurrence weight equals to 64. The second element comprises an identifier id indicating BV coordinates (-10, 5) and an occurrence weight equals to 48. The third element comprises an identifier id indicating BV coordinates (4, 5) and an occurrence weight equals to 16. An initial BV may equal to (-4, 5) for example.
[0203] Currently, BV predictor of a current BV-based coded block or alternatively Block Vector Difference (BVD) predictor are signaled. The BV predictor is derived from a BV-based intra coding mode used for coding neighboring blocks in the causal neighborhood of the current block. However, deriving the BV predictor according to prior art does not take into account use frequency of each BV used for coding said neighboring blocks.
[0204] In some embodiments, the BV predictor is the BV identified by an identifier id comprised in an element of the BV occurrence list.
[0205] For example, the element is the first element of the sorted BV occurrence list. In some embodiments, BVD predictor is an average or median of BVs identified by identifier id of selected elements of the BV occurrence list.
[0206] For example, the three top elements of the sorted BV occurrence list are selected.
[0207] For example, given the exemple of FIG. 14, the BVD predictor may be derived as a weighted average of the BV bv1 (-4, 5) , identified by the identifier id of the first element of the BV occurrence list and the BV bv2 (-10, 5) , identified by the identifier id of the second element of the BV occurrence list. The third element is not used in this example.
[0208] The BVD predictor may be derived by:
[0209] where cw1is the occurrence weight indicated by the identifier id of the first element and cw2 is the occurrence weight indicated by the identifier id of the second element.
[0210] Without loss of generality, the above idea can also be adapted to Motion Vector Difference (MVD) coding in inter blocks. Precisely, the concept Motion Vector (MV) in inter coding is equivalent to the concept of Block Vector (BV) , as in both cases the prediction signal is extracted from a block position in a reference frame that is displaced and the displacement is relative to the top-left pixel of current block to predict. The single difference between an MV and a BV is that the reference frame of a BV is the current frame, while for an MV the reference frame is another frame that is stored in the DPB. Therefore, apart from this difference all aspects of using the proposed method for BVs can apply to MVs in inter coding.
[0211] Intra coding modes are signaled in a bitstream according to a pre-defined order. For instance, flags and parameters of luma intra coding modes in ECM are roughly signaled according to the following order: DIMD > BDPCM >IntraTmp > MIP > TIMD > SGPM > TMRL > ISP etc. This signaling order is hard coded in the specification and lack content adaptiveness. This may have an impact on the overall bitrate.
[0212] For example if an intra coding mode, such as ISP, is very efficient for compression of a specific video content, it is typically selected very often. However, the rank of ISP in the signaling order is low and flags and parameters of previous intra coding modes have to be signaled before signaling ISP in the bitstream. This would significantly increase the signaling rate cost of ISP-based coded block even though distortion-wise ISP was good for those blocks.
[0213] In some embodiments, each element of the occurrence list comprises an identifier id indicating an intra coding mode to be signaled in the bitstream for the current block, and an occurrence weight representing use frequency of said intra coding mode for coding at least one block in a causal neighborhood of the current block.
[0214] The flags and parameters of the intra coding modes to be signaled for a current block are then signaled in the bitstream according to their occurrence weights leading to an adaptive signaling of flags and parameters of these intra coding modes based on use frequency of these intra coding modes for coding eligible neighboring blocks in the causal neighborhood of the current block.
[0215] Fig. 15 shows an example of adaptive signaling order of flags and parameters of intra coding modes of a current block according to embodiments of the present disclosure.
[0216] The MPM list is currently constructed by accumulating intra coding modes used for coding blocks in a neighborhood of a current block. Post-processing may then be applied on the MPM list. For example, the MPM list may be reordered. For example, when angular-based intra coding modes are used, e.g. some of the 66 IPM in VVC are in the MPM list, a post-processing consist in filling the empty slots with adjacent indexes to those that are already added to the list. For example if the IPM 25 is already in the list, then modes 24 and 26 might also be added to fill the MPM list.
[0217] In some embodiments, each element of the occurrence list comprises an identifier indicating an intra coding mode candidate for coding the current block, i.e. an intra coding mode of the MPM list, and an occurrence weight representing use frequency of said intra coding mode for coding at least one block in a causal neighborhood of the current block.
[0218] The occurrence list then provide intra coding mode candidate (IPM candidate) that are not added to the current MPM list. Moreover, the occurrence weight of the elements in the occurrence list can be used to reorder the MPM list.
[0219] Fig. 16 shows an example of reordering the MPM list based on the occurrence list according to some embodiments of the present disclosure.
[0220] In the example, the current order of the MPM list is shown on the left side: PLANAR> IPM-18>IPM-50>DC. The occurrence list comprises four elements. The first element comprises an identifier id indicating the intra coding mode IPM-18 and an occurrence weight equals to 32. The second element comprises an identifier id indicating the intra coding mode IPM-50 and an occurrence weight equals to 16. The third element comprises an identifier id indicating the intra coding mode PLANAR and an occurrence weight equals to 8. The fourth element comprises an identifier id indicating the intra coding mode DC and an occurrence weight equals to 4. The occurrence list is sorted based on the occurrence weights and the intra coding modes of the MPM list are reordered based on the occurrence weights.
[0221] In existing technologies, a transform of a current block may be derived using different approaches. For example, a transform type that is associated with an intra coding mode used for coding the current block may be used. If the intra coding mode used for coding the current block does not identify a transform type, such as TIMD or DIMD, then a transform type may be derived based on a template around the current block.
[0222] In some embodiments, each element of the occurrence list may comprise an identifier id indicating an intra coding mode (associated with a transform type) and an occurrence weight representing use frequency of said intra coding mode for coding at least one block in a causal neighborhood of the current block. An element of the occurrence list is selected based on the occurrence list and the transform type associated with the intra coding mode comprises in the selected element of the occurrence list is used as being the transform type to be used for coding the current block.
[0223] For example, the selected element is the element of the occurrence list having the highest occurrence weight.
[0224] FIG. 17 shows an example to signal the usage of occurrence list at the encoder or decoder side as discussed above according to some embodiments of the present disclosure.
[0225] In the example, the usage of occurrence list for each current block, (CU) is indicated by a flag sps_obic_enabled_flag in the Coding Unit (CU) syntax element. When the flag is true, an internal variable intra_obic_flag is set to true. OBIC refers to Occurrence-Based Intra Coding.
[0226] Figure 18 shows a schematic block diagram illustrating an example of a system 600 in which various aspects and exemplary embodiments are implemented.
[0227] System 600 may be embedded as one or more devices including the various components described below. In various exemplary embodiments, system 600 may be configured to implement one or more of the aspects described in the present application.
[0228] Examples of equipment that may form all or part of the system 600 include personal computers, laptops, smartphones, tablet computers, digital multimedia set top boxes, digital television receivers, personal video recording systems, connected home appliances, connected vehicles and their associated processing systems, head mounted display devices (HMD, see-through glasses) , projectors (beamers) , “caves” (system including multiple displays) , servers, video encoders, video decoders, post-processors processing output from a video decoder, pre-processors providing input to a video encoder, web servers, video servers (e.g. a broadcast server, a video-on-demand server or a web server) , still or video camera, encoding or decoding chip or any other communication devices. Elements of system 600, singly or in combination, may be embodied in a single integrated circuit (IC) , multiple ICs, and / or discrete components. For example, in at least one exemplary embodiment, the processing and encoder / decoder elements of system 600 may be distributed across multiple ICs and / or discrete components. In various exemplary embodiments, system 600 may be communicatively coupled to other similar systems, or to other electronic devices, via, for example, a communications bus or through dedicated input and / or output ports.
[0229] System 600 may include at least one processor 610 configured to execute instructions loaded therein for implementing, for example, the various aspects described in the present application. Processor 610 may include embedded memory, input output interface, and various other circuitries as known in the art. System 600 may include at least one memory 620 (for example a volatile memory device and / or a non-volatile memory device) . System 600 may include a storage device 640, which may include non-volatile memory and / or volatile memory, including, but not limited to, Electrically Erasable Programmable Read-Only Memory (EEPROM) , Read-Only Memory (ROM) , Programmable Read-Only Memory (PROM) , Random Access Memory (RAM) , Dynamic Random-Access Memory (DRAM) , Static Random-Access Memory (SRAM) , flash, magnetic disk drive, and / or optical disk drive. The storage device 640 may include an internal storage device, an attached storage device, and / or a network accessible storage device, as non-limiting examples.
[0230] System 600 may include an encoder / decoder module 630 configured, for example, to process data to provide encoded / decoded video picture data, and the encoder / decoder module 630 may include its own processor and memory. The encoder / decoder module 630 may represent module (s) that may be included in a device to perform the encoding and / or decoding functions. As is known, a device may include one or both encoding and decoding modules. Additionally, encoder / decoder module 630 may be implemented as a separate element of system 600 or may be incorporated within processor 610 as a combination of hardware and software as known to those skilled in the art.
[0231] Program code to be loaded onto processor 610 or encoder / decoder 630 to perform the various aspects described in the present application may be stored in storage device 640 and subsequently loaded onto memory 620 for execution by processor 610. In accordance with various exemplary embodiments, one or more of processor 610, memory 620, storage device 640, and encoder / decoder module 630 may store one or more of various items during the performance of the processes described in the present application. Such stored items may include, but are not limited to video picture data, information data used for encoding video picture data, a bitstream, matrices, variables, and intermediate or final results from the processing of equations, formulas, operations, and operational logic.
[0232] In several exemplary embodiments, memory inside of the processor 610 and / or the encoder / decoder module 630 may be used to store instructions and to provide working memory for processing that may be performed during encoding or decoding.
[0233] In other exemplary embodiments, however, a memory external to the processing device (for example, the processing device may be either the processor 610 or the encoder / decoder module 630) may be used for one or more of these functions. The external memory may be the memory 620 and / or the storage device 640, for example, a dynamic volatile memory and / or a non-volatile flash memory. In several exemplary embodiments, an external non-volatile flash memory may be used to store the operating system of a television. In at least one exemplary embodiment, a fast external dynamic volatile memory such as a RAM may be used as working memory for video coding and decoding operations, such as for MPEG-2 part 2 (also known as ITU-T Recommendation H. 262 and ISO / IEC 13818-2, also known as MPEG-2 Video) , AVC, HEVC, EVC, VVC, AV1, etc.
[0234] The input to the elements of system 600 may be provided through various input devices as indicated in block 690. Such input devices include, but are not limited to, (i) an RF portion that may receive an RF signal transmitted, for example, over the air by a broadcaster, (ii) a Composite input terminal, (iii) a USB input terminal, (iv) an HDMI input terminal, (v) a bus such as CAN (Controller Area Network) , CAN FD (Controller Area Network Flexible Data-Rate) , FlexRay (ISO 17458) or Ethernet (ISO / IEC 802-3) bus when the present invention is implemented in the automotive domain.
[0235] In various exemplary embodiments, the input devices of block 690 may have associated respective input processing elements as known in the art. For example, the RF portion may be associated with elements necessary for (i) selecting a desired frequency (also referred to as selecting a signal, or band-limiting a signal to a band of frequencies) , (ii) down-converting the selected signal, (iii) band-limiting again to a narrower band of frequencies to select (for example) a signal frequency band which may be referred to as a channel in certain exemplary embodiments, (iv) demodulating the down-converted and band-limited signal, (v) performing error correction, and (vi) demultiplexing to select the desired stream of data packets. The RF portion of various exemplary embodiments may include one or more elements to perform these functions, for example, frequency selectors, signal selectors, band-limiters, channel selectors, filters, downconverters, demodulators, error correctors, and de-multiplexers. The RF portion may include a tuner that performs various of these functions, including, for example, down-converting the received signal to a lower frequency (for example, an intermediate frequency or a near-baseband frequency) or to baseband.
[0236] In one set-top box embodiment, the RF portion and its associated input processing element may receive an RF signal transmitted over a wired (for example, cable) medium. Then, the RF portion may perform frequency selection by filtering, down-converting, and filtering again to a desired frequency band.
[0237] Various exemplary embodiments rearrange the order of the above-described (and other) elements, remove some of these elements, and / or add other elements performing similar or different functions.
[0238] Adding elements may include inserting elements in between existing elements, such as, for example, inserting amplifiers and an analog-to-digital converter. In various exemplary embodiments, the RF portion may include an antenna.
[0239] Additionally, the USB and / or HDMI terminals may include respective interface processors for connecting system 600 to other electronic devices across USB and / or HDMI connections. It is to be understood that various aspects of input processing, for example, Reed-Solomon error correction, may be implemented, for example, within a separate input processing IC or within processor 610 as necessary. Similarly, aspects of USB or HDMI interface processing may be implemented within separate interface ICs or within processor 610 as necessary. The demodulated, error corrected, and demultiplexed stream may be provided to various processing elements, including, for example, processor 610, and encoder / decoder 630 operating in combination with the memory and storage elements to process the data stream as necessary for presentation on an output device.
[0240] Various elements of system 600 may be provided within an integrated housing. Within the integrated housing, the various elements may be interconnected and transmit data therebetween using suitable connection arrangement 690, for example, an internal bus as known in the art, including the I2C bus, wiring, and printed circuit boards.
[0241] The system 600 may include communication interface 650 that enables communication with other devices via communication channel 651. The communication interface 650 may include, but is not limited to, a transceiver configured to transmit and to receive data over communication channel 651.
[0242] The communication interface 650 may include, but is not limited to, a modem or network card and the communication channel 651 may be implemented, for example, within a wired and / or a wireless medium.
[0243] Data may be streamed to system 600, in various exemplary embodiments, using a Wi-Fi network such as IEEE 802.11. The Wi-Fi signal of these exemplary embodiments may be received over the communications channel 651 and the communications interface 650 which are adapted for Wi-Fi communications. The communications channel 651 of these exemplary embodiments may be typically connected to an access point or router that provides access to outside networks including the Internet for allowing streaming applications and other over-the-top communications.
[0244] Other exemplary embodiments may provide streamed data to the system 600 using a set-top box that delivers the data over the HDMI connection of the input block 690.
[0245] Still other exemplary embodiments may provide streamed data to the system 600 using the RF connection of the input block 690.
[0246] The streamed data may be used as a way for signaling information used by the system 600. The signaling information may comprise the bitstream B and / or information such a number of pixels of a video picture and / or any coding / decoding setup parameters.
[0247] It is to be appreciated that signaling may be accomplished in a variety of ways. For example, one or more syntax elements, flags, and so forth may be used to signal information to a corresponding decoder in various exemplary embodiments.
[0248] System 600 may provide an output signal to various output devices, including a display 661, speakers 671, and other peripheral devices 681. The other peripheral devices 681 may include, in various examples of exemplary embodiments, one or more of a stand-alone DVR, a disk player, a stereo system, a lighting system, and other devices that provide a function based on the output of system 600.
[0249] In various exemplary embodiments, control signals may be communicated between the system 600 and the display 661, speakers 671, or other peripheral devices 681 using signaling such as AV. Link (Audio / Video Link) , CEC (Consumer Electronics Control) , or other communications protocols that enable device-to-device control with or without user intervention.
[0250] The output devices may be communicatively coupled to system 600 via dedicated connections through respective interfaces 660, 670, and 680.
[0251] Alternatively, the output devices may be connected to system 600 using the communications channel 651 via the communications interface 650. The display 661 and speakers 671 may be integrated in a single unit with the other components of system 600 in an electronic device such as, for example, a television.
[0252] In various exemplary embodiments, the display interface 660 may include a display driver, such as, for example, a timing controller (T Con) chip.
[0253] The display 661 and speaker 671 may alternatively be separate from one or more of the other components, for example, if the RF portion of input 690 is part of a separate set-top box. In various exemplary embodiments in which the display 661 and speakers 671 may be external components, the output signal may be provided via dedicated output connections, including, for example, HDMI ports, USB ports, or COMP outputs.
[0254] In Figures 1-17, various methods are described herein, and each of the methods includes one or more blocks or actions for achieving the described method. Unless a specific order of blocks or actions is required for proper operation of the method, the order and / or use of specific blocks and / or actions may be modified or combined.
[0255] Some examples are described with regard to block diagrams and / or operational flowcharts. Each block represents a circuit element, module, or portion of code which includes one or more executable instructions for implementing the specified logical function (s) . It should also be noted that in other implementations, the function (s) noted in the blocks may occur out of the indicated order. For example, two blocks shown in succession may, in fact, be executed substantially concurrently or the blocks may sometimes be executed in the reverse order, depending on the functionality involved.
[0256] The implementations and aspects described herein may be implemented in, for example, a method or a process, an apparatus, a computer program, a data stream, a bitstream, or a signal. Even if only discussed in the context of a single form of implementation (for example, discussed only as a method) , the implementation of features discussed may also be implemented in other forms (for example, an apparatus or computer program) .
[0257] The methods may be implemented in, for example, a processor, which refers to processing devices in general, including, for example, a computer, a microprocessor, an integrated circuit, or a programmable logic device. Processors also include communication devices.
[0258] Additionally, the methods may be implemented by instructions being performed by a processor, and such instructions (and / or data values produced by an implementation) may be stored on a computer readable storage medium. A computer readable storage medium may take the form of a computer readable program product embodied in one or more computer readable medium (s) and having computer readable program code embodied thereon that is executable by a computer. A computer readable storage medium as used herein may be considered a non-transitory storage medium given the inherent capability to store the information therein as well as the inherent capability to provide retrieval of the information therefrom. A computer readable storage medium may be, for example, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. It is to be appreciated that the following, while providing more specific examples of computer readable storage mediums to which the present exemplary embodiments may be applied, is merely an illustrative and not an exhaustive listing as is readily appreciated by one of ordinary skill in the art: a portable computer diskette; a hard disk; a read-only memory (ROM) ; an erasable programmable read-only memory (EPROM or Flash memory) ; a portable compact disc read-only memory (CD-ROM) ; an optical storage device; a magnetic storage device; or any suitable combination of the foregoing.
[0259] The instructions may form an application program tangibly embodied on a processor-readable medium.
[0260] Instructions may be, for example, in hardware, firmware, software, or a combination. Instructions may be found in, for example, an operating system, a separate application, or a combination of the two. A processor may be characterized, therefore, as, for example, both a device configured to carry out a process and a device that includes a processor-readable medium (such as a storage device) having instructions for carrying out a process. Further, a processor-readable medium may store, in addition to or in lieu of instructions, data values produced by an implementation.
[0261] An apparatus may be implemented in, for example, appropriate hardware, software, and firmware. Examples of such apparatus include personal computers, laptops, smartphones, tablet computers, digital multimedia set top boxes, digital television receivers, personal video recording systems, connected home appliances, head mounted display devices (HMD, see-through glasses) , projectors (beamers) , “caves” (system including multiple displays) , servers, video encoders, video decoders, post-processors processing output from a video decoder, pre-processors providing input to a video encoder, web servers, set-top boxes, and any other device for processing video pictures or other communication devices. As should be clear, the equipment may be mobile and even installed in a mobile vehicle.
[0262] Computer software may be implemented by the processor 610 or by hardware, or by a combination of hardware and software. As a non-limiting example, the exemplary embodiments may be also implemented by one or more integrated circuits. The memory 620 may be of any type appropriate to the technical environment and may be implemented using any appropriate data storage technology, such as optical memory devices, magnetic memory devices, semiconductor-based memory devices, fixed memory, and removable memory, as non-limiting examples. The processor 610 may be of any type appropriate to the technical environment, and may encompass one or more of microprocessors, general purpose computers, special purpose computers, and processors based on a multi-core architecture, as non-limiting examples.
[0263] As will be evident to one of ordinary skill in the art, implementations may produce a variety of signals formatted to carry information that may be, for example, stored or transmitted. The information may include, for example, instructions for performing a method, or data produced by one of the described implementations. -For example, a signal may be formatted to carry the bitstream of a described exemplary embodiment. Such a signal may be formatted, for example, as an electromagnetic wave (for example, using a radio frequency portion of spectrum) or as a baseband signal. The formatting may include, for example, encoding a data stream and modulating a carrier with the encoded data stream. The information that the signal carries may be, for example, analog or digital information. The signal may be transmitted over a variety of different wired or wireless links, as is known. The signal may be stored on a processor-readable medium.
[0264] The terminology used herein is for the purpose of describing particular exemplary embodiments only and is not intended to be limiting. As used herein, the singular forms "a" , "an" , and "the" may be intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms "includes / comprises" and / or "including / comprising" when used in this specification, may specify the presence of stated, for example, features, integers, blocks, operations, elements, and / or components but do not preclude the presence or addition of one or more other features, integers, blocks, operations, elements, components, and / or groups thereof. Moreover, when an element is referred to as being "responsive" or "connected" or “associated with” to another element, it may be directly responsive or connected to or associated with the other element, or intervening elements may be present. In contrast, when an element is referred to as being "directly responsive" or "directly connected" to or “directly associated with” other element, there are no intervening elements present.
[0265] It is to be appreciated that the use of any of the symbol / term “ / ” , “and / or” , and “at least one of” , for example, in the cases of “A / B” , “A and / or B” and “at least one of A and B” , may be intended to encompass the selection of the first listed option (A) only, or the selection of the second listed option (B) only, or the selection of both options (A and B) . As a further example, in the cases of “A, B, and / or C” and “at least one of A, B, and C” , such phrasing is intended to encompass the selection of the first listed option (A) only, or the selection of the second listed option (B) only, or the selection of the third listed option (C) only, or the selection of the first and the second listed options (A and B) only, or the selection of the first and third listed options (A and C) only, or the selection of the second and third listed options (B and C) only, or the selection of all three options (A and B and C) . This may be extended, as is clear to one of ordinary skill in this and related arts, for as many items as are listed.
[0266] Various numeric values may be used in the present application. The specific values may be for example purposes and the aspects described are not limited to these specific values.
[0267] It will be understood that, although the terms first, second, etc. may be used herein to describe various elements, these elements are not limited by these terms. These terms are only used to distinguish one element from another. For example, a first element could be termed a second element, and, similarly, a second element could be termed a first element without departing from the teachings of the present application. No ordering is implied between a first element and a second element.
[0268] Reference to “one exemplary embodiment” or “an exemplary embodiment” or “one implementation” or “an implementation” , as well as other variations thereof, is frequently used to convey that a particular feature, structure, characteristic, and so forth (described in connection with the exemplary embodiment / implementation) is included in at least one exemplary embodiment / implementation. Thus, the appearances of the phrase “in one exemplary embodiment” or “in an exemplary embodiment” or “in one implementation” or “in an implementation” , as well any other variations, appearing in various places throughout the present application are not necessarily all referring to the same exemplary embodiment.
[0269] Similarly, reference herein to “in accordance with an exemplary embodiment / example / implementation” or “in an exemplary embodiment / example / implementation” , as well as other variations thereof, is frequently used to convey that a particular feature, structure, or characteristic (described in connection with the exemplary embodiment / example / implementation) may be included in at least one exemplary embodiment / example / implementation. Thus, the appearances of the expression “in accordance with an exemplary embodiment / example / implementation” or “in an exemplary embodiment / example / implementation” in various places in the present application are not necessarily all referring to the same exemplary embodiment / example / implementation, nor are separate or alternative exemplary embodiment / examples / implementation necessarily mutually exclusive of other exemplary embodiments / examples / implementation.
[0270] Reference numerals appearing in the claims are by way of illustration only and shall have no limiting effect on the scope of the claims. Although not explicitly described, the present exemplary embodiments / examples and variants may be employed in any combination or sub-combination.
[0271] When a figure. is presented as a flow diagram, it should be understood that it also provides a block diagram of a corresponding apparatus. Similarly, when a figure is presented as a block diagram, it should be understood that it also provides a flow diagram of a corresponding method / process.
[0272] Although some of the diagrams include arrows on communication paths to show a primary direction of communication, it is to be understood that communication may occur in the opposite direction to the depicted arrows.
[0273] Various implementations involve decoding. “Decoding” , as used in this application, may encompass all or part of the processes performed, for example, on a received video picture (including possibly a received bitstream which encodes one or more video picture) in order to produce a final output suitable for display or for further processing in the reconstructed video domain. In various exemplary embodiments, such processes include one or more of the processes typically performed by a decoder. In various exemplary embodiments, such processes also, or alternatively, include processes performed by a decoder of various implementations described in the present application, for example,
[0274] As further examples, in one exemplary embodiment “decoding” may refer only to de-quantizing, in one exemplary embodiment “decoding” may refer to entropy decoding, in another exemplary embodiment “decoding” may refer only to differential decoding, and in another exemplary embodiment “decoding” may refer to combinations of de-quantizing, entropy decoding and differential decoding. Whether the phrase “decoding process” may be intended to refer specifically to a subset of operations or generally to the broader decoding process will be clear based on the context of the specific description and is believed to be well understood by those skilled in the art.
[0275] Various implementations involve encoding. In an analogous way to the above discussion about “decoding” , “encoding” as used in the present application may encompass all or part of the processes performed, for example, on an input video picture in order to produce an output bitstream. In various exemplary embodiments, such processes include one or more of the processes typically performed by an encoder. In various exemplary embodiments, such processes also, or alternatively, include processes performed by an encoder of various implementations described in this application.
[0276] As further examples, in one exemplary embodiment “encoding” may refer only to quantizing, in one exemplary embodiment “encoding” may refer only to entropy encoding, in another exemplary embodiment “encoding” may refer only to differential encoding, and in another exemplary embodiment “encoding” may refer to combinations of quantizing, differential encoding and entropy encoding. Whether the phrase “encoding process” may be intended to refer specifically to a subset of operations or generally to the broader encoding process will be clear based on the context of the specific descriptions and is believed to be well understood by those skilled in the art.
[0277] Additionally, the present application may refer to “obtaining” various pieces of information. Obtaining the information may include one or more of, for example, estimating the information, calculating the information, predicting the information, or retrieving the information from memory, processing the information, moving the information, copying the information, erasing the information, calculating the information, determining the information, predicting the information, or estimating the information.
[0278] Additionally, this application may refer to “receiving” various pieces of information. Receiving the information may include one or more of, for example, accessing the information, or receiving information from a communication network.
[0279] Also, as used herein, the word “signal” refers to, among other things, indicating something to a corresponding decoder. For example, in certain exemplary embodiments the encoder signals a particular information such as coding parameter or encoded video picture data. In this way, in an exemplary embodiment the same parameter may be used at both the encoder side and the decoder side. Thus, for example, an encoder may transmit (explicit signaling) a particular parameter to the decoder so that the decoder may use the same particular parameter. Conversely, if the decoder already has the particular parameter as well as others, then signaling may be used without transmitting (implicit signaling) to simply allow the decoder to know and select the particular parameter. By avoiding transmission of any actual functions, a bit savings is realized in various exemplary embodiments. It is to be appreciated that signaling may be accomplished in a variety of ways. For example, one or more syntax elements, flags, and so forth are used to signal information to a corresponding decoder in various exemplary embodiments. While the preceding relates to the verb form of the word “signal” , the word “signal” may also be used herein as a noun.
[0280] A number of implementations have been described. Nevertheless, it will be understood that various modifications may be made. For example, elements of different implementations may be combined, supplemented, modified, or removed to produce other implementations. Additionally, one of ordinary skill will understand that other structures and processes may be substituted for those disclosed and the resulting implementations will perform at least substantially the same function (s) , in at least substantially the same way (s) , to achieve at least substantially the same result (s) as the implementations disclosed. Accordingly, these and other implementations are contemplated by this application.
Claims
1.A method of coding a current block of a video picture based on an intra coding mode selected among intra coding modes, comprising:- determining an occurrence list of intra coding modes, the occurrence list comprising at least one element, each element comprising an identifier indicating an intra coding mode and comprising an occurrence weight representing use frequency of said intra coding mode for coding at least one block in a causal neighborhood of the current block ; and- selecting the intra coding mode for coding the current block based on the occurrence weights.2.The method of claim 1, wherein the occurrence weight associated with an identifier of an element of the occurrence list is computed as an accumulation of at least one individual occurrence weight, wherein each individual occurrence weight being associated with a block in the causal neighborhood that is coded based on the intra coding mode identified by said identifier.3.The method of claim 2, wherein the individual occurrence weight of at least one element of the occurrence list equals to a fixed value.4.The method of claim 2, wherein the individual occurrence weight of an element of the occurrence list is determined based on characteristics of a block in the causal neighborhood that is intra coded based on the intra coding mode identified by the identifier of the element.5.The method of one of claims 2 to 4, wherein occurrence weight of an element of the occurrence list is modified regardless of the use frequency of the intra coding mode identified by the identifier of the element for coding blocks in the causal neighborhood.6.The method of 5, wherein a new element comprising an identifier indicating a particular intra coding mode and a pre-determined occurrence weight is forcefully added in the occurrence list if the element does not already exist even though none of the eligible neighboring block is coded based on the particular intra coding mode.7.The method of 5, wherein an element of the occurrence list comprising an identifier indicating a particular intra coding mode and a pre-determined occurrence weight may be forcefully removed from the occurrence list even though at least one eligible neighboring block is coded based on the particular intra coding mode.8.The method of claim 5, wherein the occurrence weight of an element of the occurrence list is increased or decreased based on a pre-determined value.9.The method of claim 8, wherein the occurrence weight of an element of the occurrence list is increased based on the occurrence weights associated with a preceding and / or succeeding element of the occurrence list, by filtering the occurrence list thanks to the ordinality of the identifiers.10.The method of one of claims 1 to 9, wherein the occurrence list is sorted based on the occurrence weights associated with its elements.11.The method of 10, wherein the occurrence weight of an element of the occurrence list depend on a template-based coding cost associated with a template-based intra coding mode used for coding at least one block in the causal neighborhood.12.The method of claim 10, wherein an occurrence weight comprised in a current element of the sorted occurrence list is increased based on the occurrence weights associated with a preceding and / or succeeding element of the sorted occurrence list.13.The method of one of claims 2 to 12, wherein selecting the intra coding mode of the current block based on the occurrence weights comprises selecting at least one intra coding mode identified by the identifier of at least one element of the occurrence list.14.The method of claim 13, wherein the intra prediction mode of the current block is the element of the occurrence list having the most important occurrence weight or at least two elements of the occurrence list having the more important occurrence weights are selected and the intra prediction mode of the current block is obtained by fusing the intra coding modes indicated by the identifiers comprised in the at least two elements.15.The method of claim 14, wherein fusing the intra coding modes indicated by the identifiers comprised in the at least two elements, depends on characteristics of the eligible neighboring blocks coded by the intra coding modes indicated by the identifiers comprised in the at least two elements or comprises calculating a weighted average of the intra coding modes indicated by the identifiers comprised in the at least two elements.16.The method of claim 15, wherein the weights of the weighted average are determined based on template around the current block.17.The method of claim 14, wherein fusing the intra coding modes indicated by the identifiers comprised in the at least two elements is based on a linear model whose parameters are learned on a template around the current block.18.The method of claim 1, wherein the current block being a current chroma block, the intra coding mode for the current chroma block is selected in an occurrence list of intra coding modes used for coding luma blocks in a cross causal neighborhood of the current chroma block.19.The method of claim 1, wherein each element of the occurrence list comprises an identifier indicating an intra coding mode to be signaled in a bitstream for the current block, and an occurrence weight representing use frequency of said intra coding mode for coding at least one block in a causal neighborhood of the current block.20.The method of claim 1, wherein each element of the occurrence list comprises an identifier indicating an intra coding mode candidate for coding the current block, and an occurrence weight representing use frequency of said intra coding mode for coding at least one block in a causal neighborhood of the current block.21.An apparatus comprising means for performing one of the methods claimed in any one of claims 1 to 20.22.A computer program product including instructions which, when the program is executed by one or more processors, causes the one or more processors to carry out a method claimed in any one of claims 1 to 20.23.A non-transitory storage medium carrying instructions of program code for executing a method claimed in any one of claims 1 to 20.