PREDICTING LUNG CANCER SURVIVAL USING GENE EXPRESSION
    52.
    发明申请
    PREDICTING LUNG CANCER SURVIVAL USING GENE EXPRESSION 有权
    使用基因表达预测肺癌存活

    公开(公告)号:US20100267574A1

    公开(公告)日:2010-10-21

    申请号:US12445596

    申请日:2007-10-19

    IPC分类号: C12Q1/68 C40B30/04 C40B40/06

    摘要: The present invention provides a plurality of biomarkers for predicting survival of a subject with a lung cancer. More specifically, the present invention relates to methods of predicting survival of a subject with a lung cancer, a kit for predicting survival of a subject with a lung cancer, and an array for predicting survival of a subject with lung cancer.

    摘要翻译: 本发明提供了用于预测患有肺癌的受试者的存活的多种生物标志物。 更具体地,本发明涉及预测患有肺癌的受试者的存活的方法,用于预测患有肺癌的受试者的存活的试剂盒以及用于预测患有肺癌的受试者的存活的阵列。

    LAYERED TEXTURE COMPRESSION ARCHITECTURE
    53.
    发明申请
    LAYERED TEXTURE COMPRESSION ARCHITECTURE 有权
    层叠式压缩架构

    公开(公告)号:US20090315905A1

    公开(公告)日:2009-12-24

    申请号:US12141094

    申请日:2008-06-18

    IPC分类号: G06T9/00

    CPC分类号: G06T15/04 H04N19/13 H04N19/60

    摘要: Various technologies for a layered texture compression architecture. In one implementation, the layered texture compression architecture may include a texture consumption pipeline. The texture compression pipeline may include a processor, memory devices, and textures compressed at varying ratios of compression. The textures within the pipeline may be compressed at ratios in accordance with characteristics of the devices in the pipeline that contains and processes the textures.

    摘要翻译: 各种技术用于分层纹理压缩架构。 在一个实现中,分层纹理压缩架构可以包括纹理消耗流水线。 纹理压缩管线可以包括以不同的压缩比压缩的处理器,存储器件和纹理。 可以根据流水线中包含和处理纹理的设备的特性,以比例压缩流水线内的纹理。

    Method for obtaining image reference block in a code of mode of fixed reference frame number
    54.
    发明申请
    Method for obtaining image reference block in a code of mode of fixed reference frame number 有权
    用于在固定参考帧号的模式码中获取图像参考块的方法

    公开(公告)号:US20090304083A1

    公开(公告)日:2009-12-10

    申请号:US10584777

    申请日:2004-07-08

    IPC分类号: H04N7/26

    CPC分类号: H04N19/577

    摘要: The present invention discloses a “rounding to zero” method which can maintain the exact motion vector and can also be achieved by the method without division so as to improve the precision of calculating the motion vector, embody the motion of the object in video more factually, and obtain the more accurate motion vector prediction. Combining with the forward prediction coding and the backward prediction coding, the present invention realizes a new prediction coding mode, which can guarantee the high efficiency of coding in direct mode as well as is convenient for hardware realization, and gains the same effect as the conventional B frame coding.

    摘要翻译: 本发明公开了一种“舍入到零”方法,其可以保持精确的运动矢量,并且还可以通过不分割的方法来实现,以便提高计算运动矢量的精度,更实际地体现视频中的对象的运动 ,并获得更准确的运动矢量预测。 结合前向预测编码和后向预测编码,本发明实现了一种新的预测编码模式,可以保证直接模式下的编码效率高,便于硬件实现,并获得与常规编码相同的效果 B帧编码。

    Textual Image Coding
    56.
    发明申请
    Textual Image Coding 有权
    文字图像编码

    公开(公告)号:US20090074307A1

    公开(公告)日:2009-03-19

    申请号:US11855075

    申请日:2007-09-13

    IPC分类号: G06T9/00 G06K9/36

    摘要: Textual image coding involves coding textual portions of an image. In an example embodiment, a textual block of an image is decomposed into multiple base colors and an index map, with the index map having index values that each reference a base color so as to represent the textual block. A set of neighbor index values are ascertained for a particular index of the index map. A context that matches the neighbor index values is generated from among multiple contexts. The matching context includes a set of symbols. At least one symbol-to-value mapping is determined based on the matching context and a symbol to which the particular index corresponds. The particular index is remapped to a particular value in accordance with the symbol-to-value mapping and the symbol to which the particular index corresponds.

    摘要翻译: 文本图像编码涉及对图像的文本部分进行编码。 在示例实施例中,图像的文本块被分解为多个基色和索引图,索引图具有每个引用基色以便表示文本块的索引值。 确定索引图的特定索引的一组邻近索引值。 从多个上下文中生成匹配邻居索引值的上下文。 匹配的上下文包括一组符号。 基于匹配上下文和特定索引对应的符号来确定至少一个符号到值映射。 根据符号对值映射和特定索引对应的符号将特定索引重新映射到特定值。

    Wyner-Ziv Coding with Multiple Side Information
    57.
    发明申请
    Wyner-Ziv Coding with Multiple Side Information 有权
    Wyner-Ziv编码与多边信息

    公开(公告)号:US20080291065A1

    公开(公告)日:2008-11-27

    申请号:US12047317

    申请日:2008-03-12

    IPC分类号: H03M7/00

    摘要: A Wyner-Ziv coding scheme jointly utilizes multiple side information at the decoder is described. A new probability model is introduced based on an extended turbo decoding trellis, so that the transitional probability is calculated from the probabilities conditioned on multiple side information. The proposed scheme handles multiple side information in a multi-dimensional manner to potentially achieve coding performance better than either selecting one side information or generating a single side information by averaging several side information. When the decoder receives multiple streams of parity bits, the conditional probabilities on the parity bits from the multiple streams all contribute in turbo decoding. The errors existing in some of the streams can be automatically eliminated during the decoding process.

    摘要翻译: 描述了在解码器处共同利用多边信息的Wyner-Ziv编码方案。 基于扩展turbo解码网格引入新的概率模型,从而根据多边信息的概率计算过渡概率。 所提出的方案以多维方式处理多个侧面信息,以便比选择一个侧面信息或通过平均多个边缘信息来生成单个侧面信息来潜在地实现编码性能。 当解码器接收到多个奇偶校验位流时,来自多个流的奇偶校验位的条件概率在turbo解码中都有贡献。 在解码过程中可以自动消除一些流中存在的错误。

    Bitstream Switching in Multiple Bit-Rate Video Streaming Environments
    59.
    发明申请
    Bitstream Switching in Multiple Bit-Rate Video Streaming Environments 有权
    多比特率视频流环境中的比特流切换

    公开(公告)号:US20080046939A1

    公开(公告)日:2008-02-21

    申请号:US11460217

    申请日:2006-07-26

    IPC分类号: H04N7/173

    摘要: Bitstream switching for multiple bit rate video streaming uses a first algorithm to generate multiple encoded bitstreams of a piece of video at different bit rates. A different algorithm is used to generate multiple side bitstreams of the video. Each side stream is generated at respective ones of the different bit rates. The side bitstreams comprise switching frames to switch from a first bitstream encoded with the first algorithm at a first bit rate to a second bitstream encoded with the first algorithm at a different bit rate. At non-bitstream switching points, frames from respective ones of bitstreams generated with the first algorithm are streamed for presentation. At a bitstream switching point, a switching frame from a respective side bitstream is transmitted to a decoder to transition streaming from a first of the respective ones of the bitstreams to a second of the respective ones of the bitstreams.

    摘要翻译: 用于多比特率视频流的比特流切换使用第一算法以不同比特率生成一段视频的多个编码比特流。 使用不同的算法来生成视频的多边比特流。 每个侧流以不同比特率的相应的一个生成。 侧比特流包括切换帧,以从第一比特流编码的第一比特流以第一比特率切换到以不同比特率编码的第一比特率的第二比特流。 在非比特流切换点,利用第一算法生成的来自相应比特流的帧被流传输以便呈现。 在比特流切换点,来自相应侧比特流的切换帧被发送到解码器,以将流从各个比特流中的第一个流转换到相应比特流中的第二个。

    Computation Scheduling and Allocation for Visual Communication
    60.
    发明申请
    Computation Scheduling and Allocation for Visual Communication 有权
    视觉通信的计算调度和分配

    公开(公告)号:US20080013628A1

    公开(公告)日:2008-01-17

    申请号:US11457705

    申请日:2006-07-14

    IPC分类号: H04N7/12

    摘要: Computation scheduling and allocation for visual communication is described. In one aspect, multiple frames of video data are encoded by allocating for at least a subset of inter-coded frames, on frame-by-frame basis, computational resources to encode the inter-coded frame. To this end, a computational budget to encode a current inter-coded frame is estimated. The estimate is based on the actual computational costs to encode a previous inter-coded frame of video data. Next, sets of operations associated with encoding the current inter-coded frame are analyzed to determine computational resources to implement the operations. If the computational resources exceed the computational budget, complexity of the operations is reduced until the associated computational resources are less than or equal to the computational budget. At this point, the current inter-coded frame is encoded using the operations and the computational budget. This process is repeated for the remaining inter-coded frames of video data.

    摘要翻译: 描述视觉通信的计算调度和分配。 在一个方面,通过在逐帧的基础上为帧间编码帧的至少一个子集分配计算资源来编码帧间编码帧来编码多个视频数据帧。 为此,估计用于编码当前帧间编码帧的计算预算。 该估计是基于对先前的视频数据的帧间编码帧进行编码的实际计算成本。 接下来,分析与当前帧间编码帧的编码相关联的操作集合,以确定用于实现操作的计算资源。 如果计算资源超过计算预算,则减少操作的复杂度,直到相关的计算资源小于或等于计算预算。 此时,使用操作和计算预算对当前帧间编码帧进行编码。 对于视频数据的剩余帧间编码帧重复该过程。