基于多模式匹配的网络视频流识别与分类算法

快速发现网络中的视频流是进行网络视频监督及管理的前提与基础。本文通过分析网络视频流数据包的特征,提出了一种基于多模式匹配思想的网络视频流快速发现与分类算法,该算法利用不同视频流的特征建立匹配机,只需对网络数据包进行一次不完全扫描,就可以判断出数据包中是否含有视频流及类型。实验结果表明,与普通的协议解析方法相比,在满足准确性的前提下,所提算法具有更好的时间性能。     

Graph-based video sequence matching using dominant colour graph profile (DCGP)

This paper presents a fast and effective technique for videos’ visual similarity detection and measurement using compact fixed-length signatures. The proposed technique (dominant colour graph profile DCGP) extracts and encodes the spatio-temporal information of a given video shot into a graph-based structure (tree) that fully captures this vital information. The graph structured properties are utilized to construct a fixed-length video signature of 112 decimal values per video shot. The encoded spatio-temporal information is extracted following channelling each video frame into a block-based structure, where the positions of respective blocks are tracked across video frames and encoded into multiple DCGP trees. The proposed technique provides a high matching speed (>2000 fps) and robust retrieval performance. The experiments on various standard and challenging datasets shows the framework’s robust performance, in terms of both, retrieval and computational performances.     

Discrete Multiwavelet–Based Video Watermarking Scheme Using SURF

This paper proposes a robust, imperceptible block‐based digital video watermarking algorithm that makes use of the Speeded Up Robust Feature (SURF) technique. The SURF technique is used to extract the most important features of a video. A discrete multiwavelet transform (DMWT) domain in conjunction with a discrete cosine transform is used for embedding a watermark into feature blocks. The watermark used is a binary image. The proposed algorithm is further improved for robustness by an error‐correction code to protect the watermark against bit errors. The same watermark is embedded temporally for every set of frames of an input video to improve the decoded watermark correlation. Extensive experimental results demonstrate that the proposed DMWT domain video watermarking using SURF features is robust against common image processing attacks, motion JPEG2000 compression, frame averaging, and frame swapping attacks. The quality of a watermarked video under the proposed algorithm is high, demonstrating the imperceptibility of an embedded watermark.     

Concentric Circle‐Based Image Signature for Near‐Duplicate Detection in Large Databases

Many applications dealing with image management need a technique for removing duplicate images or for grouping related (near‐duplicate) images in a database. This paper proposes a concentric circle‐based image signature which makes it possible to detect near‐duplicates rapidly and accurately. An image is partitioned by radius and angle levels from the center of the image. Feature values are calculated using the average or variation between the partitioned sub‐regions. The feature values distributed in sequence are formed into an image signature by hash generation. The hashing facilitates storage space reduction and fast matching. The performance was evaluated through discriminability and robustness tests. Using these tests, the particularity among the different images and the invariability among the modified images are verified, respectively. In addition, we also measured the discriminability and robustness by the distribution analysis of the hashed bits. The proposed method is robust to various modifications, as shown by its average detection rate of 98.99%. The experimental results showed that the proposed method is suitable for near‐duplicate detection in large databases.     

基于数字签名的高效视频拷贝检测算法研究

为了解决视频特征提取和大型数据库的快速搜索问题,提出了一种新的视频拷贝检测算法。该算法基于视频剪辑的时空特征计算视频签名,通过视频签名的距离来衡量视频之间的相似性。为视频签名数据库建立聚类索引表,提高搜索速度。在大型数据库中查询测试的实验结果表明该算法对视频拷贝检测有较高查全率和正确率。该算法可以作为一种有效的视频跟踪和检测技术应用于数字广播电视的监控领域。     

Robust semi-blind video watermarking based on frame-patch matching

In this paper, we present a frame-patch matching based robust semi-blind video watermarking using KAZE feature. The KAZE feature is employed for matching the feature points of frame-patch with those of all frames in video for detecting the embedding and extracting regions. In our method, the watermark information is embedded in Discrete Cosine Transform (DCT) domain of randomly generated blocks in the matched region. In the extraction process, we synchronize the embedded region from the distorted video by using KAZE feature matching. Based on the matched KAZE feature points, RST (rotation, scaling, translation) parameters are estimated and the watermark information can be successfully extracted. Experimental results show that our proposed method is robust against geometrical attacks, video processing attacks, temporal attacks, and so on.     

基于场景复杂度与不变特征的航拍视频实时配准算法

