Accessibility Analysis for the Automatic Contact and Non-contact Inspection on Coordinate Measuring Machines

Size: px
Start display at page:

Download "Accessibility Analysis for the Automatic Contact and Non-contact Inspection on Coordinate Measuring Machines"

Transcription

1 Proceedngs of the World Congress on Engneerng 008 Vol I Accessblty Analyss for the Automatc Contact and Non-contact Inspecton on Coordnate Measurng Machnes B. J. Álvarez, P. Fernández, J. C. Rco and G. Valño Abstract The am of ths paper s to determne the vald orentatons of the nspecton devces used n probe operatons and non-contact scannng operatons on a Coordnate Measurng Machne (CMM). The methodology appled s based on the accessblty analyss and the applcaton of ray-tracng technques. Ths analyss wll tae nto account the real shape and geometry of the nspecton devce and the constrants mposed by the CMM on whch t s mounted. Lewse, dfferent algorthms based on computer graphcs have been appled to speed up the searchng of vald orentatons. Index Terms Accessblty, CMM, nspecton, probe, laser strpe, scannng. I. INTRODUCTION Among the actvtes of an automatc process plannng system for nspecton on a Coordnate Measurng Machne (CMM), the determnaton of nspecton devce orentaton wth regard to the part stands out. These nspecton devce orentatons are obtaned from a methodology based on the accessblty analyss [1] and the applcaton of ray-tracng algorthms []. Moreover, dfferent computer graphcs technques le space parttonng and bac-face cullng have been appled n order to speed up the searchng of vald orentatons. The methodology has been appled to nspecton processes based on a touch-trgger probe [] and to non-contact scannng processes based on a laser strpe [4]. In both cases, dfferent constrants have been consdered: real shape and dmensons of the nspecton devces, process parameters and possble orentatons of the motorzed head of the CMM where the nspecton devce has been mounted. Ths motorzed head (PH10MQ) provdes 70 feasble orentaton of the nspecton devce by rotatng at a resoluton of 7.5º about both horzontal and vertcal axes (A, B). Manuscrpt receved March 18, 008. Ths wor s part of the results obtaned n a research project supported by the Spansh Educaton and Scence Mnstry (MEC-04-DPI ) and FEDER. B. J. Álvarez and P. Fernández have collaborated wth the Manufacturng Engneerng Department of the Unversty of Ovedo for developng the research project mentoned above (e-mal author: braulo@unov.es). J. C. Rco s a Professor (e-mal author: jcarlosr@unov.es). G. Valño s a Senor Lecturer (e-mal author: gvr@unov.es). The correspondng address for all authors s: Department of Manufacturng Engneerng, Unversty of Ovedo, Campus de Gjón, 0 Gjón, SPAIN. II. ANALYSIS METHODOLOGY The accessblty analyss for a touch-trgger probe deals wth determnng all the feasble probe orentatons that allow for performng the part nspecton avodng collsons wth the part or any other obstacle n the envronment of the nspecton process. Moreover, the vald orentatons of the non-contact scannng devce wll be obtaned to guarantee the vsblty of the surface to be scanned. The methodology appled n both cases wll be exactly the same. Frst, a local analyss wll be made for each part surface by tang nto account the nspecton devce as an nfnte half-lne whereas the possble nterferences wth the rest of part surfaces or any other obstacle are gnored. Hence, vald orentatons l wll be those whch mae an angle between 0 and π/ wth the normal vector n to the analyzed surface. In a second analyss stage, the orentatons obtaned n the local analyss wll be checed n order to determne f they have or not collson wth the rest of part surfaces or any other obstacle. Ths analyss s called global analyss and t s complex and expensve from a computatonal pont of vew because t nvolves the calculaton of multple nterferences tests. To mae ths calculaton easer, a STL model of the part s used, where each surface s dscretzed by a set of trangles. Thus the global accessblty analyss s reduced to determne f there exst nterferences between orentatons l obtaned n the local analyss and the trangles that compose the STL model of ether the part or the obstacle. Moreover, n order to further reduce the calculaton tme, dfferent computer graphcs technques le space parttonng based on d-tree, ray traversal algorthm, bac-face cullng and ray-trangle ntersecton tests have been also appled [5]. The use of space parttonng structures le d-trees allows for reducng the number of the trangles to test n the global analyss because t nvolves checng ntersecton exclusvely wth trangles whch can potentally be traversed by each nspecton devce orentaton. The part s parttoned n regons bounded by planes (boundng boxes) and each part trangle s assgned to the regon wthn whch t s located. Then, regons traversed by each nspecton devce orentaton are selected by means of the ray-traversal algorthm that was frst developed and appled by Kaplan []. Before checng ntersecton between each nspecton devce orentaton and all trangles ncluded n the traversed regons prevously determned, the number of ntersecton

