EP3324633B1 - Décodage d'un paramètre de quantification vidéo - Google Patents

Décodage d'un paramètre de quantification vidéo Download PDF

Info

Publication number
EP3324633B1
EP3324633B1 EP17204157.6A EP17204157A EP3324633B1 EP 3324633 B1 EP3324633 B1 EP 3324633B1 EP 17204157 A EP17204157 A EP 17204157A EP 3324633 B1 EP3324633 B1 EP 3324633B1
Authority
EP
European Patent Office
Prior art keywords
quantization parameter
bin
binary arithmetic
dqp
video
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
EP17204157.6A
Other languages
German (de)
English (en)
Other versions
EP3324633A1 (fr
Inventor
Keiichi Chono
Hirofumi Aoki
Yuzo Senda
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NEC Corp
Original Assignee
NEC Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by NEC Corp filed Critical NEC Corp
Priority to PL17204157T priority Critical patent/PL3324633T3/pl
Publication of EP3324633A1 publication Critical patent/EP3324633A1/fr
Application granted granted Critical
Publication of EP3324633B1 publication Critical patent/EP3324633B1/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134Methods 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
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102Methods 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/13Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102Methods 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/124Quantisation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102Methods 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/124Quantisation
    • H04N19/126Details of normalisation or weighting functions, e.g. normalisation matrices or variable uniform quantisers
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134Methods 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/154Measured or subjectively estimated visual quality after decoding, e.g. measurement of distortion
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169Methods 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/1887Methods 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 variable length codeword
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/46Embedding additional information in the video signal during the compression process
    • H04N19/463Embedding additional information in the video signal during the compression process by compressing encoding parameters before transmission
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/70Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by syntax aspects related to video coding, e.g. related to compression standards
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/90Methods 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/91Entropy coding, e.g. variable length coding [VLC] or arithmetic coding
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding

Definitions

  • the present invention relates to a technique for coding a video quantization parameter for video coding that uses context-based adaptive binary arithmetic coding, and for example relates to a video quantization parameter coding method, a video quantization parameter decoding method, a video quantization parameter coder, a video quantization parameter decoder, a video quantization parameter coding program, and a video quantization parameter decoding program that are suitably applicable to a video coding device, a video decoding device, and the like.
  • Non Patent Literatures (NPLs) 1 and 2 each disclose a video encoding technique that uses context-based adaptive binary arithmetic coding (CABAC).
  • CABAC context-based adaptive binary arithmetic coding
  • Fig. 15 is a block diagram showing a structure of a video quantization parameter encoding device in the video encoding technique that uses CABAC.
  • the video quantization parameter encoder shown in Fig. 15 (hereafter referred to as the typical video quantization parameter encoder) includes a predictor 101, a buffer 102, a binarizer 1030, an adaptive binary arithmetic encoder 104, and a switch (SW) 111.
  • a predicted quantization parameter (predicted QP: PQP) supplied from the predictor 101 is subtracted from a quantization parameter (QP) input to the typical video quantization parameter encoder.
  • QP quantization parameter
  • delta QP delta quantization parameter
  • the PQP is a reconstructed quantization parameter (last reconstructed QP: LastRQP) of a last reconstructed image block.
  • the PQP is a reconstructed quantization parameter (left reconstructed QP: LeftRQP) of a left adjacent image block or a reconstructed quantization parameter (LastRQP) of a last reconstructed image block.
  • the PQP is added to the DQP and the sum is stored in the buffer 102 as a reconstructed quantization parameter (reconstructed QP: RQP), for subsequent quantization parameter encoding.
  • reconstructed QP reconstructed QP: RQP
  • the binarizer 1030 binarizes the DQP to obtain a bin string.
  • One bit of the bin string is referred to as a bin.
  • a bin that is binary arithmetic coded first is referred to as the first bin (1 st bin)
  • a bin that is binary arithmetic coded second is referred to as the second bin (2 nd bin)
  • a bin that is binary arithmetic coded nth is referred to as the nth bin (n th bin).
  • the bin and the bin string are defined in 3.9 and 3.12 in NPL 1.
  • Fig. 16 is an explanatory diagram showing a correspondence table between the DQP (rightmost column) and the bin string (center column) in NPLs 1 and 2.
  • a bin string index in the leftmost column in Fig. 16 indicates an index of a bin string corresponding to a DQP value.
  • the bin string index is 1 in the case where the DQP is 0, 2 * DQP - 1 in the case where the DQP is greater than 0, and -2 * DQP + 1 in the case where the DQP is less than 0 (where "*" denotes multiplication).
  • a context index in the lowermost row in Fig. 16 indicates an index of a context used for binary arithmetic encoding of a bin in a corresponding column.
  • the context index used for binary arithmetic encoding of the first bin is 0, the context index used for binary arithmetic encoding of the second bin is 2, and the context index used for binary arithmetic encoding of the third bin is 3.
  • the context mentioned here is a combination of a most probable symbol (PS) of the bin and its probability.
  • PS most probable symbol
  • the adaptive binary arithmetic encoder 104 binary arithmetic codes each bin of the bin string supplied via the switch 111 beginning with the first bin, using the context associated with the corresponding context index.
  • the adaptive binary arithmetic encoder 104 also updates the context associated with the context index according to the value of the binary arithmetic coded bin, for subsequent binary arithmetic encoding. Detailed operations of adaptive binary arithmetic encoding are described in 9.3.4 in NPL 1.
  • the typical quantization parameter encoder codes the input video quantization parameter based on the above-mentioned operations.
  • EP 2 536 145 A1 discloses a binarization of DQP using separate absolute value and sign in the framework of CABAC encoding.
  • the typical quantization parameter encoder performs binarization without distinguishing between information about whether the significant DQP is positive or negative and information about the absolute value of the significant DQP.
  • the typical quantization parameter encoder therefore has a problem of being unable to suitably code the significant DQP due to the following three factors.
  • the first factor is that, since the second bin (bin in the column “2 nd ”) and the subsequent bins (bins in the columns from "3 rd " onward) include information about three or more states which cannot be expressed by one bin, it is impossible to binary arithmetic code the bins using appropriate contexts. Information that can be expressed by one bin is information of which one of two states holds true. However, the second bin and the subsequent bins include information about three or more states which cannot be expressed by one bin. In detail, in Fig. 16 , the second bin includes the information of whether the DQP is positive or negative and the information indicating whether or not the absolute value of the significant DQP is greater than or equal to 1.
  • the subsequent bins from the third bin include the information of whether the DQP is positive or negative and the information indicating the magnitude of the absolute value of the significant DQP.
  • the second bin and the subsequent bins including information about three or more states which cannot be expressed by one bin.
  • the second factor is that redundant bins cannot be efficiently reduced in the case where the DQP range is asymmetric between positive and negative.
  • a specific DQP needs to be coded without reducing redundant bins, due to the presence of a bin string of a DQP that is not transmitted.
  • the DQP range defined in NPLs 1 and 2 is from -26 to 25, which is asymmetric between positive and negative.
  • the third factor is that the number of bins included in the bin string handled by the typical quantization parameter encoder is approximately twice the number of bins in the case of separately binarizing the information of whether the significant DQP is positive or negative and the absolute value of the significant DQP. A large number of bins lead to an increase in the amount of coded data and a decrease in the speed of the DQP encoding process and decoding process.
  • the present invention has an object of enabling suitable encoding of a video quantization parameter for video encoding that uses context-based adaptive binary arithmetic encoding, by resolving each of the above-mentioned factors.
  • Fig. 1 is a block diagram showing a structure of a video quantization parameter encoder in Exemplary Embodiment 1 of the present invention.
  • the video quantization parameter encoder shown in Fig. 1 includes a predictor 101, a buffer 102, a binarizer 1031, an adaptive binary arithmetic encoder 104, a binary arithmetic encoder 105, a switch (SW) 111, and a switch (SW) 112.
  • a predicted quantization parameter PQP supplied from the predictor 101 is subtracted from a quantization parameter QP input to the video quantization parameter encoder.
  • funcl(a) is a function that returns 0 if a is 0 and returns 1 if a is not
  • func2(a) is a function that returns 0 if a is positive and returns 1 if a is not positive
  • func3(a, b) is a function that returns 1 if a is less than b and returns 0 otherwise.
  • the adaptive binary arithmetic encoder 104 also updates the context associated with the context index according to the value of the binary arithmetic coded bin, for subsequent binary arithmetic encoding.
  • the binary arithmetic encoder 105 binary arithmetic codes, with equal probability, the second bin of the bin string supplied via the switch 111, and outputs the coded data via the switch 112.
  • the adaptive binary arithmetic encoder 104 starts the process, with an initial value parameter n being set to 3.
  • step S101 the binarizer 1031 binarizes the DQP in a manner that the information indicating whether or not the DQP is significant is associated with the first bin, the information indicating whether or not the significant DQP is positive is associated with the second bin, and the information indicating the absolute value of the DQP is associated with the third and subsequent bins.
  • step S102 the adaptive binary arithmetic encoder 104 adaptive binary arithmetic codes bin(1).
  • step S103 the binary arithmetic encoder 105 determines whether or not the DQP is significant. In the case where the DQP is significant, the binary arithmetic encoder 105 proceeds to step S104. Otherwise, the binary arithmetic encoder 105 ends the process. In step S104, the binary arithmetic encoder 105 binary arithmetic codes bin(2). In step S105, the adaptive binary arithmetic encoder 104 adaptive binary arithmetic codes bin(n).
  • step S106 the adaptive binary arithmetic encoder 104 determines whether or not all bins of the bin string have been coded. In the case where all bins have been coded, the adaptive binary arithmetic encoder 104 ends the process. Otherwise, the adaptive binary arithmetic encoder 104 increments n and proceeds to step S105, to adaptive binary arithmetic code the subsequent bin(n).
  • Fig. 3 is an explanatory diagram showing an example of a correspondence table between the DQP (rightmost column) and the bin string (center column) according to the present invention.
  • X in the second column of the bin string denotes 1-bit information indicating whether or not the DQP is positive, i.e. whether the DQP is positive or negative.
  • na in the context index row denotes that no context is used (i.e. the most probable symbol and its probability are fixed).
  • the binarization process according to the present invention resolves the three factors causing the problem mentioned above, as follows.
  • the first factor is resolved by binary arithmetic encoding the second bin and the subsequent bins using appropriate contexts.
  • the second bin indicates only the information of whether the DQP is positive or negative, that is, information of which one of two states holds true.
  • the third bin indicates only the information of whether or not the absolute value of the DQP is greater than 1, that is, information of which one of two states holds true.
  • the second bin and the third bin are binary arithmetic coded using appropriate contexts.
  • the fourth and subsequent bins can be equally designed to indicate only the information of whether or not the absolute value of the DQP is greater than a given value, that is, information of which one of two states holds true, by adding context indexes according to columns.
  • the second factor is resolved because, given that the decoder is able to identify whether the DQP is positive or negative from the value of the second bin, the encoder can efficiently reduce redundant bins even when the DQP range is asymmetric between positive and negative.
  • the third factor is resolved because the number of bins included in the bin string in this exemplary embodiment is the same as the number of bins in the case of separately binarizing the information of whether the significant DQP is positive or negative and the absolute value of the significant DQP, as is clear from the comparison between the correspondence table shown in Fig. 16 and the correspondence table shown in Fig. 3 .
  • Fig. 4 is a block diagram showing a structure of a video quantization parameter decoder corresponding to the video quantization parameter encoder in Exemplary Embodiment 1.
  • the video quantization parameter decoder shown in Fig. 4 includes a predictor 201, a buffer 202, a de-binarizer 2031, an adaptive binary arithmetic decoder 204, a binary arithmetic decoder 205, a switch (SW) 211, and a switch (SW) 212.
  • the adaptive binary arithmetic decoder 204 binary arithmetic decodes bin(1) from the coded data supplied via the switch 212, and supplies the decoded data to the de-binarizer 2031 via the switch 211.
  • the adaptive binary arithmetic decoder 204 also updates the context associated with the context index corresponding to the first bin according to the value of the binary arithmetic decoded bin, for subsequent binary arithmetic decoding.
  • the binary arithmetic decoder 205 binary arithmetic decodes bin(2) from the coded data supplied via the switch 212, and supplies the decoded data to the de-binarizer 2031 via the switch 211.
  • the adaptive binary arithmetic decoder 204 updates the context associated with the context index corresponding to the nth bin according to the value of the binary arithmetic decoded bin, for subsequent binary arithmetic decoding.
  • the PQP supplied from the predictor 201 is added to the DQP supplied from the de-binarizer 2031, to obtain the RQP.
  • the RQP is also stored in the buffer 202 for subsequent quantization parameter decoding.
  • the adaptive binary arithmetic decoder 204 starts the process, with an initial value parameter n being set to 3.
  • step S201 the adaptive binary arithmetic decoder 204 adaptive binary arithmetic decodes bin(1).
  • step S202 the binary arithmetic decoder 205 determines whether or not the value of bin(1) is 1. In this example, "1" indicates that the DQP is significant. In the case where the value of bin(1) is 1, the binary arithmetic decoder 205 proceeds to step S203. Otherwise, the binary arithmetic decoder 205 proceeds to step S206.
  • step S203 the binary arithmetic decoder 205 binary arithmetic decodes bin(2).
  • step S204 the adaptive binary arithmetic decoder 204 adaptive binary arithmetic decodes bin(n).
  • step S205 the adaptive binary arithmetic decoder 204 determines whether or not all bins have been decoded, i.e. whether or not the value of bin(n) is 0. In the case where all bins have been decoded, the adaptive binary arithmetic decoder 204 proceeds to step S206. Otherwise, the adaptive binary arithmetic decoder 204 increments n and proceeds to step S204, to adaptive binary arithmetic decode the subsequent bin(n).
  • step S206 the de-binarizer 2031 de-binarizes the decoded bin string to determine the DQP.
  • Exemplary Embodiments 1 and 2 describe the video quantization parameter encoder and the video quantization parameter decoder that have no constraint on the DQP range. In the case where there is a constraint on the DQP range, it is possible to reduce redundant bins of the DQP using the DQP range.
  • Figs. 6 and 7 are block diagrams showing structures of a video quantization parameter encoder and a video quantization parameter decoder as an improvement on Exemplary Embodiments 1 and 2 to use the DQP range (combination of minimum DQP and maximum DQP).
  • a binarizer 1032 in Fig. 6 uses the combination of the minimum DQP (minDQP ⁇ 0) and the maximum DQP (maxDQP ⁇ 0).
  • the binarizer 1032 computes the first bin, the second bin, and a maximum number cMax of the third and subsequent bins of the DQP by the following equations.
  • bin 1 func 1
  • DQP bin 2 func 2
  • DQP cMax max 0, func 4 minDQP , maxDQP , DQP ⁇ 1
  • func4(a, b, c) is a function that returns -a if c is negative and returns b if c is positive.
  • bin n func5 n ⁇ 2, cMax,
  • func5(a, b, c) is a function that returns 1 if b and c are equal, returns 1 if c is less than b and also a is less than c, and returns 0 otherwise (if c is less than b and also a and c are equal).
  • ) obtained by equation (8) are the same as the bins of the bin string obtained by the truncated unary (TU) binarization process described in 9.3.2.2 in NPL 1.
  • a de-binarizer 2032 computes cMax based on minDQP, maxDQP, and binary arithmetic decoded bin(2), by the following equation.
  • cMax max 0, func 6 minDQP , maxDQP , bin 2 ⁇ 1
  • func6(a, b, c) is a function that returns -a if c is 1 (i.e. if the value of the decoded DQP is negative according to the definition of func2(a)), and returns b if c is 0 (i.e. if the value of the decoded DQP is positive according to the definition of func2(a)).
  • the de-binarizer 2032 further determines the DQP.
  • the de-binarizer 2032 uses equation (4).
  • the de-binarizer 2032 determines the DQP by estimating the value of any redundant bin reduced in the video encoding process, based on the maximum number cMax of the third and subsequent bins determined by the DQP range and bin(2) (the positive or negative sign of the DQP).
  • the adaptive binary arithmetic decoder 204 starts the process, with an initial value parameter n being set to 3.
  • step S301 the adaptive binary arithmetic decoder 204 adaptive binary arithmetic decodes bin(1).
  • step S302 the binary arithmetic decoder 205 determines whether or not the value of bin(1) is 1. In the case where the value of bin(1) is 1, the binary arithmetic decoder 205 proceeds to step S303. Otherwise, the binary arithmetic decoder 205 proceeds to step S308.
  • step S303 the binary arithmetic decoder 205 binary arithmetic decodes bin(2).
  • step S304 the de-binarizer 2032 computes cMax.
  • step S305 the de-binarizer 2032 determines whether or not cMax is greater than or equal to 1. In the case where cMax is greater than or equal to 1, the de-binarizer 2032 proceeds to step S306. Otherwise, the de-binarizer 2032 proceeds to step S308.
  • step S306 the adaptive binary arithmetic decoder 204 adaptive binary arithmetic decodes bin(n).
  • step S307 the adaptive binary arithmetic decoder 204 determines whether or not all bins have been decoded. All bins have been decoded if a condition that the value of bin(n) is 0, a condition that the value of n - 2 is equal to cMax, or both of these conditions are met. In the case where all bins have been decoded, the adaptive binary arithmetic decoder 204 proceeds to step S308. Otherwise, the adaptive binary arithmetic decoder 204 increments n and proceeds to step S306, to adaptive binary arithmetic decode the subsequent bin(n).
  • step S308 the de-binarizer 2032 de-binarizes the decoded bin string to determine the DQP.
  • the video quantization parameter encoder in this exemplary embodiment described above can reduce, through the use of the DQP range and the coded second bin (the positive or negative sign of the DQP), any redundant bin among the bins of the DQP that are coded after the positive or negative sign of the DQP, even in the case where the range of the absolute value of the DQP is different between positive and negative.
  • the video quantization parameter decoder in this exemplary embodiment described above can determine the DQP by estimating, through the use of the DQP range and the coded positive or negative sign of the DQP, the value of any redundant bin reduced in the video quantization parameter encoding process among the bins of the DQP that are decoded after the positive or negative sign of the DQP, even in the case where the range of the absolute value of the DQP is different between positive and negative.
  • minDQP and maxDQP may be generated from the range of the quantization parameter (combination of minimum QP and maximum QP) and the predicted quantization parameter PQP.
  • Figs. 9 and 10 are block diagrams showing structures of a video quantization parameter encoder and a video quantization parameter decoder as an improvement to generate minDQP and maxDQP based on the combination of the minimum QP (minQP) and the maximum QP (maxQP) and the PQP.
  • the video quantization parameter encoder shown in Fig. 9 further includes a range determiner 106
  • the video quantization parameter decoder shown in Fig. 10 further includes a range determiner 206, as is clear from the comparison with Figs. 6 and 7 .
  • the inclusion of the range determiners 106 and 206 enables more effective reduction of redundant bins when the QP to be coded is closer in value to minQP or maxQP.
  • Equation (12) and (13) may be replaced with the following equations (12)' and (13)'.
  • the above-mentioned video quantization parameter encoder and video quantization parameter decoder according to the present invention may operate based on a correspondence table in which the value of the context index is fixed for bins from a predetermined column onward as shown in Fig. 11 , instead of using the example shown in Fig. 3 .
  • the value of the context index is fixed to 3 for the bins in the fourth and subsequent columns.
  • the first bin indicates only the information of whether or not the DQP is significant, that is, information of which one of two states holds true.
  • the second bin indicates only the information of whether the DQP is positive or negative, that is, information of which one of two states holds true.
  • the third bin indicates only the information of whether or not the absolute value of the DQP is greater than 1, that is, information of which one of two states holds true.
  • the fourth and subsequent bins indicate only the information of whether or not the bin string terminates, that is, information of which one of two states holds true.
  • the video quantization parameter encoder may binary arithmetic code the first bin indicating whether or not the DQP is significant, the second bin indicating whether the DQP is positive or negative, the third bin indicating whether or not the absolute value of the DQP is greater than 1, and the bin indicating whether or not the bin string terminates.
  • a video quantization parameter for video encoding that uses context-based adaptive binary arithmetic encoding can be suitably coded by providing means for performing binarization in a manner that the information indicating whether or not the delta quantization parameter is significant is associated with the first bin, the information indicating whether the significant delta quantization parameter is positive or negative is associated with the second bin, and the information indicating the absolute value of the significant delta quantization parameter is associated with the third and subsequent bins.
  • the above-mentioned suitable encoding is achieved by three features: assigning an appropriate context to each bin of the delta quantization parameter; reducing redundant bins of the delta quantization parameter; and reducing the number of bins included in the bin string of the delta quantization parameter.
  • An information processing system shown in Fig. 12 includes a processor 1001, a program memory 1002, a storage medium 1003 for storing video data, and a storage medium 1004 for storing a bitstream.
  • the storage medium 1003 and the storage medium 1004 may be separate storage media, or storage areas included in the same storage medium.
  • a storage medium a magnetic storage medium such as a hard disk is available.
  • a program for realizing the functions of the blocks (except the block of the buffer) shown in each of Figs. 1 , 4 , 6 , 7 , 9 , and 10 is stored in the program memory 1002.
  • the processor 1001 realizes the functions of the video quantization parameter encoder or the video quantization parameter decoder shown in each of Figs. 1 , 4 , 6 , 7 , 9 , and 10 , by executing processes according to the program stored in the program memory 1002.
  • Fig. 13 is a block diagram showing characteristic components in a video quantization parameter encoder according to the present invention.
  • the video quantization parameter encoder according to the present invention includes: a prediction unit 11 for generating a predicted quantization parameter from a past reconstructed quantization parameter; a computing unit 12 for generating a delta quantization parameter from a quantization parameter and the predicted quantization parameter; and quantization parameter encoding unit 13 for binary arithmetic encoding a first bin indicating whether or not the delta quantization parameter is significant, a second bin indicating whether the delta quantization parameter is positive or negative, and other bins indicating an absolute value of the delta quantization parameter, in the case where the delta quantization parameter is significant.
  • Fig. 14 is a block diagram showing characteristic components in a video quantization parameter decoder according to the present invention.
  • the video quantization parameter decoder according to the present invention includes: a prediction unit 21 for generating a predicted quantization parameter from a past reconstructed quantization parameter; and quantization parameter decoding unit 22 for binary arithmetic decoding a first bin indicating whether or not a delta quantization parameter is significant, a second bin indicating whether the delta quantization parameter is positive or negative, and other bins indicating an absolute value of the delta quantization parameter.

