| 图形识别的有限自动机方法 |
| |
| 引用本文： | 刘林,麦智晖. 图形识别的有限自动机方法[J]. 武汉大学学报(工学版), 2006, 39(4): 119-121,136 |
| |
| 作者姓名： | 刘林 麦智晖 |
| |
| 作者单位： | 华南理工大学,广东,广州,510641 |
| |
| 摘 要： | 针对工程图中具有某种特殊意义的图形符号(如粗糙度、标高符号等),研究了确定性有限自动机识别矢量图形的方法.从DFA出发,构造待识别图形符号的状态集合以及状态间的转换关系,然后通过搜索图形元素集合以及一定的条件进行状态转换,根据其最终所处状态判断识别结果.
|
| 关 键 词： | 计算机应用 图形识别 DFA |
| 文章编号： | 1671-8844（2006）04-119-03 |
| 收稿时间： | 2006-02-22 |
| 修稿时间： | 2006-02-22 |
Figure recognition based on deterministic finite automat |
| |
| LIU Lin,MAI Zhihui. Figure recognition based on deterministic finite automat[J]. Engineering Journal of Wuhan University, 2006, 39(4): 119-121,136 |
| |
| Authors: | LIU Lin MAI Zhihui |
| |
| Affiliation: | South China University of Technology, Guangzhou 510641, China |
| |
| Abstract: | The method to recognise symbols in engineering drawing is studied through the deterministic finite automat(DFA).The method first constructs the state set for the symbol to be recognized and the relation between states.Then it searches the entities in the figure set,and switch state according the condition to switch;and gets the recognition result based on the final state after switching. |
| |
| Keywords: | computer application figure recognition deterministic finite automat(DFA) |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