2 Proceedngs of the World Congress on Engneerng 008 Vol I tests can be reduced even more by applyng a bac-face cullng algorthm [5]. Thus, from the ntal set of trangles ncluded n the traversed regons, a subset s extracted that do not nclude those trangles whose vsblty accordng to an analysed nspecton devce orentaton s completely bloced by other trangles. Fnally, the ntersecton test between each undscarded trangle and the nspecton devce orentaton l s carred out. The trangles of the STL format are defned by ts vertces V 0, V 1 and V and normal untary vector n. If the next equaton (Fg. 1) s satsfed: n l = 0 the orentaton l wll be parallel to the supportng plane of the trangle and therefore there wll be no ntersecton. If both the expresson (1) and the next condton are satsfed: n w = 0 then the nspecton devce orentaton l wll be contaned n the plane. In expresson () w s a vector wth orgn at vertex V 0 and end at pont P 0. When ths orentaton ntersects or concdes wth any of the trangle edges, then, ntersecton between devce orentaton and trangle occurs. If none of the prevous relatonshps s fulflled, then there s ntersecton between the nspecton devce orentaton l and the supportng plane of the trangle. The ntersecton pont P can be expressed as (Fg. 1): n w P = P0 l () n l Fnally, t s necessary to chec f ths pont P les nsde the trangle defned by the three vertces V 0, V 1 and V. Ths verfcaton s based on the algorthm developed by Möller and Trumbore [6]. The equaton of the supportng plane of the trangle V 0, V 1 and V can be expressed as: V(,) s t = V + s u+ t v 0 where u and v are two edge vectors of the trangle wth common orgn at V 0. A pont P located on the plane (4) wll be nsde the trangle f there exst values s 0 and t 0 π n V 0 w P 0 v l r u Fg. 1. Intersecton between laser beam l and a trangle facet V 0 V 1 V. P V V 1 (1) () (4) Column Head Machne Touch probe Stylus Tp (a) Touch-trgger probe Column Head Machne Adapter Head Laser (b) Laser strpe system Capsule Sphere Prsm Prsm Sphere Capsule Prsm Fg.. Components of the nspecton devce and ther smplfed models. that satsfes the next equaton: P V = s u+ t v 0 ( s + t 1 ) (5) If the pont les wthn the trangle then there wll be ntersecton and the analyss wll contnue wth another trangle. If there s stll no nterference, the orentaton wll be consdered as vald. III. INTERFERENCE ANALYSIS CONSIDERING REAL DIMENSIONS OF THE INSPECTION DEVICE The orentatons obtaned n prevous sectons are based on an deal representaton of the nspecton devce as an nfnte half-lne. To chec f these orentatons are really vald wll be necessary to tae nto account the real shape and dmensons of the nspecton devce. Therefore, ntersecton between trangles of the STL part model and each of the nspecton devce components must be checed. Fg. shows the components for each of the nspecton devces that have been consdered n ths wor: 1) Touch-trgger probe: column, head, touch probe, stylus and tp (Fg. a). ) Laser strpe system: column, machne head, adapter and laser head (Fg. b). The ntersecton analyss s speeded up by usng a smplfed model of each nspecton devce component (Fg. ). The column and laser head have been modelled by

3 Proceedngs of the World Congress on Engneerng 008 Vol I straght prsms, the machne head by a sphere and the laser adapter, touch probe and stylus by a capsule. Smlarly to secton, a d-tree algorthm has been mplemented n order to test exclusvely the nterference between each of the nspecton devce components and the trangles ncluded n the part regons that they traverse. To carry out ths tas effectvely, each nspecton devce component s enclosed n a boundng volume and only the part regons that overlap wth that volume are analysed. Then, ntersectons between part trangles ncluded n these regons and the component are checed. Snce several geometrcal shapes have been used to model the components of each nspecton devce, dfferent algorthms for checng ntersectons are appled: 1) Sphere-trangle ntersecton algorthm to analyse nterferences wth the machne head [7]. Ths algorthm smply calculates the mnmum dstance between a pont (sphere centre) and a trangle. If ths dstance s smaller than the radus of the sphere, ntersecton wll occur. ) Prsm-trangle ntersecton algorthm to analyse nterferences wth the column. Ths algorthm derves from the separatng axs theorem whch was ntally developed to determne f two convex polyhedral are dsjont [8]. The theorem states that two convex polyhedra, A and B, are dsjont f they can be separated along ether an axs parallel to a normal of a face of ether A or B, or along an axs formed from the cross product of an edge from A wth an edge from B. The applcaton of ths theorem to a prsm-trangle test nvolves checng ther relatve poston wth regard to dfferent potental separaton axes [9]. ) Capsule-trangle ntersecton algorthms to analyse nterferences wth the touch probe and the stylus-tp [10]. In ths case, ntersecton analyss s based on fndng the mnmum dstance between each edge of the trangle and the capsule lne segment, as well as the mnmum dstance between each extreme pont of the capsule segment and the trangle. If any of these dstances s smaller than the radus of the capsule, then ntersecton wll occur. IV. CLUSTERING From the prevous analyss, the nspecton devce orentatons that are vald for probng each pont or scannng each part trangle have been determned. These orentatons are mathematcally represented by means of a bnary matrx A ( qr, ) where each element corresponds to a combnaton of dscrete values of A and B angles: A ( q, r) 1 f (A = aq, B= br) s a vald orentaton for pont P = (6) 0 f (A = aq, B= br) s a not vald orentaton for pont P To reduce the process operaton tme related to devce orentaton changes, orentatons (a q, b r ) common to the greatest number of ponts to probe (clusters of ponts) or trangles to scan (clusters of trangles) must be found. The classfcaton of ponts or trangles contnues untl no ntersecton can be found between the fnal clusters º 18 Probe abstracted by a nfnte half-lne Head Head + Touch probe Head + Touch probe + Stylus and tp Head + Touch probe + Stylus and tp + Column P7 Part STL model P11 P1 P1 P10 P9 s19 s7 P P8 P7 P P5 P4 P6 P5 s9 P1 P11 P1 P16 P9 P6 P14 P P4 P10 P17 P1 P18 P15 P8 P7 P6 P4 P P5 P P1 P P8 Fg.. Accessblty map for the pont P4 on the surface s9.

