基于小波变换的棉花异纤检测算法研究

研究棉花中异性纤维的检测问题,提高检测准确度。针对棉花异纤检测,当棉花中混有头发丝等与棉花纹理相似的线状异纤时,传统的单一尺度的边缘检测算法不能将线状异纤准确检测出来,造成检测准确度不高的问题。为解决上述问题,提出一种小波变换的棉花异纤检测方法,通过将棉花图像分割为多个连通区域,并对各区域进行多尺度小波变换,然后计算并设定每个区域的检测阈值,最后利用检测阈值完成异纤检测,可避免传统单一尺度的边缘检测方法不能准确识别线状异纤的问题。实验证明,改进方法能够准确地将线状异纤准确检测出来,具有很高的检测准确度,取得了满意的结果。     

基于种群多样性的自适应PSO算法求解VRPSPD问题

为有效求解逆向物流车辆路径(VRPSPD)模型,本文提出一种基于种群多样性的自适应PSO算法(SDAPSO)。在SDAPSO运行时,根据种群多样性,自适应地对种群中运行较差的粒子进行扰动操作,提升这些粒子向最优解收敛的能力;同时,对全局最优粒子进行概率扰动,以增加种群的多样性。标准检测函数的仿真结果表明SDAPSO算法是对基本PSO算法的有效改进。在对VRPSPD模型求解中,通过与其它粒子群算法相比,表明SDAPSO是求解该类问题的一种有效方法。     

支持多种闪存启动的U-Boot实现方法的改进

标准的U-Boot目前不支持从NAND Flash启动,而现有的修改U-Boot实现从NAND Flash启动的方法无法识别新的大页NAND Flash,也没有进行坏块检测。针对上述问题,提出获取NAND Flash页大小和块大小信息的通用方法,并实现了坏块检测功能。此外,对现有的上电后自动识别系统是从NOR还是从NAND Flash启动的方法进行了改进。将U-Boot-2010.09修改并移植到基于S3C2440A处理器的mini2440开发板上,运行结果表明,实现了U-Boot从NOR和NAND Flash的双启动,扩展了U-Boot的功能。     

图像中的文本定位技术研究综述

介绍了图像中文本定位技术的研究现状,依据定位所利用的特征进行分类,分析了其中几种典型算法,并对文本定位算法的性能评价标准进行了深入讨论。     

基于邻域彩色变化矢量场的图像边缘检测技术研究*

首先进行了边缘检测系统结构设计,建立了图像邻域彩色变化矢量场的数理模型,提出了用图像邻域彩色变化方向锐度描述图像边缘,进而应用模糊聚类自适应检测边缘.实验表明:与基于梯度的边缘检测技术相比,该方法在噪声抑制以及边缘准确定位上均取得了好的效果,是一种应用广泛的优秀边缘检测算法.     

Analysis and tuning of adaptive generalized predictive control

The adaptive Generalized Predictive Controller (Clarke et al., 1987a, b) is capable of controlling plants with variable dead-time, unknown model orders and unstable poles and zeros. This paper shows how the GPC control law can be written in an equivalent general linear transfer function form which simplifies closed-loop (eg. root locus) analysis. Three recommended strategies for selecting the design parameters during the commissioning stage allow the user to adjust the closed-loop speed of response on-line using only a single active tuning parameter. Experimental runs confirm the ability of adaptive GPC to provide a consistent closed-loop response in spite of large process changes.     

Data-mining based SQL injection attack detection using internal query trees

Detecting SQL injection attacks (SQLIAs) is becoming increasingly important in database-driven web sites. Until now, most of the studies on SQLIA detection have focused on the structured query language (SQL) structure at the application level. Unfortunately, this approach inevitably fails to detect those attacks that use already stored procedure and data within the database system. In this paper, we propose a framework to detect SQLIAs at database level by using SVM classification and various kernel functions. The key issue of SQLIA detection framework is how to represent the internal query tree collected from database log suitable for SVM classification algorithm in order to acquire good performance in detecting SQLIAs. To solve the issue, we first propose a novel method to convert the query tree into an n-dimensional feature vector by using a multi-dimensional sequence as an intermediate representation. The reason that it is difficult to directly convert the query tree into an n-dimensional feature vector is the complexity and variability of the query tree structure. Second, we propose a method to extract the syntactic features, as well as the semantic features when generating feature vector. Third, we propose a method to transform string feature values into numeric feature values, combining multiple statistical models. The combined model maps one string value to one numeric value by containing the multiple characteristic of each string value. In order to demonstrate the feasibility of our proposals in practical environments, we implement the SQLIA detection system based on PostgreSQL, a popular open source database system, and we perform experiments. The experimental results using the internal query trees of PostgreSQL validate that our proposal is effective in detecting SQLIAs, with at least 99.6% of the probability that the probability for malicious queries to be correctly predicted as SQLIA is greater than the probability for normal queries to be incorrectly predicted as SQLIA. Finally, we perform additional experiments to compare our proposal with syntax-focused feature extraction and single statistical model based on feature transformation. The experimental results show that our proposal significantly increases the probability of correctly detecting SQLIAs for various SQL statements, when compared to the previous methods.     

基于并查集和边缘检测模板的非理想虹膜定位

非理想虹膜图像往往存在虹膜边缘模糊、灰度变化不均匀、位置偏移及光斑干扰等问题, 这些问题的存在会在一定程度上影响虹膜内、外边界定位的准确率. 针对这个问题, 本文提出采用并查集和边缘检测模板的方法来对非理想虹膜进行内、外边界定位. 内边界定位是首先采用并查集方法完成瞳孔区域粗定位, 然后采用Hough变换对瞳孔进行精确定位; 外边界定位是先利用一系列边缘检测模板大致确定外圆的位置, 然后再依据外边界附近圆环内边缘点的密度来最终完成外边界的精确定位. 实验结果表明, 对于非理想虹膜图像, 本文方法的定位正确率和定位速度均高于其他同类方法.     

基于FPGA实现AES的侧信道碰撞攻击

为了解决攻击点在能量迹中具体位置的识别问题,在对侧信道碰撞攻击技术研究的基础上,提出了通过计算能量迹中每个采样点的方差来识别攻击点的方差检查技术。并利用基于相关系数的碰撞检测方法,对一种AES的FPGA实现实施了攻击。实验结果表明,方差检查技术可以有效地识别攻击点在能量迹中的具体位置。     

Face detection by structural models

Despite the successes in the last two decades, the state-of-the-art face detectors still have problems in dealing with images in the wild due to large appearance variations. Instead of leaving appearance variations directly to statistical learning algorithms, we propose a hierarchical part based structural model to explicitly capture them. The model enables part subtype option to handle local appearance variations such as closed and open month, and part deformation to capture the global appearance variations such as pose and expression. In detection, candidate window is fitted to the structural model to infer the part location and part subtype, and detection score is then computed based on the fitted configuration. In this way, the influence of appearance variation is reduced. Besides the face model, we exploit the co-occurrence between face and body, which helps to handle large variations, such as heavy occlusions, to further boost the face detection performance. We present a phrase based representation for body detection, and propose a structural context model to jointly encode the outputs of face detector and body detector. Benefit from the rich structural face and body information, as well as the discriminative structural learning algorithm, our method achieves state-of-the-art performance on FDDB, AFW and a self-annotated dataset, under wide comparisons with commercial and academic methods.