最大类间方差车牌字符分割的模板匹配算法  

Template Match Algorithm of Maximum Variance Between Clusters and License Plate Characters’ Segmentation

作　　者：王兴玲[1] 

机构地区：[1]中国海洋大学计算中心,青岛266003

出　　处：《计算机工程》2006年第19期193-195,共3页Computer Engineering

基　　金：国家"863"计划基金资助项目(2001AA612040)

摘　　要：提出一种基于模板匹配的最大类间方差车牌字符分割算法。根据字符串的结构和尺寸特征,设计了车牌字符串模板,该模板在车牌区域滑动匹配进行分类,并结合最大类间方差判决准则,确定最佳匹配位置,分割车牌字符。实验表明,该方法自适应性强,可以获得最优的分割效果。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 fight 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.

关 键 词：车牌字符分割 模板匹配 最大类间方差 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]