4 Proceedngs of the World Congress on Engneerng 008 Vol I The algorthm used for clusterng s smlar to that developed by Vafaeesefat and ElMaraghy [11]. Next, the algorthm s explaned for an nspecton process usng a touch-trgger probe. Each pont P ( = 1,,, n) to be probed s assocated to a bnary matrx of vald orentatons A ( = 1,,, n). Intally ( = 1), the clusters wll be the same as each of the ponts to be probed: C = P. Startng from the clusters C and from the bnary matrces A, a new matrx CI (, j) = A Aj s bult showng the common probe orentatons to the clusters two aganst two. Wth the purpose of creatng clusters whose ponts are assocated wth the greatest number of vald orentatons, the algorthm searches the ndces (s, t) of CI that correspond to the maxmum number of common vald orentatons. After that, clusters Cs and C t assocated to ponts P s and P t respectvely wll be regenerated as follows: C = C C and s s t C t = (7) and the bnary matrx of vald orentaton assocated to the new cluster C wll be A = A A. s s s t Wth these new clusters, matrx A Aj for = t and j = s CI (, j) = for = t and j = t CI s updated to: (8) The clusterng process fnshes when the number of common orentatons correspondng to all the elements above the man dagonal of matrx CI have become zero. A smlar process s used to determne the clusters of trangles T ( = 1,,, n) for a part to be scanned. V. APPLICATION RESULTS A. Inspecton Process by means of a Touch-trgger Probe In order to analyze the applcaton results of accessblty and clusterng algorthms to the nspecton process, the part shown n Fg. has been consdered. For ths part, the STL model contans 48 trangles and 8 nspecton ponts located on three dfferent surfaces (s7, s19 and s9). As an example, Fg. shows the accessblty maps for the nspecton pont P4s9 (pont P 4 on surface s9) consderng the dfferent geometrcal abstractons of the probe. As t can be seen, when real dmensons and dfferent probe components are taen nto account, the accessblty map s substantally reduced. For the rest of nspecton ponts, smlar accessblty maps can be obtaned. Furthermore, the applcaton of the clusterng algorthm allows for obtanng the clusters shown n Table I. In ths case seven clusters have been found. B. Scannng process by means of a Laser Strpe System Apart from the nspecton process, the developed methodology allows for determnng the orentatons of a laser strpe system to scan a part. In ths type of scannng systems a laser strpe of nown wdth s projected onto the part surface to be scanned and the reflected beam s detected TABLE I. CLUSTER OF POINTS AND COMMON ORIENTATIONS IN THESE CLUSTERS Cluster Ponts / Surface Orentatons (A, B) 1 P1s19, Ps19, P1s19, P4s7, P4s9, (7.5, 67.5) (45, 67.5) P7s9, P11s9, P1s9 Ps19, P1s9, P5s9, P6s9 (67.5, -60) P4s19, P5s19 (97.5, -90) (97.5, -8.5) (97.5, -75) (97.5, -67.5) (97.5, -60) 4 P6s19, P8s7 (0, -165) (0, 180) (7.5, -17.5) (7.5, -165) (7.5, ) (7.5, -150) (7.5, -14.5) (7.5, -15) (7.5, 157.5) (7.5, 165) (7.5, -17.5) (7.5, 180) (45, -17.5) (45, -165) (45, ) (45, -150) (45, -14.5) (45, -15) (45, -17.5) (45, -10) (45, 180) (5.5, -17.5) (5.5, ) (5.5, -150) (5.5, -14.5) (5.5, -15) (5.5, -17.5) (5.5, -10) (5.5, -11.5) 5 P7s19, P8s19, P9s19, P10s19, (15, 10) (15, 17.5) (.5, 11.5) (.5, 10) (.5, 17.5) P11s19, P6s7, Ps9, Ps9, P8s9, (.5, 15) (.5, 14.5) (.5, 150) (.5, 165) (0, 11.5) P9s9, P10s9, P1s9, P14s9, P15s9, P16s9, P17s9, P18s9 (0, 10) (0, 17.5) (0, 15) (0, 14.5) (0, 150) (0, 165) 6 Ps7, Ps7 (7.5, -15) 7 P7s7 (7.5, -165) (7.5, ) (7.5, -150) (7.5, 165) (7.5, 17.5) (7.5, 180) (15, -17.5) (15, -165) (15, ) (15, -150) (15, -15) (15, -14.5) (15, 150) (15, 157.5) (15, 165) (15, 17.5) (15, 180) (.5, -17.5) (15, -165) (15, ) (15, 17.5) (15, 180) (0, -17.5)

