基于无向图的选票版面结构理解算法  

Understanding Algorithm of Ballot Layout Structure Based on Undirected Graph

作　　者：肖刚[1] 刘海萍[1] 陈久军[1] 高飞[1] 

机构地区：[1]浙江工业大学信息工程学院,杭州310032

出　　处：《计算机工程》2008年第18期223-225,共3页Computer Engineering

基　　金：浙江省自然科学基金资助项目(Y106602);浙江省科技计划基金资助项目(2005C31010)

摘　　要：目前的选举系统或选票识别算法都简化了选票的版面理解,无法适应不同类型选票的准确定位、识别。该文在版面分割的基础上,提出一种基于无向图的选票版面结构描述方法,采用改进的深度优先遍历算法实现多种类型选票的准确定位和批量快速统计。实验证明,该方法具有选票设计灵活、精度高、通用性好、处理速度快等特点。The current election systems or ballot recognition algorithms simplify layout understanding, and can not be applied to different kinds of ballots. Based on layout segmentation, this paper presents a description method of layout structure based on undirected graph, which makes location correctly and batch counting fast according to various ballot forms. Experiment shows that the method is agile, accurate, general and fast.

关 键 词：无向图 深度优先遍历 选票 版面理解 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]