Document Image Restoration Using Binary Morphological Filters. Jisheng Liang, Robert M. Haralick. Seattle, Washington Ihsin T.
|
|
- Madison Tyler
- 5 years ago
- Views:
Transcription
1 Document Image Restoration Using Binary Morphological Filters Jisheng Liang, Robert M. Haralick University of Washington, Department of Electrical Engineering Seattle, Washington Ihsin T. Phillips Seattle University, Department of Computer Science Seattle, Washington ABSTRACT This paper discusses a method for binary morphological lter design to restore document images degraded by subtractive or additive noise, given a constraint on the size of lters. With a lter size restriction (for example 3 3), each pixel in output image depends only on its ( 3 3 ) neighborhood of input image. Therefore, we can construct a look-up table between input and output. Each output image pixel is determined by this table. So the lter design becomes the search for the optimal look-up table. By considering the degradation condition of the input image, we provide a methodology for knowledge based look-up table design, to achieve computational tractability. The methodology can be applied iteratively so that the nal output image is the input image after being transformed through successive 3 3 operations. An experimental protocol is developed for restoring degraded document images, and improving the corresponding recognition accuracy rates of an OCR algorithm. We present results for a set of real images which are manually ground-truthed. The performance of each lter is evaluated by the OCR accuracy. Keyword: Document image restoration, morphology ltering, OCR, look-up table. 1 INTRODUCTION During the document image generation processes, such as scanning and digitization, the images are usually corrupted by subtractive as well as additive noise. We wish to design a lter to restore a class of document images with similar structural features and degradation conditions using morphological operations. Earlier work on image restoration can be categorically divided into two groups. The linear lters are based on the assumption of linear, space invariant degradations. The restoration techniques can be carried out in the frequency domain by means of a 2-D FFT algorithm. The linear lter is easy to design and analyze. The classical Wiener ltering provides a mathematically simple and computationally ecient optimization process. But document images often have sharp edges, binary structures and a limited number of bits per pixel. The restriction
2 that the estimation rule be a linear combination of observed values is typically unsuitable. 2 Mathematical formalisms for practical design of nonlinear optimal lters are not generally available. Optimal nonlinear lters are often found by computationally intensive search procedures. To mitigate the search problem, Loce 2 has employed various optimization constraints, such as a window constraint and library constraint. In this paper we discuss a method for binary morphological lter design to restore document images degraded by subtractive or additive noise, given the constraint on the size of lters. With the lter size restriction (for example 3 3), each pixel in output image depends only on its ( 3 3 ) neighborhood of input image. Therefore, we can construct a look-up table between input and output. Each output image pixel is determined by this table. So the lter design becomes the search for the optimal look-up table. By considering the degradation condition of input image, we provide a methodology for knowledge based look-up table design, to achieve computational tractability. The earlier restoration techniques are oriented toward modeling the degradation and applying the inverse process in order to recover the original image. This approach usually involves formulating a criterion of goodness that will yield some optimal estimate of the desired result. 1 The main problem is the validation of degradation model. 2 PROBLEM STATEMENT Let I denote the input real image, and R denote output restored image. Any morphological ltering can be expressed as a mapping from I to R: R = F (I): Our objective is to search for an optimal lter F to restore the degraded input image and improve the corresponding recognition accuracy rate of OCR algorithm. The lter is constrained to a 3 3 size. 3 FILTER DESIGN ALGORITHM With the 3 3 size restriction, each pixel k in output image depends only on its 3 3 neighborhood of input image, see Figure 1: 3 x 3 1 or 0 Input Image I Output Image R Figure 1: Mapping between input and output images k = f(k1; k2; k3; k; k5; k6; k7; k8; k9): k1; ; k9 are elements in 3 3 neighborhood, shown in Table 1. We call each possible 3 3 neighborhood as a pattern. Each input pattern is associated with a binary 1 or 0
3 k1 k2 k3 k k5 k6 k7 k8 k9 Table 1: 3 3 pattern on the output. Therefore, we can construct a look-up table between input and output, see Table 2. k1; k2; k3; k; k5; k6; k7; k8; k9 k ; ; 1 0; 1 0; ; 1 Table 2: Illustrates the look-up table between input and output Each output image pixel is determined by this look-up table. So, the lter design becomes the search for an optimal look-up table. However, there are 2 9 = 512 dierent patterns and possible tables. Of course, searching through all the possible combinations is computationally burdensome. 3.1 Generation of Knowledge-Based Table We have developed a methodology to generate a knowledge-based table, by considering the degradation types of input image. We partition the 512 possible input patterns into L dierent subsets, by considering the numbers of -connected components in each pattern. -connected means only the north, south, east, and west neighbors of a pixel are considered connected to it. All patterns in a subset should produce the same output. If we have some knowledge of the degradation process and the nature of the ideal input image, we can determine m subsets which must produce binary-1 outputs, and determine n subsets which must produce binary-0 outputs, by considering contribution of each subset to restoration. Therefore, there are L? m? n remaining subsets which need to be determined whether it is better for the output to be a binary-1 or binary-0. We will search through all the possible combinations and choose the optimal one. The size of search then decreases from 2 L to 2 L?m?n Table Generation for Subtractive Noise We assume that noise process is one that creates holes in the image. So whether a 3 3 pattern produces output 1 or 0 depends on its contribution to hole lling. For subtractive noise, all 3 3 patterns whose central pixel is 1 should produce binary-1 outputs. Filters with this property are called foreground preservers. Then, we partition all remaining possible patterns into 50 subsets, by the number of -connected components in each pattern. We determine some subsets which must produce binary-1 outputs, by considering their contribution to the hole lling process. These subsets are called hole llers. All the hole llers are listed in Figure 2 and Figure 3. In order to prevent over lling, some subsets must produce binary-0 outputs to preserve the background. A list of background preservers is shown in Figure. The remaining subsets, which we do not know whether they should produce binary-1 or binary-0, are listed in
4 Figure 5. Hole Fillers 8 1 Component Components Figure 2: Subsets of 3 3 patterns which are hole llers. The number below each 3 3 pattern represents the number of rotations of each pattern Components Components Components Figure 3: Subsets of 3 3 patterns which are hole llers. The generated knowledge-based table for subtractive noise corrupted images is shown in Table 3. For the remaining subsets, we must check to see whether it is better for the outputs to be a binary-1 or binary-0. We will search through all the possible combinations and choose the optimal one. But the size of search (2 15 ) may be still too large. For subsets which have similar contribution to hole lling, they can be combined to one set. Suppose there are N sets, we search through 2 N combinations. The remaining subsets which are combined to 6 sets are shown in Figure 6. Now, the size of search decreases to 2 6 = 6. In practice, one can employ a dierent partition based on the knowledge of degradation process.
5 Foreground Preservers Background Preservers Component 2 Components Figure : Illustrates the subsets of 3 3 patterns which are foreground and background preservers, for subtractive noise corrupted image. Remaining Subsets 8 1 Component Components 3 Components 8 Figure 5: Illustrates the remaining subsets for subtractive noise corrupted image Table Generation for Additive Noise With additive noise, all the points of the ideal image belong to the noisy image. We wish to clean the additive points. To do this, we rst determine all the patterns whose central pixel is 0 should produce binary-0 outputs. Filters with this property are called background preservers. Then, we partition all the remaining possible patterns into a number of dierent subsets. Since the noise process is one that creates additive points, we determine some subsets which can be used to remove these points. These subsets must produce binary-0 outputs, see Figure 7. During the noise removing process, in order to preserve the structural shape of ideal character, we determine a list of foreground preservers which must produce binary-1 outputs, see Figure 7. The remaining subsets which are combined to 7 sets are shown in Figure 8. We will search through all the combinations of these 7 sets. The size of search is 2 7 = 128. Again, in practice, one can employ a dierent partition based on the knowledge of degradation process. The generated knowledge-based table for additive noise corrupted image is shown in Table.
6 Set 1 Set 2 Set 3 Set Set 5 Set 6 Figure 6: Illustrates a list of remaining subsets which are combined to 6 sets. Subsets Output pixel Central pixel is 1 1 Hole llers 1 Background preservers 0 Remaining subsets 0 or 1 Table 3: Look-up table for subtractive noise corrupted images EXPERIMENTAL PROTOCOL We select some real document images as the input images. They have dierent degradation types and degradation conditions. The zone-based ground truth les for input images are generated, following the protocol used in UW English Document Image Database I. We draw the bounding box for each text zone and extract the box coordinates. We now have a list of identiers for the zones and the corresponding bounding box coordinates. The generated ground truth le can be considered as the ideal stage for restoring input images and testing. Subsets Output pixel Central pixel is 0 0 Noise removers 0 Foreground preservers 1 Remaining subsets 0 or 1 Table : Look-up table for additive noise corrupted images
7 Foreground Preservers 2 Additive Noise Removers 1 8 Figure 7: Illustrates the foreground preservers and noise removers for additive noise corrupted image. The following are the procedures for lter design: Find the degradation type of input image. Generate knowledge-based look-up tables, using the algorithm discussed in Section 3. For each possible table, there is one output image. Run the OCR algorithm on each of output images. Evaluate each look-up table by comparing OCR outputs with ground truth of input image, using OPE (OCR Performance Evaluation) software. A new lter can be designed to work on the output of the previous ltered image. The experiment ow chart is shown in Figure 9..1 Testing We use Caereocr OCR Version 109a, from Caere Systems, and specify the coordinates of the zones to be recognized. Script les to run the OCR algorithm on each of the zones in image are generated and executed. OPE Software 6 is provided by UWEDID-I. It compares the OCR outputs and the corresponding groundtruth information, generating symbol statistics, such as the number of matches, changes, insertions, and deletions, as well as line statistics. In addition, it optionally generates a contingency table which tells how each character is interpreted by the OCR algorithm. We use symbol match accuracy as the primary index in lter testing. Let G(I) and O(R) denote the ground truth of input image and output of OCR algorithm over restored image respectively. Let M(G(I); O(R)) represent the symbol match accuracy between G(I) and O(R). Therefore, our testing criterion is: maxfm(g(i); O(R)g:
8 8 Set 1 Set 2 Set Set Set 5 8 Set 6 Set Figure 8: Illustrates the remaining subsets for additive noise corrupted image. They are combined to 7 sets. 5 EXPERIMENTAL RESULTS We choose 15 real images with dierent degradation types and conditions to verify our algorithm. The degradation type for each input image has been dened. When either subtractive or additive noise alone is present, the appropriate lters can be used respectively. A new lter can be designed to work on the output of the previous ltered image. For example, four levels of recursive ltering are performed on image 1 in our experiment. If the input has mixed noise, alternating sequential lters can be used. For example, iterated additive noise lter and subtractive noise lter are performed on image 6. During each ltering level, we search through all the possible look-up tables ( 6 for subtractive noise, and 128 for additive noise, see Section 3 ). For each table, there is one output image and corresponding symbol match accuracy of OCR algorithm. The optimal look-up table is determined from 6 (7) input subsets for subtractive (additive) noise. For each input image, the output pixel value (binary 1 or 0) of each input subset is listed in a table. The following are the experimental results for the 15 input images with dierent dominant noise types. 1. Image 1 subtractive noise. 2. Image 2 subtractive noise ,,6 2, ,3,, ,,6 1, ,,6 1,
9 INPUT IMAGE Restored FILTER Image GROUND TRUTH OCR Text OPE Text Symbol Match Accuracy Figure 9: Experiment ow chart 3. Image 3 additive noise.. Image additive noise. 5. Image 5 additive noise. 6. Image 6 mixed noise ,2,,6 3, ,2,3,,5, ,,5,7 2,3, ,5 1,3,,6, ,,6 1,3,5, Two levels of recursive ltering are performed on image 6 in our experiment. The rst one is used to remove the additive noise. The second one is used to clean the subtractive noise. This method is comparable to morphological opening and closing ltering. The optimal lters are listed in following table ,3,7 1,,5, ,3,5 2,,6 73.6
10 7. Image 7 subtractive noise. 8. Image 8 additive noise. 9. Image 9 additive noise. 10. Image 10 subtractive noise. 11. Image 11 subtractive noise. 12. Image 12 subtractive noise. 13. Image 13 mixed noise ,3,,5, ,2,,5, ,,7 1,3,5, ,,5,6,7 1, ,3,,5 1, ,5,6 1,2, ,2,3,5, ,3,,5 1, Two levels of recursive ltering are performed on image 13 in our experiment. The rst one is used to remove the additive noise. The second one is used to clean the subtractive noise. 1. Image 1 additive noise ,2,3,,5, ,3,,5 1, ,2,,6 3,5,
11 15. Image 15 additive noise ,2,3,5,6, ,3,5,6, We have worked on the individual images, and found the optimal image specic lter which produces the highest OCR accuracy. Of course, in real applications, it is not realistic to search for the best lter for each image. We want to nd the optimal lter for a set of images with similar properties. Therefore, we divided the images into two sets, one with subtractive noise, another with additive noise. The OCR accuracy from lters for subtractive noise and lters for additive noise were computed. The average OCR accuracy ( only for the rst ltering level ) were computed for the additive and subtractive cases. The lter which produces the highest average accuracy for each set of images was chosen as the global lter (Table 5). For each image, the accuracy from the global lter, is given in the Table 6 and Table 7. the accuracy from the image specic lter, and the accuracy from the global lter, are given in the Table 6 and Table 7. Image Type Sets with Sets with output 1 output 0 Subtractive Noise 1,2,3,,6 5 Additive Noise 1 2,3,,5,6,7 Table 5: Global Filters for Subtractive Noise Images and Additive Noise Images Image Number After ltering Table 6: OCR Accuracy for Subtractive Noise Image Image Number After Filtering Table 7: OCR Accuracy for Additive Noise Image Let x i be the OCR accuracy obtained after employing the best image specic lter on image i. Let ^x i be the OCR accuracy obtained after employing the best global lter on image i. The mean accuracy loss (MAL) can be calculated as: M AL = 1 n P n i=1 (x i? ^x i ) The mean accuracy loss for employing the global subtractive noise lter rather than the best image specic lter was 0:76%. The mean accuracy loss for employing the global additive noise lter rather than the best image specic lter was 0:62%. This shows that the global lter works well for each individual image. 6 DISCUSSION An algorithm for binary morphological lter design has been given to restore document images degraded by subtractive or additive noise, given design constraints on the size of lters. We provided a methodology for
12 knowledge based look-up table design, to achieve computational tractability. An experimental protocol has been developed for restoring degraded document image, and improving the corresponding recognition accuracy rates of OCR algorithm. Our future work will include the investigation of the eect on ideal characters when each kind of pattern is applied and the eect of constraint on lter properties. Also, we try to develop a classier to classify the input images into dierent subsets and decide the appropriate lter to each subset. 7 REFERENCES [1] R.C. Gonzalez and R.E. Woods, Digital Imaging Processing, Addison Wesley, [2] R.P. Loce, \Morphological Filter Mean-Absolute-Error Representation Theorems and Their Application to Optimal Morphological Filter Design" Ph.D Thesis, Rochester Inst. of Tech, 199. [3] I.R. Joughin, R.M. Haralick, and E.R. Dougherty, \Model-based Algorithm for Designing Suboptimal Morphological Filters for Restoring Subtractive-noise-corrupted Images", Journal of Electronic Imaging, vol.2, no., pp , Oct [] S. Chen, S. Subramaniam, I.T. Phillips, and R.M. Haralick, \Performance Evaluation of Two OCR Systems", Third Annual Symposium on Document Analysis and Information Retrieval, pp , April 199. [5] \Reference Manual for UW English Document Image database", ISL report,e.e. Dept.,U. of Washington. [6] Su Chen, \OCR Performance Evaluation Software User's Manual", ISL Report,E.E. Dept.,U. of Washington.
UW Document Image Databases. Document Analysis Module. Ground-Truthed Information DAFS. Generated Information DAFS. Performance Evaluation
Performance evaluation of document layout analysis algorithms on the UW data set Jisheng Liang, Ihsin T. Phillips y, and Robert M. Haralick Department of Electrical Engineering, University of Washington,
More informationTwo Image-Template Operations for Binary Image Processing. Hongchi Shi. Department of Computer Engineering and Computer Science
Two Image-Template Operations for Binary Image Processing Hongchi Shi Department of Computer Engineering and Computer Science Engineering Building West, Room 331 University of Missouri - Columbia Columbia,
More informationOCR For Handwritten Marathi Script
International Journal of Scientific & Engineering Research Volume 3, Issue 8, August-2012 1 OCR For Handwritten Marathi Script Mrs.Vinaya. S. Tapkir 1, Mrs.Sushma.D.Shelke 2 1 Maharashtra Academy Of Engineering,
More informationCS 223B Computer Vision Problem Set 3
CS 223B Computer Vision Problem Set 3 Due: Feb. 22 nd, 2011 1 Probabilistic Recursion for Tracking In this problem you will derive a method for tracking a point of interest through a sequence of images.
More informationSkeletonization Algorithm for Numeral Patterns
International Journal of Signal Processing, Image Processing and Pattern Recognition 63 Skeletonization Algorithm for Numeral Patterns Gupta Rakesh and Kaur Rajpreet Department. of CSE, SDDIET Barwala,
More informationA Study on the Document Zone Content Classification Problem
A Study on the Document Zone Content Classification Problem Yalin Wang 1, Ihsin T. Phillips 2, and Robert M. Haralick 3 1 Dept. of Elect. Eng. Univ. of Washington Seattle, WA 98195, US ylwang@u.washington.edu
More informationIdentifying Layout Classes for Mathematical Symbols Using Layout Context
Rochester Institute of Technology RIT Scholar Works Articles 2009 Identifying Layout Classes for Mathematical Symbols Using Layout Context Ling Ouyang Rochester Institute of Technology Richard Zanibbi
More informationNew method for edge detection and de noising via fuzzy cellular automata
International Journal of Physical Sciences Vol. 6(13), pp. 3175-3180, 4 July, 2011 Available online at http://www.academicjournals.org/ijps DOI: 10.5897/IJPS11.047 ISSN 1992-1950 2011 Academic Journals
More informationGroundtruth Image Generation from Electronic Text (Demonstration)
Groundtruth Image Generation from Electronic Text (Demonstration) David Doermann and Gang Zi Laboratory for Language and Media Processing, University of Maryland, College Park MD 21043, USA {doermann,
More informationNetwork. Department of Statistics. University of California, Berkeley. January, Abstract
Parallelizing CART Using a Workstation Network Phil Spector Leo Breiman Department of Statistics University of California, Berkeley January, 1995 Abstract The CART (Classication and Regression Trees) program,
More informationMORPHOLOGICAL BOUNDARY BASED SHAPE REPRESENTATION SCHEMES ON MOMENT INVARIANTS FOR CLASSIFICATION OF TEXTURES
International Journal of Computer Science and Communication Vol. 3, No. 1, January-June 2012, pp. 125-130 MORPHOLOGICAL BOUNDARY BASED SHAPE REPRESENTATION SCHEMES ON MOMENT INVARIANTS FOR CLASSIFICATION
More informationEE 584 MACHINE VISION
EE 584 MACHINE VISION Binary Images Analysis Geometrical & Topological Properties Connectedness Binary Algorithms Morphology Binary Images Binary (two-valued; black/white) images gives better efficiency
More informationProcessing of binary images
Binary Image Processing Tuesday, 14/02/2017 ntonis rgyros e-mail: argyros@csd.uoc.gr 1 Today From gray level to binary images Processing of binary images Mathematical morphology 2 Computer Vision, Spring
More informationImage Enhancement Using Fuzzy Morphology
Image Enhancement Using Fuzzy Morphology Dillip Ranjan Nayak, Assistant Professor, Department of CSE, GCEK Bhwanipatna, Odissa, India Ashutosh Bhoi, Lecturer, Department of CSE, GCEK Bhawanipatna, Odissa,
More informationADVANCED IMAGE PROCESSING METHODS FOR ULTRASONIC NDE RESEARCH C. H. Chen, University of Massachusetts Dartmouth, N.
ADVANCED IMAGE PROCESSING METHODS FOR ULTRASONIC NDE RESEARCH C. H. Chen, University of Massachusetts Dartmouth, N. Dartmouth, MA USA Abstract: The significant progress in ultrasonic NDE systems has now
More informationCOMPUTER AND ROBOT VISION
VOLUME COMPUTER AND ROBOT VISION Robert M. Haralick University of Washington Linda G. Shapiro University of Washington A^ ADDISON-WESLEY PUBLISHING COMPANY Reading, Massachusetts Menlo Park, California
More informationCS 231A Computer Vision (Fall 2012) Problem Set 3
CS 231A Computer Vision (Fall 2012) Problem Set 3 Due: Nov. 13 th, 2012 (2:15pm) 1 Probabilistic Recursion for Tracking (20 points) In this problem you will derive a method for tracking a point of interest
More informationProgress in Image Analysis and Processing III, pp , World Scientic, Singapore, AUTOMATIC INTERPRETATION OF FLOOR PLANS USING
Progress in Image Analysis and Processing III, pp. 233-240, World Scientic, Singapore, 1994. 1 AUTOMATIC INTERPRETATION OF FLOOR PLANS USING SPATIAL INDEXING HANAN SAMET AYA SOFFER Computer Science Department
More informationSYDE 575: Introduction to Image Processing
SYDE 575: Introduction to Image Processing Image Enhancement and Restoration in Spatial Domain Chapter 3 Spatial Filtering Recall 2D discrete convolution g[m, n] = f [ m, n] h[ m, n] = f [i, j ] h[ m i,
More informationRecognition. Clark F. Olson. Cornell University. work on separate feature sets can be performed in
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 907-912, 1996. Connectionist Networks for Feature Indexing and Object Recognition Clark F. Olson Department of Computer
More informationPrewitt. Gradient. Image. Op. Merging of Small Regions. Curve Approximation. and
A RULE-BASED SYSTEM FOR REGION SEGMENTATION IMPROVEMENT IN STEREOVISION M. Buvry, E. Zagrouba and C. J. Krey ENSEEIHT - IRIT - UA 1399 CNRS Vision par Calculateur A. Bruel 2 Rue Camichel, 31071 Toulouse
More informationPower Functions and Their Use In Selecting Distance Functions for. Document Degradation Model Validation. 600 Mountain Avenue, Room 2C-322
Power Functions and Their Use In Selecting Distance Functions for Document Degradation Model Validation Tapas Kanungo y ; Robert M. Haralick y and Henry S. Baird z y Department of Electrical Engineering,
More informationMorphological Image Processing
Morphological Image Processing Binary image processing In binary images, we conventionally take background as black (0) and foreground objects as white (1 or 255) Morphology Figure 4.1 objects on a conveyor
More informationZONE CONTENT CLASSIFICATION AND ITS PERFORMANCE EVALUATION
ZONE CONTENT CLASSIFICATION AND ITS PERFORMANCE EVALUATION Yalin Wangt Robert Haralickt Ihsin T. Phillips$ t Department of Electrical Engineering University of Washington Seattle, WA 98 195 U.S.A. Department
More informationAN ALGORITHM USING WALSH TRANSFORMATION FOR COMPRESSING TYPESET DOCUMENTS Attila Fazekas and András Hajdu
AN ALGORITHM USING WALSH TRANSFORMATION FOR COMPRESSING TYPESET DOCUMENTS Attila Fazekas and András Hajdu fattila@math.klte.hu hajdua@math.klte.hu Lajos Kossuth University 4010, Debrecen PO Box 12, Hungary
More informationClassifier C-Net. 2D Projected Images of 3D Objects. 2D Projected Images of 3D Objects. Model I. Model II
Advances in Neural Information Processing Systems 7. (99) The MIT Press, Cambridge, MA. pp.949-96 Unsupervised Classication of 3D Objects from D Views Satoshi Suzuki Hiroshi Ando ATR Human Information
More informationExperiments with Edge Detection using One-dimensional Surface Fitting
Experiments with Edge Detection using One-dimensional Surface Fitting Gabor Terei, Jorge Luis Nunes e Silva Brito The Ohio State University, Department of Geodetic Science and Surveying 1958 Neil Avenue,
More informationDavid James Swain. Thesis submitted to the faculty ofthe. Virginia Polytechnic Institute and State University
Enhancing and Reconstructing Digitized Handwriting. by David James Swain Thesis submitted to the faculty ofthe Virginia Polytechnic Institute and State University in partial fulllment of the requirements
More informationRefine boundary at resolution r. r+1 r. Update context information CI(r) based on CI(r-1) Classify at resolution r, based on CI(r), update CI(r)
Context Based Multiscale Classication of Images Jia Li Robert M. Gray EE Department EE Department Stanford Univ., CA 94305 Stanford Univ., CA 94305 jiali@isl.stanford.edu rmgray@stanford.edu Abstract This
More informationEDGE BASED REGION GROWING
EDGE BASED REGION GROWING Rupinder Singh, Jarnail Singh Preetkamal Sharma, Sudhir Sharma Abstract Image segmentation is a decomposition of scene into its components. It is a key step in image analysis.
More informationA New Algorithm for Detecting Text Line in Handwritten Documents
A New Algorithm for Detecting Text Line in Handwritten Documents Yi Li 1, Yefeng Zheng 2, David Doermann 1, and Stefan Jaeger 1 1 Laboratory for Language and Media Processing Institute for Advanced Computer
More informationPartition definition. Partition coding. Texture coding
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 5, NO. 6, JUNE 1996 881 Morphological Operators for Image and Video Compression Philippe Salembier, Patrick Brigger, Josep R. Casas and Montse Pardas Abstract
More informationAn Evaluation of Information Retrieval Accuracy. with Simulated OCR Output. K. Taghva z, and J. Borsack z. University of Massachusetts, Amherst
An Evaluation of Information Retrieval Accuracy with Simulated OCR Output W.B. Croft y, S.M. Harding y, K. Taghva z, and J. Borsack z y Computer Science Department University of Massachusetts, Amherst
More informationBMVC 1996 doi: /c.10.41
On the use of the 1D Boolean model for the description of binary textures M Petrou, M Arrigo and J A Vons Dept. of Electronic and Electrical Engineering, University of Surrey, Guildford GU2 5XH, United
More informationCS 5540 Spring 2013 Assignment 3, v1.0 Due: Apr. 24th 11:59PM
1 Introduction In this programming project, we are going to do a simple image segmentation task. Given a grayscale image with a bright object against a dark background and we are going to do a binary decision
More informationFast Distance Transform Computation using Dual Scan Line Propagation
Fast Distance Transform Computation using Dual Scan Line Propagation Fatih Porikli Tekin Kocak Mitsubishi Electric Research Laboratories, Cambridge, USA ABSTRACT We present two fast algorithms that approximate
More informationDigital Image Processing
Digital Image Processing Third Edition Rafael C. Gonzalez University of Tennessee Richard E. Woods MedData Interactive PEARSON Prentice Hall Pearson Education International Contents Preface xv Acknowledgments
More informationComputer and Machine Vision
Computer and Machine Vision Lecture Week 10 Part-2 Skeletal Models and Face Detection March 21, 2014 Sam Siewert Outline of Week 10 Lab #4 Overview Lab #5 and #6 Extended Lab Overview SIFT and SURF High
More informationHCR Using K-Means Clustering Algorithm
HCR Using K-Means Clustering Algorithm Meha Mathur 1, Anil Saroliya 2 Amity School of Engineering & Technology Amity University Rajasthan, India Abstract: Hindi is a national language of India, there are
More informationMingle Face Detection using Adaptive Thresholding and Hybrid Median Filter
Mingle Face Detection using Adaptive Thresholding and Hybrid Median Filter Amandeep Kaur Department of Computer Science and Engg Guru Nanak Dev University Amritsar, India-143005 ABSTRACT Face detection
More informationA Quantitative Approach for Textural Image Segmentation with Median Filter
International Journal of Advancements in Research & Technology, Volume 2, Issue 4, April-2013 1 179 A Quantitative Approach for Textural Image Segmentation with Median Filter Dr. D. Pugazhenthi 1, Priya
More informationDOCUMENT IMAGE ZONE CLASSIFICATION A Simple High-Performance Approach
DOCUMENT IMAGE ZONE CLASSIFICATION A Simple High-Performance Approach Daniel Keysers, Faisal Shafait German Research Center for Artificial Intelligence (DFKI) GmbH, Kaiserslautern, Germany {daniel.keysers,
More informationFOR EFFICIENT IMAGE PROCESSING. Hong Tang, Bingbing Zhou, Iain Macleod, Richard Brent and Wei Sun
A CLASS OF PARALLEL ITERATIVE -TYPE ALGORITHMS FOR EFFICIENT IMAGE PROCESSING Hong Tang, Bingbing Zhou, Iain Macleod, Richard Brent and Wei Sun Computer Sciences Laboratory Research School of Information
More informationSegmentation of Isolated and Touching characters in Handwritten Gurumukhi Word using Clustering approach
Segmentation of Isolated and Touching characters in Handwritten Gurumukhi Word using Clustering approach Akashdeep Kaur Dr.Shaveta Rani Dr. Paramjeet Singh M.Tech Student (Associate Professor) (Associate
More informationRECOGNIZING TYPESET DOCUMENTS USING WALSH TRANSFORMATION. Attila Fazekas and András Hajdu University of Debrecen 4010, Debrecen PO Box 12, Hungary
RECOGNIZING TYPESET DOCUMENTS USING WALSH TRANSFORMATION Attila Fazekas and András Hajdu University of Debrecen 4010, Debrecen PO Box 12, Hungary Abstract. In this paper we present an effective character
More informationMotion Detection Algorithm
Volume 1, No. 12, February 2013 ISSN 2278-1080 The International Journal of Computer Science & Applications (TIJCSA) RESEARCH PAPER Available Online at http://www.journalofcomputerscience.com/ Motion Detection
More informationA Vertex Chain Code Approach for Image Recognition
A Vertex Chain Code Approach for Image Recognition Abdel-Badeeh M. Salem, Adel A. Sewisy, Usama A. Elyan Faculty of Computer and Information Sciences, Assiut University, Assiut, Egypt, usama471@yahoo.com,
More informationImpact of Intensity Edge Map on Segmentation of Noisy Range Images
Impact of Intensity Edge Map on Segmentation of Noisy Range Images Yan Zhang 1, Yiyong Sun 1, Hamed Sari-Sarraf, Mongi A. Abidi 1 1 IRIS Lab, Dept. of ECE, University of Tennessee, Knoxville, TN 37996-100,
More informationProcedia Computer Science
Procedia Computer Science 3 (2011) 859 865 Procedia Computer Science 00 (2010) 000 000 Procedia Computer Science www.elsevier.com/locate/procedia www.elsevier.com/locate/procedia WCIT-2010 A new median
More informationINFORMATION RETRIEVAL USING MARKOV MODEL MEDIATORS IN MULTIMEDIA DATABASE SYSTEMS. Mei-Ling Shyu, Shu-Ching Chen, and R. L.
INFORMATION RETRIEVAL USING MARKOV MODEL MEDIATORS IN MULTIMEDIA DATABASE SYSTEMS Mei-Ling Shyu, Shu-Ching Chen, and R. L. Kashyap School of Electrical and Computer Engineering Purdue University, West
More informationMorphological Image Processing
Morphological Image Processing Morphology Identification, analysis, and description of the structure of the smallest unit of words Theory and technique for the analysis and processing of geometric structures
More informationHybrid filters for medical image reconstruction
Vol. 6(9), pp. 177-182, October, 2013 DOI: 10.5897/AJMCSR11.124 ISSN 2006-9731 2013 Academic Journals http://www.academicjournals.org/ajmcsr African Journal of Mathematics and Computer Science Research
More informationModified Watershed Segmentation with Denoising of Medical Images
Modified Watershed Segmentation with Denoising of Medical Images Usha Mittal 1, Sanyam Anand 2 M.Tech student, Dept. of CSE, Lovely Professional University, Phagwara, Punjab, India 1 Assistant Professor,
More informationEECS490: Digital Image Processing. Lecture #17
Lecture #17 Morphology & set operations on images Structuring elements Erosion and dilation Opening and closing Morphological image processing, boundary extraction, region filling Connectivity: convex
More informationCharacter Recognition
Character Recognition 5.1 INTRODUCTION Recognition is one of the important steps in image processing. There are different methods such as Histogram method, Hough transformation, Neural computing approaches
More informationHandwritten Gurumukhi Character Recognition by using Recurrent Neural Network
139 Handwritten Gurumukhi Character Recognition by using Recurrent Neural Network Harmit Kaur 1, Simpel Rani 2 1 M. Tech. Research Scholar (Department of Computer Science & Engineering), Yadavindra College
More informationAn ICA based Approach for Complex Color Scene Text Binarization
An ICA based Approach for Complex Color Scene Text Binarization Siddharth Kherada IIIT-Hyderabad, India siddharth.kherada@research.iiit.ac.in Anoop M. Namboodiri IIIT-Hyderabad, India anoop@iiit.ac.in
More informationIRIS SEGMENTATION OF NON-IDEAL IMAGES
IRIS SEGMENTATION OF NON-IDEAL IMAGES William S. Weld St. Lawrence University Computer Science Department Canton, NY 13617 Xiaojun Qi, Ph.D Utah State University Computer Science Department Logan, UT 84322
More informationMedical images, segmentation and analysis
Medical images, segmentation and analysis ImageLab group http://imagelab.ing.unimo.it Università degli Studi di Modena e Reggio Emilia Medical Images Macroscopic Dermoscopic ELM enhance the features of
More informationBinary Shape Characterization using Morphological Boundary Class Distribution Functions
Binary Shape Characterization using Morphological Boundary Class Distribution Functions Marcin Iwanowski Institute of Control and Industrial Electronics, Warsaw University of Technology, ul.koszykowa 75,
More information160 M. Nadjarbashi, S.M. Fakhraie and A. Kaviani Figure 2. LUTB structure. each block-level track can be arbitrarily connected to each of 16 4-LUT inp
Scientia Iranica, Vol. 11, No. 3, pp 159{164 c Sharif University of Technology, July 2004 On Routing Architecture for Hybrid FPGA M. Nadjarbashi, S.M. Fakhraie 1 and A. Kaviani 2 In this paper, the routing
More informationUsing the Deformable Part Model with Autoencoded Feature Descriptors for Object Detection
Using the Deformable Part Model with Autoencoded Feature Descriptors for Object Detection Hyunghoon Cho and David Wu December 10, 2010 1 Introduction Given its performance in recent years' PASCAL Visual
More informationThe only known methods for solving this problem optimally are enumerative in nature, with branch-and-bound being the most ecient. However, such algori
Use of K-Near Optimal Solutions to Improve Data Association in Multi-frame Processing Aubrey B. Poore a and in Yan a a Department of Mathematics, Colorado State University, Fort Collins, CO, USA ABSTRACT
More informationStacked Denoising Autoencoders for Face Pose Normalization
Stacked Denoising Autoencoders for Face Pose Normalization Yoonseop Kang 1, Kang-Tae Lee 2,JihyunEun 2, Sung Eun Park 2 and Seungjin Choi 1 1 Department of Computer Science and Engineering Pohang University
More informationClassification of Printed Chinese Characters by Using Neural Network
Classification of Printed Chinese Characters by Using Neural Network ATTAULLAH KHAWAJA Ph.D. Student, Department of Electronics engineering, Beijing Institute of Technology, 100081 Beijing, P.R.CHINA ABDUL
More informationImage Processing. Bilkent University. CS554 Computer Vision Pinar Duygulu
Image Processing CS 554 Computer Vision Pinar Duygulu Bilkent University Today Image Formation Point and Blob Processing Binary Image Processing Readings: Gonzalez & Woods, Ch. 3 Slides are adapted from
More informationPattern Recognition Using Graph Theory
ISSN: 2278 0211 (Online) Pattern Recognition Using Graph Theory Aditya Doshi Department of Computer Science and Engineering, Vellore Institute of Technology, Vellore, India Manmohan Jangid Department of
More informationHeap-on-Top Priority Queues. March Abstract. We introduce the heap-on-top (hot) priority queue data structure that combines the
Heap-on-Top Priority Queues Boris V. Cherkassky Central Economics and Mathematics Institute Krasikova St. 32 117418, Moscow, Russia cher@cemi.msk.su Andrew V. Goldberg NEC Research Institute 4 Independence
More informationretrieve portions of these maps based on the information and then let the GIS handle the queries and discard the number of heterogeneous maps.
Intl. Journal of Document Analysis and Recognition. 1(2):89-101,June 1998 MAGELLAN: Map Acquisition of GEographic Labels by Legend ANalysis Hanan Samet?,Aya Soer?? Computer Science Department and Center
More informationAn Approach for Reduction of Rain Streaks from a Single Image
An Approach for Reduction of Rain Streaks from a Single Image Vijayakumar Majjagi 1, Netravati U M 2 1 4 th Semester, M. Tech, Digital Electronics, Department of Electronics and Communication G M Institute
More informationAlgorithms and Data Structures. Marcin Sydow. Introduction. QuickSort. Sorting 2. Partition. Limit. CountSort. RadixSort. Summary
Sorting 2 Topics covered by this lecture: Stability of Sorting Quick Sort Is it possible to sort faster than with Θ(n log(n)) complexity? Countsort Stability A sorting algorithm is stable if it preserves
More informationRESEARCH ON OPTIMIZATION OF IMAGE USING SKELETONIZATION TECHNIQUE WITH ADVANCED ALGORITHM
881 RESEARCH ON OPTIMIZATION OF IMAGE USING SKELETONIZATION TECHNIQUE WITH ADVANCED ALGORITHM Sarita Jain 1 Sumit Rana 2 Department of CSE 1 Department of CSE 2 Geeta Engineering College 1, Panipat, India
More informationExercise 3: ROC curves, image retrieval
Exercise 3: ROC curves, image retrieval Multimedia systems 2017/2018 Create a folder exercise3 that you will use during this exercise. Unpack the content of exercise3.zip that you can download from the
More informationA Graph Theoretic Approach to Image Database Retrieval
A Graph Theoretic Approach to Image Database Retrieval Selim Aksoy and Robert M. Haralick Intelligent Systems Laboratory Department of Electrical Engineering University of Washington, Seattle, WA 98195-2500
More informationEE795: Computer Vision and Intelligent Systems
EE795: Computer Vision and Intelligent Systems Spring 2012 TTh 17:30-18:45 WRI C225 Lecture 04 130131 http://www.ee.unlv.edu/~b1morris/ecg795/ 2 Outline Review Histogram Equalization Image Filtering Linear
More informationPROCESS > SPATIAL FILTERS
83 Spatial Filters There are 19 different spatial filters that can be applied to a data set. These are described in the table below. A filter can be applied to the entire volume or to selected objects
More informationSampling informative/complex a priori probability distributions using Gibbs sampling assisted by sequential simulation
Sampling informative/complex a priori probability distributions using Gibbs sampling assisted by sequential simulation Thomas Mejer Hansen, Klaus Mosegaard, and Knud Skou Cordua 1 1 Center for Energy Resources
More informationPROJECTION MODELING SIMPLIFICATION MARKER EXTRACTION DECISION. Image #k Partition #k
TEMPORAL STABILITY IN SEQUENCE SEGMENTATION USING THE WATERSHED ALGORITHM FERRAN MARQU ES Dept. of Signal Theory and Communications Universitat Politecnica de Catalunya Campus Nord - Modulo D5 C/ Gran
More informationAllowing Cycle-Stealing Direct Memory Access I/O. Concurrent with Hard-Real-Time Programs
To appear in: Int. Conf. on Parallel and Distributed Systems, ICPADS'96, June 3-6, 1996, Tokyo Allowing Cycle-Stealing Direct Memory Access I/O Concurrent with Hard-Real-Time Programs Tai-Yi Huang, Jane
More informationFilter Banks with Variable System Delay. Georgia Institute of Technology. Abstract
A General Formulation for Modulated Perfect Reconstruction Filter Banks with Variable System Delay Gerald Schuller and Mark J T Smith Digital Signal Processing Laboratory School of Electrical Engineering
More informationBackpropagation Neural Networks. Ain Shams University. Queen's University. Abstract
Classication of Ships in Airborne SAR Imagery Using Backpropagation Neural Networks Hossam Osman,LiPan y, Steven D. Blostein y, and Langis Gagnon z Department of Computer and Systems Engineering Ain Shams
More informationWEINER FILTER AND SUB-BLOCK DECOMPOSITION BASED IMAGE RESTORATION FOR MEDICAL APPLICATIONS
WEINER FILTER AND SUB-BLOCK DECOMPOSITION BASED IMAGE RESTORATION FOR MEDICAL APPLICATIONS ARIFA SULTANA 1 & KANDARPA KUMAR SARMA 2 1,2 Department of Electronics and Communication Engineering, Gauhati
More informationBinary Image Processing. Introduction to Computer Vision CSE 152 Lecture 5
Binary Image Processing CSE 152 Lecture 5 Announcements Homework 2 is due Apr 25, 11:59 PM Reading: Szeliski, Chapter 3 Image processing, Section 3.3 More neighborhood operators Binary System Summary 1.
More informationGeneralizing Binary Classiers to the Multiclass Case
Generalizing Binary Classiers to the Multiclass Case Dain, Eliyahu eliyahud@post.tau.ac.il Zach, Rotem rotemzac@post.tau.ac.il March 3, 2013 Abstract The course described several ways to solve binary classication
More informationMRI Brain Image Segmentation Using an AM-FM Model
MRI Brain Image Segmentation Using an AM-FM Model Marios S. Pattichis', Helen Petropoulos2, and William M. Brooks2 1 Department of Electrical and Computer Engineering, The University of New Mexico, Albuquerque,
More informationUsing Game Theory for Image Segmentation
Using Game Theory for Image Segmentation Elizabeth Cassell Sumanth Kolar Alex Yakushev 1 Introduction 21st March 2007 The goal of image segmentation, is to distinguish objects from background. Robust segmentation
More informationMorphological Image Processing
Morphological Image Processing Ranga Rodrigo October 9, 29 Outline Contents Preliminaries 2 Dilation and Erosion 3 2. Dilation.............................................. 3 2.2 Erosion..............................................
More informationAn Edge Detection Algorithm for Online Image Analysis
An Edge Detection Algorithm for Online Image Analysis Azzam Sleit, Abdel latif Abu Dalhoum, Ibraheem Al-Dhamari, Afaf Tareef Department of Computer Science, King Abdulla II School for Information Technology
More informationSpatial Enhancement Definition
Spatial Enhancement Nickolas Faust The Electro- Optics, Environment, and Materials Laboratory Georgia Tech Research Institute Georgia Institute of Technology Definition Spectral enhancement relies on changing
More informationExtracting Layers and Recognizing Features for Automatic Map Understanding. Yao-Yi Chiang
Extracting Layers and Recognizing Features for Automatic Map Understanding Yao-Yi Chiang 0 Outline Introduction/ Problem Motivation Map Processing Overview Map Decomposition Feature Recognition Discussion
More information09/11/2017. Morphological image processing. Morphological image processing. Morphological image processing. Morphological image processing (binary)
Towards image analysis Goal: Describe the contents of an image, distinguishing meaningful information from irrelevant one. Perform suitable transformations of images so as to make explicit particular shape
More informationReinforcement Control via Heuristic Dynamic Programming. K. Wendy Tang and Govardhan Srikant. and
Reinforcement Control via Heuristic Dynamic Programming K. Wendy Tang and Govardhan Srikant wtang@ee.sunysb.edu and gsrikant@ee.sunysb.edu Department of Electrical Engineering SUNY at Stony Brook, Stony
More informationDevelopment of an Automated Fingerprint Verification System
Development of an Automated Development of an Automated Fingerprint Verification System Fingerprint Verification System Martin Saveski 18 May 2010 Introduction Biometrics the use of distinctive anatomical
More informationInterpolation is a basic tool used extensively in tasks such as zooming, shrinking, rotating, and geometric corrections.
Image Interpolation 48 Interpolation is a basic tool used extensively in tasks such as zooming, shrinking, rotating, and geometric corrections. Fundamentally, interpolation is the process of using known
More informationBlind Image Deconvolution Technique for Image Restoration using Ant Colony Optimization
Blind Image Deconvolution Technique for Image Restoration using Ant Colony Optimization Amandeep Kaur CEM Kapurthala, Punjab Vinay Chopra DAVIET Jalandhar Punjab ABSTRACT Image Restoration is a field of
More informationFilters. Advanced and Special Topics: Filters. Filters
Filters Advanced and Special Topics: Filters Dr. Edmund Lam Department of Electrical and Electronic Engineering The University of Hong Kong ELEC4245: Digital Image Processing (Second Semester, 2016 17)
More informationA FUZZY LOGIC BASED METHOD FOR EDGE DETECTION
Bulletin of the Transilvania University of Braşov Series I: Engineering Sciences Vol. 4 (53) No. 1-2011 A FUZZY LOGIC BASED METHOD FOR EDGE DETECTION C. SULIMAN 1 C. BOLDIŞOR 1 R. BĂZĂVAN 2 F. MOLDOVEANU
More informationRecognition of Gurmukhi Text from Sign Board Images Captured from Mobile Camera
International Journal of Information & Computation Technology. ISSN 0974-2239 Volume 4, Number 17 (2014), pp. 1839-1845 International Research Publications House http://www. irphouse.com Recognition of
More informationClassification. Vladimir Curic. Centre for Image Analysis Swedish University of Agricultural Sciences Uppsala University
Classification Vladimir Curic Centre for Image Analysis Swedish University of Agricultural Sciences Uppsala University Outline An overview on classification Basics of classification How to choose appropriate
More informationImage Segmentation Based on Watershed and Edge Detection Techniques
0 The International Arab Journal of Information Technology, Vol., No., April 00 Image Segmentation Based on Watershed and Edge Detection Techniques Nassir Salman Computer Science Department, Zarqa Private
More information