Landscapes

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

Claims (3)

  1. Procédé de décodage de paramètre de quantification vidéo pour décoder un paramètre de quantification pour un processus de décodage vidéo, le procédé de décodage de paramètre de quantification vidéo étant basé sur un encodage arithmétique binaire adaptatif selon le contexte et comprenant :
    la génération d'un paramètre de quantification prédit, à partir d'un paramètre de quantification reconstruit passé ;
    le décodage arithmétique binaire d'un premier fichier bin indiquant si oui ou non un paramètre de quantification delta est significatif ; et
    le décodage arithmétique binaire, dans des cas où la valeur du premier fichier bin indique que le paramètre de quantification delta est significatif, d'un fichier bin de signe indiquant si le paramètre de quantification delta est positif ou négatif, et d'autres fichiers bin indiquant une valeur absolue du paramètre de quantification delta,
    caractérisé en ce que le décodage arithmétique binaire est effectué sans l'aide d'un contexte pour le fichier bin de signe et à l'aide d'un contexte pour chacun du premier fichier bin et des autres fichiers bin.
  2. Décodeur de paramètre de quantification vidéo pour décoder un paramètre de quantification pour un processus de décodage vidéo, le décodeur de paramètre de quantification vidéo étant basé sur un encodage arithmétique binaire adaptatif selon le contexte et comprenant :
    un moyen de prédiction (21) pour générer un paramètre de quantification prédit à partir d'un paramètre de quantification reconstruit passé ; et
    un moyen de décodage de paramètre de quantification (22) pour le décodage arithmétique binaire d'un premier fichier bin indiquant si oui ou non un paramètre de quantification delta est significatif, et le décodage arithmétique binaire, dans des cas où la valeur du premier fichier bin indique que le paramètre de quantification delta est significatif, d'un fichier bin de signe indiquant si le paramètre de quantification delta est positif ou négatif, et d'autres fichiers bin indiquant une valeur absolue du paramètre de quantification delta,
    caractérisé en ce que le moyen de décodage de paramètre de quantification (22) effectue le décodage arithmétique binaire sans l'aide d'un contexte pour le fichier bin de signe et à l'aide d'un contexte pour chacun du premier fichier bin et des autres fichiers bin.
  3. Programme de décodage de paramètre de quantification vidéo pour amener un ordinateur à exécuter le procédé de décodage de paramètre de quantification vidéo selon la revendication 1.
