An apparatus, a method and a computer program for video coding and decoding

The enhanced video coding method addresses the limitation of blending only two predictors with the same IM and MRL indices by selecting and blending multiple predictors based on block size and neighboring characteristics, enhancing intra prediction efficiency and video quality.

WO2026233716A1PCT designated stage Publication Date: 2026-11-12NOKIA TECHNOLOGIES OY
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
PCT/EP2026/061524
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2025-05-08
Filing Date
2026-04-22
Publication Date
2026-11-12

AI Technical Summary

Technical Problem

Existing video coding methods, such as H.265/HEVC and H.266/VVC, lack the ability to blend predictors obtained with non-zero Multiple Reference Line (MRL) indices and different Intra Prediction Modes (IMs), limiting the improvement of intra prediction efficiency.

Method used

An enhanced method that determines a current block's template, selects candidate MRL indices and IMs based on block size and neighboring block characteristics, computes template costs, and blends predictors using fixed weights to improve intra prediction.

Benefits of technology

Enhances intra prediction by allowing blending of multiple predictors with non-zero MRL indices and different IMs, improving compression efficiency and video quality.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure EP2026061524_12112026_PF_FP_ABST
    Figure EP2026061524_12112026_PF_FP_ABST
Patent Text Reader

Abstract

A method comprising: determining a current block of samples to be predicted; determining, for the current block, a template comprising a plurality of reconstructed samples, a list of candidate multiple reference line indices, and a list of candidate intra prediction modes, wherein the determination of the list of candidate multiple reference line indices depends on the block size of the current block, and / or on characteristics of at least one neighbouring block; and computing template costs for determining at least a predictor for the current block based on pairs of a candidate multiple reference line index and a candidate intra prediction mode.
Need to check novelty before this filing date? Find Prior Art

Description

AN APPARATUS, A METHOD AND A COMPUTER PROGRAM FOR VIDEO CODING AND DECODING TECHNICAL FIELD

[0001] The present invention relates to an apparatus, a method and a computer program for video coding and decoding.BACKGROUND

[0002] Typical video codecs, such as H.265 / HEVC and H.266 / VV C standards apply different kinds of means for predicting blocks of samples to be able to compress and represent image data efficiently. Intra prediction can be performed using different reference lines, where each reference line corresponds to a set of already decoded samples at a given distance from the current block. Each reference line is identified by a given Multiple Reference Line (MRL) index, where MRL 0 corresponds to using samples that are directly adjacent to the current block, and increasing MRL index value corresponds to increasing the distance from the current block in the above and left directions.

[0003] Template-based Multiple Reference Line (TMRL) operates by analyzing a template around the current block in order to determine a prediction for the current block utilizing nonzero MRL indices. In TMRL, one line of samples above and on the left of the current block are used as template. For pairs of an intra-prediction mode (IM) and a non-zero MRL index candidate, a prediction is computed for the samples in the template. The pairs of IMs and MRLs are sorted in a list based on the template costs. Finally, an index is signalled and then parsed at the decoder side to extract the correct candidate from the list.

[0004] For each TMRL candidate, MRL fusion may be used to improve the intra-prediction for a current block by combining the intra predictor obtained using the given MRL index L, with another predictor obtained using MRL index L + 1. The two predictors are blended together using fixed weights set to 3 / 4 and 1 / 4, respectively.

[0005] However, while MRL fusion only allows blending of two predictors with the same IM and two consecutive MRL indices, there are no other intra-prediction methods available that allow blending a number of predictors obtained with non-zero MRL indices and different IMs, even though blending has been proven to be beneficial to improve intra prediction.SUMMARY

[0006] Now in order to at least alleviate the above problems, an enhanced method is introduced herein.

[0007] The scope of protection sought for various embodiments of the invention is set out by the independent claims. The embodiments and features, if any, described in this specification that do not fall under the scope of the independent claims are to be interpreted as examples useful for understanding various embodiments of the invention.

[0008] A method according to a first aspect comprises means for determining a current block of samples to be predicted; means for determining, for the current block, a template comprising a plurality of reconstructed samples, a list of candidate multiple reference line indices, and a list of candidate intra prediction modes, wherein the determination of the list of candidate multiple reference line indices depends on the block size of the current block, and / or on characteristics of at least one neighbouring block; and means for computing template costs for determining at least a predictor for the current block based on pairs of a candidate multiple reference line index and a candidate intra prediction mode.

[0009] According to an embodiment, the apparatus comprises means for selecting, from a predetermined list of candidate multiple reference line indices, a set of candidate multiple reference line indices based on the size of the current block.

[0010] According to an embodiment, the apparatus comprises means for selecting, from a predetermined list of candidate multiple reference line indices, a set of candidate multiple reference line indices based on characteristics of one or more neighbouring blocks.

[0011] According to an embodiment, the apparatus comprises means for selecting from a predetermined list of candidate multiple reference line indices, a set of candidate multiple reference line indices which include indices that are within an offset, the same as the index used in the neighbouring block.

[0012] According to an embodiment, the apparatus comprises means for determining a set of candidate multiple reference line indices based on characteristics of the current block.

[0013] According to an embodiment, the apparatus comprises means for determining a set of candidate multiple reference line indices based on the coordinates of the current block.

[0014] According to an embodiment, the apparatus comprises means for determining a set of candidate multiple reference line indices based on a size of the template.

[0015] According to an embodiment, the apparatus comprises means for excluding specific indices from the list of candidate multiple reference line indices based on the coordinates of the current block.

[0016] According to an embodiment, the list of candidate multiple reference line indices and / or the list of candidate intra-prediction modes is predetermined.

[0017] As a second aspect, there is provided an apparatus comprising: at least one processor and at least one memory, said at least one memory stored with code thereon, which when executed by said at least one processor, causes the apparatus to perform at least: determine a current block of samples to be predicted; determine, for the current block, a template comprising a plurality of reconstructed samples, a list of candidate multiple reference line indices, and a list of candidate intra prediction modes, wherein the determination of the list of candidate multiple reference line indices depends on the block size of the current block, and / or on characteristics of at least one neighbouring block; and compute template costs for determining at least a predictor for the current block based on pairs of a candidate multiple reference line index and a candidate intra prediction mode.

[0018] A method according to a third aspect comprises determining a current block of samples to be predicted; determining, for the current block, a template comprising a plurality of reconstructed samples, a list of candidate multiple reference line indices, and a list of candidate intra prediction modes, wherein the determination of the list of candidate multiple reference line indices depends on the block size of the current block, and / or on characteristics of at least one neighbouring block; and computing template costs for determining at least a predictor for the current block based on pairs of a candidate multiple reference line index and a candidate intra prediction mode.

[0019] The apparatuses and the computer readable storage mediums stored with code thereon, as described above, are thus arranged to carry out the above methods and one or more of the embodiments related thereto.BRIEF DESCRIPTION OF THE DRAWINGS

[0020] For beter understanding of the present invention, reference will now be made by way of example to the accompanying drawings in which:

[0021] Figures la and lb show schematically an encoder and a decoder, respectively, suitable for implementing embodiments of the invention;

[0022] Figure 2 shows a flow chart of a method according to a first aspect;

[0023] Figure 3 shows an example of a template formed of one line and one column of samples;

[0024] Figure 4 shows an example of three MRLs at indices 1, 3, and 5 having respectively one, three or five lines / columns of samples between the reference samples and the current block;

[0025] Figure 5 shows a flow chart of a method according to a second aspect;

[0026] Figure 6 shows schematically an electronic device suitable for employing embodiments of the invention;

[0027] Figure 7 shows schematically a user equipment suitable for employing embodiments of the invention;

[0028] Figure 8 further shows schematically electronic devices suitable for employing embodiments of the invention connected using wireless and wired network connections;

[0029] Figure 9 shows a schematic diagram of an example multimedia communication system within which various embodiments may be implemented.DETAILED DESCRIPTON OF SOME EXAMPLE EMBODIMENTS

[0030] Video codec consists of an encoder that transforms the input video into a compressed representation suited for storage / transmission and a decoder that can uncompress the compressed video representation back into a viewable form. A video encoder and / or a video decoder may also be separate from each other, i.e. need not form a codec. Typically, an encoder discards some information in the original video sequence in order to represent the video in a more compact form (that is, at lower bitrate).

[0031] Typical hybrid video encoders, for example many encoder implementations of ITU-T H.263 and H.264, encode the video information in two phases. Firstly, pixel values in a certain picture area (or “block”) are predicted for example by motion compensation means (finding and indicating an area in one of the previously coded video frames that corresponds closely to theblock being coded) or by spatial means (using already reconstructed pixel values within the currently coded frame in a specified manner). Secondly the prediction error, i.e. the difference between the predicted block of pixels and the original block of pixels, is coded. This is typically done by transforming the difference in pixel values using a specified transform (e.g. Discrete Cosine Transform (DCT) or a variant of it), quantizing the coefficients and entropy coding the quantized coefficients. By varying the fidelity of the quantization process, encoder can control the balance between the accuracy of the pixel representation (picture quality) and size of the resulting coded video representation (file size or transmission bitrate).

[0032] In temporal prediction, the sources of prediction are previously decoded pictures (a.k.a. reference pictures). In intra block copy (IBC; a.k.a. intra-block-copy prediction) or intra template (intraTMP) methods, prediction is applied similarly to temporal prediction, but the reference picture is the current picture and only previously decoded samples can be referred in the prediction process. Inter-layer or inter-view prediction may be applied similarly to temporal prediction, but the reference picture is a decoded picture from another scalable layer or from another view, respectively. In some cases, inter prediction may refer to temporal prediction only, while in other cases inter prediction may refer collectively to temporal prediction and any of intra block copy, inter-layer prediction, and inter-view prediction provided that they are performed with the same or similar process than temporal prediction. Inter prediction or temporal prediction may sometimes be referred to as motion compensation or motion-compensated prediction.

[0033] Motion compensation can be performed either with full sample or sub-sample accuracy. In the case of full sample accurate motion compensation, motion can be represented as a motion vector with integer values for horizontal and vertical displacement and the motion compensation process effectively copies samples from the reference picture using those displacements. In the case of sub-sample accurate motion compensation, motion vectors are represented by fractional or decimal values for the horizontal and vertical components of the motion vector. In the case a motion vector is referring to a non-integer position in the reference picture, a sub-sample interpolation process is typically invoked to calculate predicted sample values based on the reference samples and the selected sub-sample position. The sub-sample interpolation process typically consists of horizontal filtering compensating for horizontal offsets with respect to full sample positions followed by vertical filtering compensating for verticaloffsets with respect to full sample positions. However, the vertical processing can also be done before horizontal processing in some environments.

[0034] Inter prediction, which may also be referred to as temporal prediction, motion compensation, or motion-compensated prediction, reduces temporal redundancy. In inter prediction the sources of prediction are previously decoded pictures. Intra prediction utilizes the fact that adjacent pixels, or other already reconstructed pixels within the same picture, are likely to be correlated to the pixels in a block. Intra prediction can be performed in spatial or transform domain, i.e., either sample values or transform coefficients can be predicted. Intra prediction is typically exploited in intra coding, where no inter prediction is applied.

