Classifications

• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04B—TRANSMISSION
  • H04B7/00—Radio transmission systems, i.e. using radiation field
  • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
  • H04B7/12—Frequency diversity
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
  • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
  • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
  • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
  • H04N19/119—Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
  • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
  • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
  • H04N19/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/124—Quantisation
• • 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/136—Incoming video signal characteristics or properties
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
  • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
  • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
  • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
  • H04N19/136—Incoming video signal characteristics or properties
  • H04N19/137—Motion inside a coding unit, e.g. average field, frame or block difference
• • 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/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
  • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
  • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
  • H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
  • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
  • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
  • H04N19/189—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding
  • H04N19/196—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding being specially adapted for the computation of encoding parameters, e.g. by averaging previously computed encoding parameters
• • 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/189—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding
  • H04N19/196—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding being specially adapted for the computation of encoding parameters, e.g. by averaging previously computed encoding parameters
  • H04N19/197—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding being specially adapted for the computation of encoding parameters, e.g. by averaging previously computed encoding parameters including determination of the initial value of an encoding 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/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/423—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 characterised by memory 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/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/44—Decoders specially adapted therefor, e.g. video decoders which are asymmetric with respect to the encoder
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
  • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
  • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
  • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
  • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
  • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
  • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
  • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
  • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
  • H04N19/51—Motion estimation or motion compensation
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
  • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
  • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
  • H04N19/593—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving spatial prediction techniques
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
  • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
  • H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
  • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
  • H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
  • H04N19/61—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding in combination with predictive coding