EP17204157.6A 2011-06-28 2012-06-27 Décodage d'un paramètre de quantification vidéo Active EP3324633B1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PL17204157T PL3324633T3 (pl) 2011-06-28 2012-06-27 Dekodowanie parametru kwantowania wideo

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
JP2011142453 2011-06-28
EP12803730.6A EP2728864B1 (fr) 2011-06-28 2012-06-27 Procédé pour coder un paramètre de quantification vidéo et procédé pour décoder un paramètre de quantification vidéo
PCT/JP2012/004162 WO2013001808A1 (fr) 2011-06-28 2012-06-27 Procédé pour coder un paramètre de quantification vidéo et procédé pour décoder un paramètre de quantification vidéo

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
EP12803730.6A Division EP2728864B1 (fr) 2011-06-28 2012-06-27 Procédé pour coder un paramètre de quantification vidéo et procédé pour décoder un paramètre de quantification vidéo

Publications (2)

Publication Number Publication Date
EP3324633A1 EP3324633A1 (fr) 2018-05-23
EP3324633B1 true EP3324633B1 (fr) 2018-12-12

Family

ID=47423727

Family Applications (4)

Application Number Title Priority Date Filing Date
EP12803730.6A Active EP2728864B1 (fr) 2011-06-28 2012-06-27 Procédé pour coder un paramètre de quantification vidéo et procédé pour décoder un paramètre de quantification vidéo
EP17204157.6A Active EP3324633B1 (fr) 2011-06-28 2012-06-27 Décodage d'un paramètre de quantification vidéo
EP17205474.4A Active EP3324634B1 (fr) 2011-06-28 2012-06-27 Décodage d'un paramètre de quantification vidéo
EP17205489.2A Active EP3324635B1 (fr) 2011-06-28 2012-06-27 Procédé et appareil de décodage de paramètres de quantification vidéo

