Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4969904 | Pattern Recognition | 2017 | 27 Pages |
Abstract
Background in a handwritten document can be anything other than the words we are interested in. The characteristics of the background are typically captured by a background model to achieve spotting in handwritten documents. We propose two such Bayesian background models for keyword spotting in handwritten documents. Firstly, we present a background model using the Bayesian generalized linear model called (VDBM) and secondly propose a Bayesian generalized kernel background model called BGKBM. Given a set of handwritten documents and a bunch of keyword and non-keyword scores, the models learn an efficient Bayesian rejection criteria to output the most confident keyword regions in the handwritten document. For the variational dynamic background model (VDBM) the inference of parameters is done using variational methods and for the Bayesian generalized kernel background model (BGKBM), the inference is done using a proposed Markov chain Monte Carlo (MCMC) approach. The models are built on top of the scores returned by a handwritten recognizer for keywords and non-keywords. The approach is recognition based and works at line level. The methods have been validated on publicly available IAM dataset and compared with other state of the art line level keyword spotting approaches.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Vision and Pattern Recognition
Authors
Gaurav Kumar, Venu Govindaraju,