ISSN ONLINE(2320-9801) PRINT (2320-9798)

Yakışıklı erkek tatil için bir beldeye gidiyor burada kendisine türk Porno güzel bir seksi kadın ayarlıyor Onunla beraber otel odasına gidiyorlar Otel odasına rokettube giren kadın ilk önce erkekle sohbet ederek işi yavaş halletmeye çalışıyor sex hikayeleri Kocası fabrikatör olan sarışın Rus hatun şehirden biraz uzak olan bir türk porno kasabaya son derece lüks bir villa yaptırıp yerleşiyor Kocasını işe gönderip mobil porno istediği erkeği eve atan Rus hatun son olarak fotoğraf çekimi yapmak üzere türk porno evine gelen genç adamı bahçede azdırıyor Güzel hatun zengin bir iş adamının porno indir dostu olmayı kabul ediyor Adamın kendisine aldığı yazlık evde sikiş kalmaya başlayan hatun bir süre sonra kendi erkek arkadaşlarını bir bir çağırarak onlarla porno izle yapıyor Son olarak çağırdığı arkadaşını kapıda üzerinde beyaz gömleğin açık sikiş düğmelerinden fışkıran dik memeleri ile karşılayıp içeri girer girmez sikiş dudaklarına yapışarak sevişiyor Evin her köşesine yayılan inleme seslerinin eşliğinde yorgun düşerek orgazm oluyor

Handwritten Document Editor: A Review

Sumit Nalawade1, Rashmi Welekar2, Raj Dugar3
  1. M.Tech. Student, Department of Computer Science & Engineering, Shri Ramdeobaba College Of Engineering& Management, Nagpur, India
  2. Assistant Professor, Department Of Computer Science & Engineering, Shri Ramdeobaba College Of Engineering& Management, Nagpur, India
  3. Module Lead, Persistent Systems Limited, Nagpur, India
Related article at Pubmed, Scholar Google

Visit for more related articles at International Journal of Innovative Research in Computer and Communication Engineering


In the current era, handwriting recognition & personalization of document is becoming concern of many researchers. It has most significant applications in many fields such as Optical Character Recognition, Security Systems etc. Also in daily uses such as banks, post offices, businesses. Personalization is key to the future of one’s identity. This paper provides a comprehensive review of various methods used for character recognition such as Neural Networks, Support Vector machines, K-NN classifier and provides a short review of Binary Coded Genetic Algorithm which can be used for speed optimization of the classification process. This paper also gives a snapshot of Marching Squares Algorithm which is a basic procedure for tracing contour points on images.



OCR, K-NN classifier, Genetic Algorithm, Marching Squares Algorithm, Binary Gradient Vectors, Image Processing.


Character recognition process comprised of extracting the features of script and individual characters and identification of characters based of features. The difficulties faced by these systems are variations in writing styles, heights & widths of characters, slanting angles. The major technique used for offline character recognition are neural network, support vector machines. Some authors have proposed systems which employed hidden markov model for the same. The problem with these approaches increase with increasing size of training data. To solve this problem we need an optimization technique which will decreased the running time of the classifier. Binary coded genetic algorithm along with K-NN classifier can be used for clustering to solve this optimization problem
Yonghong Song [1], gives details about multi-language document images where many different types of characters need to be recognised. His document consists different languages such as Chinese, Japanese, English and also their combination. It uses genetic algorithm for feature fusion and patch type classification. At last uses markov random field model for post processing. Rahul Kala [2] in his works deals with graph theory and studies various fonts generated by graph. He uses different styles in which characters can be written and uses offline handwritten recognition for identifying characters by converting them into graphs. Finally implemented the genetic algorithm to optimize the results. S. Impedovo and F. M. Mangini [3] proposed a novel technique for handwritten digit classification which uses binary coded genetic algorithm for optimization and speed up of the K-NN classifier. The main idea behind using genetic algorithm is to reduce number of comparisons by forming cluster centers. Vijay Patil and Sanjay Shimpi [4] uses neural network for character recognition in which he created character matrix and key is suitable network structure. He also uses back propagation algorithm to calculate errors and modifying weights.
The English script consists of total 94 different shapes which includes capital letters, small letters, digits and standard special symbols. Fig. 1 shows a handwritten sample of this complete standard character set. Many systems or methods are available to recognize them separately but building a recognition system for all these shapes together is a difficult task. We need to identify the unique features of individual shapes and used proper dissimilarity measures to distinguish among them. There can be differences in height, size and width of characters. Some characters may have similar looking such as 1 (DIGIT ONE) and l (LATIN SMALL LETTER L). Different sets of characters are formed which have different look due to different environment of writing.
The editor system we are trying to put to work is a twofold approach which involves character recognition and handwritten font generation. In this paper we are reviewing methods for the two and will comment on which can be the best suitable approach for our system to be built.


