97 results about "Arithmetic encoder" patented technology

An entropy encoding / decoding scheme uses an arithmetic encoder / decoder together with a context modeler for performing a context-based adaptive binary arithmetic coding, which is especially suited for video compression applications. The context modeler includes an initializer for initializing the context modeler by determining and providing initialization probability information to the arithmetic encoder, the initialization probability information to be used by the arithmetic encoder for processing a start symbol of a symbol sequence. The initializer is operative to determine the initialization probability information based on an estimation of the symbol statistics relating to the start symbol such that an initialization probability distribution is different from an equi-probable distribution for all symbols of the symbol set. By means of the initialization, the context-based adaptive binary arithmetic coding / decoding scheme is optimally adjusted before processing a start symbol of the symbol sequence so that no bit rate compression losses because of a delayed context-based adaptation are introduced.

An entropy encoding / decoding scheme uses an arithmetic encoder / decoder together with a context modeler for performing a context-based adaptive binary arithmetic coding, which is especially suited for video compression applications. The context modeler includes an initializer for initializing the context modeler by determining and providing initialization probability information to the arithmetic encoder, the initialization probability information to be used by the arithmetic encoder for processing a start symbol of a symbol sequence. The initializer is operative to determine the initialization probability information based on an estimation of the symbol statistics relating to the start symbol such that an initialization probability distribution is different from an equi-probable distribution for all symbols of the symbol set. By means of the initialization, the context-based adaptive binary arithmetic coding / decoding scheme is optimally adjusted before processing a start symbol of the symbol sequence so that no bit rate compression losses because of a delayed context-based adaptation are introduced.

Methods, structures and systems for encoding and decoding isosurface data. An encoder process takes volume data and an isolevel as input and produces compressed isosurface data as output. The compressed isosurface data produced by an encoder process is composed of an occupancy image record, an optional intersection points record, and an optional normal vectors record. An occupancy image is compressed with a context-based arithmetic encoder. Compressed isosurface data can be stored in a data storage device or transmitted through a communication medium to a remote computer system, where the decoder process is executed. The decoder processes take compressed surface data as input and produce surface data as output. The decoder processes first reconstructs the occupancy image by decoding the occupancy image record. An in-core isosurface decoder process produces a polygon mesh as a surface representation. An out-of-core isosurface decoder process produces a set of oriented points as a surface representation.

Methods, structures and systems for encoding and decoding isosurface data. An encoder process takes volume data and an isolevel as input and produces compressed isosurface data as output. The compressed isosurface data produced by an encoder process is composed of an occupancy image record, an optional intersection points record, and an optional normal vectors record. An occupancy image is compressed with a context-based arithmetic encoder. Compressed isosurface data can be stored in a data storage device or transmitted through a communication medium to a remote computer system, where the decoder process is executed. The decoder processes take compressed surface data as input and produce surface data as output. The decoder processes first reconstructs the occupancy image by decoding the occupancy image record. An in-core isosurface decoder process produces a polygon mesh as a surface representation. An out-of-core isosurface decoder process produces a set of oriented points as a surface representation.

A communication system (100) includes devices (102, 104, 200) for transmitting and receiving digital audio. The devices use audio encoders (210, 804) and decoders (222, 916) such as ACELP or DCT / IDCT to compress and decompress audio and use arithmetic encoders (212) and decoders (220) to encode and decode the compressed audio on-the-fly (without a codebook of pre-stored codes).

An image coding apparatus includes an image feature extraction means for generating character data which includes character codes corresponding to character images included in a document image and auxiliary information indicating the sizes and positions of the respective character images in the document image based on image data indicating the document image. The image coding apparatus generates a predictive document image for the document image based on the character data, and subjects the document image data to arithmetic coding in which the probability model is changed with reference to predictive document image data. In the image coding apparatus, the probabilities of white pixels and black pixels indicated by the probability model are very close to those in the character image, whereby the coding efficiency for the character image data in the arithmetic encoder is improved.