[0035] One outcome of the coding procedure is a set of coding parameters, such as motion vectors and quantized transform coefficients. Many parameters can be entropy-coded more efficiently if they are predicted first from spatially or temporally neighboring parameters. For example, a motion vector may be predicted from spatially adjacent motion vectors and only the difference relative to the motion vector predictor may be coded. Prediction of coding parameters and intra prediction may be collectively referred to as in-picture prediction.

[0036] Figs, la and lb show an encoder and a decoder suitable for employing embodiments of the invention. A video codec consists of an encoder that transforms an input video into a compressed representation suited for storage / transmission and a decoder that can decompress the compressed video representation back into a viewable form. Typically, the encoder discards and / or loses some information in the original video sequence in order to represent the video in a more compact form (that is, at lower bitrate). An example of an encoding process is illustrated in Figure la. Figure la illustrates an image to be encoded (In); a predicted representation of an image block (P'n); a prediction error signal (Dn); a reconstructed prediction error signal (D'n); a preliminary reconstructed image (I'n); a final reconstructed image (R'n); a transform (T) and inverse transform (T-1); a quantization (Q) and inverse quantization (Q1); entropy encoding (E); a reference frame memory (RFM); inter prediction (Pinter); intra prediction (Pintra); mode selection (MS) and filtering (F).

[0037] An example of a decoding process is illustrated in Figure lb. Figure lb illustrates a predicted representation of an image block (P'n); a reconstructed prediction error signal (D'n); a preliminary reconstructed image (I'n); a final reconstructed image (R'n); an inverse transform (T‘1); an inverse quantization (Q1); an entropy decoding (E ); a reference frame memory (RFM); a prediction (either inter or intra) (P); and filtering (F).

[0038] Many hybrid video encoders encode the video information in two phases. Firstly pixel values in a certain picture area (or “block”) are predicted for example by motion compensation means (finding and indicating an area in one of the previously coded video frames that corresponds closely to the block being coded) or by spatial means (using the pixel values around the block to be coded in a specified manner). Secondly the prediction error, i.e. the difference between the predicted block of pixels and the original block of pixels, is coded. This is typically done by transforming the difference in pixel values using a specified transform (e.g. Discrete Cosine Transform (DCT) or a variant of it), quantizing the coefficients and entropy coding the quantized coefficients. By varying the fidelity of the quantization process, encoder can control the balance between the accuracy of the pixel representation (picture quality) and size of the resulting coded video representation (file size or transmission bitrate). Video codecs may also provide a transform skip mode, which the encoders may choose to use. In the transform skip mode, the prediction error is coded in a sample domain, for example by deriving a sample-wise difference value relative to certain adjacent samples and coding the sample-wise difference value with an entropy coder.

[0039] Entropy coding / decoding may be performed in many ways. For example, contextbased coding / decoding may be applied, where in both the encoder and the decoder modify the context state of a coding parameter based on previously coded / decoded coding parameters. Context-based coding may for example be context adaptive binary arithmetic coding (CABAC) or context-based variable length coding (CAVLC) or any similar entropy coding. Entropy coding / decoding may alternatively or additionally be performed using a variable length coding scheme, such as Huffman coding / decoding or Exp-Golomb coding / decoding. Decoding of coding parameters from an entropy-coded bitstream or codewords may be referred to as parsing.

[0040] The phrase along the bitstream (e.g. indicating along the bitstream) may be defined to refer to out-of-band transmission, signalling, or storage in a manner that the out-of-band data is associated with the bitstream. The phrase decoding along the bitstream or alike may refer to decoding the referred out-of-band data (which may be obtained from out-of-band transmission, signalling, or storage) that is associated with the bitstream. For example, an indication along the bitstream may refer to metadata in a container file that encapsulates the bitstream.

[0041] The H.264 / AVC standard was developed by the Joint Video Team (JVT) of the Video Coding Experts Group (VCEG) of the Telecommunications Standardization Sector of International Telecommunication Union (ITU-T) and the Moving Picture Experts Group (MPEG) of International Organisation for Standardization (ISO) / International Electrotechnical Commission (IEC). The H.264 / AVC standard is published by both parent standardization organizations, and it is referred to as ITU-T Recommendation H.264 and ISO / IEC International Standard 14496-10, also known as MPEG-4 Part 10 Advanced Video Coding (AVC). There have been multiple versions of the H.264 / AVC standard, integrating new extensions or features to the specification. These extensions include Scalable Video Coding (SVC) and Multiview Video Coding (MVC).

[0042] Version 1 of the High Efficiency Video Coding (H.265 / HEVC a.k.a. HEVC) standard was developed by the Joint Collaborative Team - Video Coding (JCT-VC) of VCEG and MPEG. The standard was published by both parent standardization organizations, and it is referred to as ITU-T Recommendation H.265 and ISO / IEC International Standard 23008-2, also known as MPEG-H Part 2 High Efficiency Video Coding (HEVC). Later versions of H.265 / HEVC included scalable, multiview, fidelity range, three-dimensional, and screen content coding extensions which may be abbreviated SHVC, MV-HEVC, REXT, 3D-HEVC, and SCC, respectively.

[0043] Versatile Video Coding (VVC) (MPEG-I Part 3), a.k.a. ITU-T H.266, is a video compression standard developed by the Joint Video Experts Team (JVET) of the Moving Picture Experts Group (MPEG), (formally ISO / IEC JTC1 SC29 WG11) and Video Coding Experts Group (VCEG) of the International Telecommunication Union (ITU) to be the successor to HEVC / H.265.

[0044] Some key definitions, bitstream and coding structures, and concepts of H.264 / AVC, HEVC and VVC are described in this section for providing background for a video encoder, decoder, encoding method, decoding method, and a bitstream structure, wherein the embodiments may be implemented. Some of the key definitions, bitstream and coding structures, and concepts of H.264 / AVC, HEVC and WC are the same - hence, they are described below jointly.

[0045] Similarly to many earlier video coding standards, the bitstream syntax and semantics as well as the decoding process for error-free bitstreams are specified in H.264 / AVC, HEVC andWC. The encoding process is not specified, but encoders must generate conforming bitstreams. Bitstream and decoder conformance can be verified with the Hypothetical Reference Decoder (HRD). The standards contain coding tools that help in coping with transmission errors and losses, but the use of the tools in encoding is optional and no decoding process has been specified for erroneous bitstreams.

[0046] The elementary unit for the input to an H.264 / AVC or HEVC encoder and the output of an H.264 / AVC or HEVC decoder, respectively, is a picture. A picture given as an input to an encoder may also be referred to as a source picture, and a picture decoded by a decoded may be referred to as a decoded picture.

[0047] The source and decoded pictures are each comprised of one or more sample arrays, such as one of the following sets of sample arrays:Luma (Y) only (monochrome).Luma and two chroma (YCbCr or YCgCo).Green, Blue and Red (GBR, also known as RGB).Arrays representing other unspecified monochrome or tri-stimulus color samplings (for example, YZX, also known as XYZ).

[0048] Typically, video is encoded in YUV or YCbCr color space as that is found to reflect some characteristics of human visual system and allows using lower quality representation for Cb and Cr channels as human perception is less sensitive to the chrominance fidelity those channels represent.

[0049] In H.264 / AVC and HEVC, a picture may either be a frame or a field. A frame comprises a matrix of luma samples and possibly the corresponding chroma samples. A field is a set of alternate sample rows of a frame and may be used as encoder input, when the source signal is interlaced. Chroma sample arrays may be absent (and hence monochrome sampling may be in use) or chroma sample arrays may be subsampled when compared to luma sample arrays.Chroma formats may be summarized as follows:In monochrome sampling there is only one sample array, which may be nominally considered the luma array.In 4:2:0 sampling, each of the two chroma arrays has half the height and half the width of the luma array.In 4:2:2 sampling, each of the two chroma arrays has the same height and half the width of the luma array.In 4:4:4 sampling when no separate color planes are in use, each of the two chroma arrays has the same height and width as the luma array.

[0050] In H.264 / AVC and HEVC, it is possible to code sample arrays as separate color planes into the bitstream and respectively decode separately coded color planes from the bitstream. When separate color planes are in use, each one of them is separately processed (by the encoder and / or the decoder) as a picture with monochrome sampling.

[0051] A partitioning may be defined as a division of a set into subsets such that each element of the set is in exactly one of the subsets.

[0052] When describing the operation of HEVC or WC encoding and / or decoding, the following terms may be used. A coding block may be defined as an NxN block of samples for some value of N such that the division of a coding tree block into coding blocks is a partitioning. A coding tree block (CTB) may be defined as an NxN block of samples for some value of N such that the division of a component into coding tree blocks is a partitioning. A coding tree unit (CTU) may be defined as a coding tree block of luma samples, two corresponding coding tree blocks of chroma samples of a picture that has three sample arrays, or a coding tree block of samples of a monochrome picture or a picture that is coded using three separate color planes and syntax structures used to code the samples. A coding unit (CU) may be defined as a coding block of luma samples, two corresponding coding blocks of chroma samples of a picture that has three sample arrays, or a coding block of samples of a monochrome picture or a picture that is coded using three separate color planes and syntax structures used to code the samples. A CU with the maximum allowed size may be named as LCU (largest coding unit) or coding tree unit (CTU) and the video picture is divided into non-overlapping LCUs.

[0053] A CU consists of one or more prediction units (PU) defining the prediction process for the samples within the CU and one or more transform units (TU) defining the prediction error coding process for the samples in the said CU. Typically, a CU consists of a square block of samples with a size selectable from a predefined set of possible CU sizes. Each PU and TU can be further split into smaller PUs and TUs in order to increase granularity of the prediction and prediction error coding processes, respectively. Each PU has prediction information associated with it defining what kind of a prediction is to be applied for the pixels within that PU (e.g.motion vector information for inter predicted PUs and intra prediction information for intra predicted PUs).

[0054] Each TU can be associated with information describing the prediction error decoding process for the samples within the said TU (including e.g. DCT coefficient information). It is typically signalled at CU level whether prediction error coding is applied or not for each CU. In the case there is no prediction error residual associated with the CU, it can be considered there are no TUs for the said CU. The division of the image into CUs, and division of CUs into PUs and TUs is typically signalled in the bitstream allowing the decoder to reproduce the intended structure of these units.

[0055] To be able to utilize parallel processing, images can be split into independently codable and decodable image segments (slices or tiles). In HEVC, a picture can be partitioned in tiles, which are rectangular and contain an integer number of LCUs. In HEVC, the partitioning to tiles forms a regular grid, where heights and widths of tiles differ from each other by one LCU at the maximum. In HEVC, a slice is defined to be an integer number of coding tree units contained in one independent slice segment and all subsequent dependent slice segments (if any) that precede the next independent slice segment (if any) within the same access unit. In HEVC, a slice segment is defined to be an integer number of coding tree units ordered consecutively in the tile scan and contained in a single NAL unit. The division of each picture into slice segments is a partitioning. In HEVC, an independent slice segment is defined to be a slice segment for which the values of the syntax elements of the slice segment header are not inferred from the values for a preceding slice segment, and a dependent slice segment is defined to be a slice segment for which the values of some syntax elements of the slice segment header are inferred from the values for the preceding independent slice segment in decoding order. In HEVC, a slice header is defined to be the slice segment header of the independent slice segment that is a current slice segment or is the independent slice segment that precedes a current dependent slice segment, and a slice segment header is defined to be a part of a coded slice segment containing the data elements pertaining to the first or all coding tree units represented in the slice segment. The CUs are scanned in the raster scan order of LCUs within tiles or within a picture, if tiles are not in use. Within an LCU, the CUs have a specific scan order.

