Word spotting in historical printed documents using shape and sequence comparisons

详细信息	查看全文 | 推荐本文 |

• 作者：Khurram Khurshid^a ; ^c ; ^{khurram.khurshid@ist.edu.pk}  ; [Author Vitae] ; Claudie Faure^b ; ^{cfaure@telecom-paristech.fr}  ; [Author Vitae] ; Nicole Vincent^a ; ^{nicole.vincent@mi.parisdescartes.fr}  ; [Author Vitae]
• 关键词：Word spotting ; Historical documents ; Digital libraries ; Dynamic Time Warping ; Segmentation-driven string matching ; Information retrieval
• 刊名：Pattern Recognition
• 出版年：2012
• 期刊代码：100_00313203
• 类别：cp
• 出版时间：July, 2012
• 卷：45
• 期：7
• 页码：2598-2609
• 文件大小：1255 K

摘要

Information spotting in scanned historical document images is a very challenging task. The joint use of the mechanical press and of human controlled inking introduced great variability in ink level within a book or even within a page. Consequently characters are often broken or merged together and thus become difficult to segment and recognize. The limitations of commercial OCR engines for information retrieval in historical document images have inspired alternative means of identification of given words in such documents. We present a word spotting method for scanned documents in order to find the word images that are similar to a query word, without assuming a correct segmentation of the words into characters. The connected components are first processed to transform a word pattern into a sequence of sub-patterns. Each sub-pattern is represented by a sequence of feature vectors. A modified Edit distance is proposed to perform a segmentation-driven string matching and to compute the Segmentation Driven Edit (SDE) distance between the words to be compared. The set of SDE operations is defined to obtain the word segmentations that are the most appropriate to evaluate their similarity. These operations are efficient to cope with broken and touching characters in words. The distortion of character shapes is handled by coupling the string matching process with local shape comparisons that are achieved by Dynamic Time Warping (DTW). The costs of the SDE operations are provided by the DTW distances. A sub-optimal version of the SDE string matching is also proposed to reduce the computation time, nevertheless it did not lead to a great decrease in performance. It is possible to enter a query by example or a textual query entered with the keyboard. Textual queries can be used to directly spot the word without the need to synthesize its image, as far as character prototype images are available. Results are presented for different documents and compared with other methods, showing the efficiency of our method.