The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We develop a Maximum Spanning Tree (MST) based parser using Edmonds' algorithm, which extracts an MST from a directed Line-of-Sight graph in two passes. First, symbols are segmented by grouping input strokes, and then symbols and symbol pair spatial relationships are labeled. The time complexity of our MST-based parsing is lower than the time complexity of CYK parsing with 2-D Context-Free grammars...
This paper presents a new representation for handwritten math formulae: a Line-of-Sight (LOS) graph over handwritten strokes, computed using stroke convex hulls. Experimental results using the CROHME 2012 and 2014 datasets show that LOS graphs capture the visual structure of handwritten formulae better than commonly used graphs such as Time-series, Minimum Spanning Trees, and k-Nearest Neighbor graphs...
We generalize recursive baseline extraction algorithms for symbol layout analysis in math expressions so that handwritten strokes may be provided as input. Specifically, baseline extraction is used for lexical analysis in a modified LL(1) parser, returning a set of candidate symbols when the leftmost or next symbol along the current baseline (from left-to-right) is requested by the parser. Candidate...
This paper presents a recognition system based on Hidden Markov Model (HMM) for isolated online handwritten mathematical symbols. We design a continuous left to right HMM for each symbol class and use four online local features, including a new feature: normalized distance to stroke edge. A variant of segmental K-means is used to get initialization of the Gaussian Mixture Models' parameters which...
Automatic signature verification has been an intense research area because of the social and legal acceptance and widespread use of written signatures. It is still a challenging issue because of "small sample size " problem as well as large intra-class variations and, when considering forgeries, small inter-class variations. In order to solve these problems, we propose a two-stage fusion...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.