2009 10th International Conference on Document Analysis and Recognition 2009
DOI: 10.1109/icdar.2009.16
|View full text |Cite
|
Sign up to set email alerts
|

Fisher Kernels for Handwritten Word-spotting

Abstract: The

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
23
0

Year Published

2010
2010
2018
2018

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 34 publications
(25 citation statements)
references
References 10 publications
2
23
0
Order By: Relevance
“…We observe how the FV baseline is already able to outperform some popular methods on both datasets. This is in line with the findings of [20], where the FV of a HMM outperforms the standard HMM on keyword classification tasks. The exemplar SVM has a limited influence.…”
Section: Methodssupporting
confidence: 80%
See 1 more Smart Citation
“…We observe how the FV baseline is already able to outperform some popular methods on both datasets. This is in line with the findings of [20], where the FV of a HMM outperforms the standard HMM on keyword classification tasks. The exemplar SVM has a limited influence.…”
Section: Methodssupporting
confidence: 80%
“…In both cases, the methods are limited to tiny datasets. A more recent work [20] exploits the Fisher kernel framework [13] to construct the Fisher vector of a HMM. This representation has a fixed length and can be used for efficient spotting tasks, although the paper focuses on only 10 different keywords.…”
Section: Word Representationmentioning
confidence: 99%
“…In [8] pseudo-2D HMMs have been investigated and [31] proposes generalized HMMs where more than one emission in each hidden state is allowed. Unsupervised adaptation of whole word HMMs to a specific writer is proposed in [32] and [33] discusses the usage of the Fisher Kernel of the HMM to estimate a good confidence measure.…”
Section: A Related Work 1) Word Based Abstractpottingmentioning
confidence: 99%
“…It is based on Hidden Markov Models (HMMs). HMMs are state-of-the-art for modeling handwritten text [51] and have been widely used for keyword spotting [3], [28], [31], [33], [47], [52], [53]. In [30], trained character models are used to spot arbitrary keywords in complete text line images using an efficient lexicon-free approach.…”
Section: B Hmm Reference Systemmentioning
confidence: 99%
“…Recently, keyword spotting systems that are modified versions of handwriting recognition systems have received increasing attention. In [10], [11], [12], hidden Markov models are used to find the words to be searched. In [13], a novel approach using bidirectional long short-term (BLSTM) neural networks is proposed.…”
Section: Introductionmentioning
confidence: 99%