公开(公告)号：US5467110A

公开(公告)日：1995-11-14

申请号：US589563

申请日：1990-09-28

申请人： James M. White ,  Vance Faber ,  Jeffrey S. Saltzman

发明人： James M. White ,  Vance Faber ,  Jeffrey S. Saltzman

IPC分类号： G09G5/06 ,  G09G1/28

CPC分类号： G09G5/06

摘要： An image population having a large number of attributes is processed to form a display population with a predetermined smaller number of attributes that represent the larger number of attributes. In a particular application, the color values in an image are compressed for storage in a discrete look-up table (LUT). Color space containing the LUT color values is successively subdivided into smaller volumes until a plurality of volumes are formed, each having no more than a preselected maximum number of color values. Image pixel color values can then be rapidly placed in a volume with only a relatively few LUT values from which a nearest neighbor is selected. Image color values are assigned 8 bit pointers to their closest LUT value whereby data processing requires only the 8 bit pointer value to provide 24 bit color values from the LUT.

摘要翻译： 处理具有大量属性的图像群体以形成具有表示较大数量的属性的预定较小数量的属性的显示群体。 在特定应用中，图像中的颜色值被压缩以便在离散查找表（LUT）中存储。 包含LUT颜色值的颜色空间被连续细分成更小的体积，直到形成多个体积，每个体积不超过预选的最大颜色值数。 然后可以将图像像素颜色值快速放置在仅具有相对较少的LUT值的卷中，从其中选择最近邻。 图像颜色值被分配到它们最接近的LUT值的8位指针，由此数据处理仅需要8位指针值来从LUT提供24位颜色值。

公开(公告)号：US07508991B2

公开(公告)日：2009-03-24

申请号：US11748462

申请日：2007-05-14

申请人： Vance Faber ,  Randall L. Dougherty

发明人： Vance Faber ,  Randall L. Dougherty

IPC分类号： G06K9/36 ,  G06K9/46

CPC分类号： H04N19/63 ,  G06F17/14 ,  H04N19/42

摘要： A method of generating a sequence of matrix factors for a transformation matrix having a plurality of rows and columns using a computer, wherein the transformation matrix stores data values representing a wavelet transform. In a first aspect, at least one plurality of row reduction operations are applied to the transformation matrix. The sequence of matrix factors is generated from the reduced transformation matrix and the row reduction operations. A scaling factor may be removed from the transformation matrix before applying the row reduction operations, wherein the scaled transformation matrix has a determinant with a coefficient equal to 1 or −1. In yet another aspect, the transformation matrix may have a nonzero monomial determinant and the sequence of matrix factors further includes a scaling matrix. The method may include further alternative features described herein.

摘要翻译： 一种使用计算机生成具有多个行和列的变换矩阵的矩阵因子序列的方法，其中所述变换矩阵存储表示小波变换的数据值。 在第一方面，将至少多个行缩小操作应用于变换矩阵。 矩阵因子的序列是从减小的变换矩阵和行减少运算生成的。 在应用行缩减操作之前，可以从变换矩阵中去除缩放因子，其中缩放的变换矩阵具有系数等于1或-1的行列式。 在另一方面，变换矩阵可以具有非零单项式行列式，并且矩阵因子的序列还包括缩放矩阵。 该方法可以包括本文所述的另外的替代特征。

公开(公告)号：US20070211952A1

公开(公告)日：2007-09-13

申请号：US11748464

申请日：2007-05-14

申请人： Vance Faber ,  Randall Dougherty

发明人： Vance Faber ,  Randall Dougherty

IPC分类号： G06K9/36

CPC分类号： H04N19/63 ,  G06F17/14 ,  H04N19/42

摘要： A method of generating matrix factors for a finite-dimensional linear transform using a computer. The linear transform is represented by data values stored in a linear transformation matrix having a nonzero determinant. In one aspect, a first LU-decomposition is applied to the linear transformation matrix. Four matrices are generated from the LU-decomposition, including a first permutation matrix, a second permutation matrix, a lower triangular matrix having a unit diagonal, and a first upper triangular matrix. Additional elements include a third matrix Â, a signed permutation matrix Π such that A=ΠÂ, a permuted linear transformation matrix A′, a second upper triangular matrix U1, wherein the second upper triangular matrix satisfies the relationship Â=U1A′. The permuted linear transformation matrix is factored into a product including a lower triangular matrix L and an upper triangular matrix U. The linear transformation matrix is expressed as a product of the matrix factors.