[0056] The decoder reconstructs the output video by applying prediction means similar to the encoder to form a predicted representation of the pixel blocks (using the motion or spatialinformation created by the encoder and stored in the compressed representation) and prediction error decoding (inverse operation of the prediction error coding recovering the quantized prediction error signal in spatial pixel domain). After applying prediction and prediction error decoding means the decoder sums up the prediction and prediction error signals (pixel values) to form the output video frame. The decoder (and encoder) can also apply additional filtering means to improve the quality of the output video before passing it for display and / or storing it as prediction reference for the forthcoming frames in the video sequence.

[0057] Instead, or in addition to approaches utilizing sample value prediction and transform coding for indicating the coded sample values, a color palette based coding can be used. Palette based coding refers to a family of approaches for which a palette, i.e. a set of colors and associated indexes, is defined and the value for each sample within a coding unit is expressed by indicating its index in the palette. Palette based coding can typically achieve good coding efficiency in coding units with a relatively small number of colors (such as image areas which are representing computer screen content, like text or simple graphics). In order to improve the coding efficiency of palette coding different kinds of palette index prediction approaches can be utilized, or the palette indexes can be run-length coded to be able to represent larger homogenous image areas efficiently. Also, in the case the CU contains sample values that are not recurring within the CU, escape coding can be utilized. Escape coded samples are transmitted without referring to any of the palette indexes. Instead, their values are indicated individually for each escape coded sample.

[0058] The filtering may for example include one more of the following: deblocking, sample adaptive offset (SAG), and / or adaptive loop filtering (ALF). H.264 / AVC includes a deblocking, whereas HEVC includes both deblocking and SAG.

[0059] In typical video codecs the motion information is indicated with motion vectors associated with each motion compensated image block, such as a prediction unit. Each of these motion vectors represents the displacement of the image block in the picture to be coded (in the encoder side) or decoded (in the decoder side) and the prediction source block in one of the previously coded or decoded pictures. In order to represent motion vectors efficiently those are typically coded differentially with respect to block specific predicted motion vectors. In typical video codecs the predicted motion vectors are created in a predefined way, for example calculating the median of the encoded or decoded motion vectors of the adjacent blocks. Anotherway to create motion vector predictions is to generate a list of candidate predictions from adjacent blocks and / or co-located blocks in temporal reference pictures and signalling the chosen candidate as the motion vector predictor. In addition to predicting the motion vector values, it can be predicted which reference picture(s) are used for motion-compensated prediction and this prediction information may be represented for example by a reference index of previously coded / decoded picture. The reference index is typically predicted from adjacent blocks and / or co-located blocks in temporal reference picture. Moreover, typical high efficiency video codecs employ an additional motion information coding / decoding mechanism, often called merging / merge mode, where all the motion field information, which includes motion vector and corresponding reference picture index for each available reference picture list, is predicted and used without any modification / correction. Similarly, predicting the motion field information is carried out using the motion field information of adjacent blocks and / or co-located blocks in temporal reference pictures and the used motion field information is signalled among a list of motion field candidate list filled with motion field information of available adjacent / co-located blocks.

[0060] In typical video codecs the prediction residual after motion compensation is first transformed with a transform kernel (like DCT) and then coded. The reason for this is that often there still exists some correlation among the residual and transform can in many cases help reduce this correlation and provide more efficient coding.

[0061] Video coding standards and specifications may allow encoders to divide a coded picture to coded slices or alike. In-picture prediction is typically disabled across slice boundaries. Thus, slices can be regarded as a way to split a coded picture to independently decodable pieces. In H.264 / AVC and HEVC, in-picture prediction may be disabled across slice boundaries. Thus, slices can be regarded as a way to split a coded picture into independently decodable pieces, and slices are therefore often regarded as elementary units for transmission. In many cases, encoders may indicate in the bitstream which types of in-picture prediction are turned off across slice boundaries, and the decoder operation takes this information into account for example when concluding which prediction sources are available. For example, samples from a neighboring CU may be regarded as unavailable for intra prediction, if the neighboring CU resides in a different slice.

[0062] An elementary unit for the output of an H.264 / AVC or HEVC encoder and the input of an H.264 / AVC or HEVC decoder, respectively, is a Network Abstraction Layer (NAL) unit. For transport over packet-oriented networks or storage into structured files, NAL units may be encapsulated into packets or similar structures. A bytestream format has been specified in H.264 / AVC and HEVC for transmission or storage environments that do not provide framing structures. The bytestream format separates NAL units from each other by attaching a start code in front of each NAL unit. To avoid false detection of NAL unit boundaries, encoders run a byte-oriented start code emulation prevention algorithm, which adds an emulation prevention byte to the NAL unit payload if a start code would have occurred otherwise. In order to enable straightforward gateway operation between packet- and stream-oriented systems, start code emulation prevention may always be performed regardless of whether the bytestream format is in use or not. A NAL unit may be defined as a syntax structure containing an indication of the type of data to follow and bytes containing that data in the form of an RBSP interspersed as necessary with emulation prevention bytes. A raw byte sequence payload (RBSP) may be defined as a syntax structure containing an integer number of bytes that is encapsulated in a NAL unit. An RBSP is either empty or has the form of a string of data bits containing syntax elements followed by an RBSP stop bit and followed by zero or more subsequent bits equal to 0.

[0063] NAL units consist of a header and pay load. In H.264 / AVC and HEVC, the NAL unit header indicates the type of the NAL unit.

[0064] In HEVC, a two-byte NAL unit header is used for all specified NAL unit types. The NAL unit header contains one reserved bit, a six-bit NAL unit type indication, a three-bit nuh_temporal_id_plusl indication for temporal level (may be required to be greater than or equal to 1) and a six-bit nuh layer id syntax element. The temporal ! d_plusl syntax element may be regarded as a temporal identifier for the NAL unit, and a zero-based Temporalld variable may be derived as follows: Temporalld = temporal ! d_plusl - 1. The abbreviation TID may be used to interchangeably with the Temporalld variable. Temporalld equal to 0 corresponds to the lowest temporal level. The value of temporal_id_plusl is required to be non-zero in order to avoid start code emulation involving the two NAL unit header bytes. The bitstream created by excluding all VCL NAL units having a Temporalld greater than or equal to a selected value and including all other VCL NAL units remains conforming. Consequently, a picture having Temporalld equal to tid value does not use any picture having a Temporalld greater than tid value as inter predictionreference. A sub-layer or a temporal sub-layer may be defined to be a temporal scalable layer (or a temporal layer, TL) of a temporal scalable bitstream, consisting of VCL NAL units with a particular value of the Temporalld variable and the associated non-VCL NAL units.nuh layer id can be understood as a scalability layer identifier.

[0065] NAL units can be categorized into Video Coding Layer (VCL) NAL units and non-VCL NAL units. VCL NAL units are typically coded slice NAL units. In HEVC, VCL NAL units contain syntax elements representing one or more CU.

[0066] A non-VCL NAL unit may be for example one of the following types: a sequence parameter set, a picture parameter set, a supplemental enhancement information (SEI) NAL unit, an access unit delimiter, an end of sequence NAL unit, an end of bitstream NAL unit, or a filler data NAL unit. Parameter sets may be needed for the reconstruction of decoded pictures, whereas many of the other non-VCL NAL units are not necessary for the reconstruction of decoded sample values.

[0067] Parameters that remain unchanged through a coded video sequence may be included in a sequence parameter set. In addition to the parameters that may be needed by the decoding process, the sequence parameter set may optionally contain video usability information (VUI), which includes parameters that may be important for buffering, picture output timing, rendering, and resource reservation. In HEVC a sequence parameter set RBSP includes parameters that can be referred to by one or more picture parameter set RBSPs or one or more SEI NAL units containing a buffering period SEI message. A picture parameter set contains such parameters that are likely to be unchanged in several coded pictures. A picture parameter set RBSP may include parameters that can be referred to by the coded slice NAL units of one or more coded pictures.

[0068] In HEVC, a video parameter set (VPS) may be defined as a syntax structure containing syntax elements that apply to zero or more entire coded video sequences as determined by the content of a syntax element found in the SPS referred to by a syntax element found in the PPS referred to by a syntax element found in each slice segment header.

[0069] A video parameter set RBSP may include parameters that can be referred to by one or more sequence parameter set RBSPs.

[0070] The relationship and hierarchy between video parameter set (VPS), sequence parameter set (SPS), and picture parameter set (PPS) may be described as follows. VPS resides one level above SPS in the parameter set hierarchy and in the context of scalability and / or 3Dvideo. VPS may include parameters that are common for all slices across all (scalability or view) layers in the entire coded video sequence. SPS includes the parameters that are common for all slices in a particular (scalability or view) layer in the entire coded video sequence, and may be shared by multiple (scalability or view) layers. PPS includes the parameters that are common for all slices in a particular layer representation (the representation of one scalability or view layer in one access unit) and are likely to be shared by all slices in multiple layer representations.

[0071] VPS may provide information about the dependency relationships of the layers in a bitstream, as well as many other information that are applicable to all slices across all (scalability or view) layers in the entire coded video sequence. VPS may be considered to comprise two parts, the base VPS and a VPS extension, where the VPS extension may be optionally present.

[0072] Out-of-band transmission, signaling or storage can additionally or alternatively be used for other purposes than tolerance against transmission errors, such as ease of access or session negotiation. For example, a sample entry of a track in a file conforming to the ISO Base Media File Format may comprise parameter sets, while the coded data in the bitstream is stored elsewhere in the file or in another file. The phrase along the bitstream (e.g. indicating along the bitstream) or along a coded unit of a bitstream (e.g. indicating along a coded tile) may be used in claims and described embodiments to refer to out-of-band transmission, signaling, or storage in a manner that the out-of-band data is associated with the bitstream or the coded unit, respectively. The phrase decoding along the bitstream or along a coded unit of a bitstream or alike may refer to decoding the referred out-of-band data (which may be obtained from out-of-band transmission, signaling, or storage) that is associated with the bitstream or the coded unit, respectively.

[0073] A SEI NAL unit may contain one or more SEI messages, which are not required for the decoding of output pictures but may assist in related processes, such as picture output timing, rendering, error detection, error concealment, and resource reservation.

[0074] A coded picture is a coded representation of a picture.

[0075] In HEVC, a coded picture may be defined as a coded representation of a picture containing all coding tree units of the picture. In HEVC, an access unit (AU) may be defined as a set of NAL units that are associated with each other according to a specified classification rule, are consecutive in decoding order, and contain at most one picture with any specific value of nuh layer id. In addition to containing the VCL NAL units of the coded picture, an access unitmay also contain non-VCL NAL units. Said specified classification rule may for example associate pictures with the same output time or picture output count value into the same access unit.

[0076] A bitstream may be defined as a sequence of bits, in the form of a NAL unit stream or a byte stream, that forms the representation of coded pictures and associated data forming one or more coded video sequences. A first bitstream may be followed by a second bitstream in the same logical channel, such as in the same file or in the same connection of a communication protocol. An elementary stream (in the context of video coding) may be defined as a sequence of one or more bitstreams. The end of the first bitstream may be indicated by a specific NAL unit, which may be referred to as the end of bitstream (EOB) NAL unit and which is the last NAL unit of the bitstream. In HEVC and its current draft extensions, the EOB NAL unit is required to have nuh layer id equal to 0.

