公开(公告)号：US06453389B1

公开(公告)日：2002-09-17

申请号：US09340279

申请日：1999-06-25

申请人： Marcelo Weinberger ,  Tomas G. Rokicki ,  Gadiel Seroussi ,  Rajiv Gupta ,  Neri Merhav ,  Joesp M. Ferrandiz

发明人： Marcelo Weinberger ,  Tomas G. Rokicki ,  Gadiel Seroussi ,  Rajiv Gupta ,  Neri Merhav ,  Joesp M. Ferrandiz

IPC分类号： G06F1200

CPC分类号： G06F12/0862 ,  G06F2212/6026

摘要： The method of prefetching data into cache to minimize CPU stall time uses a rough predictor to make rough predictions about what cache lines will be needed next by the CPU. The address difference generator uses the rough prediction and the actual cache miss address to determine the address difference. The prefetch engine builds a data structure to represent address differences and weights them according to the accumulated stall time produced by the cache misses given that the corresponding address is not prefetched. This stall time is modeled as a loss function of the form: L = ∑ j = 0 n ⁢   ⁢ L ⁢   ⁢ ( x j ) L ⁢   ⁢ ( x j ) = ∑ i = 0 sl ⁡ ( j ) - 1 ⁢   ⁢ C i ⁢   ⁢ ( b j - i , x j ) The weights in the data structure change as the prefetch engine learns more information. The prefetch engine's goal is to predict the cache line needed and prefetch before the CPU requests it.

摘要翻译： 将数据预取到缓存中以最小化CPU停顿时间的方法使用粗略的预测器来粗略地预测CPU将需要什么高速缓存行。 地址差产生器使用粗略预测和实际高速缓存未命中地址来确定地址差异。 预取引擎构建数据结构以表示地址差异，并根据缓存未命中产生的累积停顿时间来加权它们，因为相应地址未被预取。 该失速时间被建模为形式的损失函数：数据结构中的权重随着预取引擎学习更多信息而改变。 预取引擎的目标是在CPU请求之前预测所需的高速缓存行和预取。

公开(公告)号：US6125212A

公开(公告)日：2000-09-26

申请号：US69306

申请日：1998-04-29

申请人： Renato Kresch ,  Neri Merhav

发明人： Renato Kresch ,  Neri Merhav

IPC分类号： G06T5/10 ,  G06K9/00

CPC分类号： G06T5/10 ,  G06T5/001 ,  G06T2207/20056

摘要： An explicit DST-based filter that comprises a trigonometric transform module, first and second transform coefficient processors (TCPs), an inverse trigonometric transform module and first and second summing arrangements. The trigonometric transform module applies a trigonometric transform to blocks of DCT coefficients related to input blocks of DCT coefficients to generate corresponding input blocks of transform coefficients of a second type ("second coefficients"). The first TCP includes matrix multipliers that generate a multiplied block of DCT coefficients and a multiplied block of second coefficients by multiplying, by diagonal multiplying matrices, intermediate blocks of DCT coefficients derived from the input blocks of DCT coefficients. The second TCP includes matrix multipliers that generate at a multiplied block of DCT coefficients and a multiplied block of second coefficients by multiplying, by diagonal multiplying matrices, intermediate blocks of second coefficients derived from the input blocks of second coefficients. The first summing arrangement sums the multiplied blocks of DCT coefficients to generate a first final block of DCT coefficients, and sums the multiplied blocks of second coefficients to generate a first final block of second coefficients. The inverse trigonometric transform module applies an inverse trigonometric transform to the first final block of second coefficients to generate a second final block of DCT coefficients. The second summing arrangement sums the first and second final blocks of DCT coefficients to generate a block of DCT coefficients constituting a block of a filtered information signal.