摘要翻译： 使用计算机生成有限维线性变换的矩阵因子的方法。 线性变换由存储在具有非零行列式的线性变换矩阵中的数据值表示。 在一个方面，将第一LU分解应用于线性变换矩阵。 从LU分解生成四个矩阵，包括第一置换矩阵，第二置换矩阵，具有单位对角线的下三角矩阵和第一上三角矩阵。 附加元素包括第三矩阵，有符号置换矩阵Pi，使得A = Pi，置换的线性变换矩阵A'，第二上三角矩阵U 1，其中第二上三角矩阵满足 关系Â= U <1> 。 将置换的线性变换矩阵考虑到包括下三角矩阵L和上三角矩阵U的乘积中。线性变换矩阵表示为矩阵因子的乘积。

公开(公告)号：US07454084B2

公开(公告)日：2008-11-18

申请号：US11748464

申请日：2007-05-14

申请人： Vance Faber ,  Randall L. Dougherty

发明人： Vance Faber ,  Randall L. Dougherty

IPC分类号： G06K9/36 ,  G06K9/46

CPC分类号： H04N19/63 ,  G06F17/14 ,  H04N19/42

摘要： A method of generating matrix factors for a finite-dimensional linear transform using a computer. The linear transform is represented by data values stored in a linear transformation matrix having a nonzero determinant. In one aspect, a first LU-decomposition is applied to the linear transformation matrix. Four matrices are generated from the LU-decomposition, including a first permutation matrix, a second permutation matrix, a lower triangular matrix having a unit diagonal, and a first upper triangular matrix. Additional elements include a third matrix Â, a signed permutation matrix Π such that A=ΠÂ, a permuted linear transformation matrix A′, a second upper triangular matrix U1, wherein the second upper triangular matrix satisfies the relationship Â=U1A′. The permuted linear transformation matrix is factored into a product including a lower triangular matrix L and an upper triangular matrix U. The linear transformation matrix is expressed as a product of the matrix factors.

摘要翻译： 使用计算机生成有限维线性变换的矩阵因子的方法。 线性变换由存储在具有非零行列式的线性变换矩阵中的数据值表示。 在一个方面，将第一LU分解应用于线性变换矩阵。 从LU分解生成四个矩阵，包括第一置换矩阵，第二置换矩阵，具有单位对角线的下三角矩阵和第一上三角矩阵。 附加元素包括第三矩阵，有符号置换矩阵Pi，使得A = Pi，置换的线性变换矩阵A'，第二上三角矩阵U 1，其中第二上三角矩阵满足 关系Â= U <1> 。 将置换的线性变换矩阵考虑到包括下三角矩阵L和上三角矩阵U的乘积中。线性变换矩阵表示为矩阵因子的乘积。

公开(公告)号：US20070211951A1

公开(公告)日：2007-09-13

申请号：US11748462

申请日：2007-05-14

申请人： Vance Faber ,  Randall Dougherty

发明人： Vance Faber ,  Randall Dougherty

IPC分类号： G06K9/36

CPC分类号： H04N19/63 ,  G06F17/14 ,  H04N19/42

摘要： A method of generating a sequence of matrix factors for a transformation matrix having a plurality of rows and columns using a computer, wherein the transformation matrix stores data values representing a wavelet transform. In a first aspect, at least one plurality of row reduction operations are applied to the transformation matrix. The sequence of matrix factors is generated from the reduced transformation matrix and the row reduction operations. A scaling factor may be removed from the transformation matrix before applying the row reduction operations, wherein the scaled transformation matrix has a determinant with a coefficient equal to 1 or −1. In yet another aspect, the transformation matrix may have a nonzero monomial determinant and the sequence of matrix factors further includes a scaling matrix. The method may include further alternative features described herein.

摘要翻译： 一种使用计算机生成具有多个行和列的变换矩阵的矩阵因子序列的方法，其中所述变换矩阵存储表示小波变换的数据值。 在第一方面，将至少多个行缩小操作应用于变换矩阵。 矩阵因子的序列是从减小的变换矩阵和行减少运算生成的。 在应用行缩减操作之前，可以从变换矩阵中去除缩放因子，其中缩放的变换矩阵具有系数等于1或-1的行列式。 在另一方面，变换矩阵可以具有非零单项式行列式，并且矩阵因子的序列还包括缩放矩阵。 该方法可以包括本文所述的另外的替代特征。

公开(公告)号：US20050246105A1

公开(公告)日：2005-11-03

申请号：US11044395

申请日：2005-01-27