实时、鲁棒的图像配准是航拍视频电子稳像、全景图拼接和地面运动目标自动检测与跟踪的前提和关键技术.本文以航拍视频序列为处理对象,提出了一种新的基于场景复杂度与不变特征的实时配准算法,其主要特点包括：(1)在对航拍视频配准难点进行详细分析的基础上,有针对性的提出基于积分图的快速图像尺度空间构建、依据场景复杂度的检测特征点数量在线精确控制、基于描述子误差分布统计特性级的联分类器构造等新方法,使得算法配准性能不随场景的复杂度发生改变,能够在各种地貌条件下实时、稳定的进行图像配准;(2)将多尺度Harris角点和SIFT描述子相结合,并通过对帧间变换模型参数进行鲁棒估计,保证了算法具有良好的旋转、尺度、亮度不变性和配准精度.实验结果表明,算法可在场景变化、图像大幅度平移、尺度缩放和任意角度旋转等复杂条件下实时、精确的进行图像配准,对分辨率为320×240的航拍序列的平均处理速度达到20.7帧/秒.     

CVS中基于视频运动特征的多假设-双稀疏重构算法

针对目前视频压缩感知重构算法对不同特征的视频序列重构质量参差不齐的问题,结合双稀疏对轮廓、细节的高清晰重构以及多假设算法对高频噪声有效抑制的优点,本文提出一种基于视频运动特征的多假设-双稀疏重构算法（VF-MH-DSR）.基本思路是基于每个视频组（GOP）的运动特征,采取相应的多假设-双稀疏重构策略.首先给出一种观测域多维度参考帧的多假设重构算法（MD-MRF-MH）及其最优相似块个数设置方案;然后给出一种像素域多假设参考帧的重构算法（PD-MRF-MH）及一种高性能双匹配准则;最后介绍了视频信号运动特征判定方案及多假设-双稀疏重构的具体实现方案.仿真实验表明,本文所提多假设-双稀疏重构算法相对于目前较好的多假设预测重构算法2sMHR及组稀疏重构算法SSIM-InterF-GSR,重构性能平均提升了1.98dB和0.84dB.     

一种用于视频分割的快速运动估计方法

本文在考虑视频分割特点的基础上,提出了一种分层块匹配的运动估计方法,这处估计方法具有较快的估计速度和较高的峰值信噪比。用这种方法对一帧图像进行一次运行估计约需0．1秒,可以用于实时的视频分割系统中。实验证明这是一种性能良好的运动估计方法。     

一种基于H．264的有效运动估计算法

运动估计算法是实时视频编解码技术的研究重点，高精度的匹配和补偿可以减少预测误差，提高视频图像的压缩效果．为降低在视频编码标准H．264中运动估计的高计算复杂度问题，提出了采用一种基于节点模型的可变形块匹配运动估计算法来搜索最佳运动矢量．该算法充分利用了H．264运动矢量的的统计特性和相关性，并采用基于像素差值分类的运动估计匹配准则．实验表明，在编码性能损失很小的条件下，该算法有效降低了视频压缩编码中运动估计的运算复杂度．     

Video Block Motion Estimation Based on Gray-Code Kernels

Motion in modern video coders is estimated using a block matching algorithm that calculates the distance and direction of motion on a block-by-block basis. In this paper, a novel fast block-based motion estimation algorithm is proposed. This algorithm uses an efficient projection framework that bounds the distance between a template block and candidate blocks. Fast projection is performed using a family of highly efficient filter kernels-the gray-code kernels-requiring only 2 operations per pixel per kernel. The projection framework is combined with a rejection scheme which allows rapid rejection of candidate blocks that are distant from the template block. The tradeoff between computational complexity and quality of results can be easily controlled in the proposed algorithm; thus, it enables adaptivity to image content to further improve the results. Experiments show that the proposed adaptive algorithm outperforms other popular fast motion estimation algorithms.     

适于微小型飞行器平台的稳像算法

为解决微小型飞行器由于机械振动、气流扰动等原因引起的图像高频抖动,设计了一种适用于该平台的稳像算法。采用基于生物视觉的匹配方法估计帧间运动矢量,建立了图像参数传递的数学模型;结合微小型飞行器的运动特点,提出了带约束的交互式多模型卡尔曼滤波方法(CIMMKF),针对绝对帧位移曲线和旋转角度滤波,引入硬约束条件减小模型不准确性产生的误差,再通过软约束平滑硬约束带来的局部跳变求得图像合适的校正量。最后,给出了一种新颖的微小型飞行器平台稳像算法性能的评估方法。实验结果表明,该稳像算法能够适应飞行器多种状态的交替改变,有效减小滤波延迟,去除高频抖动,保留主动运动,使稳定后图像质量满足观察要求,具有图像信息保留程度高、速度快的特点,尤其适用于微小型飞行器实时视频稳定。     