Family Applications Before (1)

Application Number Title Priority Date Filing Date
EP12803730.6A Active EP2728864B1 (fr) 2011-06-28 2012-06-27 Procédé pour coder un paramètre de quantification vidéo et procédé pour décoder un paramètre de quantification vidéo

Family Applications After (2)

Application Number Title Priority Date Filing Date
EP17205474.4A Active EP3324634B1 (fr) 2011-06-28 2012-06-27 Décodage d'un paramètre de quantification vidéo
EP17205489.2A Active EP3324635B1 (fr) 2011-06-28 2012-06-27 Procédé et appareil de décodage de paramètres de quantification vidéo

Country Status (14)

Country Link
US (1) US20140105282A1 (fr)
EP (4) EP2728864B1 (fr)
JP (3) JP5867504B2 (fr)
KR (6) KR101605663B1 (fr)
CN (8) CN103597829B (fr)
AU (3) AU2012277174B2 (fr)
BR (1) BR112013033572B1 (fr)
CA (1) CA2834193C (fr)
ES (4) ES2715749T3 (fr)
MX (3) MX352866B (fr)
PL (4) PL3324635T3 (fr)
RU (5) RU2571404C2 (fr)
TR (3) TR201901869T4 (fr)
WO (1) WO2013001808A1 (fr)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103597829B (zh) * 2011-06-28 2017-03-22 日本电气株式会社 对视频量化参数编码的方法和对视频量化参数解码的方法
ES2732761T3 (es) 2011-07-12 2019-11-25 Nec Corp Método de descodificación y descodificador para la descodificación de parámetro de cuantización para la descodificación de vídeo
US10499056B2 (en) * 2016-03-09 2019-12-03 Sony Corporation System and method for video processing based on quantization parameter
US11070818B2 (en) * 2017-07-05 2021-07-20 Telefonaktiebolaget Lm Ericsson (Publ) Decoding a block of video samples
US11234023B2 (en) * 2019-06-28 2022-01-25 Microsoft Technology Licensing, Llc Features of range asymmetric number system encoding and decoding