申请人： Vance Faber ,  John Elling

发明人： Vance Faber ,  John Elling

IPC分类号： G01N33/48 ,  G01N33/50 ,  G06F19/24 ,  G06F19/00

CPC分类号： G01N33/5091 ,  G01N33/5026 ,  G16B40/00

摘要： Systems and methods are provided for characterizing a multidimensional distribution of responses from the objects in a populations subject to a perturbation. The methods enable the creation of a “degree of response” scale interpolated from non-perturbed and perturbed reference populations. The methods enables, using the interpolated degree of response scale, the quantitation of a degree of response of a test compound subject to a given level of perturbation, and enables the generation of a dose-response curve for a test compound. The methods are useful in a wide range of applications, such cellular analysis and high-content screening of compounds, as carried out in pharmaceutical research.

摘要翻译： 提供了系统和方法，用于表征受到扰动的群体中来自对象的响应的多维分布。 这些方法使得能够创建从非扰动和扰动参考群体内插的“响应程度”。 这些方法能够使用内插的响应量表来量化给定水平的扰动的受试化合物的响应程度，并且能够产生测试化合物的剂量 - 反应曲线。 这些方法可用于广泛的应用，如药物研究中进行的细胞分析和化合物的高含量筛选。

公开(公告)号：US5130701A

公开(公告)日：1992-07-14

申请号：US350675

申请日：1989-05-12

申请人： James M. White ,  Vance Faber ,  Jeffrey S. Saltzman

发明人： James M. White ,  Vance Faber ,  Jeffrey S. Saltzman

IPC分类号： G09G5/06

CPC分类号： G09G5/06

摘要： An image population having a large number of attributes is processed to form a display population with a predetermined smaller number of attributes which represent the larger number of attributes. In a particular application, the color values in an image are compressed for storage in a discrete lookup table (LUT) where an 8-bit data signal is enabled to form a display of 24-bit color values. The LUT is formed in a sampling and averaging process from the image color values with no requirement to define discrete Voronoi regions for color compression. Image color values are assigned 8-bit pointers to their closest LUT value whereby data processing requires only the 8-bit pointer value to provide 24-bit color values from the LUT.

摘要翻译： 处理具有大量属性的图像群体以形成具有表示较大数量属性的预定较小数量的属性的显示群体。 在特定应用中，图像中的颜色值被压缩以存储在离散查找表（LUT）中，其中8位数据信号被使能以形成24位色彩值的显示。 LUT根据图像颜色值在采样和平均处理中形成，而不需要定义用于颜色压缩的离散Voronoi区域。 图像颜色值被分配到它们最接近的LUT值的8位指针，由此数据处理仅需要8位指针值来从LUT提供24位颜色值。

公开(公告)号：US5125076A

公开(公告)日：1992-06-23

申请号：US488445

申请日：1990-02-27

申请人： Vance Faber ,  James W. Moore

发明人： Vance Faber ,  James W. Moore

IPC分类号： G06F15/16 ,  G06F15/173 ,  G06F15/177 ,  G06F15/80

CPC分类号： G06F15/17343

摘要： A network of interconnected processors is formed from a vertex symmetric graph selected from graphs .GAMMA..sub.d (k) with degree d, diameter k, and (d+1)!/(d-k+1)! processors for each d.gtoreq.k and .GAMMA..sub.d (k,-1) with degree 3-1, diameter k+1, and (d+1)!/(d-k+1)! processors for each d.gtoreq.k.gtoreq.4. Each processor has an address formed by one of the permutations from a predetermined sequence of letters chosen a selected number of letters at a time, and an extended address formed by appending to the address the remaining ones of the predetermined sequence of letters. A plurality of transmission channels is provided from each of the processors, where each processor has one less channel than the selected number of letters forming the sequence. Where a network .GAMMA..sub.d (k,-1) is provided, no processor has a channel connected to form an edge in a direction .delta..sub.1. Each of the channels has an identification number selected from the sequence of letters and connected from a first processor having a first extended address to a second processor having a second address formed from a second extended address defined by moving to the front of the first extended address the letter found in the position within the first extended address defined by the channel identification number. The second address is then formed by selecting the first elements of the second extended address corresponding to the selected number used to form the address permutations.