5 Proceedngs of the World Congress on Engneerng 008 Vol I by a CCD camera. Therefore, not only the ncdent laser beam orentaton has been taen nto account for the accessblty analyss but also the possble occluson due to the nterference of the reflected laser beam wth the part. Fg. 4 shows the laser head orentaton map assocated to the local and global accessblty analyss for trangle 558 of the example part. The darest colour represents the head orentatons (A, B) that concde or are closest to the normal drecton of the trangle analyzed. These are consdered as optmal orentatons. Grey colours represent head orentatons far from the optmal value whch lead to worse scannng qualty. Whte colour represents head orentatons that do not enable to scan the consdered trangles. For a better vsualzaton of the orentaton map, ncrements of 15º have been consdered for angles A and B. For trangle 558 an ncdent laser beam orentaton (A=, B=18) has been selected n order to show the part regons (boundng boxes) that t traverses (Fg. 5). Trangles partally or totally enclosed n these boundng boxes are shown n the fgure before and after applyng the bac-face cullng algorthm. Fg. 6 shows n a grey scale the ten trangle clusters obtaned for the example part º 0 º +18 Local orentatons (A, B) Trangle 558 Global orentatons (A, B) Fg. 4. Local and global accessblty maps for trangle 558 (a) Trangle 558 and ncdent ray orentaton A0-B180 (b) Part regons traversed by the ncdent ray (c) Trangles wthn the traversed part regons (d) Trangles wthn the traversed part regons after applyng the bac-face cullng algorthm Fg. 5. Dfferent stages to determne the global vsblty map for a trangle (558) and an ncdent laser beam orentaton (A=, B=18). z y x y x z Fg. 6. Clusters assocated to the example part.

6 Proceedngs of the World Congress on Engneerng 008 Vol I VI. CONCLUSIONS Most of the accessblty analyss presented n other wors only deal wth a lmted number of the nspecton devce orentatons, smple parts wth only planar surfaces or specfc geometrcal shapes, smplfed devce representatons or a short number of ponts n the case of nspecton by touch-trgger probe. However, n ths paper, a new methodology for accessblty analyss s presented whch allows for overcomng the prevous lmtatons: 1) The methodology has been extended to the nspecton process by means of a touch-trgger probe and the scannng process by means of a laser strpe system. ) All the possble orentatons (70) of the nspecton devce are taen nto consderaton. ) The use of the STL model permts the applcaton of the developed system to any type of part, regardless of ts shape and complexty. 4) The real shape and dmensons of the nspecton devce are consdered for the analyss. 5) The mplemented algorthms based on Computer Graphcs reduce computaton tme and consequently can deal wth a hgh number of nspecton ponts and complex surfaces. 6) Moreover, a clusterng algorthm s appled that effcently groups the nspecton ponts and trangles of the STL of the part to be scanned n order to reduce the number of probe orentaton changes. The developed system has been appled to dfferent parts wth satsfactory results demonstratng the applcaton n practce. Future research wll concentrate on developng new algorthms that further reduce computaton tme, and on generatng the nspecton paths from the orentatons obtaned n the clusterng process. REFERENCES [1] A. J. Spyrd and A. A. G. Requcha, Accessblty analyss for the automatc nspecton of mechancal parts by coordnate measurng machnes, Proc. of the IEEE Int. Conf. on Robotcs and Automaton, 1990, pp [] M. Kaplan, Space-tracng: A constant tme ray-tracer, Proceedngs of the SIGGRAPH 85, 1985, pp [] A. Lmaem and H. A. ElMaraghy, CATIP: A Computer-Aded tactle nspecton plannng system, Int. J. of Prod. Res., vol. 7(), 1999 pp [4] K. H. Lee and H. -P. Par, Automated nspecton plannng of free-form shape parts by laser scannng, Robot. Comput. Integr. Manuf., vol. 16(4), 000, pp [5] J. D. Foley, A. van Dam, S. K. Fener and J. F. Hughes, Computer Graphcs, Prncples and Practce, Cornell: Addson-Wesley, 1995, ch. 15, pp [6] T. A. Möller and B. Trumbore, Fast, mnmum storage ray/trangle ntersecton, Journal of Graphcs Tools, vol. (1), 1997, pp [7] P. J. Schneder and D. H. Eberly, Geometrcal Tools for computer graphcs, San Francsco: Morgan Kaufmann Publshers Inc., 00, ch. 10, pp [8] S. Gottschal, M. C. Ln and D. Manocha, OBBTree: a herarchcal structure for rapd nterference detecton, Proc. of the SIGGRAPH 96, 1996, pp [9] T. A. Möller, Fast D trangle-box overlap testng. Journal of Graphcs Tools, vol. 6(1), 001, pp.9. [10] D. H. Eberly, D Game engne desgn. A practcal approach to real-tme computer graphcs, San Dego: Morgan Kaufmann Publshers Inc., 000, ch., pp [11] A. Vafaeesefat and H. A. ElMaraghy, Automated accessblty analyss and measurement clusterng for CMMs, Int. J. Prod. Res., vol. 8(10), 000, pp

