双目视觉的新颖实时局部2维地图构建方法

根据轮式机器人移动的特点,提出一种采用双目视觉的新颖实时局部2维栅格地图构建算法。首先,提出虚拟高度线投影成像原理,将场景均匀栅格化,在栅格中引入虚拟高度线,并将其投影到立体视觉系统的立体图对中产生投影线,将求解场景点高度值的问题转化为在投影线上和水平视差搜索范围内寻找具有最大相似测度的对应点问题;然后,提出一种新颖的局部2维地图构建方法,该方法以机器人所能越过的最大高度为阈值,对高于阈值部分的虚拟高度投影线上的场景点由其在图像对中的相似测度确定其是否为障碍物区域。实验结果表明,该方法满足机器人导航所要求的有效性和实时性,并可应用到构建3维地图。     

码书距离排序对索引压缩算法的性能改进

图像经过矢量量化后得到的索引图具有很强的统计相关性,从而使得邻近块的索引以较大的概率相等或偏移量较小。按照某种准则对码书进行排序,可以有效增强索引之间的相关性。基于平方欧几里得距离提出一种新的码书按距离排序方法。与传统的按均值、方差和能量等排序方法相比,距离排序能大大提高索引图的相关性,使索引之间的偏移量向值小的方向明显集中。将距离排序后的码书用于AICS(adaptive index coding scheme)算法,实现了更好的压缩性能。     

图像适应算法中非冗余显著图的计算

近些年为了将大尺寸数字图像的内容自适应地显示在手机、PDA（掌上电脑）等屏幕较小的显示终端上以得到更好的显示效果,图像适应得到了很大的关注。现有的大量方法使用了不同的重要度映射来得到最优的图像缩放结果。图像适应算法就是为了去除图像中的不重要信息,为此提出在图像适应方法中使用非冗余显著图的计算来分析不重要信息的位置。首先,引入了图像分解,提出图像高梯度区域的冗余信息。然后,提出纹理梯度的概念,并进一步针对细节信息建立了纹理冗余度分析机制。纹理梯度非常适合卡通图像分析,从而将现有图像适应方法推广到非真实图像。大量实验结果显示,本文方法并不受图像适应算子的影响,该方法对具有复杂背景和包含多目标物体等的图像适应问题都比较鲁棒。     

一种改进的混沌跳频序列的设计方法

现有混沌跳频序列在混沌迭代次数、通信保密性和安全性等方面存在着不足.为解决上述问题,本文通过给出优化的Logistic映射函数,采用了一种改进的利用伪随机序列控制比特抽取来生成混沌跳频序列的方法.该方法各项跳频性能指标与已有研究成果相当,但其混沌迭代次数减少,序列安全性增强.     

一种基于左右视线的立体图像匹配算法

提出了一种有效提高立体匹配中遮挡和低纹理区域匹配精度的方法,算法充分利用立体视觉中的全局约束条件,对不同区域采用不同的约束条件和强度来获得高可靠性点的视差,并且引入左右视线的概念,用于解决复杂场景情况下的左右视图的匹配问题。同时采用改进的协同算法(cooperative algorithm,CA),在视差梯度的约束下,对高可靠性点的视差进行逐步地扩散,最终得到致密的视差图。实验仿真表明,方法可以有效地提高遮挡和低纹理区域中的匹配精度,从而产生较精确的致密视差图。     

一种改进的地图匹配算法及其在移动通信巡检系统中的应用

巡检系统是对人员设备实施量化和动态管理的现代化手段,是促进企业及生产部门实行科学化和信息化管理的重要步骤,目前在石油行业管线和井位巡查管理、电力行业线路和设备巡查管理和通讯行业线路和设备巡查管理、铁路及安全设备巡查管理等领域都有广泛的应用。结合移动通信巡检工作的实际情况,本文提出了一种改进的基于最短路径的地图匹配(Map Matching)算法。在全球定位系统(GPS)数据的采样时间间隔较长的情况下能较准确地对定位点进行地图匹配,能够绘制出与电子地图道路信息相符的定位轨迹,并在长沙移动基站线路巡视巡检系统中得到实现。     

One-way hash function construction based on 2D coupled map lattices

An algorithm for constructing one-way hash function based on spatiotemporal chaos is proposed. A two-dimensional coupled map lattices (2D CML) with parameters leading to the largest Lyapunov exponent is employed. The state of the 2D CML is dynamically determined by its previous state and the message bit at the corresponding positions. The hash value is obtained by a linear transform on the final state of the 2D CML. Theoretical analysis and computer simulation indicate that our algorithm has good statistical properties, strong collision resistance and high flexibility. It is practical and reliable, with high potential to be adopted as a strong hash function for providing data integrity.     

A hardware design of a massive-parallel, modular NN-based vector quantizer for real-time video coding

This report describes the design of a modular, massive-parallel, neural-network (NN)-based vector quantizer for real-time video coding. The NN is a self-organizing map (SOM) that works only in the training phase for codebook generation, only at the recall phase for real-time image coding, or in both phases for adaptive applications. The neural net can be learned using batch or adaptive training and is controlled by an inside circuit, finite-state machine-based hard controller. The SOM is described in VHDL and implemented on electrically (FPGA) and mask (standard-cell) programmable devices.     

Standardising vulnerability categories

Each vulnerability scanner (VS) represents, identifies and classifies vulnerabilities in its own way, thus making the different scanners difficult to study and compare. Despite numerous efforts by researchers and organisations to solve the disparity in vulnerability names used in the different VSs, vulnerability categories have still not been standardised. This paper highlights the importance of having a standard vulnerability category set. It also outlines an approach towards achieving this goal by generating a standard set of vulnerability categories. A data-clustering algorithm that employs artificial intelligence is used for this purpose. The significance of this research results from having an intelligent technique that aids in the generation of standardised vulnerability categories in a relatively fast way. In addition, the technique is generic in the sense that it allows one to accommodate any VS currently known on the market to create such vulnerability categories. Another benefit is that the approach followed in this paper allows one to also compare various VSs currently available on the market. A prototype is presented to verify the concept.     

Mining e-Learning domain concept map from academic articles

Recent researches have demonstrated the importance of concept map and its versatile applications especially in e-Learning. For example, while designing adaptive learning materials, designers need to refer to the concept map of a subject domain. Moreover, concept maps can show the whole picture and core knowledge about a subject domain. Research from literature also suggests that graphical representation of domain knowledge can reduce the problems of information overload and learning disorientation for learners. However, construction of concept maps typically relied upon domain experts in the past; it is a time consuming and high cost task. Concept maps creation for emerging new domains such as e-Learning is even more challenging due to its ongoing development nature. The aim of this paper is to construct e-Learning domain concept maps from academic articles. We adopt some relevant journal articles and conference papers in e-Learning domain as data sources, and apply text-mining techniques to automatically construct concept maps for e-Learning domain. The constructed concept maps can provide a useful reference for researchers, who are new to the e-Leaning field, to study related issues, for teachers to design adaptive learning materials, and for learners to understand the whole picture of e-Learning domain knowledge.