摘要翻译： 互连处理器的网络由从d，直径k，（d + 1），（d-k + 1）的图形GAMMA d（k）的顶点对称图形成。 每个d> / = k的处理器和具有度数3-1，直径k + 1和（d + 1）！/（d-k + 1）的GAMMA d（k，-1）！ 每个d> / = k> / = 4的处理器。 每个处理器具有通过从一次选定的一定数量的字母的预定字母序列中的一个排列形成的地址，以及通过附加到地址而形成的扩展地址，其中剩余的一个字母的预定序列。 从每个处理器提供多个传输通道，其中每个处理器具有比形成该序列的选定数量的字母少一个通道。 在提供网络GAMMA d（k，-1）的情况下，没有处理器具有连接以形成方向delta 1的边缘的信道。每个信道具有从字母序列中选择并从第一处理器 具有第一扩展地址到具有第二地址的第二处理器，所述第二地址由第二扩展地址形成，所述第二扩展地址通过在由所述信道标识号定义的所述第一扩展地址内的位置中移动到所述第一扩展地址的前面而定义。 然后通过选择与用于形成地址排列的所选择的数字相对应的第二扩展地址的第一元素来形成第二地址。

公开(公告)号：US07218789B2

公开(公告)日：2007-05-15

申请号：US10006999

申请日：2001-12-03

申请人： Vance Faber ,  Randall L. Dougherty

发明人： Vance Faber ,  Randall L. Dougherty

IPC分类号： G06K9/36 ,  G06K9/46 ,  G09G5/00 ,  G06F17/14

CPC分类号： H04N19/63 ,  G06F17/14 ,  H04N19/42

摘要： A method for generating a first plurality of output data values and the matrix factors used to generate an approximation to an image processing transform is disclosed. The first plurality of output data values are generated by transforming a plurality of input data values using a computer and applying a modified transform stored in a modified transformation matrix to the plurality of input data values. The plurality of input data values are stored in a generated matrix, and at least one data value in this matrix is rearranged using a permutation operation and modified by applying a linear combination of the unmodified values to the at least one data value. The modified transform is an approximation to a known transform stored in a transformation matrix that is used to generate a second plurality of output data values, the first plurality of output values approximating the second plurality of output data values. The modified transformation matrix is generated from a plurality of matrix factors that are generated by factoring the transformation matrix. The known transform and the modified transform approximating the known transform map the same integer data in the plurality of input data values to the same plurality of integer output data values.

摘要翻译： 公开了一种用于产生第一多个输出数据值的方法和用于产生对图像处理变换的近似的矩阵因子。 通过使用计算机变换多个输入数据值并将存储在修改的变换矩阵中的修改变换应用于多个输入数据值来生成第一多个输出数据值。 多个输入数据值被存储在生成的矩阵中，并且使用置换操作来重新排列该矩阵中的至少一个数据值，并通过将未修改的值的线性组合应用于至少一个数据值来进行修改。 经修改的变换是存储在变换矩阵中的已知变换的近似值，该变换矩阵用于生成第二多个输出数据值，第一多个输出值近似第二多个输出数据值。 经修改的变换矩阵是通过对转换矩阵进行分解而产生的多个矩阵因子生成的。 已知变换和已知变换近似的修正变换将多个输入数据值中的相同整数数据映射到相同的多个整数输出数据值。

公开(公告)号：US5369745A

公开(公告)日：1994-11-29

申请号：US860391

申请日：1992-03-30

申请人： Vance Faber

发明人： Vance Faber

IPC分类号： G06F15/173 ,  G06F13/372

CPC分类号： G06F15/17381

摘要： Livelock-free message routing is provided in a network of interconnected nodes that is flushable in time T. An input message processor generates sequences of at least N time intervals, each of duration T. An input register provides for receiving and holding each input message, where the message is assigned a priority state p during an nth one of the N time intervals. At each of the network nodes a message processor reads the assigned priority state and awards priority to messages with priority state (p-1) during an nth time interval and to messages with priority state p during an (n+1) th time interval. The messages that are awarded priority are output on an output path toward the addressed output message processor. Thus, no message remains in the network for a time longer than T.

摘要翻译： 在不间断的可互连节点的网络中提供无锁定消息路由。输入消息处理器生成至少N个时间间隔的序列，每个时间间隔为持续时间T。输入寄存器提供接收和保持每个输入消息， 其中消息在N个时间间隔中的第n个中被分配优先级状态p。 在每个网络节点处，消息处理器读取分配的优先级状态，并且在第（n + 1）个时间间隔期间，在第n个时间间隔期间向具有优先级状态（p-1）的消息和优先级状态p的消息授予优先级。 被授予优先级的消息在输出路径上输出到寻址的输出消息处理器。 因此，网络中没有消息长于T的时间。