基于模板匹配的车牌数字与字母识别

车牌的字符识别是车牌识别的重要组成部分.我国的车牌由7个字符组成,除第一位为汉字外,其余均为字母和数字字符,所以提高数字与字母识别率在车牌字符识别中占很重要的地位.通过模板匹配的方法对车牌的数字与字母字符进行识别.选择了两个判别函数,一个是求取模板、待识别字符与运算结果的标准差的最小值,另一个是求取运算结果与模板比值的最大值.并对两个判别函数的识别结果进行了比较,求标准差最小值在总体识别结果上比求比值最大值的识别结果要好,但在个别字符的识别上,求取比值最大值的识别结果要高于求取标准差最小值的识别结果.     

车牌识别机器学习方法的数学建模与实现

首先,针对不同光照、复杂背景和投影失真的车牌图像建立基于Adaboost算法和改进Haar特征的车牌检测模型;然后,运用Radon变换进行车牌校正,并结合3次B样条小波变换和识别反馈模型对字符进行粗和精分割;最后,根据汉字和数字字母的不同结构特征,采用不同的算法提取特征,特别是针对车牌字符特点,训练汉字、字母和数字字母3种神经网络模型用于建立字符识别模型.实验结果表明该模型是实用的.     

基于SVM理论的一种新的数据分类方法

基于 SVM分类器在模式识别问题中有独特的优势 ,本文通过对标准 SVM模型的改造 ,提出了一种新的简单的数据分类方法 .理论分析和实验表明 ,该方法与标准 SVM分类方法相比具有处理大规模数据识别的能力且保持较高的样本识别率 ,节省存储空间等优势 .     

基于SVM分类模型的垃圾文本识别研究

主要研究垃圾文本识别问题,利用苹果手机评论文本特征向量建立了SVM分类模型对垃圾文本进行识别,并与BP神经网络判别模型结果进行对比,得出苹果手机前400组训练样本的判别正确率为71%,后196组测试样本的判别正确率为70.12%.故得到,影响垃圾观点文本识别效果的主要原因为:1)评论文本的特征项的提取和文本特征空间向量求解.2)判别分类方法的选择,其中SVM文本识别效果最优.     

保障用户认证安全的判别最大熵语音识别机制

为了提高电子商务中用户认证的安全性,提出了一种高识别率的判别最大熵语音识别机制DME.该语音识别方法同时考虑语音与语言两方面的因素,并将语音和语言特征进行有效地结合,在统一的最大熵模型下,实现判别训练,确保观察样本能正确地分配到其对应状态,以提高所训练出的语音模型的正确识别率.详细的实验及与现有方法的比较结果表明,对不同环境下的语音数据,提出的语音识别方法具有更好的识别性能,对提高电子商务中用户认证系统的安全性能具有理论与实际意义.     

面向不平衡数据集的一种基于聚类的欠采样方法

针对不平衡数据集分类问题,提出了一种基于聚类的欠采样方法.分别取不同的聚类个数,对训练集中的多数类样本进行若干次聚类,然后用聚类中心作为多数类样本,与少数类样本构成若干个新的训练集,之后用这些训练集训练分类器,剔除具有错误分类倾向的分类器,最后对分类结果进行投票.仿真实验对几种欠采样方法进行比较.实验采用16个平衡率不一的数据集进行测试.理论分析与实验结果表明:提出的基于聚类的欠采样方法能有效地改善不平衡数据集的不平衡性.     

一种快速有效的混合倾斜车牌校正方法

车牌倾斜校正是车牌识别系统中的一关键技术,校正效果将直接影响到后续字符分割和识别的效果.为此,提出了一种快速有效的混合倾斜车牌校正方法.水平倾斜校正时,先进行Sobel垂直边缘检测算子提取字符的有效数据点,构造有效数据点矩阵,然后进行矩阵奇异值分解,利用特征向量矩阵导出车牌水平倾斜角度的表达式;垂直倾斜校正时,首先通过Sobel垂直和水平边缘检测有效去除边框及上下左右噪声干扰区域,然后通过形态学腐蚀提取有效反映字符水平错位的有效数据点,其次将这些有效数据点水平投影分成七个字符区域,求取每个区域错切变换后的最佳列坐标质心对应其区域垂直倾斜角,最后取区域垂直倾斜角的均值作为车牌的最佳垂直倾斜角.对大量复杂背景下的倾斜车牌进行实验,并做了精确度、运行时间、抗干扰性分析,实验结果表明:提出的混合倾斜校正方法精确度高、运行时间短、抗干扰性强.     

