检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]山西煤炭职业技术学院,太原030031 [2]清华大学自动化系,北京100084
出 处:《计算机工程与应用》2012年第19期191-196,共6页Computer Engineering and Applications
摘 要:针对以往车牌字符分割算法在复杂情况下分割准确率低的问题,提出了一种基于新邻域模板的连通域算法的车牌字符分割算法。采用基于新模板的连通域算法粗分割字符;通过自适应阈值投影法进行字符细分割;同时使用区域合并算法保证字符的完整性。实验结果表明,该算法将连通域法与投影法有效结合,能够同时解决汉字不连通、字符粘连和边框粘连等复杂情况,该算法对车牌字符进行分割正确率达99.5%。Considering the low accuracy of traditional license plate character segmentation algorithm with complex situations, an optimized algorithm is proposed. It uses connected area algorithm based on templates to implement segmentation roughly. Then, adaptive threshold algorithm is introduced for further segmentation; at the same time, region merging algorithm ensures the integrity of characters. Experimental results show that unconnected problem of Chinese and character/border adhesion can be solved effectively by the combination of connected area algorithm and projection algorithm designed, the accuracy rate reaches to 99.5%.
分 类 号:TN911.72[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3