183 results about "Arithmetic coding" patented technology

A system and method for cross-domain knowledge transfer in federated compression networks. The system enables efficient lossless data compression across diverse data types by intelligently sharing compression strategies between domains. A cross-domain knowledge transfer system identifies relationships between different data domains, adapts compression parameters accordingly, and optimizes learning processes to maximize knowledge reuse. The architecture may include a knowledge repository for storing domain features and compression patterns, domain mapping components that identify similarities, and transfer learning optimization that enables efficient adaptation with minimal examples. This approach significantly accelerates model training for new domains while improving compression performance. Applications include satellite telemetry systems where efficient compression is critical for transmitting large information sets between distant locations. The system may employ probability prediction driven arithmetic coding paired with long short-term memory networks, enhanced by cross-domain knowledge sharing that adapts successful compression strategies from one domain to another while preserving domain-specific optimization.

A method performed by at least one processor of a video decoder includes receiving a coded video bitstream including at least one picture and one or more syntax elements encoded in accordance with multi-hypothesis arithmetic coding. The method further includes decoding each syntax element from the one or more syntax elements based on the multi-hypothesis arithmetic coding. The method further includes selecting a probability update rate from a plurality of probability update rates based on a predetermined condition, the plurality of probability update rates including a first probability update rate that is higher than a second probability update rate. The method further includes updating at least one probability model utilized in the multi-hypothesis arithmetic coding based on the selected probability update rate. The method further includes decoding at least one block in the at least one picture based on the decoded one or more syntax elements.

This disclosure provides methods, devices and systems for encoding data, to achieve a symbol distribution, for wireless communication. One implementation includes a method in which arithmetic coding (AC) encoding is constrained by a set of one or more target compositions for symbol sequences. The target compositions are known, and the encoding method is performed in multiple iterations. Each iteration generates a symbol and establishes a composition prefix, which is taken into account in the subsequent iteration. The methods generate output sequences defining symbols that are used to encode data for transmission.

In one implementation, a method of encoding or decoding point cloud data is provided, comprising: obtaining a feature map representing attributes of voxels in an octree structure; determining one or more probability distribution parameters for a probability density function associated with an attribute of a current voxel, based on the feature map; determining a probability mass function of the attribute of the current voxel based on the one or more probability distribution parameters for the probability density function for the current voxel; and encoding or decoding attribute information of the current voxel in the octree structure, based on the probability mass function of the attribute for the current voxel.

The invention relates to a task-oriented semantic communication-oriented adaptive source channel coding system, which belongs to the field of wireless communication, and comprises a sending end for extracting a semantic feature map for evaluation from input data through a feature extractor initialized based on a pre-training large model, executing nested quantization and arithmetic coding based on a calculated importance score, and sending the semantic feature map to a task-oriented semantic communication-oriented adaptive source channel coding system; generating a scalable semantic bit stream with importance levels; the physical layer is used for carrying out reordering and grouping according to importance levels of bit streams, a channel encoder is combined with an interleaver to realize unequal error protection of semantic matching, and encoded bits are mapped to sign bits with different fault-tolerant capabilities in a constellation diagram through division modulation; and a receiving end: recovering the semantic feature map through arithmetic decoding and nested inverse quantization. According to the invention, on the premise of keeping compatibility with a digital communication protocol stack, through distortion-driven joint rate self-adaption, the transmission effectiveness for machine tasks and human vision is obviously improved under a limited bandwidth.

A method and an apparatus including processing circuitry are provided. The processing circuitry determines previous probability information associated with each entropy coded region of multiple regions in a previous picture. The processing circuitry selects, based on (i) a location or a quantization parameter of an independently decodable coding segment in a current picture or (ii) syntax information of the independently decodable coding segment, a region among the multiple regions. Initial probability information for one or more current syntax elements of a block in the independently decodable coding segment is determined based on the previous probability information associated with the selected region. The one or more current syntax elements are first to be entropy decoded in the independently decodable coding segment. The processing circuitry entropy decodes coded bits associated with the one or more current syntax elements into a bin string based on the initial probability information.

