Proactive Kinodynamic Planning using the Extended Social Force Model and Human Motion Prediction in Urban Environments
|
|
- Agnes Anderson
- 5 years ago
- Views:
Transcription
1 Poactive Kinodynamic Planning using the Extended Social Foce Model and Human Motion Pediction in Uban Envionments Gonzalo Fee and Albeto Sanfeliu Abstact This pape pesents a novel appoach fo obot navigation in cowded uban envionments whee people and objects ae moving simultaneously while a obot is navigating. Avoiding moving obstacles at thei coesponding pecise moment motivates the use of a obotic planne satisfying both dynamic and nonholonomic constaints, also efeed as kynodynamic constaints. We pesent a poactive navigation appoach with espect its envionment, in the sense that the obot calculates the eaction poduced by its actions and povides the minimum impact on neaby pedestians. As a consequence, the poposed planne integates seamlessly planning and pediction and calculates a complete motion pediction of the scene fo each obot popagation. Making use of the Extended Social Foce Model (ESFM) allows an enomous simplification fo both the pediction model and the planning system unde diffeential constaints. Simulations and eal expeiments have been caied out to demonstate the success of the poactive kinodynamic planne. I. INTRODUCTION The impact poduced by the deployment of sevice obots is of vital impotance fo the acceptance of obots in cowded uban envionments, specifically among humans in its natual habitat. In the pesent wok, we popose a planne that pedicts human motion and minimizes its impact on all those neaby pedestians. Time estictions ae significant in social envionments: people walk and change thei positions duing time. A cost-based navigation path is calculated while satisfying both dynamic and nonholonomic constaints, also efeed as kinodynamic constaints. Pediction methods ae of geat impotance. Most appoaches sepaate planning and pediction and although a joint appoach may seem to boost the poblem complexity, we will pesent a simple method to jointly account pedictions and planning by consideing a union state of people and obots. Human motion pediction can be achieved though leaning techniques, like in the woks of [1], [2] and [3], whee they make use of maximum entopy leaning methods using a linea combination of diffeent kinds of featues. In this wok, we apply geometical based pedictos such as the woks of [4] and [5] that infe human motion intentions and aftewads pedict human motion in a continuous space, accoding to the Social Foce Model (SFM) [6], and the Extended SFM [7]. Woks such as [8] and [9] aleady The authos ae with the Institut de Robòtica i Infomàtica Industial, CSIC-UPC. Lloens Atigas 4-6, Bacelona, Spain. {gfee,sanfeliu}@ii.upc.edu. Wok suppoted by the Spanish Ministy of Science and Innovation unde poject RobTaskCoop (DPI ). Fig. 1. Simulation envionment in a space time, whee people ae plotted as geen cylindes and thei pedictions ae dawn in the z axis, which coesponds to time. The tee of paths calculated by the obot appeas in blue and the best path is a ed line. poposed to model people as a summation of a Potential Field (PF), so it is not a novel idea. In addition, PF navigation algoithms [10] have been extensively studied in the liteatue. Despite thei advantages, thee exist many well known limitations, such as local minima o oscillations. Seveal appoaches ty to ovecome these limitations, such as [11], by using a andomized walking path when a local minimum is eached. The dynamic window appoach [12] and othe velocity constained appoaches [13] pemitted to conside obstacles and collisions. Unfotunately, they suffe fom local minima as well. Appoaches combining a DWA with a global planne like [14] solve the poblem by intoducing a global function. Ou appoach also elies on a global planne. In [15] they obtain a kinodynamic compliant tajectoy by decoupling the poblem into a seach in space and a posteio optimization of the path satisfying the estictions. Ou appoach integates the seach of a path avoiding obstacles as well as povides the inputs equied to execute that tajectoy consideing kinodynamic constaints. Duing the last decade sampling based techniques have become quite popula. Futhemoe, sampling based methods may take into account kinematic and dynamic constaints such as [16] and [17]. [18] poposes a social awae eactive planning in human envionments. A joint calculation of people s path and a obot path is done in [19] using Gaussian pocesses, and [9] uses a PF and minimizes its cost though people s Potential Fields.
2 Fig. 2. Oveview of the poposed planning scheme. II. PLANNING OVERVIEW On the one hand, people typically move on the scene changing thei positions duing some time, and theefoe, we must conside time-vaiant scenaios. On the othe hand, a obot tajectoy must satisfy those stong time estictions while consideing kinodynamic constaints. A state-space fomulation is explained in Sec. III. The Extended Social Foce Model is explained in Sec. IV and how we calculate the foces affecting people and obots. The use of the ESFM will simplify enomously the planning unde diffeential constaints since thee is no need to solve the bounday value poblem (BVP) to link poses. In Sec. V we popose to integate the pediction algoithm with the planning algoithm and solve the poblem in a holistic way. The pediction is caied out seamlessly and simultaneously while the planning is being calculated, as explained in Sec. V-E. Evey new obot popagation entails an estimation of the motion pediction of neaby people. As a esult, ou planne pesents poactive chaacteistics since we tend to initiate a change athe than a eaction to events. An impotant assumption is done: a global planne povides a valid path to the goal unobstucted by static obstacles. A geneal planning scheme can be seen in Fig. 2. Ou algoithm calculates fo each iteation a path to a goal avoiding moving obstacles like pedestians on the scene. The fist output action in {u(t ini ),...,u(t hoizon )} is executed, and in the next iteation, a new plan is calculated, and a new action is executed. This appoach pemits a fast adaptation to changing envionments, especially if the pediction estimation changes dastically. As we will see in Sec. VI and VII, ou algoithm is implemented in eal time to povide an adaptable local planning. The computed plan takes into account the eaction poduced by its actions and poduces the minimum distubances to othe neaby pedestians. III. STATE-SPACE FORMULATION Fo planning puposes in the pesent wok, we conside that both obots and people move in a two-dimensional space which epesents the uban envionment. Let X denote the wokspace and x X descibes the position x = [x,y] in a two dimensional space, as fo moving objects (including people) and as obots. The configuation space C z is defined as a configuation q z C z, whee z denotes diffeent configuation spaces fo people and obots. Since we take into account a kinodynamic teatment of the planning scheme, we define the phase space S z that only consides the fist ode deivative, whee s z S z is defined by s z = [q z, q z ]. In addition, we deal with stong time constaints, whee object movements alte the outcome of the planning calculations, and we should conside the augmented phase space ST z = S z time, whee time R +, and s z ST z is a state s z = [q z, q z,t] at time t. In geneal, we will addess the planning poblem using the state s z ST z. Finally, an action u z U z modifies the states s z, as it will be discussed below. A. People in the state-space People ae teated as fee moving paticles, and theefoe, no oientation is equied. Accodingly, the configuation space is equal to the wokspace C P = X and the peson s phase space ST P is descibed as s p ST P, whee s p = [x,y,v x,v y,t]. The input space U P fo the peson s action is u p U P which ae linea acceleations u p = [a x,a y ]. The kinodynamic model descibing the peson s motion is constained by the following diffeential equations: ṡ p = dc(s p,u p ) = v x v y a x a y 1. (1) It will be discussed late how the input vaiables u p ae calculated. B. Robot in the state-space We conside the obot model to be chaacteized by a unicycle obot model. Theeby, thee appea nonholonomic constaints in the obotic dynamic model due to the olling contacts between the igid bodies. The phase state of the obot ST R is descibed as s ST R, whee s = [x,y,θ,v,ω,t]. The obot action space is defined as u U R whee u = [a v,a ω ] ae the tanslation acceleation and the otation acceleation. Then, the esultant diffeential constaints ae: ṡ = dc(s,u ) = vcos(θ) vsin(θ) ω a v a ω 1. (2)
3 C. Joint state-space The joint state space ST consists of ST = ST R ST Pi, which consides the obot phase spacest R and the union of evey peson s phase space ST P. Coespondingly, the joint state s ST is defined as s = [s,s p1,...,s pn ]. Note that the vaiable time t = t(s) is equal to all the states that s consists of. We will efe to the obot state s (s) ST R and the peson ith state s pi (s) ST P. IV. EXTENDED SOCIAL FORCE MODEL We employ the Extended Social Foce Model (ESFM) [7], based on [6], fo navigation puposes since it povides a ealistic model descibing inteactions among humans in typical social envionments [5]. The ESFM consides humans and obots as fee paticles in a 2D space abiding the laws of Newtonian mechanics. The ESFM uses attactos and epulsos in the continuous space. The attaction foces assume that the pedestian n ties to adapt his o he velocity within a elaxation time k 1, f goal n whee v 0 n(q goal n (qn goal ) = k ( v 0 n(qn goal ) ) v n, (3) ) is the desied velocity vecto to each q goal n, and v n is the cuent velocity. The epulsive inteaction foces ae defined as follows: n,z = a ze (dz dn,z)/bzˆd n,z, (4) whee z Z, being Z = P O R is eithe a peson, o a static object of the envionment, o a obot. Fo each kind oeaction foce coesponds a set of foce paametes {k,a z,b z,λ z,d z }. The distance d n,z fom the peson n to the taget z and ˆd n,z is the unity vecto z n. Fo futhe details, see [7], [5]. Accodingly, the esultant foce is calculated as the summation: f n = f goal n (qn goal )+ n,j + j P\n o O n,o + R n,, (5) whee each taget on the scene, eithe a peson, o an obstacle, o a obot, contibutes to f n. A. SFM applied to the obot The objective is to teat a obot as a fee moving paticle in the space, similaly to people as explained above. Unfotunately, nonholonomic constaints educe the obotic platfom mobility, although it has full eachability in C R. We need to bidge the gap and povide an adjustment that pemits the obot being compatible with the ESFM. The esultant obot foce f = f θ + f θ consists of a component in the tanslation diection f θ, which diectly tansfoms into a tanslational acceleation and an othogonal foce f θ that does not contibute to the obot tanslation. The obot otation acceleation is computed in the following way: τ = f θ +k τ ω, (6) whee is the vecto adii of ou platfom, oiented to θ and k τ is a damping facto in ode to avoid oscillations. Algoithm 1 Poactive planning(q goal,s ini,t hoizon,k) 1: Initialize T (V,E) {ø} 2: V s ini 3: s paent = s ini 4: {qp goal i } = intentionality people pediction() 5: fo j = 1 to K do 6: if t(s paent ) > t hoizon then 7: q g = sample(c R,q goal ) 8: s paent = neaest vetex(q,t g ) 9: end if 10: u = calculate edge(s paent,q) g 11: s new = popagate vetex(u,s paent ) 12: J new = calculate cost(s new,u,q goal ) 13: V V {[s new,j new ]} 14: E E {u } 15: end fo 16: etun minimum cost banch(t ) V. PROACTIVE KINODYNAMIC PLANNING All the main featues of ou poposed planne have been discussed in Sec. II, and can be summaized as: A kinodynamic solution is calculated. Poactive planning in which planning uses pediction infomation, and pediction is dependent on the plath calculated. Pio equiement: a global planne povides a valid global path. At each iteation, the planne povides a locally valid path. The path computed minimizes the petubations on the scene, accoding to a cost function. Additionally, the poactive planne is fast enough fo a eal time implementation, as demonstated in Sec. VII. Algoithm 1 has fou inputs: the goal q goal, the initial state s ini, the hoizon time t hoizon, and the numbe of vetices K. The q goal povides the position and oientation of the final obot configuation. The initial state s ini ST contains the infomation of the obot state plus all people s states consideed on the scene. The hoizon time t hoizon specifies the tempoal window used to foecast the plan and the pedictions. The algoithm builds a tee T (V, E) and etuns the minimum cost banch. The edges E ae the obot contol inputs u U R, and the vetices V consist of the joint state s ST and the accumulated cost J R to each that vetex. With all those equiements in mind, we popose Alg. 1 which is inspied in a andomized kinodynamic planne [16], except fo some paticulaities that will be discussed below. A. Hoizon time and depth exploation The hoizon time paamete sets the amount of time that the planne foecasts in ode to obtain a path simila to a model pedictive contol (MPC). Although the set of inputs {u (t ini ),...,u (t hoizon )} is calculated, only the fist input command is executed and a new set of inputs is calculated
4 in the next iteation. The hoizon time bounds the egion of exploation C R to a cicle adii equal to t hoizon v max as depicted in Fig. 3. / C R due to the hoizon time limit, and accodingly, ou appoach obeys a depth seach stategy to develop banches of the tee T until the hoizon time is eached (Line 6 in Alg. 1). Usually q goal B. Space exploation The space exploation is done in C R whee a set of andom goals q g ae andomly calculated in ode to extend the tee T. These andom goals q g ae attactos that geneate valid obotic paths in ST until t hoizon is eached, as explained below. Since thee is a stong time estiction, q g ae sampled in the bounday of C R, to avoid bias and to ensue that the paths geneated indeed expand T. The andom goals q g can be seen in Fig. 3. The sampling is done using a Gaussian distibution centeed at the neaest and the vaiance values depend on the density of neaby people: when the density gows, the vaiance also augments. q C R toq goal C. Find neaest vetex Once a new andom goal q g is geneated, the planne finds the neaest vetex V in T to be the paent vetex fo the new banch to be calculated. If only pue distances ae calculated in C R, thee would exist a stong bias to select old vetices that ae nea t hoizon. The calculation of the new weighted distance is done as follows: d(s,q g ) = x x g +c θ θ θ g +c time t t ini. (7) D. Edge calculation Edges E ae obot contol inputs u U R. Despite that the joint state takes into account all people, we can only select the input actions fo the obot platfom. We calculate the esultant obot foce f by making use of the ESFM (5). This foce is tansfomed into an acceleation using (6), and thus, a obot action u = f /m that takes into account the mass of the obot m. The goal of the obot is the andom goalq g and at the same time eacts to the envionment obstacles, that is, it takes into Fig. 4. Tee T of paths in the space X time. On the left, the z axis epesents time. On the ight pojection of T in X. Algoithm 2 Vetex popagation(u,s paent ) 1: s new = s (s paent )+dc ( s (s paent ),u ) t 2: fo i = 1,...,N do 3: if s pi (s paent ) q goal 4: u pi = f ( q goal 5: s new 6: end if 7: end fo 8: etun s new = [s new then ),s paent,s new /mi = s pi (s paent )+dc ( s pi (s paent ),u pi ) t,s new p 1,...,s new p N ] account the states of the neaby people s p1,...,s pn. The diffeent paths ae computed by intoducing a set of andom goals q g that stee the obot to apidly exploe C R time. E. Vetex popagation fo evey peson on the scene. This calculation is caied out only once, at the initialization of the algoithm (line 4 in Alg. 1). We adapt the human pediction algoithm [5] to obtain a single popagation s new fom a given initial state s paent ST. Algoithm 2 fist popagates the obot state s accodingly to u and integates the diffeential equation (2) by using Eule integation. Then, fo evey peson on the scene, and Since the action calculated u only popagates the obot state s, we must update the joint state s fo evey peson consideed. We popose a poactive appoach in which the computed planning actionu is integated with the pediction algoithm. Fist of all, we need to infe human intentions. As poposed in [4], we calculate the most expectable q goal (line 3 in Alg. 2), an action u pi is calculated depending on the people on the scene and the new obot state s new (line 4 in Alg. 2). if the peson has not eached its infeed goal q goal F. Cost function and path selection We popose a metic that measues social distubances while navigating: the social wok [18]. The amount of social wok caied out by the obot fom t ini to t hoizon : Fig. 3. Random goals q g distibution, on the ight thee ae no people in C R and seach is concentated on the goal diection. On the left the density of neaby people on the scene is highe, and thus, the q g sampling distibution is widespead. W R = t hzn t=t ini f (t) x (t), (8)
5 whee f takes into account both the steeing foce (3) and the summation of social-foces due to neaby people o othe obstacles (5) and it is multiplied by the vaiation of position x at each t. Similaly, we can define the summation of social wok caied out by the people on the scene induced by the obot movement: W P = t hzn t=t ini i P f,i (t) x i (t). (9) We have measued the social wok of the people W P due to the obot plan, and the social wok caied out by the obot W R. Fo evey new vetex the total cost is: J = x x goal +k θ θ θ goal + k obot W R +k people W P. (10) Most of the time, eaching q goal may not be possible. Nevetheless, the algoithm calculates seveal banches in the tee T and etuns the banch with minimum cost function J at time t hoizon. VI. SIMULATIONS Real expeimentation is a delicate matte when thee ae people involved. Fo this eason, we validate ou planne in a simulated envionment befoe any eal inteaction with people takes place. The simulated envionment [7] consists of static obstacles and multiple people modeled as dynamic obstacles following the ESFM, quite simila to a eal uban envionment. The numbe of vetices K = 500 in the planne is fixed thoughout all simulations and expeiments. The pocessing time highly depends on the numbe of people evaluated since we ae consideing the popagation of the state fo evey peson on each vetex calculated. The aveage pocessing time, if an aveage of 8 people is consideed to appea on the scene, is aound 0.19s, pocessed in a Intel Coe2 Quad CPU 3.00GHz and memoy 3.8 GiB. The simulated scenaio is as follows: the obot eceives a quey to a goal while a goup of pedestians walk in the aea in diffeent situations. A. Leaning paametes in simulations Befoe evaluating the method pefomance, we should povide an initial estimation of the planne paametes. Paametes in (7) wee manually chosen (c θ = 1.0, c time = 0.25) to build a tee without bias as explained in Sec. V-C. Fo the paametes in (10) and t hoizon, we have pefomed ove 7000 expeiments using a Monte Calo appoach to sample the cost paametes, and then, we aveaged the expeiment pefomances to find the optimal values. We povide statical obustness to the method by doing a lage numbe of expeiments and then calculate the expectation of the pefomance depending on the paametes. In Fig. 5 is depicted the leaning esults fo the t hoizon paamete. Nomalized social wok Social wok w..t. hoizon time Robot wok Pesons wok Aveage wok time hoizon [s] Fig. 5. Leaning esults in the simulated envionment fo the t hoizon paamete, showing a minimum in t hoizon = 5s fo the aveage function. These functions ae nomalized fo compaing puposes. A shot t hoizon esults on a staight tajectoy, whee the obot acceleates and stops if an obstacle appeas, which is not an efficient behavio. Intuitively, the highe t hoizon the bette. Howeve, as can be seen in Fig. 5 thee is a degadation of the pefomance of both social woks. As we obseved fo high hoizons, thee wee a shot numbe of banches in the tee to exploe good solutions, and thus, a highe numbe of vetices would be equied. The esults, k θ = 1, k obot = 2, k people = 8 and t hoizon = 5s. These paametes ae highly dependent on the leaning scenaio and the numbe of vetices K. B. Simulations testing We have tested the algoithm in the same simulated envionment using the paametes obtained above. We have compaed ou appoach with a eactive planne poposed in [18], which takes into account people on the scene Fig. 6. Reactive Poactive planning Simulation esults Execution time Robot social wok Pesons social wok Simulation esults, nomalized to the eactive appoach esults. We have compaed thee diffeent values as can be seen in Fig. 6. The execution time efes to the aveage time fo the obot to get to its goal unde the pesence of people. Ou appoach shows a bette pefomance fo the social wok poduced by the people and the obot. These magnitudes ae clealy coelated since we have obseved that in geneal the poactive planne ties to descibe tajectoies that avoid inteactions if possible, while the eactive appoach is not intelligent enough to avoid unnecessay inteactions on time. VII. EXPERIMENTS Finally, we have implemented the algoithm to un in a eal obot, the Tibi&Dabo obots [7] in a contolled eal envionment.
6 Fig. 7. Examples duing expeimentation in eal envionments. Dabo navigates while consideing othe people on the scene. In the bottom ow of the figue appeas an inteface, whee people ae plotted as geen cylindes and thei pedictions ae dawn in the z axis, which coesponds to time. The tee of paths calculated by the obot appea in blue and the best path is a ed line. In Fig. 7 is depicted a seies of expeiments with people. We obseved a bette behavio of the poactive kinodynamic planne with espect to ou pevious eactive appoach, although moe expeiments ae equied, in diffeent scenaios, and moe people on the scene. Fo moe details, check the videos at the autho s webpage people/gfee VIII. CONCLUSION AND FUTURE WORK In this pape we have pesented a poactive kinodynamic planne fo uban envionments that calculates in eal time a local path that minimizes the distubances to othe pedestians. The solution tajectoies take into account kinodynamic and nonholonomic estictions which ae mandatoy consideations fo a ealistic navigation in such highly time-vaiant scenaios like uban envionments. Additionally, ou appoach shows poactive taits since the obot tends to initiate change athe than eacting to events. The cost fo being poactive is a moe intensive pocessing since we must popagate the state of moving pedestians accodingly to the obot popagation. The tajectoy calculated minimizes the amount of social wok poduced by the obot navigation at the same time that minimizes its navigation wok and distance to goal. Fo futue woks we need to extensively test the algoithm in diffeent envionments and with moe people. REFERENCES [1] B. D. Ziebat, N. Ratliff, G. Gallaghe, C. Metz, K. Peteson, J. A. Bagnell, M. Hebet, A. K. Dey, and S. Sinivasa, Planningbased pediction fo pedestians, in Poceedings of the IEEE/RSJ Intenational Confeence on Intelligent Robots and Systems, 2009, pp [2] M. Kudee, H. Ketzschma, C. Spunk, and W. Bugad, Featuebased pediction of tajectoies fo socially compliant navigation, in Poc. of Robotics: Science and Systems (RSS), [3] M. Lube, L. Spinello, J. Silva, and K. O. Aas, Socially-awae obot navigation: A leaning appoach, in Poceedings of the IEEE/RSJ Intenational Confeence on Intelligent Robots and Systems, 2012, pp [4] G. Fee and A. Sanfeliu, Bayesian human motion intentionality pediction in uban envionments, Patten Recognition Lettes, vol. 44, pp , [5], Behavio estimation fo a complete famewok of human motion pediction in cowded envionments, in Poceedings of the IEEE Intenational Confeence on Robotics and Automation, 2014, pp [6] D. Helbing and P. Molná, Social foce model fo pedestian dynamics, Physical eview E, vol. 51, no. 5, p. 4282, [7] G. Fee, A. Gaell, and A. Sanfeliu, Robot companion: A socialfoce based appoach with human awaeness-navigation in cowded envionments, in Poceedings of the IEEE/RSJ Intenational Confeence on Intelligent Robots and Systems, 2013, pp [8] E. A. Sisbot, L. F. Main-Uias, R. Alami, and T. Simeon, A human awae mobile obot motion planne, IEEE Tansactions on Robotics, vol. 23, no. 5, pp , [9] M. Svenstup, T. Bak, and H. J. Andesen, Tajectoy planning fo obots in dynamic human envionments, in Poceedings of the IEEE/RSJ Intenational Confeence on Intelligent Robots and Systems, 2010, pp [10] O. Khatib, Real-time obstacle avoidance fo manipulatos and mobile obots, The intenational jounal of obotics eseach, vol. 5, no. 1, pp , [11] J. Baaquand and J.-C. Latombe, Robot motion planning: A distibuted epesentation appoach, The Intenational Jounal of Robotics Reseach, vol. 10, no. 6, pp , [12] D. Fox, W. Bugad, and S. Thun, The dynamic window appoach to collision avoidance, Robotics & Automation Magazine, vol. 4, no. 1, pp , [13] R. Simmons, The cuvatue-velocity method fo local obstacle avoidance, in Poceedings of the IEEE Intenational Confeence on Robotics and Automation, vol. 4, 1996, pp [14] O. Bock and O. Khatib, High-speed navigation using the global dynamic window appoach, in Poceedings of the IEEE Intenational Confeence on Robotics and Automation, vol. 1, 1999, pp [15] C. Stachniss and W. Bugad, An integated appoach to goal-diected obstacle avoidance unde dynamic constaints fo dynamic envionments, in Poceedings of the IEEE/RSJ Intenational Confeence on Intelligent Robots and Systems, 2002, pp [16] S. M. LaValle and J. J. Kuffne, Randomized kinodynamic planning, The Intenational Jounal of Robotics Reseach, vol. 20, no. 5, pp , [17] D. Hsu, R. Kindel, J.-C. Latombe, and S. Rock, Randomized kinodynamic motion planning with moving obstacles, The Intenational Jounal of Robotics Reseach, vol. 21, no. 3, pp , [18] G. Fee, A. Gaell, and A. Sanfeliu, Social-awae obot navigation in uban envionments, in Euopean Confeence on Mobile Robotics, ECMR., 2013, pp [19] P. Tautman, J. Ma, R. M. Muay, and A. Kause, Robot navigation in dense human cowds: the case fo coopeation, in Poceedings of the IEEE Intenational Confeence on Robotics and Automation, 2013, pp
Controlled Information Maximization for SOM Knowledge Induced Learning
3 Int'l Conf. Atificial Intelligence ICAI'5 Contolled Infomation Maximization fo SOM Knowledge Induced Leaning Ryotao Kamimua IT Education Cente and Gaduate School of Science and Technology, Tokai Univeisity
More informationJournal of World s Electrical Engineering and Technology J. World. Elect. Eng. Tech. 1(1): 12-16, 2012
2011, Scienceline Publication www.science-line.com Jounal of Wold s Electical Engineeing and Technology J. Wold. Elect. Eng. Tech. 1(1): 12-16, 2012 JWEET An Efficient Algoithm fo Lip Segmentation in Colo
More informationDetection and Recognition of Alert Traffic Signs
Detection and Recognition of Alet Taffic Signs Chia-Hsiung Chen, Macus Chen, and Tianshi Gao 1 Stanfod Univesity Stanfod, CA 9305 {echchen, macuscc, tianshig}@stanfod.edu Abstact Taffic signs povide dives
More informationIP Network Design by Modified Branch Exchange Method
Received: June 7, 207 98 IP Netwok Design by Modified Banch Method Kaiat Jaoenat Natchamol Sichumoenattana 2* Faculty of Engineeing at Kamphaeng Saen, Kasetsat Univesity, Thailand 2 Faculty of Management
More informationSegmentation of Casting Defects in X-Ray Images Based on Fractal Dimension
17th Wold Confeence on Nondestuctive Testing, 25-28 Oct 2008, Shanghai, China Segmentation of Casting Defects in X-Ray Images Based on Factal Dimension Jue WANG 1, Xiaoqin HOU 2, Yufang CAI 3 ICT Reseach
More informationAn Unsupervised Segmentation Framework For Texture Image Queries
An Unsupevised Segmentation Famewok Fo Textue Image Queies Shu-Ching Chen Distibuted Multimedia Infomation System Laboatoy School of Compute Science Floida Intenational Univesity Miami, FL 33199, USA chens@cs.fiu.edu
More informationAdaptation of Motion Capture Data of Human Arms to a Humanoid Robot Using Optimization
ICCAS25 June 2-5, KINTEX, Gyeonggi-Do, Koea Adaptation of Motion Captue Data of Human Ams to a Humanoid Robot Using Optimization ChangHwan Kim and Doik Kim Intelligent Robotics Reseach Cente, Koea Institute
More informationADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM
ADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM Luna M. Rodiguez*, Sue Ellen Haupt, and Geoge S. Young Depatment of Meteoology and Applied Reseach Laboatoy The Pennsylvania State Univesity,
More informationA New and Efficient 2D Collision Detection Method Based on Contact Theory Xiaolong CHENG, Jun XIAO a, Ying WANG, Qinghai MIAO, Jian XUE
5th Intenational Confeence on Advanced Mateials and Compute Science (ICAMCS 2016) A New and Efficient 2D Collision Detection Method Based on Contact Theoy Xiaolong CHENG, Jun XIAO a, Ying WANG, Qinghai
More informationPoint-Biserial Correlation Analysis of Fuzzy Attributes
Appl Math Inf Sci 6 No S pp 439S-444S (0 Applied Mathematics & Infomation Sciences An Intenational Jounal @ 0 NSP Natual Sciences Publishing o Point-iseial oelation Analysis of Fuzzy Attibutes Hao-En hueh
More informationExtract Object Boundaries in Noisy Images using Level Set. Final Report
Extact Object Boundaies in Noisy Images using Level Set by: Quming Zhou Final Repot Submitted to Pofesso Bian Evans EE381K Multidimensional Digital Signal Pocessing May 10, 003 Abstact Finding object contous
More information(a, b) x y r. For this problem, is a point in the - coordinate plane and is a positive number.
Illustative G-C Simila cicles Alignments to Content Standads: G-C.A. Task (a, b) x y Fo this poblem, is a point in the - coodinate plane and is a positive numbe. a. Using a tanslation and a dilation, show
More information3D Hand Trajectory Segmentation by Curvatures and Hand Orientation for Classification through a Probabilistic Approach
3D Hand Tajectoy Segmentation by Cuvatues and Hand Oientation fo Classification though a Pobabilistic Appoach Diego R. Faia and Joge Dias Abstact In this wok we pesent the segmentation and classification
More informationOptical Flow for Large Motion Using Gradient Technique
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 3, No. 1, June 2006, 103-113 Optical Flow fo Lage Motion Using Gadient Technique Md. Moshaof Hossain Sake 1, Kamal Bechkoum 2, K.K. Islam 1 Abstact: In this
More informationPROBABILITY-BASED OPTIMAL PATH PLANNING FOR TWO-WHEELED MOBILE ROBOTS
Poceedings of the ASME 215 Dynamic Systems and Contol Confeence DSCC215 Octobe 28-3, 215, Columbus, Ohio, USA DSCC215-999 PROBABILITY-BASED OPTIMAL PATH PLANNING FOR TWO-WHEELED MOBILE ROBOTS Jaeyeon Lee
More informationImage Registration among UAV Image Sequence and Google Satellite Image Under Quality Mismatch
0 th Intenational Confeence on ITS Telecommunications Image Registation among UAV Image Sequence and Google Satellite Image Unde Quality Mismatch Shih-Ming Huang and Ching-Chun Huang Depatment of Electical
More informationRANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES
RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES Svetlana Avetisyan Mikayel Samvelyan* Matun Kaapetyan Yeevan State Univesity Abstact In this pape, the class
More informationXFVHDL: A Tool for the Synthesis of Fuzzy Logic Controllers
XFVHDL: A Tool fo the Synthesis of Fuzzy Logic Contolles E. Lago, C. J. Jiménez, D. R. López, S. Sánchez-Solano and A. Baiga Instituto de Micoelectónica de Sevilla. Cento Nacional de Micoelectónica, Edificio
More informationA modal estimation based multitype sensor placement method
A modal estimation based multitype senso placement method *Xue-Yang Pei 1), Ting-Hua Yi 2) and Hong-Nan Li 3) 1),)2),3) School of Civil Engineeing, Dalian Univesity of Technology, Dalian 116023, China;
More informationAssessment of Track Sequence Optimization based on Recorded Field Operations
Assessment of Tack Sequence Optimization based on Recoded Field Opeations Matin A. F. Jensen 1,2,*, Claus G. Søensen 1, Dionysis Bochtis 1 1 Aahus Univesity, Faculty of Science and Technology, Depatment
More informationClustering Interval-valued Data Using an Overlapped Interval Divergence
Poc. of the 8th Austalasian Data Mining Confeence (AusDM'9) Clusteing Inteval-valued Data Using an Ovelapped Inteval Divegence Yongli Ren Yu-Hsn Liu Jia Rong Robet Dew School of Infomation Engineeing,
More informationHISTOGRAMS are an important statistic reflecting the
JOURNAL OF L A T E X CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 1 D 2 HistoSketch: Disciminative and Dynamic Similaity-Peseving Sketching of Steaming Histogams Dingqi Yang, Bin Li, Laua Rettig, and Philippe
More informationMobility Pattern Recognition in Mobile Ad-Hoc Networks
Mobility Patten Recognition in Mobile Ad-Hoc Netwoks S. M. Mousavi Depatment of Compute Engineeing, Shaif Univesity of Technology sm_mousavi@ce.shaif.edu H. R. Rabiee Depatment of Compute Engineeing, Shaif
More information3D Motion Planning Algorithms for Steerable Needles Using Inverse Kinematics
3D Motion Planning Algoithms fo Steeable Needles Using Invese Kinematics Vincent Duindam 1, Jijie Xu 2, Ron Alteovitz 1,3, Shanka Sasty 1, and Ken Goldbeg 1,2 1 Depatment of EECS, Univesity of Califonia,
More informationIllumination methods for optical wear detection
Illumination methods fo optical wea detection 1 J. Zhang, 2 P.P.L.Regtien 1 VIMEC Applied Vision Technology, Coy 43, 5653 LC Eindhoven, The Nethelands Email: jianbo.zhang@gmail.com 2 Faculty Electical
More informationTowards Adaptive Information Merging Using Selected XML Fragments
Towads Adaptive Infomation Meging Using Selected XML Fagments Ho-Lam Lau and Wilfed Ng Depatment of Compute Science and Engineeing, The Hong Kong Univesity of Science and Technology, Hong Kong {lauhl,
More informationHaptic Glove. Chan-Su Lee. Abstract. This is a final report for the DIMACS grant of student-initiated project. I implemented Boundary
Physically Accuate Haptic Rendeing of Elastic Object fo a Haptic Glove Chan-Su Lee Abstact This is a final epot fo the DIMACS gant of student-initiated poject. I implemented Bounday Element Method(BEM)
More informationINFORMATION DISSEMINATION DELAY IN VEHICLE-TO-VEHICLE COMMUNICATION NETWORKS IN A TRAFFIC STREAM
INFORMATION DISSEMINATION DELAY IN VEHICLE-TO-VEHICLE COMMUNICATION NETWORKS IN A TRAFFIC STREAM LiLi Du Depatment of Civil, Achitectual, and Envionmental Engineeing Illinois Institute of Technology 3300
More informationA Novel Automatic White Balance Method For Digital Still Cameras
A Novel Automatic White Balance Method Fo Digital Still Cameas Ching-Chih Weng 1, Home Chen 1,2, and Chiou-Shann Fuh 3 Depatment of Electical Engineeing, 2 3 Gaduate Institute of Communication Engineeing
More informationOPTIMUM DESIGN OF 3R ORTHOGONAL MANIPULATORS CONSIDERING ITS TOPOLOGY
Copyight by ABCM Page 38 OPTIMUM DESIGN OF 3R ORTHOGONAL MANIPULATORS CONSIDERING ITS TOPOLOGY Giovana Tindade da Silva Oliveia, gtindadeso@yahoo.com.b School of Mechanical Engineeing, Fedeal Univesity
More informationA Haptic-Assisted Guidance System for Navigating Volumetric Data Sets
A Haptic-Assisted Guidance System fo Navigating Volumetic Data Sets Eick Méndez*, Shunsuke Yoshida, Hauo Noma, Robet W. Lindeman*, Yasuyuki Yanagida, Shinobu Masaki, Kenichi Hosaka (*)Compute Science Depatment,
More informationShortest Paths for a Two-Robot Rendez-Vous
Shotest Paths fo a Two-Robot Rendez-Vous Eik L Wyntes Joseph S B Mitchell y Abstact In this pape, we conside an optimal motion planning poblem fo a pai of point obots in a plana envionment with polygonal
More informationGTOC 9, Multiple Space Debris Rendezvous Trajectory Design in the J2 environment
GTOC 9, Multiple Space Debis Rendezvous Tajectoy Design in the J envionment Macus Hallmann, Makus Schlottee, Ansga Heidecke, Maco Sagliano Fedeico Fumenti, Volke Maiwald, René Schwaz Institute of Space
More informationA Mathematical Implementation of a Global Human Walking Model with Real-Time Kinematic Personification by Boulic, Thalmann and Thalmann.
A Mathematical Implementation of a Global Human Walking Model with Real-Time Kinematic Pesonification by Boulic, Thalmann and Thalmann. Mashall Badley National Cente fo Physical Acoustics Univesity of
More informationAn Optimised Density Based Clustering Algorithm
Intenational Jounal of Compute Applications (0975 8887) Volume 6 No.9, Septembe 010 An Optimised Density Based Clusteing Algoithm J. Hencil Pete Depatment of Compute Science St. Xavie s College, Palayamkottai,
More informationA ROI Focusing Mechanism for Digital Cameras
A ROI Focusing Mechanism fo Digital Cameas Chu-Hui Lee, Meng-Feng Lin, Chun-Ming Huang, and Chun-Wei Hsu Abstact With the development and application of digital technologies, the digital camea is moe popula
More informationA Recommender System for Online Personalization in the WUM Applications
A Recommende System fo Online Pesonalization in the WUM Applications Mehdad Jalali 1, Nowati Mustapha 2, Ali Mamat 2, Md. Nasi B Sulaiman 2 Abstact foeseeing of use futue movements and intentions based
More informationDEADLOCK AVOIDANCE IN BATCH PROCESSES. M. Tittus K. Åkesson
DEADLOCK AVOIDANCE IN BATCH PROCESSES M. Tittus K. Åkesson Univesity College Boås, Sweden, e-mail: Michael.Tittus@hb.se Chalmes Univesity of Technology, Gothenbug, Sweden, e-mail: ka@s2.chalmes.se Abstact:
More informationEmbeddings into Crossed Cubes
Embeddings into Cossed Cubes Emad Abuelub *, Membe, IAENG Abstact- The hypecube paallel achitectue is one of the most popula inteconnection netwoks due to many of its attactive popeties and its suitability
More informationCSE 165: 3D User Interaction
CSE 165: 3D Use Inteaction Lectue #6: Selection Instucto: Jugen Schulze, Ph.D. 2 Announcements Homewok Assignment #2 Due Fiday, Januay 23 d at 1:00pm 3 4 Selection and Manipulation 5 Why ae Selection and
More informationA Memory Efficient Array Architecture for Real-Time Motion Estimation
A Memoy Efficient Aay Achitectue fo Real-Time Motion Estimation Vasily G. Moshnyaga and Keikichi Tamau Depatment of Electonics & Communication, Kyoto Univesity Sakyo-ku, Yoshida-Honmachi, Kyoto 66-1, JAPAN
More informationFast quality-guided flood-fill phase unwrapping algorithm for three-dimensional fringe pattern profilometry
Univesity of Wollongong Reseach Online Faculty of Infomatics - Papes (Achive) Faculty of Engineeing and Infomation Sciences 2010 Fast quality-guided flood-fill phase unwapping algoithm fo thee-dimensional
More informationA Two-stage and Parameter-free Binarization Method for Degraded Document Images
A Two-stage and Paamete-fee Binaization Method fo Degaded Document Images Yung-Hsiang Chiu 1, Kuo-Liang Chung 1, Yong-Huai Huang 2, Wei-Ning Yang 3, Chi-Huang Liao 4 1 Depatment of Compute Science and
More informationComparisons of Transient Analytical Methods for Determining Hydraulic Conductivity Using Disc Permeameters
Compaisons of Tansient Analytical Methods fo Detemining Hydaulic Conductivity Using Disc Pemeametes 1,,3 Cook, F.J. 1 CSRO Land and Wate, ndoooopilly, Queensland The Univesity of Queensland, St Lucia,
More informationVisual Servoing from Deep Neural Networks
Visual Sevoing fom Deep Neual Netwoks Quentin Bateux 1, Eic Machand 1, Jügen Leitne 2, Fançois Chaumette 3, Pete Coke 2 Abstact We pesent a deep neual netwok-based method to pefom high-pecision, obust
More informationPerformance Optimization in Structured Wireless Sensor Networks
5 The Intenational Aab Jounal of Infomation Technology, Vol. 6, o. 5, ovembe 9 Pefomance Optimization in Stuctued Wieless Senso etwoks Amine Moussa and Hoda Maalouf Compute Science Depatment, ote Dame
More informationAccurate Diffraction Efficiency Control for Multiplexed Volume Holographic Gratings. Xuliang Han, Gicherl Kim, and Ray T. Chen
Accuate Diffaction Efficiency Contol fo Multiplexed Volume Hologaphic Gatings Xuliang Han, Gichel Kim, and Ray T. Chen Micoelectonic Reseach Cente Depatment of Electical and Compute Engineeing Univesity
More informationNew Algorithms for Daylight Harvesting in a Private Office
18th Intenational Confeence on Infomation Fusion Washington, DC - July 6-9, 2015 New Algoithms fo Daylight Havesting in a Pivate Office Rohit Kuma Lighting Solutions and Sevices Philips Reseach Noth Ameica
More informationFrequency Domain Approach for Face Recognition Using Optical Vanderlugt Filters
Optics and Photonics Jounal, 016, 6, 94-100 Published Online August 016 in SciRes. http://www.scip.og/jounal/opj http://dx.doi.og/10.436/opj.016.68b016 Fequency Domain Appoach fo Face Recognition Using
More informationKalman filter correction with rational non-linear functions: Application to Visual-SLAM
1 Kalman filte coection with ational non-linea functions: Application to Visual-SLAM Thomas Féaud, Roland Chapuis, Romuald Aufèe and Paul Checchin Clemont Univesité, Univesité Blaise Pascal, LASMEA UMR
More informationMassachusetts Institute of Technology Department of Mechanical Engineering
cm cm Poblem Massachusetts Institute of echnolog Depatment of Mechanical Engineeing. Intoduction to obotics Sample Poblems and Solutions fo the Mid-em Exam Figue shows a obotic vehicle having two poweed
More informationThe EigenRumor Algorithm for Ranking Blogs
he EigenRumo Algoithm fo Ranking Blogs Ko Fujimua N Cybe Solutions Laboatoies N Copoation akafumi Inoue N Cybe Solutions Laboatoies N Copoation Masayuki Sugisaki N Resonant Inc. ABSRAC he advent of easy
More informationGravitational Shift for Beginners
Gavitational Shift fo Beginnes This pape, which I wote in 26, fomulates the equations fo gavitational shifts fom the elativistic famewok of special elativity. Fist I deive the fomulas fo the gavitational
More informationCommunication vs Distributed Computation: an alternative trade-off curve
Communication vs Distibuted Computation: an altenative tade-off cuve Yahya H. Ezzeldin, Mohammed amoose, Chistina Fagouli Univesity of Califonia, Los Angeles, CA 90095, USA, Email: {yahya.ezzeldin, mkamoose,
More informationTitle. Author(s)NOMURA, K.; MOROOKA, S. Issue Date Doc URL. Type. Note. File Information
Title CALCULATION FORMULA FOR A MAXIMUM BENDING MOMENT AND THE TRIANGULAR SLAB WITH CONSIDERING EFFECT OF SUPPO UNIFORM LOAD Autho(s)NOMURA, K.; MOROOKA, S. Issue Date 2013-09-11 Doc URL http://hdl.handle.net/2115/54220
More informationSimulation and Performance Evaluation of Network on Chip Architectures and Algorithms using CINSIM
J. Basic. Appl. Sci. Res., 1(10)1594-1602, 2011 2011, TextRoad Publication ISSN 2090-424X Jounal of Basic and Applied Scientific Reseach www.textoad.com Simulation and Pefomance Evaluation of Netwok on
More informationOptimal Sporadic Location Privacy Preserving Systems in Presence of Bandwidth Constraints
Optimal Spoadic Location Pivacy Peseving Systems in Pesence of Bandwidth Constaints ABSTRACT Michael Hemann KU Leuven ESAT/COSIC, iminds Leuven, Belgium michael.hemann@esat.kuleuven.be Claudia Diaz KU
More informationDynamic Topology Control to Reduce Interference in MANETs
Dynamic Topology Contol to Reduce Intefeence in MANETs Hwee Xian TAN 1,2 and Winston K. G. SEAH 2,1 {stuhxt, winston}@i2.a-sta.edu.sg 1 Depatment of Compute Science, School of Computing, National Univesity
More informationA VECTOR PERTURBATION APPROACH TO THE GENERALIZED AIRCRAFT SPARE PARTS GROUPING PROBLEM
Accepted fo publication Intenational Jounal of Flexible Automation and Integated Manufactuing. A VECTOR PERTURBATION APPROACH TO THE GENERALIZED AIRCRAFT SPARE PARTS GROUPING PROBLEM Nagiza F. Samatova,
More informationMULTI-TEMPORAL AND MULTI-SENSOR IMAGE MATCHING BASED ON LOCAL FREQUENCY INFORMATION
Intenational Achives of the Photogammety Remote Sensing and Spatial Infomation Sciences Volume XXXIX-B3 2012 XXII ISPRS Congess 25 August 01 Septembe 2012 Melboune Austalia MULTI-TEMPORAL AND MULTI-SENSOR
More informationCOLOR EDGE DETECTION IN RGB USING JOINTLY EUCLIDEAN DISTANCE AND VECTOR ANGLE
COLOR EDGE DETECTION IN RGB USING JOINTLY EUCLIDEAN DISTANCE AND VECTOR ANGLE Slawo Wesolkowski Systems Design Engineeing Univesity of Wateloo Wateloo (Ont.), Canada, NL 3G s.wesolkowski@ieee.og Ed Jenigan
More informationScaling Location-based Services with Dynamically Composed Location Index
Scaling Location-based Sevices with Dynamically Composed Location Index Bhuvan Bamba, Sangeetha Seshadi and Ling Liu Distibuted Data Intensive Systems Laboatoy (DiSL) College of Computing, Geogia Institute
More informationMonte Carlo Techniques for Rendering
Monte Calo Techniques fo Rendeing CS 517 Fall 2002 Compute Science Conell Univesity Announcements No ectue on Thusday Instead, attend Steven Gotle, Havad Upson Hall B17, 4:15-5:15 (efeshments ealie) Geomety
More informationColor Correction Using 3D Multiview Geometry
Colo Coection Using 3D Multiview Geomety Dong-Won Shin and Yo-Sung Ho Gwangju Institute of Science and Technology (GIST) 13 Cheomdan-gwagio, Buk-ku, Gwangju 500-71, Republic of Koea ABSTRACT Recently,
More informationAn Extension to the Local Binary Patterns for Image Retrieval
, pp.81-85 http://x.oi.og/10.14257/astl.2014.45.16 An Extension to the Local Binay Pattens fo Image Retieval Zhize Wu, Yu Xia, Shouhong Wan School of Compute Science an Technology, Univesity of Science
More informationObstacle Avoidance of Autonomous Mobile Robot using Stereo Vision Sensor
Obstacle Avoidance of Autonomous Mobile Robot using Steeo Vision Senso Masako Kumano Akihisa Ohya Shin ichi Yuta Intelligent Robot Laboatoy Univesity of Tsukuba, Ibaaki, 35-8573 Japan E-mail: {masako,
More informationHand Tracking and Gesture Recognition for Human-Computer Interaction
Electonic Lettes on Compute Vision and Image Analysis 5(3):96-104, 2005 Hand Tacking and Gestue Recognition fo Human-Compute Inteaction Cistina Manesa, Javie Vaona, Ramon Mas and Fancisco J. Peales Unidad
More informationAnalysis of Wired Short Cuts in Wireless Sensor Networks
Analysis of Wied Shot Cuts in Wieless Senso Netwos ohan Chitaduga Depatment of Electical Engineeing, Univesity of Southen Califonia, Los Angeles 90089, USA Email: chitadu@usc.edu Ahmed Helmy Depatment
More informationLecture 27: Voronoi Diagrams
We say that two points u, v Y ae in the same connected component of Y if thee is a path in R N fom u to v such that all the points along the path ae in the set Y. (Thee ae two connected components in the
More informationSYSTEM LEVEL REUSE METRICS FOR OBJECT ORIENTED SOFTWARE : AN ALTERNATIVE APPROACH
I J C A 7(), 202 pp. 49-53 SYSTEM LEVEL REUSE METRICS FOR OBJECT ORIENTED SOFTWARE : AN ALTERNATIVE APPROACH Sushil Goel and 2 Rajesh Vema Associate Pofesso, Depatment of Compute Science, Dyal Singh College,
More informationThreat assessment for avoiding collisions with turning vehicles
Theat assessment fo avoiding collisions with tuning vehicles Mattias Bännstöm, Eik Coelingh and Jonas Sjöbeg Abstact This pape pesents a method fo estimating how the dive of a vehicle can use steeing,
More informationRanking Visualizations of Correlation Using Weber s Law
Ranking Visualizations of Coelation Using Webe s Law Lane Haison, Fumeng Yang, Steven Fanconei, Remco Chang Abstact Despite yeas of eseach yielding systems and guidelines to aid visualization design, pactitiones
More informationOn Error Estimation in Runge-Kutta Methods
Leonado Jounal of Sciences ISSN 1583-0233 Issue 18, Januay-June 2011 p. 1-10 On Eo Estimation in Runge-Kutta Methods Ochoche ABRAHAM 1,*, Gbolahan BOLARIN 2 1 Depatment of Infomation Technology, 2 Depatment
More informationExtension of Reeds & Shepp Paths to a Robot with Front and Rear Wheel Steer
Extension of Reeds & Shepp Paths to a Robot with Font and Rea Wheel Stee Siddhath Sanan+, Dashan Santani+, K Madhava Kishna* and Heny Hexmoo $ +Manipal Institute of Technology, Manipal, India. sidsanan@yahoo.com
More informationAnnales UMCS Informatica AI 2 (2004) UMCS
Pobane z czasopisma Annales AI- Infomatica http://ai.annales.umcs.pl Annales Infomatica AI 2 (2004) 33-340 Annales Infomatica Lublin-Polonia Sectio AI http://www.annales.umcs.lublin.pl/ Embedding as a
More informationPositioning of a robot based on binocular vision for hand / foot fusion Long Han
2nd Intenational Confeence on Advances in Mechanical Engineeing and Industial Infomatics (AMEII 26) Positioning of a obot based on binocula vision fo hand / foot fusion Long Han Compute Science and Technology,
More informationEffective Missing Data Prediction for Collaborative Filtering
Effective Missing Data Pediction fo Collaboative Filteing Hao Ma, Iwin King and Michael R. Lyu Dept. of Compute Science and Engineeing The Chinese Univesity of Hong Kong Shatin, N.T., Hong Kong { hma,
More informationSpiral Recognition Methodology and Its Application for Recognition of Chinese Bank Checks
Spial Recognition Methodology and Its Application fo Recognition of Chinese Bank Checks Hanshen Tang 1, Emmanuel Augustin 2, Ching Y. Suen 1, Olivie Baet 2, Mohamed Cheiet 3 1 Cente fo Patten Recognition
More informationFifth Wheel Modelling and Testing
Fifth heel Modelling and Testing en Masoy Mechanical Engineeing Depatment Floida Atlantic Univesity Boca aton, FL 4 Lois Malaptias IFMA Institut Fancais De Mechanique Advancee ampus De lemont Feand Les
More informationVoting-Based Grouping and Interpretation of Visual Motion
Voting-Based Gouping and Intepetation of Visual Motion Micea Nicolescu Depatment of Compute Science Univesity of Nevada, Reno Reno, NV 89557 micea@cs.un.edu Géad Medioni Integated Media Systems Cente Univesity
More information5 4 THE BERNOULLI EQUATION
185 CHATER 5 the suounding ai). The fictional wok tem w fiction is often expessed as e loss to epesent the loss (convesion) of mechanical into themal. Fo the idealied case of fictionless motion, the last
More informationAugmented Reality. Integrating Computer Graphics with Computer Vision Mihran Tuceryan. August 16, 1998 ICPR 98 1
Augmented Reality Integating Compute Gaphics with Compute Vision Mihan Tuceyan August 6, 998 ICPR 98 Definition XCombines eal and vitual wolds and objects XIt is inteactive and eal-time XThe inteaction
More informationDesired Attitude Angles Design Based on Optimization for Side Window Detection of Kinetic Interceptor *
Poceedings of the 7 th Chinese Contol Confeence July 6-8, 008, Kunming,Yunnan, China Desied Attitude Angles Design Based on Optimization fo Side Window Detection of Kinetic Intecepto * Zhu Bo, Quan Quan,
More informationMonte Carlo Simulation for the ECAT HRRT using GATE
Monte Calo Simulation fo the ECAT HRRT using GATE F. Bataille, C. Comtat, Membe, IEEE, S. Jan, and R. Tébossen Abstact The ECAT HRRT (High Resolution Reseach Tomogaph, CPS Innovations, Knoxville, TN, U.S.A.)
More informationTransmission Lines Modeling Based on Vector Fitting Algorithm and RLC Active/Passive Filter Design
Tansmission Lines Modeling Based on Vecto Fitting Algoithm and RLC Active/Passive Filte Design Ahmed Qasim Tuki a,*, Nashien Fazilah Mailah b, Mohammad Lutfi Othman c, Ahmad H. Saby d Cente fo Advanced
More informationA New Finite Word-length Optimization Method Design for LDPC Decoder
A New Finite Wod-length Optimization Method Design fo LDPC Decode Jinlei Chen, Yan Zhang and Xu Wang Key Laboatoy of Netwok Oiented Intelligent Computation Shenzhen Gaduate School, Habin Institute of Technology
More informationConversion Functions for Symmetric Key Ciphers
Jounal of Infomation Assuance and Secuity 2 (2006) 41 50 Convesion Functions fo Symmetic Key Ciphes Deba L. Cook and Angelos D. Keomytis Depatment of Compute Science Columbia Univesity, mail code 0401
More informationA Minutiae-based Fingerprint Matching Algorithm Using Phase Correlation
A Minutiae-based Fingepint Matching Algoithm Using Phase Coelation Autho Chen, Weiping, Gao, Yongsheng Published 2007 Confeence Title Digital Image Computing: Techniques and Applications DOI https://doi.og/10.1109/dicta.2007.4426801
More informationPOMDP: Introduction to Partially Observable Markov Decision Processes Hossein Kamalzadeh, Michael Hahsler
POMDP: Intoduction to Patially Obsevable Makov Decision Pocesses Hossein Kamalzadeh, Michael Hahsle 2019-01-02 The R package pomdp povides an inteface to pomdp-solve, a solve (witten in C) fo Patially
More informationvaiation than the fome. Howeve, these methods also beak down as shadowing becomes vey signicant. As we will see, the pesented algoithm based on the il
IEEE Conf. on Compute Vision and Patten Recognition, 1998. To appea. Illumination Cones fo Recognition Unde Vaiable Lighting: Faces Athinodoos S. Geoghiades David J. Kiegman Pete N. Belhumeu Cente fo Computational
More informationWearable inertial sensors for arm motion tracking in home-based rehabilitation
Book Title Book Editos IOS Pess, 005 Weaable inetial sensos fo am motion tacking in home-based ehabilitation Huiyu Zhou a,, Huosheng Hu a and Nigel Hais b a Univesity of Essex, Colcheste, CO4 3SQ, UK b
More informationDrag Optimization on Rear Box of a Simplified Car Model by Robust Parameter Design
Vol.2, Issue.3, May-June 2012 pp-1253-1259 ISSN: 2249-6645 Dag Optimization on Rea Box of a Simplified Ca Model by Robust Paamete Design Sajjad Beigmoadi 1, Asgha Ramezani 2 *(Automotive Engineeing Depatment,
More informationEfficient protection of many-to-one. communications
Efficient potection of many-to-one communications Miklós Molná, Alexande Guitton, Benad Cousin, and Raymond Maie Iisa, Campus de Beaulieu, 35 042 Rennes Cedex, Fance Abstact. The dependability of a netwok
More informationAutomatically Testing Interacting Software Components
Automatically Testing Inteacting Softwae Components Leonad Gallaghe Infomation Technology Laboatoy National Institute of Standads and Technology Gaithesbug, MD 20899, USA lgallaghe@nist.gov Jeff Offutt
More information3D Periodic Human Motion Reconstruction from 2D Motion Sequences
3D Peiodic Human Motion Reconstuction fom D Motion Sequences Zonghua Zhang and Nikolaus F. Toje BioMotionLab, Depatment of Psychology Queen s Univesity, Canada zhang, toje@psyc.queensu.ca Abstact In this
More informationTopic -3 Image Enhancement
Topic -3 Image Enhancement (Pat 1) DIP: Details Digital Image Pocessing Digital Image Chaacteistics Spatial Spectal Gay-level Histogam DFT DCT Pe-Pocessing Enhancement Restoation Point Pocessing Masking
More informationVehicle Chassis Control Using Adaptive Semi-Active Suspension
Poceedings of the 17th Wold Congess The Intenational Fedeation of Automatic Contol Vehicle Chassis Contol Using Adaptive Semi-Active Suspension V. Sankaanaayanan, Sinan Oncu, Dince Ocan, and Levent Güvenç
More informationMulti-Objective Analysis of Ridesharing in Automated Mobility-on-Demand
Robotics: Science and Systems 018 Pittsbugh, PA, USA, June 6-30, 018 Multi-Objective Analysis of Rideshaing in Automated Mobility-on-Demand Michal Čáp and Javie Alonso-Moa Dept. of Cognitive Robotics,
More informationProf. Feng Liu. Fall /17/2016
Pof. Feng Liu Fall 26 http://www.cs.pdx.edu/~fliu/couses/cs447/ /7/26 Last time Compositing NPR 3D Gaphics Toolkits Tansfomations 2 Today 3D Tansfomations The Viewing Pipeline Mid-tem: in class, Nov. 2
More informationParallel processing model for XML parsing
Recent Reseaches in Communications, Signals and nfomation Technology Paallel pocessing model fo XML pasing ADRANA GEORGEVA Fac. Applied Mathematics and nfomatics Technical Univesity of Sofia, TU-Sofia
More information