摘要翻译： 一种显式的基于DST的滤波器，包括三角变换模块，第一和第二变换系数处理器（TCP），反三角变换模块以及第一和第二求和布置。 三角变换模块将三角变换应用于与DCT系数的输入块相关的DCT系数的块，以生成第二类型（“第二系数”）的变换系数的相应输入块。 第一TCP包括矩阵乘法器，其通过乘以由DCT系数的输入块导出的DCT系数的中间块乘以对角乘法矩阵来生成DCT系数的相乘块和第二系数的相乘块。 第二TCP包括通过乘以由对角乘法矩阵从第二系数的输入块导出的第二系数的中间块乘以在DCT系数的相乘块处生成的矩阵乘法器和乘法的第二系数的乘法器。 第一求和装置将相乘的DCT系数块相加以产生DCT系数的第一最终块，并且对第二系数的相乘块求和以产生第二系数的第一最终块。 逆三角变换模块将逆三角变换应用于第二系数的第一最终块以产生DCT系数的第二最终块。 第二加法装置对DCT系数的第一和第二最终块求和，以产生构成滤波信息信号块的DCT系数块。

公开(公告)号：US5708732A

公开(公告)日：1998-01-13

申请号：US611922

申请日：1996-03-06

申请人： Neri Merhav ,  Vasudev Bhaskaran

发明人： Neri Merhav ,  Vasudev Bhaskaran

IPC分类号： G06T3/40 ,  G06T9/00 ,  G11B27/034 ,  H03M7/30 ,  H03M7/40 ,  H04N7/26 ,  H04N7/30 ,  H04N7/36 ,  H04N7/46 ,  H04N7/50 ,  G06K9/36 ,  G06F17/14 ,  H04N7/12

CPC分类号： G11B27/034 ,  G06T3/4084 ,  H04N19/40 ,  H04N19/42 ,  H04N19/48 ,  H04N19/51 ,  H04N19/59 ,  H04N19/61

摘要： Downsampling and inverse motion compensation are performed on compressed domain representations for video. By directly manipulating the compressed domain representation instead of the spatial domain representation, computational complexity is significantly reduced. For downsampling, the compressed stream is processed in the compressed (DCT) domain without explicit decompression and spatial domain downsampling so that the resulting compressed stream corresponds to a scaled down image, ensuring that the resulting compressed stream conforms to the standard syntax of 8.times.8 DCT matrices. For typical data sets, this approach of downsampling in the compressed domain results in computation savings around 80% compared with traditional spatial domain methods for downsampling from compressed data. For inverse motion compensation, motion compensated compressed video is converted into a sequence of DCT domain blocks corresponding to the spatial domain blocks in the current picture alone. By performing inverse motion compensation directly in the compressed domain, the reduction in computation complexity is around 68% compared with traditional spatial domain methods for inverse motion compensation from compressed data. The techniques for downsampling and inverse motion compensation can be used in a variety of applications, such as multipoint video conferencing and video editing.

摘要翻译： 对视频的压缩域表示进行下采样和逆运动补偿。 通过直接操纵压缩域表示而不是空间域表示，计算复杂度显着降低。 对于下采样，压缩流在压缩（DCT）域中被处理，而没有显式解压缩和空域降序采样，使得所生成的压缩流对应于缩小图像，确保得到的压缩流符合8×8 DCT矩阵的标准语法 。 对于典型的数据集，与压缩数据下采样的传统空间域方法相比，压缩域中的这种下采样方法导致计算节省大约80％。 对于逆运动补偿，运动补偿压缩视频被转换成与当前图像中的空间域块相对应的DCT域块序列。 通过直接在压缩域中进行逆运动补偿，与传统的空间域方法相比，压缩数据的反向运动补偿的计算复杂度降低了约68％。 用于下采样和反向运动补偿的技术可用于各种应用，如多点视频会议和视频编辑。

公开(公告)号：US06721439B1

公开(公告)日：2004-04-13

申请号：US09642223

申请日：2000-08-18

申请人： Avraham Levy ,  Neri Merhav

发明人： Avraham Levy ,  Neri Merhav

IPC分类号： G06K900

