Entry A:2014:AMO from talip.bib

Last update: Sun Oct 15 02:55:04 MDT 2017                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{A:2014:AMO,
  author =       "Bharath A. and Sriganesh Madhvanath",
  title =        "Allograph modeling for online handwritten characters
                 in {Devanagari} using constrained stroke clustering",
  journal =      j-TALIP,
  volume =       "13",
  number =       "3",
  pages =        "12:1--12:??",
  month =        sep,
  year =         "2014",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/2629622",
  ISSN =         "1530-0226 (print), 1558-3430 (electronic)",
  ISSN-L =       "1530-0226",
  bibdate =      "Sat Oct 4 06:09:41 MDT 2014",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/talip.bib",
  abstract =     "Writer-specific character writing variations such as
                 those of stroke order and stroke number are an
                 important source of variability in the input when
                 handwriting is captured ``online'' via a stylus and a
                 challenge for robust online recognition of handwritten
                 characters and words. It has been shown by several
                 studies that explicit modeling of character allographs
                 is important for achieving high recognition accuracies
                 in a writer-independent recognition system. While
                 previous approaches have relied on unsupervised
                 clustering at the character or stroke level to find the
                 allographs of a character, in this article we propose
                 the use of constrained clustering using automatically
                 derived domain constraints to find a minimal set of
                 stroke clusters. The allographs identified have been
                 applied to Devanagari character recognition using
                 Hidden Markov Models and Nearest Neighbor classifiers,
                 and the results indicate substantial improvement in
                 recognition accuracy and/or reduction in memory and
                 computation time when compared to alternate modeling
                 techniques.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "ACM Transactions on Asian Language Information
                 Processing",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?&idx=J820",
}

Related entries