Compressing files is disclosed. An input file to be compressed is first aligned. When the file has multiple axes or dimensions, the file is aligned along each of the axes. Aligning the file includes splitting the file into sequences that can be aligned along each of the axes or dimensions. Aligning the file generates a compression tensor, where each row or dimensional space of the compression tensor corresponds to part of the file. A consensus tensor is determined from the compression tensor. Using the consensus tensor, pointer lists are generated. Each pointer lists identifies a subsequence or portion of the consensus tensor. The compressed file includes the pointer lists and the consensus tensor.

Provided is a compression apparatus including: a decision unit which decides, based on a variation trend of data in a data string, a bit width indicating a deviation of data; a calculation unit which calculates, with the bit width, deviations of respective pieces of data in a data group obtained by dividing the data string; a generation unit which generates a frame including: the deviations of the respective pieces of data in the data group; and information indicating the bit width; and a specification unit which specifies, from the data string, at least one continuous piece of data, a deviation of which falls within the bit width, as the data group.

A three-dimensional data encoding method includes: dividing a current frame including three-dimensional points into processing units; and encoding the processing units to generate a bitstream. Control information for each frame included in the bitstream includes first information indicating whether (i) one of the processing units included in the current frame includes duplicated points that are three-dimensional points having same geometry information or (ii) none of the processing units includes the duplicated points.

A computer system for compressing data includes a parallel processing device. The data parallel processing device is configured to divide compression target data into a plurality of pieces of partial data, execute compression processing on the partial data in parallel, calculate an appearance probability for each predetermined data unit of the partial data by using a neural network in the compression processing, and output a coded bit string which is a bit string subjected to entropy coding to the data unit based on the data unit and the appearance probability. Processing of implementing the neural network includes first conversion processing of executing matrix multiplication processing, and second conversion processing of inputting a processing result of the first conversion processing and converting each element of a matrix resulting from the processing result into an integer of 1 bit, subsequent to the first conversion processing.

Examples described herein relate to a manner of determining a number of bits to encode compression data. Some examples include: compressing pixel data of a region of pixels in a frame; determining a number of bits associated with at least two partitions; utilizing the determined number of bits to encode residual values generated from the compressing the pixel data; and storing the encoded residual values. In some examples, the at least two partitions comprise a first partition and a second partition. Some examples include: encoding residuals in the first partition using a number of bits associated with the first partition and encoding residuals in the second partition using a number of bits associated with the second partition. Some examples include: determining a distribution of bins of residuals, wherein each different bin represents a number of bits used to encode a residual value and determining a midpoint of a total number of residuals as a bin that stores a residual that is approximately 50 percentile of the total number of residuals of the distribution.

Compressing files is disclosed. An input file to be compressed is first aligned. Aligning the file includes splitting the file into sequences that can be aligned. The result is a compression matrix, where each row of the matrix corresponds to part of the file. The compression matrix may also serve as a warm start if additional compression is desired. Compression may be performed in stages, where an initial compression matrix is generated in a first stage using larger letter sizes for alignment and then a second compression stage is performed using smaller letter sizes. A consensus sequence id determined from the compression matrix. Using the consensus sequence, pointer pairs are generated. Each pointer pair identifies a subsequence of the consensus matrix. The compressed file includes the pointer pairs and the consensus sequence.

Example methods, apparatus, and articles of manufacture to capture and compress telematics data are disclosed herein. An example computer-implemented method, executed by a processor, to represent telematics data includes identifying, with the processor, a physical intersection of roads, identifying, with the processor, virtual lines crossing the roads, assigning, with the processor, ordinals to the virtual lines, representing, with the processor, a physical traversal through the physical intersection captured in first telematics data by a pair of the ordinals, and storing the pair of the ordinals in second compressed telematics data.

An encoding scheme is provided for arithmetically encoding a sequence of information values into an arithmetic coded bitstream by providing the bitstream with entry point information, allowing for resuming arithmetic decoding of the bitstream from a predetermined entry point onward. A respective decoding scheme is also provided. These encoding and decoding schemes provide more efficient encoding in view of the decoding speed.

An encoding scheme is provided for arithmetically encoding a sequence of information values into an arithmetic coded bitstream by providing the bitstream with entry point information, allowing for resuming arithmetic decoding of the bitstream from a predetermined entry point onward. A respective decoding scheme is also provided. These encoding and decoding schemes provide more efficient encoding in view of the decoding speed.

An encoding scheme is provided for arithmetically encoding a sequence of information values into an arithmetic coded bitstream by providing the bitstream with entry point information, allowing for resuming arithmetic decoding of the bitstream from a predetermined entry point onward. A respective decoding scheme is also provided. These encoding and decoding schemes provide more efficient encoding in view of the decoding speed.