一种基于时空联合的视频分割算法

本文提出了一种基于时空联合的视频分割算法.在空间分割中,引入了一种新的分水岭分割算法,具有较快的执行速度;在运动分割中提出了一种分层块匹配的快速运动估计算法;最后提出了利用六个仿射参数组成的向量的范数来进行基于运动的区域合并.实验表明:这是一种稳健的而且执行速度相当快的视频分割算法.     

基于等积环投影与Zernike矩的快速模板匹配

为增强工业级机器视觉系统的实时性和稳定性,本文提出一种基于等积环投影与Zernike矩的具有旋转不变性的快速模板匹配方法,该方法采用由粗到精匹配策略,在粗匹配阶段以等积环投影向量作为特征进行匹配得到候选点集,再基于Zenrike矩进行精确匹配.主要创新点为提出复杂度低、抗噪性强和具有旋转不变性的等积环投影向量特征,并利用圆对称性在八分圆法基础上进一步降低Zernike矩计算量.经理论分析和实验对比验证,此法在保障匹配精度前提下,其匹配速度胜于当前同类最优算法,且对高斯噪声及线性亮度变化有强鲁棒性.     

基于商标匹配的视频广告识别

视频广告作为一种重要的媒体形式,正在潜移默化地影响着人们的生活。针对如何对视频广告进行识别,本文提出了一种基于商标匹配的视频广告识别算法。考虑到视频广告帧中存在着大量的背景干扰问题,本文算法首先对视频广告帧进行显著区域检测,将广告帧中较为显著的商标信息与周围背景分开,然后对已得到的显著区域图进行SURF特征提取,并与商标库中的商标显著区域图进行匹配。实验结果表明:本文算法对广告帧中商标存在的背景干扰、尺度缩放、旋转、颜色、光照等变化具有很好的鲁棒性,取得了令人满意的匹配准确率,很好地实现了视频广告识别。      

Extended Temporal Ordinal Measurement Using Spatially Normalized Mean for Video Copy Detection

This letter proposes a robust feature extraction method using a spatially normalized mean for temporal ordinal measurement. Before computing a rank matrix from the mean values of non‐overlapped blocks, each block mean is normalized so that it obeys the invariance property against linear additive and subtractive noise effects and is insensitive against multiplied and divided noise effects. Then, the temporal ordinal measures of spatially normalized mean values are computed for the feature matching. The performance of the proposed method showed about 95% accuracy in both precision and recall rates on various distortion environments, which represents the 2.7% higher performance on average compared to the temporal ordinal measurement.     

基于仿射迭代方法的大基线图像匹配技术研究

两幅图像中相应特征点邻域窗口之间的单应映射可以用仿射变换模型来近似。本文首先通过奇异值分解给出仿射变换矩阵4个自由度的几何含义,然后将其分解为一个相似变换矩阵和一个旋转的准单位矩阵(Rotated Quasi-Identity Matrix)的乘积,即在基于相似变换模型匹配的基础上再用基于仿射变换模型的迭代算法对相应特征点精确定位。针对相似变换中初始旋转角度的难确定性,在初始匹配中提出基于亮度最速下降方向的对齐方法,而在引导匹配阶段提出基于相应极线方向的对齐方法,这两个策略不仅提高了算法效率,还能为进一步的仿射迭代提供良好的初值。在得到最优仿射变换参数之后,实现了对相应特征点定位误差的精确补偿及其邻域窗口的透视矫正。最后通过真实图像的实验以及和现有算法的比较验证了本文算法的可行性和精确性,并给出了相应的实验数据和结果。     

Video object tracking using adaptive Kalman filter

In this paper, a new video moving object tracking method is proposed. In initialization, a moving object selected by the user is segmented and the dominant color is extracted from the segmented target. In tracking step, a motion model is constructed to set the system model of adaptive Kalman filter firstly. Then, the dominant color of the moving object in HSI color space will be used as feature to detect the moving object in the consecutive video frames. The detected result is fed back as the measurement of adaptive Kalman filter and the estimate parameters of adaptive Kalman filter are adjusted by occlusion ratio adaptively. The proposed method has the robust ability to track the moving object in the consecutive frames under some kinds of real-world complex situations such as the moving object disappearing totally or partially due to occlusion by other ones, fast moving object, changing lighting, changing the direction and orientation of the moving object, and changing the velocity of moving object suddenly. The proposed method is an efficient video object tracking algorithm.