| 基于后缀树的图像识别研究 |
| |
| 引用本文： | 何国辉,张标,尚新萍.基于后缀树的图像识别研究[J].苏州科技学院学报(自然科学版),2007,24(3):64-67. |
| |
| 作者姓名： | 何国辉 张标 尚新萍 |
| |
| 作者单位： | 五邑大学,信息学院,广东,江门,529020 |
| |
| 摘 要： | 分析了后缀树在一维和二维字符串处理方面的优势．以后缀树为索引，将后缀树和最低公共祖先问题相结合，提出了一个在仅考虑平移变换操作的条件下．进行图像精确识别的算法，并从时间复杂度上证明了其优于传统的二：维精确模式匹配算法。
|
| 关 键 词： | 后缀树 二维精确模式匹配 图像识别 |
| 文章编号： | 1672-0679（2007）03-0064-04 |
| 修稿时间： | 2006-12-15 |
Research of Image Recognition Based on Suffix Tree |
| |
| HE Guo-hui,ZHANG Biao,SHANG Xin-ping.Research of Image Recognition Based on Suffix Tree[J].Journal of University of Science and Technology of Suzhou,2007,24(3):64-67. |
| |
| Authors: | HE Guo-hui ZHANG Biao SHANG Xin-ping |
| |
| Institution: | College of Information, Wuyi University, Jiangmen 529020, China |
| |
| Abstract: | The suffix tree is a versatile data structure. After analyzing its advantages of processing one-dimensional and two-dimensional strings, this paper makes use of the suffix tree as an index and combines the suffix tree and the problem of lowest common ancestor. Then, on the condition of the translation operation only, an algorithm applied to exact image recognition is proposed and proved outperforming the traditional two-dimensional exact pattern matching from the time complexity. |
| |
| Keywords: | suffix tree two dimensional exact pattern matching image recognition |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
