面部运动单元检测研究综述

面部运动单元检测旨在让计算机从给定的人脸图像或视频中自动检测需要关注的运动单元目标。经过二十多年的研究，尤其是近年来越来越多的面部运动单元数据库的建立和深度学习的兴起，面部运动单元检测技术发展迅速。首先，阐述了面部运动单元的基本概念，介绍了已有的常用面部运动单元检测数据库，概括了包括预处理、特征提取、分类器学习等步骤在内的传统检测方法；然后针对区域学习、面部运动单元关联学习、弱监督学习等几个关键研究方向进行了系统性的回顾梳理与分析；最后讨论了目前面部运动单元检测研究存在的不足以及未来潜在的发展方向。     

Retinal Vessel Extraction Framework Using Modified Adaboost Extreme Learning Machine

An explicit extraction of the retinal vessel is a standout amongst the most significant errands in the field of medical imaging to analyze both the ophthalmological infections, for example, Glaucoma, Diabetic Retinopathy (DR), Retinopathy of Prematurity (ROP), Age-Related Macular Degeneration (AMD) as well as non retinal sickness such as stroke, hypertension and cardiovascular diseases. The state of the retinal vasculature is a significant indicative element in the field of ophthalmology. Retinal vessel extraction in fundus imaging is a difficult task because of varying size vessels, moderately low distinction, and presence of pathologies such as hemorrhages, microaneurysms etc. Manual vessel extraction is a challenging task due to the complicated nature of the retinal vessel structure, which also needs strong skill set and training. In this paper, a supervised technique for blood vessel extraction in retinal images using Modified Adaboost Extreme Learning Machine (MAD-ELM) is proposed. Firstly, the fundus image preprocessing is done for contrast enhancement and in-homogeneity correction. Then, a set of core features is extracted, and the best features are selected using “minimal Redundancy-maximum Relevance (mRmR).” Later, using MAD-ELM method vessels and non vessels are classified. DRIVE and DR-HAGIS datasets are used for the evaluation of the proposed method. The algorithm’s performance is assessed based on accuracy, sensitivity and specificity. The proposed technique attains accuracy of 0.9619 on the DRIVE database and 0.9519 on DR-HAGIS database, which contains pathological images. Our results show that, in addition to healthy retinal images, the proposed method performs well in extracting blood vessels from pathological images and is therefore comparable with state of the art methods.     

一种二元域上的快速计算哈希函数

论文从映射的角度,将哈希函数分为三类:严格哈希函数、计算哈希函数和实用哈希函数。在此基础上,根据二元域上二次方程x2 x c=0的部分不可解的性质,构造了一种计算哈希函数,它满足单向性和一一对应性,同时具有运算速度快的优点。     

High‐error approximate dictionary search using estimate hash comparisons

A method for finding all matches in a pre‐processed dictionary for a query string q and with at most k differences is presented. A very fast constant‐time estimate using hashes is presented. A tree structure is used to minimize the number of estimates made. Practical tests are performed, showing that the estimate can filter out 99% of the full comparisons for 40% error rates and dictionaries of up to four million words. The tree is found to be efficient up to a 50% error rate. Copyright © 2006 John Wiley & Sons, Ltd.     

Hash算法在数据库安全中的应用

介绍了Hash算法在数据库加密系统中的应用,包括在用户身份验证中的应用,在数据库完整性认证中的应用,以及在密文检索中的应用。     

Land‐use dynamic discovery based on heterogeneous mobility sources

Nowadays, cities are the most relevant type of human settlement and their population has been endlessly growing for decades. At the same time, we are witnessing an explosion of digital data that capture many different aspects and details of city life. This allows detecting human mobility patterns in urban areas with more detail than ever before. In this context, based on the fusion of mobility data from different and heterogeneous sources, such as public transport, transport‐network connectivity and Online Social Networks, this study puts forward a novel approach to uncover the actual land use of a city. Unlike previous solutions, our work avoids a time‐invariant approach and it considers the temporal factor based on the assumption that urban areas are not used by citizens all the time in the same manner. We have tested our solution in two different cities showing high accuracy rates.     

井下人员定位系统读卡器存储算法分析与测试

从查找时间与存储容量2个方面分析了适用于井下人员定位系统读卡器的3种存储算法,即链式存储算法、哈希表存储算法和哈希二叉树存储算法,给出了该3种不同存储算法的使用效率与应用场合。测试结果表明,链式存储算法查找时间呈线性增长,哈希表存储算法明显优越于链式存储算法,如果测试数据增多,其优越性会更明显;当数据量较大时,哈希搜索二叉树存储算法又明显优于哈希表存储算法,当人数达到行业所要求的8 000人以上时,选择哈希搜索二叉树存储算法更为合理。     

结合奇异值分解和二维变分模态分解的紧凑图像哈希算法

图像哈希是通过将图像提取为简短数列,从而快速地从图库中区分出与原图相似或不同图像的方法。利用奇异值分解(SVD)来分解重构减小图像信息的冗余性和二维变分模态分解(2D-VMD)可以将图像分解成一系列不同中心频率的子模态的特性,从时域和频域提取出图像的主要信息序列来构成哈希。仿真结果表明,相比于其他方法,通过SVD和2D-VMD的紧凑图像哈希算法具有较短的运行时间、较好的鲁棒性和唯一性。     

基于几何统计差异性的伪造印鉴识别方法

针对印鉴识别任务中有效印文的提取以及伪造印鉴的识别这两个难点问题,建立在监督分类体系下的印鉴识别系统.利用有效印文与背景的颜色统计差异以及真伪印鉴间的几何统计差异分别解决上述难点.在构建的包含3000个印鉴的印鉴数据库上进行实验,实验结果表明,该方法对于有效印文的提取准确率可达到(95.27±3.73％),对于伪造印鉴的识别准确率可达到97.62％,具有可行性和有效性.     

降维方法监督分类的比较研究

对ISOMap、LDA、LLE、PCA这4种典型降维算法的主要思想和算法步骤进行了详细分析,并将它们用于有监督分类。从实验结果分析得到结论 ,其可为有监督分类提供有益的借鉴。