零样本学习进展研究

机器学习是人工智能领域发展最迅速的一个分支之一,传统的机器学习方法和深度学习大都需要大量人工标注的训练数据才能发挥作用.然而,现实世界的物体种类繁多且其数量在不断增长,人工标注训练数据就变成了一项极其繁琐冗杂的工作,零样本学习的提出极大地缓解了这种情况.在零样本学习中,训练集和测试集的类别的交集是空集,因此需要在二者之间通过实现知识的迁移来完成学习,从而使得在训练集上训练得到的模型能够识别测试集上输入示例的类别标签.不同于其他大部分机器学习技术需要保证训练集包含测试集,零样本学习的原理从本质意义上让计算机模仿了人类在学习时的推理模式,使得计算机能够识别新事物.本文梳理了零样本学习的研究进展,首先概述了零样本学习的定义及其相关领域,然后重点归纳了零样本学习的发展过程,包括其基本模型及改进,存在的关键难点以及解决方式,最后探讨了零样本学习的研究现状及其未来的发展方向.     

基于支持向量机的大豆产量预测研究

应用支持向量机(SVM)的算法进行中国大豆产量的预测研究,用1991-2008年中国大豆数据组成样本集,建立影响因素与大豆产量之间的SVM模型.利用SVM对输入和输出数据进行训练学习,逼近历史数据所隐含的函数关系,完成对新数据序列的映射关系,从而完成对未来年份大豆的预测,并与其它几种方法的预测效果进行比较.结果表明,SVM预测模型预测大豆产量的精度优于其它预测方法.     

基于逐步回归分析和BP_Adaboost算法的危险驾驶行为辨识

为准确辨识车辆在行驶过程中可能出现的异常加减速,压线行驶,右侧超车驾驶行为,以便于及时给予驾驶员信息反馈和安全预警,使车辆保持安全的运行状态.首先通过虚拟驾驶仿真实验平台,采集驾驶行为的48种车辆运行数据对实验数据进行预处理,获得实验样本1492组;其次利用逐步回归分析对原始数据进行降维处理,并选取其中的最优回归模型获得特征参数;将提取的特征参数数据输入到BP_Adaboost多分类网络中,训练BP_Adaboost多分类网络,对上述驾驶行为进行识别;最后该模型与BP神经网络进行识别结果对比分析.结果表明模型识别率相较于BP神经网络提高了8.81%,达到92.93%,能进行更加有效的安全预警.     

一种加权的支持向量机及其在储层识别中的应用

标准支持向量机(SVM)抗噪声能力不强,当训练样本中存在有噪声或者野点时,会影响最优分类面的产生,最终导致分类结果出现偏差。针对这一问题,提出了一种考虑最小包围球的加权支持向量机(WSVM),给每个样本点赋予不同的权值,以此来降低噪声或野点对分类结果的影响。对江汉油田某区块的oilsk81,oilsk83和oilsk85三口油井的测井数据进行交叉验证,其中核函数采用了线性、指数和RBF这3种不同的核函数。测试结果显示,无论是在SVM还是在WSVM中,核函数选择RBF识别率都是最高的,同时提出的WSVM不受核函数的影响,识别稳定性好,且在交叉验证中识别率都能够达到100%。     

A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training

Support vector machines (SVMs) training may be posed as a large quadratic program (QP) with bound constraints and a single linear equality constraint. We propose a (block) coordinate gradient descent method for solving this problem and, more generally, linearly constrained smooth optimization. Our method is closely related to decomposition methods currently popular for SVM training. We establish global convergence and, under a local error bound assumption (which is satisfied by the SVM QP), linear rate of convergence for our method when the coordinate block is chosen by a Gauss-Southwell-type rule to ensure sufficient descent. We show that, for the SVM QP with n variables, this rule can be implemented in O(n) operations using Rockafellar’s notion of conformal realization. Thus, for SVM training, our method requires only O(n) operations per iteration and, in contrast to existing decomposition methods, achieves linear convergence without additional assumptions. We report our numerical experience with the method on some large SVM QP arising from two-class data classification. Our experience suggests that the method can be efficient for SVM training with nonlinear kernel.     

IBEA-SVM: An Indicator-based Evolutionary Algorithm Based on Pre-selection with Classification Guided by SVM

