基于H.264码率控制的模型参数更新算法

为获得精确的模型参数,从率点选择和模型参数估计2个方面对H.264码率控制算法加以改进,利用一种基于曼哈顿和二维滑动窗口机制相结合的策略,实现高效的率点选择算法,采用加权的线性回归技术,实现有效的模型参数预测。实验结果表明,改进后的算法能改善视频编码质量,提高输出码率的控制精度。     

基于听觉感知模型的多通道语音增强系统

提出以模拟听觉感知模型的非均匀滤波器组为基础的多通道语音增强系统,与基于均匀滤波器组的语音增强系统相比,该方法达到相同频率分辨率所需的通道数较少。采用Itakura-Saito距离对系统进行客观评价,仿真结果表明,该系统增强后的语音比均匀多通道系统增强后的语音具有更好的改善效果。     

基于中心距序降维的聚类算法

为提高金融业务数据集上的聚类质量和聚类效率,提出簇的直径、簇间的相似度这2个概念。利用距离尺度降维的中心距序降维法,将多维数据降至一维,在一维上利用自适应排序聚类算法ASC聚类。该算法和传统的Cobweb算法、K-means算法做对比,实验表明该方法能提高簇间相似度,最大提高200%。     

An EDBoost algorithm towards robust face recognition in JPEG compressed domain

In this paper, we describe a novel multiclass boosting algorithm, EDBoost, to achieve robust face recognition directly in JPEG compressed domain. In comparison with existing boosting algorithms, the proposed EDBoost exploits Euclidean distance (ED) to eliminate non-effective weak classifiers in each iteration of the boosted learning, and hence improves both feature selection and classifier learning by using fewer weak classifiers and producing lower error rates. When applied to face recognition, the EDBoost algorithm is capable of selecting the most discriminative DCT features directly in JPEG compressed domain to achieve high recognition performances. In addition, a new DC replacement scheme is also proposed to reduce the effect of illumination changes. In comparison with the existing techniques, the proposed scheme achieves robust face recognition without losing the important information carried by all DC coefficients. Extensive experiments support the conclusion that the proposed algorithm outperforms all representative existing techniques in terms of boosted learning, multiclass classification, lighting effect reduction and face recognition rates.     

Finding an Euclidean anti--centrum location of a set of points

An obnoxious facility is to be located inside a polygonal region of the plane, maximizing the sum of the k smallest weighted Euclidean distances to n given points, each protected by some polygonal forbidden region. For the unweighted case and k fixed an O(n²logn) time algorithm is presented. For the weighted case a thorough study of the relevant structure of the multiplicatively weighted order-k-Voronoi diagram leads to the design of an O(kn³+n³logn) time algorithm for finding an optimal solution to the anti-t-centrum problem for every t=1,…,k, simultaneously.     

基于2D-Gabor滤波器的虹膜识别算法实现

利用虹膜图像中丰富的结构和纹理特征作为身份鉴别的依据,与其他生物特征识别相比,具有更高的可靠性。根据虹膜内外灰度差,采用二值化方法提取瞳孔,用Canny算子精确定位虹膜的内边缘,利用微分积分算子定位外边缘,并对虹膜进行归一化、校准、增强等预处理;再利用2D-Gabor滤波提取纹理特征,最后比较Hamming距离,进行匹配与识别。实验结果表明,该方法效果良好,识别率高。     

A bounded distance metric for comparing tree structure

Comparing tree-structured data for structural similarity is a recurring theme and one on which much effort has been spent. Most approaches so far are grounded, implicitly or explicitly, in algorithmic information theory, being approximations to an information distance derived from Kolmogorov complexity. In this paper we propose a novel complexity metric, also grounded in information theory, but calculated via Shannon's entropy equations. This is used to formulate a directly and efficiently computable metric for the structural difference between unordered trees. The paper explains the derivation of the metric in terms of information theory, and proves the essential property that it is a distance metric. The property of boundedness means that the metric can be used in contexts such as clustering, where second-order comparisons are required. The distance metric property means that the metric can be used in the context of similarity search and metric spaces in general, allowing trees to be indexed and stored within this domain. We are not aware of any other tree similarity metric with these properties.     

基于语义相似度的Web服务匹配研究

现有的语义Web服务匹配算法没有考虑到本体概念间的多元关系,导致概念的语义不能被完整地反映出来,从而影响了算法的匹配性能。利用本体概念间的多元关系定义了一种语义距离,并通过该语义距离给出了概念间的语义相似度计算方法,在此基础上提出基于语义相似度的Web服务匹配算法。该算法通过本体概念间的语义相似度来反映Web服务的匹配程度。最后,通过对比实验验证了该算法的可行性和有效性。     

一种基于联合轮廓特征矢量的目标识别方法

针对基于形状特征进行目标识别的方法存在的不足,提出一种联合轮廓不变矩特征和轮廓几何特征的识别方法;针对不同的待识别目标,采集足够数量的训练样本,统计每一个轮廓特征的均值、标准差和变异系数;并据此对这些轮廓特征进行动态筛选和加权,建立起待识别目标的联合轮廓特征矢量模型.在线识别时,提取场景目标的联合轮廓特征矢量,对其进行...     

结合Harris角点检测和不变质心的稳健图像Hash算法

提出了应用Harris角点检测和不变质心的图像Hash算法.算法从仿射变换的数学模型出发,利用仿射前后图像质心位置的不变特性,计算Harris角点与不变质心的欧氏距离作为特征向量,最后经编码量化产生图像Hash.实验结果表明:本算法对视觉可接受的JPEG压缩、滤波等具有良好的鲁棒性,而恶意扰动或篡改则会改变Hash值....