会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • FOREGROUND MOTION DETECTION IN COMPRESSED VIDEO DATA
    • 压缩视频数据中的前置运动检测
    • WO2016189404A1
    • 2016-12-01
    • PCT/IB2016/052344
    • 2016-04-26
    • INDIAN STATISTICAL INSTITUTE
    • DEY, BhaskarKUNDU, Malay Kumar
    • H04N7/18H04N7/28H04N7/34H04N7/36H04N21/234
    • H04N19/174G06T7/262G06T2207/20021H04N19/44H04N19/48
    • Technologies are generally described to identify foreground motion detection in compressed video data. In some examples, a foreground motion detection module may determine 5 transform-coefficient-magnitude sums and motion-vector-magnitude sums associated with block coding units (BCUs) in compressed video data without decompressing the video data. The foreground motion detection module may also determine a background mean and a background co-variance associated with the compressed video data. To determine whether the BCU(s) contain foreground motion, the foreground motion detection module may 10 determine a statistic based on the transform-coefficient-magnitude sums, the motion-vector magnitude sums, the background mean, and the background co-variance and compare the statistic to a threshold.
    • 通常描述技术来识别压缩视频数据中的前景运动检测。 在一些示例中,前景运动检测模块可以在不解压缩视频数据的情况下确定与压缩视频数据中的块编码单元(BCU)相关联的5个变换系数幅度和和运动矢量幅度和。 前景运动检测模块还可以确定与压缩视频数据相关联的背景平均值和背景协方差。 为了确定BCU是否包含前景运动,前景运动检测模块可以基于变换系数幅度和,运动矢量幅度和,背景平均和背景协方差来确定统计量,以及 将统计数据与阈值进行比较。
    • 6. 发明申请
    • METHOD FOR DECOMPOSING A VIDEO SEQUENCE FRAME
    • 分解视频序列帧的方法
    • WO2008054688A1
    • 2008-05-08
    • PCT/US2007/022793
    • 2007-10-26
    • HEWLETT-PACKARD DEVELOPMENT COMPANY L.P.MUKHERJEE, DebarghaLIU, Sam
    • MUKHERJEE, DebarghaLIU, Sam
    • H04N7/32H04N7/28
    • H04N19/57H04N19/105H04N19/109H04N19/147H04N19/51H04N19/61
    • In a method (300) for decomposing a block (122-126) of a video sequence frame, it is determined as to whether either or both of the dimensions of the block (122-126) equals a predetermined minimum dimension. In response to either or both of the dimensions equaling the predetermined minimum dimension, a motion vector (132) for the block (122-126) is sent. In response to both of the dimensions exceeding the predetermined minimum dimension, a motion vector (132) for the block (122-126) is determined, the block (122-126) is partitioned into two wedges (130a, 130b), the block (122-126) is divided into four N/2xN/2 sub-blocks (122-126), and these steps are repeated on each of the four N/2xN/2 sub-blocks (122-126) until either or both of the dimensions equal the predetermined minimum dimension.
    • 在用于分解视频序列帧的块(122-126)的方法(300)中,确定块(122-126)的尺寸中的一个或两个是否等于预定的最小尺寸。 响应于等于预定最小尺寸的尺寸中的一个或两者,发送用于块(122-126)的运动矢量(132)。 响应于两个尺寸超过预定的最小尺寸,确定块(122-126)的运动矢量(132),块(122-126)被划分成两个楔形(130a,130b),块 (122-126)被分成四个N / 2xN / 2子块(122-126),并且在四个N / 2xN / 2子块(122-126)中的每一个上重复这些步骤,直到这两个 的尺寸等于预定的最小尺寸。
    • 10. 发明申请
    • IMPROVED VECTOR QUANTIZATION OF IMAGES
    • 改进图像的矢量量化
    • WO01067776A1
    • 2001-09-13
    • PCT/GB2001/000960
    • 2001-03-06
    • G06T9/00H04N7/26H04N7/28
    • H04N19/94H04N19/115H04N19/129H04N19/146H04N19/63H04N19/64H04N19/96
    • A method of compressing an image is described in which digital data signals in a 2-dimensional image are formed into an image data pyramid with a number of layers and each layer is processed to give a compressed encoding in an ordered list. The encoding with the largest quality gain factor is selected first and added to a compressed representation of the data array. This is repeated for the next largest gain factor and so on until a predetermined maximum is reached. Each layer of the image data pyramid corresponds to different frequency bands, the vector quantizations of these layers will only minimally interfere with one another. This allows a simple ordering of all possible gain contributions made by the compressed encodings, to the compressed representation. This in turn allows a straightforward selection of the compressed encodings having the largest quality gain factors, for compiling the compressed representation of the image.
    • 描述了压缩图像的方法,其中将二维图像中的数字数据信号形成为具有多个层的图像数据金字塔,并且每个层被处理以在有序列表中给出压缩编码。 首先选择具有最大质量增益因子的编码,并将其加到数据阵列的压缩表示中。 对于下一个最大的增益因子重复这个等等,直到达到预定的最大值。 图像数据金字塔的每个层对应于不同的频带,这些层的矢量量化将仅最小程度地相互干扰。 这允许将压缩编码对压缩表示的所有可能的增益贡献进行简单排序。 这又允许对具有最大质量增益因子的压缩编码的直接选择,用于编译图像的压缩表示。