The invention relates to the technical field of industrial data compression, in particular to an industrial operation and maintenance data hybrid compression storage method, system and device and a medium. High compression rate and lossless storage are realized by distinguishing time sequence data from non-time sequence feature vectors and respectively adopting Huffman coding and LLM-driven arithmetic coding; and through efficient compression processing, especially effective reduction of feature vector redundancy, the space required by data storage is greatly reduced, so that the storage cost of the operation and maintenance data of the generic semiconductor industrial equipment is reduced.

The invention relates to the technical field of point cloud, in particular to a coding and decoding method for point cloud compression. The invention provides a coding method for geometric compression of a point cloud, which comprises the following steps of: performing layer-by-layer down-sampling and layer-by-layer up-sampling on each spatial scale of a point cloud group, and training a network through over-fitting to obtain optimized network parameters; based on the network parameters, performing layer-by-layer up-sampling on each spatial scale of the point cloud group, predicting the occupancy probability of the child nodes and taking the occupancy probability as a code table, performing arithmetic coding on occupancy codes of the child nodes, and generating an occupancy code stream; and coding the network parameters to generate a network parameter code stream. According to the invention, the adjacent frames with similar features in the point cloud sequence share the lightweight network parameters for coding and decoding, so that the repeated transmission of the network parameters is reduced, and the average bandwidth consumption of the network parameters in the transmission process is reduced.

The invention discloses a high-definition video low-delay compression method based on self-adaptive adjustment, and aims to solve the problems of insufficient self-adaptive adjustment capability, too high encoding and decoding delay and low code rate and network bandwidth matching degree in the existing high-definition video compression technology. The method comprises the following steps: firstly, acquiring a high-definition video stream and a real-time network bandwidth parameter, extracting intra-frame texture complexity, inter-frame motion intensity and scene switching frequency characteristics, and constructing a two-dimensional adaptive compression strategy in combination with a real-time bandwidth; low-delay coding is executed by adopting parallel frame fragmentation and simplified adaptive arithmetic coding, adaptive code rate control is realized by combining code rate overflow early warning and intra-frame key region priority bit allocation, and finally, fast inverse transformation, quantization recovery and motion compensation optimization are completed at a decoding end based on strategy parameters synchronously transmitted at a coding end so as to reconstruct a high-definition video frame. According to the invention, the adaptive adjustment capability of video compression is improved, low time delay of coding and decoding is realized, and the method is suitable for real-time high-definition video transmission scenes such as remote monitoring and video conferences.

An apparatus with a processor receives a bitstream including a syntax element indicating whether prediction errors, mesh connectivity information, and additional basemesh syntax elements are transmitted in a single entropy packet or a plurality of entropy packets, a first set of arithmetically coded prediction errors, and a second set of arithmetically coded prediction errors for decoding a mesh frame. The processor decodes the syntax element and arithmetically decodes the first and second set of arithmetically coded prediction errors based on the syntax element. In one example, the first and second set of arithmetically coded prediction errors are included in a single entropy packet if the syntax element has a first value and the first set of arithmetically coded prediction errors is in a first entropy packet and the second set of arithmetically coded error predictions is in a second entropy packet if the syntax element has a second value.

An encoding device (100) is provided with: a memory (152); and a circuit (151) capable of accessing the memory (152), the circuit (151), during operation, encodes a connection type pertaining to a connection relationship between a surface to be processed and an unprocessed surface by context-based arithmetic encoding for each of a plurality of surfaces constituting a three-dimensional grid, and, during encoding of a current connection type, which is the connection type to be encoded, encodes the current connection type to be encoded by context-based arithmetic encoding for each of the plurality of surfaces constituting the three-dimensional grid. The context to be applied to the arithmetic encoding is selected from a plurality of contexts using a previous connection type that is the connection type encoded prior to the current connection type.

This invention discloses a dual-stream point cloud compression method and system based on semantic scene graphs, relating to the field of point cloud compression. It constructs a point cloud compression network comprising an encoder network and a decoder network: In the encoder network, semantic labels are mapped onto the input point cloud, and scene graphs and octree representations are constructed respectively. Semantic modulation parameters are generated based on the scene graph and encoded to obtain a semantic bitstream. The octree representation, under the influence of semantic modulation parameters, undergoes feature enhancement and attention probability prediction to obtain node occupancy probabilities, and a geometric bitstream is generated through arithmetic encoding. These two bitstreams serve as compressed data. In the decoder network, the bitstreams are decoded, and the octree structure and scene graph information are reconstructed. Node feature representations are recovered by combining the semantic modulation parameters. The reconstructed octree structure is mapped back to the point cloud space through spatial querying and indexing to reconstruct the point cloud. This invention solves the problem of local geometric distortion in low-bitrate octree point cloud compression, ensuring reconstruction quality while reducing the transmission bitrate.