• • 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/625—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding using discrete cosine transform [DCT]
• • 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/70—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by syntax aspects related to video coding, e.g. related to compression standards
• • 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 present invention relates generally to the field of image processing, and more specifically to the encoding and decoding of digital images and digital image sequences.
• the invention can thus, in particular, apply to the video coding implemented in current (MPEG, H.264, etc.) or future video encoders (ITU-T / VCEG (H.265) or ISO / MPEG ( HVC).
• current MPEG, H.264, etc.
• future video encoders ITU-T / VCEG (H.265)
• ISO / MPEG HVC
• each macroblock is itself divided into blocks and each block, or macroblock, is coded by intra-image prediction or inter-image prediction.
• intra-image prediction some images are coded by spatial prediction (intra prediction), while other images are coded by temporal prediction (inter prediction) with respect to one or more coded-decoded reference images, by means of compensation. in motion known to those skilled in the art.
• inter prediction temporal prediction
• for each block can be coded a residual block corresponding to the original block minus a prediction.
• the coefficients of this block are quantized after a possible transformation, then coded by an entropic coder.
• Intra prediction and inter prediction require that some blocks that have been previously coded and decoded be available, so as to be used, both at the decoder and the encoder, to predict the current block.
• a schematic example of such a predictive coding is shown in FIG. 1, in which an image I N is divided into blocks, a current block MB of this image being subjected to a predictive coding with respect to a predetermined number of three blocks.
• MBr- ⁇ , MBr 2 and MBr 3 previously coded and decoded, as indicated by the gray arrows.
• the three aforementioned blocks specifically include the MBn block located immediately to the left of the current block MB ,, and the two blocks MBr 2 and MBr 3 respectively located immediately above and to the right above the current block MB ,.
• the entropic encoder encodes the information according to their order of arrival. Typically a line-by-line path of the blocks is made, of "raster-scan" type, as illustrated in FIG. 1 by the reference PRS, starting from the block at the top left of the image. For each block, the various information necessary for the representation of the block (block type, prediction mode, residual coefficients, ...) are sent sequentially to the entropy coder.
• CABAC Context Adaptive Binary Arithmetic Coder
• This entropic coder implements different concepts:
• arithmetic coding the coder, as initially described in J. Rissanen and G. G. Langdon, "Universal modeling and coding,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 12-23, Jan. 1981, uses, to encode a symbol, a probability of appearance of this symbol;
• Adaptation to the context it is a question of adapting the probability of appearance of the symbols to be coded. On the one hand, an on-the-fly learning is done. On the other hand, depending on the state of the previously coded information, a specific context is used for the coding.
• Each context corresponds to a probability of appearance of the symbol itself.
• a context corresponds to a type of coded symbol (the representation of a coefficient of a residue, coding mode signaling, etc.) according to a given configuration, or a neighborhood state (for example the number of modes). "Intra" selected in the neighborhood, ...);
• binarization a setting in the form of a sequence of bits of the symbols to be encoded is performed. Subsequently, these different bits are successively sent to the binary entropic coder.
• this entropic coder implements, for each context used, a system for learning on-the-fly probabilities with respect to symbols previously coded for the context in question. This learning is based on the coding order of these symbols. Typically, the image is scanned according to a "raster-scan" type order, described above.
• the learning of the probability p of appearance of this symbol is updated for a current block MB, as follows: where a is a predetermined value, for example 0.95 and p M is the probability of appearance of symbol calculated at the last appearance of this symbol.
• FIG. 1 A schematic example of such an entropy coding is shown in FIG. 1, in which a current block MB of the image 1 N is subjected to entropy coding.
• the probabilities of appearance of symbols used are those obtained after coding a previously coded and decoded block, which is the one immediately preceding the current block MB, in accordance with the line-by-line blocks of the type "raster scan" supra.
• Such learning based block dependency is shown in Figure 1 for some blocks only for the sake of clarity of the figure, by the arrows fine line.
• a disadvantage of such a type of entropy encoding lies in the fact that when encoding a symbol at the beginning of a line, the probabilities used correspond mainly to those observed for the symbols at the end of the previous line. , taking into account the "raster scan" path of the blocks.
• the probabilities of the symbols for example for a symbol linked to a movement information, the movement situated on the right part of an image may be different from that observed on the left part and therefore of even for the resulting local probabilities
• a lack of local matching of the probabilities can be observed, which may lead to a loss of efficiency during coding.
• proposals for changes to the order of the blocks have been made, in order to ensure better local consistency, but the coding and decoding remain sequential.
• the entropic coder CABAC has the particularity of assigning a non-integer number of bits to each symbol of a current alphabet to be encoded, which is advantageous for the probabilities of appearance of symbols. greater than 0.5. Specifically, the CABAC encoder waits to read several symbols, then assigns to this set of symbols read a predetermined number of bits that the encoder registered in the compressed stream to be transmitted to the decoder.
• Such an arrangement thus makes it possible to "mutualize" the bits over several symbols and to encode a symbol on a fractional number of bits, this number reflecting information that is closer to the information actually conveyed by a symbol.
• Other bits associated with the symbols read are not transmitted in the compressed stream but are kept waiting to be assigned to one or more new symbols read by the CABAC coder again to mutualize these other bits.
• the entropic coder proceeds at a given instant to "emptying" these non-transmitted bits. In other words, at said given instant, the encoder extracts the bits not yet transmitted and writes them in the compressed stream to the decoder.
• Such emptying occurs for example at the moment when the last symbol to be coded has been read, so as to ensure that the compressed stream contains all the bits that will allow the decoder to decode all the symbols of the alphabet.
• the time at which the drain is performed is determined by the performance and functionality of a particular encoder / decoder.
• the document which is available at http://research.microsoft.com/en-us/um/people/iinl/paper 2002 / msri jpeg.htm as of April 15, 201 1, describes a process still image encoding compliant with the JPEG2000 compression standard.
• the still image data undergo discrete wavelet transform followed by quantization, thereby obtaining quantized wavelet coefficients to which quantization indices are respectively associated.
• Quantization indices obtained are encoded using an entropy coder.
• the quantized coefficients are previously grouped in rectangular blocks called codeblocks, typically of size 64x64 or 32x32. Each codeblock is then independently encoded by entropy coding.
• the entropic coder when coding a current block code, does not use the appearance probabilities of symbols calculated during the coding of previous codeblocks.
• the entropic coder is therefore in a state initialized at the beginning of coding a code-block.
• Such a method has the advantage of decoding the data of a code-block without having to decode neighboring code blocks.
• client software may require server software to provide compressed codeblocks that the client only needs to decode an identified sub-part of an image.
• Such a method also has the advantage of authorizing the encoding and / or the decoding in parallel of the code blocks.
• the smaller the code-blocks the higher the level of parallelism.
• the value of the level of parallelism is equal to the number of code blocks to be encoded in the image.
• the compression performance obtained with this method is not optimal considering that such a coding does not take advantage of probabilities arising from the immediate environment of the current code-block.
• One of the aims of the invention is to overcome disadvantages of the state of the art mentioned above.
• an object of the present invention relates to a method of encoding at least one image comprising the steps of:
• the coding step comprising, for the first block of the image, a substep of initialization of state variables of the entropy coding module,
• the current block is the first block to code a subset considered, it is proceeded to the determination of symbol occurrence probabilities for the first current block, the probabilities being those which have been determined for a predetermined coded and decoded block of at least one other subset,
• the writing step mentioned above amounts to carrying out, as soon as the last block of a subset of blocks has been coded, an emptying of the digital information (bits) not yet transmitted, as explained above. in the description.
• Coupling the aforementioned write step and the entropy coding module reset step produces an encoded data stream containing different data sub-streams corresponding to at least one coded block subset, respectively. said stream being adapted to be decoded in parallel according to different levels of parallelism, regardless of the type of coding, sequential or parallel, which has been applied to the subsets of blocks.
• the level of parallelism to the decoding is variable and may even be different from the level of parallelism with the coding, since at the start of the decoding of a subset of blocks, the decoder is always in an initialized state.
• the state variables of the entropy coding module are the two terminals of an interval representative of the probability of appearance of a symbol among the symbols of the predetermined set of symbols.
• the state variables of the entropy coding module are the symbol strings contained in the translation table of a LZW entrapment coder (Lempel-Ziv-Welch) well known to those skilled in the art, and described at the following internet address as of June 21, 201 1: http: //en.wikipedia.orq/wiki/lempel%E2%80%93Ziv%E2%80%93Weich.
• the subsets of blocks are coded sequentially or in parallel.
• the at least two subsets of coded blocks are contained in the same sub-stream. of data.
• Such an arrangement makes it possible in particular to save on the signaling of the sub-data streams.
• a decoding unit to be able to decode a sub-stream as soon as possible, it is necessary to indicate in the compressed file where the sub-stream in question begins.
• only one flag is needed, which reduces the size of the compressed file.
• the sub-data streams delivered after coding respectively of each of the subsets of blocks are previously ordered. in the predetermined order before being transmitted for decoding.
• Such an arrangement makes it possible to adapt the coded data stream to a specific type of decoding without the need to decode and re-encode the image.
• the invention also relates to a device for coding at least one image comprising: means for cutting the image into a plurality of blocks able to contain symbols belonging to a predetermined set of symbols,
• the coding means for each of the subsets of blocks, the coding means comprising an entropy coding module able to associate digital information with the symbols of each block of a subset considered, the coding means comprising, for the first block of the image, means of initialization of state variables of the entropy coding module,
• Such a coding device is remarkable in that it comprises:
• writing means which, in the case where the current block is the last coded block of the subset considered, are activated to write, in the sub-stream representative of the subset considered, all the digital information which has have been associated with the symbols during the coding of the blocks of the subset considered,
• the initialization sub-means being further activated to reset the state variables of the entropy coding module.
• the invention also relates to a method for decoding a representative stream of at least one coded picture, comprising the steps of:
• decoding the subsets of blocks identified by means of an entropy decoding module by reading, in at least one of the identified substreams, digital information associated with the symbols of each block of the subset corresponding to the at least one an identified substream, the decoding step comprising, for the first block to be decoded from the image, a substep of initialization of state variables of the entropy decoding module.
• the current block is the first block to be decoded from a subset considered, it is proceeded to the determination of symbol occurrence probabilities for the first block of the subset considered, the probabilities being those which have been determined for a predetermined decoded block of at least one other subset,
• the current block is the last decoded block of the subset considered, it is proceeded to the implementation of the initialization sub-step.
• the subsets of blocks are decoded sequentially or in parallel.
• one of the identified data substreams is representative of the at least two subsets of blocks.
• the sub-data streams respectively corresponding to the subsets of coded blocks are previously ordered according to said order predetermined in said stream to be decoded.
• the invention further relates to a device for decoding a representative stream of at least one coded picture, comprising:
• the decoding means comprising an entropy decoding module capable of reading, in at least one of the identified subflows, digital information associated with the symbols of each block of the subset; corresponding to said at least one identified sub-stream, the decoding means comprising, for the first block to be decoded from the image, initialization sub-means of state variables of the entropy decoding module.
• Such a decoding device is remarkable in that it comprises means for determining probabilities of symbol appearance for a current block which, in the case where the current block is the first block to be decoded of a considered subset. , determine the symbol occurrence probabilities for the first block as those determined for a decoded predetermined block of at least one other subset,
• the initialization sub-means are activated to reset the state variables of the entropy decoding module.
• the invention also relates to a computer program comprising instructions for executing the steps of the above coding or decoding method, when the program is executed by a computer.
• Such a program can use any programming language, and be in the form of source code, object code, or intermediate code between source code and object code, such as in a partially compiled form, or in any another desirable form.
• Still another object of the invention is directed to a computer readable recording medium, and including computer program instructions as mentioned above.
• the recording medium may be any entity or device capable of storing the program.
• a medium may comprise storage means, such as a ROM, for example a CD ROM or a microelectronic circuit ROM, or a magnetic recording medium, for example a floppy disk or a Hard disk.
• a recording medium may be a transmissible medium such as an electrical or optical signal, which may be conveyed via an electrical or optical cable, by radio or by other means.
• the program according to the invention can be downloaded in particular on an Internet type network.
• such a recording medium may be an integrated circuit in which the program is incorporated, the circuit being adapted to execute the method in question or to be used in the execution of the latter.
• the coding device, the decoding method, the decoding device and the aforementioned computer programs have at least the same advantages as those conferred by the coding method according to the present invention. Brief description of the drawings
• FIG. 1 represents an image coding scheme of the prior art
• FIG. 2A represents the main steps of the coding method according to the invention
• FIG. 2B shows in detail the coding implemented in the coding method of FIG. 2A
• FIG. 3A represents a first embodiment of a coding device according to the invention
• FIG. 3B represents a coding unit of the coding device of FIG. 3A
• FIG. 3C represents a second embodiment of a coding device according to the invention.
• FIG. 4A represents an image coding / decoding scheme according to a first preferred embodiment
• FIG. 4B represents an image coding / decoding scheme according to a second preferred embodiment
• FIG. 5A represents the main steps of the decoding method according to the invention
• FIG. 5B shows in detail the decoding implemented in the decoding method of FIG. 5A
• FIG. 6A represents an embodiment of a decoding device according to the invention
• FIG. 6B represents a decoding unit of the decoding device of FIG. 6A
• FIG. 7A represents an image coding / decoding scheme implementing a sequential type coding and a parallel type decoding
• FIG. 7B represents an image coding / decoding scheme implementing a parallel type coding / decoding, with different levels of parallelism respectively.
• the coding method according to the invention is used to code a sequence of images according to a bit stream close to that obtained by a coding according to the H standard. .264 / MPEG-4 AVC.
• the coding method according to the invention is for example implemented in a software or hardware way by modifications of an encoder initially compliant with the H.264 / MPEG-4 AVC standard.
• the coding method according to the invention is represented in the form of an algorithm comprising steps C1 to C5, represented in FIG. 2A.
• the coding method according to the invention is implemented in a coding device CO, two embodiments of which are respectively represented in FIGS. 3A and 3C.
• the first coding step C1 is the division of an image IE of an image sequence to be encoded into a plurality of blocks or macroblocks MB, as represented in FIG. 4A or 4B.
• Said macroblocks are capable of containing one or more symbols, said symbols forming part of a predetermined set of symbols.
• said MB blocks have a square shape and are all the same size.
• the last blocks on the left and the last blocks on the bottom may not be square.
• the blocks may be for example of rectangular size and / or not aligned with each other.
• Each block or macroblock can also be itself divided into sub-blocks that are themselves subdividable.
• Such splitting is performed by a partitioning PCO module shown in FIG. 3A which uses, for example, a partitioning algorithm that is well known as such.
• the second coding step C2 is the grouping of the aforementioned blocks into a predetermined number P of consecutive subsets of blocks SE1, SE2,..., SEk,..., SEP intended to be coded sequentially. or in parallel.
• P 6
• subsets SE1, SE2, SE3, SE4 are shown for the sake of clarity of the figures.
• These four subsets of blocks are each represented in dashed line and consist respectively of the first four block lines of the image IE.
• Such a grouping is performed by a GRCO calculation module represented in FIG. 3A, using a well-known algorithm per se.
• the third coding step C3 consists in the coding of each of said subsets of blocks SE1 to SE6, the blocks of a subset considered being coded according to a predetermined PS travel order, which is for example of sequential type.
• the blocks of a subset SEk current (1 ⁇ k ⁇ P) are coded one after the other, from left to right, as indicated by the arrow PS.
• such an encoding is of the sequential type and is implemented by a single coding unit UC as represented in FIG. 3A.
• the coder CO comprises a buffer MT which is adapted to contain the probability of appearance of symbols such as progressively updated as and when encoding a current block.
• the coding unit UC comprises:
• An entropy coding module of said current block by using at least one symbol appearance probability calculated for said previously coded and decoded block, denoted ECM.
• the predictive coding module MCP is a software module that is able to carry out a predictive coding of the current block, according to conventional prediction techniques, such as for example in Intra and / or Inter mode.
• the entropic coding module MCE is CABAC type, but modified according to the present invention as will be described later in the description.
• the entropic coding module MCE could be a Huffman coder known as such.
• the unit UC encodes the blocks of the first line SE1, from left to right. When it reaches the last block of the first line SE1, it goes to the first block of the second line SE2. When it reaches the last block of the second line SE2, it goes to the first block of the third line SE3. When it reaches the last block of the third line SE3, it goes to the first block of the fourth line SE4, and so on until the last block of the image IE is coded.
• Such parallel coding is known to generate a substantial acceleration of the coding method.
• Each of the coding units UCk is identical to the coding unit UC shown in FIG. 3B.
• a coding unit UCk comprises a predictive coding module MCPk and an entropy coding module MCEk.
• the first unit UC1 codes, for example, the blocks of lines of odd rank
• the second unit UC2 codes, for example, the blocks of lines of even rank.
• the first unit UC1 codes the blocks of the first line SE1, from left to right.
• the last block of the first line SE1 it goes to the first block of the (2n + 1) th line, that is to say the third line SE3, etc.
• the second unit UC2 codes the blocks of the second line SE2, from left to right.
• it reaches the last block of the second line SE2 it goes to the first block of the (2n) th line, here the fourth line SE4, etc.
• the two aforementioned paths are repeated until the last block of the IE image is encoded.
• the fourth encoding step C4 is the production of L sub-flux F1, F2,..., Fm,..., FL (1 ⁇ m ⁇ L ⁇ P) of bits representing the blocks processed by the aforementioned UC encoding unit or each of the aforementioned UCk coding units, as well as a decoded version of the processed blocks of each subset SEk.
• the decoded processed blocks of a considered subset, denoted SED1, SED2, ..., SEDk, ..., SEDP are likely to be reused by the coding unit UC represented in FIG. 3A or each encoding units UCk shown in Figure 3C, according to a synchronization mechanism which will be detailed later in the description.
• the sub-stream production step L is implemented by a flow generating software module MGSF or MGSFk which is adapted to produce data streams, such as bits for example.
• the fifth encoding step C5 consists in constructing a global flux F from the aforementioned L subflows F1, F2,..., Fm,... FL.
• the substreams F1, F2,..., Fm,..., FL are simply juxtaposed, with additional information intended to indicate to the decoder the location of each sub-flow Fm in the stream. global F.
• the latter is then transmitted by a communication network (not shown) to a remote terminal.
• the coder CO before transmitting the stream F to the decoder DO, previously orders the L substreams F1, F2, ... , Fm, ..., FL according to a predetermined order which corresponds to the order in which the decoder DO is able to decode the sub-streams.
• the decoder is able to isolate the substreams F1, F2, ..., Fm, ..., FL within the overall flow F and assign them to one or more decoding units composing the decoder. It will be noted that such a decomposition of the subflows into a global stream is independent of the choice of the use of a single coding unit or of several coding units operating in parallel, and that it is possible with this approach to only have the encoder or only the decoder which includes units operating in parallel.
• Such a construction of the global flow F is implemented in a flow generating module CF, as shown in FIG. 3A and FIG. 3C.
• the encoding unit UC or UCk selects as the current block the first block to be encoded of a current line SEk shown in FIG. 4A or 4B, such as for example the first line SE1.
• the unit UC or UCk tests whether the current block is the first block (located at the top left) of the image IE which has been cut into blocks in the aforementioned step C1.
• the entropic coding module MCE or MCEk initializes its state variables.
• this interval is initialized with two terminals L and H, respectively lower and upper.
• the value of the lower bound L is set to 0, while the value of the upper bound is set to 1, which corresponds to the probability of occurrence of a first symbol among all the symbols of the predetermined set of symbols. .
• the initialized interval is further conventionally partitioned into a plurality of predetermined sub-intervals which are respectively representative of the appearance probabilities of the symbols of the predetermined set of symbols.
• a symbol string translation table is initialized, so that it contains all possible symbols once and only once.
• the current block is not the first block of the image IE, it is proceeded during a step C40 which will be described later in the following description, to determining the availability of the previously coded and decoded blocks needed.
• the first current block MB1 of the first line SE1 shown in FIG. 4A or 4B is coded.
• Such a step C34 comprises a plurality of sub-steps C341 to C348 which will be described below.
• the predictive coding of the current block MB1 is carried out by known intra and / or inter prediction techniques, during which the block MB1 is predicted with respect to least one block previously coded and decoded.
• the current block MB1 may also be subjected to prediction coding in inter mode, during which the current block is predicted with respect to a block resulting from a previously coded and decoded picture.
• prediction coding in inter mode, during which the current block is predicted with respect to a block resulting from a previously coded and decoded picture.
• Other types of prediction are of course conceivable.
• the optimal prediction is chosen according to a distortion flow criterion well known to those skilled in the art.
• Said aforementioned predictive coding step makes it possible to construct a predicted block MBp- ⁇ which is an approximation of the current block MB- ,.
• the information relating to this predictive coding will subsequently be written in the stream F transmitted to the decoder DO.
• Such information includes in particular the type of prediction (inter or intra), and if appropriate, the intra prediction mode, the type of partitioning of a block or macroblock if the latter has been subdivided, the image index of reference and displacement vector used in the inter prediction mode. This information is compressed by the CO encoder.
• the predicted block MBpi of the current block MBi is subtracted to produce a residue block MBr-i.
• the residue block ⁇ is transformed according to a conventional direct transformation operation such as, for example, a discrete cosine transformation of the DCT type, to produce a transformed block MBt-i.
• the transformed block MBti is quantized according to a conventional quantization operation, such as, for example, a scalar quantization.
• a block of quantized coefficients MBqi is then obtained.
• the entropic coding of the quantized coefficient block MBq- is carried out. In the preferred embodiment, it is a CABAC entropic coding.
• Such a step consists of:
• the coding used is an LZW coding
• digital information corresponding to the code of the symbol in the current translation table is associated with the symbol to be coded, and an update of the translation table is carried out, according to a method known per se.
• the block MBq is dequantized according to a conventional dequantization operation, which is the inverse operation of the quantization performed in step C344.
• a block of dequantized coefficients MBDq is then obtained.
• the inverse transformation of the dequantized coefficient block MBDqi is carried out which is the inverse operation of the direct transformation carried out in step C343 above.
• a decoded residue block MBDr- ⁇ is then obtained.
• the decoded block MBDi is constructed by adding or prediction block MBpi the decoded residue block MBDr-i. It should be noted that this last block is the same as the decoded block obtained at the end of the decoding process of the IE image which will be described later in the description.
• the decoded block MBDi is thus made available for use by the coding unit UCk or any other coding unit forming part of the predetermined number R of coding units.
• the entropic coding module MCE or MCEk as represented in FIG. 3B contains all the probabilities such as progressively being updated as the first block is coded. These probabilities correspond to the different elements of possible syntaxes and to the different coding contexts associated. Following the aforementioned coding step C34, it is tested, during a step C35, if the current block is the jth block of this same line, where j is a known predetermined value of the CO encoder which is at less than 1.
• the set of probabilities calculated for the jth block is stored in the buffer memory MT of the coder CO as represented in FIG. 3A or 3B and FIGS. FIGS. 4A and 4B, the size of said memory being adapted to store the number of calculated probabilities.
• step C37 the coding unit UC or UCk tests whether the current block of the line SEk that has just been encoded is the last block of the image IE. Such a step is also implemented if during step C35, the current block is not the jth block of the line SE1.
• the coding process is terminated.
• step C39 it is proceeded, in step C39, to the selection of the next block MB, to be encoded according to the order of travel represented by the arrow PS in Figure 4A or 4B.
• step C40 the availability of previously coded and decoded blocks which are necessary to code the current block MB, is determined.
• such a step consists in checking the availability of at least one block to the left of the current block to be coded MB ,.
• the blocks are encoded one after the other on a line SEk considered.
• the coded and decoded block on the left is always available (except for the first block of a line). In the example shown in FIG. 4A or 4B, it is the block located immediately to the left of the current block to be coded.
• said determining step further comprises checking whether a predetermined number N 'of blocks located on the previous line SEk-1, for example the two blocks located respectively above and to the right of the current block, are available for the coding of the current block, that is to say if they have already been coded and then decoded by the UC or UCk-1 coding unit.
• a clock CLK shown in FIG. 3C is adapted to synchronize the advanced block coding so as to guarantee the availability of the two blocks located respectively above and above right of the current block, without it being necessary to check the availability of these two blocks.
• step C41 shown in Figure 2B it is tested if the current block is the first block of the SEk line considered.
• Such a reading consists in replacing the probabilities of the CABAC encoder by those present in the buffer memory MT.
• this reading step is shown in FIG. 4A by the arrows represented in fine lines.
• Such a reading consists in replacing the probabilities of the CABAC encoder by those present in the buffer memory MT.
• this reading step is shown in FIG. 4B by the arrows represented in dashed fine lines.
• the current block is coded and then decoded by iteration of the steps C34 to C38 described above.
• the current block is not the first block of the line SEk considered, it is advantageously not proceeded to the reading of the probabilities from the previously coded and decoded block which is on the same line SEk, that is to say the encoded and decoded block located immediately to the left of the current block, in the example shown.
• the probabilities of appearance of symbols present in the CABAC coder at the time of the beginning of the coding of the current block are exactly those which are present after coding / decoding of the previous block on this same line.
• step C43 the current block is coded and then decoded by iteration of the steps C34 to C38 described above.
• step C44 step C39 of selecting the next block MB to be coded is again implemented.
• the coding device CO of Figure 3A or 3C performs a drain as mentioned above in the description.
• the coding unit UCk transmits to the corresponding sub-stream generation module MGSFk all the bits that have been associated with the symbol (s) read during the coding of each block of said line.
• SEk considered so that the MGSFk module writes, in the sub-data stream Fm containing a bitstream representative of the coded blocks of said line SEk considered, said totality of bits.
• Such emptying is symbolized in FIGS. 4A and 4B by a triangle at the end of each line SEk.
• the coding unit UC or UCk performs a step identical to the aforementioned step C33, that is to say, it initializes again the interval representative of the probability of appearance of a symbol contained in the predetermined set of symbols.
• a reset is shown in Figures 4A and 4B by a black dot at the beginning of each line SEk.
• the decoding method according to the invention is represented in the form of an algorithm comprising steps D1 to D4, represented in FIG. 5A.
• the decoding method according to the invention is implemented in a decoding device DO shown in FIG. 6A.
• the first decoding step D1 is the identification in said stream F of the L substreams F1, F2,..., Fm,..., FL respectively containing the P subsets SE1, SE2, ..., SEk, ..., SEP of previously coded blocks or macroblocks MB, as shown in FIG. 4A or 4B.
• each sub-flow Fm in the stream F is associated with an indicator intended to allow the decoder DO to determine the location of each sub-stream Fm in the stream F.
• the coder CO orders the substreams F1, F2, ..., Fm, ..., FL in the stream F, in the order expected by the decoder DO, which avoids the insertion in the stream F subflow indicators.
• Such an arrangement thus makes it possible to reduce the flow rate cost of the data stream F.
• the said MB blocks have a square shape and all have the same size.
• the last blocks on the left and the last blocks on the bottom may not be square.
• the blocks may be for example of rectangular size and / or not aligned with each other.
• Each block or macroblock can also be itself divided into sub-blocks that are themselves subdividable.
• Such identification is performed by an EXDO flow extraction module as shown in FIG. 6A.
• the predetermined number P is equal to 6 but only four subsets SE1, SE2, SE3, SE4 are shown in dashed line, for the sake of clarity of the figures.
• the second decoding step D2 is the decoding of each of said subsets of blocks SE1, SE2, SE3 and SE4, the blocks of a subset considered being coded according to a sequential scanning order PS predetermined.
• the blocks of a current subset SEk (1 ⁇ k ⁇ P) are decoded one after the other, from left to right, as indicated by the arrow PS. .
• the subsets of decoded blocks SED1, SED2, SED3,..., SEDk,..., SEDP are obtained.
• Such a decoding can be of sequential type and, consequently, be carried out using a single decoding unit.
• the decoder DO comprises a buffer MT which is adapted to contain the probabilities of appearance of symbols such as progressively updated as the decoding of a current block.
• each of the UDk decoding units comprises:
• An entropy decoding module of said current block by learning at least one computed symbol occurrence probability for at least one previously decoded block, denoted MDEk,
• a decoding module predictive of a current block with respect to said previously decoded block denoted MDPk.
• the predictive decoding module SUDPk is able to perform a predictive decoding of the current block, according to conventional prediction techniques, such as for example in Intra and / or Inter mode.
• the entropy decoding module MDEk is CABAC type, but modified according to the present invention as will be described later in the description.
• the entropy decoding module MDEk could be a Huffman decoder known as such.
• the first unit UD1 decodes the blocks of the first line SE1, from left to right. When it reaches the last block of the first line SE1, it passes to the first block of the (n + 1) th line, by the 5 th row, etc.
• the second unit UC2 decodes the blocks of the second line SE2, from left to right. When it reaches the last block of the second line SE2, it passes to the first block of the (n + 2) th line, by the 6 th row, etc. This path is repeated until the unit UD4, which decodes the blocks of the fourth line SE4, from left to right. When it reaches the last block of the first line, it passes the first block of the (n + 4) th line, here the 8 th line, and so on until the last block of the last substream identified is decoded.
• each decoding unit might not handle nested lines, as explained above, but columns nested. It is also possible to browse the rows or columns in one direction or the other.
• the third decoding step D3 is the reconstruction of a decoded picture ID from each decoded subset SED1, SED2,..., SEDk,..., SEDP obtained at the step decoding D2. More precisely, the decoded blocks of each decoded subset SED1, SED2,..., SEDk,..., SEDP are transmitted to an image reconstruction URI unit as represented in FIG. 6A. During this step D3, the URI unit writes the decoded blocks in a decoded image as these blocks become available.
• a fully decoded ID image is provided by the URI unit shown in FIG. 6A.
• the decoding unit UDk selects as the current block the first block to be decoded from the current line SEk shown in FIG. 4A or 4B.
• the decoding unit UDk tests whether the current block is the first block of the decoded picture, in this case the first block of the substream F1.
• the entropy decoding module MDE or MDEk initializes its state variables. According to the example shown, it is an initialization of an interval representative of the probability of appearance of a symbol contained in the predetermined set of symbols.
• step D23 is identical to the aforementioned coding step C33, it will not be described further. If following the aforementioned step D22, the current block is not the first block of the decoded picture ID, it is proceeded, during a step D30 which will be described later in the following description, determining the availability of the previously decoded blocks needed.
• step D24 the first current block MB1 of the first line SE1 shown in FIG. 4A or 4B is decoded.
• Such a step D24 comprises a plurality of substeps D241 to D246 which will be described below.
• entropic decoding of the syntax elements related to the current block is performed.
• Such a step consists mainly of:
• the decoding used is an LZW decoding
• digital information corresponding to the code of the symbol in the current translation table is read, the symbol is reconstructed from the code read and an update of the translation table. is performed, according to a method known per se.
• the syntax elements related to the current block are decoded by the entrapment decoding module MDE1 CABAC as represented in FIG. 6B.
• the latter decodes the sub-stream of F1 bits of the compressed file to produce the syntax elements, and, at the same time, updates its probabilities so that, at the moment when the latter decodes a symbol, the probabilities of appearance of this symbol are identical to those obtained during the coding of the same symbol during the aforementioned entropy coding step C345.
• predictive decoding of the current block MB1 is carried out by known intra and / or inter prediction techniques, during which the block MB1 is predicted with respect to at least one previously decoded block.
• intra prediction modes as proposed in the H.264 standard are possible.
• the predictive decoding is performed using the syntax elements decoded in the previous step and including in particular the type of prediction (inter or intra), and if appropriate, the intra prediction mode, the type of partitioning of a block or macroblock if the latter has been subdivided, the reference image index and the displacement vector used in the inter prediction mode.
• Said aforementioned predictive decoding step makes it possible to construct a predicted MBp block! .
• a quantized residual block MBqi is constructed using previously decoded syntax elements.
• dequantization of the quantized residue block MBq is carried out according to a conventional dequantization operation which is the inverse operation of the quantization performed in the aforementioned step C344, to produce a dequantized block decoded MBDt-i.
• the inverse transformation of the dequantized block MBDti is carried out which is the reverse operation of the direct transformation carried out in step C343 above.
• a decoded residue block MBDr- ⁇ is then obtained.
• the decoded block MBDi is constructed by adding or predicting MBpi the decoded residue block MBDr-i.
• the decoded block MBD is thus made available for use by the decoding unit UD1 or any other decoding unit belonging to the predetermined number N of decoding units.
• the entropy decoding module MDE1 as represented in FIG. 6B contains all the probabilities such as progressively being updated as the first block is decoded. These probabilities correspond to the different possible syntax elements and the different decoding contexts associated with them.
• the entropy decoding module MDE1 as represented in FIG. 6B contains all the probabilities such as progressively being updated as the first block is decoded. These probabilities correspond to the different possible syntax elements and the different decoding contexts associated with them.
• it is tested, during a step D25, if the current block is the jth block of this same line, where j is a predetermined known value of the decoder DO which is at less than 1.
• the set of probabilities calculated for the jth block is stored in the buffer memory MT of the decoder DO as represented in FIG. 6A and in FIG. 4A or 4B, FIG. size of said memory being adapted to store the calculated number of probabilities.
• the unit UDk tests whether the current block that has just been decoded is the last block of the last sub-stream.
• step D29 is used to select the next block MB to be decoded according to the order of travel represented by the arrow PS in FIG. 4A or 4B.
• step D25 If during the aforementioned step D25, the current block is not the jth block of the line SEDk considered, it is proceeded to step D27 above.
• step D30 which follows the aforementioned step D29, the availability of previously decoded blocks which are necessary for decoding the current block MB, is determined. Given that it is a parallel decoding of the blocks by different UDk decoding units, it is possible that these blocks have not been decoded by the decoding unit assigned to the decoding of these blocks. and so they are not yet available.
• Said determination step consists in checking whether a predetermined number N 'of blocks located on the previous line SEk-1, for example the two blocks situated respectively above and to the right of the current block, are available for the decoding of the current block, that is to say if they have already been decoded by decoding unit UDk-1 assigned to the decoding of the latter.
• Said determination step also consists in checking the availability of at least one block to the left of the current block to be decoded MB ,.
• the blocks are decoded one after the other on a line SEk considered.
• the block Decoded left is always available (except the first block of a line).
• it is the block located immediately to the left of the current block to be decoded. For this purpose, only the availability of the two blocks located respectively above and above the right of the current block is tested.
• a clock CLK shown in FIG. 6A is adapted to synchronize the advance of the decoding of the blocks so as to guarantee the availability of the two blocks. located respectively above and above right of the current block, without it being necessary to check the availability of these two blocks.
• step D31 it is tested if the current block is the first block of the SEk line considered.
• Such a reading consists in replacing the probabilities of the CABAC decoder by those present in the buffer memory MT.
• this reading step is shown in FIG. 4A by the arrows represented in fine lines.
• Such a reading consists in replacing the probabilities of the CABAC decoder by those present in the buffer memory MT.
• this reading step is shown in Figure 4B by the arrows shown in dashed fine lines.
• step D32 the current block is decoded by iteration of the steps D24 to D28 described above.
• the current block is not the first block of the line SEk considered, it is advantageously not proceeded to the reading of the probabilities from the previously decoded block which is on the same line SEk, that is to say the decoded block located immediately to the left of the current block, in the example shown.
• the probabilities of appearance of symbols present in the CABAC decoder at the moment of the beginning of the decoding of the current block are exactly the ones that are present after decoding the previous block on that same line.
• step D33 the current block is decoded by iterating the steps D24 to D28 described above.
• step D34 step D29 for selecting the next block MB to be coded is again implemented.
• the decoding unit UDk performs a step identical to the aforementioned step D23, that is to say initializes again the an interval representative of the probability of appearance of a symbol contained in the predetermined set of symbols.
• a reset is shown in Figures 4A and 4B by a black dot at the beginning of each line SEk.
• the decoder DO is in a state initialized at each beginning of the line, which allows a great flexibility from the point of view of the choice of the level of decoding parallelism and an optimization of the processing time during decoding.
• the coder CO comprises a single coding unit UC, as shown in FIG. 3A, while the decoder DO comprises six decoding units.
• the encoding unit UC sequentially encodes the lines SE1, SE2, SE3, SE4, SE5 and SE6.
• the lines SE1 to SE4 are fully coded, the line SE5 is being coded and the line SE6 has not yet been coded.
• the coding unit UC is adapted to deliver a stream F which contains the substreams F1, F2, F3, F4 ordered one after the other, in the coding order of the lines SE1, SE2, SE3 and SE4.
• the substreams F1, F2, F3 and F4 are symbolized with the same hatching as those which respectively symbolize the lines SE1, SE2, SE3, SE4 encoded.
• the decoder DO whenever it reads a sub-stream to decode it, is in an initialized state and can therefore optimally decode in parallel the four sub-streams F1, F2, F3, F4 with decoding units UD1, UD2, UD3 and UD4 which can by example be installed on four different platforms.
• the coder CO comprises two coding units UC1 and UC2, as shown in FIG. 3C, while the decoder DO comprises six decoding units.
• the encoding unit UC1 sequentially codes the odd-rank lines SE1, SE3 and SE5, while the encoding unit UC2 sequentially encodes the even-numbered lines SE2, SE4 and SE6.
• lines SE1, SE3 and SE5 have a white background
• lines SE2, SE4 and SE6 have a dotted background.
• the lines SE1 to SE4 are fully encoded, the SE5 line is being coded and the SE6 line has not yet been coded.
• the coding unit UC1 is adapted to deliver a sub-flux F 2n + i broken down into two parts F1 and F3 obtained following the coding respectively of the lines SE1 and SE3
• the coding unit UC2 is adapted to deliver a sub-flux F 2n decomposed into two parts F2 and F4 obtained following the coding respectively lines SE2 and SE4.
• the encoder CO is therefore adapted to transmit to the decoder DO a stream F which contains the juxtaposition of the two substreams F 2n + 1 and F 2n and therefore a scheduling of the substreams F1, F3, F2, F4 which differs from that shown in FIG. 7A.
• the substreams F1, F2, F3 and F4 are symbolized with the same hatching as those which respectively symbolize the lines SE1, SE2, SE3, SE4 coded, the substreams F1 and F3 having a white background (coding lines of odd rank) and the substreams F2 and F4 having a dotted background (coding of lines of even rank).
• such a coding / decoding scheme also has the advantage of being able to have a decoder whose level of decoding parallelism is completely independent of the level of parallelism of the coding. which makes it possible to further optimize the operation of an encoder / decoder.

