A novel adjustable multiple cross-hexagonal search algorithm for fast block motion estimation

In this paper,we propose a novel adjustable multiple cross-hexagonal search(AMCHS) algorithm for fast block motion estimation. It employs adjustable multiple cross search patterns(AMCSP) in the first step and then uses half-way-skip and half-way-stop technique to determine whether to employ two hexagonal search patterns(HSPs) subsequently. The AMCSP can be used to find small motion vectors efficiently while the HSPs can be used to find large ones accurately to ensure prediction quality. Simulation results showed that our proposed AMCHS achieves faster search speed,and provides better distortion performance than other popular fast search algorithms,such as CDS and CDHS.     

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.     

基于地理信息的最短交通线路启发式搜索算法

文章通过分析以往算法在公交线路最短倒换路径查询方面的盲目性,提出了一种基于地理信息的启发式搜索算法,并对该算法做了一些改进。     

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

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

Nearest neighbor search algorithm based on multiple background grids for fluid simulation

The core of smoothed particle hydrodynamics (SPH) is the nearest neighbor search subroutine. In this paper, a nearest neighbor search algorithm which is based on multiple background grids and support variable smooth length is introduced. Through tested on lid driven cavity flow, it is clear that this method can provide high accuracy. Analysis and experiments have been made on its parallelism, and the results show that this method has better parallelism and with adding processors its accuracy become higher, thus it achieves that efficiency grows in pace with accuracy.     

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 …