A technique to prevent a retrieving process of a conversion rule from taking a longer time is provided. Provided are a conversion table in which a predetermined number of entry regions capable of storing a mapping between first data and second data smaller in size than the first data are included, the predetermined number of entry regions are divided into a plurality of bank regions, and each of the plurality of bank regions includes entry regions smaller in number than the predetermined number, a determination unit configured to uniquely determine, among the plurality of bank regions, a bank region corresponding to the first data, and a processing unit configured to search entry regions of the determined bank region the predetermined number of times each or a smaller number of times than the predetermined number each, output, when the second data corresponding to the first data is stored, the second data, and when the second data corresponding to the first data is not stored, register the second data corresponding to the first data in an entry region in which another piece of second data is not stored and output the first data.

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.

The present disclosure relates to an apparatus and method for fast refining segmentation for a V-PCC encoder. The apparatus may include a grid segmentation unit segmenting a coordinate space of a point cloud into grid units, and an edge cube search unit searching a cube containing one or more points among the cubes segmented into grid units and containing a segment boundary. The apparatus may also include a surrounding cube search unit searching an edge surrounding cube containing one or more points within a predetermined range from the edge cube, and a smooth score calculation unit calculating smooth scores for all the edge surrounding cubes and all the edge cubes. The apparatus may further include a projection plane index update unit obtaining a normal score based on the calculated smooth scores and updating a projection plane index of each point in the edge cube using the normal score.

A decoding device is used to securely send corresponding data gathered from multiple underground sources to multiple users. The device comprises a signal receiving port connected to multiple bandwidth filters and further connected to internet access points that are assigned to end users for secure data access. The invention facilitates allowing the signal and data being transmitted through the formation of the earth to reach end users located nearby and significant distances away from the source of the transmission. A system and method utilizing the decoding device is provided.

The present disclosure relates to a system and method for compressing a dataset. The dataset can be divided in to a plurality of groups. Each group can be converted independently into corresponding text file using dictionary coding technique. The corresponding text files can be compressed independently into corresponding compressed files. Finally, all the corresponding compressed files can be combined together to generate a complete compressed data.

A method for data storage may be provided. The method may include storing metadata of an image file onto a first storage device. The method may include dividing image data of the image file into at least one sub-image data set. The method may also include storing each sub-image data set of the at least one sub-image data set, onto a second storage device of at least one second storage device. The method may further include storing access information of the at least one second storage device onto the first storage device.

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.

There is provided a computer implemented method of compressing a baseline dataset comprising a sequence of a plurality of instances of a plurality of unique data elements, the method comprising: providing a weight function that calculates an increasing value for a weight for each one of the plurality of instances of each one of the plurality of unique data elements in the baseline dataset, as a function of increasing number of previously processed sequential locations of each of the plurality of instances of each respective unique data element within the baseline dataset relative to a current sequential location of the baseline dataset, computing an encoding for the baseline dataset according to a distribution of the weight function computed for the plurality of unique data elements in the baseline dataset, and creating a compressed dataset according to the encoding.

The present invention provides a computer-implemented method, computer system and computer program product for data compression. According to the computer-implemented method, one or more data blocks on a data source to be replicated to a data target may be detected. Then, compression performance of a first compression dictionary may be evaluated. The first compression dictionary may be previously used to compress existing data on the data target. If the compression performance is lower than a preset performance threshold, a second compression dictionary may be generated based on the existing data on the data target. The data target may be updated based on the existing data and the one or more data blocks using the second compression dictionary.

Aspects of the disclosure provide methods and apparatuses for neural network model compression/decompression. In some examples, an apparatus for neural network model decompression includes receiving circuitry and processing circuitry. The processing circuitry decodes, from a bitstream corresponding to a representation of a neural network, at least a syntax element to be applied to multiple blocks in the neural network. Then, the processing circuitry reconstructs, from the bitstream, weight coefficients in the blocks based on the syntax element.