首页 | 本学科首页   官方微博 | 高级检索  
     

最大类间方差车牌字符分割的模板匹配算法
引用本文:王兴玲.最大类间方差车牌字符分割的模板匹配算法[J].计算机工程,2006,32(19):193-195.
作者姓名:王兴玲
作者单位:中国海洋大学计算中心,青岛,266003
基金项目:国家高技术研究发展计划(863计划)
摘    要:提出一种基于模板匹配的最大类间方差车牌字符分割算法。根据字符串的结构和尺寸特征,设计了车牌字符串模板,该模板在车牌区域滑动匹配进行分类,并结合最大类间方差判决准则,确定最佳匹配位置,分割车牌字符。实验表明,该方法自适应性强,可以获得最优的分割效果。

关 键 词:车牌字符分割  模板匹配  最大类间方差
文章编号:1000-3428(2006)19-0193-03
收稿时间:03 28 2006 12:00AM
修稿时间:2006-03-28

Template Match Algorithm of Maximum Variance Between Clusters and License Plate Characters' Segmentation
WANG Xingling.Template Match Algorithm of Maximum Variance Between Clusters and License Plate Characters'''' Segmentation[J].Computer Engineering,2006,32(19):193-195.
Authors:WANG Xingling
Affiliation:Center of Computation, Ocean University of China, Qingdao 266003
Abstract:This paper presents a method based on template match and maximum variance between clusters to segment the characters of license plate. The template of character string on license plate is designed, according to the character string’s structural features. The template slips on the license plate to match the right location, and this matching process regarded as a classifying process combines with the judge rule of maximum variance between clusters to get the optimizational matching location to segment the characters.
Keywords:License plate characters’ segmentation  Template match  Maximum variance between clusters
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号