Local and Global Accessibility Evaluation with Tool Geometry

Local and Global Accessibility Evaluation with Tool Geometry 19 Local and Global Accessblty Evaluaton wth Tool Geometry Jnnan Wang 1, Chell A. Roberts 2 and Scott Danelson 3 1 Arzona State Unversty, wangn@asu.edu 2 Arzona State Unversty, chell.roberts@asu.edu 2

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R 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 information

Module Management Tool in Software Development Organizations

Module 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 information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism 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 information

Collision Detection. Overview. Efficient Collision Detection. Collision Detection with Rays: Example. C = nm + (n choose 2)

Collision Detection. Overview. Efficient Collision Detection. Collision Detection with Rays: Example. C = nm + (n choose 2) Overvew Collson detecton wth Rays Collson detecton usng BSP trees Herarchcal Collson Detecton OBB tree, k-dop tree algorthms Multple object CD system Collson Detecton Fundamental to graphcs, VR applcatons

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace 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 information

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

Skew 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 information

PARTITIONING POSITIONAL AND NORMAL SPACE FOR FAST OCCLUSION DETECTION

PARTITIONING POSITIONAL AND NORMAL SPACE FOR FAST OCCLUSION DETECTION Proceedngs of DETC 3 ASME 23 Desgn Engneerng Techncal Conferences and Computers and Informaton n Engneerng Conference Chcago, Illnos USA, September 2-6, 23 DETC23/DAC-48779 PARTITIONING POSITIONAL AND

More information

A Binarization Algorithm specialized on Document Images and Photos

A 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 information

The Shortest Path of Touring Lines given in the Plane

The 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 information

Computing the Minimum Directed Distances Between Convex Polyhedra

Computing the Minimum Directed Distances Between Convex Polyhedra JOURNAL OF INFORMAION COMUING SCIENCE DISANCES AND ENGINEERING BEWEEN CONVEX 15, 353-373 OLYHEDRA (1999) 353 Computng the Mnmum Drected Dstances Between Convex olyhedra Department of Electrcal Engneerng

More information

Modeling Concave Globoidal Cam with Swinging Roller Follower: A Case Study

Modeling Concave Globoidal Cam with Swinging Roller Follower: A Case Study Modelng Concave Globodal Cam wth Swngng Roller Follower: A Case Study Nguyen Van Tuong, and Premysl Pokorny Abstract Ths paper descrbes a computer-aded desgn for desgn of the concave globodal cam wth cylndrcal

More information

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information

3D vector computer graphics

3D 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 information

REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water.

REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water. Purpose Theory REFRACTION a. To study the refracton of lght from plane surfaces. b. To determne the ndex of refracton for Acrylc and Water. When a ray of lght passes from one medum nto another one of dfferent

More information

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

2x 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 information

A Range Image Refinement Technique for Multi-view 3D Model Reconstruction

A Range Image Refinement Technique for Multi-view 3D Model Reconstruction A Range Image Refnement Technque for Mult-vew 3D Model Reconstructon Soon-Yong Park and Mural Subbarao Electrcal and Computer Engneerng State Unversty of New York at Stony Brook, USA E-mal: parksy@ece.sunysb.edu

More information

A high precision collaborative vision measurement of gear chamfering profile

A 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 information

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

Accounting for the Use of Different Length Scale Factors in x, y and z Directions 1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,

More information

Cluster Analysis of Electrical Behavior

Cluster 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 information

Support Vector Machines

Support 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 information

