Back to Search
Start Over
Word spotting for handwritten documents using Chamfer Distance and Dynamic Time Warping
- Source :
- DRR
- Publication Year :
- 2011
- Publisher :
- SPIE, 2011.
-
Abstract
- A large amount of handwritten historical documents are located in libraries around the world. The desire to access, search, and explore these documents paves the way for a new age of knowledge sharing and promotes collaboration and understanding between human societies. Currently, the indexes for these documents are generated manually, which is very tedious and time consuming. Results produced by state of the art techniques, for converting complete images of handwritten documents into textual representations, are not yet sufficient. Therefore, word-spotting methods have been developed to archive and index images of handwritten documents in order to enable efficient searching within documents. In this paper, we present a new matching algorithm to be used in word-spotting tasks for historical Arabic documents. We present a novel algorithm based on the Chamfer Distance to compute the similarity between shapes of word-parts. Matching results are used to cluster images of Arabic word-parts into different classes using the Nearest Neighbor rule. To compute the distance between two word-part images, the algorithm subdivides each image into equal-sized slices (windows). A modified version of the Chamfer Distance, incorporating geometric gradient features and distance transform data, is used as a similarity distance between the different slices. Finally, the Dynamic Time Warping (DTW) algorithm is used to measure the distance between two images of word-parts. By using the DTW we enabled our system to cluster similar word-parts, even though they are transformed non-linearly due to the nature of handwriting. We tested our implementation of the presented methods using various documents in different writing styles, taken from Juma'a Al Majid Center - Dubai, and obtained encouraging results.
- Subjects :
- Dynamic time warping
Similarity (geometry)
Matching (graph theory)
Arabic
business.industry
Computer science
Pattern recognition
Spotting
Similitude
language.human_language
k-nearest neighbors algorithm
Handwriting recognition
Handwriting
language
Artificial intelligence
business
Distance transform
Blossom algorithm
Subjects
Details
- ISSN :
- 0277786X
- Database :
- OpenAIRE
- Journal :
- SPIE Proceedings
- Accession number :
- edsair.doi...........783e3f41968370286ac451b349a4dc5f