基于识别的手写数字串分割

手写数字串的分割与字符识别密切相关.采用基于识别的分割方法,在分割过程中引入识别机制识别分割碎片,将识别结果经过差值运算后置为每个识别对象的识别可信度,利用动态规划找到最佳分割路径.在训练分类器时,使用反例样本估计分类器参数,得到了性能良好的分类器.实验数据表明,利用正例和反例样本结合训练的分类器比只经过正例样本训练的分类器的识别率要高很多.     

联机手写维文字符切分算法研究

随着手机短信业务普及,智能手机中实现维吾尔文输入、输出已经是新疆地区1000多万少数民族用户迫切的需求。在连续输入的维吾尔文文章或单词中,切分出一个个的字母,供后续的字母识别使用,字母切分是手写输入识别的核心关键技术。手写维文字符串的分割与字符识别密切相关。采用基于识别的分割方法,系统先通过粗略的图像分析寻找所有可能的切点,在分割的过程中引入识别机制来识别分割碎片,将识别结果经过差值运算后置为每个识别对象的识别可信度,利用移动窗口法找到最佳分割路径。在分类器训练时,采用特征提取来估计分类器参数,得到了性质良好的分类器,试验表明,字符切割准确率高达97.3%。     

Normalized cuts and image segmentation

We propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach aims at extracting the global impression of an image. We treat image segmentation as a graph partitioning problem and propose a novel global criterion, the normalized cut, for segmenting the graph. The normalized cut criterion measures both the total dissimilarity between the different groups as well as the total similarity within the groups. We show that an efficient computational technique based on a generalized eigenvalue problem can be used to optimize this criterion. We applied this approach to segmenting static images, as well as motion sequences, and found the results to be very encouraging     

Arabic handwritten digit recognition

In this paper, we fill a gap in the literature by studying the problem of Arabic handwritten digit recognition. The performances of different classification and feature extraction techniques on recognizing Arabic digits are going to be reported to serve as a benchmark for future work on the problem. The performance of well known classifiers and feature extraction techniques will be reported in addition to a novel feature extraction technique we present in this paper that gives a high accuracy and competes with the state-of-the-art techniques. A total of 54 different classifier/features combinations will be evaluated on Arabic digits in terms of accuracy and classification time. The results are analyzed and the problem of the digit ‘0’ is identified with a proposed method to solve it. Moreover, we propose a strategy to select and design an optimal two-stage system out of our study and, hence, we suggest a fast two-stage classification system for Arabic digits which achieves as high accuracy as the highest classifier/features combination but with much less recognition time.     

Automatic feature generation for handwritten digit recognition

An automatic feature generation method for handwritten digit recognition is described. Two different evaluation measures, orthogonality and information, are used to guide the search for features. The features are used in a backpropagation trained neural network. Classification rates compare favorably with results published in a survey of high-performance handwritten digit recognition systems. This classifier is combined with several other high performance classifiers. Recognition rates of around 98% are obtained using two classifiers on a test set with 1000 digits per class     

Cloud-based efficient scheme for handwritten digit recognition

Multimedia Tools and Applications - Handwritten character recognition has been acknowledged and achieved more prominent attention in pattern recognition research community due to enormous...     

Handwritten digit segmentation: a comparative study

In this work, algorithms for segmenting handwritten digits based on different concepts are compared by evaluating them under the same conditions of implementation. A robust experimental protocol based on a large synthetic database is used to assess each algorithm in terms of correct segmentation and computational time. Results on a real database are also presented. In addition to the overall performance of each algorithm, we show the performance for different types of connections, which provides an interesting categorization of each algorithm. Another contribution of this work concerns the complementarity of the algorithms. We have observed that each method is able to segment samples that cannot be segmented by any other method, and do so independently of their individual performance. Based on this observation, we conclude that combining different segmentation algorithms may be an appropriate strategy for improving the correct segmentation rate.     

A trainable feature extractor for handwritten digit recognition

This article focuses on the problems of feature extraction and the recognition of handwritten digits. A trainable feature extractor based on the LeNet5 convolutional neural network architecture is introduced to solve the first problem in a black box scheme without prior knowledge on the data. The classification task is performed by support vector machines to enhance the generalization ability of LeNet5. In order to increase the recognition rate, new training samples are generated by affine transformations and elastic distortions. Experiments are performed on the well-known MNIST database to validate the method and the results show that the system can outperform both SVMs and LeNet5 while providing performances comparable to the best performance on this database. Moreover, an analysis of the errors is conducted to discuss possible means of enhancement and their limitations.     

