WO2007077178A1 - Procede de codage et de decodage d'une image ou d'une sequence d'images, dispositifs, programmes d'ordinateur, et signal correspondants - Google Patents
Procede de codage et de decodage d'une image ou d'une sequence d'images, dispositifs, programmes d'ordinateur, et signal correspondants Download PDFInfo
- Publication number
- WO2007077178A1 WO2007077178A1 PCT/EP2006/070210 EP2006070210W WO2007077178A1 WO 2007077178 A1 WO2007077178 A1 WO 2007077178A1 EP 2006070210 W EP2006070210 W EP 2006070210W WO 2007077178 A1 WO2007077178 A1 WO 2007077178A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- series
- coefficients
- image
- group
- type
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/30—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability
- H04N19/34—Scalability techniques involving progressive bit-plane based encoding of the enhancement layer, e.g. fine granular scalability [FGS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/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/129—Scanning of coding units, e.g. zig-zag scan of transform coefficients or flexible macroblock ordering [FMO]
-
- 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/46—Embedding additional information in the video signal during the compression process
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
- H04N19/61—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding in combination with predictive coding
Definitions
- the field of the invention is that of encoding and decoding images or image sequences.
- the invention relates to the coding and decoding of representative coefficients of one or more image (s), resulting from a transformation of the image into one or more blocks.
- the invention applies in particular, but not exclusively, to the coding and decoding of images or video sequences of scalable images (or "scalable") having a hierarchical structure in layers, or levels.
- the invention is positioned in a context of scalable video coding based on a temporal transformation with motion compensation and layer representation with inter-layer prediction.
- a first client can for example access the Internet from a powerful PC, and have a rate of ADSL ("Asymmetric Digital Subscriber Line” for "asymmetrical digital subscriber line”) to 1024 kbits / s while a second client is trying to access the same data at the same time from a PDA ("Personal Digital Assistant") type connected to a low-speed modem.
- ADSL Asymmetric Digital Subscriber Line
- PDA Personal Digital Assistant
- session mobility for example resumption on a PDA of a video session started on a television, or, on a UMTS mobile of a session started on GPRS ("General Packet Radio Service” for "general packet radio service")
- continuity of session in a context of bandwidth sharing with a new application
- high-definition television in which a single video encoding must be able to serve both SD standard definition and high definition terminal customers
- the encoder generates a compressed stream having a layered hierarchical structure, in which each of the layers is nested in a layer of higher level.
- a first data layer conveys a 256 kbit / s stream, which can be decoded by a PDA type terminal
- a second complementary data layer conveys a resolution stream greater than 256 kbit / s which can be decoded, complement the first, by a more powerful terminal type PC.
- the rate required for the transport of these two nested layers is in this example 512 kbit / s.
- Such coding algorithms are thus very useful for all applications for which the generation of a single compressed stream, organized in several scalability layers, can serve several clients of different characteristics.
- JSVM Scalable Video Coding
- AVC Advanced Video Coding
- the JSVM Encoder 2.2.1 Key Characteristics of the Encoder Figure 1 illustrates the structure of such a JSVM encoder, which has a pyramidal structure.
- the video input components 10 undergo dyadic subsampling (2D spatial decimation referenced 11).
- Each of the subsampled flows is then subjected to a temporal decomposition 12 of the "hierarchical image B" type.
- a low resolution version of the video sequence is encoded up to a given bit rate R_rO_max which corresponds to the maximum decodable bit rate for the low spatial resolution rO (this low resolution version is coded as a base layer with a bit rate R_rO_min, and layers of enhancement, until R_rO_max is reached, this basic level is AVC compatible).
- the higher levels are then encoded by subtracting the previous reconstructed and oversampled level and encoding the residuals as: a base level; possibly one or more enhancement levels obtained by multi-pass coding of bit planes (hereafter called FGS for "Fine Grain Scalability").
- FGS enhancement levels obtained by multi-pass coding of bit planes
- the prediction residue is encoded up to a rate R_ri_max which corresponds to the maximum rate that can be decoded for the resolution ri.
- the "hierarchical image B" type filtering blocks 12 deliver motion information 16 that feeds a motion coding block 13-15, and texture information 17, which feeds an inter-layer prediction module 18.
- the predicted data at the output of the inter-layer prediction module 18 feeds an entropy coding and transformation block 20, which works on signal refinement levels.
- the data from this block 20 serve in particular to carry out a 2D spatial interpolation 19 from the lower level.
- a multiplexing module 21 orders the different subflows generated in a global compressed data stream.
- the coding technique used by the JSVM coder is a progressive quantization technique.
- this technique consists firstly of quantifying with a first coarse quantization step the different representative coefficients of the data to be transmitted. Then, the different coefficients are reconstructed, and the difference between the value of the reconstructed coefficient, and the quantized value is calculated.
- this difference is then quantized with a second quantization step, finer than the first step.
- the quantized coefficients are coded in two passes, at each quantization step: a first signifiance pass, which makes it possible to code the new signifying coefficients, that is to say those which have been coded with a zero value at no previous quantization. For these new signifying coefficients, the sign of the coefficient and its amplitude are coded. a second refinement pass, making it possible to refine / code the coefficients that were already significant at the preceding quantization step. For these coefficients, one codes a value 0, +1 or -1 of refinement.
- a significant coefficient is a coefficient whose coded value is other than zero.
- the images to be encoded conventionally comprise three components: a luminance component, and two chrominance components, each typically of size y. the luminance component (ie width and height two times smaller). It is recalled that it is also possible to process images comprising only a luminance component.
- the images are cut into macro blocks of size 16 x 16 pixels, each macro block is then re-cut into blocks.
- the coding of the refinement layers is then done on 4 ⁇ 4 pixel blocks, or on 8 ⁇ 8 pixel blocks.
- the coding of the refinement layers is done on 4 x 4 pixel blocks.
- the first coefficient of the block corresponds to a low frequency (coefficient DC of the discrete cosine transform DCT), and represents the most important information of the group.
- the other coefficients correspond to the high frequencies (AC coefficients of the discrete cosine transform DCT), the energy of the high frequencies decreasing horizontally, vertically and diagonally.
- range in order to code a "range” of coefficients, the information of signifiance of all the coefficients remaining non-significant in the "zig-zag” order is first coded until a newly significant coefficient is reached, and then code the newly significant coefficient.
- range or group are understood to mean a group of coefficients whose positions are consecutive and contained in an interval that begins either at the beginning of a block or after the position of a significant coefficient, and which ends after the next coefficient meaning if we consider a coding (or decoding) pass of significance. In this case, we can speak of a “group of meanings”. If we consider a refinement coding (or decoding) pass, the term “range” or “group of coefficients” is the only coefficient to be refined. In this case, one can speak of a "refinement group”.
- LS to indicate whether or not one has coded the last significant coefficient of the block.
- LS can take two values. For example, if LS is 1, it means that this coefficient is the last significant coefficient of the block: all the coefficients positioned after the last coefficient meaning are non-significant. This avoids coding the significance of all these non-significant coefficients.
- NS, NS, NS, S sign of the signifying coefficient, value (or amplitude) of the signifying coefficient
- LS sign of the signifying coefficient, value ( or amplitude) of the signifying coefficient, LS.
- the refined iterations are coded at the next iteration.
- For each block we study the first coefficient of the block. If the coefficient was already significant at the preceding quantization step (that is to say at the previous iteration), we code its refinement, otherwise we do not code anything. Then we go to the next block, and so on until we have gone through all the blocks.
- a parameter for controlling the interleaving of the coding of the chrominance and luminance component coefficients is also used.
- This technique of iteration coding thus makes it possible to interleave the coefficients of the refinement layer, and to ensure a better image reconstruction quality, especially if the refinement layer is truncated.
- the compressed data stream at the output of the coder, is organized in access units AUs (Access Units), each corresponding to a time instant T, and comprising one or more units of elementary access data.
- AUs Access Units
- NALUs from "Network"
- each NALU is associated with an image or a portion of an image grouping a set of macro blocks (also called “slice”) issue spatio-temporal decomposition, a spatial resolution level, and a quantization level.
- This structuring in elementary units makes it possible to adapt the bit rate and / or space-time resolution by eliminating the NALUs with too great spatial resolution, or with too long a time frequency, or even with too much encoding quality.
- each FGS (or refinement layer) of an image is inserted into a NALU.
- FIG. 3 thus illustrates the access units AU1 31, corresponding to the time TO, and AU2 32, corresponding to the time T1. More specifically, the access unit AU1 31 comprises six NALUs 311 to 316 corresponding to the instant TO.
- the first NALU 311 is representative of a spatial level SO, and a level FGS / CGS EO.
- the second NALU 312 is representative of a spatial level SO, and a level FGS / CGS El.
- the last NALU 316 is representative of a spatial level S2, and a level FGS / CGS El. 3.
- a disadvantage of this encoding technique of the prior art is that to achieve a target rate, it may be necessary to truncate the constituent data packets, also called NALUs.
- the traditional technique of coding refinement layers by iteration which makes it possible to interleave the coefficients of the refinement layer, implies a high complexity to the decoder, although in return it offers a better quality of reconstruction when the refinement layers are truncated either at the encoder or during transmission, compared to a method that would process all the macro blocks of an image sequentially.
- the interleaving of the coefficients of each block implies frequent decoding context changes, and therefore frequent changes in the information contained in the cache of the computer, which leads to an increased complexity in the decoding.
- the truncation of the refinement layers is not always necessary. Indeed, although it makes it possible to reach a target rate for a coded stream by truncating all the refinement layers with the same ratio, the use of the quality levels of the JSVM coder, as presented by I. Amonou, N Cammas, S. Kervadec, S. Pâteux in the document "JVT-Q081 Layered quality opt of JSVM3 and closed-loop", makes it possible to order the layers of refinement of the images between them and to thus reach a target flow without truncating layers of refinements, while improving the quality compared to the case where the refinement layers are truncated.
- the iteration coding does not give a gain in compression, but retains a higher complexity.
- the invention particularly aims to overcome these disadvantages of the prior art.
- an object of the invention is to provide a coding and decoding technique for images and / or video sequences that makes it possible to adapt the complexity to the decoding level, as a function of the type of coding used.
- an object of the invention is to provide such a technique constituting an improvement.
- the JSVM model technique proposed by the JVT working group in JVT-Q202 by J. Reichel, M. Wien and H. Schwarz entitled “Joint Scalable Video Model JSVM-4", October 2005, Nice.
- Another objective of the invention is to propose such a technique that makes it possible to preserve the complexity of a conventional decoding in cases where image truncation is required, and to reduce the decoding complexity in cases where the truncation of the image is not necessary.
- Another objective of the invention is to provide such a technique that is simple to implement and inexpensive in terms of resources (bandwidth, processing capabilities, etc.), and which does not introduce any particular complexity or significant processing.
- the encoding method comprises, for each of the transformed blocks: a step of encoding a series of coefficients corresponding to at least one group of coefficients, said series being determined according to a type of series of coefficients selected from at least two possible types, including: a first type of series according to which the series of coefficients comprises a predetermined number M of groups of coefficients, a second type of series according to which a predetermined maximum position N in the course is identified; series includes the group comprising the maximum position N, and all the preceding groups according to the course, if any, and a step of inserting into the data stream information representative of the type of series of coefficients selected for image or sequence of images, or for a portion of the image.
- the invention is based on an entirely new and inventive approach to the selection of a type of series of coefficients and the coding of a series of coefficients determined from the selected type, and insertion into the stream of the selected series type, so that at the decoding of the data stream, a decoder can read the type of series of coefficients used in encoding, and automatically adapt to the coding used to reduce the complexity of the decoding.
- the series of coefficients to be encoded may, according to a first type of series, comprise a predetermined number M of groups of coefficients.
- the series may correspond to a single group of coefficients, to a predetermined number of groups of coefficients (greater than or equal to 2), or to all the coefficients of the block considered.
- the series may comprise the group comprising the coefficient positioned at the position N, according to a predetermined reading path, and all the preceding groups, according to the predetermined reading path, the group comprising the coefficient positioned at the position N, if there is any.
- the reading path is the "zig-zag" path, as described with reference to FIG. 2A.
- the data stream has a hierarchical structure in nested data layers of successive refinement levels, and the coding method implements an iterative coding, each of the iterations corresponding to one of the levels and implementing the coding step. .
- the invention is thus particularly well suited to coding scalable video signals.
- the series when the series comprising the group comprising the maximum position N has been coded at a previous iteration, the series is empty, when the series comprising the group comprising the maximum position N has not been coded at a previous iteration, the series comprises the group comprising the predetermined maximum position and all the preceding groups according to the route not belonging to a series already encoded at a previous iteration, if any.
- each of the iterations implements at least one of the following passes: a signifiance pass, a refinement pass, the coding step applying to the pass or passes implemented. implement, and a parameter indicating the type of the one or more passes implemented accompanies the information representative of the type of series of coefficients. It is thus possible to code in the stream various information, which will allow the decoder to easily adapt to the coding technique used, and thus to simplify the complexity of the decoding.
- the predetermined grouping criterion defines a group as a set of non-significant successive coefficients, and ending in the first significant coefficient encountered according to the reading path.
- the predetermined grouping criterion defines a group as a single significant coefficient.
- the information representative of the type of series of coefficients is accompanied by implementation information, comprising a vector defining the value of the number M or of the position N for each iteration.
- This vector can be known by default, so previously determined, or directly encoded in the stream. This vector thus makes it possible to define the positions N of coefficients to be reached at each iteration. For example, this vector is worth [1,3,10,16] for a block of size 4 x 4, or [3,10, 36,64] for a block of size
- the implementation information may also specify the number of tracks to be encoded (by defining the number of groups M).
- a source image is decomposed into at least two components to be coded, and the coding is applied to each of the components.
- an image includes a luminance component and two chrominance components, and the coding is applied to each of these three components.
- the invention also relates to a device for coding an image or a sequence of images, generating a data stream, each image being divided into at least two image blocks each of which is associated with a transformed block comprising a set of coefficients, the coefficients of a transformed block being distributed in group (s) of coefficients according to a predetermined grouping criterion and a predetermined reading path of the transformed blocks.
- such a device comprises: means for encoding a series of coefficients corresponding to at least one group of coefficients, the series being determined according to a type of series of coefficients selected from at least two possible types , of which: a first type of series according to which the series of coefficients comprises a predetermined number M of groups of coefficients, a second type of series according to which a predetermined maximum position N in the course is identified, the series comprises the group comprising the position N maximum, and all previous groups depending on the course, if any, and means for inserting into the data stream an information representative of the type of series of coefficients selected for the image or sequence of images, or for a portion of the image.
- Such a device can in particular implement the coding method as described above.
- the data stream may present a hierarchical structure in nested data layers of successive refinement levels, and the coding means may implement iterative coding, each of the iterations corresponding to one of the levels.
- the invention also relates to a method for decoding a data flow representative of an image or a sequence of images, each image being divided into at least two image blocks each of which is associated with a transformed block comprising a set of coefficients, the coefficients of a transformed block being distributed in group (s) of coefficients according to a predetermined grouping criterion and a predetermined reading path of the transformed blocks.
- such a decoding method comprises: a step of reading a type of series of coefficients applied to the image or sequence of images, or to a portion of the image, among at least two possible types , of which: a first type of series according to which the series of coefficients comprises a predetermined number M of groups of coefficients, - a second type of series according to which a predetermined maximum position N in the course is identified, the series comprises the group comprising the maximum position N, and all preceding group (s) according to the course, if any, and a decoding step taking into account, for each transformed block, a series of coefficients according to the type of series of coefficients delivered by the reading step.
- Such a decoding method is particularly adapted to receive a coded data stream according to the coding method described above.
- the data flow can present a hierarchical structure in nested data layers of successive refinement levels.
- the second type of series has the following: when the series comprising the group comprising the maximum position N has been coded at a previous iteration, the series is empty, - when the series comprising the group comprising the position maximum N has not been encoded at a previous iteration, the series comprises the group comprising the predetermined maximum position, and all the preceding groups according to the course not belonging to a series already encoded at a previous iteration, if there is in a.
- the invention also relates to a device for decoding a data stream representative of an image or a sequence of images, each image being divided into at least two image blocks each of which is associated with a transformed block comprising a set of coefficients, the coefficients of a transformed block being distributed in group (s) of coefficients according to a predetermined grouping criterion and a predetermined reading path of the transformed blocks.
- such a decoding device comprises: means for reading a type of series of coefficients applied to the image or sequence of images, or to a portion of the image, among at least two possible types , of which: a first type of series according to which the series of coefficients comprises a predetermined number M of groups of coefficients, a second type of series according to which a predetermined maximum position N in the course is identified, the series comprises the group comprising the position N, and all the preceding groups according to the course, if any, and decoding means taking into account, for each transformed block, a series of coefficients according to the type of series of coefficients delivered by the step of reading.
- Such a device can in particular implement the decoding method as described above. It is therefore adapted to receive a data stream encoded by the encoding device described above.
- the data stream may in particular have a hierarchical structure in nested data layers of successive refinement levels.
- the invention also relates to a signal representative of a data stream, representative of an image or a sequence of images, each image being divided into at least two image blocks, each of which is associated with a transformed block comprising a set of coefficients, the coefficients of a transformed block being divided into group (s) of coefficients according to a predetermined grouping criterion and a predetermined reading path of the transformed blocks.
- such a signal carries information representative of a type of series of coefficients applied to the image or sequence of images, or to a portion of the image, among at least two possible types, of which: a first type of series according to which the series of coefficients comprises a predetermined number M of groups of coefficients, a second type of series according to which a predetermined maximum position N in the course is identified, said series comprises the group comprising the maximum position N, and all previous groups depending on the course, if any.
- Such a signal can in particular represent a data stream coded according to the coding method described above.
- This signal may of course include the various characteristics relating to the coding method according to the invention.
- the data stream may in particular have a hierarchical structure in nested data layers of successive refinement levels, said flow having undergone iterative coding, each of the iterations corresponding to one of said levels.
- the series for the second type of series: when the series comprising the group comprising the maximum position N has been encoded at a previous iteration, the series is empty, - when the series comprising the group comprising the maximum position N has not been has not been coded at a previous iteration, the series comprises the group comprising the predetermined maximum position, and all the preceding groups according to the route not belonging to a series already encoded at a previous iteration, if any.
- the invention relates to a computer program product downloadable from a communication network and / or stored on a computer-readable and / or executable medium by a microprocessor, comprising program code instructions for implementing the encoding method as described above, and a program product of computer downloadable from a communication network and / or stored on a computer-readable and / or executable medium by a microprocessor, comprising program code instructions for the implementation of the decoding method described above.
- FIG. 1 already described in connection with the prior art, has a JSVM type encoder
- FIGS. 2A and 2B also presented in relation with the prior art, illustrate the zig-zag path of the coefficients of the blocks composing an image
- FIG. 3 also presented in relation with the prior art, describes the structure of a SVC type flow according to the prior art
- FIG. 4 presents the general principle of the coding method according to the invention
- FIGS. 5A to 5D illustrate different types of possible series for coding the coefficients of a block according to the method of FIG. 4
- FIG. 5A to 5D illustrate different types of possible series for coding the coefficients of a block according to the method of FIG. 4
- FIG. 6 shows the frequency bands of a default vector considered for a 4 ⁇ 4 block according to a variant of the invention
- FIG. 7 describes the general principle of the decoding method according to the invention
- FIGS. 8 and 9 respectively show the simplified hardware structure of a coding device and a decoding device according to the invention.
- the general principle of the invention is based on the coding of a series of coefficients among a set of coefficients representative of an image, the series to be coded being determined according to a type of series of coefficients selected from at least two types .
- An image divided into at least two blocks is considered according to the invention, each of which is associated with a transformed block, for example by means of a discrete cosine transform (DCT).
- DCT discrete cosine transform
- block is used hereinafter to mean a block resulting from the cutting and transformation of the image.
- the coding method according to this preferred embodiment of the invention is advantageously an iterative method, coding at each iteration a level of the hierarchical structure in nested data layers generating the data stream.
- the block or frames are scanned block by block, and at least some coefficients of each of the blocks are coded, according to the type of series of coefficients, selected from at least two types possible.
- the coefficients can be coded in one or two passes at each iteration, according to a signifiance pass, making it possible to code the new signifying coefficients, that is to say those that have been encoded with a null value at the previous iteration, and / or according to a refinement pass, to refine / code the coefficients that were already significant at the previous iteration.
- group of coefficients is thus meant a group of coefficients whose positions are consecutive and contained in an interval that begins either at the beginning of a block or after the position of a significant coefficient. and which ends after the next significant coefficient if we consider a coding (or decoding) pass of significance, the only coefficient to be refined if we consider a refinement coding (or decoding) pass.
- a "group of significance” is a group obtained during a signifiance pass
- "refinement group” is a group obtained during a refinement pass.
- the video input components 41 (image, image sequences, or image portion) first undergo a processing 42 making it possible to cut them into at least two blocks, and to associate to each of these blocks a transformed block comprising a set of coefficients.
- a type of coefficient series is selected from at least two possible types.
- the type of series of coefficients is chosen from among several possible types, of which a first type in which a series of coefficients corresponds to M groups of coefficients, where M is a predetermined integer, and a second type in which a series comprises a set of coefficients. group comprising the coefficient positioned at a predetermined maximum position N, and all groups preceding this group in the zig-zag reading path, if any.
- the series considered at the current iteration is zero.
- the series considered at the current iteration comprises a group comprising the coefficient positioned at the position N, and all the groups previous this group in the zig-zag reading path, if any.
- the number N thus corresponds to a position in the block considered, according to the zig-zag course, defined according to the iteration and given by a vector known by default or encoded in the stream.
- this default vector is [1,3,10,16] for a block of size 4 x 4, or [3,10, 36,64] for a block of size 8 x 8.
- Mode 1 thereafter); to a set of groups defined according to a maximum position N according to the iteration (we note this coding "mode 2" later); or else - M groups of coefficients (we note this coding "mode 3" later).
- FIGS. 5A to 5D notably illustrate these different series for coding the coefficients of a block, during a run of the coefficients in the "zig-zag" order as described in relation with the prior art.
- FIG. 5A thus shows the coding of a series of coefficients of the first type according to the "mode 0".
- the series 51 corresponds in this case to a single group.
- an '0' means that the coefficient is not a newly significant coefficient (it has been encoded at the previous iteration as a significant coefficient, or it has been coded as a non-significant coefficient and it remains in the non-meaningful state at this current iteration), and that a 'l' means that the coefficient is new signifier (it was coded to the previous iteration with a null value and becomes significant at the current iteration).
- the series 51 thus corresponds to the group 0, 0, 0, 1, sign coefficient, value coefficient.
- FIG. 5B illustrates the coding of a series of second type coefficients according to the "mode 2", considering N equal to 6: the series 52 comprises the group comprising the coefficient located at position 6 (referenced 521 in FIG. 5B ), following the zig-zag course of the block, and the group preceding this group in the order of travel, if these groups do not include coefficients already coded at a previous iteration.
- FIG. 5D shows the coding of a series of first-type coefficients according to "mode 1", in which the series 54 corresponds to the set of coefficients of the block considered.
- the coding method codes, for a first level of the hierarchical structure in successive layers (first iteration), during the coding step 44, a series of coefficients of the first block, determined according to the selected type, then the second block, and so on until the last block (45). Then we go to a second level of the hierarchical structure in successive layers (second iteration 46), and again code a series of coefficients of the first block, determined according to the selected type, then the second block, and so on until to the last block (45) of the second level. Thus each data layer of the hierarchical structure is coded.
- the series is empty, otherwise the series comprises the group comprising the predetermined maximum position, and all the groups previous ones according to the course of reading (if such groups exist). For mode 0 and mode 3, if there are no more groups to code, the series is empty.
- the coder delivers a global data stream 47 into which information representative of the type of series of coefficients selected for the image or the sequence of images is inserted. or for a portion of the image.
- a decoder can read the information representative of the type of series of coefficients selected and automatically adapt to the coding mode used, especially for the decoding of the refinement layers.
- the invention thus offers the possibility of having a low complexity or adaptive complexity decoding.
- This information representative of the type of series of coefficients selected may also be accompanied by implementation information, comprising for example a vector defining the value of the number M or the position N for each iteration.
- the coded data stream 47 may carry two pieces of information indicating, on the one hand, the type of series of coefficients selected, used in particular by the decoder for the decoding of the refinement layers, and on the other hand one or more bits for the vector defining the coefficient positions to be reached at each iteration if the coding implements mode 2 (defining the position N), or the number of tracks to be coded if the coding implements mode 3 (by defining the number of groups M).
- these information elements are inserted in the stream 47 in the header of the data packets relating to a temporal image or an image portion (also called
- blnterlacedSigRef a parameter, denoted blnterlacedSigRef thereafter, which indicates whether for a given iteration, one encoding groups of significance coefficients and / or groups of refinement coefficients.
- This method is also remarkable in that it can provide to use only the second type of series to determine the series of coefficients to be coded.
- the fgs_coding_mode field is used to indicate the type of coefficient series selected during coding, and the decoder may read during the decoding of the compressed data stream, and in particular refinement layers.
- the second type of series (“mode 2”) determines a series of coefficients comprising: the group comprising the position N and all the groups preceding it according to the reading path (if they exist), if the group comprising the position N n was not coded at a previous iteration; otherwise an empty series.
- the field fgs_coding_mode takes the value 0, it indicates that the coding is performed according to the first type of series of coefficients, according to the "mode 0", and therefore that the decoding must make it possible to decode a group per block for each of the blocks at each iteration.
- the value 1 indicates that the coding is performed according to the first type of series of coefficients, according to the "mode 1”, and therefore that the decoding must make it possible to decode all the coefficients of each of the blocks in a single iteration.
- This "mode 1" corresponds to a low complexity decoding of the refinement layers, where all the groups of the type meaning and / or refined of a block are decoded in an iteration.
- the value 2 indicates that the coding is carried out according to the second type of series of coefficients, according to the "mode 2", and therefore that the decoding must make it possible to decode at each iteration a set of groups until reaching a position N, this position being defined at each iteration, by default or in a fixed or variable vector.
- the value 3 indicates that the coding is performed according to the first type of series of coefficients, according to the "mode 3", and therefore that the decoding must make it possible to decode at each iteration a number M of groups. This number M can be constant.
- the flags vect4x4_presence_flag and vect8x8_presence_flag respectively indicate the presence of vectors defining the maximum position N, in the case of mode 2, for blocks of sizes 4 x 4 pixels and for blocks of sizes 8 x 8 pixels.
- the num_iter_coded variable indicates the number of values contained in the vector for 4 x 4 blocks and / or for 8 x 8 blocks.
- the variable scanlndex_blk4x4 [i] indicates the maximum position of a coefficient of a 4 x 4 block up to which groups must be decoded at iteration i.
- the variable scanlndex_blk.8x8 [i] indicates the maximum position of a coefficient of an 8 x 8 block up to which groups must be decoded at iteration i.
- this vector is deduced from the vector for an 8 x 8 block (respectively 4 x 4) by dividing the values of this vector by 4 (respectively by multiplying the values of this vector by 4).
- each default value corresponds to a predetermined frequency zone of the coefficient block, the position index ranging from 1 to 16 for the 4 ⁇ 4 blocks, from 1 to 64 for the 8 ⁇ 8 blocks.
- FIG. 6 illustrates the frequency bands of the default vector considered for a 4 ⁇ 4 block.
- the reference 61 designates the position 1 according to the reading path in zig-zag
- the reference 62 illustrates the position 3
- the reference 63 illustrates the position 10
- the position 64 illustrates the position 16, defined in the vector [1,3,10,16].
- variable num_plage_coded indicates the number of ranges or groups to be decoded at each iteration.
- the mode 0 at each iteration a range per block is decoded
- mode 1 at each iteration all the tracks of each block are decoded
- mode 2 at each iteration, a number of tracks is decoded to reach a position N in the block, N being a function of the iteration
- mode 3 at each iteration, a constant number M of tracks is decoded.
- each macro block of the image is scanned.
- the value of the completeLumaSig variable we look at the value of the completeLumaSig variable during a step 73 "Test completeLumaSig”. If the completeLumaSig variable is FALSE (731), during a step 74, the signifiance pass is decoded for each luminance block of the macro block and then step 75 is passed.
- the value of the variable completeLumaSig goes to TRUE (732)
- we look at the value of the interlaced_sig_ref variable, during a test step 75 “test interlaced_sig_ref".
- blnterlacedChroma test This test makes TRUE (771) if blnterlacedChroma is TRUE, and if iterChroma (iter) makes TRUE, or if completeLumaSig is TRUE and completeLumaRef is TRUE. If the "blnterlacedChrma" test 77 is FALSE (772), then step 82 is proceeded to. If the "blnterlacedChroma test” 77 is TRUE (771), the value of the completeChromaSig variable is examined during a step 78 "Test completeChromaSig". If completeChromaSig is FALSE (781), for each block of chrominance of the macro block, the signifiance pass is decoded during a step 79.
- the interlaced_sig_ref variable is then tested again during a test step 80. This test returns TRUE (801) if interlaced_sig_ref is TRUE or completeChromaSig is TRUE, and completeChromaRef is FALSE. Otherwise (802) this test makes FALSE. If the test makes TRUE (801), one decodes during a step 81 the refinement pass for each chrominance block of the macro block, then we go to step 82.
- the considered macro block is the last macro block of the image or of the current portion of the image. If it is not the last one (821), one repeats (83) on the following macro block. If the macro block considered is the last macro block of the image or the current portion of the image (822), proceed to step 84 of updating the variable completeSig, Ref. The fine test 85 is then carried out.
- Update (84) of the completeSig.Ref variable The step of updating the completeSig, Ref variable updates the completeLumaSig, completeLumaRef, completeChromaSig, and completeChromaRef variables.
- TRUE (851) if completeLumaSig is TRUE, completeLumaRef is TRUE, completeChromaSig is TRUE, and completeChromaRef is TRUE. If the end test is FALSE (852), we proceed to the next iteration (iter ++), otherwise the decoding ends (86). IterChromadter function):
- This function makes TRUE if the luminance and chrominance ranges are interleaved and if iteration iterates, chrominance ranges should be decoded. This function is used to control the interleaving of the chrominance and luminance coefficients.
- the decoding of groups corresponds: in the case of a signifiance pass: to the decoding of all remaining non-significant coefficients positioned between the beginning of the block (or just after a significant coefficient) and just before the next significant coefficient next; and decoding the next new signifier coefficient, in the case of a refinement pass: at the decoding of the refinement of the already significant coefficient.
- the course of the coefficients is done in zig-zag order.
- the decoding of the chrominance blocks and the luminance blocks is done in the same way.
- a group is decoded. If we are at the end of the block, we set the boolean parameter completeCompPassBl of the current block to TRUE, where the Comp variable indicates Luma if the block is a luminance block, or Chroma if the block is a chrominance block, and the variable Pass indicates Sig if the decoded pass is a signifiance pass, and Ref if the decoded pass is a pass of refinement.
- mode 1 for each block, all groups are decoded and completeCompPassB1 of the current block is set to TRUE.
- the maximum position N in the block which is equal to scanlndex_blkkxk [i], where i is the number of the current iteration and k X k is the block type (4 x 4 or 8 x 8 for a luminance block, or 4 x 4 for a chrominance block). Then, decodes are decoded as long as the position of the last decoded coefficient is smaller than the position N. If we are at the end of the block, we set completeCompPassB1 of the current block to TRUE.
- FIG. 8 shows the hardware structure of a coding device for an image or a sequence of images implementing the coding method described above.
- Such an encoding device comprises a memory M 87, a processing unit P 88, equipped for example with a microprocessor ⁇ P, and driven by the computer program Pg 89.
- the code instructions of the program of computer Pg 89 are for example loaded into a memory
- the processing unit P 88 receives as input video input components 41 (image, image sequences, or image portion).
- the microprocessor ⁇ P of the processing unit 88 implements the steps of the coding method described above in relation with FIG. 4, according to the instructions of the program
- the processing unit 88 outputs a coded data stream 47.
- FIG. 9 illustrates the hardware structure of a device for decoding a coded data stream, generated for example by the coding device of FIG. 8.
- Such a decoding device comprises a memory M 90, a processing unit P 91, equipped for example with a microprocessor ⁇ P, and driven by the computer program Pg 92.
- the code instructions of the program D 92 computer are for example loaded in a RAM memory before being executed by the processor of the processing unit 91.
- the processing unit 91 receives as input an encoded data stream 93 to be decoded.
- the microprocessor ⁇ P of the processing unit 91 implements the steps of the decoding method described above in relation to FIG. 7, according to the instructions of the program Pg 92.
- the processing unit 91 outputs video components 94 (FIG. image, image sequences, or image portion) decoded.
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
- Compression Of Band Width Or Redundancy In Fax (AREA)
Abstract
Description
Claims
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2008548987A JP2009522891A (ja) | 2006-01-06 | 2006-12-26 | 1つの画像または一連の画像を符号化し、また復号する方法、対応する装置、コンピュータプログラムおよび信号 |
BRPI0620906-8A BRPI0620906A2 (pt) | 2006-01-06 | 2006-12-26 | métodos para codificar e decodificar uma imagem ou uma seqüência de imagens, e dispositivo, programa de computador e sinal correspondentes |
EP06841621A EP1969854A1 (fr) | 2006-01-06 | 2006-12-26 | Procede de codage et de decodage d'une image ou d'une sequence d'images, dispositifs, programmes d'ordinateur, et signal correspondants |
US12/159,958 US20090219988A1 (en) | 2006-01-06 | 2006-12-26 | Methods of encoding and decoding an image or a sequence of images, corresponding devices, computer program and signal |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR06/00139 | 2006-01-06 | ||
FR0600139A FR2896117A1 (fr) | 2006-01-06 | 2006-01-06 | Procedes de codage et de decodage d'une sequence d'images, dispositifs , programmes d'ordinateur, et signal correspondants |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2007077178A1 true WO2007077178A1 (fr) | 2007-07-12 |
Family
ID=36942384
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/EP2006/070210 WO2007077178A1 (fr) | 2006-01-06 | 2006-12-26 | Procede de codage et de decodage d'une image ou d'une sequence d'images, dispositifs, programmes d'ordinateur, et signal correspondants |
Country Status (9)
Country | Link |
---|---|
US (1) | US20090219988A1 (fr) |
EP (1) | EP1969854A1 (fr) |
JP (1) | JP2009522891A (fr) |
KR (1) | KR20080092940A (fr) |
CN (1) | CN101356821A (fr) |
BR (1) | BRPI0620906A2 (fr) |
FR (1) | FR2896117A1 (fr) |
RU (1) | RU2008129892A (fr) |
WO (1) | WO2007077178A1 (fr) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
RU2493669C1 (ru) * | 2009-10-28 | 2013-09-20 | Самсунг Электроникс Ко., Лтд. | Способ и устройство для кодирования остаточного блока, способ и устройство для декодирования остаточного блока |
Families Citing this family (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
BRPI0714127A2 (pt) * | 2006-07-13 | 2012-12-25 | Qualcomm Inc | codificaÇço de vÍdeo com escalabilidade de granularidade fina utilizando fragmentos alinhados por ciclo. |
EP2123052B1 (fr) * | 2007-01-18 | 2010-11-24 | Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. | Flux de donnees video a qualite echelonnable |
FR2931025B1 (fr) * | 2008-05-07 | 2010-05-21 | Canon Kk | Procede de determination d'attributs de priorite associes a des conteneurs de donnees, par exemple dans un flux video, procede de codage, programme d'ordinateur et dispositifs associes |
KR20110112168A (ko) * | 2010-04-05 | 2011-10-12 | 삼성전자주식회사 | 내부 비트뎁스 확장에 기반한 비디오 부호화 방법 및 그 장치, 내부 비트뎁스 확장에 기반한 비디오 복호화 방법 및 그 장치 |
BR112013007205A2 (pt) * | 2010-09-30 | 2020-10-06 | Samsung Electronics Co., Ltd | método de codificação de vídeo para codificar símbolos tendo uma estrutura hierárquica, método de decodificação de vídeo para decodificar símbolos tendo uma estrutura hierárquica, aparelho de codificação |
CA2915359C (fr) * | 2013-06-14 | 2018-09-04 | Arris Technology, Inc. | Re-echantillonnage de filtres pour codage video evolutif |
AU2020312302B2 (en) * | 2019-07-12 | 2023-08-17 | Lg Electronics Inc. | Method and apparatus for coding image on basis of transform |
Family Cites Families (22)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5674912A (en) * | 1991-03-01 | 1997-10-07 | Warner-Lambert Company | Sunscreen-wound healing compositions and methods for preparing and using same |
NO175080B (no) * | 1992-03-11 | 1994-05-16 | Teledirektoratets Forskningsav | Fremgangsmåte for koding av bildedata |
EP0884045A1 (fr) * | 1997-06-06 | 1998-12-16 | Pfizer Products Inc. | Formulations autobronzantes de dihydroxyacetone à stabilité améliorée et conférant une administration accrue |
US6048533A (en) * | 1997-06-30 | 2000-04-11 | Nguyen; Van Bich | Turmeric for treating health ailments |
US5897865A (en) * | 1997-06-30 | 1999-04-27 | Nguyen; Van Bich | Turmeric for treating skin disorders |
DE69808790T3 (de) * | 1997-09-12 | 2009-07-16 | The Procter & Gamble Co., Cincinnati | Hautreinigungs- und konditionierungsartikel für haut und haar |
US6074630A (en) * | 1999-11-23 | 2000-06-13 | Devillez; Richard L. | Delivery system for suncare products |
US6826232B2 (en) * | 1999-12-20 | 2004-11-30 | Koninklijke Philips Electronics N.V. | Fine granular scalable video with embedded DCT coding of the enhancement layer |
US6950558B2 (en) * | 2001-03-30 | 2005-09-27 | Ricoh Co., Ltd. | Method and apparatus for block sequential processing |
US20030113388A1 (en) * | 2001-12-13 | 2003-06-19 | Dung Phan | Methods of treatment for skin disorders using turmeric extract and a hydroxy acid |
WO2003077566A1 (fr) * | 2002-03-07 | 2003-09-18 | Aware, Inc. | Codage de bits de signe entrelaces |
US6875426B2 (en) * | 2002-03-28 | 2005-04-05 | L'oreal | Self-tanning composition containing a tetrahydrocurcuminoid and a self-tanning agent |
JP4105578B2 (ja) * | 2003-03-28 | 2008-06-25 | 株式会社リコー | 画像圧縮装置 |
US20050084551A1 (en) * | 2003-09-26 | 2005-04-21 | Jensen Claude J. | Morinda citrifolia-based oral care compositions and methods |
US7205011B2 (en) * | 2003-11-14 | 2007-04-17 | Board Of Regents, Acting For And On Behalf Of, University Of Arizona | Anti-inflammatory activity of a specific turmeric extract |
JP4768728B2 (ja) * | 2004-05-13 | 2011-09-07 | コーニンクレッカ フィリップス エレクトロニクス エヌ ヴィ | 値のブロックをエンコードする方法および装置 |
US7471841B2 (en) * | 2004-06-15 | 2008-12-30 | Cisco Technology, Inc. | Adaptive breakpoint for hybrid variable length coding |
US7454073B2 (en) * | 2004-06-15 | 2008-11-18 | Cisco Technology, Inc. | Video compression using multiple variable length coding processes for multiple classes of transform coefficient blocks |
WO2006016029A1 (fr) * | 2004-07-13 | 2006-02-16 | France Telecom | Procede et dispositif de codage d’une sequence d’images video en coefficients de sous-bandes de frequence de differentes resolutions spatiales |
EP1908298A4 (fr) * | 2005-07-21 | 2010-12-29 | Nokia Corp | Codes a longueur variable pour codage video adaptable |
EP2052545B1 (fr) * | 2006-07-10 | 2013-10-02 | Orange | Dispositif et procede de codage et de decodage echelonnables de flux de donnees d'images, signal et programme d'ordinateur correspondants |
KR100809301B1 (ko) * | 2006-07-20 | 2008-03-04 | 삼성전자주식회사 | 엔트로피 부호화/복호화 방법 및 장치 |
-
2006
- 2006-01-06 FR FR0600139A patent/FR2896117A1/fr not_active Withdrawn
- 2006-12-26 WO PCT/EP2006/070210 patent/WO2007077178A1/fr active Application Filing
- 2006-12-26 RU RU2008129892/09A patent/RU2008129892A/ru not_active Application Discontinuation
- 2006-12-26 US US12/159,958 patent/US20090219988A1/en not_active Abandoned
- 2006-12-26 JP JP2008548987A patent/JP2009522891A/ja active Pending
- 2006-12-26 BR BRPI0620906-8A patent/BRPI0620906A2/pt not_active IP Right Cessation
- 2006-12-26 CN CNA2006800504613A patent/CN101356821A/zh active Pending
- 2006-12-26 KR KR1020087019294A patent/KR20080092940A/ko not_active Application Discontinuation
- 2006-12-26 EP EP06841621A patent/EP1969854A1/fr not_active Withdrawn
Non-Patent Citations (1)
Title |
---|
PURI A ET AL: "Video coding using the H.264/MPEG-4 AVC compression standard", SIGNAL PROCESSING. IMAGE COMMUNICATION, ELSEVIER SCIENCE PUBLISHERS, AMSTERDAM, NL, vol. 19, no. 9, October 2004 (2004-10-01), pages 793 - 849, XP004607150, ISSN: 0923-5965 * |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
RU2493669C1 (ru) * | 2009-10-28 | 2013-09-20 | Самсунг Электроникс Ко., Лтд. | Способ и устройство для кодирования остаточного блока, способ и устройство для декодирования остаточного блока |
US8811479B2 (en) | 2009-10-28 | 2014-08-19 | Samsung Electronics Co., Ltd. | Method and apparatus for encoding residual block, and method and apparatus for decoding residual block |
US10136149B2 (en) | 2009-10-28 | 2018-11-20 | Samsung Electronics Co., Ltd. | Method and apparatus for encoding residual block, and method and apparatus for decoding residual block |
US10154273B2 (en) | 2009-10-28 | 2018-12-11 | Samsung Electronics Co., Ltd. | Method and apparatus for encoding residual block, and method and apparatus for decoding residual block |
US10171826B2 (en) | 2009-10-28 | 2019-01-01 | Samsung Electronics Co., Ltd. | Method and apparatus for encoding residual block, and method and apparatus for decoding residual block |
US10178401B2 (en) | 2009-10-28 | 2019-01-08 | Samsung Electronics Co., Ltd. | Method and apparatus for encoding residual block, and method and apparatus for decoding residual block |
US10257530B2 (en) | 2009-10-28 | 2019-04-09 | Samsung Electronics Co., Ltd. | Method and apparatus for encoding residual block, and method and apparatus for decoding residual block |
Also Published As
Publication number | Publication date |
---|---|
KR20080092940A (ko) | 2008-10-16 |
RU2008129892A (ru) | 2010-02-20 |
FR2896117A1 (fr) | 2007-07-13 |
US20090219988A1 (en) | 2009-09-03 |
CN101356821A (zh) | 2009-01-28 |
JP2009522891A (ja) | 2009-06-11 |
BRPI0620906A2 (pt) | 2011-11-29 |
EP1969854A1 (fr) | 2008-09-17 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1839442B1 (fr) | Dispositifs et procedes de codage et de decodage echelonnables de flux de donnees d'images, signal, programme d'ordinateur et module d'adaptation de qualite d'image correspondants | |
EP1969854A1 (fr) | Procede de codage et de decodage d'une image ou d'une sequence d'images, dispositifs, programmes d'ordinateur, et signal correspondants | |
US7062096B2 (en) | Apparatus and method for performing bitplane coding with reordering in a fine granularity scalability coding system | |
EP1721470B1 (fr) | Procede de codage et de decodage d'une sequence d'images par analyse temporelle hierarchique | |
FR2931610A1 (fr) | Procede et un dispositif de transmission de donnees d'images | |
EP2052545B1 (fr) | Dispositif et procede de codage et de decodage echelonnables de flux de donnees d'images, signal et programme d'ordinateur correspondants | |
FR2903556A1 (fr) | Procedes et des dispositifs de codage et de decodage d'images, un systeme de telecommunications comportant de tels dispositifs et des programmes d'ordinateur mettant en oeuvre de tels procedes | |
FR2939593A1 (fr) | Procede et dispositif de codage video | |
WO2010043811A1 (fr) | Procede et dispositif de codage d'une sequence d'image mettant en oeuvre des blocs de taille differente, signal, support de donnees, procede et dispositif de decodage, et programmes d'ordinateur correspondants | |
EP2011340A2 (fr) | Procede et dispositif de codage de donnees en un flux scalable | |
FR2854019A1 (fr) | Embrouillage, desembrouillage et distribution securisee de sequences audiovisuelles issues de codeurs videos bases sur un traitement par ondelettes | |
WO2002060184A1 (fr) | Procede de codage et de decodage d'images, dispositifs et applications correspondants | |
FR3008840A1 (fr) | Procede et dispositif de decodage d'un train scalable representatif d'une sequence d'images et procede et dispositif de codage correspondants | |
EP1600003B1 (fr) | Procede de codage d'une image video prenant en compte la parite relative a une composante du vecteur de mouvement | |
FR2768003A1 (fr) | Procede de codage d'un signal de forme binaire | |
EP1181668B1 (fr) | Procede de codage/decodage d'images | |
WO2012056148A1 (fr) | Codage video echelonnable a partir d'un epitome hierarchique | |
FR2956789A1 (fr) | Procede et dispositif de traitement d'une sequence video | |
EP3918798A1 (fr) | Procédé et dispositif de codage et de décodage de données correspondant à une séquence vidéo | |
FR2911233A1 (fr) | Procedes et dispositifs de codage et de decodage d'un flux d de donnees scalable tenant compte d'une classe de scalabilite, produits programme d'ordinateur, signal et support de donnees correspondants. | |
FR2891966A1 (fr) | Dispositifs et procedes de codage et de decodage echelonnables de flux de donnees d'images, signal, programme d'ordinateur et module d'adaptation de qualite d'images correspondants | |
Trocan | Décompositions spatio-temporelles et allocation de débit utilisant les coupures des graphes pour le codage vidéo scalable | |
EP3815366A1 (fr) | Procédés et dispositifs de codage et de décodage d'un flux de données représentatif d'au moins une image | |
FR2903554A1 (fr) | Dispositif et procede de codage et de decodage echelonnables de flux de donnees d'images, signal et programme d'ordinateur correspondants. | |
FR2903555A1 (fr) | Dispositif et procede de codage et de decodage echelonnables de flux de donnees d'images, signal et programme d'ordinateur correspondants. |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2006841621 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 3270/CHENP/2008 Country of ref document: IN |
|
WWE | Wipo information: entry into national phase |
Ref document number: 200680050461.3 Country of ref document: CN |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2008548987 Country of ref document: JP |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
ENP | Entry into the national phase |
Ref document number: 2008129892 Country of ref document: RU Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1020087019294 Country of ref document: KR |
|
WWP | Wipo information: published in national office |
Ref document number: 2006841621 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 12159958 Country of ref document: US |
|
ENP | Entry into the national phase |
Ref document number: PI0620906 Country of ref document: BR Kind code of ref document: A2 Effective date: 20080704 |