104 results about "Arithmetic coding" patented technology

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.

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.

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 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.

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.

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.

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.

Techniques described herein may be utilised to implement methods and systems for lossless compression and serialisation of arithmetic circuits to a bit stream using compression techniques such as the arithmetic coding. An arithmetic circuit representing a smart contract may be compressed using arithmetic coding, thereby generating a compressed arithmetic circuit that can be stored or broadcast to a blockchain network using less computational resources (e.g., data storage resources) than would otherwise be needed to store the arithmetic circuit. The arithmetic circuit can be efficiently compressed using entropy coding based on the frequency of elements in the data structure, such as the arithmetic operator types. Instructions for de-serialisation and de-compression can also be embedded in the bit stream, and can be used (e.g., by another computer system) to reconstruct the original circuit in a lossless manner.

A three-dimensional data encoding method of encoding three-dimensional points each having an attribute information item includes: classifying each of the three-dimensional points into any of layers including a first layer and a second layer; and arithmetic-encoding an attribute information item of a current three-dimensional point among the three-dimensional points with reference to a first encoding table when the current three-dimensional point is at the first layer, and with reference to a second encoding table not dependent on the first encoding table when the current three-dimensional point is at the second layer.

An example method of video decoding includes receiving a video bitstream comprising a plurality of frames and identifying a set of reference frames for a current frame of the plurality of frames. When the set of reference frames includes more than one frame, the method also includes obtaining respective contexts for the set of reference frames and initializing a current frame context for the current frame by performing a weighted average of the respective contexts. When the set of reference frames includes only one frame, the method also includes initializing the current frame context for the current frame based on a context of the one frame. The method further includes entropy decoding one or more syntax elements for the current frame using the current frame context and reconstructing the current frame using information of the one or more syntax elements.

A method for determining a threshold for entropy coding that skips potential features in image and video coding using a neural network is described. A threshold for estimating a mean of standard deviations based on all latent variables is proposed. For an autoregressive neural network, in order to avoid drifting between context model parameter estimations calculated during training and reasoning, two separate entropy parameter estimation networks, namely an initial entropy estimation network and a refined entropy estimation network, are adopted, the initial entropy estimation network is used for entropy skipping coding and decoding of quantized latent variables, and the refined entropy estimation network is used for entropy skipping coding and decoding of quantized latent variables. A refined entropy estimation network is used for arithmetic encoding and decoding of quantized latent variables. Methods and systems for multi-stage entropy skipping are also presented.

The application provides a video semantic transmission method based on priority division, which comprises the following steps: acquiring an image group corresponding to a to-be-transmitted video, and performing multi-task-based feature extraction to obtain action vector features, background features and object features of the to-be-transmitted video; next, performing feature priority division, and screening the divided features according to a dynamic feature screening threshold to obtain fused features; mapping the priority weight corresponding to the fused features to a probability distribution; performing arithmetic encoding and arithmetic decoding on the fused features according to the probability distribution to obtain corresponding video semantic features; finally, performing semantic decoding processing, and reconstructing the decoded image group to obtain a transmitted video. Through the application, the technical problem of loss of important data feature information and low quality of subsequent video recovery and reconstruction in the prior art is solved.

A method of encoding images into a bitstream, the method comprises determining a residual subblock comprising an area of a residual block for a block to be encoded, and encoding transform coefficients of a transform block to be encoded based on the residual subblock area. A corresponding method comprises decoding images from a bitstream. The methods may comprise obtaining a prediction information portion of a block, comprising a plurality of samples for the block and determining the residual subblock based on the prediction samples. The methods may comprise inferring the position of the residual subblock. The process may be an Advanced Subblock Transform (ASBT) process. The method may comprise selectively encoding an orientation of the transform block in the bitstream, and wherein the orientation of the transform block is context-adaptive binary arithmetic coding (CABAC) coded; wherein at least one CABAC context is associated with the orientation of the transform block. [Fig. 14]

The invention discloses a double-flow point cloud compression method and system based on a semantic scene graph, and relates to the field of point cloud compression, and the method comprises the steps: constructing a point cloud compression network comprising an encoder network and a decoder network: in a coding end network, carrying out the semantic label mapping of an input point cloud, and respectively constructing a scene graph and octree representation; semantic modulation parameters are generated based on the scene graph and coded to obtain semantic bit streams, octree representation obtains node occupancy probability through feature enhancement and attention probability prediction under the action of the semantic modulation parameters, geometric bit streams are generated through arithmetic coding, and the two bit streams serve as compressed data; in the decoder network, bit streams are decoded, an octree structure and scene graph information are reconstructed, node feature representation is recovered in combination with semantic modulation parameters, and the reconstructed octree structure is mapped back to a point cloud space through spatial query and indexing to reconstruct a point cloud. According to the method, the local geometric distortion problem of low-bit-rate octree point cloud compression is solved, the reconstruction quality is ensured, and the transmission bit rate is reduced.

Systems, methods, and instrumentalities are disclosed for a video decoding and encoding device. A device may include a processor configured to determine that intra template matching prediction (intraTMP) is enabled for a video block. The processor may be configured to determine that intraTMP is used for decoding a first adjacent block of the video block. The processor may be configured to determine, based on a local illumination compensation (LIC) indication of the first adjacent block, a context-adaptive binary arithmetic coding (CABAC) context associated with entropy decoding a LIC indication associated with the video block. The processor may be configured to entropy decode the LIC indication associated with the video block based on the CABAC context. The processor may be configured to decode the video block based on the LIC indication.