[0077] In H.264 / AVC, a coded video sequence is defined to be a sequence of consecutive access units in decoding order from an IDR access unit, inclusive, to the next IDR access unit, exclusive, or to the end of the bitstream, whichever appears earlier.

[0078] In HEVC, a coded video sequence (CVS) may be defined, for example, as a sequence of access units that consists, in decoding order, of an IRAP access unit with NoRaslOutputFlag equal to 1, followed by zero or more access units that are not IRAP access units with NoRaslOutputFlag equal to 1, including all subsequent access units up to but not including any subsequent access unit that is an IRAP access unit with NoRaslOutputFlag equal to 1. An IRAP access unit may be defined as an access unit in which the base layer picture is an IRAP picture. The value of NoRaslOutputFlag is equal to 1 for each IDR picture, each BLA picture, and each IRAP picture that is the first picture in that particular layer in the bitstream in decoding order, is the first IRAP picture that follows an end of sequence NAL unit having the same value of nuh layer id in decoding order. There may be means to provide the value of HandleCraAsBlaFlag to the decoder from an external entity, such as a player or a receiver, which may control the decoder. HandleCraAsBlaFlag may be set to 1 for example by a player that seeks to a new position in a bitstream or tunes into a broadcast and starts decoding and then starts decoding from a CRA picture. When HandleCraAsBlaFlag is equal to 1 for a CRA picture, the CRA picture is handled and decoded as if it were a BLA picture.

[0079] In HEVC, a coded video sequence may additionally or alternatively (to the specification above) be specified to end, when a specific NAL unit, which may be referred to as an end of sequence (EOS) NAL unit, appears in the bitstream and has nuh layer id equal to 0.

[0080] A group of pictures (GOP) and its characteristics may be defined as follows. A GOP can be decoded regardless of whether any previous pictures were decoded. An open GOP is such a group of pictures in which pictures preceding the initial intra picture in output order might not be correctly decodable when the decoding starts from the initial intra picture of the open GOP. In other words, pictures of an open GOP may refer (in inter prediction) to pictures belonging to a previous GOP. An HEVC decoder can recognize an intra picture starting an open GOP, because a specific NAL unit type, CRA NAL unit type, may be used for its coded slices. A closed GOP is such a group of pictures in which all pictures can be correctly decoded when the decoding starts from the initial intra picture of the closed GOP. In other words, no picture in a closed GOP refers to any pictures in previous GOPs. In H.264 / AVC and HEVC, a closed GOP may start from an IDR picture. In HEVC a closed GOP may also start from a BLA W RADL or a BLA N LP picture. An open GOP coding structure is potentially more efficient in the compression compared to a closed GOP coding structure, due to a larger flexibility in selection of reference pictures.

[0081] A Decoded Picture Buffer (DPB) may be used in the encoder and / or in the decoder. There are two reasons to buffer decoded pictures, for references in inter prediction and for reordering decoded pictures into output order. As H.264 / AVC and HEVC provide a great deal of flexibility for both reference picture marking and output reordering, separate buffers for reference picture buffering and output picture buffering may waste memory resources. Hence, the DPB may include a unified decoded picture buffering process for reference pictures and output reordering. A decoded picture may be removed from the DPB when it is no longer used as a reference and is not needed for output.

[0082] In many coding modes of H.264 / AVC and HEVC, the reference picture for inter prediction is indicated with an index to a reference picture list. The index may be coded with variable length coding, which usually causes a smaller index to have a shorter value for the corresponding syntax element. In H.264 / AVC and HEVC, two reference picture lists (reference picture list 0 and reference picture list 1) are generated for each bi-predictive (B) slice, and one reference picture list (reference picture list 0) is formed for each inter-coded (P) slice.

[0083] Many coding standards, including H.264 / AVC and HEVC, may have decoding process to derive a reference picture index to a reference picture list, which may be used to indicate which one of the multiple reference pictures is used for inter prediction for a particular block. A reference picture index may be coded by an encoder into the bitstream is some inter coding modes or it may be derived (by an encoder and a decoder) for example using neighboring blocks in some other inter coding modes.

[0084] HEVC comprises 35 intra prediction modes, including a DC, a planar, and 33 angular (directional) prediction modes. The DC and the planar mode are targeted at flat areas (i.e., the DC mode representing a block whose pixel values are constant across the block) or areas with few structure (i.e., the planar mode representing a block with pixel values gradually changing with a small planar gradient). The angular modes, in turn, provide directional prediction in a very granular way.

[0085] Motion parameter types or motion information may include but are not limited to one or more of the following types:an indication of a prediction type (e.g. intra prediction, uni-prediction, bi-prediction) and / or a number of reference pictures;an indication of a prediction direction, such as inter (a.k.a. temporal) prediction, interlayer prediction, inter- view prediction, view synthesis prediction (VSP), and intercomponent prediction (which may be indicated per reference picture and / or per prediction type and where in some embodiments inter-view and view-synthesis prediction may be jointly considered as one prediction direction) and / oran indication of a reference picture type, such as a short-term reference picture and / or a long-term reference picture and / or an inter-layer reference picture (which may be indicated e.g. per reference picture)a reference index to a reference picture list and / or any other identifier of a reference picture (which may be indicated e.g. per reference picture and the type of which may depend on the prediction direction and / or the reference picture type and which may be accompanied by other relevant pieces of information, such as the reference picture list or alike to which reference index applies);a horizontal motion vector component (which may be indicated e.g. per prediction block or per reference index or alike);a vertical motion vector component (which may be indicated e.g. per prediction block or per reference index or alike);one or more parameters, such as picture order count difference and / or a relative camera separation between the picture containing or associated with the motion parameters and its reference picture, which may be used for scaling of the horizontal motion vector component and / or the vertical motion vector component in one or more motion vector prediction processes (where said one or more parameters may be indicated e.g. per each reference picture or each reference index or alike);coordinates of a block to which the motion parameters and / or motion information applies, e.g. coordinates of the top-left sample of the block in luma sample units;extents (e.g. a width and a height) of a block to which the motion parameters and / or motion information applies.

[0086] In comparison to the previous video coding standards, Versatile Video Codec (H.266 / WC) introduces a plurality of new coding tools, such as the following:• Intra prediction- 67 intra mode with wide angles mode extension- Block size and mode dependent 4 tap interpolation filter- Position dependent intra prediction combination (PDPC)- Cross component linear model intra prediction (CCLM)- Multi-reference line intra prediction- Intra sub-partitions- Weighted intra prediction with matrix multiplication• Inter-picture prediction- Block motion copy with spatial, temporal, history-based, and pairwise average merging candidates- Affine motion inter prediction- sub-block based temporal motion vector prediction- Adaptive motion vector resolution- 8x8 block-based motion compression for temporal motion prediction- High precision (1 / 16 pel) motion vector storage and motion compensation with 8- tap interpolation filter for luma component and 4-tap interpolation filter for chroma component- Triangular partitions- Combined intra and inter prediction- Merge with MVD (MMVD)- Symmetrical MVD coding- Bi-directional optical flow- Decoder side motion vector refinement- Bi-prediction with CU-level weight• Transform, quantization and coefficients coding- Multiple primary transform selection with DCT2, DST7 and DCT8 - Secondary transform for low frequency zone- Sub-block transform for inter predicted residual- Dependent quantization with max QP increased from 51 to 63- Transform coefficient coding with sign data hiding- Transform skip residual coding• Entropy Coding- Arithmetic coding engine with adaptive double windows probability update • In loop filter- In-loop reshaping- Deblocking filter with strong longer filter- Sample adaptive offset- Adaptive Loop Filter• Screen content coding:- Current picture referencing with reference region restriction• 360-degree video coding- Horizontal wrap-around motion compensation• High-level syntax and parallel processing- Reference picture management with direct reference picture list signalling - Tile groups with rectangular shape tile groups

[0087] Regarding intra prediction, different approaches involving blending of multiple intra predictions together have been introduced. For example, the ECM software model (JVET-AK2025: “Algorithm description of Enhanced Compression Model 16 (ECM 16)”, January 2025) describes at least two such approaches, namely the decoder side intra mode derivation (DIMD) and a fusion for template-based intra mode derivation (TIMD).

[0088] The decoder-side intra mode derivation (DIMD) techniques have been shown to have a beneficial impact on state-of-the-art video codecs. In DIMD, the intra mode of the current block is determined using directionality of the texture of the neighboring reconstructed samples located in a template region at top, top-left, and left sides of the current block. In DIMD, two (or more) intra modes and their corresponding weight factors are derived first. Then, predictors are generated for the intra modes, and also for the Planar mode. The final prediction for the current block is generated by combining these predictors by means of sample-wise or uniform weighting, using the derived weights.

[0089] In DIMD, directionality of texture is derived for each neighboring sample in the template region, using 3x3 neighboring samples of that sample. The derivation is performed in several steps. First, the horizontal and vertical direction strengths (Dx and Dy) are calculated using 3x3 neighboring samples of the training sample. The corresponding region on the Intra prediction mode (angle) is determined using sign of Dx and Dy. Following this, the ratio of Dx / Dy is calculated, and the corresponding angle index is determined using the ratio value and a table that maps the ratio to proper angle index. The final intra mode for said training sample is determined using the region and derived angle. The amplitude (or importance) of the intra mode is derived as the sum of absolute values of Dx and Dy.

[0090] The intra mode (corresponding to a given directionality) and its corresponding amplitude are derived as above for each training sample. These are then collected into a histogram of gradients, namely a histogram collecting for each intra mode the cumulative amplitude of all neighboring samples with the directionality. Finally, two or more intra modes are derived from the histogram of gradients, by finding the dominant intra modes, i.e. the modes corresponding to the highest amplitudes in the histogram. These modes are used to compute different predictors. Finally, these predictors are blended together to compute the final DIMD prediction for the current block. The blending may be performed using weighted average. The weights of each DIMD intra mode are determined based on the histogram amplitudes, where higher amplitudes may correspond to higher weights. A fixed weight is typically assigned to theplanar mode, which is blended together with the determined intra modes to form the final DIMD prediction.

[0091] Another intra prediction technique using blending of predictors is called a fusion for template-based intra mode derivation (TIMD). Therein, for each intra prediction mode in most probable modes (MPM), a sum of absolute Hadamard transformed difference (SATD) between the prediction and reconstruction samples of the template is calculated. Position dependent intra prediction combination (PDPC) is included in the derivation of the HMD modes. First two intra prediction modes with the minimum SATD are selected as the TIMD modes. These two TIMD modes are fused, i.e. blended, with the weights after applying PDPC process, and such weighted intra prediction is used to code the current CU.

[0092] Intra prediction can be performed using different reference lines, where each reference line corresponds to a set of already decoded samples at a given distance from the current block. Each reference line is identified by a given Multiple Reference Line (MRL) index, where for instance MRL 0 corresponds to using samples that are directly adjacent to the current block, and so on where each increasing MRL index corresponds to increasing the distance from the current block in the above and left directions.

