会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • Method and apparatus for display synchronization using image compression
    • 使用图像压缩显示同步的方法和装置
    • US20090119365A1
    • 2009-05-07
    • US12288448
    • 2008-10-20
    • Ratko V. Tomic
    • Ratko V. Tomic
    • G06F15/16
    • H04L67/1095G06F3/1462G09G5/346G09G2340/02H04L69/04
    • Methods and apparatuses for synchronizing displays of a local and a remote device using image compression to achieve efficiency gains are disclosed. A local device requests an update for a particular requested region of a remote device's display, receives an update region which is a portion of the requested region, and updates a stored local representation of the remote display based on the update region. A remote device compares, upon a request from a local device for an update, portions of the old and new stored images corresponding to the requested region. Compared pixels are then encoded to yield an update region and transmitted to the local device. In the encoding, pixels which changed between the old image and the new image are encoded opaque and with the color corresponding to the pixels in the new image, and at least one pixel which did not change between the old image and the new image is encoded transparent.
    • 公开了使用图像压缩来同步本地和远程设备的显示以实现效率增益的方法和装置。 本地设备请求对远程设备显示器的特定请求区域的更新,接收作为所请求区域的一部分的更新区域,并且基于更新区域更新存储的远程显示器的本地表示。 远程设备根据来自本地设备的更新的请求比较对应于所请求的区域的旧的和新的存储的图像的部分。 然后对比像素进行编码以产生更新区域并传输到本地设备。 在编码中,在旧图像和新图像之间变化的像素被编码为不透明并且具有与新图像中的像素对应的颜色,并且在旧图像和新图像之间未改变的至少一个像素被编码 透明。
    • 4. 发明授权
    • Fast, practically optimal entropy coding
    • 快速,实际最佳的熵编码
    • US07161507B2
    • 2007-01-09
    • US11015894
    • 2004-12-17
    • Ratko V. Tomic
    • Ratko V. Tomic
    • H03M7/34
    • H03M7/40
    • An enumerator employs “indexing volumes” as the add-on values used to compute indexes for n-item ordered sets such as symbol sequences. Each indexing volume is associated with a different class into which the allowed ordered sets are partitioned. The indexing volumes all equal or exceed the number of ordered sets that belong to their respective classes. Additionally, the indexing volume Vi associated with a given class of i-item equals or exceeds the sum of the indexing volumes associated with the classes that contain the (i−1)-item prefixes of the ordered sets that belong to the given class. The indexing volumes are quantized such that each volume V=wrs, where r is an integer greater than unity, s is a non-negative integer, w is a positive integer less than rm, m is some positive integer less than h, and, for some allowed ordered set whose size is less than n, h is the number of radix-r digits in the smallest quotient that results from evenly dividing by a positive-integer power of r the set count of the class to which that allowed ordered set belongs. As a result, the addition operations used to compute the indexes can be performed with limited precision, and storage requirements for the add-on values can be relatively modest.
    • 枚举器使用“索引卷”作为用于计算诸如符号序列的n项有序集的索引的附加值。 每个索引卷与允许的有序集分隔的不同类相关联。 索引卷都等于或超过属于其各自类的有序集的数量。 另外,与给定类别的i项相关联的索引卷V i i等于或超过与包含订购的(i-1)个前缀的类相关联的索引卷的总和 属于给定类的集合。 量化分度量,使得每个体积V = wr S,其中r是大于1的整数,s是非负整数,w是小于r的正整数 ,m是小于h的一些正整数,对于大小小于n的一些允许有序集,h是最小商数中的基数r数, r的整数幂是允许有序集所属的类的集合计数。 因此,用于计算索引的加法运算可以以有限的精度执行,附加值的存储要求可以相对适中。
    • 5. 发明授权
    • Modeling for enumerative encoding
    • 枚举编码建模
    • US07265691B2
    • 2007-09-04
    • US11473940
    • 2006-06-23
    • Ratko V. Tomic
    • Ratko V. Tomic
    • H03M7/30
    • H03M7/40
    • Entropy encoders and decoders employ an entropy-pump operation. The entropy-pump operation includes classifying blocks of the input sequence's symbols in accordance with the probabilities of occurrence of those blocks' values. Entropy coding an output component that represents the sequence of classes to which the blocks belong tends to be profitable, because that component has an entropy density less than that of the input sequence. In contrast, little opportunity for compression tends to be lost by not entropy encoding an output component that represents the values of the blocks that belong to single class, because those values' probabilities of occurrence are similar.
    • 熵编码器和解码器采用熵泵操作。 熵泵操作包括根据这些块值的出现概率对输入序列符号的块进行分类。 熵编码表示块所属类别序列的输出分量倾向于有利可图,因为该分量的熵密度小于输入序列的熵密度。 相比之下,由于这些值的出现概率是相似的,所以通过对代表属于单个类的块的值的输出组件不进行熵编码,往往容易失去压缩的机会。