基于文档文字特征的碎纸机碎片拼接算法

针对经碎纸机粉碎的文档碎片,提出拼接复原的模型并研制了相应的算法。首先研究文档碎片边界像素特征,据此提出碎片横向拼接的两种算法;然后,研究行高、字体间间距以及字体大小等文本特征,据此提出针对经横向拼接形成的水平残条的纵向拼接算法。最后根据算法编写Matlab程序,并进行实验,结果表明该算法效果良好。     

采用主监视窗扩展技术的增强现实三维注册方法

在增强现实三维注册中,采用重新检测策略时顿卡现象严重。提出一种采用主监视窗扩展技术的增强现实三维注册方法。在检测阶段,引入特征点可信度和主监视窗,并设计主监视窗的分割、扩展和调控策略,大幅提升了计算速度;在跟踪阶段,采用基于图像金字塔的光流算法进行特征点跟踪。实验证明,该方法不仅有效缓解了顿卡现象,也提升了系统整体的实时性。     

基于直方图的水墨画艺术风格研究

基于内容的照片或自然图像分析和检索已经得到广泛的研究,但多数都基于颜色特征,不能直接用于水墨画艺术作品的分析。对图像进行预处理,提出基于灰度直方图描述水墨画笔道力度分布信息及构图风格,并利用神经网络学习水墨画整体技法风格特征,依据此特征进行不同艺术家间的分类。实验结果表明,通过对整体风格特征的提取,直方图模型能够有效表征画家不同的艺术风格,实现了水墨画的自动分类。     

基于改进卡方统计的微博特征提取方法

通过对微博文本特征信息的分析与研究,提出一种基于改进卡方统计的微博特征提取方法。扩充微博信息分类特征,在传统的卡方统计量的基础上,引入了频度等因素,改进特征选择方法;在传统的特征项权值计算的基础上,提出了新的改进卡方统计量的方法,改进权重计算效果。对上述方法利用经典KNN和SVM算法进行了测试,实验结果表明该方法提高了微博信息分类的准确率。     

多尺度空间特征提取的脊柱图像拼接算法

针对脊柱图像视野有限,提出一种基于优化MSFE的脊柱图像自动拼接算法。设计出一种基于尺度因子变化的高斯卷积模板尺寸自适应调整以及双向配对办法;相似性度量采用城市距离;利用RANSAC算法去除错配,从而确定待拼接图像之间的变换参数,最后利用加权平均对图像融合。对实际取得的多幅脊柱图像拼接结果表明该算法具有很好的实时性和鲁棒性。     

基于退化四元小波变换的纸币识别

针对如何提取纸币图像特征和提高识别率的问题,综合利用退化四元小波变换具有的相位特性,提出一种基于退化四元小波变换的纸币识别方法.该方法首先对采集的纸币图像进行倾斜校正和边缘检测,然后运用退化四元小波对纸币图像进行分解操作,并对分解系数进行统计分析,将每个分解子带系数的能量和标准差作为该纸币图像的特征向量,最后将支持向量机作为分类器对纸币图像进行识别.本文方法在资源约束的嵌入式清分系统上实现,实验结果表明采用本文提出的算法突破了传统纸币识别系统识别率很难再提高的瓶颈,同时能够满足清分系统的实时性要求.     

我国玻璃纤维复合材料新时期的特点与对策

本文综合论证了玻璃纤维及其主要用途的复合材料工业概况,指出我国玻璃纤维复合材料工业已经进入一个新的发展时期.过去是以发展速度为主要特征,现在则以产品应用、质量提高为重要标志.本文对新时期我国玻璃纤维复合材料的技术方向和行业管理提出建议.     

基于数据分布的聚类联邦学习

联邦学习(federated learning)可以解决分布式机器学习中基于隐私保护的数据碎片化和数据隔离问题。在联邦学习系统中,各参与者节点合作训练模型,利用本地数据训练局部模型,并将训练好的局部模型上传到服务器节点进行聚合。在真实的应用环境中,各节点之间的数据分布往往具有很大差异,导致联邦学习模型精确度较低。为了解决非独立同分布数据对模型精确度的影响,利用不同节点之间数据分布的相似性,提出了一个聚类联邦学习框架。在Synthetic、CIFAR-10和FEMNIST标准数据集上进行了广泛实验。与其他联邦学习方法相比,基于数据分布的聚类联邦学习对模型的准确率有较大提升,且所需的计算量也更少。     

Discriminative multi-task objects tracking with active feature selection and drift correction

In this paper, we propose a discriminative multi-task objects tracking method with active feature selection and drift correction. The developed method formulates object tracking in a particle filter framework as multi-Task discriminative tracking. As opposed to generative methods that handle particles separately, the proposed method learns the representation of all the particles jointly and the corresponding coefficients are similar. The tracking algorithm starts from the active feature selection scheme, which adaptively chooses suitable number of discriminative features from the tracked target and background in the dynamic environment. Based on the selected feature space, the discriminative dictionary is constructed and updated dynamically. Only a few of them are used to represent all the particles at each frame. In other words, all the particles share the same dictionary templates and their representations are obtained jointly by discriminative multi-task learning. The particle that has the highest similarity with the dictionary templates is selected as the next tracked target state. This jointly sparsity and discriminative learning can exploit the relationship between particles and improve tracking performance. To alleviate the visual drift problem encountered in object tracking, a two-stage particle filtering algorithm is proposed to complete drift correction and exploit both the ground truth information of the first frame and observations obtained online from the current frame. Experimental evaluations on challenging sequences demonstrate the effectiveness, accuracy and robustness of the proposed tracker in comparison with state-of-the-art algorithms.     

Multi-resolution feature fusion for face recognition

For face recognition, image features are first extracted and then matched to those features in a gallery set. The amount of information and the effectiveness of the features used will determine the recognition performance. In this paper, we propose a novel face recognition approach using information about face images at higher and lower resolutions so as to enhance the information content of the features that are extracted and combined at different resolutions. As the features from different resolutions should closely correlate with each other, we employ the cascaded generalized canonical correlation analysis (GCCA) to fuse the information to form a single feature vector for face recognition. To improve the performance and efficiency, we also employ “Gabor-feature hallucination”, which predicts the high-resolution (HR) Gabor features from the Gabor features of a face image directly by local linear regression. We also extend the algorithm to low-resolution (LR) face recognition, in which the medium-resolution (MR) and HR Gabor features of a LR input image are estimated directly. The LR Gabor features and the predicted MR and HR Gabor features are then fused using GCCA for LR face recognition. Our algorithm can avoid having to perform the interpolation/super-resolution of face images and having to extract HR Gabor features. Experimental results show that the proposed methods have a superior recognition rate and are more efficient than traditional methods.