[0093] Different techniques have been proposed to obtain a prediction with a MRL different than 0. A simple approach consists in signalling an indication of the MRL index together with the intra prediction mode.

[0094] Alternatively, Template-based Multiple Reference Line (TMRL) operates by analyzing a template around the current block in order to determine a prediction for the current block. In TMRL, one line of samples above and on the left of the current block are used as template. A number of possible intra-prediction modes as well as a list of possible non-zero MRL candidates are considered. For each pair of intra-prediction mode (IM) and MRL index candidate, a prediction is computed for the samples in the template. The pairs of IMs and MRLs are sorted in a list based on the template costs. Finally, an index is signalled and then parsed at the decoder side to extract the correct candidate from the list. The decoder will then produce a prediction for the current block using the corresponding MRL index and IM. In ECM, a list of 20 candidates is used.

[0095] For each TMRL candidate, a method referred to as “MRL Fusion” can also be used. MRL Fusion improves the intra-prediction for a current block by combining the intra predictorobtained using intra prediction mode IM and the given MRL index L, with another predictor obtained using the same IM and a MRL index equal to L + 1. The two predictors are blended together using fixed weights set to 3 / 4 and 1 / 4 respectively. Usage of MRL Fusion is inferred based on the intra-prediction mode and the block size.

[0096] However, even though blending has been shown to be beneficial to improve intra prediction, ECM provides no intra-prediction methods that allow blending a number of predictors obtained with non-zero MRL indices, apart from MRL fusion, which only allows the restricted case of blending of two predictors with the same IM and consecutive MRL indices.

[0097] Now improved methods for sample prediction are introduced.

[0098] A method according to a first aspect is shown in Figure 2, where the method comprises determining (200) a current block of samples to be predicted; determining (202), for the current block, a template comprising a plurality of reconstructed samples, a list of candidate multiple reference line indices, and a list of candidate intra prediction modes; computing (204) template costs for a number of combinations of a reference line index extracted from the list of candidate multiple reference line indices and an intra prediction mode extracted from the list of candidate intra prediction modes; determining (206) two or more predictors based on the computed template costs; and forming (208) a predictor for the current block by blending the at least two predictors together.

[0099] Thus, in the method, a prediction for a given block is produced by blending two or more predictors, where the predictors are computed by determining a template formed of already reconstructed samples, determining a list of candidate multiple reference line indexes, determining a list of candidate intra prediction modes, and computing template costs for a plurality of pairs of a candidate multiple reference line index and a candidate intra prediction mode.

[0100] As an example, the predictors may be computed by determining two or more pairs of a multiple reference line index and an intra-prediction mode, where the multiple reference line indexes are determined from a list of candidate multiple reference line indexes and the intraprediction modes are determined from a list of candidate intra prediction modes, by computing a cost on a template for each candidate pair of a candidate reference line index and a candidate intra prediction mode.

[0101] It is noted that the term ‘blending’ is used herein to refer to combining a plurality of, i.e. two or more, predictors, such as predictors generated for intra modes, into a combined presentation. Blending may involve sample-wise, variable or uniform weighting of the plurality of predictors upon combining. Blending may also be referred to, for example, as fusing or merging.

[0102] In the following, various embodiments for the method are described.

[0103] A template can be considered formed of reconstructed samples. For example, these samples may be formed of one or more lines above and on the left of the current block. As an example, a region formed of one line of the same width as the current block formed of samples directly adjacent to the current block and located above the current block may be part of the template. Similarly, a region formed of one column of the same height as the current block formed of samples directly adjacent to the current block and located on the left of the current block may be part of the template. As another example, the region above the current block may be formed of multiple lines, each line of the same width as the current block. Moreover, the region on the left of the current block may be formed of multiple columns, each column of the same height as the current block. Figure 3 shows an example of a template formed of one line and one column of samples.

[0104] The size of the template may be determined adaptively. For example, the size of the template may be determined based on the current block size. As an example, a template size corresponding to two lines above the current block and two columns on the left of the current block may be used for a block with an area smaller or equal than a given threshold. As another example, a template size corresponding to four lines above the current block and four columns on the left of the current block may be used for a block with an area larger than a given threshold. Moreover, the number of columns on the left of the current block may be different than the number of lines above the current block. For example, the number of lines above the current block or the number of columns on the left of the current block may be determined based on the width or height of the current block.

[0105] For a given block, a set (or list) of candidate MRL indices (or MRLs) may be determined. A MRL index is used to refer to a particular line and column of reference samples at a given distance from the current block. Figure 4 shows an example of three MRLs at indices 1,3, and 5, which correspond to having respectively one, three or five lines / columns of samples between the reference samples and the current block.

[0106] According to an embodiment, the list of candidate multiple reference line indices is predetermined.

[0107] According to an embodiment, the method comprises determining the list of candidate multiple reference line indices based on one or more characteristics of the current block.

[0108] Thus, a predetermined list of candidate MRL indices may be used. As an example, the list (or set) of MRL indexes may be formed of indices {1, 3, 5, 7, 12}. As another example, the set may be formed of indices {1, 2, 4, 6, 10}. As another example, the set may depend on the size of the template.

[0109] The list (or set) may also be computed depending on characteristics of the current block. For example, the set may depend on the x and / or y coordinates of the current block, where the x coordinate of a block refers to the horizontal displacement of the top-left pixel in the block, with respect to the top-left pixel in the picture, and similarly the y coordinate refers to the vertical displacement of the top-left pixel in the block, with respect to the top-left pixel in the picture. As an example, the set may be determined in order to maximize the number of MRL lines that are smaller than or equal to the y coordinate of the current block.

[0110] The list of candidate MRL indices may be determined based on the characteristics of the current block at least according to the following examples. For example, the set of MRL indices may only include MRLs smaller or equal than the y coordinate in the block. As another example, the set of MRL indices may be first predetermined, and then MRL indices that are larger than or equal to the y component of the block may be replaced. As an example, a number of possible sets of MRL indices may be considered, where a different set may be used depending on the size of the current block. Therein, a set of MRL indices used for a small block may be formed of smaller MRL indices than a set of MRL indices used for a larger block.

[0111] The set of candidate MRL indices may be computed depending on the template size. As an example, if two lines of samples are considered in the template, then the set may be formed of MRL indexes larger than or equal to 2. Moreover, an exhaustive set of possible MRL indexes smaller or equal than a pre-determined maximum value may be considered. As an example, a maximum value set to 12 may be considered.

[0112] The list of candidate MRL indices may be determined based on the results of computing a TMRL list on the current block. For example, the list of candidate MRL indices may include the MRL indices that are in the TMRL list. As another example, the list of candidate MRL indices may exclude the MRL indices that are in the TMRL list.

[0113] According to an embodiment, the list of candidate intra-prediction modes is predetermined.

[0114] According to an embodiment, the method comprises determining the list of candidate intra-prediction modes based on one or more characteristics of the current block.

[0115] For a given block, also a set (or list) of candidate intra-prediction modes may be determined. The number of candidate intra-prediction modes may be predetermined.Alternatively, the number of candidate intra-prediction modes may be determined based on the size of the current block, or it may be determined based on other characteristics of the current block. The set of intra-prediction modes may be computed based on the intra-prediction modes used in neighbouring blocks. A Most-Probable Mode (MPM) list may be used to determine the set of intra-prediction modes. The set of candidate intra-prediction modes may be computed depending on the list of intra-prediction mode candidates used for a Template-based Multiple Reference Line (TMRL) mode. As an example, only intra-prediction modes that are not included among the candidate modes for TMRL may be included in the set. As an example, intraprediction mode directions that are similar to the candidate mode directions for TMRL may be included in the set. For example, directions obtained as + / - 1 of the direction of a mode used for TMRL may be included in the set. As yet another example, an exhaustive set of all possible intra-prediction modes may be used. As an example, the Planar mode and / or the DC mode may be excluded from the set.

[0116] According to an embodiment, the method comprises performing a template search for a plurality of combinations (or pairs) of a candidate multiple reference line and a candidate intra prediction mode; computing a template cost for each pair of a candidate multiple reference line and a candidate intra prediction mode; and sorting each pair of the candidate multiple reference line and the candidate intra prediction mode in a list of candidate pairs based on the template cost.

[0117] For a given block, a template search is performed, where the candidate intra prediction modes and candidate MRLs are tested. For each combination (or pair) of a candidate intraprediction mode and a candidate MRL, a prediction is performed to predict the samples in the template using the candidate intra-prediction mode and using the candidate MRL index. Then a template cost is computed based on the difference between the predicted samples and the reconstructed samples in the template. This may be repeated for a number of (possibly for all) pairs of a candidate intra prediction mode and a candidate MRL index, resulting in a template cost for each pair. The pairs of intra prediction mode and MRL index can therefore be sorted based on the template costs. As an example, the Sum of Absolute Distortions (SAD) can be used as template cost. As another example, the Sum of Absolute Transformed Differences (SATD) may be used as template cost. As an example, the SAD or SATD may be modified by means of a Mean Removal (MR) process. As an example, the pairs may be sorted in a list of pairs, from the pair resulting in lowest template cost to the pair resulting in highest template cost.

[0118] According to an embodiment, the method comprises selecting a set of pairs of a candidate multiple reference line and a candidate intra prediction mode from the sorted list of pairs; computing a predictor for each of the selected pairs in the set; and blending the predictors for each of the selected pairs to obtain a predictor for the current block.

[0119] According to an embodiment, the method comprises selecting a number of different sets of pairs, where an indication of the correct pair to use is included in or along a bitstream. The indication can then be extracted from or along the bitstream by the decoder. For example, a number of sets of pairs can be determined. Each set contains pairs of a candidate multiple reference line and a candidate intra prediction mode, which can be used to determine a predictor for the current block. The pairs in the set can be used to compute a set of predictors, which can then be blended together to form a prediction for the current block. A number of different sets of these predictors can be determined based on the sorted list of pairs. The decoder may determine which of these different sets to use based on information extracted from the bitstream. As an example, two sets of pairs may be computed based on the sorted list computed using the template costs.

[0120] Once the pairs are sorted in a list of candidate pairs, then a number of pairs can be extracted from this list, where for each pair a predictor is computed, and then the obtained predictors are blended together to form a prediction for the current block. The number of predictors to blend may be pre-determined. Or the number of predictors to blend may be computed based on the size of the current block.

[0121] According to an embodiment, the method comprises selecting the first pair of candidate multiple reference lines and candidate intra prediction modes from the list of candidate pairs as a main pair of candidate multiple reference line and candidate intra prediction mode.

[0122] Thus, the first element in the list of candidate pairs may be extracted as the main pair to predict the current block. Such pair may thus comprise a main intra prediction mode and a main MRL index. As another example, the main pair may be determined as the first pair in the list of candidate pairs with a given MRL index. As another example, the main pair may be determined as the pair in the list of candidate pairs with the smallest MRL index.

[0123] According to an embodiment, the method comprises selecting, from the list of candidate pairs, one or more pairs of candidate multiple reference lines and candidate intra prediction modes, whose predictors are blended with a predictor of the main pair of candidate multiple reference line and candidate intra prediction mode.

