WO2020058594A1 - Procédés et dispositifs de codage et de décodage d'un flux de données représentatif d'au moins une image - Google Patents
Procédés et dispositifs de codage et de décodage d'un flux de données représentatif d'au moins une image Download PDFInfo
- Publication number
- WO2020058594A1 WO2020058594A1 PCT/FR2019/052028 FR2019052028W WO2020058594A1 WO 2020058594 A1 WO2020058594 A1 WO 2020058594A1 FR 2019052028 W FR2019052028 W FR 2019052028W WO 2020058594 A1 WO2020058594 A1 WO 2020058594A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- current block
- coding mode
- coding
- pixel
- block
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
- H04N19/136—Incoming video signal characteristics or properties
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
- H04N19/593—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving spatial prediction techniques
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N19/103—Selection of coding mode or of prediction mode
- H04N19/11—Selection of coding mode or of prediction mode among a plurality of spatial predictive coding modes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N19/119—Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
- H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/182—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being a pixel
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/30—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability
- H04N19/34—Scalability techniques involving progressive bit-plane based encoding of the enhancement layer, e.g. fine granular scalability [FGS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
- H04N19/61—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding in combination with predictive coding
Definitions
- the field of the invention is that of coding and decoding of images or sequences of images, and in particular of video streams.
- the invention relates to the compression of images or sequences of images using a block representation of the images.
- the invention can in particular be applied to image or video coding implemented in current or future coders (JPEG, MPEG, H.264, HEVC, etc. and their amendments), and to the corresponding decoding.
- JPEG Joint Photographic Experts Group
- MPEG MPEG
- H.264 High Efficiency Video Coding
- HEVC High Efficiency Video Coding
- Digital images and image sequences occupy a lot of memory space, which means that when transmitting these images, they must be compressed to avoid congestion problems on the network used for this transmission.
- HEVC compression standard High Efficiency Video Coding, Coding Tools and Specification
- Matthias Wien, Signais and Communication Technology proposes to implement a pixel prediction of a current image compared to other pixels belonging to the same image (intra prediction) or to a previous or next image (inter prediction).
- intra prediction exploits spatial redundancies within an image.
- the images are cut into blocks of pixels.
- the pixel blocks are then predicted using information already reconstructed, corresponding to the blocks previously coded / decoded in the current image according to the order of traversal of the blocks in the image.
- the coding of a current block is carried out using a prediction of the current block, known as the predictor block, and of a prediction residue or "residual block", corresponding to a difference between the current block and the predictor block.
- the residual block obtained is then transformed, for example by using a transform of the DOT type (transformed into discrete cosine).
- the coefficients of the transformed residual block are then quantified, then coded by an entropy coding and transmitted to the decoder, which can reconstruct the current block by adding this residual block to the predictor block.
- Decoding is done image by image, and for each image, block by block. For each block, the corresponding elements of the flow are read. The inverse quantization and the inverse transformation of the coefficients of the residual block are carried out. Then the prediction of the block is calculated to obtain the predictor block and the current block is reconstructed by adding the prediction (ie the predictor block) to the decoded residual block.
- a DPCM (for Differential Dist Code Modulation) coding technique for coding blocks in Intra mode is inserted in a HEVC coder.
- One such technique consists in predicting a set of pixels of an intra block by another set of pixels of the same block which have been previously reconstructed.
- a set of pixels of the intra block to be coded corresponds to a line of the block, or a column or a line and a column and the intra prediction used to predict the set of pixels is one of the intra directional predictions defined in the HEVC standard.
- the reconstruction of a set of pixels of the intra block corresponds either to the addition of a prediction residue in the case of lossless coding, therefore offering a fairly low compression rate, or to the addition a prediction residue after inverse transformation and / or inverse quantization of said other set of pixels serving as prediction.
- Such a technique therefore does not make it possible to predict each pixel of the intra block using a local prediction function and to reconstruct the predicted pixel before predicting a next pixel.
- this technique requires to reconstruct a set of pixels (row / column of the block for example) to predict another set of pixels. In other words, each time a part of the block is predicted and reconstructed, several pixels of the block are predicted and reconstructed.
- the invention improves the state of the art. To this end, it relates to a method for decoding a coded data stream representative of at least one image divided into blocks.
- the decoding method comprises, for at least one block of the image, called the current block:
- the method comprises decoding information indicating a coding mode of the current block from a first coding mode and a second coding mode and the reconstruction of the current block according to the coding mode indicated by the decoded coding mode information, - If the size of the current block is greater than the predetermined threshold, the reconstruction of the current block according to the first coding mode.
- the first coding mode corresponds to a coding mode according to which the current block is reconstructed using an inverse transformation of a transformed prediction residue decoded for the current block
- the second coding mode corresponds to a mode coding according to which the current block is reconstructed by:
- information indicating a coding mode of the current block among an intra-classical coding mode and a coding mode using a prediction based on pixels of the current block previously reconstructed is coded / decoded in the stream only in the case where the current block has a size less than or equal to a predetermined threshold.
- the current block can for example be coded by the intra-classical coding mode by default, for example in the case of the coding of an image of the INTRA type, or else by any other coding mode.
- the advantage of signaling the coding mode between the first coding mode and the second coding mode only for blocks having a size less than or equal to a predetermined threshold is to gain speed.
- the second coding mode requires transmitting a residue for each pixel and therefore requires a bit rate proportional to the area of the block expressed in number of pixels.
- the second coding mode proves to be advantageous in terms of compression compared to the first coding mode when the current block is small.
- the hardware / hardware implementation cost at the decoder level is reduced since the circuits taking care of the decoding of a block according to the second coding mode can be limited to a small area of the block.
- the invention also makes it possible to gain speed in terms of the coder since the coder is then not obliged to test the two coding modes for large block sizes, which are also the most demanding in terms of computation time.
- the invention also relates to a method for coding a stream of coded data representative of at least one image divided into blocks.
- the coding method comprises, for at least one block of the image, called the current block:
- the method comprises the coding of information indicating a coding mode of the current block among a first coding mode and a second coding mode and the coding of the current block according to the coding mode indicated by the coded coding mode information,
- the coding of the current block according to the first coding mode.
- the first coding mode corresponds to a coding mode according to which the current block is coded using a transformation of a prediction residue of the current block
- the second coding mode corresponds to a coding mode according to which the current block is coded by:
- the size of the current block corresponds to the largest width of the current block.
- the predetermined threshold is 16 pixels or 32 pixels. Other threshold values are of course possible.
- the size of the current block corresponds to the total number of pixels in the current block.
- the predetermined threshold is 256 pixels or 512 pixels. Other threshold values are of course possible.
- the threshold value can be adapted as a function of the maximum size of an initial block for cutting the image.
- the predetermined threshold is decoded or coded in the data stream.
- the invention also relates to a decoding device configured to implement the decoding method according to any one of the particular embodiments defined above.
- This decoding device could of course include the various characteristics relating to the decoding method according to the invention.
- the characteristics and advantages of this decoding device are the same as those of the decoding method, and are not described in more detail.
- the decoding device notably comprises a processor configured for, for at least one block of the image, called the current block:
- decode information indicating a coding mode of the current block from a first coding mode and a second coding mode, and reconstruct the current block according to the coding mode indicated by the decoded coding mode information
- the first coding mode corresponding to a coding mode according to which the current block is reconstructed using an inverse transformation of a transformed prediction residue decoded for the current block the second coding mode corresponding to a coding mode coding according to which the current block is reconstructed by:
- such a decoding device is included in a terminal.
- the invention also relates to an encoding device configured to implement the encoding method according to any one of the particular embodiments defined above.
- This coding device could of course include the various characteristics relating to the coding method according to the invention. So the features and benefits of this coding device are the same as those of the coding method, and are not described in more detail.
- the coding device notably comprises a processor configured for, for at least one block of the image, known as the current block, having a size less than or equal to a predetermined threshold:
- coding information indicating a coding mode of the current block from a first coding mode and a second coding mode, and coding the current block according to the coding mode indicated by the coded coding mode information
- the second coding mode corresponding to a coding mode according to which the current block is coded by:
- such a coding device is included in a terminal, or a server.
- the invention also relates to a coded data stream representative of at least one image divided into blocks.
- the coded data stream comprises, for at least one block of the image, known as the current block, information indicating a coding mode of the current block from a first coding mode and a second coding mode, if the current block has a size less than or equal to a predetermined threshold.
- the coded data stream comprises a coded transformed prediction residue.
- the coded data stream comprises a coded prediction residue obtained by: - for each pixel of the current block:
- the coded data stream further comprises a value representative of said predetermined threshold coded at least for said image.
- the data stream according to any of the particular embodiments described above can be stored on any recording medium, for example a memory, or transmitted in the form of an electrical or optical signal, which can be routed via electrical or optical cable, radio or other means.
- any recording medium for example a memory
- transmitted in the form of an electrical or optical signal which can be routed via electrical or optical cable, radio or other means.
- the decoding method, respectively the coding method, according to the invention can be implemented in various ways, in particular in wired form or in software form.
- the decoding method, respectively the coding method is implemented by a computer program.
- the invention also relates to a computer program comprising instructions for implementing the decoding method or the coding method according to any one of the particular embodiments described above, when said program is executed by a processor.
- Such a program can use any programming language. It can be downloaded from a communication network and / or saved on a computer-readable medium.
- This program can use any programming language, and be in the form of source code, object code, or intermediate code between source code and object code, such as in a partially compiled form, or in any other desirable form.
- the invention also relates to a recording medium or information medium readable by a computer, and comprising instructions of a computer program as mentioned above.
- the recording media mentioned above can be any entity or device capable of storing the program.
- the support may include a storage means such as a memory.
- the recording media can correspond to a transmissible medium such as an electrical or optical signal, which can be routed via an electrical or optical cable, by radio or by other ways.
- the program according to the invention can in particular be downloaded from a network of the Internet type.
- the recording media can correspond to an integrated circuit in which the program is incorporated, the circuit being adapted to execute or to be used in the execution of the process in question.
- FIG. 1 presents steps of the coding method according to a particular embodiment of the invention
- FIG. 2 illustrates an example of the position of the neighboring blocks of a current block for determining an intra prediction mode according to a particular embodiment of the invention
- FIG. 3 illustrates an example of the position of the reference pixels used to predict pixels of a current block according to a particular embodiment of the invention
- FIG. 4 presents steps of the decoding method according to a particular embodiment of the invention
- FIG. 5 illustrates an example of a signal comprising coded data representative of at least one block of an image according to a particular embodiment of the invention
- FIG. 6 shows the simplified structure of a coding device suitable for implementing the coding method according to any one of the particular embodiments of the invention
- FIG. 7 shows the simplified structure of a decoding device suitable for implementing the decoding method according to any one of the particular embodiments of the invention.
- the general principle of the invention is to make it possible to improve the coding of a data block of an image by using a new coding mode based on a prediction of the pixels of the block using other previously reconstructed pixels of the same block. and to make this new coding mode coexist with conventional coding modes, for example as defined in current compression standards.
- a new coding mode called ILR for In Loop Residual
- ILR In Loop Residual
- This new coding mode is introduced into an encoder / decoder using so-called conventional coding modes according to which the pixels of the block to be coded are predicted with respect to pixels of another block previously reconstructed and according to which a prediction residue for the block to be coded is transformed before being coded and transmitted to the decoder.
- information indicating a coding mode from a first coding mode (so-called classic mode) and a second coding mode (said ILR mode) is coded if the block has a size less than or equal to a predetermined threshold.
- the first coding mode is then used by default when the block has a size greater than the predetermined threshold and no information is transmitted by indicating the choice of this coding mode among the first and second coding modes.
- the so-called ILR coding mode is only available for blocks whose size is less than or equal to a given size.
- the ILR coding technique requires transmitting a residue for each pixel, while a so-called conventional coding mode (INTRA or INTER) is based on the coding of a transformed residue, which is much more economical to transmit.
- bit rate associated with a square block is on average proportional to the length of the side of the block.
- the so-called ILR approach corresponding to the coding mode according to which a prediction residue is not transformed before coding is an approach which requires a bit rate proportional to the area of the block expressed in number of pixels.
- the ILR method it is necessary to transmit a residue for each pixel, and this residue is not transformed since it is necessary to be able to reconstruct the pixel in order to then predict other pixels of the same block.
- the throughput cost of the ILR approach therefore increases with the square of the width of a block, while the throughput of the conventional approach increases in proportion to said width. The consequence is that, while the ILR approach may prove to be superior to the conventional approach for small blocks, this is no longer the case for large blocks.
- Deactivating the so-called ILR coding mode for large blocks also makes it possible to gain speed at the encoder, since the encoder is no longer obliged to test the two coding modes for large block sizes which are the most demanding in terms of calculation.
- the hardware implementation cost of a decoder is reduced since the circuits supporting the decoding of a block according to the so-called ILR coding mode can be limited to a small area of this block.
- the general principle of the invention is therefore to test the two coding modes only if the size of the block is less than or equal to a predetermined threshold.
- the criterion can for example be one of the following:
- the total number of pixels in the block is less than or equal to 256 pixels
- the total number of pixels in the block is less than or equal to 512 pixels.
- the encoder will effectively test the two coding modes mentioned above, choose the best in the sense of a bitrate-distortion criterion, and transmit an indicator to the decoder to identify the chosen coding mode. If the criterion is not fulfilled (therefore above a certain block size), the so-called classic coding mode is used, and no indicator is transmitted.
- FIG. 1 presents steps of the coding method according to a particular embodiment of the invention.
- a sequence of images l ; l 2 , ..., l N b in the form of a STR coded data stream according to a particular embodiment of the invention is implemented by a coding device as described below with reference to FIG. 6.
- a sequence of images l ; l 2 , ..., l N b, Nb being the number of images of the sequence to be coded, is supplied at the input of the coding method.
- the coding method outputs a stream of STR coded data representative of the sequence of images supplied as input.
- the coding of the sequence of images 1 ; l 2 , ..., l Nb is made image by image according to a coding order previously established and known to the coder.
- the images can be coded in time order h, l 2 , ..., l Nb or in another order, for example
- an image I, to be coded of the sequence of images, l 2 , ..., l Nb is cut up into blocks, for example into blocks of size 32 ⁇ 32, or 64 ⁇ 64 pixels or more.
- Such a block can be subdivided into square or rectangular sub-blocks, for example of size 16x16, 8x8, 4x4, 16x8, 8x16, ....
- a threshold is determined defining the maximum block size up to which the coding mode called ILR can be used to code a current block.
- the threshold can be defined by default at the encoder level or determined according to the maximum size of blocks used to cut the image. For example, if we consider a maximum initial cutting size of 256x256 pixels, the threshold can correspond to a greater width of the block equal to 64, 32 or 16 pixels.
- the threshold can correspond to a larger width of the block equal to 64, 32, 16, or 8 pixels.
- the threshold can be adapted as a function of the content of the images to be coded. As a variant, several threshold values can be tested during a bit rate / distortion optimization described below.
- a value of the predetermined threshold is coded in the data stream STR, at the level of the data coded for the image I, or else at the level of the data coded for the sequence of images.
- a first block or sub-block X b to code of the image I is selected according to a direction of travel of the image I, predetermined. For example, it can be the first block in the lexicographic order of the image.
- the encoder will choose the coding mode for coding the current block X b .
- the encoder selects the coding mode for coding the current block X b from a first coding mode M1 and a second coding mode M2. Additional coding modes (not described here) can be used.
- the first coding mode M1 corresponds to the coding of the current block by intra classical prediction, for example as defined according to the HEVC standard and the second coding mode M2 corresponds to the coding by In Loop Residual prediction (ILR).
- ILR In Loop Residual prediction
- the principle of the invention can be extended to other types of coding modes, whether for the first coding mode M1 or the second coding mode M2.
- the first coding mode can correspond to any type of coding mode using a transformation of the prediction residue before quantifying the coefficients resulting from the transformation (coding by inter-image prediction, coding by spatial prediction with template matching, etc. ).
- the second coding mode corresponds to the ILR coding mode described above.
- the coder can perform a bit rate / distortion optimization to determine the best coding mode for coding the current block.
- additional coding modes distinct from the first and second coding modes can be tested, for example a coding mode in inter mode.
- the coder simulates the coding of the current block X b according to the different coding modes available in order to determine the bit rate and the distortion associated with each coding mode and selects the coding mode offering the best compromise.
- bit rate / distortion for example according to the function D + 2R, where R represents the bit rate necessary to code the current block according to the coding mode evaluated, D the distortion measured between the decoded block and the original current block and l a Lagrangian multiplier, for example entered by the user or defined at the encoder.
- the second coding mode is not tested.
- the method goes to step E20. Otherwise, the current block has a size greater than the threshold, the method goes to step E21 of coding the current block according to the first coding mode.
- the size of the current block can correspond to the largest width of the block. For example if the current block is 16x32 pixels in size and the determined threshold is 32 pixels, in this case, the second coding mode is tested. On the other hand, if the current block is of size 64 * 32 pixels, in this case, the second coding mode is not tested.
- the size of the current block can correspond to the number of pixels in the block. For example, for a threshold of 512 pixels, and a current block of 16 * 32 pixels therefore containing 512 pixels, the second coding mode is tested whereas for a current block of 64 * 32 pixels therefore containing 2048 pixels, the second mode coding is not tested.
- step E20 information indicating the coding mode selected for the current block is coded in the data stream STR.
- the method goes to step E21 of coding the block according to M1. If the current block X b is coded according to the second coding mode M2, the method goes to step E22 of coding the block according to M2.
- the first coding mode corresponds to an intra classical prediction, such as that defined in the HEVC standard.
- a quantization step 3 ⁇ 4 is determined.
- the quantization step 3 ⁇ 4 can be set by the user, or calculated using a quantization parameter setting a compromise between compression and quality and entered by the user or defined by the encoder.
- a quantization parameter can be the parameter L, used in the rate-distortion cost function D + 2.R, where D represents the distortion introduced by the coding and R the bit rate used to code. This function is used to make coding choices, conventionally we seek the way of coding the image which minimizes this function.
- the quantification parameter can be QP, corresponding to the quantification parameter conventionally used in AVC or HEVC standards.
- a prediction of the current block is determined using an intra-classical prediction mode. According to this intra-classical prediction, each predicted pixel is calculated only from the decoded pixels from the neighboring blocks (reference pixels) located above the current block, and to the left of the current block. The way in which the pixels are predicted from the reference pixels depends on a prediction mode which is transmitted to the decoder, and which is chosen by the coder from a predetermined set of modes known to the coder and the decoder.
- HEVC there are 35 possible prediction modes: 33 modes which interpolate the reference pixels in 33 different angular directions, and 2 other modes: the DC mode in which each pixel of the predicted block is produced from the average reference pixels, and PLANAR mode, which performs plane and non-directional interpolation.
- This so-called “intra classical prediction” approach is well known and also used in the ITU-T H.264 standard (where there are only 9 different modes) as well as in the experimental JEM software available at the internet address (https : // i vet. hhif rau nh of er. de /), where there are 67 different prediction modes.
- the intra classical prediction respects the two aspects mentioned above (pixel prediction from neighboring blocks and transmission to the decoder of an optimal prediction mode).
- the coder therefore chooses one of the prediction modes available from the predetermined list of prediction modes.
- One way of choosing is, for example, to evaluate all the prediction modes and to keep the prediction mode which minimizes a cost function such as, conventionally, the rate-distortion cost.
- the prediction mode chosen for the current block is coded from the neighboring blocks of the current block.
- FIG. 2 illustrates an example of the position of the neighboring blocks A b and B b of the current block X b for coding the prediction mode of the current block X b .
- the intra prediction mode chosen for the current block is coded using the intra prediction modes associated with the neighboring blocks.
- such an approach consists in identifying the intra m A prediction mode associated with the block A b located above the current block, and the intra m B prediction mode associated with block B b located just to the left of the current block.
- MPM for Most Probable Mode
- non-BPM list containing the 32 other prediction modes
- syntax elements are transmitted:
- an index in the non-BPM list corresponding to the prediction mode of the current block is coded.
- the prediction residue R for the current block is constructed.
- a predicted block P is constructed as a function of the prediction mode chosen in step E21 1. Then the prediction residue R is obtained by calculating the difference for each pixel, between the predicted block P and the original current block.
- the prediction residue R is transformed into R T.
- a frequency transform is applied to the block of residue R so as to produce the block R T comprising transformed coefficients.
- the transform could be a DCT type transform for example. It is possible to choose the transform to be used in a predetermined set of transforms E T and to signal the transform used to the decoder.
- the transformed residue block R T is quantified using for example a scalar quantization of quantization step This produces the quantized transformed prediction residue block R TQ .
- the coefficients of the quantized block R TQ are coded by an entropy coder.
- an entropy coder One can for example use the entropy coding specified in the HEVC standard.
- the current block is decoded by de-quantizing the coefficients of the quantized block R TQ , then by applying the inverse transform to the de-quantized coefficients to obtain the decoded prediction residue.
- the prediction is then added to the decoded prediction residue in order to reconstruct the current block and obtain its decoded version.
- the decoded version of the current block can then be used later to spatially predict other neighboring blocks of the image or else to predict blocks of other images by inter-image prediction.
- the following step E22 of coding the block according to the second coding mode M2 is described below, according to a particular embodiment of the invention. According to the particular mode described here, the second coding mode corresponds to coding by ILR prediction.
- a local predictor PL for the current block is determined.
- the pixels of the current block are predicted by pixels previously reconstructed from a neighboring block of the current block or of the current block itself.
- the first coding mode uses a first group of intra prediction modes, for example the intra prediction modes defined by the HEVC standard, and the second coding mode, here the ILR mode, uses a second group of prediction modes distinct from the first group of intra prediction modes.
- the local predictor PL can be unique or it can be selected from a set of predetermined local predictors (second group of prediction modes).
- 4 local predictors are defined.
- X is called a current pixel to predict from the current block
- A the pixel located immediately to the left of X
- B the pixel located immediately to the left and above X
- C the pixel located immediately above X, as illustrated in FIG. 3 showing a current block X b .
- 4 local predictors PL1, PL2, PL3, PL4 can be defined as follows:
- min (A, B) corresponds to the function returning the smallest value between the value of A and the value of B and max (A, B) corresponds to the function returning the largest value between the value of A and the value of B.
- step E220 it is determined which local predictor PL to use for the current block.
- the same local predictor will be used for all the pixels of the current block, ie the same prediction function.
- the coding of the current block with each of the predictors can be simulated (similar to an optimization for choosing a coding mode for the current block), and the local predictor which optimizes a cost function (for example, which minimizes the function D + AR, where R is the bit rate used to code the block, D is the distortion of the decoded block compared to the original block, and l is a parameter set by the user) is selected.
- a cost function for example, which minimizes the function D + AR, where R is the bit rate used to code the block, D is the distortion of the decoded block compared to the original block, and l is a parameter set by the user
- an orientation of the texture of the previously coded pixels is analyzed. For example, the pixels previously coded in the block which are located above or to the left of the current block are analyzed using a Sobel operator. If it is determined that:
- the local predictor PL2 is selected
- the local predictor PL3 is selected
- the local predictor PL4 is selected
- the local predictor PL1 is selected.
- a syntax element is coded in the STR data stream to indicate to the decoder which local predictor was used to predict the current block.
- a quantization step d 2 is determined.
- the quantization step d 2 depends on the same quantization parameter as the quantization step 3 ⁇ 4 which would be determined in step E210 if the current block was coded according to the first coding mode.
- a prediction residue R1 is calculated for the current block. To do this, once the local predictor has been chosen, for each current pixel of the current block:
- the current pixel X of the current block is predicted by the local predictor PL selected, using either pixels outside the block and already reconstructed (and therefore available with their decoded value), or pixels previously reconstructed in the current block, either of the two, in order to obtain a predicted value PRED.
- the predictor PL uses previously reconstructed pixels.
- FIG. 3 it can be seen that the pixels of the current block situated on the first line and / or the first column of the current block will use as reference pixels (to construct the predicted value PRED) pixels external to the block and already reconstructed (pixels in gray in FIG. 3) and possibly already reconstructed pixels of the current block.
- the reference pixels used to construct the predicted value PRED are located inside the current block;
- Q (X) is the quantized residue associated with X. It is calculated in the spatial domain, ie calculated directly from the difference between the predicted PRED value of pixel X and the value original of X. Such a quantized residue Q (X) for the pixel X is stored in a block of quantized prediction residue R1 Q , which will be coded later;
- the decoded predicted value P1 (X) of X is calculated by adding to the predicted value PRED the de-quantized value of the quantized residue Q (X).
- ScalarDequant (A, x) D x x.
- the decoded predicted value P1 (X) thus makes it possible to predict possible pixels which remain to be processed in the current block. Furthermore, the block P1 comprising the decoded / reconstructed values of the pixels of the current block constitutes the predictor ILR of the current block (as opposed to the intra-classical predictor).
- the sub-steps described above are performed for all the pixels of the current block, in a traversing order which ensures that the pixels used for the prediction chosen from PL1, ..., PL4 are available.
- the order of traversal of the current block is the lexicographic order, i.e. from left to right, and from top to bottom.
- step E222 the quantized residue block R1 Q has been determined. This quantized residue block R1 Q must be coded to be transmitted to the decoder. The predictor P1 of the current block was also determined.
- the quantized residue block R1 Q is coded in order to transmit it to the decoder. It is possible to use any known approach, such as the method described in HEVC to code the quantized coefficients of a classical prediction residue.
- the values of the quantized residue block R1 Q are coded using an entropy coder in the data stream STR. According to a particular embodiment of the invention, it is possible to determine and code an additional prediction residue R2 from the predictor ILR obtained for the current block. The coding of an additional prediction residue R2 is however optional. It is indeed possible to simply code the current block by its predicted version P1 and the quantized residue R1 q .
- the following steps correspond to the conventional steps of coding this residue R2.
- the residue R2 is transformed using a frequency transform so as to produce the block of coefficients R2 T.
- the transform can be a DCT type transform for example. It is possible to choose the transform to be used in a predetermined set of transforms E T2 and to signal the transform used to the decoder. In this case, the set E T2 can be different from the set E T , in order to adapt to the particular statistics of the residue R2.
- the block of coefficients R2 T is quantized, for example using a scalar quantization of quantization step d. This produces the R2 TQ block.
- the quantization step d can be set by the user. It can also be calculated using another parameter l fixing the compromise between compression and quality and entered by the user or the encoder. For example, the quantization step d may correspond to the quantization step 3 ⁇ 4 or be determined in a similar manner to this.
- the coefficients of the quantized block R2 TQ are then transmitted in a coded manner.
- the coding specified in the HEVC standard can be used.
- the current block is decoded by de-quantizing the coefficients of the quantized block R2 TQ , then by applying the inverse transform to the de-quantized coefficients to obtain the decoded prediction residue.
- the prediction P1 is then added to the decoded prediction residue in order to reconstruct the current block and to obtain its decoded version X rec .
- the decoded version X rec of the current block can then be used later to spatially predict other neighboring blocks of the image or else to predict blocks of other images by inter-image prediction.
- step E23 it is checked whether the current block is the last block of the image to be processed by the coding method, taking into account the order of travel defined previously. If so, the method proceeds to coding (step E25) of the next image of the video if necessary. If not, during a step E24, the next block of the image to be processed is selected according to the scanning of the image defined above and the coding method goes to step E2, where the selected block becomes the current block to be processed.
- FIG. 4 presents steps of the method of decoding a stream STR of coded data representative of a sequence of images 1 ; l 2 , ..., l Nb to be decoded according to a particular embodiment of the invention.
- the STR data stream was generated via the coding method presented in relation to FIG. 1.
- the STR data stream is supplied at the input of a DEC decoding device, as described in relation to FIG. 7 .
- the decoding method decodes the image-by-image stream and each image is decoded block by block.
- an image I, to be decoded is subdivided into blocks, of initial size determined at the coder and known to the decoder.
- Each block will undergo a decoding operation consisting of a series of steps which are detailed below.
- the blocks can be the same size or different sizes.
- a threshold value is read from the data stream STR. This threshold value defines the maximum block size up to which the so-called ILR coding mode has been activated for coding a current block.
- the threshold can be defined by default at the level of the decoder.
- a first block or sub-block X b to be decoded from the image I is selected as the current block according to a direction of travel of the image I which is predetermined. For example, it can be the first block in the lexicographic order of the image.
- step E42 it is determined whether the current block has a size less than or equal to the threshold. If the current block has a size less than or equal to the threshold, the method goes to step E421. Otherwise, the current block has a size greater than the threshold, the method goes to step E43 of decoding the current block according to the first coding mode.
- the size of the current block can be read from the data stream or deduced from a partitioning of the initial size block to which the current block belongs. Such partitioning is coded in the data stream or is deduced from the information coded for the initial size block.
- step E421 information indicating an encoding mode for the current block is read from the data stream STR.
- this information indicates whether the current block is coded according to a first coding mode M1 or according to a second coding mode M2.
- the first coding mode M1 corresponds to the coding of the current block by intra classical prediction, for example as defined according to the HEVC standard
- the second coding mode M2 corresponds to the coding by In Loop prediction Residual (ILR).
- ILR In Loop prediction Residual
- the first coding mode may correspond to a coding mode other than the INTRA prediction coding mode (not described here).
- step E43 of decoding the current block is described when the current block is coded according to the first coding mode M1.
- a quantization step 3 ⁇ 4 is determined.
- the quantization step 3 ⁇ 4 is determined from the quantization parameter QP read during step E401 or in a similar manner to what was done at the coder.
- the quantization step 3 ⁇ 4 can be calculated using the quantization parameter QP read during step E401.
- the QP quantization parameter can be the quantification parameter conventionally used in AVC or HEVC standards.
- the prediction mode used to code the current block is decoded from the neighboring blocks. For this, like what was done at the coder, the intra prediction mode chosen for the current block is decoded, using the intra prediction modes associated with the neighboring blocks of the current block.
- the binary indicator and the prediction mode index are therefore read for the current block from the STR data stream, to decode the intra prediction mode of the current block.
- the decoder constructs a predicted block P for the current block from the decoded prediction mode.
- the decoder decodes the coefficients of the quantized block R TQ from the data stream STR, for example using the decoding specified in the HEVC standard.
- the decoded block R TQ is de-quantized, for example using a scalar de-quantization of quantization step This produces the block of quantized coefficients R QD ⁇
- an inverse frequency transform is applied to the block of de-quantified coefficients R T Q D so as to produce the block of decoded prediction residue RTQDI.
- the transform could be a reverse DCT type transform for example. It is possible to choose the transform to be used in a predetermined set of transforms by decoding an indicator from the data stream STR.
- step E44 describes the decoding of the current block when the current block is coded according to the second coding mode M2.
- the local predictor PL used to predict the pixels of the current block is determined.
- the local predictor is for example defined by default at the decoder level and no element of syntax needs to be read in the STR stream to determine it.
- a syntax element is decoded from the data stream STR to identify which local predictor was used to predict the current block.
- the local predictor is therefore determined from this decoded syntax element.
- the quantization step d 2 is determined, in a similar manner to what has been done at the coder.
- the quantized residue R1 Q is decoded from the data stream STR. It is possible to use any known approach, such as the method described in HEVC to decode the quantized coefficients of the classical prediction residue.
- the quantized residue block R1 Q is de-quantified using the quantization step d 2 , so as to produce the de-quantized residue block R1 QD .
- step E444 when the de-quantized residue block R1 QD is obtained, the predicted block P1 is constructed using the local predictor PL determined during step E440.
- each pixel of the current block is predicted and reconstructed as follows:
- the current pixel X of the current block is predicted by the predictor PL selected, using either pixels outside the block and already decoded, or pixels previously reconstructed from the current block, or both, to obtain a predicted PRED value. In all cases, the predictor PL uses previously decoded pixels;
- the route order is the lexicographic order (from left to right, then the lines from top to bottom).
- the predicted block P1 comprising the decoded predicted values P1 (X) of each pixel of the current block here constitutes the decoded current block X rec .
- an additional prediction residue has been coded for the current block. It is therefore necessary to decode this additional prediction residue in order to reconstruct the decoded version of the current block X rec .
- this other particular embodiment can be activated or not by default at the level of the coder and the decoder.
- an indicator can be encoded in the data stream with the block level information to indicate for each block encoded according to the ILR encoding mode whether an additional prediction residue is encoded.
- an indicator can be coded in the data stream with the image level or image sequence information to indicate for all the blocks of the image or of the image sequence coded according to the ILR coding mode if a additional prediction residue is coded.
- the coefficients of the quantized prediction residue R2 TQ are decoded from the data stream STR, using means adapted to those implemented to the coder, for example the means implemented in a HEVC decoder.
- the block of quantized coefficients R2 TQ is de-quantified, for example using a scalar de-quantization of quantization step This produces the block of unquantified coefficients R2 TQD .
- an inverse frequency transform is applied to the block R2 TQD so as to produce the block of decoded prediction residue R2 TQDL
- the reverse transform could be a reverse DCT type transform for example.
- the transform to be used in a predetermined set of transforms E T2 and to decode the information signaling the transform to be used at the decoder.
- the set E T2 is different from the set E T , in order to adapt to the particular statistics of the residue R2.
- the current block is reconstructed by adding the predicted block P1 obtained during the step E444 to the decoded prediction residue R2 TQDL
- step E45 it is checked whether the current block is the last block of the image to be processed by the decoding method, taking into account the course order defined above. If so, the method proceeds to decoding (step E47) of the next image of the video if necessary. If not, during a step E46, the next block of the image to be processed is selected according to the path of the image defined above and the decoding process goes to step E42, the selected block becoming the current block to treat.
- FIG. 5 illustrates an example of a STR signal comprising coded data representative of at least one block of an image according to a particular embodiment of the invention.
- the signal STR can comprise a threshold value S indicating a maximum block size up to which the second coding mode M2 can be used as described above.
- This threshold value S can be coded at the image or sequence of images level in the case of coding a video.
- the threshold S is determined similarly at the level of the coder and the decoder.
- the signal STR comprises a coded indicator TY indicating for the block, a coding mode among the first coding mode and the second coding mode.
- the indicator TY indicates that the block is coded according to the second coding mode, here the ILR mode
- the signal then comprises coded values of quantized prediction residues R1 Q and possibly coded values of quantized transformed prediction residues R2 TQ .
- the signal also includes a coded local predictor indicator PL.
- the signal When the indicator TY indicates that the block is coded according to the first coding mode, here the intra classical prediction mode, the signal then comprises coded values of quantized transformed prediction residues R TQ , a binary indicator Î M PM indicating whether the prediction mode to be coded for the current block is in the MPM list or not, and an idx MpM index indicating the index of the prediction mode of the current block in the corresponding list.
- FIG. 6 presents the simplified structure of a COD coding device suitable for implementing the coding method according to any one of the particular embodiments of the invention.
- the steps of the coding method are implemented by computer program instructions.
- the coding device COD has the conventional architecture of a computer and notably comprises a memory MEM, a processing unit UT, equipped for example with a processor PROC, and controlled by the computer program PG stored in MEM memory.
- the computer program PG includes instructions for implementing the steps of the coding method as described above, when the program is executed by the processor PROC.
- the code instructions of the computer program PG are for example loaded into a memory RAM (not shown) before being executed by the processor PROC.
- the processor PROC of the processing unit UT implements in particular the steps of the coding method described above, according to the instructions of the computer program PG.
- FIG. 7 shows the simplified structure of a DEC decoding device suitable for implementing the decoding method according to any one of the particular embodiments of the invention.
- the decoding device DEC has the conventional architecture of a computer and in particular comprises a memory MEMO, a processing unit UT0, equipped for example with a PROCO processor, and controlled by the computer program PG0 stored in MEMO memory.
- the PGO computer program includes instructions for implementing the steps of the decoding method as described above, when the program is executed by the PROCO processor.
- the code instructions of the PGO computer program are for example loaded into a RAM memory (not shown) before being executed by the PROCO processor.
- the processor PROCO of the processing unit UTO implements in particular the steps of the decoding method described above, according to the instructions of the computer program PGO.
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
Description
Claims
Priority Applications (7)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP19786368.1A EP3854090A1 (fr) | 2018-09-21 | 2019-09-03 | Procédés et dispositifs de codage et de décodage d'un flux de données représentatif d'au moins une image |
CN201980061935.1A CN112740691A (zh) | 2018-09-21 | 2019-09-03 | 用于编码和解码表示至少一个图像的数据流的方法和设备 |
JP2021515493A JP2022501909A (ja) | 2018-09-21 | 2019-09-03 | 少なくとも1つの画像を表すデータストリームをコーディングおよび復号するための方法およびデバイス |
US17/277,972 US11616958B2 (en) | 2018-09-21 | 2019-09-03 | Methods and devices for coding and decoding a data stream representing at least one image |
KR1020217008165A KR20210062635A (ko) | 2018-09-21 | 2019-09-03 | 적어도 하나의 이미지를 표현하는 데이터 스트림을 코딩 및 디코딩하기 위한 방법들 및 디바이스들 |
BR112021003632-6A BR112021003632A2 (pt) | 2018-09-21 | 2019-09-03 | métodos e dispositivos para codificar e decodificar um fluxo de dados que representa pelo menos uma imagem |
US18/171,934 US20230199193A1 (en) | 2018-09-21 | 2023-02-21 | Methods and devices for coding and decoding a data stream representing at least one image |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR1858571 | 2018-09-21 | ||
FR1858571A FR3086485A1 (fr) | 2018-09-21 | 2018-09-21 | Procedes et dispositifs de codage et de decodage d'un flux de donnees representatif d'au moins une image. |
Related Child Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US17/277,972 A-371-Of-International US11616958B2 (en) | 2018-09-21 | 2019-09-03 | Methods and devices for coding and decoding a data stream representing at least one image |
US18/171,934 Continuation US20230199193A1 (en) | 2018-09-21 | 2023-02-21 | Methods and devices for coding and decoding a data stream representing at least one image |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2020058594A1 true WO2020058594A1 (fr) | 2020-03-26 |
Family
ID=65494289
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/FR2019/052028 WO2020058594A1 (fr) | 2018-09-21 | 2019-09-03 | Procédés et dispositifs de codage et de décodage d'un flux de données représentatif d'au moins une image |
Country Status (8)
Country | Link |
---|---|
US (2) | US11616958B2 (fr) |
EP (1) | EP3854090A1 (fr) |
JP (1) | JP2022501909A (fr) |
KR (1) | KR20210062635A (fr) |
CN (1) | CN112740691A (fr) |
BR (1) | BR112021003632A2 (fr) |
FR (1) | FR3086485A1 (fr) |
WO (1) | WO2020058594A1 (fr) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11470329B2 (en) * | 2018-12-26 | 2022-10-11 | Tencent America LLC | Method and apparatus for video coding |
US20230095684A1 (en) * | 2019-05-03 | 2023-03-30 | Interdigital Vc Holdings, Inc. | High level syntax simplified video coding tool set for small blocks |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2013039908A2 (fr) * | 2011-09-12 | 2013-03-21 | Qualcomm Incorporated | Unités de transformée non carrées et unités de prédiction dans codage vidéo |
US9253508B2 (en) | 2011-11-04 | 2016-02-02 | Futurewei Technologies, Inc. | Differential pulse code modulation intra prediction for high efficiency video coding |
Family Cites Families (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9055305B2 (en) * | 2011-01-09 | 2015-06-09 | Mediatek Inc. | Apparatus and method of sample adaptive offset for video coding |
SI2636218T1 (sl) * | 2010-11-04 | 2021-12-31 | Ge Video Compression, Llc | Kodiranje slike, ki podpira združevanje blokov in preskakovalni način |
US9560384B2 (en) * | 2011-10-17 | 2017-01-31 | Kt Corporation | Method and apparatus for encoding/decoding image |
US9344722B2 (en) * | 2011-11-18 | 2016-05-17 | Futurewei Technologies, Inc. | Scanning of prediction residuals in high efficiency video coding |
US9426466B2 (en) * | 2012-06-22 | 2016-08-23 | Qualcomm Incorporated | Transform skip mode |
FI2869557T3 (fi) * | 2012-06-29 | 2023-11-02 | Electronics & Telecommunications Res Inst | Menetelmä ja laite kuvien koodaamiseksi/dekoodaamiseksi |
US9716894B2 (en) * | 2013-03-25 | 2017-07-25 | Qualcomm Incorporated | Intra prediction modes for lossy coding when transform is skipped |
US10097837B2 (en) * | 2014-10-10 | 2018-10-09 | Qualcomm Incorporated | Palette run hiding in palette-based video coding |
CN105872539B (zh) * | 2015-02-08 | 2020-01-14 | 同济大学 | 图像编码方法和装置及图像解码方法和装置 |
FR3038196A1 (fr) * | 2015-06-29 | 2016-12-30 | B<>Com | Procede de codage d'une image numerique, procede de decodage, dispositifs et programmes d'ordinateurs associes |
US10200719B2 (en) * | 2015-11-25 | 2019-02-05 | Qualcomm Incorporated | Modification of transform coefficients for non-square transform units in video coding |
US10511859B2 (en) * | 2016-02-04 | 2019-12-17 | Mediatek Inc. | Method and apparatus for image compression without residue signaling |
US10880552B2 (en) * | 2016-09-28 | 2020-12-29 | Lg Electronics Inc. | Method and apparatus for performing optimal prediction based on weight index |
CN108347602B (zh) * | 2017-01-22 | 2021-07-30 | 上海澜至半导体有限公司 | 用于无损压缩视频数据的方法和装置 |
JP2022538331A (ja) * | 2019-06-28 | 2022-09-01 | ベイジン ダージャー インターネット インフォメーション テクノロジー カンパニー リミテッド | ビデオ符号化復号化のための可逆符号化復号化モード |
MX2022003468A (es) * | 2019-09-23 | 2022-04-19 | Interdigital Vc Holdings France Sas | Unificacion de metodo de conteo de bins codificados por contexto. |
-
2018
- 2018-09-21 FR FR1858571A patent/FR3086485A1/fr not_active Withdrawn
-
2019
- 2019-09-03 BR BR112021003632-6A patent/BR112021003632A2/pt unknown
- 2019-09-03 US US17/277,972 patent/US11616958B2/en active Active
- 2019-09-03 KR KR1020217008165A patent/KR20210062635A/ko active Search and Examination
- 2019-09-03 JP JP2021515493A patent/JP2022501909A/ja active Pending
- 2019-09-03 EP EP19786368.1A patent/EP3854090A1/fr active Pending
- 2019-09-03 CN CN201980061935.1A patent/CN112740691A/zh active Pending
- 2019-09-03 WO PCT/FR2019/052028 patent/WO2020058594A1/fr active Application Filing
-
2023
- 2023-02-21 US US18/171,934 patent/US20230199193A1/en active Pending
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2013039908A2 (fr) * | 2011-09-12 | 2013-03-21 | Qualcomm Incorporated | Unités de transformée non carrées et unités de prédiction dans codage vidéo |
US9253508B2 (en) | 2011-11-04 | 2016-02-02 | Futurewei Technologies, Inc. | Differential pulse code modulation intra prediction for high efficiency video coding |
Non-Patent Citations (9)
Title |
---|
ABDOLI (ORANGE) M ET AL: "AHG11: Block DPCM for Screen Content Coding", no. JVET-L0078, 24 September 2018 (2018-09-24), XP030193623, Retrieved from the Internet <URL:http://phenix.int-evry.fr/jvet/doc_end_user/documents/12_Macao/wg11/JVET-L0078-v1.zip JVET-L0078.docx> [retrieved on 20180924] * |
ABDOLI MOHSEN ET AL: "Intra prediction using in-loop residual coding for the post-HEVC standard", 2017 IEEE 19TH INTERNATIONAL WORKSHOP ON MULTIMEDIA SIGNAL PROCESSING (MMSP), IEEE, 16 October 2017 (2017-10-16), pages 1 - 6, XP033271573, DOI: 10.1109/MMSP.2017.8122241 * |
JIANLE CHEN ET AL: "Adaptive linear prediction for block-based lossy image coding", IMAGE PROCESSING (ICIP), 2009 16TH IEEE INTERNATIONAL CONFERENCE ON, IEEE, PISCATAWAY, NJ, USA, 7 November 2009 (2009-11-07), pages 2833 - 2836, XP031629140, ISBN: 978-1-4244-5653-6, DOI: 10.1109/ICIP.2009.5414476 * |
LIMIN LIU ET AL: "Enhanced Intra Prediction Using Context-Adaptive Linear Prediction (Abstract)", 26. PICTURE CODING SYMPOSIUM;7-11-2007 - 9-11-2007; LISBON,, 7 November 2007 (2007-11-07), XP030080404 * |
MATTHIAS WIEN: "High Efficiency Video Coding, Coding Tools and Specification", SIGNAIS AND COMMUNICATION TECHNOLOGY, 2015 |
SANCHEZ VICTOR ET AL: "Lossless compression of medical images based on HEVC intra coding", 2014 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), IEEE, 4 May 2014 (2014-05-04), pages 6622 - 6626, XP032616688, DOI: 10.1109/ICASSP.2014.6854881 * |
XIAORAN CAO ET AL: "Short Distance Intra Coding Scheme for High Efficiency Video Coding", IEEE TRANSACTIONS ON IMAGE PROCESSING, IEEE SERVICE CENTER, PISCATAWAY, NJ, US, vol. 22, no. 2, 1 February 2013 (2013-02-01), pages 790 - 801, XP011492284, ISSN: 1057-7149, DOI: 10.1109/TIP.2012.2222904 * |
YUMI SOHN ET AL: "One Dimensional Transform For H.264 Based Intra Coding (Abstract)", 26. PICTURE CODING SYMPOSIUM;7-11-2007 - 9-11-2007; LISBON,, 7 November 2007 (2007-11-07), XP030080458 * |
YUNG-LYU ET AL: "Improved lossless intra coding for H.264/MPEG-4 AVC", IEEE TRANSACTIONS ON IMAGE PROCESSING, vol. 15, no. 9, 1 September 2006 (2006-09-01), pages 2610 - 2615, XP055010349, ISSN: 1057-7149, DOI: 10.1109/TIP.2006.877396 * |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11470329B2 (en) * | 2018-12-26 | 2022-10-11 | Tencent America LLC | Method and apparatus for video coding |
US11677959B2 (en) | 2018-12-26 | 2023-06-13 | Tencent America LLC | Method and apparatus for video coding |
US20230095684A1 (en) * | 2019-05-03 | 2023-03-30 | Interdigital Vc Holdings, Inc. | High level syntax simplified video coding tool set for small blocks |
Also Published As
Publication number | Publication date |
---|---|
US20230199193A1 (en) | 2023-06-22 |
BR112021003632A2 (pt) | 2021-05-18 |
KR20210062635A (ko) | 2021-05-31 |
CN112740691A (zh) | 2021-04-30 |
US20210377541A1 (en) | 2021-12-02 |
FR3086485A1 (fr) | 2020-03-27 |
US11616958B2 (en) | 2023-03-28 |
EP3854090A1 (fr) | 2021-07-28 |
JP2022501909A (ja) | 2022-01-06 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP2991351B1 (fr) | Procédé de décodage d'images | |
FR2906433A1 (fr) | Procedes et dispositifs de codage et de decodage d'images, programme d'ordinateur les mettant en oeuvre et support d'informaton permettant de les mettre en oeuvre | |
FR2947134A1 (fr) | Procedes de codage et de decodages d'images, dispositifs de codage et de decodage, flux de donnees et programme d'ordinateur correspondants. | |
EP3442228A1 (fr) | Procédé de décodage d'images | |
FR2951345A1 (fr) | Procede et dispositif de traitement d'une sequence video | |
EP3854090A1 (fr) | Procédés et dispositifs de codage et de décodage d'un flux de données représentatif d'au moins une image | |
EP3075155B1 (fr) | Procédé de codage et de décodage d'images, dispositif de codage et de décodage d'images et programmes d'ordinateur correspondants | |
WO2017037368A2 (fr) | Procédé de codage et de décodage d'images, dispositif de codage et de décodage d'images et programmes d'ordinateur correspondants | |
WO2016024067A1 (fr) | Procédé de codage et de décodage d'images, dispositif de codage et de décodage d'images et programmes d'ordinateur correspondants | |
EP3479572A1 (fr) | Procédé de codage intra d'une image numérique et procédé de décodage correspondant | |
WO2020002796A1 (fr) | Procédés et dispositifs de codage et de décodage d'un flux de données représentatif d'au moins une image | |
FR2975856A1 (fr) | Procede de codage et de decodage d'images, dispositif de codage et de decodage d'images et programmes d'ordinateur correspondants | |
FR2955995A1 (fr) | Procede et dispositif de traitement d'une sequence video | |
EP3941045A1 (fr) | Procédés et dispositifs de codage et de décodage d'un flux de données représentatif d'au moins une image | |
EP3529987A1 (fr) | Procédé de codage et de décodage de paramètres d'image, dispositif de codage et de décodage de paramètres d'image et programmes d'ordinateur correspondants | |
WO2020002795A1 (fr) | Procédés et dispositifs de codage et de décodage d'un flux de données représentatif d'au moins une image | |
FR2849329A1 (fr) | Procede de codage d'une image par ondelettes, procede de decodage, dispositifs, signal et applications correspondantes | |
WO2020058593A1 (fr) | Procédés et dispositifs de codage et de décodage d'un flux de données représentatif d'au moins une image | |
EP3854085A1 (fr) | Procédés et dispositifs de codage et de décodage d'un flux de données représentatif d'au moins une image | |
EP3922017A1 (fr) | Procédés et dispositifs de codage et de décodage d'un flux de données représentatif d'au moins une image | |
FR2957744A1 (fr) | Procede de traitement d'une sequence video et dispositif associe | |
FR3098070A1 (fr) | Procédé d’encodage et de décodage vidéo par signalisation d’un sous-ensemble de candidat | |
FR2956552A1 (fr) | Procede de codage ou de decodage d'une sequence video, dispositifs associes | |
EP3596923A1 (fr) | Procédé de codage et décodage d'images, dispositif de codage et décodage et programmes d'ordinateur correspondants | |
FR2927494A1 (fr) | Procede de decodage et codage d'une sequence d'images avec compensation de mouvement |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 19786368 Country of ref document: EP Kind code of ref document: A1 |
|
REG | Reference to national code |
Ref country code: BR Ref legal event code: B01A Ref document number: 112021003632 Country of ref document: BR |
|
ENP | Entry into the national phase |
Ref document number: 2021515493 Country of ref document: JP Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2101001604 Country of ref document: TH |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
ENP | Entry into the national phase |
Ref document number: 2019786368 Country of ref document: EP Effective date: 20210421 |
|
ENP | Entry into the national phase |
Ref document number: 112021003632 Country of ref document: BR Kind code of ref document: A2 Effective date: 20210225 |