Family Cites Families (37)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2359519C (fr) * 2000-10-20 2004-07-20 Samsung Electronics Co., Ltd. Appareil codeur/decodeur et methode d'orientation interpolaire d'un noeud de donnees
KR100480787B1 (ko) * 2001-11-27 2005-04-07 삼성전자주식회사 좌표 인터폴레이터의 키 값 데이터 부호화/복호화 방법 및 장치
US6900748B2 (en) * 2003-07-17 2005-05-31 Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. Method and apparatus for binarization and arithmetic coding of a data value
KR100624432B1 (ko) * 2004-08-05 2006-09-19 삼성전자주식회사 내용 기반 적응적 이진 산술 복호화 방법 및 장치
KR100703776B1 (ko) * 2005-04-19 2007-04-06 삼성전자주식회사 향상된 코딩 효율을 갖는 컨텍스트 기반 적응적 산술 코딩및 디코딩 방법과 이를 위한 장치, 이를 포함하는 비디오코딩 및 디코딩 방법과 이를 위한 장치
CN1878309A (zh) * 2005-06-08 2006-12-13 松下电器产业株式会社 视频编码装置
JP4856954B2 (ja) * 2005-06-08 2012-01-18 パナソニック株式会社 画像符号化装置
CN101218825B (zh) * 2005-07-08 2014-07-09 Lg电子株式会社 用于建模视频信号的编码信息以压缩/解压编码信息的方法
KR101154999B1 (ko) * 2005-07-08 2012-07-09 엘지전자 주식회사 영상 신호의 코딩정보를 압축/해제하기 위해 모델링하는 방법
CN100584025C (zh) * 2005-08-04 2010-01-20 华为技术有限公司 一种基于内容自适应的算术解码系统及装置
CN100461863C (zh) * 2005-08-05 2009-02-11 上海富瀚微电子有限公司 基于上下文自适应二进制算术解码器
US7221296B2 (en) * 2005-08-22 2007-05-22 Streaming Networks (Pvt.) Ltd. Method and system for fast context based adaptive binary arithmetic coding
US7956930B2 (en) * 2006-01-06 2011-06-07 Microsoft Corporation Resampling and picture resizing operations for multi-resolution video coding and decoding
WO2007081713A1 (fr) * 2006-01-09 2007-07-19 Thomson Licensing Procedes et appareil d'illumination et de compensation de couleur pour codage video multifenetres
US7983343B2 (en) * 2006-01-12 2011-07-19 Lsi Corporation Context adaptive binary arithmetic decoding for high definition video
KR101200535B1 (ko) * 2006-01-12 2012-11-27 (주)휴맥스 매크로블록 기반의 조명 변화에 대한 적응적 움직임예측/보상 장치 및 방법
US7626521B2 (en) * 2006-06-08 2009-12-01 Via Technologies, Inc. Decoding control of computational core of programmable graphics processing unit
US7656326B2 (en) * 2006-06-08 2010-02-02 Via Technologies, Inc. Decoding of context adaptive binary arithmetic codes in computational core of programmable graphics processing unit
JP4928176B2 (ja) * 2006-06-27 2012-05-09 キヤノン株式会社 映像符号化装置及び映像符号化方法
US8275045B2 (en) * 2006-07-12 2012-09-25 Qualcomm Incorporated Video compression using adaptive variable length codes
WO2008072592A1 (fr) * 2006-12-14 2008-06-19 Nec Corporation Procédé de codage vidéo, dispositif de codage vidéo et programme de codage vidéo
JP2008160402A (ja) * 2006-12-22 2008-07-10 Canon Inc 符号化装置及び方法並びに画像符号化装置
CN101212676B (zh) * 2006-12-29 2010-06-02 北京展讯高科通信技术有限公司 高效并行cabac解码方法及其装置
KR101356733B1 (ko) * 2007-03-07 2014-02-05 삼성전자주식회사 컨텍스트 기반 적응적 이진 산술 부호화, 복호화 방법 및장치
US7839311B2 (en) * 2007-08-31 2010-11-23 Qualcomm Incorporated Architecture for multi-stage decoding of a CABAC bitstream
JP5278827B2 (ja) * 2007-09-06 2013-09-04 日本電気株式会社 映像符号化装置、映像復号装置、映像符号化方法、映像復号方法、映像符号化あるいは復号プログラム
US8782379B2 (en) * 2007-09-27 2014-07-15 Qualcomm Incorporated H.264 video decoder CABAC core optimization techniques
US7777654B2 (en) * 2007-10-16 2010-08-17 Industrial Technology Research Institute System and method for context-based adaptive binary arithematic encoding and decoding
US9008171B2 (en) * 2008-01-08 2015-04-14 Qualcomm Incorporated Two pass quantization for CABAC coders
KR101611375B1 (ko) * 2008-08-19 2016-04-11 톰슨 라이센싱 압축된 비디오에서 구문 요소의 cabac/avc 준수 워터마킹
US8325796B2 (en) * 2008-09-11 2012-12-04 Google Inc. System and method for video coding using adaptive segmentation
JP5274317B2 (ja) * 2009-03-17 2013-08-28 パナソニック株式会社 符号量推定装置、符号量推定方法、符号量推定プログラムおよび、符号量推定集積回路
US20110274162A1 (en) * 2010-05-04 2011-11-10 Minhua Zhou Coding Unit Quantization Parameters in Video Coding
US9591320B2 (en) * 2010-07-15 2017-03-07 Texas Instruments Incorporated Context and bypass encoding video
CN101951516B (zh) * 2010-09-25 2013-06-05 清华大学 基于h.264/avc中cabac的并行编码实现电路及编码方法
US9112526B2 (en) * 2011-06-15 2015-08-18 Sony Corporation Binarization of DQP using separate absolute value and sign (SAVS) in CABAC
CN103597829B (zh) * 2011-06-28 2017-03-22 日本电气株式会社 对视频量化参数编码的方法和对视频量化参数解码的方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
None *

