Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
Computational Geometry: Theory and Applications
Approximating the Fréchet distance for realistic curves in near linear time
Proceedings of the twenty-sixth annual symposium on Computational geometry
TAR based shape features in unconstrained handwritten digit recognition
WSEAS Transactions on Computers
Fréchet distance of surfaces: some simple hard cases
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Fréchet distance with speed limits
Computational Geometry: Theory and Applications
A near-linear time guaranteed algorithm for digital curve simplification under the Fréchet distance
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
The frechet distance revisited and extended
Proceedings of the twenty-seventh annual symposium on Computational geometry
Improved algorithms for partial curve matching
ESA'11 Proceedings of the 19th European conference on Algorithms
The fréchet distance revisited and extended
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
We propose a novel, language-neutral approach for searching online handwritten text using Fréchet distance. Online handwritten data, which is available as a time series (x,y,t), is treated as representing a parameterized curve in two-dimensions and the problem of searching online hand- written text is posed as a problem of matching two curves in a two-dimensional Euclidean space. Fréchet distance is a natural measure for matching curves. The main contribu- tion of this paper is the formulation of a variant of Fréchet distance that can be used for retrieving words even when only a prefix of the word is given as query. Extensive ex- periments on UNIPEN dataset1 consisting of over 16,000 words written by 7 users show that our method outperforms the state-of-the-art DTW method. Experiments were also conducted on a multilingual dataset, generated on a PDA, with encouraging results. Our approach can be used to implement useful, exciting features like auto-completion of handwriting in PDAs.