A Novel Approach for Word Spotting Using Merge-Split Edit Distance

نویسندگان

  • Khurram Khurshid
  • Claudie Faure
  • Nicole Vincent
چکیده

Edit distance matching has been used in literature for word spotting with characters taken as primitives. The recognition rate however, is limited by the segmentation inconsistencies of characters (broken or merged) caused by noisy images or distorted characters. In this paper, we have proposed a Mergesplit edit distance which overcomes these segmentation problems by incorporating a multi-purpose merge cost function. The system is based on the extraction of words and characters in the text and then attributing each character with a set of features. Characters are matched by comparing their extracted feature sets using Dynamic Time Warping (DTW) while the words are matched by comparing the strings of characters using the proposed Merge-Split Edit distance algorithm. Evaluation of the method on 19th century historical document images exhibits extremely promising results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Représentation par graphe de mots manuscrits dans les images pour la recherche par similarité

Effective information retrieval on handwritten document images has always been a challenging task. In this paper, we propose a novel handwritten word spotting approach based on graph representation. The presented model comprises both topological and morphological signatures of handwriting. Skeleton-based graphs with the Shape Context labeled vertexes are established for connected components. Ea...

متن کامل

Représentation des mots manuscrits par graphe pour la recherche par similarité

Effective information retrieval on handwritten document images has always been a challenging task. In this paper, we propose a novel handwritten word-spotting approach based on graph representation. The presented model comprises both topological and morphological signatures of handwriting. Skeleton-based graphs with the Shape Context labeled vertexes are established for connected components. Ea...

متن کامل

Generating Hypermedia Documents from Transcriptions of Television Programs Using Parallel Text Alignment

This paper presents a method of automatically creating hypermedia documents from conventional transcriptions of television programs. Using parallel text alignment techniques, the temporal information derived from the closed caption signal is exploited to convert the transcription into a synchronized text stream. Given this text stream, we can create links between the transcription and the image...

متن کامل

Unrestricted Vocabulary Keyword Spotting Using LSTM-CTC

Keyword spotting (KWS) aims to detect predefined keywords in continuous speech. Recently, direct deep learning approaches have been used for KWS and achieved great success. However, these approaches mostly assume fixed keyword vocabulary and require significant retraining efforts if new keywords are to be detected. For unrestricted vocabulary, HMM based keywordfiller framework is still the main...

متن کامل

Fast Approximate Matching Algorithm for Phone-based Keyword Spotting

Generally, exact matching is widely used for keyword spotting (KWS). Its performance depends heavily on the recognition accuracy. As for phone-based KWS system, the influence of phoneme error rate (PER) on KWS increases as the length of phoneme sequence for the keyword grows. Approximate matching is an alteration to compensate errors in recognition. Compared to exact matching, the calculation c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009