An encoding method for reducing motion video data sizes using a multitude of variable-sized data blocks that are derived from spatial translation vectors and the motion field of an image. Using variable-block sizes to characterize the groups of picture elements (pixels) in an image frame allows for the inter-mixing of coarse (for static areas) and fine (for areas of complex motion) resolution data descriptions in the same descriptive data block.A comparison of motion event areas is made between successive video frames, and a motion displacement vector is calculated for each pixel location in the frame. A data tree is constructed from these pixel motion vectors and is pruned to eliminate static areas. The remaining leaves of the pruned tree are encoded differentially and applied to a lossless arithmetic encoder to provide a significantly reduced data block that still retains the highest resolution of the image.

Disclosed is a system and method for joint source-channel encoding, symbol decoding and error correction, preferably utilizing an arithmetic encoder with operational error detection space; and a combination sequential, and arithmetic, encoded symbol decoder structure.

The invention discloses a high-performance adaptive binary arithmetic encoder which mainly solves the problems of low encoding speed and complicated structure of the existing binary arithmetic encoder. The encoder comprises a probability model storing module, a probability model updating module, an encoding state updating module, a normalization module and register groups, wherein a first register group is inserted between the probability model storing module and the probability model updating module, and a second register group is inserted between the encoding state updating module and the normalization module so as to form a three-level flow structure to improve the encoding speed by sufficiently using the parallelism of hardware; a caching register unit is adopted in the probability model storing module so that the read / write conflict of a probability model memory is effectively avoided; and a prefix zero detection unit is adopted in the normalization module so that the structure of the normalization module is simple and easy to implement with hardware. The high-performance adaptive binary arithmetic encoder disclosed by the invention has the characteristics of high encoding speed and simple structure, and can be applied to the real-time encoding of high-definition videos.

An encoder is configured to compress point cloud geometry information using an octree geometric compression technique that utilizes a binary arithmetic encoder, a look-ahead table, a cache, and a context selection process, wherein encoding contexts are selected based, at least in part, on neighborhood configurations. In a similar manner, a decoder is configured to decode compressed point cloud geometry information utilizing a binary arithmetic encoder, a look-ahead table, a cache, and a context selection process.

Methods, structures and systems for encoding and decoding isosurface data. An encoder process takes volume data and an isolevel as input and produces compressed isosurface data as output. The compressed isosurface data produced by an encoder process is composed of an occupancy image record, an optional intersection points record, and an optional normal vectors record. An occupancy image is compressed with a context-based arithmetic encoder. Compressed isosurface data can be stored in a data storage device or transmitted through a communication medium to a remote computer system, where the decoder process is executed. The decoder processes take compressed surface data as input and produce surface data as output. The decoder processes first reconstructs the occupancy image by decoding the occupancy image record. An in-core isosurface decoder process produces a polygon mesh as a surface representation. An out-of-core isosurface decoder process produces a set of oriented points as a surface representation.

A coding apparatus that codes video data using an arithmetic coding scheme such as the AVC standard includes an orthogonal transformation unit, a quantizer, an arithmetic coder, and a controller. The arithmetic coder includes a binarization unit, a binary arithmetic coder, and a code length predictor. The code length predictor outputs a predicted number of bits by evaluating a predictive function using, as the argument of the function, the bin size of the binary symbols generated from input data during coding. The controller controls the coding bit rate by changing the quantization scale of the quantizer on the basis of the predicted number of bits. The predictive function is defined such that the predicted number of bits increases as the bin size increases, and furthermore such that the polynomial degree of the function changes when the bin size exceeds a predefined threshold value.

The invention discloses a design method of an arithmetic coder, and a realization device, which comprise a front-buffer design, algorithm structure joint optimization, a muti-bin processing technology and a hybrid context storage mechanism, wherein the front-buffer design is used for solving the problems that the number of binary sequences (bin) generated by a macroblock after binary conversion can fluctuate within a very wide range, but the number of the binary sequences (bin) processed by a binary arithmetic coding module (BAC) in unit time is limited; the algorithm structure joint optimization mainly uses a time borrowing technology to place low processing after range processing; the muti-bin processing technology utilizes MPS (microprocessor system) computation more easily compared with an LPS (lean process solution), so that people can process multiple MPSs in a clock period; and the hybrid context storage mechanism is a storage method invented for a special application of a 2bins / cycle throughput rate, can store a large number of context models, and can conduct quick memory on the models. The arithmetic coder and the coding method are applicable to coding of a multi-stage pipeline structure, in particular to real-time coding of high-definition resolution.

