• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.3
• /
• pp.1417-1426
• /
• 2011

Business still relies heavily on pen and paper for legal reasons or convenience. The handwritten document is to be converted into digitalized document for IT system to manage and process in real time. Because the previous document digitalization systems convert the handwritten documents into digitalized documents by scanning and post-processing the documents, it is difficult to seamlessly proceed the work process. This paper proposes the LiveForm, a framework for digitalizing handwritten document using digital pen and handwriting recognition technology. To prove the applicability of the proposed LiveForm, we also implement a LiveForm based service in industrial gas distribution process and analyze effects of the system. The LiveForm generates the same digital image as the handwritten document by writing up the paper with absolute coordinates by digital pen and converts the handwriting data to digital text to insert the information into back-end system. The LiveForm based system eliminates scanning for document digitalization and data input with keyboard into back-end system in paper-based information gathering. Therefore, it is possible for the LiveForm to improve work process in various business areas.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.9
• /
• pp.27-33
• /
• 2011

In this paper, we propose an efficient on-line handwritten digit recognition base on Convex-Concave curves feature which is extracted by a chain code sequence using Smith-Waterman alignment algorithm. The time sequential signal from mouse movement on the writing pad is described as a sequence of consecutive points on the x-y plane. So, we can create data-set which are successive and time-sequential pixel position data by preprocessing. Data preprocessed is used for Convex-Concave curves feature extraction. This feature is scale-, translation-, and rotation-invariant. The extracted specific feature is fed to a Smith-Waterman alignment algorithm, which in turn classifies it as one of the nine digits. In comparison with backpropagation neural network, Smith-Waterman alignment has the more outstanding performance.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.288-295
• /
• 1998

This paper proposes a new data classification method based on the tolerant rough set that extends the existing equivalent rough set. Similarity measure between two data is described by a distance function of all constituent attributes and they are defined to be tolerant when their similarity measure exceeds a similarity threshold value. The determination of optimal similarity theshold value is very important for the accurate classification. So, we determine it optimally by using the genetic algorithm (GA), where the goal of evolution is to balance two requirements such that (1) some tolerant objects are required to be included in the same class as many as possible. After finding the optimal similarity threshold value, a tolerant set of each object is obtained and the data set is grounded into the lower and upper approximation set depending on the coincidence of their classes. We propose a two-stage classification method that all data are classified by using the lower approxi ation at the first stage and then the non-classified data at the first stage are classified again by using the rough membership functions obtained from the upper approximation set. We apply the proposed classification method to the handwritten numeral character classification. problem and compare its classification performance and learning time with those of the feed forward neural network's back propagation algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.6 no.3
• /
• pp.14-24
• /
• 1996

A fuzzy classifier which needs various analyses of features using genetic algorithms is proposed. The fuzzy classifier has a simple structure, which contains a classification part based on fuzzy logic theory and a rule generation ation padptu sing genetic algorithms. The rule generation part determines optimal fuzzy membership functions and inclusior~ or exclusion of each feature in fuzzy classification rules. We analyzed recognition rate of a specific object, then added finer features repetitively, if necessary, to the object which has large misclassification rate. And we introduce repetitive analyses method for the minimum size of string and population, and for the improvement of recognition rates. This classifier is applied to three examples of the classification of iris data, the discrimination of thyroid gland cancer cells and the recognition of confusing handwritten and printed numerals. In the recognition of confusing handwritten and printed numerals, each sample numeral is classified into one of the groups which are divided according to the sample structure. The fuzzy classifier proposed in this paper has recognition rates of 98. 67% for iris data, 98.25% for thyroid gland cancer cells and 96.3% for confusing handwritten and printed numeral!;.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.7
• /
• pp.1546-1552
• /
• 2004

Electronic Ink is a stored data in the form of the handwritten text or the script without converting it into ASCII by handwritten recognition on the pen-based computers and Personal Digital Assistants(Pocket PC) for supporting natural and convenient data input. One of the most important issues is to search the electronic ink in order to use it. We proposed and implemented a script matching algorithm for the electronic ink. Proposed matching algorithm separated the input stroke into a set of primitive stroke using the curvature of the stroke curve. After determining the type of separated strokes, it produced a stroke feature vector. And then it calculated the distance between the stroke feature vector of input strokes and one of strokes in the database using the dynamic programming technique.

