Kavitha Balakrishnan, Kavitha Sunil, Sreedhanya A.V, K.P Soman / International Journal of     Engineering Research and App...
Kavitha Balakrishnan, Kavitha Sunil, Sreedhanya A.V, K.P Soman / International Journal of      Engineering Research and Ap...
Kavitha Balakrishnan, Kavitha Sunil, Sreedhanya A.V, K.P Soman / International Journal of     Engineering Research and App...
Kavitha Balakrishnan, Kavitha Sunil, Sreedhanya A.V, K.P Soman / International Journal of     Engineering Research and App...
Kavitha Balakrishnan, Kavitha Sunil, Sreedhanya A.V, K.P Soman / International Journal of     Engineering Research and App...
Kavitha Balakrishnan, Kavitha Sunil, Sreedhanya A.V, K.P Soman / International Journal of     Engineering Research and App...
Upcoming SlideShare
Loading in...5
×

Is2415291534

102

Published on

0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
102
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
1
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Transcript of "Is2415291534"

  1. 1. Kavitha Balakrishnan, Kavitha Sunil, Sreedhanya A.V, K.P Soman / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 2, Issue4, July-August 2012, pp.1529-1534 Effect Of Pre-Processing On Historical Sanskrit Text Documents Kavitha Balakrishnan, Kavitha Sunil, Sreedhanya A.V, K.P Soman Centre for Excellence in Computational Engineering and NetworkingABSTRACT In this paper, the effect of pre-processingon binarization is explored. Here, pre-processing PAPER DOCUMENTand binarization operations are performed on ahistorical Sanskrit text document. After scanning,pre-processing operations are applied on the image SCANNINGto remove noise. Pre-processing techniques play animportant role in binarization. Newly developedpre-processing techniques are Non Local meansand Total Variation methods. Total Variationmethods are motivated by the developments in NOISE REMOVALcompressive sensing methods like l1 optimization.Binarization is used as a pre-processor beforeOCR, because most OCR packages work only on BINARIZATIONblack and white images.Keywords - Pre-processing filters, Total variation Fig. 1 Overview of basic steps in preprocessingmethods, NL means, Binarization, OtsuBinarization Before going into the OCR process, one must scan the text document. It is important to do a good1. INTRODUCTION quality scanning since if the quality is poor then it will There are a number of factors that affect the be hard for the OCR software to read the text and toaccuracy of a text document recognized through OCR. make correct interpretation. The scanned image isScanned documents often contain noise that arises due then stored in jpeg/bmp format. In order to improveto printer, scanner, print quality, age of the document. the quality of the image we then have to go for noiseIn the case of historical documents, the quality is removal.usually very low, and the images suffer highdegradation. The degradation on the historical Noise Removaldocument images is mainly due to fading of ink, Scanning of text documents itself canscanning, paper aging and bleed-through. introduce some amount of noise. In order to make it suitable for further processing, a scanned document The importance of the preprocessing stage of image is to be freed from any existing noise. This cana character recognition system lies in its ability to be achieved by image enhancement. Imageremedy some of the problems that may occur due to enhancement mainly involves noise removal which isfactors presented above. Thus, the use of done by filtering. Filtering is a neighbourhoodpreprocessing techniques may enhance the document operation, in which the value of any given pixel in theimage and prepare it for the next stage in the character output image is determined by applying somerecognition system. algorithm to the values of the pixels in the neighbourhood of the corresponding input pixel. The paper is organized as follows. Section 2 Various methods are applied to reduce noise. Theshows the steps involved in preprocessing. Section 3 most important reason to reduce noise is to obtaindeals with noise removal techniques. It comprises of easy way of recognition of documents.conventional and new filtering methods. OtsuBinarization algorithm is discussed in Section 4. BinarizationSection 5 deals with the experimental results and in Image binarization converts a gray-scaleSection 6 we conclude the discussion. document image into a black and white (0s&1s) format. The choice of binarization algorithm depends2. STEPS INVOLVED IN PREPROCESSING on the quality of the image. Hence the binarization The steps involved in preprocessing is given algorithms that work best on one image may not bebelow Scanning and image digitization best for another. 1529 | P a g e
  2. 2. Kavitha Balakrishnan, Kavitha Sunil, Sreedhanya A.V, K.P Soman / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 2, Issue4, July-August 2012, pp.1529-15343. NOISE REMOVAL METHODS window. It is widely used because it will remove the3.1. Conventional methods noise while preserving the edges present in the image.3.1.1. Mean filter Mean filter is one of the simplest linear 3.1.3. Wiener filterfilters. It is a sliding window spatial filter, which Wiener filter is an adaptive linear filter,replaces the center pixel of the window by the average which takes local variance of the image into account.of all the values in the window. The size of the When the variance in an image is large, the Wienerwindow determines the image contrast. As we filter results in light local smoothing, while when theincrease the size of the window, the image becomes variance is small, it gives an improved localmore and more blurred. smoothing. Figure 2 shows the effect of filters on text documents.3.1.2. Median filter Mean filters smoothen the edges of the character and It is a non linear filter. It is a sliding window background. The median filter works better than thespatial filter, which replaces the center pixel of the mean filter and preserves useful details in the image.window by the median of all the values in the Wiener filter produces a fair amount of edge blurring.Fig. 2. Samples showing the effect of preprocessing filter (a) The original text image, (b) Mean filter (c)Median filter (d) Wiener filter3.2 Non Local Means contains only low frequencies. But some images The conventional filtering methods remove contain fine details and structures which have highfine details present in the image along with noise. frequencies. Filtering removes these high frequencyMost denoising algorithms make two assumptions details in addition to the high frequency noise, andabout the noisy image. The first assumption is that the these methods do nothing to remove low frequencynoise contained in the image is white noise. The noise present in the image. These assumptions cansecond assumption is the true image is smooth i.e. it 1530 | P a g e
  3. 3. Kavitha Balakrishnan, Kavitha Sunil, Sreedhanya A.V, K.P Soman / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 2, Issue4, July-August 2012, pp.1529-1534cause blurring and loss of detail in the resulting N r , s denotes the neighborhood centered over pixeldenoised images. The Non-local means assumes that the image ( x, y) and (r , s) respectively. Let the window sizecontains an extensive amount of redundancy and be MxM, where M is the odd. Similarity between theexploits these redundancies to remove the noise two neighborhoods can be found using L2-present in the image. Adjacent pixels tend to have norm: N x , y  N r , ssimilar neighborhoods, but non-adjacent pixels can 2also have similar neighborhoods’ as shown in thefigure below. The self-similarity assumption is This norm then defines a weight to be used in ourexploited to denoise an image. Pixels with similar weighted averageneighborhoods can be used to determine the denoised exp(( N x, y  N r , s ))2value of a pixel. w( N x , y , N x , y )  h2 where h is a parameter that needs to be fine-tuned. Similar neighborhoods give w  1 . If the two neighborhoods are very different, w  0 . Then each pixel in our new image g ( x, y) is a weighted average of the pixels in f ( x, y ) , weighted by how similar the neighborhoods areFig. 3. Example for self-similarity is shown. Non  f  r, s  .w  N , N  adjacent pixels p, q and r have similar neighborhood in the image. x, y r ,sThe non-local means replaces a pixel by the weighted g ( x, y )  r saverage of other neighborhoods in the image. Thismethod is the best possible denoising method for  w  N , N  r s x, y r ,snatural images. First we make a list of all similar When historical document image with noise isneighborhoods in the image. Neighborhood of each subjected to NL means algorithm, we get result aspixel is then linearized to form a row in a matrix and shown in figure. Smaller neighborhoods remove noiseL2 norm is computed between each row. Let N x , y and better.Fig. 4. Effect of NL means algorithm is shown (a) original image, (b) image denoised using NL meanswith window size=3.3.3 Total Variation statistical properties as the original image, along with3.3.1 Tikhnov model sharp edges and low noise. The Total Variation approach is used when Finding the denoised text image can becharacters in the text document are highly degraded. mathematically described as an optimization problem:TV Denoising reduces total variation of the image. It u*  maxu { p(u / f )}filters out noise while preserving the edges. Theresulting filtered image should have the same 1531 | P a g e
  4. 4. Kavitha Balakrishnan, Kavitha Sunil, Sreedhanya A.V, K.P Soman / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 2, Issue4, July-August 2012, pp.1529-1534where p(u / f ) is the posterior probability of a 1 1 min E (u )   u( x, y) d   2   f  u  d  2 2hypothesis u (describing our best solution) might be u 2true given by the observation f.The conditional probability p(u / f ) can be written This is Tikhonov model. The first term is the regularization term which is derived from prior andas the second term as the data fidelity term. The data p( f / u ) p(u ) p(u / f )  fidelity measures how far the current solution u is p( f ) from the observed image f. The parameter λ is a non- where p(u) is the prior probability of u and negative coefficient that governs the balance between the data fidelity and the regularization term. A largep( f u ) is the conditional describing how well the value for λ will produce an image with few details,observed data f can be explained by the solution u. removing small features, while a small value willThe probability of the low noise image with respect to yield an image same as u. In Tikhnov model, since wethe image f (that is defining our inverse problem): use image prior as a set of smooth images, we obtain blurred images as output. 2 2  ( f ( x , y )  u ( x , y )) u ( x , y )  p ( f , u ) p (u ) 1p (u / f )    2 2 2 2 e 3.3.2 ROF Model p( f ) ( x , y )D 4  The ROF model is similar to the Tikhonov model but the regularization term has been changed to the TV norm instead of the quadratic norm. In its Maximizing this probability is equivalent to original formulation, the ROF model is defined as theminimizing the negative term in the exponent on the constrained optimization problemset of pixels D, that is the overall integral of ( f ( x, y)  u ( x, y))2 u ( x, y )  2 min u    u d  s.t  (u  f )2 d    2  2 2 2 2 where f is the observed image function whichThis leads us to the following variational formulation is assumed to be corrupted by Gaussian noise of variance  and u is the unknown denoised image. 2of our image restoration problem Fig. 5. Result of denoising using Tikhnov model (a) The original image, (b) TV using λ=1. 1532 | P a g e
  5. 5. Kavitha Balakrishnan, Kavitha Sunil, Sreedhanya A.V, K.P Soman / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 2, Issue4, July-August 2012, pp.1529-1534Figure 6. Result of denoising using ROF model (a) The original image, (b) TV using λ=3, (c) TV usingλ=5. The original non-convex ROF model can be the threshold value, then it is classified as black.turned into a convex problem by replacing the Binarization techniques can be either global or local.equality constraint In global binarization we choose a single threshold for 4.1 Otsu Binarization Algorithm (u  f )2 d    2 by the inequality constraint Otsu is a global thresholding binarization  algorithm .It assumes that the image contains two (u  f )2 d    2 classes of pixels; one foreground (black) and one  background (white). Then it calculates the optimumwhich in turn can further be transformed to the threshold separating those two classes so that theirunconstrained (or Lagrangian) model intra-class variance is minimal. This is equivalent to maximizing the between-class scatter. This establishes  1  an optimum threshold K.min   u d    (u  f ) d . 2 1, if I gray ( x, y)  K u   2   I ( x, y )   0, if I gray ( x, y )  K where  is a Lagrange multiplier. 5. RESULTS4. BINARIZATION The text image is first filtered by each of the Image binarization converts a gray-scale noise removal algorithms described in Section 3. Thendocument image into a black and white (0s&1s) each filter output along with the unfiltered originalformat. In binarization, we choose a threshold value to was then binarized by using Otsu binarizationclassify the pixels as black and white. If the pixel algorithm. Two methods are used to do the evaluationvalue is greater than the threshold value, then it is measures – MSE and PSNR.classified as white and if the pixel value is less thanthe whole document image, but these techniques arenot suitable for degraded images. In local binarizationtechnique, the local threshold can be calculated byusing different information of the document images,such as the mean and standard variation of pixelvalues within a local window. (b) median, (c) wiener, (d) Tikhnov, (e) TV ROFFigure 7. Result of binarization using Otsu using λ=3, (f) TV ROF using λ=5algorithm on denoised image using (a) mean filter, 1533 | P a g e
  6. 6. Kavitha Balakrishnan, Kavitha Sunil, Sreedhanya A.V, K.P Soman / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 2, Issue4, July-August 2012, pp.1529-1534 Mean Square Error (MSE) for two m  nimages I and K is given by, M I is the maximum possible pixel value of the 1 m1 n1 MSE  [ I (i, j)  K (i, j)]2 mn i 0 j 0 image. These measures were calculated for every image-filter combination. The score obtained usingwhere one of the images is considered a noisy preprocessing algorithms are shown in Tables 1. Theapproximation of the other . image binarized using Otsu algorithms are measured Peak Signal-To-Noise Ratio (PSNR) is and the scores got are shown in Table 2.generally used to analyze quality of image in dB(decibels). PSNR calculation of two images, one In most cases the best pre-processing filteroriginal and an altered image, describes how far two was NL means. Next best results are shown by Totalimages are equal. Variation filter with λ=3. For the conventional filters  M2  mean, median and Wiener filter, Wiener gives best PSNR  10log10  I  results.  MSE   MI   20log10    MSE Table 1. Performance measure of various preprocessing algorithm Mean Median Wiener Tikhonov ROF λ=5 ROF λ=3 NLmeansMSE 702.1072 713.0556 50.9573 338.8237 22.8120 13.4386 2.7225PSNR 19.6668 19.5996 31.0587 22.8311 34.5492 36.8473 43.76Table 2. Performance measure after Otsu binarization Median Wiener Tikhonov ROF λ=5 ROF λ=3 NLmeansMSE 4476.7 3557.5 325.4874 1923.7 169.1009 111.8863 84.2275PSNR 11.6212 12.6194 23.0055 15.2895 25.8493 27.6430 28.9978 International Conference on Computer6. CONCLUSION Vision and Pattern Recognition, 2005.This paper presents a system that enhances the [5] W. Evans. Image denoising with the non-readability of an old Sanskrit document, through local meanseffective preprocessing methods for binarization. The algorithm.Available:http://www.cs.wisc.edu .pre-processing techniques have been successfully [6] Chambolle, A. and Lions, “Image recoverytested on a degraded document. Experiments show via total variation minimization and relatedbest results for the NL means algorithm, thereby problems”, Numer. Math., 76:167-188(1997)showing good binarization performance. So the [7] Chan, T., Golub, and Mulet, P. (1999), “Aproposed methods can be used for preprocessing of nonlinear primal-dual method for totalhistorical machine-printed documents. variation-based image restoration”, SIAM J. Sci. Comp., 20(6):1964-1977.7. REFERENCES [8] Rudin, L., Osher, S., and Fatemi, “Nonlinear [1] Laurence Likforman-Sulem, Jérôme Darbon total variation based noise removal Elisa H. Barney Smith, “Enhancement of algorithms”. Physica D, 60:259-268. 1992. Historical Printed Document Images by Combining Total Variation Regularization and Non-Local Means Filtering”, Image and Vision Computing (2011). Vol. 29, Nr. 5, p. 351-363. [2] Elisa H. Barney Smith, Laurence Likforman- Sulem, Jérôme Darbon, “Effect of Pre- Processing on Binarization”, Conference: Document Recognition and Retrieval - DRR , pp. 1-10, 2010 [3] A. Buades, B. Coll, and J Morel. “On Image denoising Methods”, Technical Report 2004-15, CMLA, 2004. [4] A. Buades, B. Coll, and J Morel., “A non- local algorithm for image denoising”, IEEE 1534 | P a g e

×