共查询到18条相似文献,搜索用时 46 毫秒
1.
2.
3.
4.
5.
6.
目的快速且精准地检测啤酒箱常见的印刷缺陷。方法以啤酒箱面纸为检测目标,通过提取模板图像中形状和灰度值信息构建差异模型的模板匹配方法,对啤酒箱印刷中常见的缺陷特征进行检测,根据检测结果判断印刷质量是否合格,并通过检测验证实验对质量检测方案的效果进行评估。结果通过对所采集的500张图像进行检测实验并统计结果,该方法的平均准确率达到96.18%,漏检率小于0.9%,误判率为3.08%,平均检测耗时低于10 ms。结论使用该方法对啤酒箱面纸这类胶印制品进行质量检测的效果优秀且稳定,可以对细小划痕等高精度要求的缺陷进行精准检测,而且检测速度也快于其他方法。 相似文献
7.
8.
9.
运用肤色信息和模板匹配的彩色人脸检测 总被引:3,自引:0,他引:3
人脸是一个复杂的模式,在图像中自动地对其进行定位和分割是进行人脸识别的第一步。本文提出一种运用肤色信息和模板匹配的人脸检测方法。该方法先进行肤色分割,然后对每一个人脸候选区域进行形状比例的分析,最后进行模板匹配。实验结果表明,该方法对任意背景下,任意姿态及任意数目的人脸检测非常有效。 相似文献
10.
11.
基于SSDA的模板匹配法在指纹识别中的应用 总被引:2,自引:0,他引:2
基于细节提取的指纹识别算法需要进行复杂的预处理,直接FFT求相关系数法计算量很大.提出了一种结合SSDA和模板匹配法的指纹识别算法.试图简化处理过程,提高处理速度.其基本思想是采用序贯相似性检测算法(SSDA)快速得到候选匹配子图,再通过求子图与模板的相关系数来判别两幅指纹图像是否匹配.采用指纹库中的指纹图像进行了大量实验.实验表明,该算法简化了处理过程,相对于直接FFT求相关系数法,运算速度提高了近10倍. 相似文献
12.
针对生产过程中物料计数方法存在的缺陷,研究了一种改进的模板匹配算法进行物料数量检测。通过基于双模板搜索方式和位置约束系数r改进传统模板匹配算法(template matching algorithm,TMA),优化寻找最佳匹配图像的过程获得最优解,并以此进行图像拼接,完成物料计数。与传统模板匹配算法(TMA)和高斯金字塔优化的模板匹配算法(Gaussian pyramid transformation,GPT)进行实验对比,证明所提算法较其他2种算法在处理每一张样本图片的时间上分别由0.013s、0.011s缩短到0.008s,在计数准确度上分别由77.32%、84.94%提高到97.36%以上,并且在拼接精度上也优于其他2种算法,实验结果验证了所提算法的有效性。 相似文献
13.
As a core component of the network, web applications have become one of the preferred targets for attackers because the static configuration of web applications simplifies the exploitation of vulnerabilities by attackers. Although the moving target defense (MTD) has been proposed to increase the attack difficulty for the attackers, there is no solo approach can cope with different attacks; in addition, it is impossible to implement all these approaches simultaneously due to the resource limitation. Thus, the selection of an optimal defense strategy based on MTD has become the focus of research. In general, the confrontation of two players in the security domain is viewed as a stochastic game, and the reward matrices are known to both players. However, in a real security confrontation, this scenario represents an incomplete information game. Each player can only observe the actions performed by the opponent, and the observed actions are not completely accurate. To accurately describe the attacker’s reward function to reach the Nash equilibrium, this work simulated and updated the strategy selection distribution of the attacker by observing and investigating the strategy selection history of the attacker. Next, the possible rewards of the attacker in each confrontation via the observation matrix were corrected. On this basis, the Nash-Q learning algorithm with reward quantification was proposed to select the optimal strategy. Moreover, the performances of the Minimax-Q learning algorithm and Naive-Q learning algorithm were compared and analyzed in the MTD environment. Finally, the experimental results showed that the strategy selection algorithm can enable defenders to select a more reasonable defensive strategy and achieve the maximum possible reward. 相似文献
14.
单个机器人在面对大尺度环境时,建图结果往往存在较大误差。由多个机器人创建出局部地图后进行拼接可以很好地解决这一问题。本文提出了一种基于霍夫变换与模板匹配的地图拼接方法。首先,利用霍夫变换检测局部地图中的直线段,根据最长直线段斜率将局部地图正交方向重对准。然后利用Harris角点检测算法检测局部地图中的角点,并以角点为中心,提取模板图像。最后利用模板匹配算法将模板图像与另一局部地图进行匹配,获取两局部地图之间的刚体变换矩阵,实现地图拼接。实验表明,该方法对尺度较大的现实环境具有很好的实用性。 相似文献
15.
目的通过机器视觉技术解决当前医药产业迅猛发展带来的批量生产药粒无法高效、精确计数等难题,提出基于视觉技术的药片特征二次匹配算法。方法药粒预处理后分割为多连通域,采用面积特征选择形状特征差异较大的2颗药粒为感兴趣区域,待膨胀后作为目标的先验模型,Canny算子提取边缘轮廓,同时计算轮廓点的方向向量。采用3层图像金字塔搜索算法加快匹配效率,并用最小二乘法调整模板的匹配精度,使匹配精度达到亚像素级别。结果通过对不同的椭圆形药粒进行实验分析,将匹配模板1和模板2(缩放比为1∶1)的最小匹配分数阈值分别设为0.63和0.59,采用3层图像金字塔搜索算法,从创建模板到匹配计数只需要0.11 s,相较于3层金字塔(缩放比为0.7~1.0,最小匹配分数为0.6)的单模板匹配算法速度快0.07 s,且对部分重叠的药片仍能有效计数,匹配准确率达100%。结论采用药片颗粒二次匹配技术可实现检测速度上的扩增;采用图像金字塔搜索算法可大幅度缩减匹配时间;采用最小二乘法可提高模板的匹配精度,增大药粒匹配的正确率。 相似文献
16.
17.
用于地形匹配的快速光电图像识别器 总被引:4,自引:0,他引:4
构建了一个用于地形匹配的紧凑型快速光电图像识别器。系统的工作原理是利用空间移位编码方法,在非相干光相关器中一步完成灰阶图象绝对差度量处理,有效地实现图像的模式识别。光学处理的结果通过计算机的阈值分割方法来实现对目标的准确判断。系统基于非相干光相关器,不仅结构简单,并且对输入图像的尺度、旋转、位移及照度的畸变具有一定的不变性。对实时输入的图像具有每秒钟13幅的识别速度,识别正确率大于90%,对8°以内的旋转畸变、30%以内的Gauss噪声干扰以及50%以内的图像缺损具有相当好的容错能力。 相似文献
18.
Lingyun Xiang Guohan Zhao Qian Li Gwang-Jun Kim Osama Alfarraj Amr Tolba 《计算机、材料和连续体(英文)》2021,67(1):267-282
Multiple kernel clustering is an unsupervised data analysis method that has been used in various scenarios where data is easy to be collected but hard to be labeled. However, multiple kernel clustering for incomplete data is a critical yet challenging task. Although the existing absent multiple kernel clustering methods have achieved remarkable performance on this task, they may fail when data has a high value-missing rate, and they may easily fall into a local optimum. To address these problems, in this paper, we propose an absent multiple kernel clustering (AMKC) method on incomplete data. The AMKC method first clusters the initialized incomplete data. Then, it constructs a new multiple-kernel-based data space, referred to as K-space, from multiple sources to learn kernel combination coefficients. Finally, it seamlessly integrates an incomplete-kernel-imputation objective, a multiple-kernel-learning objective, and a kernel-clustering objective in order to achieve absent multiple kernel clustering. The three stages in this process are carried out simultaneously until the convergence condition is met. Experiments on six datasets with various characteristics demonstrate that the kernel imputation and clustering performance of the proposed method is significantly better than state-of-the-art competitors. Meanwhile, the proposed method gains fast convergence speed. 相似文献