Methods and apparatuses are provided to encode data into a bitstream and to decode data from a bitstream. According to the method, the length of the bitstream can be reduced by including only the relevant significant bits within the trailing bits of the encoding process. The amount of these leading trailing bits is determined and the trailing bits, which have the least amount, can be constructed. Indications of the amount of leading trailing bits are included into the bitstream. Therefore, padding is not required, resulting in less bits, which need to be signaled.

The invention proposes a method and a device for arithmetic encoding of a current spectral coefficient using preceding spectral coefficients. Said preceding spectral coefficients are already encoded and both, said preceding and current spectral coefficients, are comprised in one or more quantized spectra resulting from quantizing time-frequency-transform of video, audio or speech signal sample values. Said method comprises processing the preceding spectral coefficients, using the processed preceding spectral coefficients for determining a context class being one of at least two different context classes, using the determined context class and a mapping from the at least two different context classes to at least two different probability density functions for determining the probability density function, and arithmetic encoding the current spectral coefficient based on the determined probability density function wherein processing the preceding spectral coefficients comprises non-uniformly quantizing absolutes of the preceding spectral coefficients for use in determining of the context class.

Methods and apparatus are provided for initializing a set of context model probability sets for slices in context-based adaptive binary arithmetic coding (CABAC). An exemplary video decoding method includes selecting a first set of probability parameters for initializing one or more context models of a B-slice from a predefined plurality of sets of probability parameters; and performing entropy decoding of the B-slice based on the one or more context models and the first set of probability parameters, where the selection is based on a coding condition of the B-slice or a signal in the bitstream.

The present disclosure relates to a method and apparatus for compressing parameters of a neural network, and specifically describes an encoder for encoding weight parameters of a neural network. The encoder is configured to: obtain a plurality of weight parameters of the neural network; encoding a weight parameter of the neural network using context-dependent arithmetic coding; selecting a context for encoding a weight parameter or for encoding a syntax element of a digital representation of a weight parameter in accordance with one or more previously encoded weight parameters and / or one or more previously encoded syntax elements in accordance with the digital representation of the one or more weight parameters; and encoding the weight parameter or the syntax element of the weight parameter using the selected context. A corresponding decoder, quantizer, method and computer program are also described.

The application relates to the technical field of data compression storage, and provides a high-throughput genome sequencing quality score data parallel compression method.The method comprises the following steps: segmenting an original gene sequencing file; performing random sampling and k-mer analysis on the sampling data to obtain statistical characteristic information and establish a parallel sequence partition model for binary classification; splicing two partition files obtained through binary classification according to splicing parameters; predicting the to-be-compressed file through a multivariate linear regression analysis prediction method to obtain compression rate gain and establish a parallel four-level run prediction mapping model for data redundancy elimination; and performing context modeling on two redundancy-eliminated subfiles through a multi-core processor cluster, and performing cascade compression in combination with arithmetic coding to obtain a final compressed file.Under the premise of significantly reducing quality score data compression time and peak memory overhead, the application also improves the quality score data compression rate, reduces the size of to-be-compressed storage files, and saves the construction cost of basic storage facilities.

An encoding device (100) is provided with a memory (152) and a circuit (151) capable of accessing the memory (152), the circuit (151), during operation, encodes a connection type by context-based arithmetic encoding (S1410) for each of a plurality of surfaces constituting a three-dimensional grid, selects a context (S1411) using a first previous connection type during encoding of a current connection type, and performs encoding of the current connection type using a second previous connection type during encoding of the current connection type. When the first previous connection type is shifted by the angle type, the context is selected according to the number of more than one angle type continuously encoded up to the first previous connection type.

