Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Christian Viard-Gaudin is active.

Publication


Featured researches published by Christian Viard-Gaudin.


Pattern Recognition | 2009

On-line hand-drawn electric circuit diagram recognition using 2D dynamic programming

Guihuan Feng; Christian Viard-Gaudin; Zhengxing Sun

In order to facilitate sketch recognition, most online existing works assume that people will not start to draw a new symbol before the current one has been finished. We propose in this paper a method that relaxes this constraint. The proposed methodology relies on a two-dimensional dynamic programming (2D-DP) technique allowing symbol hypothesis generation, which can correctly segment and recognize interspersed symbols. In addition, as discriminative classifiers usually have limited capability to reject outliers, some domain specific knowledge is included to circumvent those errors due to untrained patterns corresponding to erroneous segmentation hypotheses. With a point-level measurement, the experiment shows that the proposed novel approach is able to achieve an accuracy of more than 90 percent.


Pattern Recognition | 2009

Automatic writer identification framework for online handwritten documents using character prototypes

Guo Xian Tan; Christian Viard-Gaudin; Alex C. Kot

This paper proposes an automatic text-independent writer identification framework that integrates an industrial handwriting recognition system, which is used to perform an automatic segmentation of an online handwritten document at the character level. Subsequently, a fuzzy c-means approach is adopted to estimate statistical distributions of character prototypes on an alphabet basis. These distributions model the unique handwriting styles of the writers. The proposed system attained an accuracy of 99.2% when retrieved from a database of 120 writers. The only limitation is that a minimum length of text needs to be present in the document in order for sufficient accuracy to be achieved. We have found that this minimum length of text is about 160 characters or approximately equivalent to 3 lines of text. In addition, the discriminative power of different alphabets on the accuracy is also reported.


international conference on document analysis and recognition | 2011

CROHME2011: Competition on Recognition of Online Handwritten Mathematical Expressions

Harold Mouchère; Christian Viard-Gaudin; Dae Hwan Kim; Jin Hyung Kim; Utpal Garain

A competition on recognition of online handwritten mathematical expressions is organized. Recognition of mathematical expressions has been an attractive problem for the pattern recognition community because of the presence of enormous uncertainties and ambiguities as encountered during parsing of the two-dimensional structure of expressions. The goal of this competition is to bring out a state of the art for the related research. Three labs come together to organize the event and six other research groups participated the competition. The competition defines a standard format for presenting information, provides a training set of 921 expressions and supplies the underlying grammar for understanding the content of the training data. Participants were invited to submit their recognizers which were tested with a new set of 348 expressions. Systems are evaluated based on four different aspects of the recognition problem. However, the final rating of the systems is done based on their correct expression recognition accuracies. The best expression level recognition accuracy (on the test data) shown by the competing systems is 19.83% whereas a baseline system developed by one of the organizing groups reports an accuracy 22.41% on the same data set.


document recognition and retrieval | 2011

First experiments on a new online handwritten flowchart database

Ahmad-Montaser Awal; Guihuan Feng; Harold Mouchère; Christian Viard-Gaudin

We propose in this paper a new online handwritten flowchart database and perform some first experiments to have a baseline benchmark on this dataset. The collected database consists of 419 flowcharts labeled at the stroke and symbol levels. In addition, an isolated database of graphical and text symbols was extracted from these collected flowcharts. Then, we tackle the problem of online handwritten flowchart recognition from two different points of view. Firstly, we consider that flowcharts are correctly segmented, and we propose different classifiers to perform two tasks, text/non-text separation and graphical symbol recognition. Tested with the extracted isolated test database, we achieve up to 90% and 98% in text/non-text separation and up to 93.5% in graphical symbols recognition. Secondly, we propose a global approach to perform flowchart segmentation and recognition. For this latter, we adopt a global learning schema and a recognition architecture that considers a simultaneous segmentation and recognition. Global architecture is trained and tested directly with flowcharts. Results show the interest of such global approach, but regarding the complexity of flowchart segmentation problem, there is still lot of space to improve the global learning and recognition methods.


international conference on document analysis and recognition | 2009

Towards Handwritten Mathematical Expression Recognition

Ahmad-Montaser Awal; Harold Mouchère; Christian Viard-Gaudin

In this paper, we propose a new framework for online handwritten mathematical expression recognition. The proposed architecture aims at handling mathematical expression recognition as a simultaneous optimization of symbol segmentation, symbol recognition, and 2D structure recognition under the restriction of a mathematical expression grammar. To achieve this goal, we consider a hypothesis generation mechanism supporting a 2D grouping of elementary strokes, a cost function defining the global likelihood of a solution, and a dynamic programming scheme giving at the end the best global solution according to a 2D grammar and a classifier. As a classifier, a neural network architecture is used; it is trained within the overall architecture allowing rejecting incorrect segmented patterns. The proposed system is trained with a set of synthetic online handwritten mathematical expressions. When tested on a set of real complex expressions, the system achieves promising results at both symbol and expression interpretation levels.


