ENCODED BLOCK FORMAT
    1.
    发明申请

    公开(公告)号:WO2018204768A1

    公开(公告)日:2018-11-08

    申请号:PCT/US2018/031061

    申请日:2018-05-04

    IPC分类号: G06F17/00 G06K9/36 H04L29/06

    摘要: Encoded (compressed) data in an encoded block format output by a data encoder, having an input including digital input elements from an input stream or file that are divided into blocks that contain Nb individual data elements per block. The encoded block format can include an index that, during decoding, supports random access. A decoder can losslessly decode the encoded block format. Each encoded block contains a header and a payload. The header specifies the unique characteristics of elements used by the payload to describe single-Byte or multi-Byte events that occurred in the input block. The encoded block format is generated by one or more block-oriented encoders (compressors). Blocks having the encoded block format may be consumed by one or more decoders (decompressors) that regenerate Nb elements from each decoded (uncompressed) block.

    A METHOD AND SYSTEM FOR COMPRESSING DATA
    3.
    发明申请

    公开(公告)号:WO2018103490A1

    公开(公告)日:2018-06-14

    申请号:PCT/CN2017/109890

    申请日:2017-11-08

    申请人: AUTHPAPER LIMITED

    发明人: LI, Chak Man

    IPC分类号: H03M7/30

    CPC分类号: H03M7/30 H03M7/3091

    摘要: A system and method for a non-transient computer readable medium containing program instructions for causing a computer to perform a method for compressing data comprising the steps of receiving a data string for compression, the data string including a plurality of data elements, creating a template based on processing the data string, the template including common information across all data elements of the data string, creating one or more entries, wherein the one or more entries include information that is different to the template, and storing the template and the one or more entries.

    POINT CLOUD DATA COMPRESSION USING A SPACE-FILLING CURVE

    公开(公告)号:WO2018094141A1

    公开(公告)日:2018-05-24

    申请号:PCT/US2017/062152

    申请日:2017-11-17

    申请人: GOOGLE LLC

    IPC分类号: H03M7/30

    摘要: Techniques of data compression involve ordering the points of a point cloud according to distance along a space-filling curve. Advantageously, a space-filling curve has the property that points close in distance along the curve are close together in Euclidean space. Thus, differences between points ordered by distance along such a curve, e.g., a Hilbert curve, will be close. When the curve is fractal, i.e., self-similar at all levels, the differences will be small even when the points are very unevenly clustered throughout the point cloud. Such small differences will provide greatly improved compression to the resulting delta-encoded set of points.

    METHOD AND APPARATUS FOR COMPRESSING A DATA SET USING INCREMENTAL DELTAS AND A VARIABLE REFERENCE VALUE
    5.
    发明申请
    METHOD AND APPARATUS FOR COMPRESSING A DATA SET USING INCREMENTAL DELTAS AND A VARIABLE REFERENCE VALUE 审中-公开
    使用增量DELTA和可变参考值压缩数据集的方法和设备

    公开(公告)号:WO2018034767A1

    公开(公告)日:2018-02-22

    申请号:PCT/US2017/042500

    申请日:2017-07-18

    申请人: INTEL CORPORATION

    IPC分类号: H03M7/30

    摘要: In one embodiment, an apparatus comprises a processor to receive a plurality of values of a data set, the data set comprising a first value, a second value, and a third value; calculate and store a first delta corresponding to the first value, wherein the first delta is equal to the difference between the first value and the second value; and calculate and store a second delta corresponding to the second value, wherein the second delta is equal to the difference between the second value and the third value.

    摘要翻译: 在一个实施例中,一种设备包括:处理器,用于接收数据集的多个值,所述数据集包括第一值,第二值和第三值; 计算并存储对应于所述第一值的第一增量,其中所述第一增量等于所述第一值与所述第二值之间的差; 并计算并存储对应于第二值的第二增量,其中第二增量等于第二值与第三值之间的差值。

    针对FASTQ数据的多线程快速存储无损压缩方法及其系统

    公开(公告)号:WO2017214765A1

    公开(公告)日:2017-12-21

    申请号:PCT/CN2016/085426

    申请日:2016-06-12

    申请人: 深圳大学

    IPC分类号: H03M7/30 G06F19/10

    CPC分类号: H03M7/30 G16B99/00

    摘要: 一种针对FASTQ数据的多线程快速存储无损压缩方法,应用于DNA序列的压缩,其中,所述方法包括:数据分类步骤:输入原始FASTQ数据,并将所述原始FASTQ数据的短读分成元数据、质量分数和碱基序列三个数据流(S11);数据压缩步骤:针对元数据,利用增量编码方式进行检测并消除元数据的冗余信息;针对质量分数,利用比特级别的PPM预测模型和算术编码进行压缩;针对碱基序列,利用固定阶位的改良型算术编码进行压缩(S12);数据输出步骤:将不同数据流的压缩结果进行归档合并,输出经过压缩后的最终数据(S13)。该方案能提高压缩效率和压缩速度。

    PROCESSING TRACING INFORMATION OF A RADIO SIGNAL
    7.
    发明申请
    PROCESSING TRACING INFORMATION OF A RADIO SIGNAL 审中-公开
    处理无线电信号的跟踪信息

    公开(公告)号:WO2017160429A1

    公开(公告)日:2017-09-21

    申请号:PCT/US2017/017291

    申请日:2017-02-10

    IPC分类号: H04L27/26 H04L25/49 H04L1/00

    CPC分类号: H04L1/00 H03M7/30 H04L5/0048

    摘要: A method of processing tracing information of a radio signal received via a radio channel is provided. The method may include determining the tracing information based on the radio signal, determining at least one channel parameter representing a radio channel condition of the radio channel, compressing the tracing information based on the determined at least one channel parameter, and storing the compressed tracing information in a memory.

    摘要翻译: 提供了一种处理经由无线电信道接收的无线电信号的跟踪信息的方法。 该方法可以包括:基于无线电信号确定跟踪信息;确定表示无线电信道的无线电信道状况的至少一个信道参数;基于确定的至少一个信道参数压缩跟踪信息;以及存储压缩的跟踪信息 在记忆中。

    一种可分离稀疏信号的压缩感知方法及其系统

    公开(公告)号:WO2017147774A1

    公开(公告)日:2017-09-08

    申请号:PCT/CN2016/075135

    申请日:2016-03-01

    申请人: 深圳大学

    IPC分类号: H03M7/30

    CPC分类号: H03M7/30

    摘要: 本发明提供了一种可分离稀疏信号的压缩感知方法,包括:对可分离稀疏信号进行信号分解,并在分解后得到多个不同基集下的稀疏信号分量;根据实际需求对部分或者全部稀疏信号分量分别进行压缩感知,以得到对应的压缩量测值。本发明还提供一种可分离稀疏信号的压缩感知系统。本发明打破了将信号视为单个基集稀疏信号的传统思路,而是把信号表示成多个不同基集下的稀疏信号分量之和的形式,扩大了可压缩感知信号和范围,信号分解后可根据需要对各稀疏分量单独进行压缩感知,从而提高后续处理过程中信号恢复的速度,并且使得处理过程更加灵活,扩展性更强。

    INCREMENTAL AUTOMATIC UPDATE OF RANKED NEIGHBOR LISTS BASED ON K-TH NEAREST NEIGHBORS
    9.
    发明申请
    INCREMENTAL AUTOMATIC UPDATE OF RANKED NEIGHBOR LISTS BASED ON K-TH NEAREST NEIGHBORS 审中-公开
    基于K-TH近邻的排序相邻列表的增量自动更新

    公开(公告)号:WO2017095413A1

    公开(公告)日:2017-06-08

    申请号:PCT/US2015/063702

    申请日:2015-12-03

    IPC分类号: G06F17/30 G06F17/00

    CPC分类号: G06F17/10 G06F17/30 H03M7/30

    摘要: Incremental automatic update of ranked neighbor lists based on k -th nearest neighbors is disclosed. One example is a system including an indexing module to retrieve an incoming data stream, and retrieve ranked neighbor lists for received data objects. An evaluator determines similarity measures between the received data objects and their respective k -th nearest neighbors. A threshold determination module determines a statistical distribution based on the determined similarity measures, and a threshold based on the statistical distribution. The evaluator determines additional similarity measures between a new data object in the data stream and the received data objects. A neighbor update module automatically selects a sub-plurality of the received data objects by comparing the additional similarity measures to the threshold, and determines, for each selected data object, if the respective retrieved neighbor list is to be incrementally updated based on neighborhood comparisons for the new data object and the selected data object.

    摘要翻译: 公开了基于第k个最近邻居的排序邻居列表的增量自动更新。 一个示例是包括索引模块以检索传入数据流并检索接收到的数据对象的经排名的邻居列表的系统。 评估者确定接收到的数据对象与它们各自的第k个最近邻居之间的相似性度量。 阈值确定模块基于所确定的相似性度量来确定统计分布,并且基于统计分布来确定阈值。 评估者确定数据流中的新数据对象与接收的数据对象之间的附加相似性度量。 邻居更新模块通过将附加相似性度量与阈值进行比较来自动选择子多个接收到的数据对象,并且针对每个选择的数据对象确定是否基于邻域比较逐步更新相应的所检索邻居列表 新数据对象和选定的数据对象。