Aspects of the disclosure provide methods and apparatuses for video encoding / decoding. In some examples, an apparatus for video decoding includes processing circuitry. The processing circuitry receives coded information of a current block in a current picture from a coded video bitstream. The coded information includes a syntax element associated with the current block, the syntax element indicates a decoding parameter of the current block. The processing circuitry determines a context-based adaptive binary arithmetic coding (CABAC) context model associated with the syntax element based on at least a temporally co-located block of the current block. The temporally co-located block is in a different picture from the current picture. Further, the processing circuitry decodes the syntax element based on the CABAC context model, and reconstructs the current block based on the syntax element that is decoded based on the CABAC context model.

The invention proposes a method and a device for arithmetic encoding of a current spectral coefficient using preceding spectral coefficients. Said preceding spectral coefficients are already encoded and both, said preceding and current spectral coefficients, are comprised in one or more quantized spectra resulting from quantizing time-frequency-transform of video, audio or speech signal sample values.Said method comprises processing the preceding spectral coefficients, using the processed preceding spectral coefficients for determining a context class being one of at least two different context classes, using the determined context class and a mapping from the at least two different context classes to at least two different probability density functions for determining the probability density function, and arithmetic encoding the current spectral coefficient based on the determined probability density function wherein processing the preceding spectral coefficients comprises non-uniformly quantizing absolutes of the preceding spectral coefficients for use in determining of the context class.

The application provides an encoding method, a decoding method and related devices, the method comprising: obtaining to-be-encoded data of an original image, the to-be-encoded data comprising quantization coefficients and control information; and obtaining an image code stream of the original image based on the to-be-encoded data. The image code stream comprises arithmetic encoding data and VLC encoding data. The arithmetic encoding data comprises quantization coefficients less than a first value and control information, and is obtained by using an arithmetic encoding mode for entropy encoding. The VLC encoding data comprises quantization coefficients greater than or equal to the first value, and is obtained by using a VLC entropy encoding mode for entropy encoding. The control information is used for decoding the image code stream. In the application, the characteristics of the VLC entropy encoding mode and the arithmetic encoding mode are combined to effectively reduce the encoding and decoding complexity.

In various examples, metadata may be generated corresponding to compressed data streams that are compressed according to serial compression algorithms—such as arithmetic encoding, entropy encoding, etc.—in order to allow for parallel decompression of the compressed data. As a result, modification to the compressed data stream itself may not be required, and bandwidth and storage requirements of the system may be minimally impacted. In addition, by parallelizing the decompression, the system may benefit from faster decompression times while also reducing or entirely removing the adoption cycle for systems using the metadata for parallel decompression.

The invention relates to a text compression and encryption method and system based on a large model. The method realizes safe and efficient dynamic encryption through a mixed key architecture, and comprises the following steps: generating an elliptic curve asymmetric key pair and encrypting a dynamically derived symmetric session key; processing the original text through the context input into the large model to generate a to-be-compressed text; mapping the text to be compressed to a binary bit stream through a lossless compression model based on arithmetic coding; generating a session key by adopting a symmetric encryption (AES-GCM) algorithm with authentication and encryption functions to encrypt the bit stream to generate a ciphertext; and splicing the encryption key and the ciphertext into a structured bit stream through zero-bit filling coding. According to the scheme, the context semantic modeling capability of the large language model is utilized, the grammar rule, the character type and the semantic expression of the decompressed text are maintained while the compression capability is guaranteed, the encryption strength is improved, and the method can be widely applied to scenes such as high-speed communication (such as 6G) and the like which need to give consideration to safety and high compression rate.

Various aspects of the present disclosure generally relate to wireless communication. In some aspects, a user equipment (UE) may receive a probabilistic shaping configuration including a configuration for peeling-based arithmetic coding. The UE may transmit an uplink communication in accordance with the probabilistic shaping configuration, wherein the configuration for peeling-based arithmetic coding includes a configuration for determining a sequence composition during a composition element selection stage and a configuration for generating a sequence during a sequence generation stage, wherein the configuration for generating the sequence during the sequence generation stage includes a configuration for generating the sequence in accordance with the sequence composition determined during the composition element selection stage. Numerous other aspects are described.

