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/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
  • H04N19/96—Tree coding, e.g. quad-tree coding

Definitions

• the present invention relates generally to the field of image processing, and more specifically to the encoding and decoding of digital images and digital image sequences.
• the invention can be applied in particular, but not exclusively, to the video coding implemented in the current AVC and HEVC video coders and their extensions (MVC, 3D-AVC, MV-HEVC, 3D-HEVC, etc.), as well as to the corresponding decoding.
• Current video encoders use a block representation of the images to be encoded.
• the images are subdivided into blocks of square or rectangular shape, which can be subdivided in turn recursively.
• a recursive subdivision follows a tree structure called "quadtree".
• CTU Coding Tree Unit
• Such blocks are, for example, 64 ⁇ 64 pixels (1 ⁇ i L L).
• this block constitutes the root of a coding tree in which:
• a first level of sheets under the root corresponds to a first subdivision depth level of the CTU block, for which the CTU block has been subdivided a first time into a plurality of square or rectangular coding blocks called CU (of the English "Coding Unit"),
• a second level of sheets under the first level of sheets corresponds to a second level of block partitioning depth CTU, for which some blocks of said plurality of block coding blocks partitioned a first time are partitioned into a plurality of CU type coding blocks, ...
• the partitioning iteration of the CTUi block is performed up to a predetermined partition depth level.
• the latter is finally partitioned into a plurality of coding blocks denoted UC-1, UC 2 ,. , UC M with 1 ⁇ j ⁇ M.
• the purpose of such a subdivision is to delimit zones that adapt well to the local characteristics of the image, such as for example a homogeneous texture, a constant movement, an object in the foreground in the image, etc.
• a sequence of digital information such as, for example, a series of bits, representative of this optimal subdivision, is transmitted in a data signal intended to be stored at the encoder or well transmitted to a video decoder to be read and then decoded by the latter.
• the binary sequence representative of the optimal subdivision of the CTU block contains the following seventeen bits: 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0 , 0, 0, 0, 0, 0, 0, for which:
• the first bit "1" indicates a subdivision of the block CTU, in four smaller sub-blocks UC-i, UC 2 , UC 3 , UC 4
• the second bit "1" indicates a subdivision of the sub-block UCi into four smaller sub-blocks UC 5 , CPU 6 , CPU 7 , CPU 8 ,
• the third bit "0" indicates a lack of subdivision of the UC 2 sub-block
• the fourth bit "0" indicates a lack of subdivision of the UC 3 sub-block
• the fifth bit "0" indicates a lack of subdivision of the sub-block UC 4 .
• the sixth bit "0" indicates a lack of subdivision of the UCs sub-block
• the seventh bit "1" indicates a subdivision of the sub-block UC 6 into four smaller sub-blocks UC 9 , UC-
• the eighth bit "1" indicates a subdivision of the sub-block UC 7 into four smaller sub-blocks UC13, UCi 4 , UC15, UCi 6 ,
• the ninth bit "0" indicates a lack of subdivision of the UC 8 sub-block
• the tenth bit "0" indicates a lack of subdivision of the sub-block UC 9 .
• the eleventh bit "0" indicates a lack of subdivision of the subunit UC 10 .
• the seventeenth bit "0" indicates no subdivision of the UC-I6 sub-block.
• the bit sequence obtained requires that a sub-block traversal order be predetermined in order to know to which sub-block corresponds a syntax element indicating the subdivision performed. As represented by the arrow F in FIG. 1, such a travel order is generally lexicographic, that is to say that for each level of subdivision considered:
• the sub-blocks are traversed starting with the first sub-block UCi located at the top left of the block CTU, and so on until reaching the sub-block UC 4 located at the bottom right of the block CTU ,
• the sub-blocks resulting from the subdivision of the sub-block UC 6 are traversed starting with the first sub-block UC 9 located at the top left of the sub-block UC 6 and so on until reaching the sub-block UCi 2 located at the bottom right of the UC 6 sub-block,
• the sub-blocks resulting from the subdivision of the sub-block UC 7 are traversed starting with the first sub-block UC 13 located at the top left of the sub-block UC 7 and so on until reaching the sub-block UCi 6 located at the bottom right of the UC 7 sub-block.
• the aforementioned seventeen bits are written one after the other in the binary sequence which is then compressed by a suitable entropic coding.
• a prediction of pixels of the sub-block considered is implemented with respect to prediction pixels that belong to either the same image (intra prediction) or to one or more previous images of an image sequence (inter prediction) that have already been decoded.
• Such prior images are conventionally referred to as reference images and are stored in memory at both the encoder and the decoder.
• a residual sub-block is calculated by subtraction of the pixels of the sub-block considered, prediction pixels.
• the coefficients of the calculated residual sub-block are then quantized after a possible mathematical transformation, for example of the discrete cosine transform (DCT) type, then coded by an entropy coder.
• DCT discrete cosine transform
• inter or intra prediction mode is done at the level of each of the UC-i, UC 2 , ..., UC j subunits , ..., UC M which can themselves be partitioned into sub-prediction blocks ("prediction units” in English) and transform sub-blocks ("Transform Units").
• prediction units in English
• transform sub-blocks Transform Units
• the block CTUi and its sub-blocks Ud, UC 2 , ..., UCj, ..., UCM, its prediction sub-blocks and its transform sub-blocks, are likely to be associated with information describing their content.
• Such information includes the following:
• the prediction mode (intra prediction, inter prediction, prediction by default carrying out a prediction for which no information is transmitted to the decoder ("in English” skip ”));
• prediction orientation, reference image component, etc.
• This information is also recorded in the aforementioned data signal.
• FIG. 2A represents, as a significant element, a star, which is contained in a homogeneous zone such as, for example, a sky of uniform color.
• One of the aims of the invention is to overcome disadvantages of the state of the art mentioned above.
• an object of the present invention relates to a method of encoding at least one image, comprising a step of subdivision of the image into a plurality of blocks.
• the coding method according to the invention is remarkable that it comprises the following steps:
• the first part having a rectangular or square shape and the second part forming the complement of the first part in the current block, the second part having a geometric shape with m sides with m> 4,
• the subdivision according to the invention is particularly well suited to the case where blocks of the image contain a significant element, for example an object in the foreground, which is located in a homogeneous zone having a low energy, such as for example a background of color, orientation or uniform movement.
• the invention relates to a device for coding at least one image, comprising a partitioning module for subdividing the image into a plurality of blocks.
• the partitioning module is able to subdivide at least one current block into a first and a second part, the first part having a rectangular or square shape and the second part forming the complement of the first part. part in the current block, the second part having a geometric shape with m sides, with m> 4,
• the invention also relates to a method of decoding a data signal representative of at least one coded picture having been subdivided into a plurality of blocks.
• Such a decoding method is remarkable in that it comprises the following steps:
• the first part having a rectangular or square shape and the second part forming the complement of the first part in the current block, the second part having a geometric shape with m sides with m> 4,
• the subdivision according to the invention is particularly well suited to the case where blocks of the image to be decoded contain a significant element, for example an object in the foreground, which is located in a homogeneous zone having a low energy, such as for example a background of color, orientation or uniform movement.
• At least one information for reconstructing the pixels of the second part with m sides of the current block is set to a predetermined value.
• said at least one information for reconstructing the pixels of the second part with m sides of the current block is representative of the absence of subdivision of the second part with m sides of the current block.
• the decoder autonomously determines that it does not need to subdivide this part, since it characterizes a homogeneous region of the current block to be decoded. is devoid of details.
• said at least one information for reconstructing the pixels of the second part with m sides of the current block is representative of the absence of residual information resulting from a prediction of the pixels of the second part with m sides of the block. current.
• the decoder autonomously determines that the residual pixels obtained as a result of the prediction of said second part with m sides have a zero value. It is considered that the second part with m sides is associated with a zero prediction residue since it characterizes a homogeneous region of the current block to be decoded.
• said at least one information for reconstructing the pixels of the second part with m sides of the current block is representative of predetermined prediction values of the pixels of the second part with m sides of the current block.
• Such a variant makes it possible to further optimize the signaling cost by avoiding transmitting in the data signal the index of the prediction mode which has been selected to the coding in order to predict the second part with m sides of the current block.
• the decoding method comprises, prior to the step of subdivision of the current block, a step reading, in the data signal, information indicating whether the current block is intended to be subdivided into a first and a second part, the first part having a rectangular or square shape and the second part forming the complement of the first part in the current block, the second part having a geometric shape with m sides, with m> 4, or to be subdivided according to another predetermined method.
• Such an arrangement enables the decoder to determine whether, during coding of a current block, the coder has activated or not the subdivision of the current block according to the invention, for a sequence of images considered, for an image considered or else for a portion of image ("slice" in English) considered, so that the decoder can implement correspondingly subdivision performed coding.
• a decoding method is particularly flexible because adaptable to the current video context.
• the decoding method is adapted to implement the subdivision according to the invention or according to another type of subdivision, such as for example the quadtree subdivision, as a function of the value taken by a dedicated indicator inscribed in the signal of data.
• Such a dedicated indicator remains relatively compact to report and allows to maintain the compression gain obtained through the subdivision according to the invention.
• the decoding method comprises a step of reading, in the data signal, information indicating a subdivision configuration of the current block selected from different predetermined subdivision patterns.
• the step of decoding the second part of the current block with m sides comprises the substeps consisting of:
• Such an arrangement advantageously makes it possible, when a step of application of a transform is to be implemented following the entropy decoding step of the second part of the current block to be decoded, to reuse the hardware tools. and square or rectangular block transform software that is commonly implemented in current video encoders and decoders.
• a subdivided current block contains at most a portion having a geometric shape with m sides.
• the invention relates to a device for decoding a data signal representative of at least one coded picture having been subdivided into a plurality of blocks.
• Such a decoding device is remarkable in that it comprises:
• a partitioning module for subdividing at least one current block into a first and a second part, the first part having a rectangular or square shape and the second part forming the complement of the first part in the current block, the second part having a geometric shape with m sides, with m> 4,
• the invention also relates to a computer program comprising instructions for implementing one of the coding and decoding methods according to the invention, when it is executed on a computer.
• Such a 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 another desirable form.
• Still another object of the invention is directed to a computer readable recording medium, and including computer program instructions as mentioned above.
• the recording medium may be any entity or device capable of storing the program.
• the medium may include storage means, such as a ROM, for example a CD ROM or a microelectronic circuit ROM, or a magnetic recording means, for example a USB key or a hard disk.
• such a recording medium may be a transmissible medium such as an electrical or optical signal, which may be conveyed via an electrical or optical cable, by radio or by other means.
• the program according to the invention can be downloaded in particular on an Internet type network.
• such a recording medium may be an integrated circuit in which the program is incorporated, the circuit being adapted to execute the method in question or to be used in the execution of the latter.
• FIG. 1 represents an example of a conventional subdivision of a current block, such as the "quadtree" subdivision,
• FIGS. 2A and 2B show an application of the "quadtree" type subdivision to a current block containing a single element significant, a star, which is contained in a homogeneous zone such as for example a sky of uniform color,
• FIG. 3 represents the main steps of the coding method according to one embodiment of the invention
• FIG. 4 represents an embodiment of a coding device according to the invention
• FIGS. 5A to 5J respectively represent various subdivision embodiments according to the invention of the current block
• FIGS. 6A and 6B respectively represent two coding embodiments of the parts obtained by subdivision of the current block, according to a type of subdivision represented in FIG. 5A,
• FIG. 7 represents an example of subdivision of the current block to which the coding embodiment of FIG. 6B applies.
• FIG. 8 represents the main steps of the decoding method according to one embodiment of the invention.
• FIG. 9 represents an embodiment of a decoding device according to the invention.
• FIGS. 10A and 10B respectively represent two embodiments of decoding the parts obtained after reconstruction of the subdivision of the current block, according to a type of subdivision shown in FIG. 5A.
• the coding method according to the invention is for example implemented in a software or hardware way by modifications of such an encoder.
• the coding method according to the invention is represented in the form of an algorithm comprising steps C1 to C7 as represented in FIG.
• the coding method according to the invention is implemented in a coding device or coder CO shown in FIG.
• such an encoder comprises a memory MEM_CO comprising a buffer memory TAMP_CO, a processing unit UT_CO equipped for example with a microprocessor ⁇ and driven by a computer program PG_CO which implements the coding method according to the invention.
• the code instructions of the computer program PG_CO are for example loaded into a RAM memory (not shown) before being executed by the processor of the processing unit UT_CO.
• the coding method represented in FIG. 3 applies to any current image IC j that is fixed or part of a sequence of L images ld, IC j ,..., IC L (1 j j L L ) to be encoded. .
• a current image IC j is subdivided into a plurality of blocks of the above-mentioned CTU type: CTU 1; CTU 2 , CTU U , ..., CTU S (1 ⁇ u S S ).
• Such a subdivision step is implemented by a processor or partitioning software module MP_CO shown in FIG. 4, which module is driven by the microprocessor ⁇ of the processing unit UT_CO.
• each of CTU-i, CTU 2 , CTU U , ..., CTUs has a square shape and comprises NxN pixels, with N> 2.
• each of the CTU-i, CTU 2 , CTU U , ..., CTU blocks has a rectangular shape and comprises NxP pixels, with N> 1 and P> 2.
• the partitioning module MP_CO of Figure 4 subdivides the current block CTU U into at least a first part and a second part, the first and second parts being complementary to one another. According to the invention:
• the first part has a rectangular or square shape
• the current block CTU U is subdivided:
• the first and second parts respectively form two separate coding units CUi and CU 2 .
• This last terminology is notably used in the standard HEVC "ISO / IEC / 23008-2 Recommendation ITU-T H.265 High Efficiency Video Coding (HEVC)".
• the first part CUi is a square block of size ⁇ x ⁇
• the second part CU 2 which forms the complement of the first part CUi in the current block CTU U , has a geometric shape with m sides, with m> 4.
• the last pixel pbr- of the first part CU-i of coordinates (x'max, y'max) which is located at the bottom and to the right in the latter.
• the first pixel ptl u of the current block CTU U is the same as the first pixel pth of the first part Clh.
• the second part 2 of geometric form m-sides is then generally defined as a set of pixels ptl 2 such that for any pixel pv 2 (x " v , y" v) of this set :
• the first part CU 1 is a square block of size ⁇ x ⁇ ,
• the second part CU 2 which forms the complement of the first part CU 1 in the current block CTU U , has a geometric shape with m sides, with m> 4.
• sixteen subdivision types SUB1 2 , SUB2 2 , SUB16 2 of the current block CTU U are possible, the square block CU 1 being able to be located in sixteen different positions inside the current block CTU U , by successive translation of N / 4 pixels of the square block CU 1 inside the current block CTU U.
• the first pixel pt1 u of the current block CTU U is the same as the first pixel pt of the first part
• the second part 2 of geometric shape m-side is then defined generally as a set of pixels such that for any pixel pv 2 (x " v , y" v) of this set :
• the first CUi part is a rectangular block size UXV pixels, such that U ⁇ N and V ⁇ N, all of the coordinates of such a rectangular block being selected from a predefined list LT several sets of coordinates defining each a rectangular block of a predetermined shape, the list LT a being stored in the buffer memory TAMP_CO of the encoder CO of FIG. 4,
• the second part CU 2 which forms the complement of the first part CUi in the current block CTU U , has a geometric shape with m sides, with m> 4.
• the definition of the second portion CU 2 of the current block CTU U is the same as that given in the examples of FIGS. 5A and 5B.
• the current block CTU U is a rectangle of size NxP pixels, with N> 1 and P> 2.
• the first part CUi is a rectangular block of size UxV, such that U ⁇ N and V ⁇ P, the set of coordinates of such a rectangular block being chosen from a list LT b predefined of several sets of coordinates each defining a rectangular block of a predetermined shape, the list LT b being stored in the buffer TAMP_CO of the coder CO of FIG. 4,
• the second part CU 2 which forms the complement of the first part CUi in the current block CTU U , has a geometric shape with m sides, with m> 4.
• the definition of the second portion CU 2 of the current block CTU U is the same as that given in the examples of FIGS. 5A and 5B.
• each of the CTU current blocks U or only a portion, which has been subdivided in accordance with the different subdivision modes according to the invention as represented in FIGS. 5A to 5K, is set in competition :
• Such placing in competition is performed according to a predetermined coding performance criterion of the CTU U current block, for example the cost rate / distortion or a compromise between efficiency and complexity, which are criteria well known to those skilled in the art.
• the competition is implemented by a processor or calculation software module CAL1_CO shown in FIG. 4, which module is driven by the microprocessor ⁇ of the processing unit UT_CO.
• an optimum subdivision mode SUBo pt of the current block CTU U is selected, that is to say it is the one that optimizes the coding of the block CTU U by minimization cost / distortion cost or by maximizing the efficiency / complexity trade-off.
• step C4 represented in FIG. 3, an indicator representative of the subdivision mode selected at the end of step C3 is selected in a correspondence table TC stored in the buffer TAMP_CO of the coder CO of FIG. 4.
• Such a selection is implemented by a processor or calculation software module CAL2_CO shown in FIG. 4, which module is driven by the microprocessor ⁇ of the processing unit UT_CO.
• the indicator representative of a given subdivision mode is for example a syntax element called cut_type which, according to a preferred embodiment, takes for example three values:
• the syntax element type_decut is 1
• the latter is associated, in the correspondence table TC of FIG. 4, with another syntax element called arr_decoupe1 which indicates the type of subdivision SUBI -i, SUB2i, SUB3i, SUB4i selected, as shown in Figure 5A.
• the syntax element arr_decoupe1 takes the value:
• the syntax element type_decut is 2
• the latter is associated, in the correspondence table TC of FIG. 4, with another syntax element called arr_decoupe2 which indicates the type of subdivision chosen from the sixteen subdivision types SUB1 2 , SUB2 2 , SUBI 6 2 of the current block CTU U , as shown in FIG. 5B.
• the syntax element arr_decoupe2 has the value:
• step C5 the value of the syntax element type_cut which has been selected at the end of the above-mentioned step C4 is coded and, if applicable , to the coding of the syntax element arr_decoupe1 or arr_decoupe2 associated with it.
• step C5 is implemented by a processor or indicator coding software module MCI as represented in FIG. 4, which module is controlled by the microprocessor ⁇ of the processing unit UT_CO.
• the portions CUi and CU 2 of the current block CTU U are coded according to a predetermined order of travel.
• the first part CUi is coded before the second part CU 2 .
• the first part CUi is coded after the second part CU 2 .
• the coding step C6 is implemented by a processor or UCO coding software module as shown in FIG. 4, which module is driven by the microprocessor ⁇ of the processing unit UT_CO.
• the UCO coding module conventionally comprises:
• a processor or software module for calculating residual data CAL3_CO a processor or software module for calculating residual data CAL3_CO, a processor or software module MT_CO of transformation of the DCT type (abbreviation of "Discrete Cosine Transform"), DST (abbreviation of “Discrete Sine Transform”), DWT (abbreviation of "Discrete Wavelet Transform”)
• processors or software module MCE_CO of entropy coding for example of CABAC type ("Context Adaptive Binary Arithmetic Coder" in English) or a Huffman coder known as such.
• step C7 shown in Figure 3 it is proceeded to the construction of a data signal F which contains the data coded at the end of steps C5 and C6 above.
• the data signal F is then transmitted by a communication network (not shown) to a remote terminal.
• Step C7 is implemented by a processor or software module MCF for constructing a data signal, as shown in FIG. 4.
• FIG. 6A will now describe a first embodiment of the different substeps implemented during the aforementioned coding step C6 in the UCO coding module shown in FIG. 4.
• the optimal subdivision mode SUB op t which has been selected at the end of coding step C3 is for example one of the subdivision modes shown in FIG. 5A.
• it is the indicator type_cut of value 1 which was selected at the end of step C4 above. More specifically, it is for example the type of subdivision SUBD2, as shown in FIG. 5A, which has been selected at the end of the coding step C3.
• the indicator type_cut of value 1 is further associated with the indicator arr_cutter1 of value 1, as defined above in the description.
• the value 1 of the cut_type_indicator is written in compressed form in the data signal F, followed by the value 1 of the cut_stop1 flag.
• the portions CU 1 and CU 2 of the current block CTU U are not subdivided again.
• the value of the cut_type_indicator associated with the coded data of the second portion CU 2 is written in compressed form in the data signal F before the value of the cutoff_type_indicator associated with the coded data of the first portion CU -i.
• the data signal F therefore contains the following values: 1 133 which are representative of the partitioning of the current block CTU U.
• the data signal F therefore contains the following values: 1 13, which reduces the cost of signaling.
• the module PRED_CO of FIG. 4 proceeds to the predictive coding of the current part.
• the pixels of the CUi portion are predicted with respect to pixels that have already been coded and then decoded, by putting in competition known intra and / or inter prediction techniques.
• the optimal prediction is chosen according to a rate-distortion criterion well known to those skilled in the art.
• Said aforementioned predictive coding sub-step makes it possible to construct a predicted part CUpi which is an approximation of the current part CU-i.
• the information relating to this predictive coding will subsequently be entered in the data signal F represented in FIGS. 3 and 4.
• Such information notably comprises the type of prediction (inter or intra), and, if appropriate, the intra or intra prediction mode. well the reference image index and the displacement vector used in the inter prediction mode. This information is compressed by the coder CO shown in FIG.
• the calculation module CAL3_CO of Figure 4 proceeds to subtract the predicted portion CUpi of the current portion CUi to produce a residue portion CUn.
• the MT_CO module of FIG. 4 proceeds with the transformation of the residue part CUn according to a conventional direct transformation operation, such as, for example, a discrete cosine transformation of the type DCT, to produce a transformed part CUt-i.
• a conventional direct transformation operation such as, for example, a discrete cosine transformation of the type DCT
• the module MQ_CO of FIG. 4 proceeds with the quantization of the transformed part CUti according to a conventional quantization operation, such as, for example, scalar quantization. A portion CUq- ⁇ , formed of quantized coefficients, is then obtained.
• the MCE_CO module of FIG. 4 proceeds with the entropic coding of the quantized coefficients CUq-i.
• the aforementioned sub-steps C61 1 to C615 are then iterated in order to code the second part CU 2 with m sides of the current block CTU U.
• one or more coding information of the pixels of the second portion CU 2 are set to predetermined values.
• the pixels of the portion CU 2 are predicted with respect to pixels of corresponding values respectively. predetermined. Such values are stored in a list LP contained in the buffer memory TAMP_CO of the coder CO of FIG. 4.
• these predetermined prediction values are selected so that during the sub-step C612 of FIG. 6A, the subtraction of the predicted portion CUp 2 of the current portion CU 2 produces a residue portion CUr 2 which includes pixel values that are null or close to zero.
• Such an arrangement makes it possible advantageously to take advantage of the homogeneity of the portion CU 2 of the current block CTU U while at the same time making it possible to substantially reduce the cost of signaling the coding information of the current block CTU U in the data signal F.
• the pixels of the portion CU 2 are conventionally predicted, in the same way as the portion CU-i.
• the quantized coefficients of the quantized residual portion CUq 2 obtained at the end of the substep C614 of FIG. 6A are all set to zero and are not written in the data signal F.
• an intermediate substep C6120 is implemented between the substeps C612 and C613 mentioned above.
• the residual pixels of the residue portion CUr 2 with m sides are completed by pixels of predetermined respective value, until a block of square or rectangular pixels is obtained.
• the residual pixels of the residue portion CUr 2 can be completed:
• the aforementioned sub-step C6120 is implemented by a processor or calculation software module CAL4_CO as shown in FIG. 4, which module is driven by the microprocessor ⁇ of the processing unit UT_CO.
• sub-step C612 only applies to the second part CU 2 of geometrical shape with m sides
• this sub-step, as well as the calculation module CAL4_CO, are represented in dotted lines, respectively on the Figures 3 and 4.
• This second embodiment differs from that of FIG. 6A in that the first portion CUi of the CTU current block U is subdivided again.
• An example of such a subdivision of the current block CTU U is shown in FIG. 7.
• the optimum subdivision mode SUB op t which has been selected at the end of the coding step C3 mentioned above is, for example, again the indicator type_cut of value 1 which has been selected at the outcome of step C4 above. As shown in Figure 7, this value is entered in compressed form in the data signal F. As explained above, the indicator type_cut of value 1 is further associated with the indicator arr_cutter1 of value 1, as defined above in the description. As shown in FIG. 7, the value of the indicator arr_cutter1 of value 1 is then written in compressed form in the data signal F following the value of the indicator type_cut.
• the second portion CU 2 of the current block CTU U is not subdivided again on the assumption that it is representative of a homogeneous zone of the CTU U current block.
• the value 3 of the indicator type_cut is written in compressed form in the data signal F, following the value 1 of the indicator arr_cut1. This value is shown in bold in Figure 7.
• the value of the type_decoupe flag associated with the coded data of the second part CU 2 is written in compressed form in the data signal F systematically before the value of the indicator type_decoupe associated with the coded data of the first part CU-i.
• the value of the cut_type_indicator associated with the coded data of the second portion CU 2 could be written in compressed form in the data signal F systematically after the value of the indicator type_decoupe associated with the coded data of the first part.
• the portion CUi is subdivided for example into four square blocks CU1 -i, CU2, CU3i, CU4, according to a conventional subdivision method, of the "quadtree" type, for example.
• the coded data of the part CU 1 are therefore associated with the indicator type_cut of value 0, representative of such a subdivision, as defined above in the description. As shown in FIG. 7, this value is written in compressed form in the data signal F, following the value 3 of the type_decoupe flag.
• the block CU1 1 is not subdivided.
• the coded data of the CUi part are therefore associated in addition with the indicator type_cut of value 3, representative of the absence of such a subdivision, as defined above in the description.
• this value is written in compressed form in the data signal F, following the value 0 of the type_decoupe flag.
• the block CU2 is subdivided according to the invention, in particular according to the type of subdivision SUB6 2 represented in FIG. 5B.
• the block CU2 is subdivided into a first part CU21 of square shape and a second part CU22i with m sides.
• the second portion CU22i has 8 sides.
• the coded data of the CUi part are therefore associated in addition to the indicator type_cut of value 2, itself associated with the indicator arr_decoupe2 of value 6, as defined above in the description. As shown in FIG. 7, these values 2 and 6 are written successively in compressed form in the data signal F, following the value 3 of the type_decoupe flag.
• the block CU3i is subdivided into four square blocks CU31 i, CU321, CU331, CU341, according to a conventional subdivision method, of the "quadtree" type, for example.
• the coded data of the CUi part are therefore associated in addition with the indicator type_cut of value 0, representative of such a subdivision, as defined above in the description. As shown in FIG. 7, this value is written in compressed form in the data signal F, following the value 6 of the indicator arr_decoupe2.
• the block CU4 is not subdivided.
• the coded data of the CUi part are therefore associated in addition with the indicator type_cut of value 3, representative of the absence of such a subdivision, as defined above in the description. As shown in FIG. 7, this value is written in compressed form in the data signal F, following the value 0 of the type_decoupe flag.
• the second part CU22i of the block CU2i is not subdivided again on the assumption that it is representative of a homogeneous zone of this block.
• the value 3 of the indicator type_cut is then written in compressed form in the data signal F, following the value 3 of the indicator type_decoupe. This value is shown in bold in Figure 7.
• the value of the cut_type_indicator associated with the CU22 part m side of the CU2 block is written in compressed form in the data signal F systematically before the value of the cut_type_indicator associated with the square portion CU21 of the CU2-I block.
• the value of the indicator type_decoupe associated with the part is the value of the indicator type_decoupe associated with the part
• CU22-I with m sides of the block CU2 could be written in compressed form in the data signal F systematically after the value of the indicator type_decoupe associated with the square portion CU21 1 of the block CU2-I.
• the first portion CU21 i of the block CU2i is not subdivided.
• the value 3 of the indicator type_decoupe is then written in compressed form in the data signal F, following the value 3 of the indicator type_decoupe associated with the CU22i part with m sides of the CU2-I block.
• the four CU31 blocks i, ⁇ 32 1; CU33i, CU34-I of the CU3i block are not subdivided.
• the value 3 of the cut_type_indicator is then written in compressed form successively four times in the data signal F, following the value 3 of the cut_type_indicator associated with the CU21 part 1 of the CU2-I block.
• the two values 3 of the indicator type_decoupe as represented in bold in FIG. 7 and representative of the absence of subdivision of the m-side portions CU 2 and CU22i of the current block CTU U do not are not written in the data signal F, which reduces the cost of signaling. It is indeed assumed in coding, as in decoding, that a part with m sides of the current block is systematically not subdivided. Thus, the transmission to the decoder of a type_decoupe indicator of value 3 is not necessary.
• the UCO coding module tests whether the index k associated with the current portion CU k is 1 or 2.
• the portion CU 2 of the current block CTU U is coded according to the substeps C61 1 to C615 of FIG. 6A.
• the UCO coding module of FIG. 4 selects a current sub-portion CU k 'of the first portion CUi of the block current CTU U , such that 1 ⁇ k' ⁇ N.
• N 8 since the first portion CUi of the current block CTU U has been subdivided into eight sub-parts of the "coding unit" type CU1 i, CU21 1; CU22 1; CU31 i, CU32 1; CU33i, CU34 1; CU4i.
• PRED_CO of FIG. 4 selects for this current subpart CU an intra or intra prediction mode, for example by putting these modes in competition according to a rate-distortion criterion.
• the prediction mode selected is associated with an indicator PR which is intended to be transmitted in the data signal F.
• the partitioning module MP_CO of FIG. 4 subdivides the current subpart CU k into a plurality W of prediction sub-parts PU-i, PU 2 , PU Z , ... PU W (1 ⁇ z ⁇ W) of the type "prediction unit" above.
• Such a subdivision may be conventional or in accordance with the invention, as shown in FIGS. 5A and 5B.
• a succession of indicators representative of the subdivision is intended to be transmitted in the data signal F.
• the UCO coding module of FIG. 4 selects a first current sub-portion PU Z. Such a selection is made in a predefined order, such as for example the lexicographic order.
• the module PRED_CO of FIG. 4 selects for the current subpart PU Z the optimal prediction parameters associated with the prediction mode selected in the substep C623 mentioned above. .
• the optimal prediction parameters are one or more motion vectors, as well as one or more reference images, such optimal parameters making it possible to obtain the best coding performance of the current subpart PU Z according to a predetermined criterion, such as for example the rate-distortion criterion.
• the optimal prediction parameters are associated with an INTRA mode selected from among various available INTRA modes.
• the optimal prediction parameters are those that make it possible to obtain the best coding performance of the current sub-part PU Z according to a predetermined criterion, such as, for example, the rate-distortion criterion.
• the substeps C625 to C626 are iterated for each of the sub-parts PU-1, PU 2 , PUz,... PUw of the current subpart CUk 'of the first part CUi of the current block CTU U , in the predetermined lexicographic order.
• the partitioning module MP_CO of FIG. 4 sub-divides the current subpart CU CU into a plurality Z of transform subparts TU-i, TU 2 , TU W , ... TU Z (1 ⁇ w ⁇ Z) of the aforementioned "transform unit" type.
• Such a subdivision may be conventional or in accordance with the invention, as shown in FIGS. 5A and 5B.
• a succession of indicators representative of the subdivision is intended to be transmitted in the data signal F.
• the UCO coding module of FIG. 4 selects a first sub-part of the current transform TU W. Such a selection is made in a predefined order, such as for example the lexicographic order.
• the calculation module CAL3_CO of FIG. 4 proceeds, in a manner similar to the sub-step C612 of FIG. 6A, to the calculation of a sub-part residue TUr w .
• the MT_CO module of FIG. 4 transforms the residue sub-part TUr w according to a conventional direct transformation operation, such as, for example, a cosine transformation. discrete DCT type, to produce a transformed sub-part TUt w .
• the module MQ_CO of FIG. 4 proceeds with the quantization of the transformed sub-part TUtw according to a conventional quantization operation, such as for example a scalar quantization.
• a subset TUq w formed of quantized coefficients, is then obtained.
• the MCE_CO module of FIG. 4 proceeds to the entropy coding of the quantized coefficients TUq w .
• the set of substeps C628 to C632 is iterated for each of the subsections TU-i, TU 2 , TU W , ..., TUz of the current subpart CUk 'of the first part CUi of the current block CTU U , in the predetermined lexicographic order.
• an intermediate substep C6290 is implemented between the sub-steps C629 and C630 mentioned above.
• the residual pixels of the residual sub-part TUr w to m sides are completed by pixels of zero value or coded according to a predetermined coding method, until a block is obtained. square or rectangular pixels.
• the aforementioned sub-step C6290 is implemented by the calculation software module CAL4_CO as represented in FIG. 4.
• the module MQ_CO of FIG. 4 proceeds to the quantification of the transformed current subpart TUt w to the exclusion of the pixels added during the substep C6290 and which were transformed during the substep C630.
• the set of substeps C622 to C632 is iterated for each of the sub-portions CU-i, CU 2 , CU k , ..., CU N of the first portion CUi current of the current block CTU U , in the order lexicographic predetermined.
• the decoding method according to the invention is used to decode a data signal representative of an image or a sequence of images that is capable of being decoded. by a decoder according to any one of the present or future video decoding standards.
• the decoding method according to the invention is for example implemented in a software or hardware way by modifications of such a decoder.
• the decoding method according to the invention is represented in the form of an algorithm comprising steps D1 to D7 as represented in FIG. 8.
• the decoding method according to the invention is implemented in a decoding device or decoder DO represented in FIG. 9.
• the decoder DO comprises a memory MEM_DO which itself comprises a buffer memory TAMP_DO, a processing unit UT_DO equipped for example with a microprocessor ⁇ and driven by a PG_DO computer program that implements the decoding method according to the invention.
• the code instructions of the computer program PG_DO are for example loaded into a RAM memory before being executed by the processor of the processing unit UT_DO.
• the decoding method shown in FIG. 8 applies to a data signal representing a current image IC j to be decoded or to a sequence of images to be decoded.
• information representative of the current image IC j to be decoded is identified in the data signal F received at the decoder DO, as delivered following the coding method of FIG. 3.
• the quantized blocks CTUq-1, CTUq 2 , ..., CTUq u , CTUqs (1 ⁇ u ⁇ S) are identified in the signal F. ) respectively associated CTU-i blocks, CTU 2 , CTU U , ..., CTUs previously coded according to the aforementioned lexicographic order, according to the coding method of Figure 3.
• Such an identification step is implemented by a processor or MI_DO flow analysis software module, as shown in FIG. 9, said module being driven by the ⁇ microprocessor of the processing unit UT_DO.
• each of the blocks to be decoded CTU-i, CTU 2 is decoded.
• CTU U ..., CTUs has a square shape and includes NxN pixels, with N> 2.
• each of the blocks to be decoded CTU-i, CTU 2 , CTU U , ..., CTUs has a rectangular shape and comprises NxP pixels, with N> 1 and P> 2.
• the decoder DO of FIG. 9 selects as the current block the first quantized block CTUq u which contains quantized data which has been coded during step C6 of FIG. .
• step D3 in association with the quantized block CTUq u that has been selected, the compressed value of the syntax element type_decoupe which has been selected at the reading is read. from step C4 of Figure 3 and, if applicable, the compressed value of the syntax element arr_decoupe1 or arr_decoupe2 associated with it.
• the syntax element type_decoup denotes the indicator representative of a given subdivision mode.
• the syntax element type_decoupe takes for example three values: - 0 to indicate a conventional subdivision of the current block into four rectangular or square blocks,
• the reading step D3 is performed by a processor or read software module ML_DO, as shown in FIG. 9, which module is driven by the microprocessor ⁇ of the processing unit UT_DO.
• LT b list of several sets of coordinates each defining a rectangular block of a predetermined shape
• step D4 the value of the cut-type syntax element which has been read in the aforementioned step D3 and, if applicable, the decoding of the value of the syntax element arr_decoupe1 or arr_decoupe2 associated with it.
• step D4 is implemented by a processor or MDI indicator decoder software module as shown in FIG. 9, which module is driven by the microprocessor ⁇ of the processing unit UT_DO.
• the CTU U current block is subdivided into at least a first portion CU 1 and a second portion CU 2 , the first and second portions being complementary to one another. 'other. According to the invention:
• the first part CUi has a rectangular or square shape
• the second part CU 2 has a geometric shape with m sides, with m> 4.
• the current block CTU U is subdivided: in a first part CUi of rectangular or square shape or in a plurality of parts of rectangular or square shape,
• the subdivision step D5 is performed by a processor or partitioning software module MP_DO, as shown in FIG. 9, which module is driven by the microprocessor ⁇ of the processing unit UT_DO.
• the CUi and CU 2 portions of the CTU U current block are decoded to be decoded according to a predetermined travel order.
• the first part CUi is decoded before the second part CU 2 .
• the first part CUi is decoded after the second part CU 2 .
• the decoding step D6 is implemented by a processor or decoder software module UDO as shown in FIG. 9, which module is driven by the microprocessor ⁇ of the processing unit UT_DO.
• the UDO decoding module conventionally comprises:
• processors or software module MDE_DO of entropy decoding for example of CABAC type ("Context Adaptive Binary Arithmetic Coder" in English) or a Huffman decoder known as such,
• DST 1 abbreviation of "Discrete Sine Transform”
• DWT 1 abbreviation of "Discrete Wavelet Transform”
• step D6 a decoded current block CTUD U is obtained.
• said decoded block CTUD U is written in a decoded image ID j .
• Such a step is implemented by a processor or software module URI image reconstruction as shown in Figure 9, said module being controlled by the microprocessor ⁇ processing module UT_DO.
• the data signal F contains the partitioning indicators of a CTU current block U which has been coded according to the embodiment of FIG. 6A.
• the signal F contains the following four values 1 133 which have been decoded at the end of the aforementioned step D4 and which are representative:
• the data signal F contains the following three values 1 13, in the case where the indicator type_cutter of value 3 associated with the coded data of the second part CU 2 has not been written in the data signal F, considering that the second portion CU 2 defines a homogeneous area of the current block CTU U. Consequently, the cut_type flag is systematically set to the predetermined value 3, so that the second portion CU 2 is not subdivided at decoding.
• an entropic decoding of the set of quantized coefficients CUqi current associated with the first part CU-i is carried out.
• the decoding performed is an entropy decoding of arithmetic type or Huffman.
• the substep D61 1 then consists of:
• Such a substep D61 1 entropy decoding is implemented by the entropy decoding module MDE_DO shown in Figure 9.
• Such reconstruction information includes in particular the type of prediction (inter or intra), and if appropriate, the intra prediction mode or the reference image index and the displacement vector used in the mode of the prediction.
• dequantization of the digital information obtained following substep D61 1 is carried out according to a conventional dequantization operation which is the inverse operation of the quantification implemented during the substep Quantization C614 of Figure 6A.
• a set of dequantized coefficients CUDqi current is then obtained at the end of substep D612.
• Such a sub-step D612 is performed by means of the dequantization module MQ "1 _DO, as represented in FIG. 9.
• the current set of dequantized coefficients CUDqi is transformed, such a transformation being an inverse direct transformation, such as, for example, a discrete inverse cosine transformation.
• type DCT "1. This transformation is the inverse of the transformation performed to the C613 substep of Figure 6A. at the end of the D613 substep is obtained residue decoded part CUDr-,. a this operation is performed by the MT module "1 _DO shown in FIG. 9.
• the PRED module "1 _DO" of FIG. 9 performs the predictive decoding of the current portion CUi with the aid of the information relating to the predictive coding of the CUi portion which has were decoded during the substep D61 1 above.
• Said aforementioned predictive decoding sub-step makes it possible to construct a predicted part CUDpi which is an approximation of the current part CUi to be decoded.
• CAL2_DO of FIG. 9 proceeds to the reconstruction of the current part CUi by adding to the decoded residue part CUDn, obtained at the end of the substep D613, the predicted part CUDpi which was obtained at the end of the sub-step step D614 above.
• the aforementioned substeps D610 to D615 are then iterated in order to decode the second part CU 2 with m sides of the current block CTU U.
• one or more reconstruction information pixels of the second portion CU 2 are set to predetermined values.
• the pixels of the portion CU 2 to be decoded are predicted with respect to pixels of predetermined corresponding values, respectively.
• Such values are stored in a list LP contained in the buffer memory TAMP_DO of the decoder DO of FIG. 9.
• the sub-step D610 of FIG. 10A is not implemented since no set of quantized coefficients associated with the portion CU 2 with m sides has been transmitted in the data signal F
• the quantized coefficients of the quantized residual portion CUq 2 are then all directly set to zero by the UDO decoding module of FIG.
• the aforementioned sub-step D61 1 is not implemented in its entirety, the decoder DO deducing directly, following the abovementioned substep D610, predetermined values of associated reconstruction information. at the residue portion CUr 2 .
• the pixels of the portion CU 2 to be decoded are predicted conventionally, in the same way as the portion CU-i.
• an intermediate step D61 is implemented.
• the decoded pixel values that have been obtained as a result of the entropy decoding step of the plurality of digital information associated with the current set of quantized coefficients CUq 2 are supplemented by values of predetermined pixels, until a block of square or rectangular pixel values is obtained.
• the pixel values associated with the set of quantized coefficients CUq 2 current can be completed:
• the substep D61 10 mentioned above is implemented by a calculation software module CAL1_DO as shown in FIG. 9, which module is driven by the microprocessor ⁇ of the processing unit UT_DO.
• sub-step D61 applies only to the decoded pixel values that were obtained as a result of the entropy decoding step of the plurality of digital information associated with the set of coefficients quantized CUq 2 geometric-shaped current with m sides, this step, as well as the calculation module CAL1_DO, are represented in dashed lines, respectively in FIGS. 10A and 9.
• This second embodiment differs from that of FIG. 10A in that the first portion CU i to be decoded from the CTU current block U is subdivided again.
• the data signal F contains the partitioning indicators of a CTU current block U which has been coded according to the embodiment of FIG. 6B.
• the signal F contains the following fifteen values as shown in FIG. 7 and which have been decoded at the end of FIG. step D4 above.
• the data signal F does not contain the two values equal to 3 represented in bold, in the case where:
• the indicator type_cut of value 3 associated with the coded data of the second part CU 2 has not been entered in the data signal F, taking into account the fact that the second part CU 2 defines a homogeneous zone of the current block CTU U ,
• the cut_type indicator is systematically set to the predetermined value 3, so that neither the second portion CU 2 of the current block CTU U to be decoded, nor the second portion CU22 m-side of the block CU2 of the current block CTU U to decode, is subdivided at decoding.
• the decoding module UDO tests whether the index k associated with the current part CU k to be decoded is 1 or 2.
• the portion CU 2 of the current block CTU U to be decoded is decoded according to the substeps D610 to D615 of FIG. 10A.
• the decoding module UDO of FIG. 9 selects a current subpart CU to be decoded from the first portion CUi of the block current CTU U to be decoded, such that 1 ⁇ k' ⁇ N.
• N 8 since the first portion CUi of the current block CTU U has been subdivided into eight sub-parts of the "coding unit" type CU1 1; CU21 1; CU22 1; CU31 1; CU32 1; CU33 1; CU34 1; CU4L
• the entropy decoding module MDE_DO of FIG. 9 performs an entropy decoding of the set of quantized coefficients CUq k 'current associated with the current subpart CU k of the first part CUi of the current block CTU U to be decoded.
• the decoding performed is an entropy decoding of arithmetic type or Huffman.
• Sub-step D623 then consists of:
• the entropy decoding module MDE_DO of FIG. 9 also performs an entropy decoding of the indicator PR representative of the inter or intra prediction mode that has been selected for this current subpart CU during sub-step C623 of Figure 6B.
• the read-only software module ML_DO of FIG. 9 proceeds to read the compressed value of the representative indicator such subdivision.
• Such an indicator consists of the syntax element type_cut and, if applicable, the syntax element arr_cut1 or cut_decoup2 that is associated with it.
• the MDI indicator decoding software module of FIG. 9 proceeds to decode the value of the syntax element type_decut that has been read from FIG. substep D624 above and, if applicable, the decoding of the value of the syntax element arr_decoupe1 or arr_decoupe2 associated with it.
• the partitioning software module MP_DO of FIG. 9 sub-divides the current sub-part CU 1 to be decoded into a plurality W of prediction subparts PU 1 , PU 2 , PU Z , ..., PU W (1 ⁇ z ⁇ W).
• the decoding module UDO of FIG. 9 selects a first current sub-portion PU Z. Such a selection is made in a predefined order, such as for example the lexicographic order.
• the entropy decoding module MDE_DO of FIG. 9 proceeds, in association with the current subpart PU Z , to an entropy decoding of the optimal prediction parameters which have were selected during substep C626 of FIG. 6B, in association with the PR indicator, which is representative of the prediction mode selected in substep C623 above and decoded in substep D623.
• the prediction mode INTER has been selected in the aforementioned sub-step C623
• the decoded optimal prediction parameters are one or more motion vectors, as well as one or more reference images.
• the optimal prediction parameters are associated with an INTRA mode selected from among various available INTRA modes.
• the substeps D627 to D628 are iterated for each of the sub-parts PU-i, PU 2 , PU Z ,..., PU W of the current subpart CU k > to be decoded from the first part CU i of the current block CTU U , in the predetermined lexicographic order.
• the read software module ML_DO of FIG. 9 proceeds to read the compressed value of the representative indicator of such subdivision.
• Such an indicator consists of the cut_type syntax element and, if applicable, the syntax element arr_decoupe1 or arr_decoupe2 associated with it.
• the MDI indicator decoding software module of FIG. 9 decodes the value of the syntax element type_cut which has been read to the subscript. said step D629 and, if applicable, decoding the value of the syntax element arr_decoupe1 or arr_decoupe2 associated with it.
• the partitioning software module MP_DO of FIG. 9 sub-divides the current sub-part CU k 'to be decoded into a plurality Z of sub-parts of transform TU 1 .
• TU 2 ..., TU W , ..., TU Z (1 ⁇ w Z Z ).
• the decoding module UDO of FIG. 9 selects the set of quantized coefficients TUq w current associated with the first current transform sub-part TU W. Such a selection is made in a predefined order, such as for example the lexicographic order.
• the entropy decoding module MDE_DO of FIG. 9 performs an entropy decoding of the set of quantized coefficients TUq w current associated with the first current transform sub-part. TU W to decode.
• the decoding performed is an entropy decoding of arithmetic type or Huffman.
• Sub-step D633 then consists of:
• the dequantization module MQ "1 _DO of FIG. 9 dequantizes the digital information obtained as a result of substep D633, according to a conventional operation of FIG. dequantization which is the reverse operation of the quantization implemented during the quantization sub-step C631 of FIG. 6B.
• a set of dequantized coefficients TUDq w current is then obtained at the end of substep D634.
• the MT module "1 _DO of FIG. 9 carries out a transformation of the set of dequantized coefficients TUDq w current, such a transformation being a direct inverse transformation, such as that, for example, a reverse discrete cosine transformation of DCT type 1.
• This transformation is the inverse operation of the transformation carried out in substep C630 of FIG.6A.
• substep D635 there is obtained a decoded residue part TUDr w .
• the PRED module "1 _DO" of FIG. 9 proceeds to the predictive decoding of the first current transform subunit TU W using the optimal prediction parameters which were read during the aforementioned substep D628.
• Said aforementioned predictive decoding sub-step makes it possible to construct a first predicted current transform subunit TUDp w which is an approximation of the first current transform sub-part TU W to be decoded.
• the module CAL2_DO of FIG. 9 proceeds to the reconstruction of the first sub-part of the current transform TU W by adding to the decoded residue part TUDr w , obtained at From the substep D635, the predicted part TUDp w which was obtained at the end of the substep D636 above.
• the set of substeps D632 to D637 is iterated for each of the subsections TU-i, TU 2 , TU W ,..., TU Z to be decoded of the sub-part CU k > current to be decoded from the first CUi part of CTU current block U , in the predetermined lexicographic order.
• an intermediate substep D6330 is implemented between substeps D633 and D634 mentioned above.
• the decoded pixel values that were obtained as a result of the entropy decoding sub-step D633 of the plurality of digital information associated with the set of quantized coefficients TUq w current are supplemented by predetermined pixel values until a block of square or rectangular pixel values is obtained.
• the substep D6330 mentioned above is implemented by the calculation software module CAL1_DO as represented in FIG. 9.
• the set of substeps D622 to D637 is iterated for each of the sub-portions CU-i, CU 2 , CU k , ..., CU N to be decoded from the first part CUi current of the current block CTU U , in the predetermined lexicographic order.

Landscapes

• Engineering & Computer Science (AREA)
• Multimedia (AREA)
• Signal Processing (AREA)
• Compression Or Coding Systems Of Tv Signals (AREA)
• Compression Of Band Width Or Redundancy In Fax (AREA)
• Compression, Expansion, Code Conversion, And Decoders (AREA)

Priority Applications (1)

Applications Claiming Priority (2)

Related Child Applications (1)

Publications (1)

Family

ID=53541685

Family Applications (2)

Family Applications Before (1)

Country Status (5)

Families Citing this family (5)

Family Cites Families (15)

• 2014
  • 2014-11-27 FR FR1461607A patent/FR3029333A1/fr active Pending
• 2015
  • 2015-11-24 US US15/527,548 patent/US10924769B2/en active Active
  • 2015-11-24 EP EP23214427.9A patent/EP4311240A3/fr active Pending
  • 2015-11-24 CN CN201580063549.8A patent/CN107005719B/zh active Active
  • 2015-11-24 WO PCT/FR2015/053196 patent/WO2016083729A2/fr active Application Filing
  • 2015-11-24 CN CN202110366801.XA patent/CN113207005B/zh active Active
  • 2015-11-24 EP EP15822963.3A patent/EP3225031A2/fr not_active Ceased
• 2021
  • 2021-01-06 US US17/142,612 patent/US11825129B2/en active Active

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events