• KIPS Transactions on Software and Data Engineering
• /
• v.10 no.4
• /
• pp.125-132
• /
• 2021

As the layers of artificial neural network deepens, and the dimension of data used as an input increases, there is a problem of high arithmetic operation requiring a lot of arithmetic operation at a high speed in the learning and recognition of the neural network (NN). Thus, this study proposes a data dimensionality reduction method to reduce the dimension of the input data in the NN. The proposed Line-segment Feature Analysis (LFA) algorithm applies a gradient-based edge detection algorithm using median filters to analyze the line-segment features of the objects existing in an image. Concerning the extracted edge image, the eigenvalues corresponding to eight kinds of line-segment are calculated, using 3×3 or 5×5-sized detection filters consisting of the coefficient values, including [0, 1, 2, 4, 8, 16, 32, 64, and 128]. Two one-dimensional 256-sized data are produced, accumulating the same response values from the eigenvalue calculated with each detection filter, and the two data elements are added up. Two LFA256 data are merged to produce 512-sized LAF512 data. For the performance evaluation of the proposed LFA algorithm to reduce the data dimension for the recognition of handwritten numbers, as a result of a comparative experiment, using the PCA technique and AlexNet model, LFA256 and LFA512 showed a recognition performance respectively of 98.7% and 99%.

• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.19-22
• /
• 2000

This paper presents new on-line handwritten algorithm for continuous alphabet uppercase characters. The algorithm is based on the idea that alphabet uppercase character consists of at most 4 strokes. It tries to determine the maximum output for a recognition result among outputs of four recognizers which have the capacity to discriminate the character using from 1 through 4 stroke information. The recognition module has 4 neural network based recognizers, which can recognize from 1 through 4 stroke character. We also use specialized post-processing techniques for improving the recognition performance. Trained on 440 input data and choosing 390 uppercase words for a recognition test we reached a 92% recognition rate.

• Proceedings of the KIEE Conference
• /
• 1989.07a
• /
• pp.701-706
• /
• 1989

This study has been aimed to analize and evaluate the performance of the coding algorithms for the handwritten signals such as the telewriting systems. Zone Coding and Differential Chain Coding algorithms have been analized and evaluated on the basis of time and space complexities. According to the simulation results, Zone Coding algorithm has shown better decoding performance from the viewpoint of the Root Mean Square decoding errors, but Differential Chain Coding algorithm has shown better data compression ratio and flexibility of its usage, along with its moderate decoding RMS errors.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.2932-2934
• /
• 1999

In this paper, a scheme for recognition of handwritten digits using a multilayer neural network trained with the back-propagation algorithm using generalized delta rule is proposed. The neural network is trained with hand written digit data of different writers and different styles. One of the purpose of the work with neural networks is the minimization of the mean square error(MSE) between actual output and desired one. The back-propagation algorithm is an efficient and very classical method. The back-propagation algorithm for training the weights in a multilayer net uses the steepest descent minimization procedure and the sigmoid threshold function. As an error rate is reduced, recognition rate is improved. Therefore we propose a method that is reduced an error rate.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.6
• /
• pp.995-1001
• /
• 1995

The structure of a typical pattern recognition consists a pre-processing, a feature extraction(algorithm) and classification or recognition. In classification, when widely varying patterns exist in same category, we need the clustering which organize the similar patterns. Clustering algorithm is two approaches. Firs, statistical approaches which are k-means, ISODATA algorithm. Second, neural network approach which is T. Kohonen's LVQ(Learning Vector Quantization). Nikhil R. Palet al proposed the GLVQ(Generalized LVQ, 1993). This paper suggest the efficient feature extraction methods of handwritten numerals in GLVQ clustering network. We use the handwritten numeral data from 21's authors(ie, 200 patterns) and compare the proportion of misclassified patterns for each feature extraction methods. As results, when we use the projection combination method, the classification ratio is 98.5%.