Text Line Segmentation Based on Morphology and Histogram Projection
|
|
- Bryan Harrison
- 6 years ago
- Views:
Transcription
1 th Iteratioal Coferece o Documet Aalsis ad Recogitio Tet Lie Segmetatio Based o Morpholog ad Histogram Projectio Rodolfo P. dos Satos, Gabriela S. Clemete, Tsag Ig Re ad George D.C. Calvalcati Ceter of Iformatics, Federal Uiversit of Perambuco Recife, PE, Brazil - {rps2,gsc2,tir,gdcc}@ci.ufpe.br Abstract Tet etractio is a importat phase i documet recogitio sstems. I order to segmet tet from a page documet it is ecessar to detect all the possible mauscript tet regios. I this article we propose a efficiet algorithm to segmet hadwritte tet lies. The tet lie algorithm uses a morphological operator to obtai the features of the images. Followig, a sequece of histogram projectio ad recover is proposed to obtai the lie segmeted regio of the tet. First, a Y histogram projectio is performed which results i the tet lies positios. To divide the lies i differet regios a threshold is applied. After that, aother threshold is used to elimiate false lies. These procedures, however, cause some loss o the tet lie area. So, a recover method is proposed to miimize this effect. I order to detect the etreme positios of the tet i the horizotal directio, a X histogram projectio is applied. The, as i the Y directio, aother threshold is used to elimiate false words. Fiall, i order to optimize the area of the mauscript tet lie, a tet selectio is carried out. Eperimetal results usig the IAM-database showed that this ew approach is robust, fast ad produces ver good score rates. 1. Itroductio Tet lie etractio or segmetatio is a importat problem that does ot have a uiversal accepted solutio i the cotet of automatic hadwritte documet recogitio sstems [1]. Tet characteristics ca var i fot, size, shape, stle, orietatio, aligmet, teture, color, cotrast ad backgroud iformatio. These variatios tur the process of word detectio comple ad difficult [2]. I the case of hadwritte mauscripts, differetl from machie prited, the compleit of the problem eve icreases. Sice hadwritte tet ca var greatl depedig o the user skill, dispositio ad eve cultural backgroud. Here, we preset a method to segmet tet lies based o morpholog ad histogram projectio. Morphological operatios are used to produce a biar image. This procedure was first proposed b Wu et. al. [3], as a iitial step i the process of tet lie etractio from video images cotaiig tet iformatio. I their applicatio, a ot precise bo cotaiig the regio of the tet is used as output of the sstem to idetif machie prited tet i differet video cotets. We have adapted ad improved this idea for hadwritte tet lie segmetatio problem. A importat fact i relatio to image aalsis based o cotrast is that this characteristic is robust i relatio to chages i illumiatio ad it is ivariat to differet image trasformatios such as scalig, traslatio ad skewig. Oce the page documet has bee preprocessed, a techique based o projectio profiles is applied. Projectio profiles are commol used for prited documet segmetatio ad ca also be adapted to hadwritte documets [1]. I the work of Mariai ad esi [4], the projectio curves are used to segmet music sheets i order to etract the basic smbols ad their positios. The segmetatio approach proposed is divided i 3 levels ad utilizes projectio profiles alog the Y ad X aes alteratel. Mamatha ad Rothfeder [5] used projectio profiles i the horizotal directio to segmet words of historical hadwritte documets durig the lie segmetatio stage. I this work, a projectio profile i the horizotal directio is iitiall applied to obtai the tet lies positios. Some improvemets were ecessar i this procedure to correctl idetif the lie segmets, so a recover process is also developed. A similar process is used to obtai the word borders of a lie usig projectio profiles i the vertical directio. We refer to projectio profile as histogram projectio. Eperimets are performed o hadwritte documets radoml selected from the IAM-database [6], showig that the proposed techique produces ecouragig results. A /09 $ IEEE DOI /ICDAR
2 aalsis based o a performace evaluatio method described i [7] is carried out. This work is orgaized as follows. I Sectio 2, the proposed method ad all its stages are described. I Sectio 3, the eperimetal results are aalzed ad discussed. Fiall, i Sectio 4, some discussio ad cocludig remarks are preseted. 2. Proposed Method I this sectio we propose a ew method to automaticall idetif ad segmet the tet lie regios of a hadwritte documet. The sstem cosists of eight stages, as show i Figure 1 ad described below. The feature etractio or biarizatio step is applied to the iput image, resultig i Figure 2b. The, a Y histogram projectio (Fig. 2c) is obtaied to detect the possible lies. Due to some oises, a tet lie separatio (Fig. 2d) is ecessar. Oce the false lies are foud, the must be ecluded. After that, the lie regio recover step (Fig. 2e) is performed i order to recover some losses itroduced b the precedig step. A X histogram projectio that is applied to each lie detected (Fig. 2f) takes out possible false words, mail at the lateral edges of the page. Fiall, we obtai the tet lies regio (Fig. 2g). (c) (d) Iput Image Feature Etractio Y Histogram Projectio Tet Lie Separatio False Lie Eclusio Tet Selectio False Word Eclusio X Histogram Projectio Lie Regio Recover Figure 1. Flowchart of the proposed sstem, showig the eight stages of the procedure. (e) (f) 2.1. Biarizatio Tet i hadwritte documet image, most of the times, have high cotrast i relatio to the backgroud of the images. The widths ad heights of the tet lies are relativel uiform ad have a horizotal directio. The feature etractio used here is the method proposed b Wu et. al. [3], which is based o morphological operators. The origial idea of this techique was to etract high cotrast regios from a video image, where there is a lot of iformatio i the backgroud. The authors mai objective was to be able to localize tet regio from video image i a real outdoors eviromet. Figure 3 shows the flowchart of this operatio alog with the morphological operatios used to obtai the desired results. (g) Figure 2. Itermediate stages: Iput image, Feature etractio step, (c) Y histogram projectio with itersectio betwee letters highlighted, (d)tet lie separatio with a false lie highlighted, (e) Lie regio recover, (f) X histogram projectio with a false word highlighted ad (g)tet selectio. 652
3 Figure 3. Flowchart of feature etractio stage. I equatios 1-5, I(, deotes the gra level value of the piel located at positio (, ad S m, is the structural elemet of size m where m ad are odd values lager tha zero. Figure 4 shows two kids of structural elemets used i mathematical morpholog operatios. S 1, Iput Image Average (1) Closig (2) Opeig (3) Diferece (4) Closig Biarizatio (5) Labelig Feature Etractio m/2 /2 1 ES m ( I(, ) I( + i, + j) Sm, ( i, j) (1) m i m/2 i /2 I (, S m, ( I (, S m, ) ΘS m, I (, Sm, ( I(, ΘSm, ) Sm, D( I1, I 2 ) I1(, I 2 (, 255, if ( I (, > T; T ( I(, ) 0, otherwise S 3,7 Figure 4. Structure elemets masks used b the morphological operators. To obtai the biarizatio resultig output, first a smoothig operatio is used b applig a average filter that have a widow size of 3 piels, which is defied as a structure elemet S 3,3 i mathematical morpholog cotet. The et operatios are closig ad opeig usig a structural elemet S 1,20. The (2) (3) (4) (5) differece obtaied from subtractig both images is the result of the followig step. The, aother closig operatio is performed with a structural elemet S 5,5 to tur the border of the resultig image more compact ad closer. Afterwards, a threshold procedure is applied followed b a labelig process to etract the tet segmets. I the threshold procedure a parameter T is defied damicall accordig to the backgroud of the image. This parameter is resposible to determie the limit value of the biarizatio operatio. A eample of the result of this process is show i Figure 2b Y Histogram Projectio Oce the feature etractio of the images is performed, the Y histogram projectio of the whole image is obtaied. The idea is to use a simple ad fast method to correctl distiguish possible lie segmets i the hadwritte tet. I Figure 2c it is clear that each tet lie correspods to a peak i the histogram. The histogram represets the added piels for each value. So the empt spaces betwee the peaks represet possible regios betwee differet tet lies Tet Lie Separatio Oce all the potetial lies are detected, a procedure to appl a threshold is performed to obtai a possible lie separatio i the tet. This threshold is damicall calculated ad it is proportioal to the average legth of the lies i the tet (Y histogram values). This process applied to the histogram aims to remove the regios i the histogram that are ot referred to the lies i the tet, or the elimiatio of oises that cofuses with the tet lies. The choice of the parameter to be used as threshold is itrisic related to the iformatio i the tet, so that the algorithm utilized the miimum possible of heuristic techiques to determie the lie separatio poits. Actuall, this stage tries to idetif the locatio of each tet lie. The separatio of the possible tet lies regios usig the histogram shows a difficult due to the upper ad lower regios of some letters as show i Figure 5. Figure 5: Regios that provoke false lies. 653
4 The red marked areas i Figure 2c shows a detailed view of these regios i the histogram. To separate the tet lies, we eclude part of the histogram based o the average Y histogram values. However, b doig so, part of the letters is lost sice the are located i the regio of the eclusio. To solve this problem a recover method is also proposed. As a result of the stage described, we obtaied the ew Y histogram projectio, show i Figure 2d. ote that the peaks are clearl separated b empt regios compared to Figure 2c False Lie Eclusio This procedure tries to eclude possible oises close to the tet lies regios. Oce the possible tet lie regios are separated b removig a offset from the histogram, we determie the average height of these regios to eclude false lies that might be detected. I Figure 2d we ca observe this effect, a small peak i the histogram show i red ellipse. If this regio poses eough height it ca be cofused with a tet lie segmet b the algorithm. The height of a lie is obtaied b takig the limit values of the correspodig regio i the Y histogram ad calculatig the differece betwee them. The equatio bellow provides the average height of the lies foud i a page: iitial p fial, (6) where iitial is the positio where the tet regio begis, fial is the positio where the tet regio eds ad p is the umber of regios foud i the page. The lies with height below a pre-determied threshold are removed. The value of this threshold is proportioal to the average height of the tet lies i the whole image Lie Regio Recover This procedure determies the average poit betwee the regios foud. The idea is to fid the maimum area that each lie might be iscribed, b determiig the superior ad iferior coordiates i the ais. Figure 2e shows the limits of these regios after the eclusio threshold is applied. The dashed lies are the limits betwee two adjacet lie regios. I this wa, the ecluded regios are recovered. ote that the limit lies establish the maimum ad miimum coordiates for each tet lie X Histogram Projectio A histogram was also projected i the X directio for each lie segmeted. This procedure determies the word positios i the tet lie. The result of this stage is crucial to detect oise (or false words) i the image False Word Eclusio The X projectio is also used to remove regio oise, i the same wa that it is described i sectio 2.4. Figure 2f shows this effect, the red regio shows a false word regio that should be ecluded. I this wa we determie the etreme poits of each setece or the word border poits (right ad left). Besides that, for the precise determiatio of the maimum border poits, four times the maimum word width amog the words ecluded is added. This value was obtaied through several eperimets Tet Selectio Oce idetified the coordiates that delimits the possible tet regio, a algorithm is applied to fid out the smallest regio bo that iscribes that tet regio. The procedure is similar to the algorithm used i [3]. It cosists i optimizig the dimesios of the rectagle that ecompasses the tet lie. This regio is defied as the fial segmeted tet area ad it should ot cross over parts of the word or have larger dimesios tha the lie. Figure 2g shows a eample of this procedure ad the fial result of the segmetatio process. 3. Eperimetal Results The eperimets of the proposed method are doe usig 150 images (total umber of tet lies 1353) radoml chose from the IAM hadwritte database. This public available database [6] provides images with 300 dpi, ad 256 gra levels i a tiff graphic format. The database also provides the iformatio about the segmeted lie regios, so we compared our results with the oe provided b the database. Figure 6 shows two eamples of the tet lie segmeted regios obtaied b the proposed method. ote that i Figure 6a all the segmets were correctl idetified. However, i Figure 6b we show a case where the method still fails because lie 3 is a false lie. However this kid of problems occurred i less the 1,2 % of the total processed tet lies. 654
5 false _ alarms FalseAlarmRate M Usig a set of groud-truth with 1353 lies i our eperimets, the false alarm rate is equal to 15/ This meas that ol 15 false lies are detected. 4. Coclusios ad Discussios Figure 6. Eemple of two image documets ad the segmeted regio obtaied b the algorithm. To evaluate the performace of the procedure we compared each segmeted lie positio, that is the, of the leftmost positio, the height (h) ad legth (w) of the bo, to the oes iformed b the database. We obtaied agreemet i piel positio level with a ver small deviatio. For eample i Figure 6 lies 3 to 7 all the piels positio coicides. Ad for lies 0 to 2, a disagreemet of less the 5 piels was obtaied for all variables,, w ad h. The performace measuremet of the algorithm was evaluated accordig to the method described i [7]. Table 1 shows the detectio rate ad the missed detectio rate, usig the formula provide b equatios below: oe2oe g _ oe2ma DetectioRate w1 + w2 + w3 misses MissedDete ctiorate g _ ma2oe Table 1. Results (Total lies 1353) Acceptace Threshold Detectio Rate Missed Detectio Rate The false alarm rate was obtaied b: I coclusio, we preseted a ovel algorithm for tet lie segmetatio. The procedure proved to be fast ad ver accurate usig the well-kow IAM database. The results, eve though we used a small part of all the images cotaied i the database, showed to be ver ecouragig. Tet lie segmetatio is just the first phase for the solutio of a automatic hadwritte documet recogitio sstem. The et step of the problem is to segmet each word of the tet lie ad the each letter of the word. We believe that this procedure ca be achieved b usig the same kid of ideas used here i idetifig the tet lie. We are curretl ivestigatig this solutio. Refereces [1] L. Likforma-Sulem, A. Zahour, B. Tacoet, Tet lie segmetatio of historical documets: a surve, Iteratioal Joural o Documet Aalsis ad Recogitio, 2007, pp [2] K. Juga, K.I. Kimb, A.K. Jai, Tet iformatio etractio i images ad video: a surve, Patter Recogitio, 2004, pp [3] J.C. Wu, J.W. Hsieh, Y.S. Che, Morpholog-based tet lie etractio, Machie Visio ad Applicatios, 2008, pp [4] S. Mariai, P. esi, Projectio Based Segmetatio of Musical Sheets, Documet Aalsis ad Recogitio, ICDAR 1999, pp [5] R. Mamatha, J.L., Rothfeder, A scale space approach for automaticall segmetig words from historical hadwritte documets, IEEE Tras. Patter Aal. Mach. Itell., 2005, pp [6] U.V. Marti, H. Buke, The IAM-database: a Eglish setece database for offlie hadwritig recogitio, Iteratioal Joural o Documet Aalsis ad Recogitio, 2002, pp [7] B. Gatos, A. Atoacopoulos,. Stamatopoulos, Hadwritig Segmetatio Cotest, Documet Aalsis ad Recogitio, ICDAR 2007, pp
A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationAccuracy Improvement in Camera Calibration
Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z
More informationHandwriting Stroke Extraction Using a New XYTC Transform
Hadwritig Stroke Etractio Usig a New XYTC Trasform Gilles F. Houle 1, Kateria Bliova 1 ad M. Shridhar 1 Computer Scieces Corporatio Uiversity Michiga-Dearbor Abstract: The fudametal represetatio of hadwritig
More informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationare two specific neighboring points, F( x, y)
$33/,&$7,212)7+(6(/)$92,',1* 5$1'20:$/.12,6(5('8&7,21$/*25,7+0,17+(&2/285,0$*(6(*0(17$7,21 %RJGDQ602/.$+HQU\N3$/86'DPLDQ%(5(6.$ 6LOHVLDQ7HFKQLFDO8QLYHUVLW\'HSDUWPHQWRI&RPSXWHU6FLHQFH $NDGHPLFND*OLZLFH32/$1'
More informationOCR Statistics 1. Working with data. Section 3: Measures of spread
Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.
More informationDynamic Programming and Curve Fitting Based Road Boundary Detection
Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk
More informationRESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE
RESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE Z.G. Zhou, S. Zhao, ad Z.G. A School of Mechaical Egieerig ad Automatio, Beijig Uiversity of Aeroautics ad Astroautics,
More informationCOMPLEMENTARY SIMILARITY MEASURE
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 20, NO. 0, OCTOBER 998 03 Text-Lie Extractio ad Character Recogitio of Documet Headlies With Graphical Desigs Usig Complemetary Similarity
More informationPerformance Plus Software Parameter Definitions
Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationApplication of Decision Tree and Support Vector Machine for Inspecting Bubble Defects on LED Sealing Glue Images
66 Applicatio of Decisio Tree ad Support Vector Machie for Ispectig Bubble Defects o LED Sealig Glue Images * Chua-Yu Chag ad Yi-Feg Li Abstract Bubble defect ispectio is a importat step i light-emittig
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationNeuro Fuzzy Model for Human Face Expression Recognition
IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1
More informationMobile terminal 3D image reconstruction program development based on Android Lin Qinhua
Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College
More informationEstimating the Motion of an Underwater Robot from a Monocular Image Sequence
Estimatig the Motio of a Uderwater Robot from a Moocular Image Sequece Rafael Garcia, Xevi Cufi ad Marc Carreras Computer Visio ad Robotics Group Istitute of Iformatics ad Applicatios Uiversit of Giroa,
More informationImage based Cats and Possums Identification for Intelligent Trapping Systems
Volume 159 No, February 017 Image based Cats ad Possums Idetificatio for Itelliget Trappig Systems T. A. S. Achala Perera School of Egieerig Aucklad Uiversity of Techology New Zealad Joh Collis School
More informationThe Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana
The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationImproving Template Based Spike Detection
Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for
More informationAn Efficient Image Rectification Method for Parallel Multi-Camera Arrangement
Y.-S. Kag ad Y.-S. Ho: A Efficiet Image Rectificatio Method for Parallel Multi-Camera Arragemet 141 A Efficiet Image Rectificatio Method for Parallel Multi-Camera Arragemet Yu-Suk Kag ad Yo-Sug Ho, Seior
More informationParabolic Path to a Best Best-Fit Line:
Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More information( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb
Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most
More informationSection 7.2: Direction Fields and Euler s Methods
Sectio 7.: Directio ields ad Euler s Methods Practice HW from Stewart Tetbook ot to had i p. 5 # -3 9-3 odd or a give differetial equatio we wat to look at was to fid its solutio. I this chapter we will
More informationFundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le
Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationHarris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c
Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationCS 683: Advanced Design and Analysis of Algorithms
CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,
More informationStone Images Retrieval Based on Color Histogram
Stoe Images Retrieval Based o Color Histogram Qiag Zhao, Jie Yag, Jigyi Yag, Hogxig Liu School of Iformatio Egieerig, Wuha Uiversity of Techology Wuha, Chia Abstract Stoe images color features are chose
More informationLecture 28: Data Link Layer
Automatic Repeat Request (ARQ) 2. Go ack N ARQ Although the Stop ad Wait ARQ is very simple, you ca easily show that it has very the low efficiecy. The low efficiecy comes from the fact that the trasmittig
More informationA Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System
A Novel Feature Extractio Algorithm for Haar Local Biary Patter Texture Based o Huma Visio System Liu Tao 1,* 1 Departmet of Electroic Egieerig Shaaxi Eergy Istitute Xiayag, Shaaxi, Chia Abstract The locality
More informationVALIDATING DIRECTIONAL EDGE-BASED IMAGE FEATURE REPRESENTATIONS IN FACE RECOGNITION BY SPATIAL CORRELATION-BASED CLUSTERING
VALIDATING DIRECTIONAL EDGE-BASED IMAGE FEATURE REPRESENTATIONS IN FACE RECOGNITION BY SPATIAL CORRELATION-BASED CLUSTERING Yasufumi Suzuki ad Tadashi Shibata Departmet of Frotier Iformatics, School of
More informationAlpha Individual Solutions MAΘ National Convention 2013
Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5
More informationComputers and Scientific Thinking
Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput
More informationAlgorithms for Disk Covering Problems with the Most Points
Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationIntermediate Statistics
Gait Learig Guides Itermediate Statistics Data processig & display, Cetral tedecy Author: Raghu M.D. STATISTICS DATA PROCESSING AND DISPLAY Statistics is the study of data or umerical facts of differet
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe
More informationDiego Nehab. n A Transformation For Extracting New Descriptors of Shape. n Locus of points equidistant from contour
Diego Nehab A Trasformatio For Extractig New Descriptors of Shape Locus of poits equidistat from cotour Medial Axis Symmetric Axis Skeleto Shock Graph Shaked 96 1 Shape matchig Aimatio Dimesio reductio
More informationComputer Science Foundation Exam. August 12, Computer Science. Section 1A. No Calculators! KEY. Solutions and Grading Criteria.
Computer Sciece Foudatio Exam August, 005 Computer Sciece Sectio A No Calculators! Name: SSN: KEY Solutios ad Gradig Criteria Score: 50 I this sectio of the exam, there are four (4) problems. You must
More informationTwo View Geometry Part 2 Fundamental Matrix Computation
3D Computer Visio II Two View Geometr Part Fudametal Matri Computatio Nassir Navab based o a course give at UNC b Marc Pollefes & the book Multiple View Geometr b Hartle & Zisserma November 9, 009 Outlie
More informationMasking based Segmentation of Diseased MRI Images
Maskig based Segmetatio of Diseased MRI Images Aruava De Dept. of Electroics ad Commuicatio Egg. Dr. B.C. Roy Egg College Durgapur,Idia aruavade@yahoo.com Raib Locha Das Dept. Of Electroics ad Commuicatio
More informationA Comparative Study of Color Edge Detection Techniques
CS31A WINTER-1314 PROJECT REPORT 1 A Comparative Study of Color Edge Detectio Techiques Masood Shaikh, Departmet of Electrical Egieerig, Staford Uiversity Abstract Edge detectio has attracted the attetio
More informationLU Decomposition Method
SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio
More informationDescriptive Statistics Summary Lists
Chapter 209 Descriptive Statistics Summary Lists Itroductio This procedure is used to summarize cotiuous data. Large volumes of such data may be easily summarized i statistical lists of meas, couts, stadard
More informationMATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)
MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give
More informationA Resource for Free-standing Mathematics Qualifications
Ope.ls The first sheet is show elow. It is set up to show graphs with equatios of the form = m + c At preset the values of m ad c are oth zero. You ca chage these values usig the scroll ars. Leave the
More informationFast algorithm for skew detection. Adnan Amin, Stephen Fischer, Tony Parkinson, and Ricky Shiu
Fast algorithm for skew detectio Ada Ami, Stephe Fischer, Toy Parkiso, ad Ricky Shiu School of Computer Sciece ad Egieerig Uiversity of New South Wales, Sydey NSW, 2052 Australia ABSTRACT Documet image
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationCounting Regions in the Plane and More 1
Coutig Regios i the Plae ad More 1 by Zvezdelia Stakova Berkeley Math Circle Itermediate I Group September 016 1. Overarchig Problem Problem 1 Regios i a Circle. The vertices of a polygos are arraged o
More informationn n B. How many subsets of C are there of cardinality n. We are selecting elements for such a
4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset
More informationSD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.
SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that
More informationNew Fuzzy Color Clustering Algorithm Based on hsl Similarity
IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper
More informationDETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION
Proceedigs, 11 th FIG Symposium o Deformatio Measuremets, Satorii, Greece, 2003. DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Michaela Haberler, Heribert Kahme
More informationStructuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software
Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued
More informationCHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs
CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics
More informationThe Counterchanged Crossed Cube Interconnection Network and Its Topology Properties
WSEAS TRANSACTIONS o COMMUNICATIONS Wag Xiyag The Couterchaged Crossed Cube Itercoectio Network ad Its Topology Properties WANG XINYANG School of Computer Sciece ad Egieerig South Chia Uiversity of Techology
More informationFEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING
FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING Christoph Busch, Ralf Dörer, Christia Freytag, Heike Ziegler Frauhofer Istitute for Computer Graphics, Computer Graphics Ceter
More information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
More informationThe Platonic solids The five regular polyhedra
The Platoic solids The five regular polyhedra Ole Witt-Hase jauary 7 www.olewitthase.dk Cotets. Polygos.... Topologically cosideratios.... Euler s polyhedro theorem.... Regular ets o a sphere.... The dihedral
More informationCHAPTER 3 A STUDY ON BREAST ABNORMALITY DETECTION
46 CHAPTER 3 A STUDY ON BREAST ABNORMALITY DETECTION 3.1 INTRODUCTION A Computer-Aided Detectio (CAD) system is used to aid radiologists i detectig mammographic lesios that may idicate the presece of breast
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationParallel Polygon Approximation Algorithm Targeted at Reconfigurable Multi-Ring Hardware
Parallel Polygo Approximatio Algorithm Targeted at Recofigurable Multi-Rig Hardware M. Arif Wai* ad Hamid R. Arabia** *Califoria State Uiversity Bakersfield, Califoria, USA **Uiversity of Georgia, Georgia,
More informationarxiv: v2 [cs.ds] 24 Mar 2018
Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More informationDerivation of perspective stereo projection matrices with depth, shape and magnification consideration
Derivatio of perspective stereo projectio matrices with depth, shape ad magificatio cosideratio Patrick Oberthür Jauary 2014 This essay will show how to costruct a pair of stereoscopic perspective projectio
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationMath 10C Long Range Plans
Math 10C Log Rage Plas Uits: Evaluatio: Homework, projects ad assigmets 10% Uit Tests. 70% Fial Examiatio.. 20% Ay Uit Test may be rewritte for a higher mark. If the retest mark is higher, that mark will
More informationHand Gesture Recognition for Human-Machine Interaction
Had Gesture Recogitio for Huma-Machie Iteractio Elea Sáchez-Nielse Departmet of Statistic, O.R. ad Computer Sciece, Uiversity of La Lagua Edificio de Física y Matemáticas 38271, La Lagua, Spai eielse@ull.es
More informationNew HSL Distance Based Colour Clustering Algorithm
The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics
More informationLip Contour Extraction Based on Support Vector Machine
Lip Cotour Extractio Based o Support Vector Machie Author Pa, Xiaosheg, Kog, Jiagpig, Liew, Ala Wee-Chug Published 008 Coferece Title CISP 008 : Proceedigs, First Iteratioal Cogress o Image ad Sigal Processig
More informationPosition Determination of a Robot End-Effector Using a 6D-Measurement System Based on the Two-View Vision
Ope Joural of Applied Scieces, 203, 3, 393-403 Published Olie November 203 (http://www.scirp.org/joural/ojapps) http://d.doi.org/0.4236/ojapps.203.37049 Positio Determiatio of a Robot Ed-Effector Usig
More informationIntegrated Video Object Segmentation and Shape Coding
Itegrated Video Obect Segmetatio ad Shape Codig JANEZ ZALETELJ Departmet of Telecommuicatios, Facult of Electrical Egieerig Uiversit of Lublaa Trzaska 25, SI-1000 Lublaa SLOVENIA Abstract: To eable cotet-based
More informationSectio 4, a prototype project of settig field weight with AHP method is developed ad the experimetal results are aalyzed. Fially, we coclude our work
200 2d Iteratioal Coferece o Iformatio ad Multimedia Techology (ICIMT 200) IPCSIT vol. 42 (202) (202) IACSIT Press, Sigapore DOI: 0.7763/IPCSIT.202.V42.0 Idex Weight Decisio Based o AHP for Iformatio Retrieval
More informationFINITE DIFFERENCE TIME DOMAIN METHOD (FDTD)
FINIT DIFFRNC TIM DOMAIN MTOD (FDTD) The FDTD method, proposed b Yee, 1966, is aother umerical method, used widel for the solutio of M problems. It is used to solve ope-regio scatterig, radiatio, diffusio,
More informationOn (K t e)-saturated Graphs
Noame mauscript No. (will be iserted by the editor O (K t e-saturated Graphs Jessica Fuller Roald J. Gould the date of receipt ad acceptace should be iserted later Abstract Give a graph H, we say a graph
More informationAnalysis of Documents Clustering Using Sampled Agglomerative Technique
Aalysis of Documets Clusterig Usig Sampled Agglomerative Techique Omar H. Karam, Ahmed M. Hamad, ad Sheri M. Moussa Abstract I this paper a clusterig algorithm for documets is proposed that adapts a samplig-based
More informationAn Image Retrieval Method Based on Hu Invariant Moment and Improved Annular Histogram
http://dx.doi.org/10.5755/j01.eee.0.4.6888 ELEKTROIKA IR ELEKTROTECHIKA ISS 139 115 VOL. 0 O. 4 014 A Image Retrieval Method Based o Hu Ivariat Momet ad Improved Aular Histogram F. Xiag 1 H. Yog 1 S. Dada
More informationSolving Fuzzy Assignment Problem Using Fourier Elimination Method
Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio
More informationDesign of two-dimensional zero reference codes by means of a global optimization method
Desig of two-dimesioal zero referece codes by meas of a global optimizatio method José Saez-Ladete Departameto de Teoría de la Señal y Comuicacioes Escuela Politécica Superior Uiversidad de Alcalá. Campus
More informationAn Algorithm to Solve Multi-Objective Assignment. Problem Using Interactive Fuzzy. Goal Programming Approach
It. J. Cotemp. Math. Scieces, Vol. 6, 0, o. 34, 65-66 A Algorm to Solve Multi-Objective Assigmet Problem Usig Iteractive Fuzzy Goal Programmig Approach P. K. De ad Bharti Yadav Departmet of Mathematics
More informationPolynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0
Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity
More informationINTERSECTION CORDIAL LABELING OF GRAPHS
INTERSECTION CORDIAL LABELING OF GRAPHS G Meea, K Nagaraja Departmet of Mathematics, PSR Egieerig College, Sivakasi- 66 4, Virudhuagar(Dist) Tamil Nadu, INDIA meeag9@yahoocoi Departmet of Mathematics,
More informationCubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
More informationFEATURES VECTOR FOR PERSONAL IDENTIFICATION BASED ON IRIS TEXTURE
FEATURES VECTOR FOR PERSONAL IDENTIFICATION BASED ON IRIS TEXTURE R. P. Moreo Departameto de Egeharia Elétrica EESC - USP Av. Trabalhador Sãocarlese, 400 São Carlos / SP Brasil raphael@digmotor.com.br
More informationImproving Information Retrieval System Security via an Optimal Maximal Coding Scheme
Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk
More informationA Modified Multiband U Shaped and Microcontroller Shaped Fractal Antenna
al Joural o Recet ad Iovatio Treds i Computig ad Commuicatio ISSN: 221-8169 A Modified Multibad U Shaped ad Microcotroller Shaped Fractal Atea Shweta Goyal 1, Yogedra Kumar Katiyar 2 1 M.tech Scholar,
More informationMath Section 2.2 Polynomial Functions
Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:
More informationSearching a Russian Document Collection Using English, Chinese and Japanese Queries
Searchig a Russia Documet Collectio Usig Eglish, Chiese ad Japaese Queries Fredric C. Gey (gey@ucdata.berkeley.edu) UC Data Archive & Techical Assistace Uiversity of Califoria, Berkeley, CA 94720 USA ABSTRACT.
More informationMultiresolution Image Fusion Based on the Wavelet-based Contourlet Transform
Multiresolutio Image Fusio Based o the Wavelet-based Cotourlet Trasform Lei Tag Istitute of utomated Commad PL Uiversit of Sciece ad Techolog Najig rm Commad College Najig, Chia tttaglei@gmail.com bstract
More informationNonlinear Mean Shift for Clustering over Analytic Manifolds
Noliear Mea Shift for Clusterig over Aalytic Maifolds Raghav Subbarao ad Peter Meer Departmet of Electrical ad Computer Egieerig Rutgers Uiversity, Piscataway NJ 08854, USA rsubbara,meer@caip.rutgers.edu
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationOptimization for framework design of new product introduction management system Ma Ying, Wu Hongcui
2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal
More information