[0124] Thus, one or more other pairs may then be extracted to form the other predictors to blend with the main predictor. The process to extract the other pairs from the list may depend on the main intra-prediction mode of the main pair. As an example, the other pairs may be extracted so that their intra prediction modes are different than the main intra prediction mode. As an example, the pairs may be extracted so that all intra prediction modes of all extracted pairs are different.

[0125] The process to extract the other pairs from the list may also depend on the main MRL index of the main pair. As an example, the other pairs may be extracted so that their MRL index is the same as the main MRL index. As another example, the other pairs may be extracted so that their MRL index is different than the main MRL index. As yet another example, the pairs may be extracted so that all MRL indexes of all extracted pairs are different.

[0126] As another example, after a main pair of a candidate multiple reference line and candidate intra prediction mode is determined from the list, then the method comprises determining one or more pairs of a candidate multiple reference line and a candidate intra prediction mode based on the main pair. For example, a pair may be determined, which comprises an MRL index equal to the MRL index of the main pair and an intra prediction mode equal to the intra prediction mode of the main pair plus a given offset. As another example, a pair may be determined, which comprises an MRL index equal to the MRL index of the main pairand an intra prediction mode equal to the intra prediction mode of the main pair plus or minus one.

[0127] As an example, a total of 2 predictors may be computed. As another example, a total of 3 or 6 predictors may be computed. As yet another example, the same number of predictors to blend for a block coded with a Decoder-side Intra Mode Derivation (DIMD) process may be computed.

[0128] Once the number of pairs are extracted from the sorted list of pairs, corresponding predictors can be computed. For each pair, a prediction of the current block is computed by applying an intra-prediction process using the intra-prediction mode in the pair, and the reference samples corresponding to the MRL index in the pair.

[0129] An additional pre-determined predictor may also be computed using a pre-determined mode and a pre-determined MRL index. For example, a predictor using the Planar mode with MRL index 0 may be used. As another example, a predictor using the Planar mode with MRL index equal to the main MRL index of the main pair may be used.

[0130] According to an embodiment, the method comprises determining a weight for each of the predictors selected for blending based on the template costs of corresponding pairs of candidate multiple reference line and candidate intra prediction mode.

[0131] Thus, the blending may involve determining a weight for each predictor, where the weights may be determined depending on the computed template costs for each pair. As an example, a weight may be assigned to a predictor depending on its cost relative to the costs of the other predictors. As another example, the weight may be determined based on an indication extracted from the bitstream. As an example, different weights may be computed for a predictor, and an index may be extracted from the bitstream to identify which weight among the different weights should be used. As an example, the bitstream may contain indication on whether the blending process should be applied or not.

[0132] The weights may be determined in the template search process for a given block. For each pair of a candidate intra prediction mode and a candidate MRL, a template predictor is computed by predicting the samples in the template. Then, a number of these template predictors can be blended together using blending weights, to form a blended predictor for the template samples. Then, a template cost is computed based on the difference between the blended predicted samples and the reconstructed samples in the template.

[0133] The template cost may be computed for a plurality of possible options, each option consisting of a set of different predictors each with an assigned weight, where each predictor is obtained with a given pair of a candidate intra-prediction mode and a candidate MRL index. Then the option with lowest cost may be considered, which includes the pairs of intra prediction mode and MRL index to use to form the predictors, as well as the weights to blend the predictors together.

[0134] As another example, a list of sets of pairs of predictors may be determined based on template costs. As an example, a number of sets of different predictors each with an assigned weight may be determined and included in a list based on template costs, where each set corresponds to determining a number of predictors with corresponding weights, where each predictor is obtained using an intra prediction mode and an MRL index, where the decoder may select among the elements in the list based on signalling parameters extracted from the bitstream.

[0135] According to an embodiment, the method comprises signaling the usage of the blending in or along a bitstream.

[0136] According to an embodiment, the method comprises signaling the usage of the method in or along a bitstream.

[0137] According to an embodiment, the method comprises signaling usage of a specific item from a list of sorted items in or along a bitstream.

[0138] Thus, the usage of this method may be signalled in or along the bitstream, for example by means of a flag.

[0139] It is noted that the template search as described in above embodiments may be unified with the template search of TMRL mode. For example, the template costs computed for a TMRL search may be used for determining the pairs as described in the above embodiments. The template search may also be performed separately from the template search of TMRL mode.

[0140] A method according to a second aspect is shown in Figure 5, where the method comprises determining (500) a current block of samples to be predicted; determining (502), for the current block, a template comprising a plurality of reconstructed samples, a list of candidate multiple reference line indices, and a list of candidate intra prediction modes, wherein the determination of the list of candidate multiple reference line indices depends on the block size of the current block, and / or on characteristics of at least one neighbouring block; and computing(504) template costs for determining at least a predictor for the current block based on pairs of a candidate multiple reference line index and a candidate intra prediction mode.

[0141] Thus, in the method, the blending of several predictors is not necessarily needed, but the improvements in the intra prediction are obtained through the determination of the list of candidate multiple reference line indices. A prediction (or a predictor) for a given block is produced by determining a template formed of already reconstructed samples, determining a list of candidate multiple reference line indices, determining a list of candidate intra prediction modes, and computing at least one template cost based on at least one pair of a candidate multiple reference line index and a candidate intra prediction mode, where the determination of the list of candidate multiple reference line indices depends on the block size of the current block, and / or on characteristics of neighbouring blocks.

[0142] According to an embodiment, the method comprises selecting, from a predetermined list of candidate multiple reference line indices, a set of candidate multiple reference line indices based on the size of the current block.

[0143] Thus, a number of possible lists of candidate multiple reference line indices may be predetermined, where the selection among this number of possible lists is performed based on the size of the current block.

[0144] According to an embodiment, the method comprises selecting, from a predetermined list of candidate multiple reference line indices, a set of candidate multiple reference line indices based on characteristics of one or more neighbouring blocks.

[0145] Thus, the list of possible candidate multiple reference line indexes may be modified based on characteristics of neighbouring block(s). For example, if a neighbouring block is coded by means of an intra-prediction process that uses a given multiple reference line index, then the list of possible candidate multiple reference line indexes may be modified based on the multiple reference line index used in the neighbouring block.

[0146] According to an embodiment, the method comprises selecting, from a predetermined list of candidate multiple reference line indices, a set of candidate multiple reference line indices being, within an offset, the same as in the neighbouring block.

[0147] Thus, the list of possible candidate multiple reference line indexes may be modified to include multiple reference line indices that are the same or similar to the multiple reference line index used in the neighbouring block. For example, if the neighbouring block uses the MRLindex R, the list of possible candidate multiple reference line indexes may be modified to include the multiple reference line indexes R and / or (R + K) and / or (R - K), where the offset K is a positive integer.

[0148] According to an embodiment, the method comprises determining a set of candidate multiple reference line indices based on characteristics of the current block. For example, the set may depend on the x and / or y coordinates of the current block, where the x coordinate of a block refers to the horizontal displacement of the top-left pixel in the block, with respect to the top-left pixel in the picture, and similarly the y coordinate refers to the vertical displacement of the topleft pixel in the block, with respect to the top-left pixel in the picture. As an example, the set may be determined in order to maximise the number of MRL lines that are smaller or equal than the y coordinate of the current block.

[0149] The list of candidate MRL indices may be determined based on the characteristics of the current block at least according to the following examples. For example, the set of MRL indices may only include MRLs smaller or equal than the y coordinate in the block. As another example, the set of MRL indices may be first predetermined, and then MRL indices that are larger than or equal to the y component of the block may be replaced. As an example, a number of possible sets of MRL indices may be considered, where a different set may be used depending on the size of the current block. Therein, a set of MRL indices used for a small block may be formed of smaller MRL indices than a set of MRL indices used for a larger block.

[0150] The set of candidate MRL indices may be computed depending on the template size. As an example, if two lines of samples are considered in the template, then the set may be formed of MRL indexes larger than or equal to 2. Moreover, an exhaustive set of possible MRL indexes smaller or equal than a pre-determined maximum value may be considered. As an example, a maximum value set to 12 may be considered.

[0151] A predetermined list of MRL indices may be used. As an example, the set of MRL indices may be formed of indices {1, 3, 5, 7, 12}. As another example, the set may be formed of indices {1, 2, 4, 6, 10}. As yet another example, the set may be formed of indices {1, 2, 3, 4, 5}, or of indices {1, 2, 3, 5, 7}. The set may be formed of more or less than five elements.

[0152] The set of MRL indices may be computed depending on the template size. As an example, if two lines of samples are considered in the template, then the set may be formed of MRL indexes larger than or equal to 2. Moreover, an exhaustive set of possible MRL indexessmaller or equal than a pre-determined maximum value may be considered. As an example, a maximum value set to 12 may be considered.

[0153] An apparatus according to an aspect comprises means for determining a current block of samples to be predicted; means for determining, for the current block, a template comprising a plurality of reconstructed samples, a list of candidate multiple reference line indices, and a list of candidate intra prediction modes, wherein the determination of the list of candidate multiple reference line indices depends on the block size of the current block, and / or on characteristics of at least one neighbouring block; and means for computing template costs for determining at least a predictor for the current block based on pairs of a candidate multiple reference line index and a candidate intra prediction mode.

[0154] According to an embodiment, the apparatus comprises means for selecting, from a predetermined list of candidate multiple reference line indices, a set of candidate multiple reference line indices based on the size of the current block.

[0155] According to an embodiment, the apparatus comprises means for selecting, from a predetermined list of candidate multiple reference line indices, a set of candidate multiple reference line indices based on characteristics of one or more neighbouring blocks.

[0156] According to an embodiment, the apparatus comprises means for selecting from a predetermined list of candidate multiple reference line indices, a set of candidate multiple reference line indices which include indices that are within an offset, the same as the index used in the neighbouring block.

[0157] According to an embodiment, the apparatus comprises means for determining a set of candidate multiple reference line indices based on characteristics of the current block.

[0158] According to an embodiment, the apparatus comprises means for determining a set of candidate multiple reference line indices based on the coordinates of the current block.

[0159] According to an embodiment, the apparatus comprises means for determining a set of candidate multiple reference line indices based on a size of the template.

[0160] According to an embodiment, the apparatus comprises means for excluding specific indices from the list of candidate multiple reference line indices based on the coordinates of the current block.

[0161] According to an embodiment, the list of candidate multiple reference line indices and / or the list of candidate intra-prediction modes is predetermined.

[0162] As a further aspect, there is provided an apparatus comprising: at least one processor and at least one memory, said at least one memory stored with code thereon, which when executed by said at least one processor, causes the apparatus to perform at least: determine a current block of samples to be predicted; determine, for the current block, a template comprising a plurality of reconstructed samples, a list of candidate multiple reference line indices, and a list of candidate intra prediction modes, wherein the determination of the list of candidate multiple reference line indices depends on the block size of the current block, and / or on characteristics of at least one neighbouring block; and compute template costs for determining at least a predictor for the current block based on pairs of a candidate multiple reference line index and a candidate intra prediction mode.

[0163] According to an embodiment, the apparatus comprises code configured to cause the apparatus to select, from a predetermined list of candidate multiple reference line indices, a set of candidate multiple reference line indices based on the size of the current block.

[0164] According to an embodiment, the apparatus comprises code configured to cause the apparatus to select, from a predetermined list of candidate multiple reference line indices, a set of candidate multiple reference line indices based on characteristics of one or more neighbouring blocks.