CPC分类号： G06T1/005 ,  G06T2201/0052 ,  G06T2201/0065 ,  G06T2201/0083 ,  H04N19/467 ,  H04N19/48 ,  H04N19/90 ,  H04N21/23892 ,  H04N21/8358

摘要： A transform domain watermarking technique which is based on a new encoding scheme referred to as scaled bin encoding which encodes a message in a set of transform coefficients by modifying their values in a way that preserves high image quality (i.e., low distortion levels) and adapts to expected noise level. Recapturing of the watermark image is performed via a decoding method using a maximum likelihood procedure (i.e., maximum likelihood decoding), based on the statistics of the transform coefficients and a worst case statistical model of the noise introduced to these coefficients by image processing operations or attack noise.

摘要翻译： 一种变换域水印技术，其基于称为缩放仓编码的新编码方案，其通过以保持高图像质量（即，低失真水平）的方式修改其值来编码一组变换系数中的消息，并适应 达到预期的噪音水平。 基于变换系数的统计和通过图像处理操作引入到这些系数的噪声的最坏情况统计模型，通过使用最大似然程序（即最大似然解码）的解码方法来执行水印图像的重新捕获，或 攻击噪音

公开(公告)号：US06611560B1

公开(公告)日：2003-08-26

申请号：US09488343

申请日：2000-01-20

申请人： Renato Kresch ,  Neri Merhav

发明人： Renato Kresch ,  Neri Merhav

IPC分类号： H04N712

CPC分类号： H04N5/145 ,  H04N19/42 ,  H04N19/51 ,  H04N19/547 ,  H04N19/61

摘要： A motion vector between a current block and a reference block of a reference frame is determined by calculating the exact linear cross-correlation between the current block and the potential reference blocks of the reference picture. The current block is orthogonally transformed using DCT/DST transforms of a first type without prior zero padding of the current block to generate a current quadruple of transform coefficient blocks. The current quadruple is processed together with a reference quadruple of transform coefficient blocks generated from four of the search region blocks to generate a quadruple of processed transform coefficient blocks. The quadruple of processed transform coefficient blocks is inversely transformed using inverse DCT/DST transforms of a second type to generate a block of exact cross-correlations between the current block and the search region. The motion vector is determined from the block of exact cross-correlations.

摘要翻译： 通过计算当前块和参考图像的潜在参考块之间的精确线性互相关来确定参考帧的当前块和参考块之间的运动矢量。 当前块使用第一类型的DCT / DST变换进行正交变换，而没有当前块的先前零填充以产生变换系数块的当前四倍。 将当前四倍数与由四个搜索区域块产生的变换系数块的参考四倍一起被处理，以生成经处理的变换系数块的四倍。 使用第二类型的逆DCT / DST变换对经处理的变换系数块的四倍进行逆变换，以产生当前块和搜索区之间的精确互相关的块。 运动矢量由精确的交叉相关块确定。

公开(公告)号：US06473534B1

公开(公告)日：2002-10-29

申请号：US09226584

申请日：1999-01-06

申请人： Neri Merhav ,  Vasudev Bhaskaran

发明人： Neri Merhav ,  Vasudev Bhaskaran

IPC分类号： G06K936

CPC分类号： G06T9/007

摘要： Multiplier-free implementation of an approximation of the DCT used in image and video processing. In accordance with the primary aspect of the present invention, image and video processing is done with no multiplications and a fewer number of operations through the application of a modified Arai, Agui, and Nakajima (AAN) scheme for eight-point DCT.

摘要翻译： 在图像和视频处理中使用DCT的近似的无乘法实现。 根据本发明的主要方面，通过应用用于八点DCT的修改的Arai，Agui和Nakajima（AAN）方案，不进行乘法和更少数量的操作来完成图像和视频处理。

公开(公告)号：US6134571A

公开(公告)日：2000-10-17

申请号：US69550

申请日：1998-04-29

申请人： Renato Kresch ,  Neri Merhav

发明人： Renato Kresch ,  Neri Merhav

