Analytical Dynamic Programming Matching

Uchida, Seiichi; Hokahori, Satoshi; Feng, Yaokai

doi:10.1007/978-3-642-33863-2_10

Search citation statements

Order By: Relevance

Paper Sections

Select...

Handwriting Retrieval Framework1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2013

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, corresponding strokes are searched for from among the stored stroke sequences. To accelerate searching, we apply dynamic programming (DP) matching [6], the most established optimization method for sequential patterns.…”

Section: Handwriting Retrieval Frameworkmentioning

confidence: 99%

Fast and Memory Efficient Online Handwritten Strokes Retrieval Using Binary Descriptor

Shibata

Tonouchi

Kubota

et al. 2013

2013 2nd IAPR Asian Conference on Pattern Recognition

View full text Add to dashboard Cite

We propose a fast, memory-efficient online handwriting search method that uses handwritten strokes as a query and finds matches from among handwritten documents. The proposed method is language-independent, so not only words but also figures and symbols can be queried. We introduce a compact binary descriptor to lower computational resource load. A metric learning method enables derivation of a discriminative binary descriptor from directional densities of handwritten strokes. Experiments indicate that the proposed method is faster, more memory efficient, and exhibits more accurate search performance than a conventional method that employs directional densities. For 200 handwritten documents, the proposed method completed query searches within 1 s using a 1.3 GHz Tegra 3 CPU.

show abstract

Section: Handwriting Retrieval Frameworkmentioning

confidence: 99%