An encoder / decoder architecture including an arithmetic encoder that encodes the MSB portions of a Factorial Pulse Coder output, and that encodes an output of a first-level source encoder, e.g., MDCT. Sub-parts (e.g., frequency bands) of portions (e.g., frames) of the signal are sorted in increasing order based on a measure related to signal energy (e.g., signal energy itself). In a system that overlays Arithmetic Encoding on Factorial Pulse coding, the result is bits re-allocated to bands with higher signal energy content, yielding higher signal quality and higher bit utilization efficiency.

A method for realizing arithmetic-coding / decoding (ACD) includes mapping region carrying out ACD on original number domain onto logarithm domain to realize said ACD directly through addition and subtraction when binary coding / decoding course is carried out in arithmetic coder / decoder, using approximate calculation to realize data conversion between two said domains in logarithm domain ACD course, making update as per probability as required after one symbol being coded / decoded and realizing said update by addition and subtraction in logarithm domain.

The invention provides an encoding interval update and normalization module, an encoding lower limit update and normalization module, a code stream extraction module, a binary arithmetic encoder and an encoding method thereof. The binary arithmetic encoder comprises an encoding interval update and normalization module, an encoding lower limit update and normalization module and a code stream extraction module, wherein the encoding interval update and normalization module, the encoding lower limit update and normalization module and the code stream extraction module form a parallel three-level stream line structure, and the code stream extraction module can process one or more encoding symbols within one clock cycle. Complete parallel is realized, and the problem of poor parallel in the prior art is solved; in addition, the common use of different encoding modes is realized by a selector to improve the circuit reusability and reduce the hardware cost; and moreover, the code stream extraction operation of the code stream extraction method is simple, and no additional FIFO resource is needed.

The invention discloses a binary arithmetic encoder for inputting and outputting parallel-decoded singlebytes or multibytes. In an algorithm, MPS and LPS of each input symbol are provided with a logarithmic probability index respectively in accordance with the probabilities of the input symbol, and the logarithmic probability indexes are utilized to express interval sizes in the logarithmic encoding. In the algorithm, table look-up is utilized to realize mapping for the logarithmic probability indexes and the interval sizes, and shift operation is utilized to reduce the size of a static table. The algorithm can realize interval subdivision by adding the logarithmic probability indexes.

The invention discloses a method for effectively encoding and decoding a JPEG2000 image based on a vision potential attention target area. The method comprises the following steps of: before the image is encoded, dividing the image into a plurality of Tile blocks based on the potential target area of different attentions and pre-assigning corresponding target code rates according to vision potential attention target area extraction technology; and then carrying out code stream organization and packaging to realize image compression through quantization, adaptive wavelet transformation, and a bit plane encoding and arithmetic encoder code word reset mechanism on the basis of potential attention target area quality layer code rate control. When network band width is insufficient, the image reconstruction quality of a more-concerned target area can be exchanged at the expense of part of code rates of the target area with smaller potential attention; simultaneously, retractable high-efficiency image encoding and decoding technology is combined with a qualified content based on the potential attention target area.

A method stores, in a first memory location in a context weight update engine in an arithmetic encoder, a context weight value. The method also stores, in a second memory location in the context weight update engine in the arithmetic encoder, a context weight adjustment value. Further, the method reads, in a first clock cycle, the context weight value and a first binarization value from the first memory location. In addition, the method writes, in a second clock cycle, the context weight adjustment value and a second binarization value into the first memory location. The second binarization value is distinct from the first binarization value.

An adaptive entropy coder is coupled with a localized conditioning context to provide efficient compression of images with localized high frequency variations. In one implementation, an arithmetic coder can be used as the adaptive entropy coder. The localized conditioning context includes a basic context region with multiple context pixels that are adjacent the current pixel, each of the context pixels having an image tone. A state is determined for the basic context region based upon a pattern of unique image tones among the context pixels therein. An extended context region that includes the basic context region is used to identify a non-local trend within the context pixels and a corresponding state. A current pixel may be arithmetically encoded according to a previously encoded pixel having the same tone or as a not-in-context element. In one implementation, a not-in-context element may be represented by a tone in a color cache that is arranged as an ordered list of most recent not-in-context values.

