Laurent Heutte

A writer identification and verification system

In this paper, we show that both the writer identification and the writer verification tasks can be carried out using local features such as graphemes extracted from the segmentation of cursive handwriting. We thus enlarge the scope of the possible use of these two tasks which have been, up to now, mainly evaluated on script handwritings. A textual based Information Retrieval model is used for the writer identification stage. This allows the use of a particular feature space based on feature frequencies. Image queries are handwritten documents projected in this feature space. The approach achieves 95% correct identification on the PSI_DataBase and 86% on the IAM_DataBase. Then writer hypothesis retrieved are analysed during a verification phase. We call upon a mutual information criterion to verify that two documents may have been produced by the same writer or not. Hypothesis testing is used for this purpose. The proposed method is first scaled on the PSI_DataBase then evaluated on the IAM_DataBase. On both databases, similar performance of nearly 96% correct verification is reported, thus making the approach general and very promising for large scale applications in the domain of handwritten document querying and writer verification.

A structural/statistical feature based vector for handwritten character recognition

This paper describes the application of structural features to the statistical recognition of handwritten characters. It has been demonstrated that a complete description of the characters, based on the combination of seven different families of features, can be achieved and that the same general-purpose structural/statistical feature based vector thus defined proves efficient and robust on different categories of handwritten characters such as digits, uppercase letters and graphemes.

Classification of plant leaf images with complicated background

Classifying plant leaves has so far been an important and difficult task, especially for leaves with complicated background where some interferents and overlapping phenomena may exist. In this paper, an efficient classification framework for leaf images with complicated background is proposed. First, a so-called automatic marker-controlled watershed segmentation method combined with pre-segmentation and morphological operation is introduced to segment leaf images with complicated background based on the prior shape information. Then, seven Hu geometric moments and sixteen Zernike moments are extracted as shape features from segmented binary images after leafstalk removal. In addition, a moving center hypersphere (MCH) classifier which can efficiently compress feature data is designed to address obtained mass high-dimensional shape features. Finally, experimental results on some practical plant leaves show that proposed classification framework works well while classifying leaf images with complicated background. There are twenty classes of practical plant leaves successfully classified and the average correct classification rate is up to 92.6%.

Information retrieval based writer identification

This communication deals with the Writer Identificationtask. Our previous work has shown the interest of usingthe graphemes as features for describing the individualproperties of Handwriting. We propose here to exploit thesame feature set but using an information retrievalparadigm to describe and compare the handwritten queryto each sample of handwriting in the database. Using thistechnique the image processing stage is performed onlyonce and before the retrieval process can take place, thusleading to a significant saving in the computation of eachquery response, compared to our initial proposition. Themethod has been tested on two handwritten databases.The first one has been collected from 88 different writersat PSI Lab. while the second one contains 39 writers fromthe original correspondence of Emile Zola, a famousFrench novelist of the last 19th century. We also analyzethe proposed method when using concatenation ofgraphemes (bi and tri-gramme) as features.

Writer identification by writer's invariants

This communication deals with the problem of writer identification. If the assumption of writing individuality is true then graphical fragments that constitute it should be individual too. Therefore we propose a morphological grapheme based analysis to make writer identification. Template Matching is the core of the approach. The redundancy of the individual patterns in a writing, defined as the writers invariants, allows to compress the handwritten texts while maintaining good identification performance. Two series of tests are reported. The first series is designed to evaluate the relevance of our approach of identification on a basis of 88 writers by evaluating the influence of the text representation (with or without invariants) on the quality of the method. The method gives about 97,7% of correct identification when using large compressed samples of handwriting. The second series of tests is designed to evaluate the influence of the sample size of the writing to be identified on the quality of the method. It is shown that writer identification can reach a correct identification rate of 92,9% using only samples of 50 graphemes of each writing.

A Dataset for Breast Cancer Histopathological Image Classification