[0165] According to an embodiment, the apparatus comprises code configured to cause the apparatus to select from a predetermined list of candidate multiple reference line indices, a set of candidate multiple reference line indices which include indices that are within an offset, the same as the index used in the neighbouring block.

[0166] According to an embodiment, the apparatus comprises code configured to cause the apparatus to determine a set of candidate multiple reference line indices based on characteristics of the current block.

[0167] According to an embodiment, the apparatus comprises code configured to cause the apparatus to determine a set of candidate multiple reference line indices based on the coordinates of the current block.

[0168] According to an embodiment, the apparatus comprises code configured to cause the apparatus to determine a set of candidate multiple reference line indices based on a size of the template.

[0169] According to an embodiment, the apparatus comprises code configured to cause the apparatus to exclude specific indices from the list of candidate multiple reference line indices based on the coordinates of the current block.

[0170] According to an embodiment, the list of candidate multiple reference line indices and / or the list of candidate intra-prediction modes is predetermined.

[0171] Such apparatuses may comprise e.g. all or a subset of the functional units disclosed in any of the appended Figures la, lb, and 6 - 9 for implementing the embodiments.

[0172] Such an apparatus further comprises code, stored in said at least one memory, which when executed by said at least one processor, causes the apparatus to perform one or more of the embodiments disclosed herein.

[0173] Figure 6 shows a schematic block diagram of an exemplary apparatus or electronic device 50, which may incorporate a codec according to an embodiment of the invention. Figure 7 shows a layout of an apparatus according to an example embodiment.

[0174] The electronic device 50 may for example be a mobile terminal or user equipment of a wireless communication system. However, it would be appreciated that embodiments of the invention may be implemented within any electronic device or apparatus which may require encoding and decoding or encoding or decoding video images.

[0175] The apparatus 50 may comprise a housing 30 for incorporating and protecting the device. The apparatus 50 further may comprise a display 32 in the form of a liquid crystal display. In other embodiments of the invention the display may be any suitable display technology suitable to display an image or video. The apparatus 50 may further comprise a keypad 34. In other embodiments of the invention any suitable data or user interface mechanism may be employed. For example, the user interface may be implemented as a virtual keyboard or data entry system as part of a touch-sensitive display.

[0176] The apparatus may comprise a microphone 36 or any suitable audio input which may be a digital or analogue signal input. The apparatus 50 may further comprise an audio output device which in embodiments of the invention may be any one of: an earpiece 38, speaker, or an analogue audio or digital audio output connection. The apparatus 50 may also comprise a battery (or in other embodiments of the invention the device may be powered by any suitable mobile energy device such as solar cell, fuel cell or clockwork generator). The apparatus may further comprise a camera capable of recording or capturing images and / or video. The apparatus 50 mayfurther comprise an infrared port for short range line of sight communication to other devices. In other embodiments the apparatus 50 may further comprise any suitable short range communication solution such as for example a Bluetooth wireless connection or a USB / firewire wired connection.

[0177] The apparatus 50 may comprise a controller 56, processor or processor circuitry for controlling the apparatus 50. The controller 56 may be connected to memory 58 which in embodiments of the invention may store both data in the form of image and audio data and / or may also store instructions for implementation on the controller 56. The controller 56 may further be connected to codec circuitry 54 suitable for carrying out coding and decoding of audio and / or video data or assisting in coding and decoding carried out by the controller.

[0178] The apparatus 50 may further comprise a card reader 48 and a smart card 46, for example a UICC and UICC reader for providing user information and being suitable for providing authentication information for authentication and authorization of the user at a network.

[0179] The apparatus 50 may comprise radio interface circuitry 52 connected to the controller and suitable for generating wireless communication signals for example for communication with a cellular communications network, a wireless communications system or a wireless local area network. The apparatus 50 may further comprise an antenna 44 connected to the radio interface circuitry 52 for transmitting radio frequency signals generated at the radio interface circuitry 52 to other apparatus(es) and for receiving radio frequency signals from other apparatus(es).

[0180] The apparatus 50 may comprise a camera capable of recording or detecting individual frames which are then passed to the codec 54 or the controller for processing. The apparatus may receive the video image data for processing from another device prior to transmission and / or storage. The apparatus 50 may also receive either wirelessly or by a wired connection the image for coding / decoding. The structural elements of apparatus 50 described above represent examples of means for performing a corresponding function.

[0181] With respect to Figure 8, an example of a system within which embodiments of the present invention can be utilized is shown. The system 10 comprises multiple communication devices which can communicate through one or more networks. The system 10 may comprise any combination of wired or wireless networks including, but not limited to a wireless cellular telephone network (such as a GSM, UMTS, CDMA network etc.), a wireless local area network(WLAN) such as defined by any of the IEEE 802.x standards, a Bluetooth personal area network, an Ethernet local area network, a token ring local area network, a wide area network, and the Internet.

[0182] The system 10 may include both wired and wireless communication devices and / or apparatus 50 suitable for implementing embodiments of the invention.

[0183] For example, the system shown in Figure 8 shows a mobile telephone network 11 and a representation of the internet 28. Connectivity to the internet 28 may include, but is not limited to, long range wireless connections, short range wireless connections, and various wired connections including, but not limited to, telephone lines, cable lines, power lines, and similar communication pathways.

[0184] The example communication devices shown in the system 10 may include, but are not limited to, an electronic device or apparatus 50, a combination of a personal digital assistant (PDA) and a mobile telephone 14, a PDA 16, an integrated messaging device (IMD) 18, a desktop computer 20, a notebook computer 22. The apparatus 50 may be stationary or mobile when carried by an individual who is moving. The apparatus 50 may also be located in a mode of transport including, but not limited to, a car, a truck, a taxi, a bus, a train, a boat, an airplane, a bicycle, a motorcycle or any similar suitable mode of transport.

[0185] The embodiments may also be implemented in a set-top box; i.e. a digital TV receiver, which may / may not have a display or wireless capabilities, in tablets or (laptop) personal computers (PC), which have hardware or software or combination of the encoder / decoder implementations, in various operating systems, and in chipsets, processors, DSPs and / or embedded systems offering hardware / software based coding.

[0186] Some or further apparatus may send and receive calls and messages and communicate with service providers through a wireless connection 25 to a base station 24. The base station 24 may be connected to a network server 26 that allows communication between the mobile telephone network 11 and the internet 28. The system may include additional communication devices and communication devices of various types.

[0187] The communication devices may communicate using various transmission technologies including, but not limited to, code division multiple access (CDMA), global systems for mobile communications (GSM), universal mobile telecommunications system (UMTS), time divisional multiple access (TDMA), frequency division multiple access (FDMA),transmission control protocol-internet protocol (TCP-IP), short messaging service (SMS), multimedia messaging service (MMS), email, instant messaging service (IMS), Bluetooth, IEEE 802.11 and any similar wireless communication technology. A communications device involved in implementing various embodiments of the present invention may communicate using various media including, but not limited to, radio, infrared, laser, cable connections, and any suitable connection.

[0188] Figure 9 is a graphical representation of an example multimedia communication system within which various embodiments may be implemented. A data source 1510 provides a source signal in an analog, uncompressed digital, or compressed digital format, or any combination of these formats. An encoder 1520 may include or be connected with a preprocessing, such as data format conversion and / or filtering of the source signal. The encoder 1520 encodes the source signal into a coded media bitstream. It should be noted that a bitstream to be decoded may be received directly or indirectly from a remote device located within virtually any type of network. Additionally, the bitstream may be received from local hardware or software. The encoder 1520 may be capable of encoding more than one media type, such as audio and video, or more than one encoder 1520 may be required to code different media types of the source signal. The encoder 1520 may also get synthetically produced input, such as graphics and text, or it may be capable of producing coded bitstreams of synthetic media. In the following, only processing of one coded media bitstream of one media type is considered to simplify the description. It should be noted, however, that typically real-time broadcast services comprise several streams (typically at least one audio, video and text sub-titling stream). It should also be noted that the system may include many encoders, but in the figure only one encoder 1520 is represented to simplify the description without a lack of generality. It should be further understood that, although text and examples contained herein may specifically describe an encoding process, one skilled in the art would understand that the same concepts and principles also apply to the corresponding decoding process and vice versa.

[0189] The coded media bitstream may be transferred to a storage 1530. The storage 1530 may comprise any type of mass memory to store the coded media bitstream. The format of the coded media bitstream in the storage 1530 may be an elementary self-contained bitstream format, or one or more coded media bitstreams may be encapsulated into a container file, or the coded media bitstream may be encapsulated into a Segment format suitable for DASH (or asimilar streaming system) and stored as a sequence of Segments. If one or more media bitstreams are encapsulated in a container file, a file generator (not shown in the figure) may be used to store the one more media bitstreams in the file and create file format metadata, which may also be stored in the file. The encoder 1520 or the storage 1530 may comprise the file generator, or the file generator is operationally attached to either the encoder 1520 or the storage 1530. Some systems operate “live”, i.e. omit storage and transfer coded media bitstream from the encoder 1520 directly to the sender 1540. The coded media bitstream may then be transferred to the sender 1540, also referred to as the server, on a need basis. The format used in the transmission may be an elementary self-contained bitstream format, a packet stream format, a Segment format suitable for DASH (or a similar streaming system), or one or more coded media bitstreams may be encapsulated into a container file. The encoder 1520, the storage 1530, and the server 1540 may reside in the same physical device or they may be included in separate devices. The encoder 1520 and server 1540 may operate with live real-time content, in which case the coded media bitstream is typically not stored permanently, but rather buffered for small periods of time in the content encoder 1520 and / or in the server 1540 to smooth out variations in processing delay, transfer delay, and coded media bitrate.

[0190] The server 1540 sends the coded media bitstream using a communication protocol stack. The stack may include but is not limited to one or more of Real-Time Transport Protocol (RTP), User Datagram Protocol (UDP), Hypertext Transfer Protocol (HTTP), Transmission Control Protocol (TCP), and Internet Protocol (IP). When the communication protocol stack is packet-oriented, the server 1540 encapsulates the coded media bitstream into packets. For example, when RTP is used, the server 1540 encapsulates the coded media bitstream into RTP packets according to an RTP payload format. Typically, each media type has a dedicated RTP payload format. It should be again noted that a system may contain more than one server 1540, but for the sake of simplicity, the following description only considers one server 1540.

[0191] If the media content is encapsulated in a container file for the storage 1530 or for inputting the data to the sender 1540, the sender 1540 may comprise or be operationally attached to a “sending file parser” (not shown in the figure). In particular, if the container file is not transmitted as such but at least one of the contained coded media bitstream is encapsulated for transport over a communication protocol, a sending file parser locates appropriate parts of the coded media bitstream to be conveyed over the communication protocol. The sending file parsermay also help in creating the correct format for the communication protocol, such as packet headers and payloads. The multimedia container file may contain encapsulation instructions, such as hint tracks in the ISOBMFF, for encapsulation of the at least one of the contained media bitstream on the communication protocol.

