Patent classifications
H03M7/3079
Compression of high dynamic ratio fields for machine learning
Various embodiments include methods and devices for implementing compression of high dynamic ratio fields. Various embodiments may include receiving a compression block having data units, receiving a mapping for the compression block, wherein the mapping is configured to map bits of each data unit to two or more data fields to generate a first set of data fields and a second set of data fields, compressing the first set of data fields together to generate a compressed first set of data fields, and compressing the second set of data fields together to generate a compressed second set of data fields.
SYSTEMS AND METHODS FOR PERFORMING BINARY ARITHMETIC CODING IN VIDEO CODING
This application is a national stage application of International Patent Application PCT/JP2019/018292, filed May 7, 2019, now published as WO/2019216324. International Patent Application PCT/JP2019/018292 claims the benefit of U.S. Provisional Patent Application 62/669,928, filed May 10, 2018 and U.S. Provisional Patent Application 62/692,327, filed Jun. 29, 2018. U.S. Provisional Patent Application 62/669,928, U.S. Provisional Patent Application 62/692,327 and International Patent Application PCT/JP2019/018292, now published as WO/2019216324, are incorporated herein by reference.
Some embodiments provide a method for subdividing an interval during entropy coding for a bitstream representing a set of video pictures. The method performs a bit-shifting operation on a probability estimator value. The method computes a sub-interval value by multiplying a range value representing the interval by the bit-shifted probability estimator value. The method uses the sub-interval value to update the interval.
Systems and methods for variable length codeword based, hybrid data encoding and decoding using dynamic memory allocation
A data encoding system includes a non-transitory memory, a processor, a digital-to-analog converter (DAC) and a transmitter. The non-transitory memory stores a predetermined file size threshold. The processor is in operable communication with the memory, and is configured to receive data. The processor detects a file size associated with the data. When the file size is below the predetermined file size threshold, the processor compresses the data using a variable length codeword (VLC) encoder. When the file size is not below the predetermined file size threshold, the processor compresses the data, using a hash table algorithm. The DAC is configured to receive a digital representation of the compressed data from the processor and convert the digital representation of the compressed data into an analog representation of the compressed data. The transmitter is coupled to the DAC and configured to transmit the analog representation of the compressed data.
COMPRESSION CONTEXT SETUP FOR DATA TRANSMISSION FOR IOT DEVICES
A method or enabling compression context setup for Internet-of-Thing, IoT, devices in a communication network is presented. The method is performed in an application server node for IoT devices, and includes sending a get context message to a gateway node, the get context message requesting a compression context setup includes compression details for an IoT device, receiving an indication of the requested compression context setup for the IoT device from the gateway node, and compressing and decompressing messages sent to and from the IoT device based on the received indication. An IoT device, a gateway node, an application node, a computer program and a computer program product thereof are also presented.
METHODS, SYSTEMS, AND MEDIA FOR PREDICTING FUNCTIONS OF MOLECULAR SEQUENCES
Methods and systems for predicting functions of molecular sequences, comprising: generating an array that represents a sequence of molecules; determining a projection of the sequence of molecules, wherein the determining comprises multiplying a representation of the array that represents the sequence of the molecules by a first hidden layer matrix that represents a number of possible sequence dependent functions, wherein the first hidden layer matrix is determined during training of a neural network; and determining a function of the sequence of molecules by applying a plurality of weights to a representation of the projection of the sequence of molecules, wherein the plurality of weights is determined during the training of the neural network.
ELECTRONIC DEVICE FOR EFFICIENTLY SAVING HISTORIC DATA OF AMBIENT SENSORS AND ASSOCIATED METHOD
A device includes sensing circuitry, compression circuitry, and a memory. The sensing circuitry, in operation, generates sensor data. The compression circuitry is coupled to the sensing circuitry, and, in operation, determines environmental contexts based on variation rates of sensor data and compresses sensor data based on determined environmental contexts. The compressed data is stored in the memory.
Quantizer determination, computer-readable medium and apparatus that implements at least two quantizers
A method for determining a second quantizer for quantizing digital images, wherein the second quantizer is determined for a specified number of levels, which is at least two. For the determination, a first quantizer with a lower number of levels than the specified one is taken into consideration. Furthermore, a method for coding an image comprising a plurality of pixels, a computer-readable medium, an apparatus, which implements at least two quantizers as a digital circuit and a digital camera with such an apparatus is disclosed.
Data compression method
An example method of compressing a data set includes determining whether individual values from a data set correspond to a first category or a second category of values. Based on one of the values corresponding to the first category, the value is added to a compressed data set. Based on one of the values corresponding to the second category, the value is excluded from the compressed data set, and a statistical distribution of values of the second category is updated based on the value. During a first phase, the determining is performed for a plurality of values from a first portion of the data set based on comparison of the values to criteria. During a second phase, the determining is performed for a plurality of values from a second portion of the data set based on the statistical distribution.
EFFICIENT CLUSTERING OF NOISY POLYNUCLEOTIDE SEQUENCE READS
A technique for clustering DNA reads from polynucleotide sequencing is described. DNA reads with a level of difference that is likely caused by errors in sequencing are grouped together in the same cluster. DNA reads that represent reads of different DNA molecules are placed in different clusters. The clusters are based on edit distance, which is the number of changes necessary to convert a given DNA read into another. The process of forming clusters may be performed iteratively and may use other types of distance that serve as an approximation for edit distance. Well clustered DNA reads provide a starting point for further analysis.
Driving data analyzer
In a driving data analyzer, a data collector collects, from at least one vehicle, driving data sequences while each of the driving data sequences is correlated with identification data. Each driving data sequence includes sequential driving data items, and each driving data item represents at least one of a driver's operation of at least one vehicle and a behavior of the at least one vehicle based on the at least one of a driver's operation. The identification data represents a type of at least one external factor that contributes to variations in the driving data items. A feature extractor applies a data compression network model to the driving data sequences to thereby extract, from the driving data sequences, at least one latent feature independently from the type of the at least one external factor.