Fast Key-Word Searching via Embedding and Active-DTW

12 years 2 months ago
Fast Key-Word Searching via Embedding and Active-DTW
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required results. First it warps multiple appearances of each word-part in the lexicon for embedding into the same euclidean space. The embedding is done based on the warping path produced by the Dynamic Time Warping (DTW) process while calculating the similarity distance. In the next step, all samples of different word-parts are resampled uniformly to the same size. The kdtree structure is used to store all shapes representing wordparts in the lexicon. Fast approximation of k-nearest neighbors generates a short list of candidates to be presented to the next step. In the third step, the Active-DTW [15] algorithm is used to examine each sample in the short list and give final accurate results. We demonstrate our method on a database of 23, 500 images of word-parts extracted from the IFN/ENIT database [6] and 22, 000 i...
Raid Saabni, Alex Bronstein
Added 24 Dec 2011
Updated 24 Dec 2011
Type Journal
Year 2011
Authors Raid Saabni, Alex Bronstein
Comments (0)