A HOPFIED NEURAL NETWORK ALGORITHM FOR AUTOMATED NAME PLACEMENT FOR POINT FEATURE
|
|
- Chester Whitehead
- 5 years ago
- Views:
Transcription
1 A HOPFIED NEURAL NETWORK ALGORITHM FOR AUTOMATED NAME PLACEMENT FOR POINT FEATURE Fan Hong Zhang zuxun Du Daosheng The State key Lab. of,wtusm,39 Luoyu Road,Wuhan,Chna, Tel: , Fax: KEY WORDS: Hopfeld neural network, Energy functon, Map name placement. ABSTRACT Ths paper presents a method of addng label to the map especally for the pont feature. Ths method overcomes the shortcomng of tradtonal methods eg. Conflct-backtrackng method. Its kernel algorthm use the hopfleld neural network to fnd the best label poston for pont feature. The expermental results proves that ths algorthm has good permanence and hgh speed. PREFACE Map name s an mportant component of the map, whether labels n place or not plays an mportant role on the readablty and usefulness of a map. Thus far, the placement of cartographc names has been a manual process whch takes plenty of tme and energy. More recently, many dfferent algorthms have been developed to ad ths process. Among them are the prortes suggested by Yoel[Yoel,97] for the placement of names for pont feature, the nteger programmng s desgned for the placement of names for pont and lnear feature[zoraster, 986] and an expert system approach for dense-map name placement[doerschler, 989]. Yet the automaton of name placement has proved dffcult to be mplemented successfully. Because an automated name-placement system must select names from scalendependent databases and place them n a manner acceptably smlar to that of a traned cartographer. Latest research shows that the kernel problem of map name placement s a NP-hard problem, one way to solve ths problem s to try some way to decrease the complexty or mprove the effcency of problem n order to fnd the near-optmal poston n the user-tolerable tme. Ths paper regards ths problem of map name placement as a typcal combnatoral-optmal problem and propose to makes use of the neural network methods to fnd the best name poston of local or global for each map resdent feature. Compared wth those of the tradtonal conflct-trackng methods, ths method through experment turns out to be better and more effcent. EXPERIMENTAL DATA Our expermental data comes from the :5 Natonal Base Map Database and comprses 3 topographcal map sheets that are stored n the vector format of ARC/INFO. The map-no of the three maps are respectvely H-48-[0],H-48-[3] and H-48-[4], each of whch s stored nto 6 layers that nclude hydrogen, roads, vegetaton and admnstratve boundary. These data contan both the spatal features n the form of dgtal map and the attrbutes nformaton such as map name and the feature code n terms of the natonal standard encodng of geographc feature by whch we can easly dscern label attrbutes such as sze, style and spacng etc. The 3 map sheets contan respectvely 35,65 and 734 resdent ponts. The area of these maps s near Chendu cty, the captal of the Schuan Provnce n the west chna and s well-known for ts dense-populaton. Because map name placement n a dense map s more dffcult than n a sparse map, these 3 maps among our experment data can well serve as good representatves. 6 Internatonal Archves of Photogrammetry and Remote Sensng. Vol. XXXIII, Part B4. Amsterdam 000.
2 3 NAME PLACEMENT PRINCIPLE FOR POINT FEATURE Map features can be categorzed nto ponts, lnes and polygons n terms of ther spatal dstrbuton, and name placement of the three knds of geographc features wll conform to dfferent cartographc conventons. However, after studyng varous knds of maps and labelng procedures, we fnd the followng prncples s n common adaptable. () belong to prncple Label should refer unambguously to ts ntended referent feature. Namely the relaton of the label and the referent feature should be easly recognzed but not be confused wth the other nearby labels and other geographc feature. () avodng off prncple The label name should make away for mportant geographc features, but not overlap mportant features, especally the features or labels of the same color. (3) accustomed to prncple The character poston character order or so on should accord wth the readng custom of the readers. To Chnese readers readng permts some flexblty, not rgdly adherng to a left-to-rght scannng of words. Both vertcal and horzontal algnments are commonly used. The pont name placement algorthm s used to dentfy pont feature depcted by pctoral symbols. The pont symbol s centered on a sngle coordnate. Accordng to both the prncple of the above mentoned and the partcularty of the pont feature, the prncple sutable for pont feature was gven as follows. ()Accordng to the map-makng regulatons of :50000 topographc of the People s Republc of Chna, the procedure for automated name placement s developed. One of the eght ranked postons surroundng a feature symbol wth referencng fxed postonal weght s used to place a pont feature label. In order of preference, these postons are : to the rght of the symbol,above,to the left, below, above and to the rght, above and to the left,below and to the left, below and to the rght, showed n Fgure.Poston wth hgher weghts are preferred over postons wth lower weghts. ()Pont label should not overlap the placed label and any pont feature. (3)Pont label should not overlap the mportant lnear feature of the same color such as ralways and maor roads etc, Whle overlap s unavodable, efforts should be made to decrease t. (4)labels and labels must not overlap each other Fgure. Ranked label postons for pont feature (5)Label name and the referent features had better locate n the same sde of the nearby lnear feature and label name can not overlap boundary. 4 THE SOLUTION TO THE AUTOMATED NAME PLACEMENT FOR RESIDENT FEATURE Pont feature nvolves resdent flag pont and elevaton pont etc., among whch resdent s representatve for ts largest number and hghest densty, Accordng to the prncple of name placement for pont feature mentoned above, the followng strateges are taken to automate name placement for resdent of topographcal map. The total solutons contan the followng 3 stages: step : coarsely choose the canddate poston and determne the optmal level for every poston. Internatonal Archves of Photogrammetry and Remote Sensng. Vol. XXXIII, Part B4. Amsterdam
3 Frst of all, 8 avalable poston for every resdent are chosen, showed n Fgure, through evaluaton of readablty and belong to relatons of the 8 postons, a weght factor s gven for every possble poston and detaled method s depcted as follow. The weght of the canddate poston s the functon of the prmary weght and the secondary weght, that s : weght = the prmary weght * the secondary weght Specfy a basc weght from.0 to 0.93 correspondng to the prorty from hgh to low. Use a rectangle area to represent the area that a label name occupes and udge f the area wll overlap the mportant feature such as ralway, maor road and mnor road. Dfferent secondary weght factor s assgned accordngly. For example, f the label rectangle of one feature overlaps wth a ralway or a maor road, accordng to the extent of overlap, ts secondary weght should be assgned to 0., 0., 0.3 or 0.4 respectvely; In order to control overlap wth the mnor road, the secondary weght of 0.5,0.5,0.53 should be assgned for dfferent extent of overlap. Judge whether the label and the referent feature appears on the same sde of the boundary and whether the label overlap wth the boundary, To handle ths case, an approprate secondary factor should be desgnated. Step : construct a hopfeld network, set the ntal value for t and make t run. If necessary, make the network run many tmes, observe ts convergence, select the best results and record t. Step 3: after takng the prevous steps, local optmal processng s made so as to resolve the remanng conflcts between the resdents labels. Few remaned conflcts that have not yet been resolved n the end, wll be adusted and revsed manually. The core of the whole algorthm s step, that s to use hopfeld network to fnd the best local or global label poston for every resdent on topographcal map. Ths hopfeld approach runs the network n an teratve way that wll converge very fast avodng of many tmes backtrackng and the nested backtrackng of the tradtonal method, whch wll, as a result, mproves the effcency of the search algorthm. 5 THE ALGORITHM OF THE HOPFIELD NEURAL NETWORK TO FIND THE BEST LABEL POSITION FOR RESIDENT Hopfeld neural network s a one-level of feedback network, Let N, N, Nn stand for the n neural unt, W stands for the connecton weght from N to N. If we use W to represent the connecton strength between the n nodes, Hopfeld s symmetrc, then: W = W, {,, 3... n } For the contnung feedback network, when the network s workng, the relaton between the nput and the output can be represented n terms of the followng status equaton, among whch, g( ) s a contnung monotony ascendng functon wth up lmt, among whch sgmond or hyperbolc tangent functon most commonly used, U represents the nput of the neural unt, V represents the output of the neural unt I, I represents the bas of the neural network namely the stmulus comng from the external world. C du u = + WV + I dt t V = g( U ) If the evoluton of the equaton takes the asynchronous way, at any tme, only one status of one neural unt wll be changed. Suppose U(t) stands for the sum of all the nputs of the neural unt at the tme of t, V(t+) stands for the output status of ths neural unt at the tme of t+,then: U () t = W V () t + I V ( t+ ) = g( U ( t)) = g( W V ( t) + I ( t)) 64 Internatonal Archves of Photogrammetry and Remote Sensng. Vol. XXXIII, Part B4. Amsterdam 000.
4 For the hopfeld network, the Lyapunov energy functon wll take the followng form: n n n E = TVV VI = = = U () t = W V () t + I V ( t+ ) = g( U ( t)) = g( W V ( t) + I ( t)) n n n E = TVV VI = = = It has been proved that hopfeld network s a non-lnear moton system. There exsts one or more mnmum pont or balancng pont. At some tme, after the status of every neural unt s gven and the ntal network status s set up, the status of the network wll change n the drecton of energy gradually decreasng n the lght of the workng equaton, and n the end, approach or reach the balanced status of the network, whch s the mnmum pont of the energy. Ths s convergence of the energy of the hopfeld neural network. In ths way, whle the energy functon s converged to a mnmum pont, the best soluton for the problem wll be produced. The problem of fndng the best label poston for resdent feature can be regarded as a combnatoral optmal problem, A hypotheszed map contans m resdents, and every resdent has n canddate ponts(such as, n = 8, 6 ). There are m n canddate ponts, and these resdents wll be lsted as a matrx n whch n canddate label postons of one resdent wll be lned as one row, altogether there are m row * n column, as showed n table. Consderng ths table as a matrx of m rows * n columns, m stands for the number of the resdents, n stands for the canddate label poston for every resdent. If we correspond one canddate label poston to one neural unt, thus we can construct a hopfeld neural network that comprses m n neural unt. In order to defne the energy functon, we descrbe the problem as the the sum of constrant condton and the optmal goals as follows: 3 canddate label poston Resdent pont # # 3# 4# 5# 6# 7# 8# # # # # # Table canddate label poston for resdent Constrant condton: every resdent can choose only one label poston. The most optmal goal: the number of overlappng between two label rectangle area s the smallest. Accordng to the above constrant condton and the most optmal goal, we can gve out the energy functon of the network as follows. B E = V + A k l (,,, ) D k lvv Of the above equaton, the frst tem represents the constrant condton, and only one label poston s allowed for one resdent feature. When ths condton s met, the frst tem wll be equal to 0. The second tem s optmal goal, D(,,k,l) s specfed as follow: Internatonal Archves of Photogrammetry and Remote Sensng. Vol. XXXIII, Part B4. Amsterdam
5 (,, k, l) D = whenv 0 whenv,, V V overlap do not each over overlap each other Thus the second tem s the multpled number of the overlap between every two label rectangles, f the choce of label poston s the most optmal, E can reach the mnmum value, and f the choce of label poston s more optmal, E can reach the smaller value. By comparng the energy functon wth the standard energy functon, the connectng weght between unt and unt wll be determned as: ( ) T = AD,, k, l Bδ...( ) δ,,, = = 0 I = B...( ) Because W T,letW T,, =, then the runnng equaton wll be derved as follow:,, du dt V u = + ( AD(,, k, l) Bδ, ) V + B...( 3) τ ( ) = g u...( 4) Here we adopt sgmod functon as the I/O functon of the neural unt, and s the subscrpt,whch stands for the neural unt of th label poston of the th resdent. g(a) Fgure. sgmod functon g The detaled calculaton procedure and the teratve step are lsted below: ()The ntal value s set up n the lght of the above gudelne ()Calculate the output of every neural unt V ( t ) (3)Put V ( t ) 0 nto(),calculate du dt t t = 0 0 accordng to V g( u ) = (4)Accordng to equaton u ( t + t) = u ( t ) + t = t t, calculate u ( t t) (5)Return to step (). du dt of the next tme pont. 66 Internatonal Archves of Photogrammetry and Remote Sensng. Vol. XXXIII, Part B4. Amsterdam 000.
6 6 V EXPERIMENTAL RESULTS AND COCLUSION Experence of runnng the equaton shows that whle an approprate parameter and an approprate constant of the tme τ are specfed, the network wll converge normally to a satsfactory end status. Fgure 3. Results of automated name placement for resdent feature Our orgnal spatal data can not be drectly used n our algorthm. These map data must take preprocessng before beng avalable. The preprocessng operatons consst of the symbolzaton of map feature, the converson of vector feature to raster format, the codng of feature and the overlay of the raster maps. Besdes, raster spatal nformaton wll be wrtten nto dfferent bnary fles n terms of ther feature type. Meanwhle, the attrbute nformaton of the name wll be read out of the source fle and be wrtten nto a bnary fle to be easly used The label poston for the resdents, after 0 tmes of teraton of the neural network, we can reduce the conflct number The 3 maps comprse 35, 65 and 734 resdents features respectvely. Makng use of the above algorthm to fnd to 96, 97 and 3. After the local optmzaton and adustment, all conflcts are resolved, the runnng tme wll be respectvely 9, and 5 mnutes. The result s satsfactory. Fgure 3 shows the result of addng resdent label to h-48- [0] wth ths algorthm. The expermental results show that the neural network method can be used to solve the combnatoral optmal problem ncludng fndng the best label poston. Because the network can converge swftly, therefore complex problem wth combnatoral exploson danger can be converted to a smple problem, whch wll largely mprove the effcency of algorthm. The problems of name placement dffer sgnfcantly among the three categores. The approach to the placement of names for ponts s relatvely easer than lnear and areal features. In our experment, we merely consder resdent feature so that the problem can be smplfed. Now we are dong further research to make our algorthm more powerful so as to solve more problems and sut more cases. Internatonal Archves of Photogrammetry and Remote Sensng. Vol. XXXIII, Part B4. Amsterdam
7 REFERNENCES Hersch,S.A.,98, An Algorthm for Automatc Name Placement Around Pont Data. The Amercan Cartographer, vol 9., No., pp 5-7. Ann,J. And Freeman.H.,983, A Program for Automatc Name Placement, Proceedngs of Auto-Carto VI, Vol., pp Lee R.Ebnger and M. Goulette, 990, Non-nteractve Automated Names Placement for the 990 Decenal Census., cartography and Geographc Informaton systems, Vol. 7, No., pp Doerschler,J.,and H.Freeman,989, An Expert System for Dense-Map Name Placement.,Proceedngs of Auto-Carto 9,pp Steven Zoraster,986, Interger Programmng Appled to the Map Label Placement Problem., Cartographca, Vol.3, No.3, pp6-7. Cormely,R.G.,985, An LP Relaxaton Procedure for Annotaton Pont Feature Usng Interactve Graphcs. Proceedngs of Auto-Carto 7,pp Dacd S. Johnson, Umt Basoglu,989, The Use of Artfcal Intellgence n The Automated Placement of Cartographc Names, Proceedngs of Auto-Carto 9. Freeman,H., and J. Ahn,984, AUTOMAP: An Expert System for Automatc Map Name Placement.,Proceedngs of the Frst Internatonal Symposum on Spatal data Handlng, pp Marks J, Shebar S.,,99, The Computatonal Complexty of Cartographc Label placement, Techncal Report, Harvard Unversty. Yoel,P.,97, The logc of Automated Map Letterng.,The cartographc Journal, vol. 9,n.,pp James E. Mower,993, Automated Feature and Name Placement On Parallel Computers, Cartography and Geographc Informaton Systems, Vol.0, No., pp Zoraster,S.,99, Expert Systems and the Map Label Placement Problem. Cartographca, vol. 8, no., pp Internatonal Archves of Photogrammetry and Remote Sensng. Vol. XXXIII, Part B4. Amsterdam 000.
AN EFFICIENT AND ROBUST GENETIC ALGORITHM APPROACH FOR AUTOMATED MAP LABELING
AN EFFICIENT AND ROBUST GENETIC ALGORITHM APPROACH FOR AUTOMATED MAP LABELING Fan Hong * Lu Kaun 2 Zhang Zuxun Natonal Laboratory of Informaton Engneerng n Surveyng Mappng and Remote Sensng of Wuhan Unversty
More informationAN EFFICIENT GENETIC ALGORITHM AND ITS COMPARISON EXPERIMENT FOR AUTOMATIC MAP LABELING
AN FFICINT GNTIC ALGORITHM AND ITS COMPARISON XPRIMNT FOR AUTOMATIC MAP LABLING Fan Hong 1 Lu Kaun 2 Zhang Zuxun 1 (1 Natonal Laboratory of Informaton ngneerng n Surveyng, Mappng and Remote Sensng of Wuhan
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 informationAn 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 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 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 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 informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
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 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 informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationFast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
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 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 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 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 informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
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 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 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 informationLearning-Based Top-N Selection Query Evaluation over Relational Databases
Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **
More informationVISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
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 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 informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationUSING GRAPHING SKILLS
Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationA Saturation Binary Neural Network for Crossbar Switching Problem
A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com
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 informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More informationTPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints
TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process
More information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
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 informationAssignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
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 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 informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationOn Some Entertaining Applications of the Concept of Set in Computer Science Course
On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,
More informationRESEARCH ON EQUIVALNCE OF SPATIAL RELATIONS IN AUTOMATIC PROGRESSIVE CARTOGRAPHIC GENERALIZATION
RESEARCH ON EQUIVALNCE OF SPATIAL RELATIONS IN AUTOMATIC PROGRESSIVE CARTOGRAPHIC GENERALIZATION Guo Qngsheng Du Xaochu Wuhan Unversty Wuhan Unversty ABSTRCT: In automatc cartographc generalzaton, the
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 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 informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
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 informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
More informationAvailable online at Available online at Advanced in Control Engineering and Information Science
Avalable onlne at wwwscencedrectcom Avalable onlne at wwwscencedrectcom Proceda Proceda Engneerng Engneerng 00 (2011) 15000 000 (2011) 1642 1646 Proceda Engneerng wwwelsevercom/locate/proceda Advanced
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 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 informationBrave New World Pseudocode Reference
Brave New World Pseudocode Reference Pseudocode s a way to descrbe how to accomplsh tasks usng basc steps lke those a computer mght perform. In ths week s lab, you'll see how a form of pseudocode can be
More informationTECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.
TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of
More informationLS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract
12 th Internatonal LS-DYNA Users Conference Optmzaton(1) LS-TaSC Verson 2.1 Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2.1,
More informationON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE
Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton
More informationVectorization of Image Outlines Using Rational Spline and Genetic Algorithm
01 Internatonal Conference on Image, Vson and Computng (ICIVC 01) IPCSIT vol. 50 (01) (01) IACSIT Press, Sngapore DOI: 10.776/IPCSIT.01.V50.4 Vectorzaton of Image Outlnes Usng Ratonal Splne and Genetc
More informationMODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAXIMIZE PRODUCT VARIETY AND MINIMIZE FAMILY COST
INTERNATIONAL CONFERENCE ON ENGINEERING DESIGN, ICED 07 28-31 AUGUST 2007, CITE DES SCIENCES ET DE L'INDUSTRIE, PARIS, FRANCE MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAIMIZE PRODUCT VARIETY AND
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 informationPerformance Evaluation of Information Retrieval Systems
Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence
More informationSUMMARY... I TABLE OF CONTENTS...II INTRODUCTION...
Summary A follow-the-leader robot system s mplemented usng Dscrete-Event Supervsory Control methods. The system conssts of three robots, a leader and two followers. The dea s to get the two followers to
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 informationGreedy Technique - Definition
Greedy Technque Greedy Technque - Defnton The greedy method s a general algorthm desgn paradgm, bult on the follong elements: confguratons: dfferent choces, collectons, or values to fnd objectve functon:
More informationResearch and Application of Fingerprint Recognition Based on MATLAB
Send Orders for Reprnts to reprnts@benthamscence.ae The Open Automaton and Control Systems Journal, 205, 7, 07-07 Open Access Research and Applcaton of Fngerprnt Recognton Based on MATLAB Nng Lu* Department
More informationA NEW APPROACH FOR SUBWAY TUNNEL DEFORMATION MONITORING: HIGH-RESOLUTION TERRESTRIAL LASER SCANNING
A NEW APPROACH FOR SUBWAY TUNNEL DEFORMATION MONITORING: HIGH-RESOLUTION TERRESTRIAL LASER SCANNING L Jan a, Wan Youchuan a,, Gao Xanjun a a School of Remote Sensng and Informaton Engneerng, Wuhan Unversty,129
More informationA Facet Generation Procedure. for solving 0/1 integer programs
A Facet Generaton Procedure for solvng 0/ nteger programs by Gyana R. Parja IBM Corporaton, Poughkeepse, NY 260 Radu Gaddov Emery Worldwde Arlnes, Vandala, Oho 45377 and Wlbert E. Wlhelm Teas A&M Unversty,
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 informationFace Recognition Method Based on Within-class Clustering SVM
Face Recognton Method Based on Wthn-class Clusterng SVM Yan Wu, Xao Yao and Yng Xa Department of Computer Scence and Engneerng Tong Unversty Shangha, Chna Abstract - A face recognton method based on Wthn-class
More information3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method
NICOGRAPH Internatonal 2012, pp. 114-119 3D Vrtual Eyeglass Frames Modelng from Multple Camera Image Data Based on the GFFD Deformaton Method Norak Tamura, Somsangouane Sngthemphone and Katsuhro Ktama
More informationChinese Word Segmentation based on the Improved Particle Swarm Optimization Neural Networks
Chnese Word Segmentaton based on the Improved Partcle Swarm Optmzaton Neural Networks Ja He Computatonal Intellgence Laboratory School of Computer Scence and Engneerng, UESTC Chengdu, Chna Department of
More informationStorage Binding in RTL synthesis
Storage Bndng n RTL synthess Pe Zhang Danel D. Gajsk Techncal Report ICS-0-37 August 0th, 200 Center for Embedded Computer Systems Department of Informaton and Computer Scence Unersty of Calforna, Irne
More informationAn Adjusted Recursive Operator Allocation Optimization Algorithm for Line Balancing Control
IAENG Internatonal Journal of Appled Maematcs, 36:1, IJAM_36_1_5 An Adusted ecursve Operator Allocaton Optmzaton Algorm for Lne Balancng Control B.L. ong, W.K. Wong, J. Fan, and.f. Chan 1 Abstract Ths
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More informationUnsupervised Learning
Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and
More informationTHE PATH PLANNING ALGORITHM AND SIMULATION FOR MOBILE ROBOT
Journal of Theoretcal and Appled Informaton Technology 30 th Aprl 013. Vol. 50 No.3 005-013 JATIT & LLS. All rghts reserved. ISSN: 199-8645 www.jatt.org E-ISSN: 1817-3195 THE PATH PLANNING ALGORITHM AND
More informationAP PHYSICS B 2008 SCORING GUIDELINES
AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for
More informationMeta-heuristics for Multidimensional Knapsack Problems
2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,
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 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 information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
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 informationConditional Speculative Decimal Addition*
Condtonal Speculatve Decmal Addton Alvaro Vazquez and Elsardo Antelo Dep. of Electronc and Computer Engneerng Unv. of Santago de Compostela, Span Ths work was supported n part by Xunta de Galca under grant
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 informationExercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005
Exercses (Part 4) Introducton to R UCLA/CCPR John Fox, February 2005 1. A challengng problem: Iterated weghted least squares (IWLS) s a standard method of fttng generalzed lnear models to data. As descrbed
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
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 informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
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 informationAn Approach in Coloring Semi-Regular Tilings on the Hyperbolic Plane
An Approach n Colorng Sem-Regular Tlngs on the Hyperbolc Plane Ma Louse Antonette N De Las Peñas, mlp@mathscmathadmueduph Glenn R Lago, glago@yahoocom Math Department, Ateneo de Manla Unversty, Loyola
More informationMultiblock method for database generation in finite element programs
Proc. of the 9th WSEAS Int. Conf. on Mathematcal Methods and Computatonal Technques n Electrcal Engneerng, Arcachon, October 13-15, 2007 53 Multblock method for database generaton n fnte element programs
More informationA Clustering Algorithm for Key Frame Extraction Based on Density Peak
Journal of Computer and Communcatons, 2018, 6, 118-128 http://www.scrp.org/ournal/cc ISSN Onlne: 2327-5227 ISSN Prnt: 2327-5219 A Clusterng Algorthm for Key Frame Extracton Based on Densty Peak Hong Zhao
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 informationNGPM -- A NSGA-II Program in Matlab
Verson 1.4 LIN Song Aerospace Structural Dynamcs Research Laboratory College of Astronautcs, Northwestern Polytechncal Unversty, Chna Emal: lsssswc@163.com 2011-07-26 Contents Contents... 1. Introducton...
More informationEVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS
Academc Research Internatonal ISS-L: 3-9553, ISS: 3-9944 Vol., o. 3, May 0 EVALUATIO OF THE PERFORMACES OF ARTIFICIAL BEE COLOY AD IVASIVE WEED OPTIMIZATIO ALGORITHMS O THE MODIFIED BECHMARK FUCTIOS Dlay
More informationVISUALIZING SCHEMATIC MAPS THROUGH GENERALIZATION BASED ON ADAPTIVE REGULAR SQUARE GRID MODEL
VISUALIZING SCHEMATIC MAPS THROUGH GENERALIZATION BASED ON ADAPTIVE REGULAR SQUARE GRID MODEL Dong Wehua a,b, *, Lu Jpng b, Guo Qngsheng c a Insttute of Geography and Remote Sensng, Beng rmal Unversty,
More informationBIN XIA et al: AN IMPROVED K-MEANS ALGORITHM BASED ON CLOUD PLATFORM FOR DATA MINING
An Improved K-means Algorthm based on Cloud Platform for Data Mnng Bn Xa *, Yan Lu 2. School of nformaton and management scence, Henan Agrcultural Unversty, Zhengzhou, Henan 450002, P.R. Chna 2. College
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 informationActive Contours/Snakes
Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng
More informationThe Theory and Application of an Adaptive Moving Least. Squares for Non-uniform Samples
Xanpng Huang, Qng Tan, Janfe Mao, L Jang, Ronghua Lang The Theory and Applcaton of an Adaptve Movng Least Squares for Non-unform Samples Xanpng Huang, Qng Tan, Janfe Mao*, L Jang, Ronghua Lang College
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationPrivate Information Retrieval (PIR)
2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market
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 information