An encoder is configured to compress point cloud geometry information using an octree geometric compression technique that utilizes a binary arithmetic encoder, a look-ahead table, a cache, and a context selection process, wherein encoding contexts are selected based, at least in part, on neighborhood configurations. In a similar manner, a decoder is configured to decode compressed point cloud geometry information utilizing a binary arithmetic encoder, a look-ahead table, a cache, and a context selection process.

The invention aims at providing a safe binary arithmetic encoding method for three-dimensional Lorenz mapping control based on weighted processing. The method is composed of an initial value key (1), a weight key (2), a Lorenz mapping (3), an arithmetic encoder (4), a channel (5) and an arithmetic decoder (6). An encryption vector is generated by a three-dimensional Lorenz chaotic system, the idea of weight is imported to increase the operation space of the key, and the unpredictability of the encryption vector is stronger than that of a chaotic system with a lower dimension. Meanwhile, by adopting the safe binary arithmetic encoding method provided by the invention, data compression and encryption are integrated without losing the encoding efficiency, thereby simplifying the structure of a communication system.

A method and apparatus of entropy coding for a video encoder or decoder using multiple-table based Context-Based Adaptive Binary Arithmetic Coder (CABAC) are disclosed. In one embodiment, a current bin of a binary data of a current coding symbol is encoded or decoded according to a probability of a binary value of the current bin and the probability of the binary value is updated according to the binary value of the current bin for a next bin by using multiple-parameter probability models. Each multiple-parameter probability model is updated using at least one lookup table with the individual set of probability state as a table index to access contents of said at least one lookup table. In another embodiment, the range update is calculated for a range interval based on middle value of the range interval.

The invention discloses a JPEG2000 EBCOT (Embedded Block Coding with Optimized Truncation) encoder based on an Avalon bus, relating to the JPEG2000 EBCOT encoder, and solving the problems of low speed, poor flexibility and complex process of the JPEG2000 EBCOT encoder in the prior art. The EBCOT encoder comprises an Avalon bus interface and an EBCOTTier-1 encoder, wherein the input ends of a clock signal, a reset signal, a start signal, an encode-finishing signal, an encode block write signal, an encode block data signal, an encode block address signal, an output byte memory address signal and an output byte memory data signal of the Avalon bus interface are connected with an encode control module which is connected with msb bitplane encoders, wherein msb is a numerical value of a highest bitplane detection module detecting the highest bitplane of the encode control module; the bitplane encoders are connected with an arithmetic encoder; and the arithmetic encoder is connected with an output byte memory RAM (Random Access Memory). The encoder can be better applied to the whole JPEG2000 encoders.

The invention discloses a method for designing structure and key circuit of synchronous pipelining arithmetic coder suitable to hardware of image compression and video processing. For instance, JPEG2000 chip is capable of coding N pieces of input within N+3 timing cycle based on context-sensitive self-adapting arithmetic coder. Thus, following change is taken: flow of arithmetic coder in JPEG2000 protocol is converted to pipeline structure in three steps and assistant steps; putting forward optimizing algorithm in second and third steps in pipeline, index selection logic of Qe table under continuous CX input etc. Optimized result meets requirement of 200M timing clock under .25 micro techniques.

This invention is a JPEG2000 arithmetic encoder with improvements to conventional JPEG2000 encoder implementations. This invention decouples co-efficient bit modeling from arithmetic encoding, eliminates the RENORME while loop through least most bit detection, decouples encoding from BYTEOUT, exploits parallelism across conditional execution paths, uses look-up table storage and packing of context state data and eliminates memory dependencies through direct register forwarding.

An image compressing apparatus carrying out code amount control upon JPEG2000 coding, in which the number of coding passes and a code amount for each code block generated by a MQ (arithmetic) coder are input, and the number of coding passes and the code amount are determined based on a first code amount control standard and a second code amount control standard given for each code block. For a specific code block, the second code amount control standard is used to determine the number of coding passes and the code amount, while, for the other code blocks, the first code amount control standard is used to determine the number of coding passes and the code amount.