IPC分类号： G06F17/14 ,  H03H17/02 ,  G06F17/10

CPC分类号： G06F17/147 ,  H03H17/0211

摘要： An implicit DST-based filter having characteristics defined by a linear convolution kernel that may be causal or noncausal-symmetric. The filter filters an information signal composed of blocks of discrete cosine transform (DCT) coefficients to generate a filtered information signal also composed of blocks of DCT coefficients. The filter comprises multiplying matrices, a deriving module, matrix multiplying modules and a summing module. The multiplying matrices are obtained by absorbing a cosine-to-sine transform and a sine-to-cosine transform into kernel matrices derived from the linear convolution kernel. The deriving module derives intermediate blocks of DCT coefficients from neighboring ones of the blocks of DCT coefficients constituting the information signal. The matrix multiplying modules multiply the intermediate blocks of DCT coefficients by the multiplying matrices. The summing module sums the blocks of DCT coefficients generated by the matrix multiplying modules to generate the blocks of DCT coefficients constituting the filtered information signal.

摘要翻译： 一个隐含的基于DST的滤波器，具有由线性卷积核定义的特征，可以是因果对称的或非因果对称的。 滤波器对由离散余弦变换（DCT）系数块组成的信息信号进行滤波，以生成也由DCT系数的块组成的滤波信息信号。 滤波器包括乘法矩阵，导出模块，矩阵乘法模块和求和模块。 乘法矩阵通过将余弦到正弦变换和正弦到余弦变换吸收到从线性卷积核导出的核矩阵中来获得。 导出模块从构成信息信号的DCT系数的相邻块中获得DCT系数的中间块。 矩阵乘法模块将DCT系数的中间块乘以乘法矩阵。 求和模块对由矩阵乘法模块生成的DCT系数的块进行求和，以生成构成滤波信息信号的DCT系数块。

公开(公告)号：US5832135A

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

申请号：US612513

申请日：1996-03-06

申请人： Neri Merhav ,  Vasudev Bhaskaran

发明人： Neri Merhav ,  Vasudev Bhaskaran

IPC分类号： H04N7/30 ,  G06T5/20 ,  H03M7/30 ,  G06T5/10 ,  G06F17/10

CPC分类号： G06T5/20

摘要： A method is described for filtering compressed images represented in the discrete-cosine-transform (DCT) domain. The filter includes three sparse, vertical submatrices which are sparse versions of the vertical filter components (VFCs) of a desired filter function that have been combined in such a way as to eliminate many of the non-zero elements. The filter also includes three sparse, horizontal transpose submatrices, which, like the vertical submatrices, are sparse versions of the horizontal filter components of the filter function. The sparseness of these sparse submatrices yields a significant reduction in the number of computations required to filter the image in the DCT domain. To take advantage of this discovery, the input DCT data blocks are "butterflied" to retain the relationship between the input data blocks and the filtered output data blocks as a function of these sparse submatrices. The sparseness of the vertical and horizontal submatrices reduces the number of computations required to filter the image. The sparseness of the DCT data blocks can also be used to further reduce the number of computations required.

摘要翻译： 描述了用于过滤在离散余弦变换（DCT）域中表示的压缩图像的方法。 滤波器包括三个稀疏的垂直子矩阵，它们是已经以消除许多非零元素的方式组合的期望滤波器函数的垂直滤波器组件（VFC）的稀疏版本。 滤波器还包括三个稀疏水平转置子矩阵，其像垂直子矩阵一样是滤波器函数的水平滤波器组件的稀疏版本。 这些稀疏子矩阵的稀疏度导致在DCT域中对图像进行滤波所需的计算数量的显着减少。 为了利用这一发现，输入的DCT数据块被“压缩”以保持输入数据块和滤波的输出数据块之间的关系作为这些稀疏子矩阵的函数。 垂直和水平子矩阵的稀疏度减少了过滤图像所需的计算次数。 DCT数据块的稀疏度也可用于进一步减少所需的计算次数。