基于运动方向预测的快速运动估计算法

利用序列图像的相邻块运动矢量的高度相关性和运动矢量的中心偏移特性,提出一种基于运动方向预测的快速运动估计算法。设计4种方向性模板,根据参考运动矢量预测出图像块的运动情况,根据不同的运动方向选择对应的方向性模板进行搜索。实验结果表明,该算法在速度和准确性方面都优于传统的快速运动估计算法。     

改进的Sunday模式匹配算法

在基于模式匹配的检测方法中,匹配效率是检测技术的瓶颈,间接影响入侵检测系统的实时性能。该文对4种模式匹配算法进行分析后,选择最优的Sunday算法进行改进。该算法进行匹配前先找到模式串中的特征字符（出现概率最小的字符）,进行特征字符与尾字符双重匹配,失败则移动尽可能远的距离。实验结果证明匹配效率比Sunday算法有一定的提高。     

一种可视二维条码设计

融合信息隐藏与二维条码编译码技术,提出一种基于图像的可视二维条码设计。对图像进行块误差扩散,得到的半色调图像作为码图,将编码块嵌入置乱后的码图,反置乱使编码块分散在码图中。与以往提出的图像条码相比,该设计注重图像的可视性,可以表达图像信息。实验结果表明,该设计效果较好。     

面向入侵检测的改进BMHS模式匹配算法

模式匹配算法是入侵检测系统中使用较多的一种算法。分析几种常用模式匹配算法,提出一种基于BMHS的改进算法——N-BMHS算法。该算法对字符串进行双向模式匹配,引入一个新的数组s记录模式串中字符的出现次数,次数为1时可以利用已匹配的信息来辅助得到模式串的最大移动距离。实验结果表明,改进的模式匹配算法能减少比较次数,有效提高匹配速度。     

基于小波估计和直方图特征的LSB匹配分析

针对隐写分析中的难点——空域LSB匹配隐写进行检测和分析,描述LSB匹配加性隐写的特点,将匹配隐写建模为图像受到一定强度的脉冲噪声干扰,采用小波变换对退化的图像进行恢复作为载体的估计。对检测图像和恢复图像提取多个直方图特征比值作为特征向量,利用支持向量机对500幅高质量未压缩的自然图像组成的载体、载密图像库进行检测,结果证明该算法在低嵌入率下可获得较好的检测效果。     

基于纹理分析的视差估计算法

针对传统方法难以可靠估计图像中纹理单一像素点视差的问题,提出一种新的基于纹理分析的视差估计算法。与已有方法不同,在以极线约束计算像素点视差时,将极线上纹理单一且近似的像素点合并成直线段,根据连续性和唯一性约束对直线段进行整体匹配,采用直线段的视差得到纹理单一区域的稠密视差图。利用直线段进行整体匹配,提高比较基元包含的信息量,减少扫描范围,从而降低误匹配产生的概率和算法时间复杂度。实验结果表明,该方法能提高纹理单一区域稠密视差图的精度,匹配速度快,具有实用价值。     

Template-based quadrilateral meshing

Generating quadrilateral meshes is a highly non-trivial task, as design decisions are frequently driven by specific application demands. Automatic techniques can optimize objective quality metrics, such as mesh regularity, orthogonality, alignment and adaptivity; however, they cannot make subjective design decisions. There are a few quad meshing approaches that offer some mechanisms to include the user in the mesh generation process; however, these techniques either require a large amount of user interaction or do not provide necessary or easy to use inputs. Here, we propose a template-based approach for generating quad-only meshes from triangle surfaces. Our approach offers a flexible mechanism to allow external input, through the definition of alignment features that are respected during the mesh generation process. While allowing user inputs to support subjective design decisions, our approach also takes into account objective quality metrics to produce semi-regular, quad-only meshes that align well to desired surface features.     

The thin plate spline robust point matching (TPS-RPM) algorithm: A revisit

This paper reviews the TPS-RPM algorithm (Chui and Rangarajan, 2003) for robustly registering two sets of points and demonstrates from a theoretical point of view its inherent limited performance when outliers are present in both point sets simultaneously. A double-sided outlier handling approach is proposed to overcome this limitation with a rigorous mathematical proof as the underlying theoretical support. This double-sided outlier handling approach is proved to be equivalent to the original formulation of the point matching problem. For a practical application, we also extend the TPS-RPM algorithms to non-rigid image registration by registering two sets of sparse features extracted from images. The intensity information of the extracted features are incorporated into feature matching in order to reduce the impact from outliers. Our experiments demonstrate the double-sided outlier handling approach and the efficiency of intensity information in assisting outlier detection.     

On the combinatorial complexity of fuzzy pattern matching in music analysis

In music analysis it is a common requirement to search a musical score for occurrences of a particular musical motif and its variants. This tedious and time-consuming task can be carried out by computer, using one of several models to specify which variants are to be included in the search. The question arises: just how many variants must be explicitly considered? The answer has a profound effect on the computer time needed. In this paper, recurrence relations and closed form analytic expressions are derived for the run time complexity of two models of fuzzy pattern matching for use in music analysis; each model assumes the existence of an atomic exact pattern matching operation. The formulae so obtained are evaluated and tabulated as a function of their independent parameters. These results enable a priori estimates to be made of the relative run times of different music searches performed using either model. This is illustrated by applying the results to an actual musical example.Richard E. Overill, BSc, PhD, C.Math, FIMA, C.Eng, MBCS, MIEE, is Lecturer in Computer Science at King's College London. His research includes the design, analysis, and practical implementation of algorithms on supercomputers. He has also given lecture-recitals on the keyboard music of the Tudor composers Thomas Tallis (1985), John Blitheman (1991), and William Byrd (1993).     

榴弹弹丸质点弹道性能分析与可视化仿真

为提高榴弹设计中的计算分析精度，加快弹种的研发速度，建立了一个弹丸质点弹道模型提出了相应的算法和软件实现；本软件除具有同类软件的计算功能外，还以可视化的形式模拟弹丸在空中的飞行全过程，并生成各种特性曲线，同时具有智能捕捉功能、查询功能。