改进SURF特征的维吾尔文复杂文档图像匹配检索

PDF下载HTML

Title:

Complex Uyghur document image matching and retrieval based on modified SURF feature

作者:

阿丽亚·巴吐尔¹, 努尔毕亚·亚地卡尔¹, 吾尔尼沙·买买提¹, 阿力木江·艾沙², 库尔班·吾布力¹

1. 新疆大学 信息科学与工程学院, 新疆 乌鲁木齐, 830046;
2. 新疆大学 网络与信息中心, 新疆 乌鲁木齐, 830046

Author(s):

ALIYA Batur¹, NURBIYA Yadikar¹, HORNISA Mamat¹, ALIMJAN Aysa², KURBAN Ubul¹

1. School of Information Science and Engineering, Xinjiang University, Urumqi 830046, China;
2. Network and information center, Xinjiang University, Xinjiang University, Urumqi 830046, China

关键词:

复杂文档; 维吾尔文档图像; 文档图像分割; 特征提取; SURF特征; FLANN双向匹配; KD-Tree+BBF匹配; 图像检索

Keywords:

complex document image; Uyghur document image; document image segmentation; feature extraction; SURF feature; FALNN bidirectional matching; KD-Tree+BBF matching; image retrieval

分类号:

TP391.1

DOI:

10.11992/tis.201709014

摘要:

针对图像局部特征的词袋模型（Bag-of-Word，BOW）检索研究中聚类中心的不确定性和计算复杂性问题，提出一种由不同种类的距离进行相似程度测量的检索和由匹配点数来检索的方法。这种方法首先需要改进文档图像的SURF特征，有效降低特征提取复杂度；其次，对FAST+SURF特征实现FLANN双向匹配与KD-Tree+BBF匹配，在不同变换条件下验证特征鲁棒性；最后，基于这两种检索方法对已收集整理好的各类维吾尔文文档图像数据库进行检索。实验结果表明：基于距离的相似性度量复杂度次于基于匹配数目的检索，而且两种检索策略都能满足快速、精确查找需求。

Abstract:

This study is aimed at the uncertainty and computational complexity of the clustering center in local image features retrieval based on the bag-of-words (BOW) model. A method to retrieve the measure of similarity degree from different kinds of distance and another method that requires using the matching point number as the basis of retrieval are proposed in this paper. In this method, the SURF feature is first modified to effectively reduce feature extraction complexity, and then FLANN (fast library for approximate nearest neighbors) bidirectional matching and KD-Tree + BBF matching are implemented for FAST + SURF features. Feature robustness is verified under different transformation conditions. Finally, all kinds of Uyghur document images that have been classified and sorted based on these two retrieval methods are retrieved. The results of the retrieval experiments indicate that the similarity degree measure retrieval based on distance is inferior to the retrieval based on matching number, and both of these two retrieval strategies can meet the requirements of fast and accurate searching.