A fast block-matching algorithm based on variable shape search

INTRODUCTION Block-matching motion estimation is a key video coding technology that reduces the temporal redundancy between adjacent frames. The 3GPP/ 3GPP2 mandatory video codecs (MPEG-4 Simple Profile or H.263 Baseline) have adopted this tech- nology extensively. However, block-matching motion estimation is quite computationally intensive if the Full Search (FS) algorithm is used which exhaus- tively checks all possible candidate motion vectors within the search window. Therefore…     

A model based algorithm for fast DPIV computing

Traditional DPIV (Digital Particle Image Velocimetry) methods are mostly based on area-correlation (Willert, C. E., 1991). Though proven to be very time-consuming and very much error prone, they are widely adopted because of they are conceptually simple and easily implemented, and also because there are few alternatives. This paper proposes a non-correlation, conceptually new, fast and efficient approach for DPIV, which takes the nature of flow into consideration. An Incompressible Affined Flow Model (IAFM) is introduced to describe a flow that incorporates rational restraints into the computation. This IAFM, combined with a modified optical flow method-named Total Optical Flow Computation (TOFC), provides a linear system solution to DPIV. Experimental results on real images showed our method to be a very promising approach for DPIV.     

一种基于肤色模型的快速人脸检测方法

提出一种基于肤色模型的快速人脸检测方法,能同时平衡算法速度和精度要求.首先对图像进行肤色区域提取,然后对肤色区域进行基于偏微分方程的形态学处理,对区域形状进行大小粗过滤;接着对粗过滤后的肤色区域对应的原图灰度图运用人眼的几何特征进行人眼粗定位;最后提出一种相关系数判断的方法精确定位人眼,从而确定出人脸区域.     

基于方差估计的快速稀疏表示目标跟踪算法研究

针对粒子滤波框架下稀疏表示跟踪算法存在的粒子规模大以及复杂的L1范数最小化计算等问题,提出一种基于方差估计的快速稀疏表示目标跟踪算法.该算法首先在运动估计阶段应用方差估计优化采样粒子的分布;然后利用L2范数代替L1范数对判别目标函数进行稀疏求解计算,并进一步从重构误差的度量形式做出改进来增强L2范数的稀疏性;最后利用在...     

A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram

INTRODUCTION To compute the minimum distance between two convex polygons or polyhedrons is often a main step of many applications, such as collision detection (Choi et al., 2006; Li et al., 2003), path planning. In order to reduce the time complexity of the algorithm as much as possible, the convex property must be applied fully. Edelsbrunner (1985) proposed an algorithm for computing the minimum distance between two dis- joint convex polygons. The algorithm takes O(logm logn) time, and …     

A fast motion estimation algorithm for mobile communications

The limitation of processing power, battery life and memory capacity of portable terminals requires reducing encoding complexity in mobile communications. Motion estimation (ME) is the most computationally intensive module in a typical video codec, which determines not only the encoder's performance but also the reconstructed video quality. In this paper, a fast ME algorithm for H.264/AVC baseline profile coding is proposed based on the analysis of motion vector field and error surface, and the statistical distributions of different type macroblocks (MBs). Simulation results showed that: in comparison with MVFAST, the proposed algorithm can decrease the computational load over 7.2% with no requirement of expanding memory capacity while maintaining the same video quality as MVFAST. Furthermore, its simplicity makes it easy to be implemented on hardware.     

基于集合运算的最大频繁项目集生成算法

对Pincer—Search进行了改进，提出了一种新的发现最大频繁项目集的算法NDMFS。由于NDMFS算法采用了位阵存储技术和自底向上、自顶向下双向搜索策略，从而进一步提高了算法的效率，显著降低了系统的I／O成本和CPU时间。     

A fast motion estimation algorithm for mobile communications

The limitation of processing power, battery life and memory capacity of portable terminals requires reducing encoding complexity in mobile communications. Motion estimation (ME) is the most computationally intensive module in a typical video codec, which determines not only the encoder’s performance but also the reconstructed video quality. In this paper, a fast ME algorithm for H.264/AVC baseline profile coding is proposed based on the analysis of motion vector field and error surface, and the statistical distributions of different type macroblocks (MBs). Simulation results showed that: in comparison with MVFAST, the proposed algorithm can decrease the computational load over 7.2% with no requirement of expanding memory capacity while maintaining the same video quality as MVFAST. Furthermore, its simplicity makes it easy to be implemented on hardware.     

A novel dynamic equivalence method for grid-connected wind farm

Dynamic equivalence of the wind farm is a fundamental problem in the simulation of a power system connected with wind farms because it is unpractical to model every generator in a wind farm in detail. In this paper, an Equivalence Method based on the Output Characteristics （EMOC） is proposed, with which the wind farm composed of Squirrel-Cage Induction Generators （SCIGs） can be equivalent to one generator. By considering the diversity of wind generators and special operating characteristics of a wind farm, the equivalent generator based on EMOC responds accurately in various faults. No matter whether the wind farm is integrated in grid or just programmed, EMOC can be used to acquire an accurate equivalent generator. Simulation of the dynamic equivalence of an SCIG wind farm validated the method.     

对称Toeplitz矩阵特征值的快速算法

利用n阶对称Toeplitz矩阵的结构特点和对称性,给出了计算该类矩阵所有特征值的一个快速算法,该算法的计算复杂度仅为O(n2logn).