Method and apparatus for improving low-light performance for small pixel image sensors
    2.
    发明申请
    Method and apparatus for improving low-light performance for small pixel image sensors 有权
    用于改善小像素图像传感器的低光性能的方法和装置

    公开(公告)号:US20080278591A1

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

    申请号:US11798010

    申请日:2007-05-09

    IPC分类号: H04N5/235

    摘要: Method and apparatuses processing pixel values from a captured image include receiving an array of digital pixel values corresponding to a captured image, and computing a rolling sum of the array of pixel values. Computing a rolling sum includes selecting successive groupings of the pixel values, each grouping comprising N×M pixel values, summing pixel values in each of the successive groupings, and forming an output image using the summed pixel values.

    摘要翻译: 从捕获图像处理像素值的方法和装置包括:接收与捕获图像相对应的数字像素值阵列,以及计算像素值阵列的滚动和。 计算滚动和包括选择像素值的连续分组,每个分组包括N×M个像素值,对每个连续分组中的像素值求和,并使用相加的像素值形成输出图像。

    Memory efficient representation of relational data with constant time random access to the data itself
    3.
    发明授权
    Memory efficient representation of relational data with constant time random access to the data itself 有权
    关键数据的内存有效表示,具有对数据本身的持续时间随机访问

    公开(公告)号:US08819089B2

    公开(公告)日:2014-08-26

    申请号:US12205562

    申请日:2008-09-05

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30595

    摘要: An efficient method for storing relational data in a memory space uses B tree and B+ tree structures to store data for a database where non-identical values are stored in a string buffer and pointers to the string buffer are stored in a table buffer, and where identical data is stored only once, and each instance of that value in the database is referenced by a pointer to such identical data corresponding to the locations in the database where that identical value exists, thereby preserving physical memory and increasing the storage capacity of a fixed memory space.

    摘要翻译: 用于将关系数据存储在存储器空间中的有效方法使用B树和B +树结构存储数据库中的数据,其中不相同的值存储在字符串缓冲器中,并且指向字符串缓冲器的指针存储在表缓冲器中,并且其中 相同的数据仅存储一次,并且数据库中该值的每个实例被指向与这些相同值存在的数据库中的位置相对应的相同数据的指针引用,从而保留物理存储器并增加固定的存储容量 内存空间。

    MEMORY EFFICIENT REPRESENTATION OF RELATIONAL DATA WITH CONSTANT TIME RANDOM ACCESS TO THE DATA ITSELF
    4.
    发明申请
    MEMORY EFFICIENT REPRESENTATION OF RELATIONAL DATA WITH CONSTANT TIME RANDOM ACCESS TO THE DATA ITSELF 有权
    记录有效地表示数据随时随地访问数据库

    公开(公告)号:US20090063523A1

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

    申请号:US12205562

    申请日:2008-09-05

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30595

    摘要: An efficient method for storing relational data in a memory space uses B tree and B+ tree structures to store data for a database where non-identical values are stored in a string buffer and pointers to the string buffer are stored in a table buffer, and where identical data is stored only once, and each instance of that value in the database is referenced by a pointer to such identical data corresponding to the locations in the database where that identical value exists, thereby preserving physical memory and increasing the storage capacity of a fixed memory space.

    摘要翻译: 用于将关系数据存储在存储器空间中的有效方法使用B树和B +树结构存储数据库中的数据,其中不相同的值存储在字符串缓冲器中,并且指向字符串缓冲器的指针存储在表缓冲器中,并且其中 相同的数据仅存储一次,并且数据库中该值的每个实例被指向与这些相同值存在的数据库中的位置相对应的相同数据的指针引用,从而保留物理存储器并增加固定的存储容量 内存空间。