A sequence of integer values is encoded and decoded with a number of bits of a decimal value substantially assigned per sample or/and with a smaller memory amount or calculation processing amount than in the prior art. The encoder receives the sequence of integer values as input and outputs an integer code corresponding to the sequence of integer values. An integer transformer (11) obtains one integer value (transformed integer) through algebraically-representable bijective transformation for each of a plurality of sets of integer values included in the inputted sequence of integer values. An integer encoder (12) encodes the transformed integer to thereby obtain an integer code.

A method for producing a thinned representation of vibration waveform data. The waveform vibration data is received and divided into sequential blocks. For each sequential block, each serially designated in turn as a current block, the following steps are performed. When the current block is also a first block, the current block is passed as a reference block. A representative value for the current block is computed and compared to the representative value for the reference block to determine a difference. The representative value for the current block is compared to a minimum representative value. The current block is transformed into a spectrum and compared to the spectrum for the reference block to determine a correlation value. When the representative value for the current block is above the minimum representative value, the current block is passed as the reference block whenever at least one of the following is true, (a) the first difference is greater than a given difference, (b) the correlation value is less than a given correlation value, and (c) a numerical count of blocks between the current block and a most recently passed reference block is greater than a given maximum.

Methods and systems for encoding and decoding data, such as point cloud data. The methods may include using a coder map to map a range of discrete dependency states to a smaller set of binary coders each having an associated coding probability. The selection of one of the discrete dependency states may be based on a contextual or situational factors, which may include a prediction process, for a particular symbol, such as an occupancy bit. The coder map is updated after each symbol is coded to possibly alter to which binary coder the selected discrete dependency state maps.

A system comprises an encoder configured to compress attribute information for a point cloud and/or a decoder configured to decompress compressed attribute information for the point cloud. Attribute values for at least one starting point are included in a compressed attribute information file and attribute correction values used to correct predicted attribute values are included in the compressed attribute information file. Attribute values are predicted based, at least in part, on attribute values of neighboring points and distances between a particular point for whom an attribute value is being predicted and the neighboring points. The predicted attribute values are compared to attribute values of a point cloud prior to compression to determine attribute correction values. A decoder follows a similar prediction process as an encoder and corrects predicted values using attribute correction values included in a compressed attribute information file.

A system comprises an encoder configured to compress attribute information for a point cloud and/or a decoder configured to decompress compressed attribute information for the point cloud. Attribute values for at least one starting point are included in a compressed attribute information file and attribute correction values used to correct predicted attribute values are included in the compressed attribute information file. Attribute values are predicted based, at least in part, on attribute values of neighboring points and distances between a particular point for whom an attribute value is being predicted and the neighboring points. The predicted attribute values are compared to attribute values of a point cloud prior to compression to determine attribute correction values. A decoder follows a similar prediction process as an encoder and corrects predicted values using attribute correction values included in a compressed attribute information file.

A technique for selecting context models (CMs) for a CM ensemble (CME) in a context mixing compressor includes measuring compression ratios (CRs) of the compressor on a dataset for each CM included in a base set of CMs. A first CM that has a maximum CR for the dataset is added to the CME. In response to a desired number of the CMs not being in the CME, subsequent CRs for the compressor are measured on the dataset for each of the CMs in the base set of CMs that are not in the CME in conjunction with one or more CMs in the CME. In response to a desired number of the CMs not being in the CME, subsequent CMs that in conjunction with the one or more CMs in the CME result in a maximum subsequent CR for the dataset are added to the CME.

A method for producing a thinned representation of vibration waveform data. The waveform vibration data is received and divided into sequential blocks. For each sequential block, each serially designated in turn as a current block, the following steps are performed. When the current block is also a first block, the current block is passed as a reference block. A representative value for the current block is computed and compared to the representative value for the reference block to determine a difference. The representative value for the current block is compared to a minimum representative value. The current block is transformed into a spectrum and compared to the spectrum for the reference block to determine a correlation value. When the representative value for the current block is above the minimum representative value, the current block is passed as the reference block whenever at least one of the following is true, (a) the first difference is greater than a given difference, (b) the correlation value is less than a given correlation value, and (c) a numerical count of blocks between the current block and a most recently passed reference block is greater than a given maximum.

A method, and the associated design, schema and techniques for processing digital data, whether random or not, through encoding and decoding losslessly and correctly for purposes of encryption/decryption or compression/decompression or both, including the use of Digital Lensing, Unlimited Code System, and other associated techniques. There is no assumption of or requirement for the digital information to be processed before processing.

An encoder includes processing circuitry, a block memory, and a frame memory. The processing circuitry defines at least one parameter for each of plural types of segment_ids, splits an image into blocks, assigns, to each of the blocks, segment_id according to a type of the block, among the plural types of segment_ids, and sequentially encodes the blocks. In encoding the blocks, the processing circuitry identifies segment_id of a current block to be encoded, and encodes the current block using the at least one parameter defined for identified segment_id. The at least one parameter includes seg_context_idx for identifying probability information associated with context used in context-based adaptive binary arithmetic coding (CABAC).

Techniques for data processing may include: receiving a data chunk; determining a metric value denoting a degree of compressibility of the data chunk; selecting, in accordance with the metric value denoting the compressibility of the data chunk, a first size of a plurality of sizes, wherein each of the plurality of sizes denotes a different size of an amount of storage used for storing a value of said each size; and performing the data deduplication processing for the data chunk, wherein the data deduplication processing includes using a first hash value for the data chunk to determine whether the data chunk is a duplicate of another data chunk of a hash table, wherein the first hash value is stored in a storage location of the first size.