Solving two-person zero-sum game by Matlab

Solving 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 information

Inspection Path Generation in Haptic Virtual CMM

Inspection Path Generation in Haptic Virtual CMM 273 Inspecton Path Generaton n Haptc Vrtual CMM Zhengy Yang 1 and Yonghua Chen 2 1 The Unversty of Hong Kong, yangzy@graduate.hku.hk 2 The Unversty of Hong Kong, yhchen@hkucc.hku.hk ABSTRACT An nspecton

More information

Hierarchical clustering for gene expression data analysis

Hierarchical clustering for gene expression data analysis Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally

More information

TN348: Openlab Module - Colocalization

TN348: 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 information

Parallel matrix-vector multiplication

Parallel 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 information

Quick error verification of portable coordinate measuring arm

Quick error verification of portable coordinate measuring arm Quck error verfcaton of portable coordnate measurng arm J.F. Ouang, W.L. Lu, X.H. Qu State Ke Laborator of Precson Measurng Technolog and Instruments, Tanjn Unverst, Tanjn 7, Chna Tel.: + 86 [] 7-8-99

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content 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 information

Form-factors Josef Pelikán CGG MFF UK Praha.

Form-factors Josef Pelikán CGG MFF UK Praha. Form-factors 1996-2016 Josef Pelkán CGG MFF UK Praha pepca@cgg.mff.cun.cz http://cgg.mff.cun.cz/~pepca/ FormFactor 2016 Josef Pelkán, http://cgg.mff.cun.cz/~pepca 1 / 23 Form-factor F It ndcates the proporton

More information

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Quality 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 information

Vanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay,

Vanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay, Vanshng Hull Jnhu Hu Suya You Ulrch Neumann Unversty of Southern Calforna {jnhuhusuyay uneumann}@graphcs.usc.edu Abstract Vanshng ponts are valuable n many vson tasks such as orentaton estmaton pose recovery

More information

Classifier Selection Based on Data Complexity Measures *

Classifier 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 information

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

MULTISPECTRAL 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 information

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A 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 information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The 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 information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An 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 information

On Some Entertaining Applications of the Concept of Set in Computer Science Course

On 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 information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler 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 information

Simplification of 3D Meshes

Simplification of 3D Meshes Smplfcaton of 3D Meshes Addy Ngan /4/00 Outlne Motvaton Taxonomy of smplfcaton methods Hoppe et al, Mesh optmzaton Hoppe, Progressve meshes Smplfcaton of 3D Meshes 1 Motvaton Hgh detaled meshes becomng

More information

Second Asian Symposium on Industrial Automation and Robotics BITEC, Bangkok, Thailand May 17-18, 2001

Second Asian Symposium on Industrial Automation and Robotics BITEC, Bangkok, Thailand May 17-18, 2001 Second Asan Symposum on Industral Automaton and Robotcs BITEC, Bangkok, Thaland May 7-8, 00 DEVELOPMENT OF DISASSEMBLY SUPPORT SYSTEM FOR MECHANICAL PARTS Ej ARAI, Hdefum WAKAMATSU, Akra TSUMAYA, Kech

More information

Influence of Ambient Light on the Quality of Laser Digitized Surfaces

Influence of Ambient Light on the Quality of Laser Digitized Surfaces Proceedngs of the World Congress on Engneerng 2008 Vol I Influence of Ambent Lght on the Qualty of Laser Dgtzed Surfaces D. Blanco, P. Fernández, E. Cuesta and C. M. Suárez Abstract Laser trangulaton systems

More information

Dynamic wetting property investigation of AFM tips in micro/nanoscale

Dynamic wetting property investigation of AFM tips in micro/nanoscale Dynamc wettng property nvestgaton of AFM tps n mcro/nanoscale The wettng propertes of AFM probe tps are of concern n AFM tp related force measurement, fabrcaton, and manpulaton technques, such as dp-pen

More information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

Parallel manipulator robots design and simulation

Parallel manipulator robots design and simulation Proceedngs of the 5th WSEAS Int. Conf. on System Scence and Smulaton n Engneerng, Tenerfe, Canary Islands, Span, December 16-18, 26 358 Parallel manpulator robots desgn and smulaton SAMIR LAHOUAR SAID

More information

UNIT 2 : INEQUALITIES AND CONVEX SETS

UNIT 2 : INEQUALITIES AND CONVEX SETS UNT 2 : NEQUALTES AND CONVEX SETS ' Structure 2. ntroducton Objectves, nequaltes and ther Graphs Convex Sets and ther Geometry Noton of Convex Sets Extreme Ponts of Convex Set Hyper Planes and Half Spaces

More information

Analysis of Continuous Beams in General

Analysis 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 information

Real-time Motion Capture System Using One Video Camera Based on Color and Edge Distribution

