EP2489187A1 - Verfahren zur codierung von symbolen aus einer folge digitalisierter bilder - Google Patents
Verfahren zur codierung von symbolen aus einer folge digitalisierter bilderInfo
- Publication number
- EP2489187A1 EP2489187A1 EP10765622A EP10765622A EP2489187A1 EP 2489187 A1 EP2489187 A1 EP 2489187A1 EP 10765622 A EP10765622 A EP 10765622A EP 10765622 A EP10765622 A EP 10765622A EP 2489187 A1 EP2489187 A1 EP 2489187A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- coding
- decoding
- symbols
- frequencies
- models
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 85
- 238000012545 processing Methods 0.000 claims description 24
- 230000009466 transformation Effects 0.000 claims description 13
- 239000013598 vector Substances 0.000 claims description 10
- 230000006978 adaptation Effects 0.000 claims description 9
- 238000007596 consolidation process Methods 0.000 claims description 5
- 238000013139 quantization Methods 0.000 claims description 4
- 206010052122 Dellen Diseases 0.000 claims description 3
- 230000008569 process Effects 0.000 abstract description 10
- 239000000306 component Substances 0.000 description 18
- 230000005540 biological transmission Effects 0.000 description 5
- 230000003111 delayed effect Effects 0.000 description 5
- 230000003044 adaptive effect Effects 0.000 description 4
- 230000008901 benefit Effects 0.000 description 4
- 230000006835 compression Effects 0.000 description 4
- 238000007906 compression Methods 0.000 description 4
- 238000000638 solvent extraction Methods 0.000 description 4
- 230000015572 biosynthetic process Effects 0.000 description 3
- 238000011161 development Methods 0.000 description 2
- 230000018109 developmental process Effects 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 239000000853 adhesive Substances 0.000 description 1
- 230000001070 adhesive effect Effects 0.000 description 1
- 230000003139 buffering effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000001427 coherent effect Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 108090000623 proteins and genes Proteins 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
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/42—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation
- H04N19/436—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation using parallelised computational arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N19/13—Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
- H04N19/157—Assigned coding mode, i.e. the coding mode being predefined or preselected to be further used for selection of another element or parameter
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
- H04N19/174—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a slice, e.g. a line of blocks or a group of blocks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/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/91—Entropy coding, e.g. variable length coding [VLC] or arithmetic coding
Definitions
- the invention relates to a method for coding symbols from a sequence of digitized images and to a corresponding decoding method. Moreover, the invention relates to a coding device and a decoding device for carrying out the coding or decoding method.
- Video coding methods are usually performed in two processing processes.
- the images in the video stream are appropriately decorrelated by means of prediction and transformation.
- the result of the correlating step ⁇ are symbols in the form of Transformationskoeffi ⁇ coefficients, motion vectors, coding information further and the like. Thereto often still a Quanti ⁇ tion of the symbols generated includes in itself, whereby the Kompressionsef- ficiency is increased.
- the generated symbols are subjected to lossless entropy coding, in which the remaining redundancy in the generated symbols, ie their occurrence probabilities and their mutual statistical dependency, is exploited to obtain the shortest possible codewords with the shortest possible total length of the symbols To generate data stream.
- each generated symbol is bijectively mapped to a codeword.
- the relationship between a symbol and the corresponding codeword is represented by a codeta ⁇ belle, such as a look-up table.
- arithmetic coding In contrast to the VLC coding, in which a symbol is transformed into a codeword becomes in the arithmetic coding of a plurality of symbols generates a single codeword. In the arithmetic Codie ⁇ tion the symbols are preferably mapped to binary numbers based on their frequencies, so that a binary representation of the successive symbols is obtained.
- Entropy encoding based on the principle of deriving one or sev- eral probabilistic models from the frequencies of the symbols occurring, short code words are generated on the basis of which, ie for symbols or symbol sequences with high frequency with the Entropiecodie ⁇ tion shorter code words than for symbols or Generated symbol sequences with low frequency.
- Entropieco- are context-based coding method, that is to be distinguished from various symbols Ty ⁇ groups that represent different information.
- the frequencies of the symbols occurring are processed separately in their own context and thus based on their own probabilistic model.
- a context may also depend on other criteria in video coding methods, for example the coding of an image area may depend on the coding decisions of adjacent image areas in the image.
- Entropiecodierver- run frequently adaptively designed ie the probability models are adjusted based on the changing Frequently ⁇ fieren of the symbols occurring in coding accordingly.
- various methods are known in the prior art.
- the images of the video stream are divided into so-called slices, each slice representing a part of the image that can be encoded completely independently of other parts. That is, both the generation of the original symbols and the subsequent generation of the code word to an entropy coding ⁇ have based no dependencies between different small slices.
- the probability models or contexts are not adjusted across slices. This leads to a poorer compression efficiency.
- entropy slices allow dependency between the Sym ⁇ bolen, such as intra-prediction. Only the generation of the code words based on the entropy coding is independent between the individual entropy slices.
- the use of entropy slices increases the compression efficiency compared to traditional slices. Nevertheless, there is still the disadvantage that different statistics are used for the symbols of different entropy slices, which in turn reduces the efficiency of entropy coding.
- FIGS. 1A to 1C show different variants of the reading of macro blocks in accordance with reference [1], wherein the individual macro blocks are reproduced as Successive rectangles and are denoted from about ⁇ sichtiges109 only partially with the reference numeral MB.
- Fig. 1A shows a line by line reading of macroblocks, as indicated by the vertical line LI.
- FIG. 1B shows a further variant of the zigzag-shaped reading in of macroblocks, whereby now ⁇ more the processing of three lines per ordered entropy slice according to the line L3 is made possible.
- FIGS. 2A and 2B Another variant of entropy slices are so-called interleaved entropy slices, which are described in reference [4].
- the slices do not represent contiguous lines, but the lines of the individual slices are nested inside each other. This is illustrated again in FIGS. 2A and 2B.
- Fig. 2A shows a subdivision of I picture in two conventional Entropy slices SL1 and SL2, where ⁇ at the upper half of the image forms a coherent slice SL1 with macroblock MB1, and the lower part of the picture SL2 a contiguous slice SL2 with corresponding macro ⁇ blocks MB2 (shaded) forms.
- FIG. 2B an example of interleaved entropy slices is shown in FIG. 2B.
- the respective slice SL1 'or SL2' is formed by macroblock lines staggered by one line.
- the slice SL1 ' is indicated in FIG. 2B with full-area macroblock MB1' and is formed by the first, third, fifth, etc. lines.
- Demge ⁇ gen undergraduate is the slice SL2 indicated 'by hatched macro block MB2' and formed by the second, fourth, sixth, etc. row.
- Interleaved entropy slices allow contextualization across entropy slices. However, no common statistics are generated for the probabilistic models used for entropy coding.
- a syntax element partitioning is also described in reference [4].
- codewords for different groups of syntax elements such as mode information, motion vectors, transform coefficients. Since the individual groups have different contexts, the context formation is also carried out separately. Because the relative frequencies of the different groups of syntax elements, such as mode information, motion vectors, transform coefficients.
- the object of the invention is to improve the entropy coding of symbols in a sequence of digitized images in such a way that parallel processing of several image areas is possible with simultaneously high coding efficiency.
- the images are subdivided into image regions and the symbols of a respective image region are coded by means of entropy coding, the entropy coding being based on one or more probabilistic models.
- image area here and in the following is to be construed broadly and can refer to image sections of any shape.
- an image area represents an image block, for example a macroblock known from video coding.
- the image areas are processed in the Codierzyklen ⁇ art that in one encoding cycle the Entropieco ⁇ consolidation takes place in several parallel Codierzweigen.
- Parallel Codierzweigen Codierzweige are hen to be understood that perform entropy ⁇ encodings of image areas at the same time or overlapping in time. This achieves rapid entropy encoding through the use of parallel entropy encoders for each coding branch.
- an image area is coded in a respective coding branch on the basis of a set of probability models, wherein a set of probabilistic models can comprise one or more probabilistic models.
- the frequencies for the set of probability models are adapted based on the symbols occurring in the image area.
- the inventive method is characterized in that the set of probability models used in each coding branch for encoding based on a common, valid for all Codierzweige set of probability model ⁇ len, this common set takes into account the frequencies of symbols in the image areas of all Codierzweige.
- This common set of probability models is updated at predetermined time intervals based on frequencies adapted in at least one chronologically preceding coding cycle. Under "temporally preceding coding cycle" is an encoding cycle that has passed (immediately or even earlier) before updating the common set of probabilistic models.
- the inventive method has the advantage that, firstly, by the use of parallel Codierzweigen a fast coding of the symbols is achieved and at ⁇ whose dellen by considering the statistics of all Codierzweige in a common set of tempkeitsmo- a high coding efficiency is ensured.
- the updating of the common set of probabilistic models can take place according to the invention in various ways.
- the updating of the common set of probabilistic models is carried out, at least temporarily, sequentially in such a way that, in the case of temporally successive updates, the adapted frequencies of different coding branches are taken into account.
- the updating of the common set of probabilistic models can also take place at least temporarily at predetermined synchronization times at which the common set of probabilistic models is updated based on the adapted frequencies of all coding branches of at least one preceding coding cycle.
- the common set of probabilistic models may be updated in a variant of the invention based on frequencies adapted in the immediate temporally preceding coding cycle.
- the adapted frequency in an intermediate, assigned to the respective coding branch set of probability models are temporarily stored after the encoding of an image area in a respective coding branch, wherein up to update the common set of probability models one or more latched interme ⁇ intermediaries sentences of probabilistic models in combination with the common set of probability models for entropy coding in the respective coding branch. Due to the temporary buffering of the adapted frequencies, different variants of the coding according to the invention can be realized in a simple manner.
- the entropy coding of a respective image area may be based on any entropy coding method known from the prior art.
- VLC coding and / or arithmetic coding can be used.
- Context-based Adaptive Variable Length Coding (CAVLC) coding or CABAC (Context-based Adaptive Binary Arithmetic Coding) coding known from the video coding standard H.264 / AVC can be used.
- Codierzweige can be done in the method according to the invention in various ways.
- the Codierzweige may be such bootss ⁇ taltet that an encoding cycle is gebil- det by image areas, which follow one another according to a row or column-wise course of the image regions in the images.
- Codierzweige are such as those wholly or partly coding cycles, which follow one another in accordance with a zigzag-shaped course of the image regions in the images.
- the last-mentioned variant also makes it possible, in particular, to achieve coding taking into account the context of adjacent image areas.
- the method according to the invention can also be combined in a suitable manner with known coding variants in which the pictures are subdivided into picture sections which are separately entropy-coded.
- the image sections can thereby be encoded at least temporarily, without consideration of dependencies between the image sections and / or at least temporarily taking into account dependencies between the image sections.
- An embodiment of a coding without regard to dependencies represents the partitioning based on slices mentioned at the outset.
- a variant of a coding with consideration of dependencies represents the initially mentioned partitioning of pictures based on entropy slices.
- the entropy coding method according to the invention can be combined with any video coding method known from the prior art.
- the symbols can be generated from the sequence of digitized images based on the standard H.264.
- the symbols from the sequence of digitized images are generated by a well-known in the art transformation, such as a DCT transform, and also known from the prior art quantization of image areas.
- the invention further comprises a decoding method with which the symbols coded according to the invention are decoded from a sequence of digitized pictures.
- the encoded image areas are so proces tet ⁇ in decoding cycles analogous to the encoding method that entropy decoding is performed in a decoding cycle in several parallel decoding branches, wherein an encoded image area in a respective decoding branch is decoded based on a set of probabilistic models, wherein the frequencies for the set of probability models in the decoding of the coded image area based on the occurring in the decoded image area symbols.
- the set of probability models used in each decoding branch for decoding is based on a common set of probability models valid for all decoding branches, which takes into account the frequencies of symbols in the decoded image areas of all decoding branches.
- the common set of probability models is updated at predetermined time intervals based on frequencies adapted in at least one temporally preceding decoding cycle.
- the invention further relates to a method for encoding and decoding a sequence of digitized images, wherein symbols from the sequence of digitized images are encoded using the encoding method described above, and subsequently, for example after transmission over a transmission link, with the above-described inventive Decoding be decoded.
- the invention further relates to a device for encoding symbols from a sequence of digitized images, the images being subdivided into image regions and the symbols of a respective image region being encodable by the device by means of entropy coding based on one or more probabilistic models, wherein the or the probability models take into account the frequencies occurring in areas of the image icons, wherein the device comprises a processing unit which ⁇ be tains:
- each Codiermit ⁇ tel is used for entropy encoding such a respective Codierzweigs that in a respective coding branch, an image area based on a set of probability is coded, wherein each coding means um ⁇ sums:
- an adaptation means for adapting the frequencies for the set of probability models in the coding of the image area based on the
- the encoding device according to the invention is thus suitable for coding of the symbols from a sequence of digitized images based on the inventive method, wherein in particular one or more of the above-described execution ⁇ form of the inventive method can be realized with corresponding further means of the coding device.
- the invention further comprises a corresponding decoding device for decoding coded symbols from a sequence of digitized images, wherein the images are subdivided into image regions and the symbols of a respective image region have been coded by means of entropy coding based on the coding method according to the invention, wherein the entropy decoding is based on one or more probabilistic models, the probabilistic model (s) taking into account the frequencies of symbols occurring in decoded image areas.
- the pros direction in this case comprises a processing unit which ⁇ be tains:
- each decoding means for entropy decoding a respective decoding branch serving such that in the respective decoding branch an encoded image area is based on a decoding branch
- each decoding means comprising:
- Set of probability models based on the common set of likelihood models valid for all decoder branches, which takes into account the frequencies of symbols in the decoded image areas of all decoder branches; means for updating the common set of probabilistic models at predetermined time intervals based on frequencies adapted in at least one temporally preceding decoding cycle.
- the invention also includes a codec or a system for coding and decoding symbols from a sequence of digitized images, the codec including both the coding device according to the invention and the decoding device according to the invention.
- FIGS. 4A and 4B show two variants of the parallel processing of macroblocks based on the method according to the invention
- Fig. 10 is a schematic representation of a
- Embodiment of a erfindungsge ⁇ MAESSING coding and decoding Embodiment of a erfindungsge ⁇ MAESSING coding and decoding.
- the entropy encoding of the invention or Entropiedecodier method are characterized in that a plurality of image areas are processed in parallel in different Codierzweigen, wherein the individual Codierzweige However ⁇ access scheineriesmodell to a common perception that the Häuftechniksver ⁇ distributions of the symbols of all Codierzweige considered.
- the ⁇ ses probability model is updated periodically based on the changing frequencies of to be encoded or decoded symbols.
- the symbols are generated in the context of a video coding method, such a method being illustrated schematically in FIG.
- FIG. 3 shows a corresponding coder COD and the right part of FIG. 3 shows the decoder DEC used for the decoding.
- a video stream of digitized images I is subjected to encoding in which a prediction error signal resulting from the difference between input signal I and motion-compensated reconstruction of the previous image is compressed.
- DCT Discrete Cosine Transformation
- the quantized symbols S in the context of the coding are also subjected to an inverse quantization IQ and an inverse transformation IT.
- the thus generated signal finally reaches an image ⁇ memory SP, whose output is fed back again via the adder A 'to the input, wherein the output further nega tive ⁇ reaches the input of the transform T via the adder A.
- the image memory SP thereby controls a motion estimator ME ⁇ , which in turn is acted upon on the input side with the video I ⁇ input data and provides the above-mentioned motion vectors MV for the control of the image memory SP in the coder COD.
- the ⁇ se motion vectors are also transmitted to the decoder DEC, the motion vectors are also entropy coded for this, which is not shown in FIG. 1.
- the codewords S 'generated by the entropy coder are finally transmitted to the decoder DEC where they are first subjected to a suitable entropy decoding according to the invention.
- the symbols S generated on the encoder side are reconstructed, which are then subjected to an inverse quantization IQ and an inverse transformation IT.
- decoded video data is then added to the data of a corresponding image memory SP on the side of the decoder DEC and set the off ⁇ represents transition of the decoder, this sum signal is also supplied to the decoder-side image memory SP, the output to the input of the adder A ''. is returned.
- Embodiments of entropy coding and entropy decoding according to the invention based on the symbols of respective macroblocks in respective video images will now be described.
- the individual Codierzweige thus represent different groups of macro blocks, wel ⁇ che, various components of the image depending on the design.
- FIG. 4A shows a first variant of a grouping of macroblocks MB into three coding branches.
- the macro block of the first Codierzweigs are thereby z with reference numeral 1, the macro-blocks of the second ⁇ Codierzweigs with reference numeral 2 and the macro block of the third Codierzweigs with reference numeral 3 spe ⁇ . These reference numerals are also used to denote the corresponding coding branches.
- An encoding cycle CC is formed by three consecutive macroblocks 1, 2 and 3 in the embodiment of FIG. 4A. The image is thus read in for encoding line by line, as indicated by the line L in Fig. 4A.
- the grouping according to FIG. 4A is suitable for entropy coding, in which no information from neighboring macroblocks is used to model the context.
- FIG. 4B shows another variant of the formation of coding branches in which context modeling based on information from adjacent macroblocks is enabled.
- the coding branches are formed by respective adjacent lines of the image I, the first line forming the first coding branch 1, the second line the second coding branch 2 and the third line the third coding branch 3 in FIG. 4B.
- the processing of the individual Codierzweige carried overlapping, wherein the coding in a coding branch for coding branch of the next line to two macro blocks ⁇ is delayed, which is indicated by the line L '.
- FIG. 4B shows a scenario in which some macro blocks ⁇ are already encoded, said macro-block are indicated by ent ⁇ speaking numerals in parentheses.
- the co-consolidation takes place again in parallel Codierzweigen, wherein in a mutually encoding cycle now two macroblock offset macroblock from respective Codierzweigen be proces ⁇ tet.
- the successive coding branches are formed in accordance with a zigzag-shaped course of macroblocks in the image.
- An encoding cycle CC corresponding to FIG. 4A is shown in FIG. 4B eg by the fifth macroblock 1 in the first line of the image I, the third macroblock 2 in the second line of the image I and the first macroblock 3 in the third line of the image I. educated.
- FIGS. 5 to 8 show various variants of the entropy coding according to the invention with different ways of updating a common set of probabilistic models.
- the individual Codierzweige are formed based on the zeilenwei ⁇ sen processing of macro block in accordance with Fig. 4A.
- the frequencies of the symbols are taken into account based on a set of probabilistic models, wherein a set may contain one or more probabilistic models.
- Each probability model takes into account a context (ie a corresponding type of symbols and / or coding decisions of already coded blocks).
- different probability models can be used for information to be coded differently, for example for transformation coefficients, motion vectors and coding mode information.
- Entropy coding of a macroblock in a single coding branch is performed based on a standard entropy encoding, for example, based on a ⁇ gangs mentioned VLC coding or arithmetic coding.
- a standard entropy encoding for example, based on a ⁇ gangs mentioned VLC coding or arithmetic coding.
- CABAC or CAVLC can be used.
- the entropy coding in a single coding branch thus proceeds based on known methods, but this entropy coding suitably uses a common set of probabilistic models in which the frequencies of the symbols of all parallel coding branches are taken into account.
- 5 to 8 is indicated by corresponding arrows, on which set of International ⁇ scheineriesmodellen a just coded macro-block accesses.
- the respective set of probabilistic models used for entropy coding is adapted and stored in an intermediate set of probabilistic models, the intermediate sets of probabilistic models being reproduced in the course of the method after updating the already mentioned common set of probabilistic models be discarded.
- the intermediate sets of probabilistic models are called shadow sets.
- Fig. 5 shows a variant of Entropieco ⁇ is sequentially adjusted by the adapted frequencies of the individual Codierzweige consolidation according to the invention, wherein the common set of probabilistic models.
- the origin of an arrow indicates in FIG. 5 and also in all further FIGS. 6 to 9 which set of probabilistic models is accessed for that (just coded) macroblock at which the tip of the corresponding arrow is located.
- the symbols for the macroblock of each of the coding branches 1 to 3 are encoded in the encoding cycle CC1. It will be independent used adaptive entropy coders for each of the branches.
- the coding uses the same initial standard statistics (ie probability models) for all coding branches.
- the original set of likely ⁇ keitsmodellen is adjusted based on the corresponding frequencies of the symbols in each coding branch, so that a first shadow set of probabilistic models for each coding branch is generated.
- Must egismodellen these shadows sets of prob ⁇ while only the modified probability models of the respective types of symbols contained ⁇ th.
- Unmodified probability models need not be stored.
- the original default statistic represents the first version of a common set of probabilistic models, which is then updated as the encoding progresses.
- Fig. 5 is performed after coding of the macro block 1 in the first encoding cycle CC1 already Co ⁇ dation of the macro block 1 in subsequent encoding cycle CC2, without having to wait for the completion of the coding of the Macro Blocks 2 and 3 in the encoding cycle CC1.
- a second set of shadow probability models is generated, which stores the change with respect to the first set of shadow probability models.
- the coding decisions are taken based on the original common set of probability models and the first and second shadow set of probability model ⁇ len.
- the common set of probability model ⁇ len can with the first set of shadow trikeitsmodel- len be updated from the encoding of the macro block 2 in the first encoding cycle CC1.
- the common set of probabilistic models is updated with the first set of shadow probability models from the encoding of the macroblock 3 in the first encoding cycle CC1. The process is continued in this manner until all the macro blocks are encoded ⁇ .
- Coding branch CC2 start only when the common set of probability models has been updated with the first set of shadow probability models from the coding of the macroblock 1 in the coding cycle CC1. However, this updating can only be carried out when the macroblock 3 has been completely coded in the first coding cycle CC1, since otherwise false coding is used in the coding branch 3.
- temporary sets of probability models for the common set of probabilistic models are also generated taking into account one or more already coded shadow sets of probability models.
- a coding in a coding branch a new encoding cycle can be carried out based on a corresponding temporary set of probabilistic models, even if there takes place in a coding branch of the previous encoding cycle co ⁇ dation.
- the above-described variant of the sequential updating of the common set of probabilistic models can also be designed as a delayed updating, in which the common set of probabilistic models does not contain corresponding sets of probabilities of the previous cycle, but of an even later cycle is updated.
- Such a variant of the invention is ge ⁇ shows in Fig. 6. It can be seen that for the first and second coding cycles CC1 and CC2 initially an initial set of standard probability models is used, and only from the third coding cycle is a corresponding update of the common set of probabilistic models with shadow sets of probabilistic models generated in the course of the coding from the first Coding cycle CC1 leads.
- Probability models from the third coding cycle CC3 updated The advantage of the variant of FIG. 6 is that, as a rule, the coding branches do not block each other. Furthermore, only two sets of shadow probability models are needed if the update is delayed by one encoding cycle, as indicated in FIG. If the delay is more than one co ⁇ commanding cycle, additional shadow sets of probability models are needed. The greater the delay tion of the update, the more a deviation in the rate of Codierzweige be tolerated, O ⁇ ne that the Codierzweige block each other. On ⁇ due to the delayed update of the statistics, however, the coding efficiency is slightly deteriorated.
- Fig. 7 shows a third variant of updating the common set of probabilistic models.
- the common set of probabilistic models is updated with all the shadow sets of probabilistic models generated for each encode branch. In this way, the generation of multiple sets of shadows of probabilistic models per coding branch is avoided.
- the coding speed of encoding cycle is determined by the réelles ⁇ th coding branch.
- the synchronization times Müs ⁇ sen here are not set after the end of each encoding cycle. Rather, there is also the possibility that after ei ⁇ ner predetermined number of coding cycles an update is performed.
- FIG. 8 shows such a variant of the update of Codierzwei ⁇ gene, in which the update always takes place only after two coding cycles.
- the same common set of probability models is used for the coding cycles CC1 and CC2, an update of this common set of probabilistic models taking into account the sets of shadows of the first coding cycle CC1 at the beginning of the coding cycle CC3.
- Decoding of the symbols encoded by the methods described above proceeds analogously to the encoding. That is, the decoding is performed in parallel decoding branches, where the common set of probability models is again updated based on the frequencies of the decoded symbols.
- a decoding process will be described by way of example based on the encoded symbols which he were testifies ⁇ with the encoding process of FIG. 5. This decoding process is reproduced in FIG. 9, again indicated by corresponding arrows on which set of probabilistic models a currently decoded macroblock accesses.
- the decoding is done in appropriate decoding cycles DC1, DC2, DC3, etc., within which corresponding now parallel decoding branches 1 ', 2' and 3 'are carried out with which the ent ⁇ speaking coded macroblock are decoded.
- Each of the decoder branches 1 ', 2' and 3 ' is thus decoded in a separate decoding process.
- the macro blocks ⁇ first be decoded in the first decoding cycle DC1 with the appropriate initi- alen set of default probability models.
- the decoding-resultant updates of the frequencies of the decoded symbols are in turn stored in individual shadow sets of probabilistic models.
- the decoding of the marrow block 1' takes place in the second decoding cycle DC2 using a second decoding cycle DC1 Shadow set of probability models.
- the common set of probabilistic models is updated analogously to the coding with the first shadow set of probability models of the macroblock 1 'in the decoding cycle DC1.
- decoding branch 3 starts decoding if the common set of probabilistic models has been updated with the first shadow set of probabilistic models of macroblock 2' in the first decoding cycle DC1.
- a temporary set of probability models for decoding the Marko block 3 'in the second decoding cycle DC2 USAGE be ⁇ det, if the decoding of the macroblock 1' and 2 'has been completed in the first decoding cycle DC1.
- the Codie ⁇ tion continues based on the above steps for all wide ⁇ ren Codierzyklen with corresponding updates until all macroblock are decoded.
- the delay D is to be transferred to the update of the common set of probabilistic models.
- This parameter D 0 coding cycles in the embodiments of FIGS. 5 and 7.
- D 1.
- it is to be transmitted as a parameter whether a synchronized update at predetermined synchronization times is carried out.
- a synchronized Aktualisie ⁇ tion is signaled, whereas is signaled in the embodiments of FIGS. 5 and Fig. 6 that no synchroni ⁇ catalyzed update is performed.
- variants of the method according to the invention described above can be combined with suitable methods of modeling contexts, such as the entropy slices described above, the ordered entropy slices or the interleaved entropy slices.
- suitable methods of modeling contexts such as the entropy slices described above, the ordered entropy slices or the interleaved entropy slices.
- OF INVENTION ⁇ -making process according to the above-described syntax element partitioning and parallel processing of a plurality of binary symbols according to references [3] and [4] may be combined.
- the inventive method has a number of advantages.
- a high compression efficiency is he ⁇ ranges, because a common, valid for all Codierzweige set is used by probability models, which is periodically updated with the adapted Statistics Codierzweige.
- the statistics in the common set of probabilistic models are closer to the actual probabilities than if separate independent sets of probabilistic models are used.
- the parallel coding or decoding of a plurality of coding or decoding branches furthermore achieves rapid encoding and decoding with a low delay.
- the invention Ver ⁇ drive the also suitably Anlagennique with other parallel processed are combined for context-based adaptive entropy coding.
- FIG. 10 shows a schematic representation of a concrete embodiment of a system comprising an inventive coding device and a decoding device according to the invention.
- the coding device is used for entropy coding of a sequence of digitized images and is denoted by EC analogously to FIG.
- the decoding device is used for decoding the sequence of digitized images entropy-coded with the device EC and is denoted by ED in analogy to FIG.
- Both the device EC and the device ED include a plurality of components, which may be configured as individual hardware components, for example as hardware components in a computer. In the same way, the device ED also contains a plurality of components which can be designed as individual hardware components, eg as hardware components in a computer.
- the device EC may optionally comprise, as additional components, the components shown in FIG. 3 in the form of a transformation unit T, a quantizer Q, an inverse quantizer IQ, an inverse transformation unit IT, an image memory SP, a motion estimator ME and entspre ⁇ chender adder a and a 'contain. All these components can in turn be realized as individual hardware components.
- the device EC includes means 100 for dividing the image areas of the processed images into coding cycles.
- the entropy coding is carried out in a coding cycle in several parallel coding branches.
- the device EC example ⁇ adhesive contains three coding means 101, 102 and 103, each coding ⁇ means is provided for encoding in the respective coding branch. If the device more than three Codierzweige be coded, a correspondingly larger number of co ⁇ commanding means is provided.
- Each coding performs Entro ⁇ piecod réelle based by on a set of probability models.
- the encoding means 101 includes as subcomponents a Adapti ⁇ onsstoff 101a and means 101b for processing a joint probability model.
- the coding means 102 and 103 also contain corresponding adaptation means 102a or 103a and corresponding means 102b and 103b, respectively
- the adaptation means in the respective coding branch serves to adapt the frequencies for the set of probability models in the coding of the image region based on the symbols occurring in the image region. That in everyone
- Coding branch provided means for processing a common ⁇ probability probability model performs a processing ⁇ such that the in the respective coding branch for coding is based on the common set of probability models valid for all coding branches, which takes into account the frequencies of symbols in the image areas of all coding branches.
- EC means 104 for updating the common set of probabilistic models in ⁇ predetermined time intervals further is based on provided in at least one adapted temporally preceding encoding cycle frequencies.
- the coding device EC supplies a coded sequence of digitized images, which can be transmitted to the decoding device ED via an arbitrary transmission path.
- the transmission over the transmission path is indicated in Fig. 10 by the arrow P.
- the decoding ⁇ device ED receives the coded image stream and performs a corresponding Entropiedecodtechnik, the device for this purpose has a plurality of components.
- the device ED comprises a means for dividing the coded image regions of the coded sequence of digitized images into decoding cycles in such a way that entropy decoding takes place in a decoding cycle in several parallel decoding branches.
- each decoding branch there is provided at a corresponding decoding means 201 or 202 or 203, wherein in the case of more than three decoding branches corresponding further decoding means are integrated in the device ED.
- Each decoding means performs Entropiede ⁇ coding based on a set of by prokeitsmo ⁇ dings.
- the decoding means 201 comprises an adaptation means 201a for adapting the frequencies for the set of probability models in the decoding of the encoded image area based on the symbols occurring in the decoded image area.
- the decoding means 201 also comprise the decoding means 202 and 203 a corresponding Adap ⁇ tion medium 202a and 203a for the adaptation of the frequencies, and a corresponding means 202b and 203b for processing egg ⁇ nes joint probability model.
- the Decodiervor ⁇ direction ED of Fig. 10 further includes as a further Compo- nent a means 204 for updating the common satellite ⁇ zes of probabilistic models in predetermined time intervals based on at least in a time-adapted preceding decoding cycle frequencies.
- the decoding device ED a decoded sequence is obtained di ⁇ gitalEnglisher images.
- the decoding device may further include the additional components shown in FIG. 3 in the form of an inverse quantizer IQ and an inverse transformation unit IT as well as a memory SP and an adder A ".
- This zusharm ⁇ handy components can be as individual hardware components, for example, configured as hardware components of a computer.
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Computing Systems (AREA)
- Theoretical Computer Science (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
Description
Claims
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP10765622.5A EP2489187B1 (de) | 2009-10-15 | 2010-10-13 | Verfahren zur codierung von symbolen aus einer folge digitalisierter bilder |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP09013060 | 2009-10-15 | ||
EP10000484A EP2312854A1 (de) | 2009-10-15 | 2010-01-19 | Verfahren zur Codierung von Symbolen aus einer Folge digitalisierter Bilder |
PCT/EP2010/065335 WO2011045339A1 (de) | 2009-10-15 | 2010-10-13 | Verfahren zur codierung von symbolen aus einer folge digitalisierter bilder |
EP10765622.5A EP2489187B1 (de) | 2009-10-15 | 2010-10-13 | Verfahren zur codierung von symbolen aus einer folge digitalisierter bilder |
Publications (2)
Publication Number | Publication Date |
---|---|
EP2489187A1 true EP2489187A1 (de) | 2012-08-22 |
EP2489187B1 EP2489187B1 (de) | 2013-09-18 |
Family
ID=43070402
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP10000484A Withdrawn EP2312854A1 (de) | 2009-10-15 | 2010-01-19 | Verfahren zur Codierung von Symbolen aus einer Folge digitalisierter Bilder |
EP10765622.5A Active EP2489187B1 (de) | 2009-10-15 | 2010-10-13 | Verfahren zur codierung von symbolen aus einer folge digitalisierter bilder |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP10000484A Withdrawn EP2312854A1 (de) | 2009-10-15 | 2010-01-19 | Verfahren zur Codierung von Symbolen aus einer Folge digitalisierter Bilder |
Country Status (6)
Country | Link |
---|---|
US (1) | US9338469B2 (de) |
EP (2) | EP2312854A1 (de) |
JP (1) | JP5535326B2 (de) |
KR (1) | KR101767976B1 (de) |
CN (1) | CN102550028B (de) |
WO (1) | WO2011045339A1 (de) |
Families Citing this family (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP2312854A1 (de) | 2009-10-15 | 2011-04-20 | Siemens Aktiengesellschaft | Verfahren zur Codierung von Symbolen aus einer Folge digitalisierter Bilder |
FR2972588A1 (fr) | 2011-03-07 | 2012-09-14 | France Telecom | Procede de codage et decodage d'images, dispositif de codage et decodage et programmes d'ordinateur correspondants |
US9379736B2 (en) * | 2011-06-03 | 2016-06-28 | Qualcomm Incorporated | Context-adaptive coding video data |
FR2977111A1 (fr) * | 2011-06-24 | 2012-12-28 | France Telecom | Procede de codage et decodage d'images, dispositif de codage et decodage et programmes d'ordinateur correspondants |
US9584819B2 (en) | 2011-10-24 | 2017-02-28 | Qualcomm Incorporated | Grouping of tiles for video coding |
US20130114667A1 (en) * | 2011-11-08 | 2013-05-09 | Sony Corporation | Binarisation of last position for higher throughput |
EP2839666B1 (de) * | 2012-04-20 | 2019-12-11 | The Board of Regents of The University of Texas System | Systeme und verfahren zur gleichzeitigen kompression und verschlüsselung |
WO2014120367A1 (en) * | 2013-01-30 | 2014-08-07 | Intel Corporation | Content adaptive parametric transforms for coding for next generation video |
US9432688B2 (en) * | 2013-08-26 | 2016-08-30 | Broadcom Corporation | Parallel symbol decoding |
US20160360236A1 (en) * | 2015-06-04 | 2016-12-08 | Mediatek Inc. | Method and Apparatus for Entropy Transcoding |
EP3264763A1 (de) * | 2016-06-29 | 2018-01-03 | Thomson Licensing | Verfahren und vorrichtung für verbesserte flaggencodierung mit einfachem lokalem prädiktor |
US10541785B2 (en) * | 2016-07-18 | 2020-01-21 | Samsung Electronics Co., Ltd. | Carrier aggregation with variable transmission durations |
CN108024075B (zh) * | 2016-10-28 | 2019-10-11 | 原相科技股份有限公司 | 全局快门高动态范围像素及影像传感器 |
Family Cites Families (27)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5583500A (en) * | 1993-02-10 | 1996-12-10 | Ricoh Corporation | Method and apparatus for parallel encoding and decoding of data |
JP2840589B2 (ja) | 1996-02-09 | 1998-12-24 | 富士通株式会社 | データ圧縮装置及びデータ復元装置 |
JP3108404B2 (ja) | 1998-06-18 | 2000-11-13 | 富士通株式会社 | データ圧縮装置及びデータ復元装置 |
US6856701B2 (en) * | 2001-09-14 | 2005-02-15 | Nokia Corporation | Method and system for context-based adaptive binary arithmetic coding |
JP2003319391A (ja) * | 2002-04-26 | 2003-11-07 | Sony Corp | 符号化装置および方法、復号装置および方法、記録媒体、並びにプログラム |
ITMI20031079A1 (it) | 2003-05-29 | 2004-11-30 | St Microelectronics Srl | Metodo ed apparato per dedificare immagini digitali |
US20060149801A1 (en) | 2003-06-30 | 2006-07-06 | Ihor Kirenko | Method of encoding a signal into a bit stream |
US7286710B2 (en) * | 2003-10-01 | 2007-10-23 | Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. | Coding of a syntax element contained in a pre-coded video signal |
JP2005130099A (ja) * | 2003-10-22 | 2005-05-19 | Matsushita Electric Ind Co Ltd | 算術復号装置、算術符号化装置、算術符号化・復号装置、携帯端末装置、動画像撮影装置、及び、動画像記録・再生装置 |
US7599435B2 (en) * | 2004-01-30 | 2009-10-06 | Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. | Video frame encoding and decoding |
KR100644713B1 (ko) * | 2005-10-31 | 2006-11-10 | 삼성전자주식회사 | 컨텍스트 기반 적응적 이진 산술 코딩 복호기에서 원소구문을 복호화하는 방법 및 이를 위한 복호화 장치 |
KR100873636B1 (ko) * | 2005-11-14 | 2008-12-12 | 삼성전자주식회사 | 단일 부호화 모드를 이용하는 영상 부호화/복호화 방법 및장치 |
KR100717055B1 (ko) * | 2005-11-18 | 2007-05-10 | 삼성전자주식회사 | Cabac 복호기에서 복수의 이진 값들을 파이프라인방식에 의하여 복호화하는 방법 및 이를 위한 복호화 장치 |
JP4095664B2 (ja) | 2006-04-17 | 2008-06-04 | 俊宏 南 | 動画像符号化装置 |
JP4660433B2 (ja) | 2006-06-29 | 2011-03-30 | 株式会社東芝 | 符号化回路、復号回路、エンコーダ回路、デコーダ回路、cabac処理方法 |
US7443318B2 (en) * | 2007-03-30 | 2008-10-28 | Hong Kong Applied Science And Technology Research Institute Co. Ltd. | High speed context memory implementation for H.264 |
US7710296B2 (en) * | 2007-09-19 | 2010-05-04 | Texas Instruments Incorporated | N-bin arithmetic coding for context adaptive binary arithmetic coding |
US8542748B2 (en) | 2008-03-28 | 2013-09-24 | Sharp Laboratories Of America, Inc. | Methods and systems for parallel video encoding and decoding |
US7876257B2 (en) | 2008-04-28 | 2011-01-25 | Mitsubishi Electric Research Laboratories, Inc. | Method and apparatus for compressing SAR signals |
US7982641B1 (en) * | 2008-11-06 | 2011-07-19 | Marvell International Ltd. | Context-based adaptive binary arithmetic coding engine |
FR2944391B1 (fr) | 2008-11-18 | 2013-03-22 | Valeo Sys Controle Moteur Sas | Procede et dispositif electrique combine d'alimentation et de charge a moyens de compensation |
WO2010063184A1 (en) * | 2008-12-03 | 2010-06-10 | Mediatek Inc. | Method for performing parallel cabac processing with ordered entropy slices, and associated apparatus |
US9467699B2 (en) * | 2008-12-03 | 2016-10-11 | Hfi Innovation Inc. | Method for performing parallel coding with ordered entropy slices, and associated apparatus |
US8660193B2 (en) * | 2009-01-12 | 2014-02-25 | Maxim Integrated Products, Inc. | Parallel, pipelined, integrated-circuit implementation of a computational engine |
US8294603B2 (en) * | 2009-06-30 | 2012-10-23 | Massachusetts Institute Of Technology | System and method for providing high throughput entropy coding using syntax element partitioning |
WO2011004577A1 (ja) | 2009-07-06 | 2011-01-13 | パナソニック株式会社 | 画像復号装置、画像符号化装置、画像復号方法、画像符号化方法、プログラムおよび集積回路 |
EP2312854A1 (de) | 2009-10-15 | 2011-04-20 | Siemens Aktiengesellschaft | Verfahren zur Codierung von Symbolen aus einer Folge digitalisierter Bilder |
-
2010
- 2010-01-19 EP EP10000484A patent/EP2312854A1/de not_active Withdrawn
- 2010-10-13 WO PCT/EP2010/065335 patent/WO2011045339A1/de active Application Filing
- 2010-10-13 JP JP2012533619A patent/JP5535326B2/ja active Active
- 2010-10-13 US US13/502,283 patent/US9338469B2/en active Active
- 2010-10-13 CN CN201080046392.5A patent/CN102550028B/zh active Active
- 2010-10-13 KR KR1020127012557A patent/KR101767976B1/ko active IP Right Grant
- 2010-10-13 EP EP10765622.5A patent/EP2489187B1/de active Active
Non-Patent Citations (1)
Title |
---|
See references of WO2011045339A1 * |
Also Published As
Publication number | Publication date |
---|---|
EP2312854A1 (de) | 2011-04-20 |
JP5535326B2 (ja) | 2014-07-02 |
WO2011045339A1 (de) | 2011-04-21 |
CN102550028B (zh) | 2015-08-26 |
JP2013507871A (ja) | 2013-03-04 |
KR101767976B1 (ko) | 2017-08-14 |
CN102550028A (zh) | 2012-07-04 |
KR20120087943A (ko) | 2012-08-07 |
EP2489187B1 (de) | 2013-09-18 |
US20120207213A1 (en) | 2012-08-16 |
US9338469B2 (en) | 2016-05-10 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2011045339A1 (de) | Verfahren zur codierung von symbolen aus einer folge digitalisierter bilder | |
DE69637067T2 (de) | System zur variablen Längendekodierung | |
EP1487113B1 (de) | Kodierung und Dekodierung von Transformationskoeffizienten in Bild- oder Videokodierern | |
DE60307396T2 (de) | Verfahren zur Bildkodierung und -dekodierung | |
DE60310800T2 (de) | Approximierter Kubikfilter | |
DE2640414C2 (de) | Schaltungsanordnung ung Verfahren für die Kompressionscodierung unter Verwendung einer Korrelation zwischen zweidimensionalen, aus zweiwertigen digitalen Bildern abgeleiteten Matrizen | |
EP1797536B1 (de) | Codierschema für einen ein zeitlich veraenderliches graphikmodell darstellenden datenstrom | |
DE2801988A1 (de) | Arithmetische codierung von symbolfolgen | |
EP2222086A1 (de) | Verfahren und Vorrichtung zur Vermeidung von Rundungsfehlern nach Durchführung einer inversen diskreten orthogonalen Transformation | |
DE4446072A1 (de) | Verfahren und Einrichtung zum parallelen Codieren und Decodieren von Daten | |
WO2012095487A1 (de) | Kompression und dekompression von referenzbildern in einem videokoder | |
WO2008080516A1 (de) | Vorrichtung und verfahren zum kodieren eines transformationskoeffizientenblockes | |
EP1571755A2 (de) | Verfahren und Anordnung zur arithmetischen Enkodierung und Dekodierung mit Initialisierung eines Wahrscheinlichkeitsmodelles | |
EP2521357A1 (de) | Verfahren und Vorrichtung zur Filterung von kodierten Bildpartitionen | |
DE3426939C2 (de) | Vorrichtung für eine geschlossene prädiktive Quantisierung eines digitalen Vektorsignals | |
EP1472888B1 (de) | Kontextsensitive kodierung und dekodierung eines videodatenstroms | |
DE60015755T2 (de) | Verlustfreie adaptive codierung von daten eines endlichen alphabets | |
EP0288872A2 (de) | Videosignal-Codierer mit DPCM und adaptiver Prädiktion | |
DE60101745T2 (de) | Viterbi dekodierung mit pfadmetrikaktualisierung durchgeführt in einheiten von bitscheiben | |
DE10218541A1 (de) | Verfahren zur Videocodierung und Computerprogrammprodukt | |
DE19524872C1 (de) | Verfahren und Anordnung zur Codierung und Decodierung von einem Videodatenstrom für alle Bildelemente des Videodatenstroms | |
EP0288783A2 (de) | Anordnung zur DPCM-Codierung von Fernsehsignalen | |
WO2001049038A1 (de) | Verfahren, anordnung und computerprogrammerzeugnis zur prädiktion bei der codierung eines in bildblöcke unterteilten bildes | |
DE102006061647B3 (de) | Vorrichtung und Verfahren zum Kodieren eines Transformationskoeffizientenblockes | |
EP0796016B1 (de) | Verfahren zur Bearbeitung von Bildpunkten eines Bildsegments durch einen Rechner |
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 |
|
17P | Request for examination filed |
Effective date: 20120320 |
|
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 |
|
DAX | Request for extension of the european patent (deleted) | ||
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: SIEMENS AKTIENGESELLSCHAFT |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
INTG | Intention to grant announced |
Effective date: 20130415 |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
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 Free format text: NOT ENGLISH |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: EP |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: FG4D Free format text: LANGUAGE OF EP DOCUMENT: GERMAN |
|
REG | Reference to a national code |
Ref country code: AT Ref legal event code: REF Ref document number: 633313 Country of ref document: AT Kind code of ref document: T Effective date: 20131015 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R096 Ref document number: 502010004804 Country of ref document: DE Effective date: 20131114 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
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: 20130918 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: 20130918 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: 20130918 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: 20130911 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: 20131218 |
|
REG | Reference to a national code |
Ref country code: NL Ref legal event code: VDEP Effective date: 20130918 |
|
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: 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: 20130918 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: 20131219 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: 20130918 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: 20130918 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: 20130918 |
|
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: 20130918 |
|
BERE | Be: lapsed |
Owner name: SIEMENS A.G. Effective date: 20131031 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
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: 20140118 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: 20130918 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: 20130918 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: 20130918 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: 20130918 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: PL 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: 20130918 Ref country code: ES 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: 20130918 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R097 Ref document number: 502010004804 Country of ref document: DE |
|
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: 20140120 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: 20130918 |
|
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 |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: MM4A |
|
26N | No opposition filed |
Effective date: 20140619 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
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: 20130918 Ref country code: BE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20131031 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R097 Ref document number: 502010004804 Country of ref document: DE Effective date: 20140619 |
|
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: 20131013 |
|
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: 20130918 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
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: 20130918 |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
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: 20130918 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: 20130918 Ref country code: LU Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20131013 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: 20101013 Ref country code: CH Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20141031 Ref country code: LI Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20141031 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
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: 20130918 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 6 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: TR 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: 20130918 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 7 |
|
REG | Reference to a national code |
Ref country code: AT Ref legal event code: MM01 Ref document number: 633313 Country of ref document: AT Kind code of ref document: T Effective date: 20151013 |
|
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 NON-PAYMENT OF DUE FEES Effective date: 20151013 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 8 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 9 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
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: 20130918 |
|
P01 | Opt-out of the competence of the unified patent court (upc) registered |
Effective date: 20230512 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 20231106 Year of fee payment: 14 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: IT Payment date: 20231025 Year of fee payment: 14 Ref country code: FR Payment date: 20231017 Year of fee payment: 14 Ref country code: DE Payment date: 20231214 Year of fee payment: 14 |