Multi-objective optimization has many important applications and becomes a challenging issue in applied science. In typical multi-objective optimization algorithms, such as Indicator-based Evolutionary Algorithm(IBEA), all of parents and offspring need to be evaluated in every generation, and then the better solutions of them are selected as the next generation candidates. This leads to a large amount of calculation and slows down convergence rate for IBEA related applications. Our discovery is that the evaluation of evolutionary algorithm is a binary classi?cation in nature and a meaningful preselection method will accelerate the convergence rate. Therefore this paper presents a novel preselection approach to improve the performance of the IBEA, in which a SVM(Support Vector Machine) classi?er is adopted to sort the promising solutions from unpromising solutions and then the newly generated solutions are conversely added as train sample to increase the accuracy of the classi?er. Firstly, we proposed an online and asynchronous training method for SVM model with empirical kernel. The initial population is randomly generated among population size, which is used as initial training. In the process of training, SVM classi?er is modi?ed and perfected to adapt to the evolutionary algorithm sample. Secondly, the classi?er divides all the new generated solutions from the whole solution spaces into promising solutions and unpromising ones. And only the promising ones are forwarded for evaluation. In this way, the evaluation time can be greatly reduced and the solution quality can be obviously improved. Thirdly, the promising and unpromising solutions are labeled as new train samples in next generation to re?ne classi?er model. A number of experiments on benchmark functions validates the proposed approach. The results show that IBEA-SVM can signi?cantly outperform previous works.     

ABC-PSO算法优化混合核SVM参数及应用

针对混合核支持向量机(SVM)中的可调参数一般是根据经验或人工随机调试得到,不能确保参数最优的局限性,提出用粒子群和人工蜂群的并行混合优化(ABC-PSO)算法来优化混合核SVM参数,找出满足条件的最优参数组合.将该SVM模型应用到语音识别中,通过对三个不同语种的语音数据库的实验仿真,验证了混合算法优化SVM参数所得的优化SVM模型比PSO算法优化SVM所得的模型,具有良好的泛化能力和语音识别能力.     

Selecting rows and columns for training support vector regression models with large retail datasets

Although support vector regression models are being used successfully in various applications, the size of the business datasets with millions of observations and thousands of variables makes training them difficult, if not impossible to solve. This paper introduces the Row and Column Selection Algorithm (ROCSA) to select a small but informative dataset for training support vector regression models with standard SVM tools. ROCSA uses ε-SVR models with L₁-norm regularization of the dual and primal variables for the row and column selection steps, respectively. The first step involves parallel processing of data chunks and selects a fraction of the original observations that are either representative of the pattern identified in the chunk, or represent those observations that do not fit the identified pattern. The column selection step dramatically reduces the number of variables and the multicolinearity in the dataset, increasing the interpretability of the resulting models and their ease of maintenance. Evaluated on six retail datasets from two countries and a publicly available research dataset, the reduced ROCSA training data improves the predictive accuracy on average by 39% compared with the original dataset when trained with standard SVM tools. Comparison with the ε SSVR method using reduced kernel technique shows similar performance improvement. Training a standard SVM tool with the ROCSA selected observations improves the predictive accuracy on average by 21% compared to the practical approach of random sampling.     

基于支持向量机的磨粒识别

由于神经网络的局限性,上个世纪末,支持向量机被提出和发展,它在模式识别方面有广泛的应用发展前途,并由最初的二元分类发展到现在的多元分类.本文根据支持向量机的最新发展,把最小二乘支持向量机应用在磨粒识别上,并取得了好的结果.     

Nonlinear optimization and support vector machines

Support Vector Machine (SVM) is one of the most important class of machine learning models and algorithms, and has been successfully applied in various fields. Nonlinear optimization plays a crucial role in SVM methodology, both in defining the machine learning models and in designing convergent and efficient algorithms for large-scale training problems. In this paper we present the convex programming problems underlying SVM focusing on supervised binary classification. We analyze the most important and used optimization methods for SVM training problems, and we discuss how the properties of these problems can be incorporated in designing useful algorithms.     

基于PCA和改进的PSO-SVM的机器人移动方向分类

随着人们创新水平的不断提高,为了更加准确的实现机器人的导航任务,提出了一种基于改进的粒子群优化支持向量机中的参数的方法.首先利用主成分分析法对数据进行降维,然后利用改进的粒子群优化算法,对SVM中的惩罚参数c和核函数的参数g进行优化,最后代入到SVM中,以此来达到运用SVM对机器人的导航任务进行分类识别.相对于其他算法,容易发现改进的粒子群优化算法优化后的支持向量机可以达到很好的效果.这种识别分类可以帮助人们很好的对机器人进行导航,对今后机器人的研究具有很大的应用价值.