Today, medical image analysis papers require solid experiments to prove the usefulness of proposed methods. However, experiments are often performed on data selected by the researchers, which may come from different institutions, scanners, and populations. Different evaluation measures may be used, making it difficult to compare the methods. In this paper, we introduce a dataset of 7909 breast cancer histopathology images acquired on 82 patients, which is now publicly available from http://web.inf.ufpr.br/vri/breast-cancer-database. The dataset includes both benign and malignant images. The task associated with this dataset is the automated classification of these images in two classes, which would be a valuable computer-aided diagnosis tool for the clinician. In order to assess the difficulty of this task, we show some preliminary results obtained with state-of-the-art image classification systems. The accuracy ranges from 80% to 85%, showing room for improvement is left. By providing this dataset and a standardized evaluation protocol to the scientific community, we hope to gather researchers in both the medical and the machine learning field to advance toward this clinical application.

Breast cancer histopathological image classification using Convolutional Neural Networks

The performance of most conventional classification systems relies on appropriate data representation and much of the efforts are dedicated to feature engineering, a difficult and time-consuming process that uses prior expert domain knowledge of the data to create useful features. On the other hand, deep learning can extract and organize the discriminative information from the data, not requiring the design of feature extractors by a domain expert. Convolutional Neural Networks (CNNs) are a particular type of deep, feedforward network that have gained attention from research community and industry, achieving empirical successes in tasks such as speech recognition, signal processing, object recognition, natural language processing and transfer learning. In this paper, we conduct some preliminary experiments using the deep learning approach to classify breast cancer histopathological images from BreaKHis, a publicly dataset available at http://web.inf.ufpr.br/vri/breast-cancer-database. We propose a method based on the extraction of image patches for training the CNN and the combination of these patches for final classification. This method aims to allow using the high-resolution histopathological images from BreaKHis as input to existing CNN, avoiding adaptations of the model that can lead to a more complex and computationally costly architecture. The CNN performance is better when compared to previously reported results obtained by other machine learning models trained with hand-crafted textural descriptors. Finally, we also investigate the combination of different CNNs using simple fusion rules, achieving some improvement in recognition rates.

One class random forests

One class classification is a binary classification task for which only one class of samples is available for learning. In some preliminary works, we have proposed One Class Random Forests (OCRF), a method based on a random forest algorithm and an original outlier generation procedure that makes use of classifier ensemble randomization principles. In this paper, we propose an extensive study of the behavior of OCRF, that includes experiments on various UCI public datasets and comparison to reference one class namely, Gaussian density models, Parzen estimators, Gaussian mixture models and One Class SVMs-with statistical significance. Our aim is to show that the randomization principles embedded in a random forest algorithm make the outlier generation process more efficient, and allow in particular to break the curse of dimensionality. One Class Random Forests are shown to perform well in comparison to other methods, and in particular to maintain stable performance in higher dimension, while the other algorithms may fail.

Dynamic Random Forests

In this paper, we introduce a new Random Forest (RF) induction algorithm called Dynamic Random Forest (DRF) which is based on an adaptative tree induction procedure. The main idea is to guide the tree induction so that each tree will complement as much as possible the existing trees in the ensemble. This is done here through a resampling of the training data, inspired by boosting algorithms, and combined with other randomization processes used in traditional RF methods. The DRF algorithm shows a significant improvement in terms of accuracy compared to the standard static RF induction algorithm.

Defining writer's invariants to adapt the recognition task

Investigates the automatic reading of unconstrained omni-writer handwritten texts. This paper shows how to endow the reading system with adaptation faculties for each writers handwriting. The adaptation principles are of major importance for making robust decisions when neither simple lexical nor syntactic rules can be used, e.g. for a free lexicon or for full text recognition. The first part of this paper defines the concept of writers invariants. In the second part, we explain how the recognition system can be adapted to a particular handwriting by exploiting the graphical context defined by the writers invariants. This adaptation is guaranteed, thanks to the writers invariants, by activating interaction links over the whole text between the recognition procedures for word entities and those for letter entities.