An Approach to Real-Time Recognition of Chinese Handwritten Sentences
|
|
- Derick Ramsey
- 6 years ago
- Views:
Transcription
1 An Approach to Real-Tme Recognton of Chnese Handwrtten Sentences Da-Han Wang, Cheng-Ln Lu Natonal Laboratory of Pattern Recognton, Insttute of Automaton of Chnese Academy of Scences, Bejng , P.R. Chna E-mal : {dhwang, lucl}@nlpr.a.ac.cn Abstract: Wth the advances of handwrtng capturng devces and computng power of moble computers, pen-based Chnese text nput s movng from character-based nput to sentence-based nput. Ths paper proposes an approach to real-tme recognton of Chnese handwrtten sentences. The man feature of the approach s a dynamcally mantaned segmentaton-recognton canddate lattce. Whenever a new stroke s produced, canddate characters are generated and recognzed to assgn canddate classes, whle the wrtng process contnues. When the pen lft tme exceeds a threshold, the system searches the canddate lattce for the result of sentence recognton. Snce the recognton of canddate characters consumes the majorty of computng and s performed durng wrtng process, sentence recognton s obtaned mmedately after a long pen lft. Prelmnary experments demonstrate the promse of the proposed approach. Keywords Onlne Chnese handwrtten sentence recognton, real-tme recognton, dynamc canddate lattce, path search. 1. Introducton There have been growng applcatons of pen-based Chnese text. Wth the advances of handwrtng capturng devces and computng power of moble computers, sentence-based nput becomes possble. Compared to character-based nput, sentence-based nput s more natural and enables faster and more accurate nput va handwrtten sentence recognton utlzng contexts. Handwrtten sentence (character strng) recognton s a dffcult contextual classfcaton problem nvolvng character segmentaton and recognton. To acheve fast recognton, t s crucal to perform character segmentaton and recognton durng the wrtng process such that the whole recognton result s obtaned mmedately after completng a sentence. There have been many efforts towards the mprovement of the performance of handwrtten character strng recognton [1-7]. Most methods adopt the ntegrated segmentaton-recognton strategy to overcome the ambguty of character segmentaton: canddate character patterns are generated based on over-segmentaton and are recognzed by a character classfer to assgned canddate character classes, and the optmal path of segmentaton-recognton s searched for to gve the result. These methods, however, performs character segmentaton and recognton after the sentence wrtng s fnshed. To accelerate sentence recognton, character segmentaton and recognton should be performed durng the wrtng process, such that the result can be obtaned mmedately after the completon of wrtng. In ths paper, we propose an approach to real-tme recognton of Chnese handwrtten sentences usng a dynamcally mantaned segmentaton-recognton canddate lattce. Whenever a new stroke s produced, canddate characters are generated and recognzed to assgn canddate classes, whle the wrtng process contnues. The newly generated canddate characters and assgned classes are stored n the canddate lattce. When the pen lft tme exceeds a threshold, the system searches the canddate lattce for the result of sentence recognton by dynamc programmng (DP). Snce the recognton of canddate characters consumes the majorty of computng and s performed durng wrtng process, sentence recognton s obtaned mmedately after a long pen lft. We also developed some edtng functons to manually correct segmentaton and recognton errors. Our prelmnary experments demonstrate the promse of the proposed approach. 2. Character Strng Recognton We customze an exstng character recognton method to real-tme recognton. Before descrbng the real-tme recognton approach, we descrbe the character
2 strng recognton method below. In the ntegrated segmentaton-recognton framework, a character strng s frst over-segmented nto prmtve segments. Then one or several segments are merged to generate canddate characters that wll be recognzed by a character classfer to assgn canddate classes. The canddate characters and assgned classes are stored n a canddate lattce, and the optmal path can be searched for by DP or beam search [8][9]. The path evaluaton crteron ntegratng the character classfcaton score, geometrc context and language model s crucal to the accuracy and search effcency of strng recognton. We use the path evaluaton crteron proposed n [9]. Denote by X = x1l xn as a sequence of canddate characters of a strng, and each canddate character s assgned canddate classes (denoted as c ). Then the strng recognton result s a character strng C = c1 L cn. The canddate segmentaton-recognton path ( X, C ) s evaluated by a functon: n f ( XC, ) = { λ log Pc ( c ) + k[ λ log P( x c), (1) + log ( ) + log (, )]} = λ3 P g c λ4 P g c c 1 1 where P( x c), Pc ( c 1), P( g c) and 2 P( g c, c 1) are the lkelhood scores of character classfer, language model, unary and bnary geometrc contexts, respectvely, { λ 1, λ 2, λ 3, λ 4 } are four weghts that can be traned on a character strng dataset or determned emprcally, and k s the number of prmtve segments composng the canddate character x. The multpler k enables approxmate optmal path search by DP. 3. System Overvew The real-tme recognton system s dagrammed as n Fgure 1. It conssts of four man modules: real-tme recognton module, sentence recognton module, sentence edton module and language assocaton module. The modules of real-tme recognton and sentence recognton are the core of our approach, whle the other two modules make the system more usable. The real-tme recognton module acts whenever a new stroke s produced. The system determnes whether the stroke forms a new prmtve segment (stroke block) or not accordng to ts overlap wth prevous segments. If the stroke belongs to one prevous segment due to heavy x overlap, t s merged nto the prevous segment. Otherwse, t starts a new segment. Updated segments or newly created segments are merged wth prevous segments to generate new canddate characters, whch are recognzed by a character classfer to assgn canddate classes. The new canddate characters and assgned classes are added to the canddate segmentaton-recognton lattce. The detals of real-tme recognton wll be gven n Secton 4. Fgure 1. Flow chart of the system. Fgure 2. A canddate lattce (upper) and the updated one due to a new stroke (lower).
3 Fgure 2 shows an ntermedate canddate lattce and ts updated form due to a new stroke. After real-tme recognton on a new stroke, f the pen lft tme exceeds a threshold (adjustable by the user, e.g., 0.5s), the result of sentence recognton s obtaned by path search n the updated canddate lattce, performed by the sentence recognton module. The sentence recognton result may have errors of character segmentaton or recognton. A sentence edtng module s thus desgned to correct such errors. Character splt error can be corrected by drawng a crcle embracng the splt parts. Character merge error can be corrected by drawng a lne to separate the merged characters. After manual merge or splt, the merged or splt parts are re-combned nto canddate characters and re-assgned canddate classes, and the updated canddate lattce are re-searched for sentence recognton result. For character recognton error, canddate classes wll dsplayed when clckng on the character area, and the user can select the correct class. If the correct class s not n the top ranks, the user can erase the character and re-wrte. The language assocaton module ams to accelerate the wrtng process by automatcally enterng successve characters assocated wth the recognzed partal sentence. Ths module has not been mplemented yet. 4. Real-Tme Recognton Module In the followng, we focus on the mechansm of dynamc updatng of canddate segmentaton-recognton lattce. On a gven canddate lattce, optmal path search (sentence recognton) s performed based on the method descrbed n Secton 2. Specfcally, we use a tme-synchronous DP search algorthm for obtanng the sentence recognton result whenever the canddate lattce s updated upon a new stroke. Fgure 3 shows the flow chart of the real-tme recognton module. To make the sentence-based nput more convenent, the system allows the user to wrte multple lnes of sentences, and delayed strokes (nserted to a prevous wrtten part) are allowed. Algorthm 1 llustrates the real-tme process of a new stroke. Denote the stroke by strk. In the algorthm, segnum s the ndex of prmtve segment that the new stroke belongs to, and segnum=-1 ndcates that the stroke forms a new segment. pos s the poston (ndex) of the updated segment n the sequence. lnehe s the heght of text lne estmated from stroke blocks. The functon SameSegment(strk, s ) judges whether the stroke belongs to s or not, SortSegments( s m + 1, s1, s2,..., s m ) re-sorts the order of segments, and CanddateCharacters(pos, s1, s2,..., s m ) generates new canddate characters usng the updated segment sequence and the specfc segment poston. Fgure 3. Flow chart of the real-tme recognton module. Algorthm 1. Real-tme process of a new stroke Input: prmtve segment sequence s1, s2,..., s m a new stroke strk Intalzaton: set segnum=-1 For =m to 1 merge the boundng boxes of strk and s, denote the wdth and heght of the merged box as w and h, respectvely, f ( w> 2* lnehe OR h > 2* lnehe ) contnue; else f (SameSegment(strk, s ) ==TRUE ) segnum=, and pos=, break; End for. If (segnum>0) Merge strk nto s for updatng s Else Create a new segment s m + 1 usng strk, pos= SortSegments( s m + 1, s1, s2,..., s m ), m=m+1. End f. CanddateCharacters(pos, s1, s2,..., s m ), Recognze canddate characters, Update the canddate lattce. End.
4 4.1 Lne heght estmaton The estmated heght lnehe of a character strng s useful for judgng the plausblty of canddate characters. The lne heght s estmated by computng the average heght of stroke blocks. Frst, all the strokes are sorted n ascendng order of heght, and the half of strokes wth larger heght are used to estmate the lne heght. In the begnnng of wrtng, the system uses all the strokes for estmatng lne heght. Whle the wrtng proceeds, the estmate s updated usng the new stroke. The estmate becomes more precse when several strokes have been wrtten. 4.2 Relatonshp between stroke and segment The functon SameSegment(strk, s ) s computed as follows. Denote the wdth of the stroke s boundng box as w 1, and the wdth of the prmtve segment as w 2. Suppose the horzontal overlap between the two boundng boxes s w 0, the degree of overlap s defned by w o d =. (2) mn( w1, w2) The stroke s judged to belong to the prmtve segment when 1) d>0.4 or 2) d>0.2 and the stroke ntersects one stroke n the segment. 4.3 Sortng segment sequence If the new stroke belongs to one prevous segment (pos=), we need not to re-sort the segment sequence but only update the segment. If the stroke forms a new segment, we need to re-sort the segments n cases of multple lnes and delayed strokes. See Fgure 4 for an examples. The sentence conssts of two lnes, contanng prmtve segments s1s2,... s 9. Pos1, Pos2, and Pos3 are possble postons where the new stroke s nserted. Pos1 s most probable poston, and Pos2 and Pos3 correspond to delayed strokes. Delayed strokes also happen when a character s deleted n edton and a new character s re-wrtten n the same poston. Prmtve segments n one lne are ordered from left to rght accordng to the left boundary. For multple lnes, we use a smple rule to sort segments correctly. For segments that are not n the same lne wth the new segment s m + 1 (as the condton w > 2* lnehe OR h > 2* lnehe n Algorthm 1), reorderng s not needed. From segments whch are n the same lne wth s m + 1, we choose the segment whch s nearest to s m + 1 and left to s m + 1, and place s m + 1 mmedately after ths chosen segment. Fgure 4. Example of segment sequence nserted a new stroke. 4.4 Generatng new canddate characters On sortng the prmtve segments, generaton of canddate characters s straghtforward. Fgure 4 shows examples of new canddate characters. The segment wth red frame ndcates the one updated or formed by a new stroke, and the blue frame embraces the canddate characters that start from or end at the red segment. In ths example, the maxmum number of segments composng a canddate character s set as 3 for convenence. Lne 1 Lne 2 S1 S2 S3 S4 S5 S6 S7 S8 S9 S10 Fgure 5. Examples of new canddate characters. The generaton of canddate characters s subject to some heurstc rules for reducng the number of canddate characters whle guaranteeng ncludng true characters: a) The number of segments n a character does not exceed a maxmum number (6 n our case). b) Segments n dfferent lnes are not combned to canddate character. c) Canddate characters wth wdth large than a threshold ( 3*lneHe n our case) are pruned. d) Two successve segments wth horzontal dstance larger than a threshold ( 2*lneHe n our case) are not allowed to be merged. The newly generated canddate characters and ther canddate classes as well as classfcaton scores are added to the canddate segmentaton-recognton lattce.
5 5. Experments To justfy the flexblty of the proposed real-tme recognton approach, we have done prelmnary experments on a tablet PC. We used a character classfer and a character-level b-gram language model for path evaluaton of canddate lattce. The ncorporaton of geometrc context n the future s expected to mprove the recognton performance. The character classfer used n the system s an modfed quadratc dscrmnant functon (MQDF) classfer [10]. Each canddate character pattern s represented as 512D feature vector by trajectory-based moment normalzaton and local drecton hstogram feature extracton [11]. The feature dmensonalty s reduced from 512 to 160 by Fsher lnear dscrmnant analyss (LDA). The classfer was traned on a publcly avalable dataset of onlne handwrtten Chnese characters: CASIA-OLHWDB1 1 [12]. In the path evaluaton crteron (1), the weghts of language model λ 1 and character classfer λ 2 were emprcally set as 0.95 and 0.05, respectvely. We set the maxmum number of segments n a canddate character as 6, and the number of canddate classes n character classfcaton as 8. segmentaton-recognton lattce. From the trajectores of 化 and 研 n the thrd row of pctures, we can see that the dstance between two characters s smaller than that between the two radcals of 研, but the characters are stll segmented and recognzed correctly. Ths justfes the advantage of the ntegrated segmentaton-recognton framework. Fgure 7. Wrtng process and recognton results. To demonstrate more advantages of sentence-based nput over character-based nput, we show the canddate classes of the character 究 n Fgure 8. In the 8 canddate classes, the truth class of 究 ranks the ffth rather than the frst, but correct class s selected automatcally n sentence recognton due to the context. Specfcally, the b-gram 研究 s much more probable than the one 研乞. Obvously, by character-based nput, the character 究 s ms-recognzed, and needs human nteracton to select the correct class. Fgure 6. Interface of the recognton system. Fgure 6 shows the nterface of our recognton system, where the left sub-wndow dsplays the trajectores of handwrtng and the boundares of character segmentaton after sentence recognton, and the rght sub-wndow gves the text of sentence recognton result. Fgure 7 shows the wrtng process and ntermedate recognton results of a sentence. Whenever the pen lft tme s long enough, the partal sentence recognton result s gven by path search n the canddate 1 The database CASIA-OLHWDB1 was recently renamed as CASIA-OLHWDB1.0. Fgure 8. Canddate classes of a character. 6. Concluson and Future Works To fulfll the needs of the steadly expandng applcatons of sentence-based nput of handwrtten
6 characters, ths paper proposes an approach to real-tme recognton of Chnese handwrtten sentences. The man feature of the approach s a dynamcally mantaned segmentaton-recognton canddate lattce. The generaton and recognton of canddate characters, whch consume the majorty of computng, are performed durng the wrtng process. Thus, the sentence recognton result can be obtaned mmedately after the completon of wrtng or at a long-tme pen lft. Our prelmnary experments demonstrated the promse of the proposed approach. To make the system accepted by end users, more efforts are needed to mprove the recognton performance and edtng capablty. For segmentaton and recognton, we need to elaborate the procedures of text lne segmentaton, lne heght estmaton, prmtve segment updatng and sortng, and canddate character generaton rules. The path evaluaton crteron needs to ncorporate geometrc context as well as the language model and character classfcaton scores. The combnng weghts need to be optmzed usng a dscrmnatve tranng framework such as condtonal random feld (CRF) [6]. For applcaton on hand-held devces such as moble phones, low-complexty classfers should replace the MQDF for character classfcaton. The sentence recognton performance needs to be evaluated quanttatvely on a handwrtng dataset. The nearest prototype classfer can be a good choce [13][14]. The mplementaton of language assocaton module would vastly promote the text nput effcency, because many characters can be nput automatcally wthout wrtng. Acknowledgements Ths work s supported by the Natonal Natural Scence Foundaton of Chna (NSFC) under grants no , no and no A patent based on ths work has been documented and s pendng for grantng. References [1] C.-L. Lu, S. Jaeger, and M. Nakagawa, Onlne handwrtten Chnese character recognton: The state of the art, IEEE Trans. Pattern Analyss and Machne Intellgence, vol. 26, no. 2, pp , [2] H. Murase, Onlne recognton of free-format Japanese handwrtngs, Proc. 9th ICPR, 1988, Vol.2, pp [3] M. Nakagawa, B. Zhu, and M. Onuma, A model of on-lne handwrtten Japanese text recognton free from lne drecton and wrtng format constrants, IEICE Trans. Informaton and Systems, vol.e88-d, no.8, pp , [4] X.-D. Zhou, J.-L. Yu, C.-L. Lu, T. Nagasak, and K. Marukawa, Onlne handwrtten Japanese character strng recognton ncorporatng geometrc context, Proc. 10th ICDAR, 2007, Curtba, Brazl, pp [5] B. Zhu, X.-D. Zhou, C.-L. Lu, and M. Nakagawa, A robust model for on-lne handwrtten Japanese text recognton, Document Recognton and Retreval XVI (DRR), 2009, San Jose, USA, pp [6] X.-D. Zhou, C.-L. Lu, and M. Nakagawa, Onlne handwrtten Japanese character strng recognton usng condtonal random felds, Proc. 11th ICDAR, 2009, Barcelona, Span, pp [7] X.-D. Zhou, Methods for Onlne Handwrtten Japanese Document Analyss (In Chnese), PhD thess, Insttute of Automaton, Chnese Academy of Scences, Bejng, Chna, [8] M. Cheret, N. Kharma, C.-L. Lu, and C.Y. Suen, Character Recognton Systems: A Gude for Students and Practtoners, John Wley & Sons, [9] J.-L. Yu, X.-D. Zhou, and C.-L. Lu, Path search strateges for handwrtten character strng recognton, Chnese Journal of Pattern Recognton and Artfcal Intellgence, vol.22, no.2, pp , [10] F. Kmura, K. Takashna, S. Tsuruoka, and Y. Myake, Modfed quadratc dscrmnant functons and the applcaton to Chnese character recognton, IEEE Trans. Pattern Analyss and Machne Intellgence, vol.9, no.1, pp , [11] C.-L. Lu and X.-D. Zhou, Onlne Japanese character recognton usng trajectory-based normalzaton and drecton feature extracton, Proc. 10th IWFHR, 2006, La Baul, France, pp [12] D.-H. Wang, C.-L. Lu, J.-L. Yu, and X.-D. Zhou, CASIA-OLHWDB1: A database of onlne handwrtten Chnese characters, Proc. 10th ICDAR, 2009, Barcelona, Span, pp [13] C.-L. Lu, One-vs-all tranng of prototype classfer for pattern classfcaton and retreval, Proc. 20th ICPR, 2010, Istanbul, Turkey, pp [14] H. Zhang, D.-H. Wang, and C.-L. Lu, Keyword spottng from onlne Chnese handwrtten documents usng One-Vs-All traned character classfer, Proc. 12th ICFHR, 2010, Kolkata, Inda.
An Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationAn Empirical Comparative Study of Online Handwriting Chinese Character Recognition:Simplified v.s.traditional
2013 12th Internatonal Conference on Document Analyss and Recognton An Emprcal Comparatve Study of Onlne Handwrtng Chnese Recognton:Smplfed v.s.tradtonal Yan Gao, Lanwen Jn +, Wexn Yang School of Electronc
More informationAccumulated-Recognition-Rate Normalization for Combining Multiple On/Off-Line Japanese Character Classifiers Tested on a Large Database
4 th Internatonal Workshop on Multple Classfer Systems (MCS23) Guldford, UK Accumulated-Recognton-Rate Normalzaton for Combnng Multple On/Off-Lne Japanese Character Classfers Tested on a Large Database
More informationth International Conference on Document Analysis and Recognition
2013 12th Internatonal Conference on Document Analyss and Recognton Onlne Handwrtten Cursve Word Recognton Usng Segmentaton-free n Combnaton wth P2DBM-MQDF Blan Zhu 1, Art Shvram 2, Srrangaraj Setlur 2,
More informationIncremental MQDF Learning for Writer Adaptive Handwriting Recognition 1
200 2th Internatonal Conference on Fronters n Handwrtng Recognton Incremental MQDF Learnng for Wrter Adaptve Handwrtng Recognton Ka Dng, Lanwen Jn * School of Electronc and Informaton Engneerng, South
More informationOnline Handwritten Cursive Word Recognition Using Segmentation-free and Segmentation-based Methods
3th Asan Conference on Pattern Recognton (ACPR2015), November 3-6, 2015, Kuala Lumpur, Malasa. Onlne Handwrtten Cursve Word Recognton Usng Segmentaton-free and Segmentaton-based Methods Blan Zhua, Art
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationShape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram
Shape Representaton Robust to the Sketchng Order Usng Dstance Map and Drecton Hstogram Department of Computer Scence Yonse Unversty Kwon Yun CONTENTS Revew Topc Proposed Method System Overvew Sketch Normalzaton
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
More informationSegmentation Based Online Word Recognition: A Conditional Random Field Driven Beam Search Strategy
2013 12th Internatonal Conference on Document Analyss and Recognton Segmentaton Based Onlne Word Recognton: A Condtonal Random Feld Drven Beam Search Strategy Art Shvram 1, Blan Zhu 2, Srrangaraj Setlur
More informationSorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions
Sortng Revew Introducton to Algorthms Qucksort CSE 680 Prof. Roger Crawfs Inserton Sort T(n) = Θ(n 2 ) In-place Merge Sort T(n) = Θ(n lg(n)) Not n-place Selecton Sort (from homework) T(n) = Θ(n 2 ) In-place
More informationBAYESIAN MULTI-SOURCE DOMAIN ADAPTATION
BAYESIAN MULTI-SOURCE DOMAIN ADAPTATION SHI-LIANG SUN, HONG-LEI SHI Department of Computer Scence and Technology, East Chna Normal Unversty 500 Dongchuan Road, Shangha 200241, P. R. Chna E-MAIL: slsun@cs.ecnu.edu.cn,
More informationClassifying Acoustic Transient Signals Using Artificial Intelligence
Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationA PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION
1 THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Seres A, OF THE ROMANIAN ACADEMY Volume 4, Number 2/2003, pp.000-000 A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION Tudor BARBU Insttute
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More informationCorner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity
Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent
More informationCS1100 Introduction to Programming
Factoral (n) Recursve Program fact(n) = n*fact(n-) CS00 Introducton to Programmng Recurson and Sortng Madhu Mutyam Department of Computer Scence and Engneerng Indan Insttute of Technology Madras nt fact
More informationA Gradient Difference based Technique for Video Text Detection
A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng, Natonal Unversty of Sngapore {shva, phanquyt, tancl }@comp.nus.edu.sg
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationA Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems
A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty
More informationA Gradient Difference based Technique for Video Text Detection
2009 10th Internatonal Conference on Document Analyss and Recognton A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng,
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationPRÉSENTATIONS DE PROJETS
PRÉSENTATIONS DE PROJETS Rex Onlne (V. Atanasu) What s Rex? Rex s an onlne browser for collectons of wrtten documents [1]. Asde ths core functon t has however many other applcatons that make t nterestng
More informationBackpropagation: In Search of Performance Parameters
Bacpropagaton: In Search of Performance Parameters ANIL KUMAR ENUMULAPALLY, LINGGUO BU, and KHOSROW KAIKHAH, Ph.D. Computer Scence Department Texas State Unversty-San Marcos San Marcos, TX-78666 USA ae049@txstate.edu,
More informationSHAPE RECOGNITION METHOD BASED ON THE k-nearest NEIGHBOR RULE
SHAPE RECOGNITION METHOD BASED ON THE k-nearest NEIGHBOR RULE Dorna Purcaru Faculty of Automaton, Computers and Electroncs Unersty of Craoa 13 Al. I. Cuza Street, Craoa RO-1100 ROMANIA E-mal: dpurcaru@electroncs.uc.ro
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationNetwork Intrusion Detection Based on PSO-SVM
TELKOMNIKA Indonesan Journal of Electrcal Engneerng Vol.1, No., February 014, pp. 150 ~ 1508 DOI: http://dx.do.org/10.11591/telkomnka.v1.386 150 Network Intruson Detecton Based on PSO-SVM Changsheng Xang*
More informationSequential search. Building Java Programs Chapter 13. Sequential search. Sequential search
Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to
More informationUB at GeoCLEF Department of Geography Abstract
UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department
More informationA MODEL-BASED BOOK BOUNDARY DETECTION TECHNIQUE FOR BOOKSHELF IMAGE ANALYSIS
A MODEL-BASED BOOK BOUNDARY DETECTION TECHNIQUE FOR BOOKSHELF IMAGE ANALYSIS Ej TAIRA, Sech UCHIDA, Hroak SAKOE Graduate School of Informaton Scence and Electrcal Engneerng, Kyushu Unversty Faculty of
More informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationOutline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1
4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:
More informationForeground and Background Information in an HMM-based Method for Recognition of Isolated Characters and Numeral Strings
Foreground and Background Informaton n an HMM-based Method for Recognton of Isolated Characters and Numeral Strngs Alceu de S. Brtto Jr a,b, Robert Sabourn c,d, Flavo Bortolozz a,chng Y. Suen d a Pontfíca
More informationOracle Database: SQL and PL/SQL Fundamentals Certification Course
Oracle Database: SQL and PL/SQL Fundamentals Certfcaton Course 1 Duraton: 5 Days (30 hours) What you wll learn: Ths Oracle Database: SQL and PL/SQL Fundamentals tranng delvers the fundamentals of SQL and
More informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationThe Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole
Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng
More informationFeature Kernel Functions: Improving SVMs Using High-level Knowledge
Feature Kernel Functons: Improvng SVMs Usng Hgh-level Knowledge Qang Sun, Gerald DeJong Department of Computer Scence, Unversty of Illnos at Urbana-Champagn qangsun@uuc.edu, dejong@cs.uuc.edu Abstract
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationCorrelative features for the classification of textural images
Correlatve features for the classfcaton of textural mages M A Turkova 1 and A V Gadel 1, 1 Samara Natonal Research Unversty, Moskovskoe Shosse 34, Samara, Russa, 443086 Image Processng Systems Insttute
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More informationAssembler. Building a Modern Computer From First Principles.
Assembler Buldng a Modern Computer From Frst Prncples www.nand2tetrs.org Elements of Computng Systems, Nsan & Schocken, MIT Press, www.nand2tetrs.org, Chapter 6: Assembler slde Where we are at: Human Thought
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationEmpirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap
Int. Journal of Math. Analyss, Vol. 8, 4, no. 5, 7-7 HIKARI Ltd, www.m-hkar.com http://dx.do.org/.988/jma.4.494 Emprcal Dstrbutons of Parameter Estmates n Bnary Logstc Regresson Usng Bootstrap Anwar Ftranto*
More informationHigh-Boost Mesh Filtering for 3-D Shape Enhancement
Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,
More informationOnline Character Segmentation Method for Unconstrained Handwriting Strings Using Off-stroke Features
Onlne Character Segmentaton Method for Unconstraned Handwrtng Strngs Usng Off-stroke Features Naohro Furukawa, Junko Tokuno, Hsash Ikeda To cte ths verson: Naohro Furukawa, Junko Tokuno, Hsash Ikeda. Onlne
More informationFace Recognition University at Buffalo CSE666 Lecture Slides Resources:
Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural
More informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationMachine Learning 9. week
Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below
More informationDetection of an Object by using Principal Component Analysis
Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,
More informationSURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB
SURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB V. Hotař, A. Hotař Techncal Unversty of Lberec, Department of Glass Producng Machnes and Robotcs, Department of Materal
More informationThe Shortest Path of Touring Lines given in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He
More informationThe Research of Support Vector Machine in Agricultural Data Classification
The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationHuman Face Recognition Using Generalized. Kernel Fisher Discriminant
Human Face Recognton Usng Generalzed Kernel Fsher Dscrmnant ng-yu Sun,2 De-Shuang Huang Ln Guo. Insttute of Intellgent Machnes, Chnese Academy of Scences, P.O.ox 30, Hefe, Anhu, Chna. 2. Department of
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationAnalysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD
Analyss on the Workspace of Sx-degrees-of-freedom Industral Robot Based on AutoCAD Jn-quan L 1, Ru Zhang 1,a, Fang Cu 1, Q Guan 1 and Yang Zhang 1 1 School of Automaton, Bejng Unversty of Posts and Telecommuncatons,
More informationCombining Multiple Resources, Evidence and Criteria for Genomic Information Retrieval
Combnng Multple Resources, Evdence and Crtera for Genomc Informaton Retreval Luo S 1, Je Lu 2 and Jame Callan 2 1 Department of Computer Scence, Purdue Unversty, West Lafayette, IN 47907, USA ls@cs.purdue.edu
More informationDesign of Structure Optimization with APDL
Desgn of Structure Optmzaton wth APDL Yanyun School of Cvl Engneerng and Archtecture, East Chna Jaotong Unversty Nanchang 330013 Chna Abstract In ths paper, the desgn process of structure optmzaton wth
More informationJapanese Dependency Analysis Based on Improved SVM and KNN
Proceedngs of the 7th WSEAS Internatonal Conference on Smulaton, Modellng and Optmzaton, Bejng, Chna, September 15-17, 2007 140 Japanese Dependency Analyss Based on Improved SVM and KNN ZHOU HUIWEI and
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationQuerying by sketch geographical databases. Yu Han 1, a *
4th Internatonal Conference on Sensors, Measurement and Intellgent Materals (ICSMIM 2015) Queryng by sketch geographcal databases Yu Han 1, a * 1 Department of Basc Courses, Shenyang Insttute of Artllery,
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationIntroduction to Geometrical Optics - a 2D ray tracing Excel model for spherical mirrors - Part 2
Introducton to Geometrcal Optcs - a D ra tracng Ecel model for sphercal mrrors - Part b George ungu - Ths s a tutoral eplanng the creaton of an eact D ra tracng model for both sphercal concave and sphercal
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationOn Supporting Identification in a Hand-Based Biometric Framework
On Supportng Identfcaton n a Hand-Based Bometrc Framework Pe-Fang Guo 1, Prabr Bhattacharya 2, and Nawwaf Kharma 1 1 Electrcal & Computer Engneerng, Concorda Unversty, 1455 de Masonneuve Blvd., Montreal,
More informationWriter Identification using a Deep Neural Network
Wrter Identfcaton usng a Deep Neural Network Jun Chu and Sargur Srhar Department of Computer Scence and Engneerng Unversty at Buffalo, The State Unversty of New York Buffalo, NY 1469, USA {jchu6, srhar}@buffalo.edu
More informationFace Detection with Deep Learning
Face Detecton wth Deep Learnng Yu Shen Yus122@ucsd.edu A13227146 Kuan-We Chen kuc010@ucsd.edu A99045121 Yzhou Hao y3hao@ucsd.edu A98017773 Mn Hsuan Wu mhwu@ucsd.edu A92424998 Abstract The project here
More informationSignature and Lexicon Pruning Techniques
Sgnature and Lexcon Prunng Technques Srnvas Palla, Hansheng Le, Venu Govndaraju Centre for Unfed Bometrcs and Sensors Unversty at Buffalo {spalla2, hle, govnd}@cedar.buffalo.edu Abstract Handwrtten word
More informationRECOGNIZING GENDER THROUGH FACIAL IMAGE USING SUPPORT VECTOR MACHINE
Journal of Theoretcal and Appled Informaton Technology 30 th June 06. Vol.88. No.3 005-06 JATIT & LLS. All rghts reserved. ISSN: 99-8645 www.jatt.org E-ISSN: 87-395 RECOGNIZING GENDER THROUGH FACIAL IMAGE
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationObject-Based Techniques for Image Retrieval
54 Zhang, Gao, & Luo Chapter VII Object-Based Technques for Image Retreval Y. J. Zhang, Tsnghua Unversty, Chna Y. Y. Gao, Tsnghua Unversty, Chna Y. Luo, Tsnghua Unversty, Chna ABSTRACT To overcome the
More informationHarvard University CS 101 Fall 2005, Shimon Schocken. Assembler. Elements of Computing Systems 1 Assembler (Ch. 6)
Harvard Unversty CS 101 Fall 2005, Shmon Schocken Assembler Elements of Computng Systems 1 Assembler (Ch. 6) Why care about assemblers? Because Assemblers employ some nfty trcks Assemblers are the frst
More informationCOMPARISON OF SUPPORT VECTOR MACHINE AND NEURAL NETWORK IN CHARACTER LEVEL DISCRIMINANT TRAINING FOR ONLINE WORD RECOGNITION
COMPARISON OF SUPPORT VECTOR MACHINE AND NEURAL NETWORK IN CHARACTER LEVEL DISCRIMINANT TRAINING FOR ONLINE WORD RECOGNITION Abdul Rahm Ahmad 1 Chrstan Vard-Gaudn 3 Marzuk Khald 2 Emle Posson 3 1 Unverst
More informationVFH*: Local Obstacle Avoidance with Look-Ahead Verification
2000 IEEE Internatonal Conference on Robotcs and Automaton, San Francsco, CA, Aprl 24-28, 2000, pp. 2505-25 VFH*: Local Obstacle Avodance wth Look-Ahead Verfcaton Iwan Ulrch and Johann Borensten The Unversty
More informationBOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET
1 BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET TZU-CHENG CHUANG School of Electrcal and Computer Engneerng, Purdue Unversty, West Lafayette, Indana 47907 SAUL B. GELFAND School
More informationA high precision collaborative vision measurement of gear chamfering profile
Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) A hgh precson collaboratve vson measurement of gear chamferng profle Conglng Zhou, a, Zengpu Xu, b, Chunmng
More informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
More informationPruning Training Corpus to Speedup Text Classification 1
Prunng Tranng Corpus to Speedup Text Classfcaton Jhong Guan and Shugeng Zhou School of Computer Scence, Wuhan Unversty, Wuhan, 430079, Chna hguan@wtusm.edu.cn State Key Lab of Software Engneerng, Wuhan
More informationAn Image Fusion Approach Based on Segmentation Region
Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua
More informationA New Feature of Uniformity of Image Texture Directions Coinciding with the Human Eyes Perception 1
A New Feature of Unformty of Image Texture Drectons Concdng wth the Human Eyes Percepton Xng-Jan He, De-Shuang Huang, Yue Zhang, Tat-Mng Lo 2, and Mchael R. Lyu 3 Intellgent Computng Lab, Insttute of Intellgent
More informationControl strategies for network efficiency and resilience with route choice
Control strateges for networ effcency and reslence wth route choce Andy Chow Ru Sha Centre for Transport Studes Unversty College London, UK Centralsed strateges UK 1 Centralsed strateges Some effectve
More information