会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 22. 发明授权
    • Method and system for secure key exchange
    • 用于安全密钥交换的方法和系统
    • US06898288B2
    • 2005-05-24
    • US10154795
    • 2002-05-23
    • Charles K. Chui
    • Charles K. Chui
    • H04K1/00H04L9/08H04L9/30H04L9/00
    • H04L9/088H04K1/00H04N19/635
    • A method for secure transmission of a data message locks, at the sender, the data message using a first lock. The locked data message is transmitted to the receiver. Next, the locked data message is double-locked, at the receiver, using a second lock. Then, this double-locked data message is transmitted back to the sender. The first lock of the double-locked data message is then unlocked, at the sender, using a first key, leaving the data message single-locked by the second lock. The single-locked data message is transmitted back to the receiver, where the second lock of the single-locked data message is unlocked, using a second key, to generate the data message, completing the secure transmission.
    • 用于数据消息的安全传输的方法使用第一锁在发送者处锁定数据消息。 锁定的数据消息被发送到接收器。 接下来,锁定的数据消息被双锁定,在接收器处,使用第二个锁。 然后,这个双重锁定的数据消息被发送回发送方。 然后,使用第一个密钥解锁双锁定数据消息的第一个锁定,在发件人处,将数据消息单独锁定在第二个锁上。 单锁数据消息被发送回接收机,其中使用第二密钥解锁单锁定数据消息的第二锁定,以产生数据消息,完成安全传输。
    • 23. 发明授权
    • System and method for encoding video data using computationally efficient adaptive spline wavelets
    • 使用计算效率高的自适应样条小波对视频数据进行编码的系统和方法
    • US06587507B1
    • 2003-07-01
    • US09445100
    • 2000-03-24
    • Charles K. ChuiLefan Zhong
    • Charles K. ChuiLefan Zhong
    • H04N712
    • H04N19/186H04N19/61H04N19/63
    • A system and method for encoding a two dimensional array of data utilizes a library having entries corresponding to a set of predefined two dimensional adaptive spline wavelet waveforms. Each predefined two dimensional adaptive spline wavelet waveform is formed by the superposition of one or more B-splines. The data encoding method identifies a set of best matches between the array of data and the predefined two dimensional adaptive spline wavelet waveforms by generating the inner product of the array of data and each of the predefined two dimensional adaptive spline wavelet waveforms. Each inner product is generated by FIR filtering the data with a corresponding set of FIR filter coefficients, and then determining which of the inner products have largest values. Once a set of best matches has been found, the data encoding method generates data representing the identified set of best matches. The generated data indicates for each match: one of the library entries, a position within the array of data at which the match was found, and a magnitude of the match. The data encoding method is computationally efficient because inner products are computed by FIR filtering.
    • 用于对二维数据阵列进行编码的系统和方法利用具有对应于一组预定义的二维自适应样条小波波形的条目的库。 每个预定义的二维自适应样条小波波形由一个或多个B样条的叠加形成。 数据编码方法通过产生数据阵列和预定义的二维自适应样条小波波形的内积来识别数据阵列与预定义的二维自适应样条小波波形之间的最佳匹配集合。 每个内积都是通过对FIR数据FIR滤波系数进行FIR滤波而产生的,然后确定哪个内积具有最大值。 一旦发现了一组最佳匹配,数据编码方法生成表示所识别的一组最佳匹配的数据。 生成的数据表示每个匹配:库条目之一,找到匹配的数据数组内的位置和匹配的大小。 数据编码方法在计算上是有效的,因为内部乘积是通过FIR滤波计算的。
    • 24. 发明授权
    • Image data interpolation system and method
    • 图像数据插值系统及方法
    • US06496608B1
    • 2002-12-17
    • US09232174
    • 1999-01-15
    • Charles K. Chui
    • Charles K. Chui
    • G06K936
    • G06T3/403
    • A pixel filling system or method begins with an initial set of image data that is a subset of data values in a data array fk,l representing data values at corresponding positions (k,l). Some of the fk,l values are initially undefined, while others, at positions where both k and l are even numbers, have initially defined values. An interpolated value is generated for initially undefined fk,l values in accordance with the pixel filling filter equation: f k , l = ∑ i , j ⁢ P k - 2 ⁢ ni , l - 2 ⁢ nj ⁢ d i , j wherein n is a positive integer, di,j are the subset of fk,l values which have defined values prior to the generation of the interpolated fk,l values; Pk,l are coefficients, no more than sixteen of which have non-zero values; and each non-zero Pk,l coefficient is an integer divided by an integer power of two. The pixel values generated in accordance with the pixel filling filter equation represent a surface that is smooth, has continuous two-dimensional spatial first derivative, and preserves sharp edges, if any, in the initial set of image data. Further, if a local set of the initial data points di,j (e.g., neighboring ones of the fk/2,l/2 or fk/4,l/4 points) all fall on a polynomial surface, the interpolated fk,l values that are located between the initial data points also fall on that same polynomial surface.
    • 像素填充系统或方法从作为数据阵列fk中的数据值的子集的初始图像数据组开始,l表示相应位置(k,l)处的数据值。 一些fk,l值最初是未定义的,而另一些在k和l都是偶数的位置上,最初定义了值。 根据像素填充滤波方程,对最初未定义的fk,l值生成内插值:其中n是正整数,di,j是在生成插值之前具有定义值的fk,l值的子集 fk,l值; Pk,l是系数,其中不超过十六个具有非零值; 并且每个非零Pk,l系数是除以2的整数幂的整数。 根据像素填充滤波器方程生成的像素值表示平滑的表面,具有连续的二维空间一阶导数,并且保留初始图像数据组中的锐边(如果有的话)。 此外,如果初始数据点di,j(例如,fk / 2,1 / 2或fk / 4,1 / 4点中的相邻点)的本地集合都落在多项式表面上,则内插的f k,l 位于初始数据点之间的值也落在同一多项式表面上。
    • 25. 发明授权
    • System and method for unified DCT and wavelet data coding
    • 用于统一DCT和小波数据编码的系统和方法
    • US06236762B1
    • 2001-05-22
    • US09118711
    • 1998-07-17
    • Charles K. ChuiLefan ZhongJames M. SpringRongxiang Yi
    • Charles K. ChuiLefan ZhongJames M. SpringRongxiang Yi
    • G06K936
    • H04N19/61G06K9/36H04N19/13H04N19/619H04N19/63
    • A unified system and method for encoding an array of data. If the data array is comprised of DCT data, then coefficients from corresponding positions in the data array are mapped into a common blocks in a second data array so as to group similarly valued coefficients. If the data array is comprised of wavelet data and the wavelet tile is greater than a predetermined size, then the wavelet tile coefficients are mapped into a second array so as to combine coefficients from the same wavelet family. After the DCT or wavelet coefficients have been mapped, the DC coefficients are encoded using a differential pulse code modulation (DPCM) process. The maximum number of bits required to represent any coefficient in each block family in the data array is determined. The difference between the maximum number of bits required to represent any coefficient in the entire data array and each of the block family maximums is determined and encoded. Each block family is then successively divided into an upper leftmost block and a sub-family, and difference values between maximum numbers of component block groupings are determined and encoded. This process is then repeated until the selected sub-family comprises a single block. Whenever a sub-family is processed, if the sub-family is entirely filled with zero data it is so identified in the output data and no further processing of the sub-family is required. After all of the sub-families have been processed, the blocks are bit mask coded. After all the coefficients in a block have been processed, the bit mask is encoded. When blocks of a predetermined size are encountered, the method outputs the value of the coefficients in the block. A data decoder and method retraces the encoded data so as to reverse the process performed by the encoding method.
    • 用于对数据数组进行编码的统一系统和方法。 如果数据阵列由DCT数据组成,则将来自数据阵列中的相应位置的系数映射到第二数据阵列中的公共块,以便对类似的值系数进行分组。 如果数据阵列由小波数据组成并且小波片大于预定大小,则将小波片系数映射到第二阵列中,以便组合来自相同小波族的系数。 在DCT或小波系数被映射之后,使用差分脉冲编码调制(DPCM)处理对DC系数进行编码。 确定表示数据阵列中每个块系列中的任何系数所需的最大位数。 确定并编码在整个数据阵列中表示任何系数所需的最大位数与块族最大值之间的差。 然后,每个块族被连续划分为最上面的块和子族,并且确定并编码最大数量的分量块分组之间的差值。 然后重复该过程,直到所选择的子系列包含单个块。 无论何时处理子系列,如果子系列完全填充零数据,则在输出数据中如此识别,并且不需要进一步处理子系列。 在所有子系列被处理完毕之后,这些块被对位掩码编码。 在块中的所有系数已经被处理之后,位掩码被编码。 当遇到预定大小的块时,该方法输出块中系数的值。 数据解码器和方法回溯编码数据,以便逆转由编码方法执行的处理。
    • 26. 发明授权
    • System and method for tree ordered coding of sparse data sets
    • 用于稀疏数据集的树序列编码的系统和方法
    • US6009434A
    • 1999-12-28
    • US183662
    • 1998-10-29
    • Charles K. ChuiRongxiang Yi
    • Charles K. ChuiRongxiang Yi
    • G01V1/22G06T9/40H04N7/26G06F17/30
    • G01V1/22G06T9/40H04N19/593H04N19/63H04N19/635H04N19/647H04N19/42Y10S707/99942Y10S707/99943Y10S707/99945
    • A data encoder and method utilizes a node list for storing a list of nodes in the data array to be processed, a branch list for storing a list of tree branches in the data array to be processed and a set list for storing a list of data sets. The method begins by initially storing in the node list node identifiers representing a predefined set of nodes in the data array, corresponding to coefficients generated by a last iteration of a data decomposition procedure. Also, it initially stores in the branch list branch identifiers representing tree branches corresponding to a predefined subset of the nodes initially listed in the node list. Each such tree branch has an associated root node and a branch depth value indicating how many node layers intervene between the root node and the nodes of the tree branch closest to the root node. The set list is initially empty, and a parameter called the LayerLimit value is also initialized. For successively smaller values of m, where m is a positive integer, a set of data encoding steps are repeatedly performed so as to process all nodes, branches and sets in the lists. A magnitude flag is output for each node, branch and set to indicate whether or not it is or contains a node whose absolute value is equal to or larger than 2.sup.m-1, and for each node, branch and set that is equal to or larger than 2.sup.m-1 further processing is performed.
    • 数据编码器和方法利用节点列表来存储要处理的数据阵列中的节点列表,用于存储要处理的数据阵列中的树枝的列表的分支列表和用于存储数据列表的集合列表 套。 该方法开始于首先在节点列表中存储表示数据阵列中预定的一组节点的标识符,对应于由数据分解过程的最后一次迭代生成的系数。 此外,它最初存储在分支列表中,分支标识符表示与节点列表中最初列出的节点的预定义子集相对应的树分支。 每个这样的树分支具有相关联的根节点和分支深度值,指示在根节点和最靠近根节点的树分支的节点之间介入多少节点层。 集合列表最初为空,并且还初始化了一个称为LayerLimit值的参数。 对于连续较小的m值,其中m是正整数,重复执行一组数据编码步骤,以处理列表中的所有节点,分支和集合。 为每个节点输出幅度标志,进行分支并设置以指示其是否包含绝对值等于或大于2m-1的节点,并且对于每个节点,等于或大于其的分支和集合 进行2m-1以上的处理。
    • 27. 发明授权
    • System and method for scalable coding of sparse data sets
    • 稀疏数据集可缩放编码的系统和方法
    • US5949911A
    • 1999-09-07
    • US858035
    • 1997-05-16
    • Charles K. ChuiLefan ZhongRongxiang Yi
    • Charles K. ChuiLefan ZhongRongxiang Yi
    • G06T9/00H03M7/30H04N7/26G06K9/36H03M7/00H04N7/12
    • H04N19/647H04N19/62
    • A data encoding system and method successively generates compressed data on a bit plane by bit plane basis, starting with the bit position of the most significant non-zero bit for the node in the data array having the largest absolute value, and then encoding the data in the array for progressively less significant bits. All the nodes in the data array are represented initially by blocks of nodes on a block list, and later in the processing by nodes on two node lists. Whenever a block contains a node whose most significant bit is on the bit plane currently being processed, the block will be subdivided recursively until all the nodes in the block whose most significant bit in on the current bit plane are placed in a node list. Data bits representing an m.sup.th least significant bit of the block and node values are written to the compressed data file first, where m is the minimum number of bits required to represent the node having the largest absolute value in the entire data array being encoded. Data bits for successively less significant bit planes are written to the compressed data file until a bit plane stop point is reached. The bit plane stop point may be predefined, user selected, or procedurally selected (e.g., in accordance with available bandwidth for transmitting compressed image data).
    • 数据编码系统和方法依次以比特平面生成压缩数据,从具有最大绝对值的数据阵列中的节点的最高有效非零位的位位置开始,然后对数据进行编码 在阵列中逐渐减少有效位。 数据阵列中的所有节点最初由块列表上的节点块表示,稍后在两个节点列表上的节点处理中。 每当块包含最高有效位在当前正在处理的位平面上的节点时,块将被递归地细分,直到当前位平面中最高有效位的块中的所有节点被放置在节点列表中。 表示块和节点值的第m个最低有效位的数据位首先被写入压缩数据文件,其中m是表示编码整个数据阵列中绝对值最大的节点所需的最小位数。 将连续较低有效位平面的数据位写入压缩数据文件,直到达到位平面停止点为止。 位平面停止点可以是预定义的,用户选择的或过程选择的(例如,根据用于发送压缩图像数据的可用带宽)。
    • 28. 发明授权
    • Spline-wavelet signal analyzers and methods for processing signals
    • 样条小波信号分析仪和信号处理方法
    • US5262958A
    • 1993-11-16
    • US681053
    • 1991-04-05
    • Charles K. ChuiAndrew K. Chan
    • Charles K. ChuiAndrew K. Chan
    • G06F17/14G06F17/17G06F15/20
    • G06F17/14G06F17/17
    • A processor (10) is disclosed which uses a B-spline interpolator (14) to produce a plurality of zero-level spline coefficients c.sup.0 (n). This set of coefficients may be fed to a B-spline generator (16) to produce an approximation of the input signal, and/or may be multiplied by a set of coefficients Bn to produce a set of first-level wavelet coefficients d.sup.-1 (n). The zero-level spline coefficients are also used to create first-level spline coefficients c.sup.-1 (n). The first-level spline and wavelet coefficient c.sup.-1 (n) and d.sup.-1 (n) may be submitted to a respective B-spline generator (22) or B-wavelet generator (24) to produce a first-level spline signal components and a first-level wavelet signal component for extraction of data from the original signal. The signal may in a similar fashion be decomposed to any level of resolution desired. The signal components may then be processed, and an improved signal then reassembled from the last-level spline and the processed wavelet signals. Novel spline and wavelet generators are also disclosed.
    • 公开了一种使用B样条内插器(14)产生多个零电平样条系数c0(n)的处理器(10)。 这组系数可以被馈送到B样条生成器(16)以产生输入信号的近似,和/或可以乘以一组系数Bn以产生一组第一级小波系数d-1 (n)。 零级样条系数也用于创建第一级样条系数c-1(n)。 可以将第一级样条和小波系数c-1(n)和d-1(n)提交给相应的B样条发生器(22)或B小波发生器(24),以产生第一级样条信号 分量和用于从原始信号提取数据的第一级小波信号分量。 信号可以以类似的方式被分解成所需的任何分辨率水平。 然后可以对信号分量进行处理,然后将改进的信号从最后一级样条和经处理的小波信号重组。 还公开了新的样条和小波发生器。