Also Published As

Publication number Publication date
CN106878714B (zh) 2019-08-02
PL3324634T3 (pl) 2019-06-28
CN107071452B (zh) 2019-03-05
JP5892287B1 (ja) 2016-03-23
EP3324634A1 (fr) 2018-05-23
AU2016250440B2 (en) 2018-01-25
EP3324635B1 (fr) 2018-10-03
KR20150036830A (ko) 2015-04-07
US20140105282A1 (en) 2014-04-17
ES2660911T3 (es) 2018-03-26
CN107071454A (zh) 2017-08-18
RU2636125C1 (ru) 2017-11-20
ES2715749T3 (es) 2019-06-06
ES2694381T3 (es) 2018-12-20
RU2627099C1 (ru) 2017-08-03
BR112013033572A2 (pt) 2017-02-07
PL3324633T3 (pl) 2019-06-28
RU2664403C1 (ru) 2018-08-17
CN107071452A (zh) 2017-08-18
AU2012277174A1 (en) 2013-10-17
KR101605663B1 (ko) 2016-03-28
EP2728864A4 (fr) 2015-03-25
RU2013157100A (ru) 2015-08-10
ES2716933T3 (es) 2019-06-18
CN107071453A (zh) 2017-08-18
MX352866B (es) 2017-12-13
PL2728864T3 (pl) 2018-05-30
KR101751671B1 (ko) 2017-06-27
BR112013033572B1 (pt) 2022-02-15
CN106878739A (zh) 2017-06-20
TR201901869T4 (tr) 2019-03-21
AU2012277174B2 (en) 2015-10-29
CN107105274A (zh) 2017-08-29
JP6146492B2 (ja) 2017-06-14
CN106454366A (zh) 2017-02-22
WO2013001808A1 (fr) 2013-01-03
EP3324633A1 (fr) 2018-05-23
KR101727449B1 (ko) 2017-04-14
AU2016250440A1 (en) 2016-11-17
EP2728864A1 (fr) 2014-05-07
AU2016200045B2 (en) 2016-09-29
CN106878714A (zh) 2017-06-20
JP2016086430A (ja) 2016-05-19
JP2016116238A (ja) 2016-06-23
KR20170005522A (ko) 2017-01-13
MX338541B (es) 2016-04-21
CN103597829B (zh) 2017-03-22
MX2013012728A (es) 2013-12-06
CN107105274B (zh) 2020-01-21
KR20160037240A (ko) 2016-04-05
KR101643527B1 (ko) 2016-07-27
TR201901502T4 (tr) 2019-02-21
KR20160090401A (ko) 2016-07-29
KR101696589B1 (ko) 2017-01-13
CN103597829A (zh) 2014-02-19
CA2834193A1 (fr) 2013-01-03
TR201815834T4 (tr) 2018-11-21
EP3324634B1 (fr) 2018-12-19
JPWO2013001808A1 (ja) 2015-02-23
KR20170042810A (ko) 2017-04-19
AU2016200045A1 (en) 2016-01-28
EP2728864B1 (fr) 2017-12-27
EP3324635A1 (fr) 2018-05-23
RU2653256C1 (ru) 2018-05-07
JP5867504B2 (ja) 2016-02-24
CA2834193C (fr) 2016-11-29
RU2571404C2 (ru) 2015-12-20
KR20130135357A (ko) 2013-12-10
PL3324635T3 (pl) 2019-02-28