Pattern Recognition Letters | 2014

A global learning approach for an online handwritten mathematical expression recognition system

Ahmad-Montaser Awal; Harold Mouchère; Christian Viard-Gaudin

Despite the recent advances in handwriting recognition, handwritten two-dimensional (2D) languages are still a challenge. Electrical schemas, chemical equations and mathematical expressions (MEs) are examples of such 2D languages. In this case, the recognition problem is particularly difficult due to the two dimensional layout of the language. This paper presents an online handwritten mathematical expression recognition system that handles mathematical expression recognition as a simultaneous optimization of expression segmentation, symbol recognition, and 2D structure recognition under the restriction of a mathematical expression grammar. The originality of the approach is a global strategy allowing learning mathematical symbols and spatial relations directly from complete expressions. A new contextual modeling is proposed for combining syntactic and structural information. Those models are used to find the most likely combination of segmentation/recognition hypotheses proposed by a 2D segmentation scheme. Thus, models are based on structural information concerning the symbol layout. The system is tested with a new public database of mathematical expressions which was used in the CHROME competition. We have also produced a large base of semi-synthetic expressions which are used to train and test the global learning approach. We obtain very promising results on both synthetic and real expressions databases, as well as in the recent CHROME competition.


international conference on pattern recognition | 1994

A two-dimensional bar code reader

Nicolas Normand; Christian Viard-Gaudin

As an alternative to the use of laser scanners for bar code readers, we have developed a global solution based on a 2D vision system. It is composed of two main functions: bar code localization on the overall image, and the reading stage. The localization of the symbol which can be oriented in any direction is carried out with an original method which relies upon the extraction of high density area of mono-oriented gradients. The reading method is based on the detection of the transitions between the stripes by extracting the zero-crossings of the second derivative of the 1D signal reconstructed from the 20 bar code block. This system has been tested on several hundred images, the results show a global success rate (localization and decoding) of 100% within a wide range of acquisition parameters, resolution and depth of field, as the camera is not auto-focused the images can be deeply blurred.


international conference on frontiers in handwriting recognition | 2012

ICFHR 2012 Competition on Recognition of On-Line Mathematical Expressions (CROHME 2012)

Harold Mouchère; Christian Viard-Gaudin; Dae Hwan Kim; Jin Hyung Kim; Utpal Garain

This paper presents an overview of the second Competition on Recognition of Online Handwritten Mathematical Expressions, CROHME 2012. The objective of the contest is to identify current advances in mathematical expression recognition using common evaluation performance measures and datasets. This paper describes the contest details including the evaluation measures used as well as the performance of the 7 submitted systems along with a short description of each system. Progress as compared to the 1st version of CROHME is also documented.


international conference on document analysis and recognition | 2011

Stroke-Based Performance Metrics for Handwritten Mathematical Expressions

Richard Zanibbi; Amit Pillay; Harold Mouchère; Christian Viard-Gaudin; Dorothea Blostein

Evaluating mathematical expression recognition involves a complex interaction of input primitives (e.g. pen/finger strokes), recognized symbols, and recognized spatial structure. Existing performance metrics simplify this problem by separating the assessment of spatial structure from the assessment of symbol segmentation and classification. These metrics do not characterize the overall accuracy of a pen-based mathematics recognition, making it difficult to compare math recognition algorithms, and preventing the use of machine learning algorithms requiring a criterion function characterizing overall system performance. To address this problem, we introduce performance metrics that bridge the gap from handwritten strokes to spatial structure. Our metrics are computed using bipartite graphs that represent classification, segmentation and spatial structure at the stroke level. Overall correctness of an expression is measured by counting the number of relabelings of nodes and edges needed to make the bipartite graph for a recognition result match the bipartite graph for ground truth. This metric may also be used with other primitive types (e.g. image pixels).


international conference on frontiers in handwriting recognition | 2014

ICFHR 2014 Competition on Recognition of On-line Handwritten Mathematical Expressions (CROHME 2014)

Harold Mouchère; Christian Viard-Gaudin; Richard Zanibbi; Utpal Garain

We present the outcome of the latest edition of the CROHME competition, dedicated to on-line handwritten mathematical expression recognition. In addition to the standard full expression recognition task from previous competitions, CROHME 2014 features two new tasks. The first is dedicated to isolated symbol recognition including a reject option for invalid symbol hypotheses, and the second concerns recognizing expressions that contain matrices. System performance is improving relative to previous competitions. Data and evaluation tools used for the competition are publicly available.

Collaboration


Dive into the Christian Viard-Gaudin's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar

Emmanuel Morin

Institut de Recherche en Communications et Cybernétique de Nantes

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Alex C. Kot

Nanyang Technological University

View shared research outputs
Top Co-Authors

Avatar

Guo Xian Tan

Nanyang Technological University

View shared research outputs
Top Co-Authors

Avatar

Richard Zanibbi

Rochester Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

Utpal Garain

Indian Statistical Institute

View shared research outputs
Researchain Logo
Decentralizing Knowledge