A computing system is operable to generating a set of segments of a segment group. Each segment of the set of segments includes a data and parity section that includes a corresponding set of sorted data slabs, a manifest section that includes metadata regarding the corresponding set of sorted data slabs, at least one index section that includes index data for the corresponding set of sorted data slabs, and a statistics section storing statistical information regarding the each segments. The set of segments of the segment group are stored across a plurality of computing devices of a storage cluster of the computing system.

Systems and methods for compressing high-frequency signals are described in certain embodiments herein. According to certain embodiments, a high-frequency signal can be converted into a lower frequency signal so that it can be processed by one or more devices in a lower frequency infrastructure. In certain embodiments, the high-frequency signal can be compressed by certain signal conditioning components and an algorithm executed by a computer processor to at least receive a high-frequency signal, correct the high-frequency signal, determine a number of samples to be taken from the high-frequency signal (i.e., sample the high-frequency signal), store a value associated with the sampled signal, and generate a waveform that includes lower frequency content that may represent the original, high-frequency signal.

A computer-implemented method for compression of Time Tagged data including Time Tagged data records includes the step of separating the Time Tagged data records into a plurality of groups. The method also includes sorting the Time Tagged data records in at least one of the groups by a photon arrival time. The method also includes subtracting a content of a record by a content of an adjacent record resulting in modified records. The method also includes compressing the modified records with a compression method.

Embodiments of the present invention provide a data object processing method and apparatus, which can divide a data object into one or more blocks; calculate a sample compression ratio of each block, aggregate neighboring consecutive blocks with a same sample compression ratio characteristic into one data segment, and obtain the sample compression ratio of each of the data segments; and select, according to a length range to which a length of each of the data segments belongs and a compression ratio range to which the sample compression ratio of each of the data segments belongs, an expected length to divide the data segment into data chunks, where the sample compression ratio of each of the data segments uniquely belongs to one of the compression ratio ranges, and the length of each of the data segments uniquely belongs to one of the length ranges.

An information processing apparatus generates a plurality of character strings by encoding each of a plurality of pieces of continuous position data into a character string, the plurality of character strings each being a character string assigned to a region including a position specified by the respective piece of position data, groups the plurality of character strings into a plurality of groups of character strings, and divides each of the plurality of groups of character strings into a plurality of tokens.

Data compression techniques are described for saving memory space by using fewer bits to store information while achieving high fidelity. A data set may be partitioned into a plurality of regions. Locally varying numerical ranges of data values (e.g., the minimum and maximum extents) may be determined for the plurality of regions. The data in the individual regions may be encoded using a lower number of bits as interpolation values in reference to the local extents rather than being encoded using a higher number of bits as absolute values. Where there are multiple channels of data in the regions, the number of available bits for encoding the data may be dynamically allocated per region based on the relative degrees of variance in data among the multiple channels.

The present invention proposes a data processing method, a data processing apparatus, an electronic device, and a computer-readable storage medium. The method includes: in response to a data processing instruction, segmenting an original data to obtain multiple data segments of the original data to enable parallel processing of the multiple data segments, wherein the multiple data segments includes a first data segment; determining whether the first data segment is suitable for using a preset run-length encoding; and when the first data segment is suitable for using the run-length encoding, using the run-length encoding to perform a run-length encoding processing on the first data segment. According to some embodiments, the original data is initially segmented into multiple data segments, and each data segment can be processed independently and concurrently, thereby enhancing the speed of data compression processing.

For compressing data, preprocessing operations are performed on raw input data. A discrete cosine transform is performed on the preprocessed data, and multiple subbands are created, where each subband represents a particular range of frequencies. The subbands are organized into multiple groups, where the multiple groups comprise a first low frequency group, a second low frequency group, and a high frequency group. A latent space representation is generated corresponding to each of the multiple groups of subbands. A first bitstream is created based on the latent space representation, and an alternate representation of the latent space is used for creating a second bitstream, enabling multiple-pass techniques for data compression. The multiple bitstreams may be multiplexed to form a combined bitstream for storage and/or transmission purposes.

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-implemented method for compressing, an input group of m data values compresses the two least significant bits of each of the data values by mapping the two least significant bits of each of the data values in the input group of m data values collectively onto an m-bit encoding and storing the m-bit encoding, the m-bit encoding being selected from 2.sup.m m-bit encodings, the 2.sup.m m-bit encodings comprising a first group of encodings comprising (2.sup.m4) m-bit encodings and a second group of encodings comprising four m-bit encodings, wherein if the selected encoding is an encoding from the first group of encodings then the selected encoding represents the two least significant bits for a representative group of m data values in which the second least significant bit of each of the data values is the same as a respective bit of the m-bit encoding, and wherein if the selected encoding is an encoding from the second group of encodings then the selected encoding represents the two least significant bits for a representative group of m data values in which the two least significant bits for each of the data values in the representative group are equal to the two least significant bits of the other data values in the representative group.