脱机手写数字识别方法

脱机手写体数字识别有着重大的使用价值,特征提取占据了重要的位置.提出了一种通过拓扑特征构造的特征提取新方法,利于了9种特征对数字进行特征提取,然后利用分类树的方法将数字进行分类.最后,在本科学生手写数字图像样本库上的试验结果表明,提出的特征提取方法不仅具有很快的运算能力,而且较大幅度地提高了识别率.     

手写数字识别的研究

为了提高手写数字识别的性能,研究了利用BP神经网络作为分类器在设计上的几个关键问题,给出每个关键环节的可行方案并进行有效总结.同时对脱机手写数字的图像预处理及特征提取部分的关键技术做了详细阐述.在此基础上给出分类器设计与训练的详细实验,实验结果表明,合理解决设计BP神经网络分类器的关键问题能够确保其对手写数字的高分类性能.     

Segmentation and recognition system for unknown-length handwritten digit strings

The segmentation of handwritten digit strings into isolated digits remains a challenging task. The difficulty for recognizing handwritten digit strings is related to several factors such as sloping, overlapping, connecting and unknown length of the digit string. Hence, this paper aims to propose a segmentation and recognition system for unknown-length handwritten digit strings by combining several explicit segmentation methods depending on the configuration link between digits. Three segmentation methods are combined based on histogram of the vertical projection, the contour analysis and the sliding window Radon transform. A recognition and verification module based on support vector machine classifiers allows analyzing and deciding the rejection or acceptance each segmented digit image. Moreover, various submodules are included leading to enhance the robustness of the proposed system. Experimental results conducted on the benchmark dataset show that the proposed system is effective for segmenting handwritten digit strings without prior knowledge of their length comparatively to the state of the art.     

A novel prototype generation technique for handwriting digit recognition

The aim of this paper is to introduce a novel prototype generation technique for handwriting digit recognition. Prototype generation is approached as a two-stage process. The first stage uses an Adaptive Resonance Theory 1 (ART1) based algorithm to select an effective initial solution, while the second one executes a fine tuning designed to generate the best prototypes.     

An MLP-SVM combination architecture for offline handwritten digit recognition

This paper presents an original hybrid MLP-SVM method for unconstrained handwritten digits recognition. Specialized Support Vector Machines (SVMs) are introduced to improve significantly the multilayer perceptron (MLP) performance in local areas around the separating surfaces between each pair of digit classes, in the input pattern space. This hybrid architecture is based on the idea that the correct digit class almost systematically belongs to the two maximum MLP outputs and that some pairs of digit classes constitute the majority of MLP substitutions (errors). Specialized local SVMs are introduced to detect the correct class among these two classification hypotheses. The hybrid MLP-SVM recognizer achieves a recognition rate of 98.01%98.01\% , for real mail zipcode digits recognition task. By introducing a rejection mechanism based on the distances provided by the local SVMs, the error/reject trade-off performance of our recognition system is better than several classifiers reported in recent research.     

Attributed string matching with merging for shape recognition

A new structural approach to shape recognition using attributed string matching with merging is proposed. After illustrating the disadvantages of conventional symbolic string matching using changes, deletions, and insertions, attributed strings are suggested for matching. Each attributed string is an ordered sequence of shape boundary primitives, each representing a basic boundary structural unit, line segment, with two types of numerical attributes, length and direction. A new type of primitive edit operation, called merge, is then introduced, which can be used to combine and then match any number of consecutive boundary primitives in one shape with those in another. The resulting attributed string matching with merging approach is shown useful for recognizing distorted shapes. Experimental results prove the feasibility of the proposed approach for general shape recognition. Some possible extensions of the approach are also included.     

Object segmentation using graph cuts based active contours

In this paper we present a graph cuts based active contours (GCBAC) approach to object segmentation. GCBAC approach is a combination of the iterative deformation idea of active contours and the optimization tool of graph cuts. It differs from traditional active contours in that it uses graph cuts to iteratively deform the contour and its cost function is defined as the summation of edge weights on the cut. The resulting contour at each iteration is the global optimum within a contour neighborhood (CN) of the previous result. Since this iterative algorithm is shown to converge, the final contour is the global optimum within its own CN. The use of contour neighborhood alleviates the well-known bias of the minimum cut in favor of a shorter boundary. GCBAC approach easily extends to the segmentation of three and higher dimensional objects, and is suitable for interactive correction. Experimental results on selected data sets and performance analysis are provided.