Among the various aspects of the present disclosure is the provision of systems and methods of compressed-sensing ultrafast spectral photography.

Provided is a method for encoding scatterplot data using strings. The method may comprise receiving a plurality of data points in a data set. Each data point has at least a first data value corresponding to a first dimension and a second data value corresponding to a second dimension. The method further comprises determining a first resolution for the first dimension and a second resolution for the second dimension. The method further comprises determining an encoding scheme for encoding the plurality of data points. The encoding scheme includes a plurality of valid encoding characters. The method further comprises encoding each of the plurality of data points based on the first resolution, the second resolution, and the encoding scheme.

Certain implementations of the disclosed technology may include methods and computing systems for performing high-density data compression, particularly on numerical data that demonstrates various patterns, and patterns of patters. According to an example implementation, a method is provided. The method may include extracting a data sample from a data set, compressing the data sample using a first compression filter configuration, and calculating a compression ratio associated with the first compression filter configuration. The method may also include compressing the data sample using a second compression filter configuration and calculating a compression ratio associated with the second compression filter configuration. A particular compression filter configuration to utilize in compressing the entire data set may be selected based on a comparison of the compression ratio associated with the first compression filter configuration and a compression ratio associated with the second compression filter configuration.

Fast, efficient, and robust compression-based methods for detecting boundaries in arbitrary datasets, including sequences (1D datasets), are desired. The methods, each employing three simple algorithms, approximate the information distance between two adjacent sliding windows within a dataset. One of the algorithms calculates an initial ordered list of subsequences; while a second algorithm updates the ordered list of subsequences by dropping a first entry and appending a last entry rather than calculating completely new ordered lists with each iteration. Large values in the distance metric are indicative of boundary locations. A smoothed z-score or a wavelet-based algorithm may then be used to locate peaks in the distance metric, thereby identifying boundary locations. An adaptive version of the method employs a collection of window sizes and corresponding weighting functions, making it more amenable to real datasets with unknown, complex, and changing structures.

Example methods, apparatus, and articles of manufacture to compress telematics data are disclosed herein. An example computer-implemented method includes identifying, using one or more processors, a portion of recorded telematics data representing a physical transversal of a physical intersection of two or more road segments, wherein each road segment has an assigned unique ordinal value; identifying, using one or more processors, a first road segment on which the physical transversal entered the intersection; identifying, using one or more processors, a second road segment on which the physical transversal exited the intersection; identifying, using one or more processors, a pair of ordinal values including a first ordinal value assigned to the first road segment, and a second ordinal value assigned to the second road segment; and storing the pair of ordinal values instead of the portion of the recorded telematics data in a compressed representation of the recorded telematics data.

Disclosed are a method and apparatus for storing data. The method includes: acquiring data to be stored; converting the data to be stored from an initial data type to a target data type, a data length corresponding to the target data type being less than that corresponding to the initial data type; and storing the data to be stored of the target data type to a database. In the method according to the present disclosure, a storage space occupied by the data to be stored in the database is greatly reduced. In addition, the method according to the present disclosure is performed prior to lossy or lossless data compression storage of the data to be stored in the related art. That is, on the basis of a compression ratio when the data to be stored is stored in the related art, the present disclosure further improves a compression effect of the data to be stored by reducing the data length when the data to be stored is stored, and further saves storage resources of the database.

A three-dimensional data encoding method includes: generating an N-ary tree structure of three-dimensional points included in three-dimensional data, where N is an integer greater than or equal to 2; generating first encoded data by encoding a first branch using a first encoding process, the first branch having, as a root, a first node included in a first layer that is one of layers included in the N-ary tree structure; generating second encoded data by encoding a second branch using a second encoding process different from the first encoding process, the second branch having, as a root, a second node included in the first layer and different from the first node; and generating a bitstream including the first encoded data and the second encoded data.

A system comprises an encoder configured to entropy encode a bitstream comprising both compressible and non-compressible symbols. The encoder parses the bitstream into a compressible symbol sub-stream and a non-compressible sub-stream. The non-compressible symbol sub-stream bypass an entropy encoding component of the encoder while the compressible symbol sub-stream is entropy encoded. When a quantity of bytes of entropy encoded symbols and bypass symbols is accumulated a chunk of fixed or known size is formed using the accumulated entropy encoded symbol bytes and the bypass bytes without waiting on the full bitstream to be processed by the encoder. In a complementary manner, a decoder reconstructs the bitstream from the packets or chunks.

A method for storing measurement data detected by a sensor and indicative of an analyte in a body fluid sample using a system having a processor and a memory. First and second measurement data indicative of first and second measurement values measured by a sensor, respectively, are provided. A relative measurement value is determined by the processor and is indicative of a value difference between the first and second measurement values. The first measurement value is stored in a first storage area having a first storage size in the memory. The relative measurement value is stored in a second storage area having a second storage size in the memory that is smaller than the first storage size. An indicator is also stored in the memory and is assigned to the relative measurement storage data in the memory and is indicative of a characteristic of the relative measurement storage data.

A method for storing measurement data detected by a sensor and indicative of an analyte in a body fluid sample using a system having a processor and a memory. First and second measurement data indicative of first and second measurement values measured by a sensor, respectively, are provided. A relative measurement value is determined by the processor and is indicative of a value difference between the first and second measurement values. The first measurement value is stored in a first storage area having a first storage size in the memory. The relative measurement value is stored in a second storage area having a second storage size in the memory that is smaller than the first storage size. An indicator is also stored in the memory and is assigned to the relative measurement storage data in the memory and is indicative of a characteristic of the relative measurement storage data.