Similar Documents

Publication Publication Date Title
RU2664403C1 (ru) Способ для кодирования параметра квантования видео и способ для декодирования параметра квантования видео
US10085025B2 (en) Image quantization parameter encoding method and image quantization parameter decoding method
AU2015252148B2 (en) Image quantization parameter encoding method and image quantization parameter decoding method

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20180319

AC Divisional application: reference to earlier application

Ref document number: 2728864

Country of ref document: EP

Kind code of ref document: P

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

RIC1 Information provided on ipc code assigned before grant

Ipc: H04N 19/50 20140101ALN20180621BHEP

Ipc: H04N 19/463 20140101ALI20180621BHEP

Ipc: H04N 19/91 20140101AFI20180621BHEP

INTG Intention to grant announced

Effective date: 20180703

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AC Divisional application: reference to earlier application

Ref document number: 2728864

Country of ref document: EP

Kind code of ref document: P

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 1077546

Country of ref document: AT

Kind code of ref document: T

Effective date: 20181215

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602012054753

Country of ref document: DE

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20181212

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181212

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190312

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181212

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181212

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190312

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181212

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1077546

Country of ref document: AT

Kind code of ref document: T

Effective date: 20181212

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181212

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181212

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181212

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190313

REG Reference to a national code

Ref country code: ES

Ref legal event code: FG2A

Ref document number: 2715749

Country of ref document: ES

Kind code of ref document: T3

Effective date: 20190606

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181212

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190412

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181212

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181212

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181212

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190412

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181212

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181212

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602012054753

Country of ref document: DE

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181212

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181212

26N No opposition filed

Effective date: 20190913

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181212

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20190630

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190627

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190630

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190627

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190630

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190630

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181212

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20120627

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181212

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181212

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181212

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: ES

Payment date: 20230830

Year of fee payment: 12

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20240621

Year of fee payment: 13

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20240619

Year of fee payment: 13

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20240628

Year of fee payment: 13

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: PL

Payment date: 20240613

Year of fee payment: 13

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: TR

Payment date: 20240614

Year of fee payment: 13

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: IT

Payment date: 20240625

Year of fee payment: 13