Landscapes

• Engineering & Computer Science (AREA)
• Signal Processing (AREA)
• Multimedia (AREA)
• Computing Systems (AREA)
• Theoretical Computer Science (AREA)
• Discrete Mathematics (AREA)
• Physics & Mathematics (AREA)
• General Physics & Mathematics (AREA)
• Computer Networks & Wireless Communication (AREA)
• Compression Or Coding Systems Of Tv Signals (AREA)
• Compression Of Band Width Or Redundancy In Fax (AREA)
• Compression, Expansion, Code Conversion, And Decoders (AREA)
• Image Processing (AREA)

Priority Applications (1)

Applications Claiming Priority (2)

Related Child Applications (1)

Publications (1)

Family

ID=46508090

Family Applications (2)

Family Applications After (1)

Country Status (10)

Families Citing this family (19)

Family Cites Families (100)

• 2011
  • 2011-06-24 FR FR1155606A patent/FR2977111A1/fr not_active Withdrawn
• 2012
  • 2012-06-20 US US14/128,949 patent/US9319692B2/en active Active
  • 2012-06-20 CN CN201710340662.7A patent/CN107071446B/zh active Active
  • 2012-06-20 EP EP12734974.4A patent/EP2724536A1/fr not_active Ceased
  • 2012-06-20 EP EP20155879.8A patent/EP3700207A1/fr active Pending
  • 2012-06-20 CN CN201280031335.9A patent/CN103959787B/zh active Active
  • 2012-06-20 KR KR1020147002088A patent/KR101708982B1/ko active IP Right Grant
  • 2012-06-20 KR KR1020167018767A patent/KR20160086986A/ko not_active Application Discontinuation
  • 2012-06-20 CN CN201710340661.2A patent/CN107094253B/zh active Active
  • 2012-06-20 KR KR1020197021045A patent/KR102095329B1/ko active IP Right Grant
  • 2012-06-20 KR KR1020167018776A patent/KR101851477B1/ko active IP Right Grant
  • 2012-06-20 KR KR1020207034016A patent/KR102240333B1/ko active IP Right Grant
  • 2012-06-20 JP JP2014516422A patent/JP2014520470A/ja active Pending
  • 2012-06-20 KR KR1020187028663A patent/KR102003549B1/ko active Application Filing
  • 2012-06-20 KR KR1020237015428A patent/KR20230067712A/ko not_active Application Discontinuation
  • 2012-06-20 KR KR1020217010198A patent/KR102344519B1/ko active IP Right Grant
  • 2012-06-20 WO PCT/FR2012/051391 patent/WO2012175870A1/fr active Application Filing
  • 2012-06-20 KR KR1020227029117A patent/KR20220122797A/ko not_active Application Discontinuation
  • 2012-06-20 KR KR1020177037608A patent/KR101907043B1/ko active IP Right Grant
  • 2012-06-20 CN CN201710340665.0A patent/CN107094256B/zh active Active
  • 2012-06-20 KR KR1020167018759A patent/KR20160086984A/ko not_active Application Discontinuation
  • 2012-06-20 CN CN201710338460.9A patent/CN107094252B/zh active Active
  • 2012-06-20 RU RU2017103486A patent/RU2646345C1/ru active
  • 2012-06-20 CN CN201510562762.5A patent/CN105120277A/zh active Pending
  • 2012-06-20 CN CN201710340664.6A patent/CN107094255B/zh active Active
  • 2012-06-20 KR KR1020157008800A patent/KR20150046352A/ko not_active Application Discontinuation
  • 2012-06-20 KR KR1020207008566A patent/KR102185377B1/ko active IP Right Grant
  • 2012-06-20 CN CN201710340663.1A patent/CN107094254B/zh active Active
  • 2012-06-20 RU RU2014102226A patent/RU2613740C2/ru active
  • 2012-06-20 KR KR1020247021793A patent/KR20240110081A/ko active Search and Examination
  • 2012-06-20 BR BR112013032956-4A patent/BR112013032956B1/pt active IP Right Grant
  • 2012-06-20 KR KR1020217042346A patent/KR102437249B1/ko active IP Right Grant