[0192] The server 1540 may or may not be connected to a gateway 1550 through a communication network, which may e.g. be a combination of a CDN, the Internet and / or one or more access networks. The gateway may also or alternatively be referred to as a middle-box. For DASH, the gateway may be an edge server (of a CDN) or a web proxy. It is noted that the system may generally comprise any number gateways or alike, but for the sake of simplicity, the following description only considers one gateway 1550. The gateway 1550 may perform different types of functions, such as translation of a packet stream according to one communication protocol stack to another communication protocol stack, merging and forking of data streams, and manipulation of data stream according to the downlink and / or receiver capabilities, such as controlling the bit rate of the forwarded stream according to prevailing downlink network conditions. The gateway 1550 may be a server entity in various embodiments.

[0193] The system includes one or more receivers 1560, typically capable of receiving, demodulating, and de-capsulating the transmitted signal into a coded media bitstream. The coded media bitstream may be transferred to a recording storage 1570. The recording storage 1570 may comprise any type of mass memory to store the coded media bitstream. The recording storage 1570 may alternatively or additively comprise computation memory, such as random access memory. The format of the coded media bitstream in the recording storage 1570 may be an elementary self-contained bitstream format, or one or more coded media bitstreams may be encapsulated into a container file. If there are multiple coded media bitstreams, such as an audio stream and a video stream, associated with each other, a container file is typically used and the receiver 1560 comprises or is attached to a container file generator producing a container file from input streams. Some systems operate “live,” i.e. omit the recording storage 1570 and transfer coded media bitstream from the receiver 1560 directly to the decoder 1580. In some systems, only the most recent part of the recorded stream, e.g., the most recent 10-minute excerption of the recorded stream, is maintained in the recording storage 1570, while any earlier recorded data is discarded from the recording storage 1570.

[0194] The coded media bitstream may be transferred from the recording storage 1570 to the decoder 1580. If there are many coded media bitstreams, such as an audio stream and a video stream, associated with each other and encapsulated into a container file or a single media bitstream is encapsulated in a container file e.g. for easier access, a file parser (not shown in the figure) is used to decapsulate each coded media bitstream from the container file. The recording storage 1570 or a decoder 1580 may comprise the file parser, or the file parser is attached to either recording storage 1570 or the decoder 1580. It should also be noted that the system may include many decoders, but here only one decoder 1580 is discussed to simplify the description without a lack of generality.

[0195] The coded media bitstream may be processed further by a decoder 1580, whose output is one or more uncompressed media streams. Finally, a Tenderer 1590 may reproduce the uncompressed media streams with a loudspeaker or a display, for example. The receiver 1560, recording storage 1570, decoder 1580, and Tenderer 1590 may reside in the same physical device or they may be included in separate devices.

[0196] A sender 1540 and / or a gateway 1550 may be configured to perform switching between different representations e.g. for switching between different viewports of 360-degree video content, view switching, bitrate adaptation and / or fast start-up, and / or a sender 1540 and / or a gateway 1550 may be configured to select the transmitted representation(s). Switching between different representations may take place for multiple reasons, such as to respond to requests of the receiver 1560 or prevailing conditions, such as throughput, of the network over which the bitstream is conveyed. In other words, the receiver 1560 may initiate switching between representations. A request from the receiver can be, e.g., a request for a Segment or a Subsegment from a different representation than earlier, a request for a change of transmitted scalability layers and / or sub-layers, or a change of a rendering device having different capabilities compared to the previous one. A request for a Segment may be an HTTP GET request. A request for a Subsegment may be an HTTP GET request with a byte range.Additionally or alternatively, bitrate adjustment or bitrate adaptation may be used for example for providing so-called fast start-up in streaming services, where the bitrate of the transmitted stream is lower than the channel bitrate after starting or random-accessing the streaming in order to start playback immediately and to achieve a buffer occupancy level that tolerates occasional packet delays and / or retransmissions. Bitrate adaptation may include multiple representation orlayer up-switching and representation or layer down-switching operations taking place in various orders.

[0197] A decoder 1580 may be configured to perform switching between different representations e.g. for switching between different viewports of 360-degree video content, view switching, bitrate adaptation and / or fast start-up, and / or a decoder 1580 may be configured to select the transmitted representation(s). Switching between different representations may take place for multiple reasons, such as to achieve faster decoding operation or to adapt the transmitted bitstream, e.g. in terms of bitrate, to prevailing conditions, such as throughput, of the network over which the bitstream is conveyed. Faster decoding operation might be needed for example if the device including the decoder 1580 is multi-tasking and uses computing resources for other purposes than decoding the video bitstream. In another example, faster decoding operation might be needed when content is played back at a faster pace than the normal playback speed, e.g. twice or three times faster than conventional real-time playback rate.

[0198] In the above, some embodiments have been described with reference to and / or using terminology of HEVC and / or WC. It needs to be understood that embodiments may be similarly realized with any video encoder and / or video decoder.

[0199] In the above, where the example embodiments have been described with reference to an encoder, it needs to be understood that the resulting bitstream and the decoder may have corresponding elements in them. Likewise, where the example embodiments have been described with reference to a decoder, it needs to be understood that the encoder may have structure and / or computer program for generating the bitstream to be decoded by the decoder.

[0200] The embodiments of the invention described above describe the codec in terms of separate encoder and decoder apparatus in order to assist the understanding of the processes involved. However, it would be appreciated that the apparatus, structures and operations may be implemented as a single encoder-decoder apparatus / structure / operation. Furthermore, it is possible that the coder and decoder may share some or all common elements.

[0201] Although the above examples describe embodiments of the invention operating within a codec within an electronic device, it would be appreciated that the invention as defined in the claims may be implemented as part of any video codec. Thus, for example, embodiments of the invention may be implemented in a video codec which may implement video coding over fixed or wired communication paths.

[0202] Thus, user equipment may comprise a video codec such as those described in embodiments of the invention above. It shall be appreciated that the term user equipment is intended to cover any suitable type of wireless user equipment, such as mobile telephones, portable data processing devices or portable web browsers.

[0203] Furthermore, elements of a public land mobile network (PLMN) may also comprise video codecs as described above.

[0204] In general, the various embodiments of the invention may be implemented in hardware or special purpose circuits, software, logic or any combination thereof. For example, some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software which may be executed by a controller, microprocessor or other computing device, although the invention is not limited thereto. While various aspects of the invention may be illustrated and described as block diagrams, flow charts, or using some other pictorial representation, it is well understood that these blocks, apparatus, systems, techniques or methods described herein may be implemented in, as non-limiting examples, hardware, software, firmware, special purpose circuits or logic, general purpose hardware or controller or other computing devices, or some combination thereof.

[0205] The embodiments of this invention may be implemented by computer software executable by a data processor of the mobile device, such as in the processor entity, or by hardware, or by a combination of software and hardware. Further in this regard it should be noted that any blocks of the logic flow as in the Figures may represent program steps, or interconnected logic circuits, blocks and functions, or a combination of program steps and logic circuits, blocks and functions. The software may be stored on such physical media as memory chips, or memory blocks implemented within the processor, magnetic media such as hard disk or floppy disks, and optical media such as for example DVD and the data variants thereof, CD.

[0206] The memory may be of any type suitable to the local technical environment and may be implemented using any suitable data storage technology, such as semiconductor-based memory devices, magnetic memory devices and systems, optical memory devices and systems, fixed memory and removable memory. The data processors may be of any type suitable to the local technical environment, and may include one or more of general purpose computers, special purpose computers, microprocessors, digital signal processors (DSPs) and processors based on multi-core processor architecture, as non-limiting examples.

[0207] Embodiments of the inventions may be practiced in various components such as integrated circuit modules. The design of integrated circuits is by and large a highly automated process. Complex and powerful software tools are available for converting a logic level design into a semiconductor circuit design ready to be etched and formed on a semiconductor substrate.

[0208] Programs, such as those provided by Synopsys, Inc. of Mountain View, California and Cadence Design, of San Jose, California automatically route conductors and locate components on a semiconductor chip using well established rules of design as well as libraries of pre-stored design modules. Once the design for a semiconductor circuit has been completed, the resultant design, in a standardized electronic format (e.g., Opus, GDSII, or the like) may be transmitted to a semiconductor fabrication facility or “fab” for fabrication.

[0209] The foregoing description has provided by way of exemplary and non-limiting examples a full and informative description of the exemplary embodiment of this invention. However, various modifications and adaptations may become apparent to those skilled in the relevant arts in view of the foregoing description, when read in conjunction with the accompanying drawings and the appended claims. However, all such and similar modifications of the teachings of this invention will still fall within the scope of this invention.

Claims

CLAIMS:

1. An apparatus comprisingmeans for determining a current block of samples to be predicted;means for determining, for the current block, a template comprising a plurality of reconstructed samples, a list of candidate multiple reference line indices, and a list of candidate intra prediction modes, wherein the determination of the list of candidate multiple reference line indices depends on the block size of the current block, and / or on characteristics of at least one neighbouring block; andmeans for computing template costs for determining at least a predictor for the current block based on pairs of a candidate multiple reference line index and a candidate intra prediction mode.

2. The apparatus according to claim 1, comprisingmeans for selecting, from a predetermined list of candidate multiple reference line indices, a set of candidate multiple reference line indices based on the size of the current block.

3. The apparatus according to claim 1 or 2, comprisingmeans for selecting, from a predetermined list of candidate multiple reference line indices, a set of candidate multiple reference line indices based on characteristics of one or more neighbouring blocks.

4. The apparatus according to any preceding claim, comprisingmeans for selecting from a predetermined list of candidate multiple reference line indices, a set of candidate multiple reference line indices which include indices that are within an offset, the same as the index used in the neighbouring block.

5. The apparatus according to any preceding claim, comprisingmeans for determining a set of candidate multiple reference line indices based on characteristics of the current block.

466. The apparatus according to any preceding claim, comprisingmeans for determining a set of candidate multiple reference line indices based on the coordinates of the current block.

7. The apparatus according to any preceding claim, comprisingmeans for determining a set of candidate multiple reference line indices based on a size of the template.

8. The apparatus according to any preceding claim, comprisingmeans for excluding specific indices from the list of candidate multiple reference line indices based on the coordinates of the current block.

9. The apparatus according to any preceding claim, whereinthe list of candidate multiple reference line indices and / or the list of candidate intraprediction modes is predetermined.

10. A method comprising:determining a current block of samples to be predicted;determining, for the current block, a template comprising a plurality of reconstructed samples, a list of candidate multiple reference line indices, and a list of candidate intra prediction modes, wherein the determination of the list of candidate multiple reference line indices depends on the block size of the current block, and / or on characteristics of at least one neighbouring block;computing template costs for determining at least a predictor for the current block based on pairs of a candidate multiple reference line index and a candidate intra prediction mode.

11. The method according to claim 10, comprisingselecting, from a predetermined list of candidate multiple reference line indices, a set of candidate multiple reference line indices based on the size of the current block.

12. The method according to claim 10 or 11, comprisingselecting, from a predetermined list of candidate multiple reference line indices, a set of candidate multiple reference line indices based on characteristics of one or more neighbouring blocks.

13. The method according to any of claims 10 - 12, comprisingselecting from a predetermined list of candidate multiple reference line indices, a set of candidate multiple reference line indices which include indices that are within an offset, the same as the index used in the neighbouring block.

14. The method according to any of claims 10 -13, comprisingdetermining a set of candidate multiple reference line indices based on characteristics of the current block.

15. The method according to any preceding claim, comprisingdetermining a set of candidate multiple reference line indices based on the coordinates of the current block.48