A Hierarchical Algorithm for Document-images Fast Matching

DOI

10.2991/icmt-13.2013.111How to use a DOI?

Keywords

document images; Image Retrieval; approximate string matching; correlation coefficient

Abstract

As digital libraries and document images largely use in the network, how to retrieve them quickly become one of the key issues. This paper presents a hierarchical matching algorithm to achieve fast retrieval of document images. Firstly, we can quickly find the possible matching location through approximate string matching algorithms; and then, use this location as a reference point in the target image, extract sub-block which has the same size as template image and compute the correlation coefficient between sub-block and template image. According to correlation coefficient values, we can accurately know whether the template image’s information exist in the target document; finally, experimental results demonstrate the feasibility of the algorithm.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Tan Shuang
AU  - Jia Yan
AU  - Fan Hua
PY  - 2013/11
DA  - 2013/11
TI  - A Hierarchical Algorithm for Document-images Fast Matching
BT  - Proceedings of 3rd International Conference on Multimedia Technology(ICMT-13)
PB  - Atlantis Press
SP  - 896
EP  - 902
SN  - 1951-6851
UR  - https://doi.org/10.2991/icmt-13.2013.111
DO  - 10.2991/icmt-13.2013.111
ID  - Shuang2013/11
ER  -