The method performed by at least one processor of the video decoder includes receiving a coded video bitstream including at least one picture encoded according to multiple hypothesis arithmetic coding and one or more syntax elements. The method further includes decoding each syntax element from the one or more syntax elements based on the multiple hypothesis arithmetic coding. The method further includes selecting a probability update rate from a plurality of probability update rates based on a predetermined condition, the plurality of probability update rates including a first probability update rate higher than a second probability update rate. The method further includes updating at least one probability model utilized in the multiple hypothesis arithmetic coding based on the selected probability update rate. The method further includes decoding at least one block in the at least one picture based on the decoded one or more syntax elements.

Devices, systems and methods for digital video coding, which includes matrix-based intra prediction methods for video coding, are described. In a representative aspect, a method for video processing includes encoding a current video block of a video using a matrix intra prediction (MIP) mode in which a prediction block of the current video block is determined by performing, on previously coded samples of the video, a boundary downsampling operation, followed by a matrix vector multiplication operation, and selectively followed by an upsampling operation; and adding, to a coded representation of the current video block, a syntax element indicative of applicability of the MIP mode to the current video block using arithmetic coding in which a context for the syntax element is derived based on a rule.

Techniques for context-adaptive binary arithmetic coding (CABAC) coding with a reduced number of context coded and / or bypass coded bins are provided. Rather than using only truncated unary binarization for the syntax element representing the delta quantization parameter and context coding all of the resulting bins as in the prior art, a different binarization is used and only part of the resulting bins are context coded, thus reducing the worst case number of context coded bins for this syntax element. Further, binarization techniques for the syntax element representing the remaining actual value of a transform coefficient are provided that restrict the maximum codeword length of this syntax element to 32 bits or less, thus reducing the number of bypass coded bins for this syntax element over the prior art.

The application discloses a high-definition video low-delay compression method based on adaptive adjustment, and aims to solve the problems of insufficient adaptive adjustment capability, high coding and decoding delay and low matching degree of code rate and network bandwidth in the prior high-definition video compression technology. First, high-definition video stream and real-time network bandwidth parameters are acquired, and features of intra-frame texture complexity, inter-frame motion intensity and scene switching frequency are extracted, and a double-dimension adaptive compression strategy is constructed in combination with real-time bandwidth; low-delay coding is executed by adopting parallel frame slicing and simplified adaptive arithmetic coding, adaptive code rate control is realized by combining code rate overflow early warning and intra-frame key area priority bit allocation, and finally, fast inverse transformation, quantization recovery and motion compensation optimization are completed based on the strategy parameters synchronously transmitted by the encoding end at the decoding end to reconstruct high-definition video frames. The application improves the adaptive adjustment capability of video compression, realizes low coding and decoding delay, and is suitable for real-time high-definition video transmission scenes such as remote monitoring and video conference.

Provided are a coefficient coding / decoding method, an encoder and a decoder. The method includes: parsing a bitstream by adaptive binary arithmetic coding using a first context model based on quantization coefficient positions to be decoded to obtain a value of a non-zero identification; if the value is a first value, parsing the bitstream by adaptive binary aritlunetic coding using a second context model to obtain values of X preset identifications; if the value of the X-th preset identification is the first value, determining a target order of exponential Golomb coding, and parsing the bitstream using an exponential Golomb decoding algorithm of the target order to obtain remaining values of reconstructed quantization coefficient absolute values; and determining reconstructed quantization coefficient absolute values corresponding to the quantization coefficient positions based on the value of non-zero identification, values of X preset identifications, and remaining values of reconstructed quantization coefficient absolute values.

Methods and apparatus for image compression / decompression using tensor product B-spline (TPB) representations. According to an example embodiment, an image compression method includes generating a plurality of TPB models representing an image, the plurality of TPB models including a TPB model for approximating a spatial remodeling function and a plurality of block-by-block TPB models for estimating an image signal. In some examples, the plurality of tile-by-tile TPB models includes a plurality of luma channel TPB models and a plurality of chroma channel TPB models. The spatial remodeling function is configured to transform a non-uniform local content complexity distribution in the image towards a more uniform transition. The method also includes generating a metadata stream carrying metadata representing a set of coefficients for the various TPB models. At least a portion of the metadata is generated by quantizing corresponding coefficients to a smaller number of bits and applying arithmetic coding to the quantized coefficients.