This section deals with different approaches used to recognize the characters from documents. This recognition methods have genetic algorithm along with K-NN classifiers, neural networks.
Character extraction from handwritten can be done at three different steps: on the level of text [5], then word [6], [7], [8],[9] and at last characters [10], [11], [12]. Methods which are performed at text line level are not difficult to implement and can be implemented for different language, but can be done only for specified formats. At character level, there are difficulty when character appear to be curved and overlapping. Considering the limitation of such factors the author deals only with the word level of documents. The following figure 2 shows the details of the flowchart of handwritten character extraction.
Previous text patch segmentation method utilizes simple operation such as mathematical morphological operation and simple neighborhood rules.
The handwritten recognition mainly involved three steps such as segmentation, pre-processing and recognition. Segmentation means breaking of the lines, word and lastly getting all the characters separated. This step involves identifying the boundaries of the character and separating them for further processing. Pre-processing of image can be used as initial steps for the recognition system. Once the input image is available in unique condition, it may be processed for recognition. The generation of graph algorithm takes image as input and return the graph of the image. The whole procedure requires the principle of graph theory and coordinate geometry. Figure 3 shows the details of the graph theory algorithm.
There is need to form the matrixes of each character in such a way to understand how to take out the binary input image from the matrix and how to manipulate the binary output image which the computer interprets.
S. Impedovo presents a new clustering approach for improving handwritten digit classification. The K-NN classifier [15] is used with a binary coded genetic algorithm [13]. Forming the clusters is considered as optimization problem in this approach. The training data is drastically reduced to only a handful of cluster centers then K-NN classifier will use pre identified clusters to classify digits.
Feature extraction is an important task in any classification technique. This approach extracts a binary gradient vector which will hold information about the shape of characters. Each shape image is applied with a grid of different resolutions [17] for fine grained details as well as overall shape details. Inside each cell Sobel operator is applied to get information about the gradient directions. Eight directional chaincodes are used to represent direction counts. The values resulted in each cell are aggregated over a histogram and a threshold [16] is applied to get an 8-bit gradient vector. Together all cells at different resolutions form a 392-bit binary feature vector.
This approach uses Sokal-Michener dissimilarity measure [14] to differentiate and analyze similarity between the two binary vectors.
To find the clusters some predefined threshold is decided. If the input training sample yields in dissimilarity less than this threshold then the sample is added to the cluster and center is refined, else the sample forms a new cluster center for the further training samples. Genetic algorithm is applied for finding best cluster solutions. A single point crossover is applied to fixed number of individuals and the generated offspring population is tested for fitness test. Passing candidate are taken for next iteration and mutation. This approach reduced 6000 comparisons to 701 which is very significant improvement in speed.


This section reviews few available image contouring techniques which are helpful in tracing contour points of handwritten characters for creating a font of one’s handwriting.
Marching Squares Algorithm [18] is one of the popular techniques used for image contour tracing. This is direct descendent of 3D marching cubes algorithm [19] that generates contours for a 2D scalar field. This algorithm considers a 2x2 grid for processing each cell independently. The start point of the algorithm is any point on the edge of the image under consideration and the stopping condition is satisfied when the marching square reaches where it started.
The procedure to marching squares is pretty simple. A 2x2 grid mask is applied to point on edge and cell index is calculated for particular point. For standard algorithm consideration this value varies from 1 to 15. Based on this index value the direction of the square to march is decided by looking into a prebuilt lookup table. The grid or the square is then advanced into determined direction pushing current point to the list of contour points. Similar procedure is repeated unless starting point is revisited.
In another approach A. M. Baumberg& D. C. Hogg present a contour tracking techniques using active shape model. [20] The method demonstrate a combination of shape model or the point distribution model with dynamic filtering to track a non-rigid body in motion. A training shape of fixed number of control points is aligned to reference shape to analyze the deviations. The projection of the shape in model is obtained by translation, rotation & scaling of the model frame. The curve is sampled at fixed regular intervals for convenience. At each new frame search for the sample points is made along normal for measurements. The retained observed feature is nothing but the point of maximum contrast.
The shape part of model vector is modelled as a simple discrete stochastic process. Then a tracking filter is applied for decoupling shape, alignment & translation effects in the model from previous operations. Updating state estimate of a system with discrete measurement is the work left for Kalman Filter. Then the application of alignment filter, shape filter and the global shape constraint provides a feasible contour shape.


This paper gives a brief review about the recognition systems and the contouring techniques which are the heart of our proposed editor system. Since our editor system prefers speed over accuracy the method with genetic clustering should give promising result. In accordance to the second step the marching squares algorithm provides more simplicity and speed for contouring and it’s a widely used and refined method with over average accuracy. The combo of the two should allow us two build our system as far as primary objective is of concern. Later refinements can be applied with the use of more advanced techniques.

Figures at a glance

Figure 1 Figure 2 Figure 3 Figure 4 Figure 5
Figure 1 Figure 2 Figure 3 Figure 4 Figure 5