A method for decoding a video from a video bitstream is provided and includes: accessing a binary string representing a partition of the video, the partition comprising a plurality of coding tree units (CTUs) forming one or more CTU rows; for each CTU of the plurality of CTUs in the partition, determining whether the CTU is the first CTU in a slice or a tile; in response to determining that the CTU is the first CTU in a slice or a tile, initializing context variables for context-adaptive binary arithmetic coding (CABAC) according to a first context variable initialization process; in response to determining that the CTU is not the first CTU in a slice or a tile, determining whether parallel decoding is enabled and the CTU is the first CTU in a CTU row of a tile.

The embodiment of the application discloses an image semantic coding method based on information value, relates to the technical field of communication, and can improve the information effectiveness of coded content. The method comprises the following steps: mutual information between each image to be transmitted and successfully received images of a receiving end at a previous moment is determined as the information value of each image to be transmitted at the current moment; the transmission priority of each image to be transmitted is determined according to the information value of each image to be transmitted at the current moment, and a to-be-coded image at the current moment is selected from each image to be transmitted according to the transmission priority; a pre-trained transmission strategy optimizer is used to maximize the average information value of transmitted images of a sending end as an optimization target, and a target quantization factor of the to-be-coded image is determined; and a pre-trained image semantic encoder is used to code the to-be-coded image into a bit stream conforming to a code rate corresponding to the target quantization factor based on QVRF quantization and arithmetic coding.

To encode with CABAC, a non-binary syntax element value is mapped to a binary sequence (bin string), through a binarization process. A binary arithmetic coding engine encodes or decodes a bin, in a regular (context-based) mode and a bypass mode.

The invention discloses an end-to-end DNA data storage coding method and system based on multiple constraint loss, and relates to the technical field of DNA storage. A complementary matrix convolution detection mechanism is designed in a coding stage, a hairpin structure is found through the complementary matrix convolution detection mechanism, a micronizable loss function is constructed, and a micronizable hairpin structure constraint loss function is realized. An interpretable error predictor based on Transform is trained through real sequencing data, a penalty loss function is constructed by means of an attention mechanism error-prone motif mask matrix to achieve error-prone motif suppression, and then GC content loss and homopolymer loss are fused to form a multi-constraint loss function. According to the method, an end-to-end architecture with a Transform auto-encoder as a main body is constructed, mapping of image data and a DNA sequence is realized through differentiable arithmetic coding, data reconstruction is completed in combination with noise injection and reverse decoding, and in a training stage, a deep Q network is adopted to carry out adaptive joint adjustment on weights of a multi-constraint loss function and mean square error reconstruction loss, so that data reconstruction is completed. And end-to-end optimization of model parameters is realized.

The invention provides a data compression method and device, and relates to the technical field of data processing. The data compression method comprises the following steps: S1, counting the occurrence probability of characters in to-be-compressed data to obtain a probability table; s2, segmenting the to-be-compressed data according to a preset byte length to obtain a plurality of data segments; s3, selecting a current to-be-processed data segment from the plurality of data segments; s4, according to the probability table, performing interval distribution on the current to-be-processed data segment to obtain a coding interval; s5, according to the left and right boundary values of the coding interval, determining the arithmetic code of the current to-be-processed data segment, and taking the arithmetic code of the current to-be-processed data segment as a compression result; s6, updating the current to-be-processed data segment according to the next data segment of the current to-be-processed data segment; and S7, repeating the steps S4-S6 until a plurality of data segments are traversed. According to the method, arithmetic coding is performed on the segmented data segments through the probability table, the storage bandwidth is saved, and the expansibility is good.

A moving picture coding method includes (i) transforming, for each of one or more second processing units included in the first processing unit, a moving picture signal in a spatial domain into a frequency domain coefficient and quantizing the frequency domain coefficient, and (ii) performing arithmetic coding on a luminance CBF flag indicating whether or not a quantized coefficient is included in the second processing unit in which transform and quantization are performed, wherein, in the arithmetic coding, a probability table for use in arithmetic coding is determined according to whether or not the size of the first processing unit is identical to the size of the second processing unit and whether or not the second processing unit has a predetermined maximum size.

The various embodiments described herein include methods and systems for coding video. In one aspect, a method includes obtaining video data that includes a first syntax element with a corresponding alphabet of M elements, and obtaining respective probabilities of occurrence for the M elements. The method further includes entropy coding a first portion of the video data using the respective probabilities of occurrence, and, while entropy coding, encountering the first syntax element. The method also includes updating probabilities of occurrence based on the first syntax element, and, in accordance with at least one of the updated probabilities being less than a threshold probability value, determining regularized probabilities of occurrence by applying a probability regularization to the updated probabilities of occurrence, where the probability regularization does not include a division operation.

The application discloses an image coding, decoding and compressing method and system based on vector quantization entropy modeling, which comprises the following steps: obtaining a first feature map of an image to be coded; obtaining a super-prior binary code stream and super-prior information of the first feature map; quantizing the first feature map by using a lattice vector quantizer; projecting the quantized first feature map to an integer coefficient domain of the lattice vector quantizer to obtain a second feature map; modeling the distribution of the second feature map as a Gaussian distribution independent of each dimension, and predicting the mean and variance of the Gaussian distribution by combining the super-prior information and a spatial context model; dividing the integer coefficient domain of the lattice vector quantizer by using a relaxed boundary, and performing probability estimation and arithmetic coding according to the predicted mean and variance of the Gaussian distribution to obtain a feature binary code stream; and combining the feature binary code stream with the super-prior feature binary code stream to obtain a compressed image binary code stream. The application improves the rate-distortion performance of image compression by using a more efficient lattice vector quantization on three-dimensional features.