Real-time Motion Capture System Using One Video Camera Based on Color and Edge Distribution Real-tme Moton Capture System Usng One Vdeo Camera Based on Color and Edge Dstrbuton YOSHIAKI AKAZAWA, YOSHIHIRO OKADA, AND KOICHI NIIJIMA Graduate School of Informaton Scence and Electrcal Engneerng,

More information

TEST-05 TOPIC: OPTICS COMPLETE

TEST-05 TOPIC: OPTICS COMPLETE Q. A boy s walkng under an nclned mrror at a constant velocty V m/s along the x-axs as shown n fgure. If the mrror s nclned at an angle wth the horzontal then what s the velocty of the mage? Y V sn + V

More information

An Optimal Algorithm for Prufer Codes *

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 information

Feature Reduction and Selection

Feature 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 information

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

VISUAL 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 information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

Line Clipping by Convex and Nonconvex Polyhedra in E 3

Line Clipping by Convex and Nonconvex Polyhedra in E 3 Lne Clppng by Convex and Nonconvex Polyhedra n E 3 Václav Skala 1 Department of Informatcs and Computer Scence Unversty of West Bohema Unverztní 22, Box 314, 306 14 Plzeò Czech Republc e-mal: skala@kv.zcu.cz

More information

Accelerating X-Ray data collection using Pyramid Beam ray casting geometries

Accelerating X-Ray data collection using Pyramid Beam ray casting geometries Acceleratng X-Ray data collecton usng Pyramd Beam ray castng geometres Amr Averbuch Guy Lfchtz Y. Shkolnsky 3 School of Computer Scence Department of Appled Mathematcs, School of Mathematcal Scences Tel

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A 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 information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal

More information

DESIGN OF VERTICAL ALIGNMET

DESIGN OF VERTICAL ALIGNMET DESIN OF VERTICAL ALINMET Longtudnal gradent : max 0,5% (max see the assgnment paper) Markng of longtudnal gradent n drecton of chanage: + [%].. ascent n the drecton of chanage [%].. descent n the drecton

More information

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE

ON 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 information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

APPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF

APPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF APPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF Johannes Leebmann Insttute of Photogrammetry and Remote Sensng, Unversty of Karlsruhe (TH, Englerstrasse 7, 7618 Karlsruhe, Germany - leebmann@pf.un-karlsruhe.de

More information

Multi-posture kinematic calibration technique and parameter identification algorithm for articulated arm coordinate measuring machines

Multi-posture kinematic calibration technique and parameter identification algorithm for articulated arm coordinate measuring machines Mult-posture knematc calbraton technque and parameter dentfcaton algorthm for artculated arm coordnate measurng machnes Juan-José AGUILAR, Jorge SANTOLARIA, José-Antono YAGÜE, Ana-Crstna MAJARENA Department

More information

3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method

3D 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 information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.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 information

Scan Conversion & Shading

Scan Conversion & Shading Scan Converson & Shadng Thomas Funkhouser Prnceton Unversty C0S 426, Fall 1999 3D Renderng Ppelne (for drect llumnaton) 3D Prmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng

More information

Scan Conversion & Shading

Scan Conversion & Shading 1 3D Renderng Ppelne (for drect llumnaton) 2 Scan Converson & Shadng Adam Fnkelsten Prnceton Unversty C0S 426, Fall 2001 3DPrmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 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 information

Lecture 4: Principal components

Lecture 4: Principal components /3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness

More information

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range 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 information

Enhanced Advancing Front Technique with Extension Cases for Initial Triangular Mesh Generation

Enhanced Advancing Front Technique with Extension Cases for Initial Triangular Mesh Generation , July 6-8, 2011, London, U.K. Enhanced Advancng Front Technque wth Extenson Cases for Intal Trangular Mesh Generaton Z. Abal Abas and S. Salleh Abstract Durng the element creaton procedure of ntal mesh

More information

Trajectory and spray control planning on unknown 3D surfaces for industrial spray painting robot

Trajectory and spray control planning on unknown 3D surfaces for industrial spray painting robot Graduate Theses and Dssertatons Graduate College 2008 Trajectory and spray control plannng on unknown 3D surfaces for ndustral spray pantng robot Fanq Meng Iowa State Unversty Follow ths and addtonal works

More information

Real-time Joint Tracking of a Hand Manipulating an Object from RGB-D Input

Real-time Joint Tracking of a Hand Manipulating an Object from RGB-D Input Real-tme Jont Tracng of a Hand Manpulatng an Object from RGB-D Input Srnath Srdhar 1 Franzsa Mueller 1 Mchael Zollhöfer 1 Dan Casas 1 Antt Oulasvrta 2 Chrstan Theobalt 1 1 Max Planc Insttute for Informatcs

More information

Chapter 4. Non-Uniform Offsetting and Hollowing by Using Biarcs Fitting for Rapid Prototyping Processes

Chapter 4. Non-Uniform Offsetting and Hollowing by Using Biarcs Fitting for Rapid Prototyping Processes Chapter 4 Non-Unform Offsettng and Hollowng by Usng Barcs Fttng for Rapd Prototypng Processes Ths chapter presents a new method of Non-Unform offsettng and usng barc fttngs to hollow out sold objects or

More information

Non-Split Restrained Dominating Set of an Interval Graph Using an Algorithm

Non-Split Restrained Dominating Set of an Interval Graph Using an Algorithm Internatonal Journal of Advancements n Research & Technology, Volume, Issue, July- ISS - on-splt Restraned Domnatng Set of an Interval Graph Usng an Algorthm ABSTRACT Dr.A.Sudhakaraah *, E. Gnana Deepka,

More information

Detection of hand grasping an object from complex background based on machine learning co-occurrence of local image feature

Detection of hand grasping an object from complex background based on machine learning co-occurrence of local image feature Detecton of hand graspng an object from complex background based on machne learnng co-occurrence of local mage feature Shnya Moroka, Yasuhro Hramoto, Nobutaka Shmada, Tadash Matsuo, Yoshak Shra Rtsumekan

More information

The motion simulation of three-dof parallel manipulator based on VBAI and MATLAB Zhuo Zhen, Chaoying Liu* and Xueling Song

The motion simulation of three-dof parallel manipulator based on VBAI and MATLAB Zhuo Zhen, Chaoying Liu* and Xueling Song Internatonal Conference on Automaton, Mechancal Control and Computatonal Engneerng (AMCCE 25) he moton smulaton of three-dof parallel manpulator based on VBAI and MALAB Zhuo Zhen, Chaoyng Lu* and Xuelng

More information

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume

More information

Machine Learning. Topic 6: Clustering

Machine Learning. Topic 6: Clustering Machne Learnng Topc 6: lusterng lusterng Groupng data nto (hopefully useful) sets. Thngs on the left Thngs on the rght Applcatons of lusterng Hypothess Generaton lusters mght suggest natural groups. Hypothess

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User 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 information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning 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 information

The Codesign Challenge

The 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 information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

Fast Computation of Shortest Path for Visiting Segments in the Plane

Fast 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 information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course 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 information

Constructing Minimum Connected Dominating Set: Algorithmic approach

Constructing Minimum Connected Dominating Set: Algorithmic approach Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected

More information

An Image Fusion Approach Based on Segmentation Region

An 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 information

Positive Semi-definite Programming Localization in Wireless Sensor Networks

Positive 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 information

K-means and Hierarchical Clustering

K-means and Hierarchical Clustering Note to other teachers and users of these sldes. Andrew would be delghted f you found ths source materal useful n gvng your own lectures. Feel free to use these sldes verbatm, or to modfy them to ft your

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned

More information

Detection of an Object by using Principal Component Analysis

Detection 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 information

Unsupervised Learning

Unsupervised 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 information

Surface Mapping One. CS7GV3 Real-time Rendering

Surface Mapping One. CS7GV3 Real-time Rendering Surface Mappng One CS7GV3 Real-tme Renderng Textures Add complexty to scenes wthout addtonal geometry Textures store ths nformaton, can be any dmenson Many dfferent types: Dffuse most common Ambent, specular,

More information

Sorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions

Sorting 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 information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL 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 information

Corner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity

Corner-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 information

Fuzzy Modeling of the Complexity vs. Accuracy Trade-off in a Sequential Two-Stage Multi-Classifier System

Fuzzy Modeling of the Complexity vs. Accuracy Trade-off in a Sequential Two-Stage Multi-Classifier System Fuzzy Modelng of the Complexty vs. Accuracy Trade-off n a Sequental Two-Stage Mult-Classfer System MARK LAST 1 Department of Informaton Systems Engneerng Ben-Guron Unversty of the Negev Beer-Sheva 84105

More information

A Volumetric Approach for Interactive 3D Modeling

A Volumetric Approach for Interactive 3D Modeling A Volumetrc Approach for Interactve 3D Modelng Dragan Tubć Patrck Hébert Computer Vson and Systems Laboratory Laval Unversty, Ste-Foy, Québec, Canada, G1K 7P4 Dens Laurendeau E-mal: (tdragan, hebert, laurendeau)@gel.ulaval.ca

More information

Exterior Orientation using Coplanar Parallel Lines

Exterior Orientation using Coplanar Parallel Lines Exteror Orentaton usng Coplanar Parallel Lnes Frank A. van den Heuvel Department of Geodetc Engneerng Delft Unversty of Technology Thsseweg 11, 69 JA Delft, The Netherlands Emal: F.A.vandenHeuvel@geo.tudelft.nl

More information

Edge Detection in Noisy Images Using the Support Vector Machines

Edge Detection in Noisy Images Using the Support Vector Machines Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona

More information