• 2014
  • 2014-09-22 US US14/492,750 patent/US9380308B2/en active Active
• 2015
  • 2015-03-19 US US14/662,395 patent/US9319693B2/en active Active
  • 2015-03-19 US US14/662,463 patent/US9319694B2/en active Active
• 2016
  • 2016-01-28 US US15/008,785 patent/US9848196B2/en active Active
  • 2016-01-28 US US15/008,614 patent/US9661335B2/en active Active
  • 2016-04-07 HK HK16103993.3A patent/HK1216058A1/zh unknown
  • 2016-04-18 US US15/132,062 patent/US9654783B2/en active Active
  • 2016-11-24 JP JP2016228013A patent/JP2017073806A/ja active Pending
• 2017
  • 2017-04-13 US US15/486,660 patent/US10033999B2/en active Active
• 2018
  • 2018-02-02 RU RU2018103979A patent/RU2727171C2/ru active
  • 2018-02-23 HK HK18102652.5A patent/HK1244375A1/zh unknown
  • 2018-02-23 HK HK18102655.2A patent/HK1244377A1/zh unknown
  • 2018-02-23 HK HK18102653.4A patent/HK1244376A1/zh unknown
  • 2018-02-23 HK HK18102647.3A patent/HK1244373A1/zh unknown
  • 2018-02-23 HK HK18102650.7A patent/HK1244374A1/zh unknown
  • 2018-06-19 US US16/012,658 patent/US10362311B2/en active Active
  • 2018-08-02 JP JP2018145539A patent/JP6875333B2/ja active Active
• 2019
  • 2019-06-07 US US16/435,317 patent/US10694186B2/en active Active
• 2020
  • 2020-06-22 US US16/907,561 patent/US20200322609A1/en not_active Abandoned
  • 2020-06-26 RU RU2020121306A patent/RU2739497C1/ru active
  • 2020-11-24 JP JP2020194275A patent/JP7280233B2/ja active Active
  • 2020-12-18 RU RU2020141931A patent/RU2757543C1/ru active
• 2023
  • 2023-05-12 JP JP2023079203A patent/JP2023100970A/ja active Pending
  • 2023-07-05 US US18/218,521 patent/US20230353740A1/en active Pending

Non-Patent Citations (2)

Also Published As

Similar Documents

Legal Events