Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Anne-Laure Bianne-Bernard

dblp:50/7443 · also Anne-Laure Bianne · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Image recognition and object detection · 70% Probabilistic and Bayesian machine learning · 30%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › Image recognition and object detection
handwriting recognition
0.112011
Dynamic and Contextual Information in HMM Modeling for Handwritten Word Recognition · IEEE Trans. Pattern Anal. Mach. Intell. 2011
Computer vision › Image recognition and object detection › handwriting recognition
handwritten word recognition
0.112011
Dynamic and Contextual Information in HMM Modeling for Handwritten Word Recognition · IEEE Trans. Pattern Anal. Mach. Intell. 2011
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
hidden markov model
0.112011
Dynamic and Contextual Information in HMM Modeling for Handwritten Word Recognition · IEEE Trans. Pattern Anal. Mach. Intell. 2011
Computer vision › Image recognition and object detection
character recognition
0.012011
Dynamic and Contextual Information in HMM Modeling for Handwritten Word Recognition · IEEE Trans. Pattern Anal. Mach. Intell. 2011

Methods — techniques the papers use, named apart from their topics

state tying · 0.1hidden markov model · 0.1decision tree clustering · 0.1
YearPublicationVenuePosition
2011 Dynamic and Contextual Information in HMM Modeling for Handwritten Word Recognition
abstract
This study aims at building an efficient word recognition system resulting from the combination of three handwriting recognizers. The main component of this combined system is an HMM-based recognizer which considers dynamic and contextual information for a better modeling of writing units. For modeling the contextual units, a state-tying process based on decision tree clustering is introduced. Decision trees are built according to a set of expert-based questions on how characters are written. Questions are divided into global questions, yielding larger clusters, and precise questions, yielding smaller ones. Such clustering enables us to reduce the total number of models and Gaussians densities by 10. We then apply this modeling to the recognition of handwritten words. Experiments are conducted on three publicly available databases based on Latin or Arabic languages: Rimes, IAM, and OpenHart. The results obtained show that contextual information embedded with dynamic modeling significantly improves recognition.
Anne-Laure Bianne-Bernard, Farès Menasri, Ramy Al-Hajj Mohamad, Chafic Mokbel, Christopher Kermorvant, Laurence Likforman-Sulem
IEEE Trans. Pattern Anal. Mach. Intell.1
2010 The A2iA-Telecom ParisTech-UOB System for the ICDAR 2009 Handwriting Recognition Competition
abstract
This article describes the isolated word recognizer presented by the authors to the ICDAR 2009 French handwriting recognition competition. The system is a combination of three isolated word recognizers based on different features and models. A novel n-best combination method is proposed and compared to standard combination methods. New results on the ICDAR 2009 test database are reported.
Christopher Kermorvant, Farès Menasri, Anne-Laure Bianne-Bernard, Ramy Al-Hajj Mohamad, Chafic Mokbel, Laurence Likforman-Sulem
ICFHR3
2009 From Isolated Handwritten Characters to Fields Recognition: There's Many a Slip Twixt Cup and Lip
abstract
Recognition of handwritten characters has been a popular task for the evaluation of classification algorithms for many years. Looking at the latest results on databases such as USPS or MNIST, one could think that character recognition is a solved problem. In this paper, we claim that this is not the case for two reasons : first because the classical databases for digit recognition are realistic but too simple and second because digit recognition is not a real-world task but only a part of it. In this paper, we contribute to a better understanding of these two aspects with new results. In a first part, we compare three state-of-the-art recognizers on a digit recognition task extracted from a real world application and show that the error rates on this database can not be extrapolated from MNIST. Then, in a second part, we present and evaluate a system designed for an industrial application based on character recognition: document identification with floating field recognition.
Christopher Kermorvant, Anne-Laure Bianne-Bernard, Patrick Marty, Farès Menasri
ICDAR2