Implicit Representation of Molecular Surfaces

Size: px
Start display at page:

Download "Implicit Representation of Molecular Surfaces"

Transcription

1 Imliit Reresentation of Moleular Surfaes Julius Parulek Ivan Viola Deartment of Informatis, University of Bergen Deartment of Informatis, University of Bergen. (a) (b) () (d) (e) (f) (g) (h) Figure : Ray-asting based visualization of eight roteins reresented by the solvent exluded surfaes (SES). Surfaes are defined by imliit funtions omuted loally and without erforming any reomutation stes. The roteins ontain 3023 (a), 2872 (b), 2820 (), 3346 (d), 2530 (e), 2555 (f), 78 (g) and 4744 (h). Small disontinuities are aused by the reision arameter that aets a lose viinity of the 0 iso-level of the imliit funtion. A BSTRACT Moleular surfaes are an established tool to analyze and to study the evolution and interation of moleules. One of the most advaned reresentations of moleular surfaes is alled the solvent exluded surfae. We resent a novel and a simle method for reresenting the solvent exluded surfaes (SES). Our method requires no reomutation and therefore allows us to vary SES arameters outright. We utilize the theory of imliit surfaes and their CSG oerations to omose the imliit funtion reresenting the moleular surfae loally. This funtion returns a minimal distane to the SES reresentation. Additionally, negative values of the imliit funtion determine that the oint lies outside SES whereas ositive ones that the oint lies inside. We desribe how to build this imliit funtion omosed of three tyes of athes onstituting the SES reresentation. Finally, we roose a method to visualize the iso-surfae of the imliit funtion by means of ray-asting and the set of rendering arameters affeting the overall erformane. From the biomoleular oint of view, the struture of moleules is given by three-dimensional organization of atoms. While hemial struture of the atoms is often quite stable, the overall shae, generated by fore fields of atoms, an vary raidly. Therefore, to understand the shae in its full omlexity, virtual omuter models of moleules are instrumental. A seifi tye of moleules are roteins that atively artiiate in various ell roesses. Essentially, they are long-hained maromoleules that onsist of standard amino aids. These amino aids an ontain between 0 and 25 atoms eah, where tyially the moleular hain an ontain u to a few thousand of amino aids. The set of atoms that is ommon for every amino aid is alled the bakbone. The set of atoms onneted to the bakbone is alled the side hain and is unique for every amino aid. Many roteins are enzymes that need to be triggered by other biomoleules alled ligands. Suh roteins an, for instane, transort ligands to different arts of the ell or even between the ells. In the latter ase, these form so-alled hannels. In order to disover whih ligands an bind to a given rotein, one needs to ommuniate the rotein shae aordingly. A ommon aroah to reresent rotein surfae to disover the ligand binding site, is to utilize a solvent moleule, e.g. the water moleule. The reason is that the ligand an ratially aess all the laes that are reahable by the solvent itself. Therefore, one of the ossible strutural reresentations of the moleules is defined via the solvent whih an reveal ossible binding sites. In moleular visualization, many different methods of reresenting moleules have been roosed [3]. One an use different strutural reresentations like sae fill, balls-and-stiks, liorie, bakbone, and ribbon. These an be shown through distint illustrative Keywords: Visualization of Moleular Surfaes, Geometrial Modeling, Imliit Surfaes, Bioinformatis Visualization Index Terms: J.3 [Comuter Aliations]: Life and Medial Sienes Biology and Genetis I.3.4 [COMPUTER GRAPHICS]: Comutational Geometry and Objet Modeling Boundary reresentations, Curve, surfae, solid, and objet reresentations Julius.Parulek@uib.no ivan.viola@uib.no IEEE Paifi Visualisation Symosium February - 2 Marh, Songdo, Korea /2/$ IEEE I NTRODUCTION 27

2 tehniques, e.g. artoon reresentation, or by means of emhasizing the deth eretion like halos and ambient olusion [28]. One of the most emloyed advaned reresentations of moleular surfaes is alled the solvent exluded surfae (SES), whih was first roosed by Rihards [2]. So far, SES beame a very well established reresentation of the iso-surfae aroximating the otential field of atoms while taking into onsideration the solvent moleule. The main utilization of SES reresentation is studying the moleular dynamis in order to disover ligand binding sites and their evolution over the moleular dynami simulation. It is imortant to mention that one an aly more omlex, hysially-lausible models, whih inlude eletrostati otential fields (EPF). The major advantage of using SES reresentation with reset to EPF-based reresentation is its relatively fast omutation mainly when dealing with large moleular dynami simulations (MDS) ontaining several thousands of animation frames. The EPF models are omutationally very extensive and are usually rasterized via artial differential equations on a regular grid. Although, when suh reresentation is reomuted, one an ombine SES and EPF reresentations into a merged visualization. The SES reresentation is obtained by rolling a solvent moleule (aroximated by a shere of radius R) on the so-alled solventaessible surfae (SAS). The SAS is reresented as the boundary of extended van der Waals sheres by radius R. The resulting SES then deomoses into three tyes of surfae athes: onvex sherial athes, onave sherial athes (sherial triangles) and toroidal athes (Fig. 2). Figure 2: An examle of a moleular surfae. The solvent exluded surfae (union of full irles and their toroidal interonnetions) is formed by rolling a ball (blue irle) on van der Waals sheres while the enter lies on the boundary of solvent aessible surfae (union of dashed irles). The SES reresentation deits a single residual sequene of roteinase 3 (Pr3) etide ontaining 360 atoms. The SES surfae an be be desribed by three tyes of athes, the onvex sherial one (green), the onave sherial one (blue) and the toroidal one (red). The main drawbak when using SES reresentation in visual exloration is the lak of interativity, sine the geometri SES reresentation requires usually substantial reomution [24, 30]. Here, to delimit the atom seletion, artiiating in the SES reresentation, or just to adjust the solvent radius R, requires rereating the entire surfae. The essential arameter settings interation during the visual exloration of a maromoleule an not be erformed in realtime. Moreover, to reresent the surfae for time-varying rotein simulations the heavy load is ut to the reomutation ste even further. Essentially, one needs to to reroess several time-stes in advane. Therefore, biologists often refer to limit the bindingsite analysis to the artiular key frames of the simulation. With the reent advane of omutational hardware aabilities, larger and larger dynami rotein sequenes are being rodued, whih learly demands more flexible SES reresentation that would allow for an instant surfae reresentation without having done any reomutational stes. In this aer, we roose a novel aroah to reresent SES surfae without reomutation. Our new reresentation is based on theory of imliit surfaes, namely its generalization alled funtional reresentation [8]. We roose a rendering aroah to ahieve interative visualization by introduing several renderingquality arameters affeting the overall erformane. The instantaneous SES reresentation allows us to rovide interativity neessary for rotein analysis. Partiularly, we aim at roviding biologists with the ossibility of erforming hanges of solvent radius R and seeking atany timeintervals ofthesimulation. 2 RELATED WORK We relate our work to three areas. Firstly, we introdue tehniques of moleular visualization. Seondly, we desribe imliit modeling tehniques. Finally, we resent real-time rendering tehniques of imliits. 2. Visualization and Reresentation of Moleular Surfae There are several tyes of moleular surfae reresentations introdued in the literature. One of the basi reresentations is when the rotein atoms are deited as sheres, where the radius orresonds to the van der Waals fore (vdw surfae) [3]. The extension of this surfae by a solvent radius is alled the solvent aessible surfae (SAS). The most widely used reresentation is denoted as solvent exluded surfae (SES) [2, 6]. In 992, Edelsbrunner and Müke introdued α-shae reresentation and in 2007, Ryu et al. extended it to the β-shae. In 999, Edelsbrunner [4] also roosed a new reresentation of moleules alled the skin-surfae. In our work, we fous on reresenting and visualizing the SES reresentation, beause it is a standard tehnique and was requested by our biology ooeration artners for binding-site exloration. There has been a lot of effort ut into generation of SES in the literature. In 983, Connolly [3] roosed an analytial desrition of the SES reresentation. More than ten years later, Sanner et al. [24] resented the redued surfae algorithm for onstrution of SES reresentation. In the same year, Totrov and Abygyan introdued the ontour-buildu algorithm [30] to form the SES reresentation. Reently, Lindow et al. [4] roosed a seeding u and arallelization of ontour-buildu algorithm. The visualization is then erformed by a ray-asting method. In 2009, Krone et al. [] introdued the utilization of the redued surfae method for diret ray-asting of moleular surfaes. Here, all tehniques exloit reomutation stes neessary to render the final surfae. Triangularization methods of SES are oular as well, with the most reent ones being roosed in 2009 by Ryu et al. [22]. Additionally, SES an be deomosed into a set of quadris, whih an be effiiently rendered on the GPU (Setion 2.3). In 20, Krone et al. [2] introdued an aroximation of the SES reresentation via quadrati olynomial kernels. This work was aimed at the traking of rotein avities. Here, nevertheless, the resulting iso-surfae only imitates the exat SES reresentation. In our work, we utilize Protein Data Bank (PDB) file format, whih stores the rotein information (e.g., atom tyes, residual sequenes). The trajetories of the atoms are stored in the DCD file format that is used as a standard in the Visual Moleular Dynamis (VMD) tool [9]. The file an ontain tens of thousands of rotein trajetories. The other oular moleular viewers are for instane PyMOL [25], MetaMol [2] and QuteMol [28] to name a few. So far, none of these tools an visualize dynami trajetories and/or would allow for interative visual rotein exlorations. 28

3 To the best of our knowledge, there are no aroahes that would allow fordiretvisualization ofses reresentation without any reomutation. We ross this ga by introduing a new aroah that omutes the SES instantly on the fly during ray-asting. Contrary to the revious aroahes, we emloy a theory of imliit surfaes, where the geometry of a single atom is desribed by its distane based imliit funtion. 2.2 Imliit Modeling Imliit surfaes (imliits) rovide a way to easily model omlex dynamially hanging geometri objets. Moreover, they naturally enable the modeling of smooth, songe like objets in a onvenient way. The set of tehniques, known today as imliit modeling, was used for the first time by Blinn []. Pasko et al. generalized the reresentation of imliits, by ombination of the different forms of imliit models [8], and denoted it as funtion reresentation (Fre). The inequality () desribes an imliit solid (objet): f () 0, () where =(x,x 2,x 3 ) E 3. Funtion f is alled an imliit surfae funtion (imliit funtion), whih lassifies the sae into two half-saes f () > 0and f () < 0. Comlex objets an be reated from simle ones via Construtive Solid Geometry (CSG) oerations. The basi set-theoreti oerations an be defined using the min and max oerators: union( f, f 2 ) = f f 2 = max( f, f 2 ) intersetion( f, f 2 ) = f f 2 = min( f, f 2 ) subtration( f, f 2 ) = f \ f 2 = min( f, f 2 ). Analytial exressions that aroximate these oerators were roosed by Rii [20]. The other analytial definitions of the settheoreti oerations are known as R-funtions [8]. Nevertheless, the analytial versions do not reserve the distane harateristis as well as min/max oerators do [5]. Therefore, in our work we utilize the basi min and max oerators (2) sine they are fast to omute and reserve distane harateristis of the imliit funtion better. However, they are disontinuous where f = f 2.This has been studied by Fayolle [5]; whih we took as an insiration for our solution. 2.3 Real-time rendering of imliit objets In order to visualize models based on imliits, one an onvert them to a mesh reresentation rior to rendering them as a set of ath rimitives [6]. However, when dealing with omlex models and shaes, suh as for instane the moleular surfaes, one would need to generate millions of triangles to erform a fully detailed surfae reresentation. Therefore, in reent years, authors turn to diret visualization tehniques, whih is being reresented by ray-asting methods. Sine imlits enomass different forms of geometrial models, the atual ray-asting method is roosed aording to the tye of imliits we are dealing with. For examle, the ray-asting of algebrai surfaes is overed extensively by omuter grahis literature, whih goes bak several deades. Hanrahan introdued ray-asting of algebrai imliit models u to the fourth order [7]. Later work addressed ray-asting of large number of quadris on GPU aimed at moleular visualization as well [29, 9, 5]. Later on, Sigg et al. [26] introdued very fast GPU rendering of sheres, ellisoids and ylinders fousing mainly at moleular rendering. Nevertheless, these aers assume that the inut set of quadris is already formed, whih is not the ase with our instant imliit reresentation. In 992, Hart introdued a more robust aroah for ray-asting of distane based imliit surfaes alled shere traing [8]. Sine (2) in our work, we are dealing with distane based imliit funtions also, we adoted Hart s tehnique, beause it is easy to imlement and erforms very well on distane based surfaes. The reent work addresses ray-asting of general imliit surfaes on GPU using interval arithmetis [0] and via so-alled adative marhing oint method [27]. However, their methods assume that the funtion is defined globally, whereas our funtion is omuted loally only. 3 METHOD OVERVIEW Our algorithm omutes the imliit funtion reresenting SES on the fly during ray-asting. This funtion returns the minimal distane from a samle oint (given on a ray) to the surfae. To omute the funtion, the following roedures are erformed. The k losest atoms to the oint are retrieved in the asending order. Aording to the number of atoms k the funtion f SES is generated. Here, all ossible airs ( k 2) of atoms are tested, whether there might be an intersetion between their solvent extended isosurfaes. If the test is ositive, the intersetion oint that is the losest one to is estimated and stored. Then all ossible trilets ( k) 3 are heked aording to the retrieved air-wise intersetion oints and neighboring atoms. Again, if the test is ositive, the intersetion oint of the trilet is estimated and stored. To evaluate f SES all the stored intersetion oints then generate the solvent shere funtion. Afterwards, using omuted f SES, the ray is advaned to a next oint, by the funtion value. When the value of f SES is lose to 0 (to the iso-surfae), a deth and a normal at the oint are stored. The imlementation of our ray-asting method is erformed and arallelized using CUDA, where the ray-traversal and the funtion evaluation is done er every image ixel. Finally, aording to the stored deth values and the omuted normals, we erform the shading omutation and enhane the deth eretion by means of sreen sae ambient olusion [7]. 4 SES REPRESENTATION Let us first introdue the geometrial basis allowing us to reresent the surfae using imliit modeling tehniques. The goal is to define an imliit funtion desribing the surfae in a ertain 3D neighborhood of a given oint, in order to evaluate f SES (). The imliit funtion f SES fulfils the following roerties: for the given 3D oint the funtion f SES () will return the minimal distane to SES reresentation. f SES () > 0for inside the objet, f SES () < 0for outside the objet and f SES ()=0 means the lies on the boundary (iso-surfae). funtion f SES is C ontinuous in a neighborhood of the surfae, i.e. gradient f SES is ontinuous in this neighborhood. Let us assume that the set of atoms is defined as C = {(,r ),...,( n,r n )}) with the solvent radius defined by R. We define a set of imliit funtions (imliits) defined as F = { f, f 2,..., f n }, where eah f i () =r i i reresents an atom i with the orresonding van der Waals radius r i. Note that funtion f delimits the sae into the interior and the boundary ( f 0) and the exterior ( f < 0) half-sae. We also define an extended set of imliits, where shere atoms are enlarged by the solvent radius R, asg = {g = f + R,g 2 = f 2 + R,...,g n = f n + R}. Sine f i and g i are distane funtions the gradient of both is defined via f i ()= g i ()= i i. Additionally, we define a set of atom enters S that are loser to a oint than 2R, S = { i f i () 2R i C}. The set S C delimits the oint set C to atoms that might artiiate in 29

4 generating the surfae (Fig. 3a), aording to the oint that is a arameter of the imliit funtion. The exression of set S is derived diretly from the detetion of two inident atoms whih holds if i j < 2R + r i + r j (Fig. 3b). (a) 2R Figure 3: Forming the oint set S. a) Out of all the oints, the set S ontains those whih belong to the area of influene of the oint (full irles). b) The oint lies above the R distane from the atom 2, but it might still artiiate in forming the final iso-surfae. After forming set S the resulting funtion an be exressed as follows: f SES ()= f SAS () (R x ), (3) x fsas (0) where f SAS is defined as follows: 2R (b) R to both iso-surfaes of g and g 2,i.e. = g () g () and 2 = g 2 () g 2 () (Fig. 5b). Now we define a rediate B 2 g ( 2 ) 0 g 2 ( ) 0, (6) whih reresents whether oint lies within the the toriodal setion. Furthermore we define a distane based imliit funtion desribing the surfae inside the toroidal setion. In order to do so, we exloit the fat that the toroidal iso-surfae an be defined as minimal distane of to the oints belonging to the intersetion irle of g and g 2, I = {x g (x) =g 2 (x) =0}. However, omutation of all the oints would be very imratial. Therefore, we omute only the losest oint x 2 I to diretly x 2 = argmin x I x. (7) One we have this oint x 2, we define the resulting imliit funtion f S ()= f 2, onneting and 2, as follows: { R x 2 if B f 2 ()= 2 (8) f () f 2 () otherwise, where f () f 2 () is required to merge smoothly the toroidal ath with the both sheres. Figure 4 demonstrates the resulting imliit funtion iso-lines of the analogous senario in 2D. Note that the resulting funtion orretly omutes distane values u to the extent of R from the SES iso-surfae. S f SAS ()= g i (), (4) i= where the S i= g i = max{g,...,g S }. The term fsas (0) reresents all iso-surfae oints of the funtion f SAS, on whih the union of the solvent sheres is erformed. This union is subsequently subtrated from the f SAS. The formula (3), however; does not have a losed form solution. Therefore, our solution, reroduing Eq. 3, is based on building, in a iee-wise fashion, the SES imliit funtion aording to a given oint and the size of the set S, S = k. We denote the resulting imliit funtion as f SES ()= f S (). In the following setions, we desribe the onstrution of f S aording to S. We introdue four essential ases, i.e. when S ontains no atom, one atom, two atoms, and three or more atoms. The first two ases an be solved easily. When there is no atom inluded in S, the imliit funtion is defined as n f SES ()= f i (). (5) i= In ratie, sine there is no atom in 2R neighborhood of the oint, we an set the f SES () = 2R, in order not to evaluate all the oints. In a ase when there is only a single atom loser to than 2R, S = { }, the resulting f S () is defined solely by the atom, f S ()= f (). 4. Toroidal imliit funtion In a ase when there are two atoms loser to than 2R, S = 2, the resulting f S () desribes a toroidal ath that blends smoothly with both atom sheres. Let us assume that S = {, 2 }. We firstly detet whether oint lies in the toroidal setion of both extended sheres, g and g 2 (Fig. 5a, the blue triangle). The toroidal setion lis the toroidal iso-surfae within the ossible extent. In order to assess whether oint lies inside this area, we firstly generate two oints and 2 that are rojetions of the oint Figure 4: A 2D version of the toroidal imliit funtion with rendered iso-levels. The funtion returns orret distane values from the surfae u to R distane from the surfae (arrows). To evaluate the intersetion oint x 2 of g and g 2 we exloit Newton s iterative formula. The natural solution would be to utilize an analytial aroah to solve the intersetion of two sheres; nevertheless we aim at roviding a more robust aroah that ould ossibly handle other tyes of atom reresentation than sheres. For examle, in a ase when two atoms are very lose to eah other (overlaing) they an be aroximated by an imliit tube, whih an our quite frequently. Additionally we estimate the losest intersetion oint only, whih is a rerequisite for Eq. 8. Therefore, we aroximate both extended funtions g and g 2 at an unknown oint x,whereg (x)=g 2 (x)=0, by means of their first order Taylor exansion at oints g () and g 2 (): 0 = g (x) g () (x ) g () 0 = g 2 (x) g 2 () (x ) g 2 (), where (x ) exresses the vetor leading to the desired oint x. Additionally, it is required that the vetor (x ) lies in a lane (9) 220

5 erendiular to both gradients g () and g 2 () (Fig. 5): ( g () g 2 ()) (x )=0. (0) Using Eqs (6,9,0), we obtain a system of three linear equations where we would like to exress an unknown oint x from: g () g () g 2 () =(x ) g 2 () () 0 g () g 2 () (a) x-2 g 2 (b) g2 By denoting the matrix of gradients as M() for the oint, and the left side vetor of the equation by v() T, the solution an be obtained by x = v() T M() + (2) Please note that when B 2, the oint lies in the lose viinity of oint x. However, it is still an aroximation, and it is neessary to iterate through system () numerous times. Eq. 2 hanges then to: x i+ = v(x i ) T M(x i ) + x i, (3) where x 0 = is the initial guess. The formula (3) has been already utilized to omute the intersetion of two imliit funtions in [5], whih was aimed at generating distane aroximation of boolean oerations on funtional reresented objets. The system (3) stos when the oint x lies in lose viinity (ε N ) of both iso-surfaes, g (x) ε N g 2 (x) ε N. Here, we an delimit the number of the maximal number of stes, sine the oint lies lose to x. For instane we evaluated an average number of stes required for x 2 evaluation between two sheres, for ε N = 0.000, to 3 7stes. In a ase when a self-intersetion ours i.e the ondition desribed by Ryu et al. [23] (Fig. 5e), we benefit from the fat that oint x 2 always lies losest to oint (7). Therefore, selfintersetion is takled imliitly, whih is an another reason for referring Newton s iterative method over the analytial root finding. In Figure 5d, we showase the final toroidal iso-surfae for two atoms, where we also demonstrate the self-intersetion senario (Fig. 5f). In the following, the intersetion oint x retrieved via () between g i and g j is denoted as x i j. 4.2 Sherial triangle imliit funtion In a ase when there are three or more oints loser to than 2R, S 3, the resulting f S () desribes a sherial triangle. Here, the resulting funtion reate sherial triangle ath that blends smoothly with three toroidal athes. For simliity, let us assume that S ontains only 3 oints, S = {, 2, 3 }. In order to disover whether oint lies in the sherial triangle setion (liing the sherial triangle), we will exloit the intersetion oints omuted in the revious ase. Firstly, we extend the rediates B 2 (6) to B 2 to enomass not only toroidal setion but also an additional region that might be enomassed by the area of influene of the third oint 3 (Fig. 6a). Additionally, it must be fulfilled that intersetion oint x 2, obtained via (), lies within the oosite extended imliit funtion g 3 (Fig. 6b). Therefore, the new rediate B i j is defined as follows: B 2 g () R g 2 () R g 3 (x 2 ), (4) where g 3 (x 2 ) is the extended funtion of the third oint evaluated at the intersetion oint of g i and g j. Now, in order to determine whether oint lies inside the sherial triangle setion, we defined rediate B 2 3 as follows: B 2 3 B 2 B 3 B 2 3. (5) g g 2 () x-2 (e) Figure 5: Forming the toroidal ath for two atoms. a) The toroidal ath (red) lies only in the area marked by the blue triangle. b) In order to determine that the given oint belongs to this area, we erform () rojetion of B to iso-surfaes g ( )=0 and g 2 ( 2 )=0 and (2) evaluation of both funtions for oosite oints. ) In a ase that the oint lies inside the toroidal setion, we retrieve the intersetion oint x 2 of g and g 2 using the fat that the vetor (x 2 ) lies in the lane erendiular to both gradients g () and g 2 (). d)the visualization of the toroidal ath. The atoms are lose enough to get the ontinuous iso-surfae. e) Self-intersetion an our when the solvent is thiker than the height of the atual toroidal setion. f) The visualization of the self-interseted toroidal ath. Visual omarison of forming a onave sherial ath using original rediates B and their udated version B is shown in Figure 6 and 6d. Furthermore, in order to seify the sherial imliit funtion defined by, 2 and 3, we loate an intersetion oint fulfilling g (x) =g 2 (x) =g 3 (x) =0. Aordingly, we define the resulting imliit funtion f S ()= f 2 3, onneting, 2 and 3,asfollows: f 2 3 ()= { R x 2 3 if B 2 3 f 2 () f 3 () f 2 3 () otherwise, (6) where the seond branh is required to smoothly onnet the sherial triangle with the all three toroidal athes. In order to loate the oint x, we utilize Newton s iterative method of root finding of all three funtions, where the system () hanges to the following: g () g 2 () g 3 () =(x ) g () g 2 () g 3 (). (d) (f) (7) In order to solve (7) we utilize again the iterative formula resented in (3). The system (7) stos when the oint x lies in lose viinity (ε N ) of all three iso-surfaes, g (x) ε N g 2 (x) ε N g 2 (x) ε N. The definition of f S () for all the oints in S is straightforward: f S ()= (i, j,k) ( S 3 ) f i j k (). (8) 22

6 Similarly to the revious ase, when a self-intersetion ours; we utilize the fat that oint x 2 3 lies losest to oint and the self-intersetion is takled imliitly (Fig. 6e). We showased the examle omosed of 2 atoms in Figure 6f. x -2 3 (a) x-2 (b) () (d) (e) (f) Figure 6: The formation of the sherial triangle ath. a) Evaluation of the rediate B 2. The oint x 2, reresenting the intersetion of g and g 2, must lie inside the area of influene of g 3. Therefore the area (the blue ellise) for x 2 estimation is extended to all the oints that fulfil g () R g 2 () R. b) One the intersetion oint x 2 is omuted, it is evaluated against the third extended funtion g 3 (x 2 ) 0 (Eq. 4). ) When using the original rediates artifats an aear aused by the fat that the intersetion oint x i j lies too far away from the oint k. d) The examle of the orreted rediate B, where the raks disaeared. e) The self-intersetion issue is solved imliitly using the roerty of the oint x 2 3.f)Anexamle of the SES, defined by (8), omosed of 2 atoms. 5 IMPLEMENTATION Our imlementation of the visualization ieline is erformed using modern GP-GPU tehniques, namely CUDA and GLSL. On CUDA, we erform the ray-asting of the whole sene and store the iso-surfae oints and their normals. Afterwards, using GLSL shaders we erform an image based enhanement by means of the sreen sae ambient olusion [7]. The arallelization is done on the ray basis, where a single ray is generated for every ixel. 5. Data Struture The ruial art of our method is to retrieve the set S that reresents all neighboring oints that might artiiate in forming the funtion. There have been several effiient GPU strutures roosed to retrive k-losest oints to a given one [33]. Nevertheless, we utilize a simle and straightforward aroah that is based on an uniform satial subdivision. This has has been already utilized by the broader moleular visualization ommunity [, 4]. The atoms are sorted into ubi voxels with a lateral length of 2radius max + 2R max,whereradius max reresents maximum (van der Waals) radius of all inluded atoms and R max reresents maximal allowed radius of the solvent. We set the maximal allowed radius to 2, whih means that values of R an be interatively varied from 0 to 2. The sorting of the atoms into the grid is done in O(n), whih also reresents the only and the neessary reomutation ste in our ieline. Then in order to build the set S it is required to visit 3x3x3 neighboring voxels for a given oint. Thus, for a given time-ste, we need to send to GPU only the atom enters and their radii, and the voxels with Ids of atoms. 5.2 Rendering Parameters The rendering roess deends on several arameters, whih affet the overall rendering erformane and the reision ratio. With this reset these arameters an be taken as level of detail arameters. In the general ase, the size of the set S, might ontain an unlimited number of atoms, whih would make it imossible to store them in CUDA memory, even with the version 4.0 that allows to alloate dynami arrays. Fortunately, Varshney et al. has exerimentally shown that a tyial atom in a rotein has aroximately 45 neighboring atoms within the radius of a water moleule [32]. Therefore, we limit the maximum size of S to 45 = S. However, suh a onfiguration would still rodue ( 45) 3 = 490 trilets to evaluate in Eq. (8). Aordingly, we introdue arameter k max whih seifies the maximum number of atoms being stored when building the set S, with the maximal limit being 45. With reset to this limitation, we have to hoose whih atoms are retrieved. Therefore, all the atoms in S are stored in the inreasing order, i.e. S = {, 2,..., k f () f 2 ()... f kmax () 2R}. Sine we are ordering only k max number of items, the time omlexity of the sorting is O(). We evaluated the quality of the resulting surfae aording to different k max values. Here we notied that for k max > 0, we obtained only small surfae imrovements (Fig. 7). On the other hand, when rendering avities in details, the number of S-inluded atoms has to be inreased sine all the atoms along the avity irumferene (and for whih f i () 2R) might artiiate to the final surfae. Figure 7: Comarison of the SES visual quality when having set the arameter k max = 5 (left), k max = 0 (middle) and k max = 5 (right). Note that there are only negligible imrovements between the last two. The resulting imliit funtion defines the imliit surfae at oints f SES ()=0, whih an ause a erformane bottlenek during the evaluation of the exat oints laying on the iso-surfae. Therefore, we determine whether the oint lies on the iso-surfae if and only if f SES () < ε,whereε reresents the minimal allowed roximity to the surfae. Here, the exat ε value is seified on the fly; either to inrease erformane or to imrove the surfae quality. When evaluating both systems () and (7), we seify the ε N and the maximum allowed number of iterations L available for intersetion oint estimations, i.e x L = v(x L ) T M(x L ) +x L. Sine the intersetion is always evaluated when oint is lose to the intersetion oints themselves, we set L = Ray-asting As was mentioned before, the arallelization is done on the ray basis. Here we omute the ray entry (t min )andexit(t max ) arameters within the bounding box of the urrently bounded sene. For simliity, we erform only the first hit traversal. A generated ray is roessed in a ste-wise fashion until the t max is reahed or we hit the iso-surfae. Sine the set S is ordered inreasingly from,we erform both toroidal and sherial triangle imliit omutations only when S > 0andg () 0. This reflets the fat that must lie at least in one area of influene of all the oints in S. Therefore, the funtion f SES () returns a signed distane value reresenting the losest roximity to the SES iso-surfae, although only when being loser to the surfae than R. Using this fat, the rayasting 222

7 roedure inrement the ray arameter t by f, sine the funtion has negative values outside, i.e. t = t f (Fig. 8). The notieable defiieny is that it is neessary to erform many stes when being lose to the surfae. -f Figure 8: Ray-asting a simlified sene. We erform stes of the size of f SES, in order not to ski the existing iso-surfae. 5.4 Funtion evaluation One of the disadvantages of imliit funtion evaluation is the time omlexity when evaluating the funtion for all the oints in S.In general ase, where the oints have arbitrary toology, the evaluation of sherial triangle funtion would lead to O( S 3 ) omlexity. Fortunately the number of atoms artiiating generation of imliit funtion is uer bounded. With reset to this restrition we store the required ombinations of ( k ( 2) and k 3), used by Eq. (8) into linear arrays into the onstant CUDA memory. Comutations of rediates, intersetions and funtion values is ahieved in O(), sine we are iterating over systems (,7) in the uer bounded number of omutational stes. While evaluating, the only real bottlenek is being traversal of neighboring oints in order to onstrut the set S. This is done in linear time O(n). To otimize the rayasting, we ahe the intersetion oints while rogressing along the ray. 5.5 Performane We evaluated the erformane of the new rendering method on the sequene of eight roteins (Fig. ); murine oronin- (3023 atoms, a), g-atin (2872 atoms, b), otassium hannel (2820 atoms, ), roteinase 3 (3346 atoms, d), immunoglobin (2530 atoms, e) roliferati ell nulear antigen (2555 atoms, f), bateriorhodosin (78 atoms, f) and tubulin (4744 atoms, h). We were varying all resented arameters affeting the erformane (k max, ε, ε N ). The erformane measurements were done on a workstation equied with two (2 GHz) roessors and 2.0 GB RAM and with the GPU, NVIDIA GeFore GTX 480. It is imortant to mention here that we do not aim at outerforming any existing rendering tehniques [, 4] regarding FPS, sine we omute the iso-surfae on the fly. On the other hand, our aim here is to define SES reresentation in a simle way and to rovide users with an interative resonse for hanging any rotein or solvent arameters. Furthermore, to study moleular dynamis using visualization of arbitrary setions of the sequene without the need of any reomutation stes. Therefore, the erformane (FPS) is more about the fat that suh a system an rovide an interative resonse when, for instane, inluded in the existing rotein exloration environment. The level of interativity is deendent on the three aforementioned arameters, k max,ε and ε N. We observed that the rendering erformane is affeted signifiantly by the arameter k max.forinstane, by setting ε = 0.0, ε N = 0.005, R =.4 and by inreasing inrementally k max from 5 to 20, we get the following FPS: k max a b d e f g h Nevertheless, by setting ε < and setting k max > 20 we get < FPS for all the roteins. Therefore, this onfiguration an be used to rovide high-quality images but a less interative resonse. To guarantee onstant framerates (above 5FPS), we imlemented a rogressive refinement strategy that automatially redues these arameters,e.g.; ε = 0.2, ε N = and k max = 5, when erforming visual exloration (zooming, rotation) or seeking for different time-stes. When a user does not interat with the sene, these arameters are automatially inreased to the higher level to get the finer details. We demonstrated the sequene of two of resented roteins (roteindanf,wherewesetk max = 0 as a onstant) to the bioinformatis sientist, where we ahieved satisfatory interativity. Here, the feedbak, whih we have reeived was that visualization rovides a suffiient amount of details for an overview on the rotein surfae with reset to the avity exloration. Additionally, the rovided interativity was highly areiated. 6 ERROR ESTIMATION AND LIMITATIONS The visual surfae reision is diretly affet by the minimal allowed roximity, ε, to the iso-surfae during the ray-asting. The arameters k max and ε N affet the funtion evaluation error. When a given oint x on the ray r fulfils f (x) ε, the oint x is onsidered to lie on the iso-surfae, whih atually holds only if ray r intersets the surfae in a oint x,i.e. f (x )=0. Sine the funtion f is C ontinuous, via the mean value theorem in several variables, there exist suh a arameter t [0, ] that f (x) f (x )= f ( ( t)x +tx ) (x x ). (9) When denoting oint =( t)x +tx and sine f (x )=0, we get the errore deendent on the following equation f () (x x )= f (x) ε. (20) Using Eq. (20) we an identify the ase, when funtion values vary raidly and gradient magnitude an beome very high, then distane between x and x needs to be signifiantly smaller in order to fulfil Eq. (20). In our aroah, this reates the artifats sine the arameter ε is taken as a onstant during ray-asting. Instead, as a future work, it needs to be adjusted aording to funtion omlexity in the neighborhood of x. We have disussed the orresonding visualization artifats with the bioinformatial seialist. Sine the SES reresentation is utilized in avity disoveries redominantly, whih are reognized only when a ball of radius R fits inside an oening, the artifats were onsidered insignifiant when setting ε R. As a onsequene, the major limitation of utilizing our imliit reresentation for visualization uroses is that it does not have to be a 00% SES reresentation. Here, the differene to existing aroahes lies in the fat that while these aroahes generate a set of quadris, our imliit funtion is defined globally and therefore we have to rely on the numerial aroah while traking the isosurfae. Additionally, even one seifies k max = 45, it an theoretially haen that the number of neighboring atoms an beome higher (with the reset to MD simulations). Nevertheless, this is not the tyial ase, sine we have notied only little imrovements when setting k max > 0. Another limitation is deendent more on the utilized grahis hardware, for whih GPU an stall when evaluating too many oints in set S. 223

8 7 UTILITY POTENTIAL Our imliit reresentation is tailored for the urose of deteting, analyzing and visualizing avities; i.e tunnels or hannels. Tunnels are essentially athways leading from a avity to a rotein ore. Channels lead through the whole rotein struture having avities on both ends. The study of how these athways evolve is highly imortant and required for drug design. Usually, to disover a hannel, it is neessary to find the avity and then trak the avity during the rotein simulation, to find out whether it reahes the surfae. Contrary to revious aroahes [, 4], for a given oint x our SES imliit funtion (Setion 4) omutes the losest distane to the surfae, the gradient at x, and lassifies x aording to whether it lies inside or outside of the rotein atoms. By means of numerial methods, we an omute the volume area of the avity using oint-to-objet lassifiation. Another utilization is to trak down the avity automatially using the distane roerty of the imliit funtion and using its gradient. We an delimit the avity detetion only to laes, where a solvent will fit in. In other words, we loate oints where f SES < R, i.e. oints that are above the distane of solvent radius R. 8 CONCLUSION We resented a new method of reresenting SES by means of funtional reresentation of objets. The imliit funtion omutes SES reresentation loally. For a given oint the funtion returns the orret minimal distane to the surfae, although only u to the distane of the solvent radius R. Additionally, the funtion is ositive inside the SES objet and negative outside. The main ontribution is that we reresent the moleular surfae without reomutation, thus enabling instantaneous visual analysis. Moreover, we roosed a simle ray-asting method whih is used to render even large roteins at reasonable interativity. We introdued a set of arameters that affet the overall rendering erformane. These an be adjusted in aordane with the rendering erformane versus a reision ratio. Sine the work forms the first stes in a new diretion of SES reresentation, we have erformed only an informal evaluation. We showed the imlementation of our method to seialists where we demonstrated it on a sequene of the two resented roteins. The ossibility of hanging the solvent radius or even to ik u atoms in related views, was found to be highly interesting and romising. ACKNOWLEDGEMENTS We give thanks to Nathalie Reuter for roviding the moleular dynamis simulation datasets and the neessary feedbak, and to Armin Pobitzer for final touhes with mathematial formulas. REFERENCES [] J. Blinn. A generalization of algebrai surfae drawing. ACM Transations on Grahis, : , 982. [2] M. Chavent, B. Levy, and B. Maigret. MetaMol: high-quality visualization of moleular skin surfae. Journal of moleular grahis & modelling, 27(2):209 6, Set [3] M. Connolly. Analytial moleular surfae alulation. Journal of Alied Crystallograhy, 6(5): , 983. [4] H. Edelsbrunner. Deformable smooth surfae design. Disrete & Comutational Geometry, 2():87 5, 999. [5] P.-a. Fayolle. Tehnial Reort Distane to set oerations in onstrutive modeling of solids. City, [6] J. Greer and B. L. Bush. Maromoleular shae and surfae mas by solvent exlusion. Proeedings of the National Aademy of Sienes of the United States of Ameria, 75():303 7, Jan [7] P. Hanrahan. Ray traing algebrai surfaes. SIGGRAPH Comut. Grah., 7:83 90, July 983. [8] J. C. Hart. Shere traing : a geometri method for the antialiased ray traing of imliit surfaes. Comuter, ages , 992. [9] W. Humhrey, A. Dalke, and K. Shulten. VMD: visual moleular dynamis. Journal of moleular grahis, (4):33 38, 996. [0] A. Knoll, Y. Hijazi, A. Kensler, M. Shott, C. Hansen, and H. Hagen. Fast Ray Traing of Arbitrary Imliit Surfaes with Interval and Affine Arithmeti. Comuter Grahis Forum, 28():26 40, Mar [] M. Krone, K. Bidmon, and T. Ertl. Interative visualization of moleular surfae dynamis. IEEE transations on visualization and omuter grahis, 5(6):39 8, [2] M. Krone, M. Falk, and S. Rehm. Interative Exloration of Protein Cavities. Comuter Grahis Forum, 30(3): , 20. [3] B. Lee and F. M. Rihards. The interretation of rotein strutures: estimation of stati aessibility. Journal of moleular biology, 55(3): , Feb. 97. [4] N. Lindow, D. Baum, S. Prohaska, and H. Hege. Aelerated Visualization of Dynami Moleular Surfaes. In Comuter Grahis Forum, volume 29, ages Wiley Online Library, 200. [5] C. Loo and J. Blinn. Real-time GPU rendering of ieewise algebrai surfaes. ACM Transations on Grahis (TOG), 25(3): , [6] W. E. Lorensen and H. E. Cline. Marhing ubes: A high resolution 3d surfae onstrution algorithm. SIGGRAPH Comut. Grah., 2:63 69, August 987. [7] T. Luft, C. Colditz, and O. Deussen. Image enhanement by unshar masking the deth buffer. ACM Transations on Grahis, 25(3):206 23, jul [8] A. A. Pasko, V. Adzhiev, A. Sourin, and V. V. Savhenko. Funtion reresentation in geometri modeling: onets, imlementation and aliations. The Visual Comuter, (8): , 995. [9] G. Reina and T. Ertl. Hardware-aelerated glyhs for mono-and dioles in moleular dynamis visualization. In Proeedings of EU- ROGRAPHICSIEEE VGTC Symosium on Visualization, volume xx, ages 77 82, [20] A. Rii. A onstrutive geometry for omuter grahis. The Comuter Journal, 6(2):57 60, 972. [2] F. M. Rihards. Areas, volumes, aking, and rotein struture. Annual Review of Biohysis and Bioengineering, 6():5 76, 977. [22] J. Ryu, Y. Cho, and D.-S. Kim. Triangulation of moleular surfaes. Comuter-Aided Design, 4(6): , June [23] J. Ryu, R. Park, and D. Kim. Moleular surfaes on roteins via beta shaes. Comuter-Aided Design, 39(2): , De [24] M. F. Sanner, a. J. Olson, and J. C. Sehner. Redued surfae: an effiient way to omute moleular surfaes. Bioolymers, 38(3): , Mar [25] Shrödinger, LLC. The PyMOL moleular grahis system, version.3r. August 200. [26] C. Sigg, T. Weyrih, M. Botsh, and M. Gross. GPU-based ray-asting of quadrati surfaes. In Eurograhis Symosium on Point-Based Grahis, ages Citeseer, [27] J. M. Singh and P. J. Narayanan. Real-time ray traing of imliit surfaes on the GPU. IEEE transations on visualization and omuter grahis, 6(2):26 72, 200. [28] M. Tarini, P. Cignoni, and C. Montani. Ambient olusion and edge ueing to enhane real time moleular visualization. IEEE Transations on Visualization and Comuter Grahis, 2(5): , [29] R. Toledo and B. Lvy. Extending the grahi ieline with new guaelerated rimitives. Tehnial reort, INRIA-ALICE, [30] M. Totrov and R. Abagyan. The ontour-buildu algorithm to alulate the analytial moleular surfae. Journal of strutural biology, 6():38 43, 996. [3] M. van der Zwan, W. Lueks, H. Bekker, and T. Isenberg. Illustrative Moleular Visualization with Continuous Abstration. ages , Bergen, Norway, 20. Eurograhis Assoiation. [32] A. Varshney, F. P. Brooks, Jr., and W. V. Wright. Comuting smooth moleular surfaes. IEEE Comut. Grah. Al., 4:9 25, Setember 994. [33] K. Zhou, Q. Hou, R. Wang, and B. Guo. Real-time kd-tree onstrution on grahis hardware. In ACM SIGGRAPH Asia 2008 aers, SIGGRAPH Asia 08, ages 26: 26:. ACM,

p[4] p[3] p[2] p[1] p[0]

p[4] p[3] p[2] p[1] p[0] CMSC 425 : Sring 208 Dave Mount and Roger Eastman Homework Due: Wed, Marh 28, :00m. Submit through ELMS as a df file. It an either be distilled from a tyeset doument or handwritten, sanned, and enhaned

More information

Reconfigurable Shape-Adaptive Template Matching Architectures

Reconfigurable Shape-Adaptive Template Matching Architectures Reonfigurable Shae-Adative Temlate Mathing Arhitetures Jörn Gause 1, Peter Y.K. Cheung 1, Wayne Luk 2 1 Deartment of Eletrial and Eletroni Engineering, Imerial College, London SW7 2BT, England. 2 Deartment

More information

A rich discrete labeling scheme for line drawings of curved objects

A rich discrete labeling scheme for line drawings of curved objects A rih disrete labeling sheme for line drawings of urved objets Martin C. Cooer, IRIT, University of Toulouse III, 31062 Toulouse, Frane ooer@irit.fr Abstrat We resent a disrete labeling sheme for line

More information

Skip Strips: Maintaining Triangle Strips for View-dependent Rendering

Skip Strips: Maintaining Triangle Strips for View-dependent Rendering Ski Stris: Maintaining Triangle Stris for View-deendent Rendering Jihad El-Sana ; Elvir Azanli Amitabh Varshney Deartment of Mathematis and Comuter Siene Deartment of Comuter Siene Ben-Gurion University

More information

Event Detection Using Local Binary Pattern Based Dynamic Textures

Event Detection Using Local Binary Pattern Based Dynamic Textures Event Detetion Using Loal Binary Pattern Based Dynami Textures Abstrat Deteting susiious events from video surveillane ameras has been an imortant task reently. Many trajetory based desritors were develoed,

More information

Exponential Particle Swarm Optimization Approach for Improving Data Clustering

Exponential Particle Swarm Optimization Approach for Improving Data Clustering International Journal of Eletrial and Eletronis Engineering 3:4 9 Exonential Partile Swarm Otimization Aroah for Imroving Data Clustering eveen I. Ghali, ahed El-Dessoui, Mervat A.., and Lamiaa Barawi

More information

Approximate Labeling via the Primal-Dual Schema

Approximate Labeling via the Primal-Dual Schema Aroximate Labeling via the Primal-Dual Shema Nikos Komodakis and Georgios Tziritas Tehnial Reort CSD-TR-2005-01 February 1, 2005 Aroximate Labeling via the Primal-Dual Shema Nikos Komodakis and Georgios

More information

Control CPR: A Branch Height Reduction Optimization for EPIC Architectures

Control CPR: A Branch Height Reduction Optimization for EPIC Architectures Control CPR: A Branh Height Redution Otimization for EPIC Arhitetures Mihael Shlansker, Sott Mahlke, Rihard Johnson HP Laboratories Palo Alto HPL-1999-34 February, 1999 E-mail: [shlansk,mahlke]@hl.h.om

More information

The official electronic file of this thesis or dissertation is maintained by the University Libraries on behalf of The Graduate School at Stony Brook

The official electronic file of this thesis or dissertation is maintained by the University Libraries on behalf of The Graduate School at Stony Brook Stony Brook University The offiial eletroni file of this thesis or dissertation is maintained by the University Libraries on behalf of The Graduate Shool at Stony Brook University. Alll Rigghht tss Reesseerrvveedd

More information

GENERATING A PERSPECTIVE IMAGE FROM A PANORAMIC IMAGE BY THE SWUNG-TO-CYLINDER PROJECTION

GENERATING A PERSPECTIVE IMAGE FROM A PANORAMIC IMAGE BY THE SWUNG-TO-CYLINDER PROJECTION GENERATING A PERSPECTIVE IMAGE FROM A PANORAMIC IMAGE BY THE SWUNG-TO-CYLINDER PROJECTION Che-Han Chang Wei-Sheng Lai Yung-Yu Chuang HTC UC Mered National Taiwan University ABSTRACT This aer rooses a swung-to-ylinder

More information

Robust Multithreaded Object Tracker through Occlusions for Spatial Augmented Reality

Robust Multithreaded Object Tracker through Occlusions for Spatial Augmented Reality ETRI Journal, Volume 40, Number 2, Aril, 2018 246 Robust Multithreaded Objet Traker through Olusions for Satial Augmented Reality Ahyun Lee and Insung Jang A satial augmented reality (SAR) system enables

More information

Social Network Analysis Based on BSP Clustering Algorithm

Social Network Analysis Based on BSP Clustering Algorithm Communiations of the IIMA Volume 7 Issue 4 Artile 5 7 Soial Network Analysis Based on BSP Clustering Algorithm ong Shool of Business Administration China University of Petroleum Follow this and additional

More information

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and

More information

Bias Error Reduction of Digital Image Correlation Based on Kernel

Bias Error Reduction of Digital Image Correlation Based on Kernel Vol.81 (CST 15),.16- htt://dx.doi.org/1.1457/astl.15.81.4 Bias Error Redution of Digital Image Correlation Based on Kernel Huan Shen 1,, eize Zhang 1, and Xiang Shen 1 Energy and ower College, anjing Uniersity

More information

Drawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0;

Drawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0; Naïve line drawing algorithm // Connet to grid points(x0,y0) and // (x1,y1) by a line. void drawline(int x0, int y0, int x1, int y1) { int x; double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx;

More information

A Novel Validity Index for Determination of the Optimal Number of Clusters

A Novel Validity Index for Determination of the Optimal Number of Clusters IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers

More information

Lecture 3: Geometric Algorithms(Convex sets, Divide & Conquer Algo.)

Lecture 3: Geometric Algorithms(Convex sets, Divide & Conquer Algo.) Advanced Algorithms Fall 2015 Lecture 3: Geometric Algorithms(Convex sets, Divide & Conuer Algo.) Faculty: K.R. Chowdhary : Professor of CS Disclaimer: These notes have not been subjected to the usual

More information

arxiv: v1 [cs.db] 13 Sep 2017

arxiv: v1 [cs.db] 13 Sep 2017 An effiient lustering algorithm from the measure of loal Gaussian distribution Yuan-Yen Tai (Dated: May 27, 2018) In this paper, I will introdue a fast and novel lustering algorithm based on Gaussian distribution

More information

Boundary Correct Real-Time Soft Shadows

Boundary Correct Real-Time Soft Shadows Boundary Corret Real-Time Soft Shadows Bjarke Jakobsen Niels J. Christensen Bent D. Larsen Kim S. Petersen Informatis and Mathematial Modelling Tehnial University of Denmark {bj, nj, bdl}@imm.dtu.dk, kim@deadline.dk

More information

Gray Codes for Reflectable Languages

Gray Codes for Reflectable Languages Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings

More information

Introduction to Visualization and Computer Graphics

Introduction to Visualization and Computer Graphics Introduction to Visualization and Comuter Grahics DH2320, Fall 2015 Prof. Dr. Tino Weinkauf Introduction to Visualization and Comuter Grahics Grids and Interolation Next Tuesday No lecture next Tuesday!

More information

We P9 16 Eigenray Tracing in 3D Heterogeneous Media

We P9 16 Eigenray Tracing in 3D Heterogeneous Media We P9 Eigenray Traing in 3D Heterogeneous Media Z. Koren* (Emerson), I. Ravve (Emerson) Summary Conventional two-point ray traing in a general 3D heterogeneous medium is normally performed by a shooting

More information

4. Principles of Picture taking 4 hours

4. Principles of Picture taking 4 hours Leture 4 - - 0/3/003 Conet Hell/Pfeiffer February 003 4. Priniles of Piture taking 4 hours Aim: riniles of iture taking (normal ase, onvergent for oint measurements, flight lanning) flight lanning (arameter,

More information

Calculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem

Calculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem Calulation of typial running time of a branh-and-bound algorithm for the vertex-over problem Joni Pajarinen, Joni.Pajarinen@iki.fi Otober 21, 2007 1 Introdution The vertex-over problem is one of a olletion

More information

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality INTERNATIONAL CONFERENCE ON MANUFACTURING AUTOMATION (ICMA200) Multi-Piee Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality Stephen Stoyan, Yong Chen* Epstein Department of

More information

Detection and Recognition of Non-Occluded Objects using Signature Map

Detection and Recognition of Non-Occluded Objects using Signature Map 6th WSEAS International Conferene on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, De 9-31, 007 65 Detetion and Reognition of Non-Oluded Objets using Signature Map Sangbum Park,

More information

Extracting Partition Statistics from Semistructured Data

Extracting Partition Statistics from Semistructured Data Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk

More information

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and

More information

Pipelined Multipliers for Reconfigurable Hardware

Pipelined Multipliers for Reconfigurable Hardware Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,

More information

Performance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification

Performance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification erformane Improvement of TC on Wireless Cellular Networks by Adaptive Combined with Expliit Loss tifiation Masahiro Miyoshi, Masashi Sugano, Masayuki Murata Department of Infomatis and Mathematial Siene,

More information

特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing

特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing デンソーテクニカルレビュー Vol. 15 2010 特集 Road Border Reognition Using FIR Images and LIDAR Signal Proessing 高木聖和 バーゼル ファルディ Kiyokazu TAKAGI Basel Fardi ヘンドリック ヴァイゲル Hendrik Weigel ゲルド ヴァニーリック Gerd Wanielik This paper

More information

Chemical, Biological and Radiological Hazard Assessment: A New Model of a Plume in a Complex Urban Environment

Chemical, Biological and Radiological Hazard Assessment: A New Model of a Plume in a Complex Urban Environment hemial, Biologial and Radiologial Haard Assessment: A New Model of a Plume in a omplex Urban Environment Skvortsov, A.T., P.D. Dawson, M.D. Roberts and R.M. Gailis HPP Division, Defene Siene and Tehnology

More information

AUTOMATIC EXTRACTION OF BUILDING OUTLINE FROM HIGH RESOLUTION AERIAL IMAGERY

AUTOMATIC EXTRACTION OF BUILDING OUTLINE FROM HIGH RESOLUTION AERIAL IMAGERY AUTOMATIC EXTRACTION OF BUILDING OUTLINE FROM HIGH RESOLUTION AERIAL IMAGERY Yandong Wang EagleView Technology Cor. 5 Methodist Hill Dr., Rochester, NY 1463, the United States yandong.wang@ictometry.com

More information

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer

More information

Research Article Intuitionistic Fuzzy Possibilistic C Means Clustering Algorithms

Research Article Intuitionistic Fuzzy Possibilistic C Means Clustering Algorithms Hindawi Publishing Cororation Advanes in Fuzzy Systems Volume 2015, Artile ID 2827, 17 ages htt://dx.doi.org/10.1155/2015/2827 Researh Artile Intuitionisti Fuzzy Possibilisti C Means Clustering Algorithms

More information

Image Segmentation Using Topological Persistence

Image Segmentation Using Topological Persistence Image Segmentation Using Toological Persistence David Letscher and Jason Fritts Saint Louis University Deartment of Mathematics and Comuter Science {letscher, jfritts}@slu.edu Abstract. This aer resents

More information

Flow Demands Oriented Node Placement in Multi-Hop Wireless Networks

Flow Demands Oriented Node Placement in Multi-Hop Wireless Networks Flow Demands Oriented Node Plaement in Multi-Hop Wireless Networks Zimu Yuan Institute of Computing Tehnology, CAS, China {zimu.yuan}@gmail.om arxiv:153.8396v1 [s.ni] 29 Mar 215 Abstrat In multi-hop wireless

More information

Tensegrity Engineering for Space Systems. Professor Emeritus, UCSD TIAS Faculty Fellow Texas A&M

Tensegrity Engineering for Space Systems. Professor Emeritus, UCSD TIAS Faculty Fellow Texas A&M Tensegrity Engineering for Sae Systems bobskelton@usd.edu Professor Emeritus, UCSD TIAS Faulty Fello Teas A&M First Motivation: Animal Loomotion Stiks and Strings: Arhiteture of Life Overla h % of stage

More information

Detecting Moving Targets in Clutter in Airborne SAR via Keystoning and Multiple Phase Center Interferometry

Detecting Moving Targets in Clutter in Airborne SAR via Keystoning and Multiple Phase Center Interferometry Deteting Moving Targets in Clutter in Airborne SAR via Keystoning and Multiple Phase Center Interferometry D. M. Zasada, P. K. Sanyal The MITRE Corp., 6 Eletroni Parkway, Rome, NY 134 (dmzasada, psanyal)@mitre.org

More information

A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks

A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks Abouberine Ould Cheikhna Department of Computer Siene University of Piardie Jules Verne 80039 Amiens Frane Ould.heikhna.abouberine @u-piardie.fr

More information

Efficient Parallel Hierarchical Clustering

Efficient Parallel Hierarchical Clustering Efficient Parallel Hierarchical Clustering Manoranjan Dash 1,SimonaPetrutiu, and Peter Scheuermann 1 Deartment of Information Systems, School of Comuter Engineering, Nanyang Technological University, Singaore

More information

On the Relationship Between Dual Photography and Classical Ghost Imaging

On the Relationship Between Dual Photography and Classical Ghost Imaging 1 On the Relationshi Between Dual Photograhy and Classial Ghost Imaging Pradee Sen University of California, Santa Barbara arxiv:1309.3007v1 [hysis.otis] 12 Se 2013 Abstrat Classial ghost imaging has reeived

More information

ARABIC OCR SYSTEM ANALOGOUS TO HMM-BASED ASR SYSTEMS; IMPLEMENTATION AND EVALUATION

ARABIC OCR SYSTEM ANALOGOUS TO HMM-BASED ASR SYSTEMS; IMPLEMENTATION AND EVALUATION ARABIC OCR SYSTEM ANALOGOUS TO HMM-BASED ASR SYSTEMS; IMPLEMENTATION AND EVALUATION M.A.A. RASHWAN, M.W.T. FAKHR, M. ATTIA, M.S.M. EL-MAHALLAWY 4 ABSTRACT Desite 5 years of R&D on the roblem of Otial harater

More information

Projector Calibration for 3D Scanning Using Virtual Target Images

Projector Calibration for 3D Scanning Using Virtual Target Images INTERNATIONAL JOURNAL OF RECISION ENGINEERING AND MANUFACTURING Vol. 13, No. 1,. 125-131 JANUARY 2012 / 125 DOI: 10.1007/s12541-012-0017-3 rojetor Calibration for 3D Sanning Using Virtual Target Images

More information

Run-time Evaluation of Opportunities for Object Inlining in Java

Run-time Evaluation of Opportunities for Object Inlining in Java Run-time Evaluation o Oortunities or Objet Inlining in Java Ondřej Lhoták Laurie Hendren Sable Researh Grou Shool o Comuter Siene MGill University Montreal, Canada {olhotak,hendren@sable.mgill.a ABSTRACT

More information

Smooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints

Smooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints Smooth Trajetory Planning Along Bezier Curve for Mobile Robots with Veloity Constraints Gil Jin Yang and Byoung Wook Choi Department of Eletrial and Information Engineering Seoul National University of

More information

Automated Generation of Interactive 3D Exploded View Diagrams

Automated Generation of Interactive 3D Exploded View Diagrams Automated Generation of Interative 3D Exloded View Diagrams Abstrat We resent a system for reating and viewing interative exloded views of omlex 3D models. In our aroa, a 3D inut model is organized into

More information

Vertex Unfoldings of Orthogonal Polyhedra: Positive, Negative, and Inconclusive Results

Vertex Unfoldings of Orthogonal Polyhedra: Positive, Negative, and Inconclusive Results CCCG 2018, Winnipeg, Canada, August 8 10, 2018 Vertex Unfoldings of Orthogonal Polyhedra: Positive, Negative, and Inonlusive Results Luis A. Garia Andres Gutierrrez Isaa Ruiz Andrew Winslow Abstrat We

More information

Cross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer

Cross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer Communiations and Networ, 2013, 5, 69-73 http://dx.doi.org/10.4236/n.2013.53b2014 Published Online September 2013 (http://www.sirp.org/journal/n) Cross-layer Resoure Alloation on Broadband Power Line Based

More information

Year 11 GCSE Revision - Re-visit work

Year 11 GCSE Revision - Re-visit work Week beginning 6 th 13 th 20 th HALF TERM 27th Topis for revision Fators, multiples and primes Indies Frations, Perentages, Deimals Rounding 6 th Marh Ratio Year 11 GCSE Revision - Re-visit work Understand

More information

Adaptive Implicit Surface Polygonization using Marching Triangles

Adaptive Implicit Surface Polygonization using Marching Triangles Volume 20 (2001), Number 2 pp. 67 80 Adaptive Impliit Surfae Polygonization using Marhing Triangles Samir Akkouhe Eri Galin L.I.G.I.M L.I.G.I.M Eole Centrale de Lyon Université Claude Bernard Lyon 1 B.P.

More information

An Efficient Coding Method for Coding Region-of-Interest Locations in AVS2

An Efficient Coding Method for Coding Region-of-Interest Locations in AVS2 An Efficient Coding Method for Coding Region-of-Interest Locations in AVS2 Mingliang Chen 1, Weiyao Lin 1*, Xiaozhen Zheng 2 1 Deartment of Electronic Engineering, Shanghai Jiao Tong University, China

More information

Stable Road Lane Model Based on Clothoids

Stable Road Lane Model Based on Clothoids Stable Road Lane Model Based on Clothoids C Gakstatter*, S Thomas**, Dr P Heinemann*, Prof Gudrun Klinker*** *Audi Eletronis Venture GmbH, **Leibniz Universität Hannover, ***Tehnishe Universität Münhen

More information

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2 On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,

More information

Incremental Mining of Partial Periodic Patterns in Time-series Databases

Incremental Mining of Partial Periodic Patterns in Time-series Databases CERIAS Teh Report 2000-03 Inremental Mining of Partial Periodi Patterns in Time-series Dataases Mohamed G. Elfeky Center for Eduation and Researh in Information Assurane and Seurity Purdue University,

More information

A Unified Subdivision Scheme for Polygonal Modeling

A Unified Subdivision Scheme for Polygonal Modeling EUROGRAPHICS 2 / A. Chalmers and T.-M. Rhyne (Guest Editors) Volume 2 (2), Number 3 A Unified Subdivision Sheme for Polygonal Modeling Jérôme Maillot Jos Stam Alias Wavefront Alias Wavefront 2 King St.

More information

arxiv: v2 [cs.cv] 25 Nov 2015

arxiv: v2 [cs.cv] 25 Nov 2015 Pose-Guided Human Parsing with Dee-Learned Features Fangting Xia, Jun Zhu, Peng Wang, Alan Yuille University of California, Los Angeles arxiv:158.3881v2 [s.cv] 25 Nov 215 Abstrat Parsing human body into

More information

Learning Motion Patterns in Crowded Scenes Using Motion Flow Field

Learning Motion Patterns in Crowded Scenes Using Motion Flow Field Learning Motion Patterns in Crowded Scenes Using Motion Flow Field Min Hu, Saad Ali and Mubarak Shah Comuter Vision Lab, University of Central Florida {mhu,sali,shah}@eecs.ucf.edu Abstract Learning tyical

More information

Numerical simulation of hemolysis: a comparison of Lagrangian and Eulerian modelling

Numerical simulation of hemolysis: a comparison of Lagrangian and Eulerian modelling Modelling in Mediine and Biology VI 361 Numerial simulation of hemolysis: a omparison of Lagrangian and Eulerian modelling S. Pirker 1, H. Shima 2 & M. Stoiber 2 1 Johannes Kepler University, 4040 Linz,

More information

Video Data and Sonar Data: Real World Data Fusion Example

Video Data and Sonar Data: Real World Data Fusion Example 14th International Conferene on Information Fusion Chiago, Illinois, USA, July 5-8, 2011 Video Data and Sonar Data: Real World Data Fusion Example David W. Krout Applied Physis Lab dkrout@apl.washington.edu

More information

3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT?

3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? 3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? Bernd Girod, Peter Eisert, Marus Magnor, Ekehard Steinbah, Thomas Wiegand Te {girod eommuniations Laboratory, University of Erlangen-Nuremberg

More information

Multiple-Criteria Decision Analysis: A Novel Rank Aggregation Method

Multiple-Criteria Decision Analysis: A Novel Rank Aggregation Method 3537 Multiple-Criteria Deision Analysis: A Novel Rank Aggregation Method Derya Yiltas-Kaplan Department of Computer Engineering, Istanbul University, 34320, Avilar, Istanbul, Turkey Email: dyiltas@ istanbul.edu.tr

More information

Exploring the Commonality in Feature Modeling Notations

Exploring the Commonality in Feature Modeling Notations Exploring the Commonality in Feature Modeling Notations Miloslav ŠÍPKA Slovak University of Tehnology Faulty of Informatis and Information Tehnologies Ilkovičova 3, 842 16 Bratislava, Slovakia miloslav.sipka@gmail.om

More information

COMBINATION OF INTERSECTION- AND SWEPT-BASED METHODS FOR SINGLE-MATERIAL REMAP

COMBINATION OF INTERSECTION- AND SWEPT-BASED METHODS FOR SINGLE-MATERIAL REMAP Combination of intersetion- and swept-based methods for single-material remap 11th World Congress on Computational Mehanis WCCM XI) 5th European Conferene on Computational Mehanis ECCM V) 6th European

More information

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425) Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University

More information

Face and Facial Feature Tracking for Natural Human-Computer Interface

Face and Facial Feature Tracking for Natural Human-Computer Interface Fae and Faial Feature Traking for Natural Human-Computer Interfae Vladimir Vezhnevets Graphis & Media Laboratory, Dept. of Applied Mathematis and Computer Siene of Mosow State University Mosow, Russia

More information

Plot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar

Plot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar Plot-to-trak orrelation in A-SMGCS using the target images from a Surfae Movement Radar G. Golino Radar & ehnology Division AMS, Italy ggolino@amsjv.it Abstrat he main topi of this paper is the formulation

More information

An Efficient and Scalable Approach to CNN Queries in a Road Network

An Efficient and Scalable Approach to CNN Queries in a Road Network An Effiient and Salable Approah to CNN Queries in a Road Network Hyung-Ju Cho Chin-Wan Chung Dept. of Eletrial Engineering & Computer Siene Korea Advaned Institute of Siene and Tehnology 373- Kusong-dong,

More information

Using Augmented Measurements to Improve the Convergence of ICP

Using Augmented Measurements to Improve the Convergence of ICP Using Augmented Measurements to Improve the onvergene of IP Jaopo Serafin, Giorgio Grisetti Dept. of omputer, ontrol and Management Engineering, Sapienza University of Rome, Via Ariosto 25, I-0085, Rome,

More information

HEXA: Compact Data Structures for Faster Packet Processing

HEXA: Compact Data Structures for Faster Packet Processing Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for

More information

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study What are Cyle-Stealing Systems Good For? A Detailed Performane Model Case Study Wayne Kelly and Jiro Sumitomo Queensland University of Tehnology, Australia {w.kelly, j.sumitomo}@qut.edu.au Abstrat The

More information

the data. Structured Principal Component Analysis (SPCA)

the data. Structured Principal Component Analysis (SPCA) Strutured Prinipal Component Analysis Kristin M. Branson and Sameer Agarwal Department of Computer Siene and Engineering University of California, San Diego La Jolla, CA 9193-114 Abstrat Many tasks involving

More information

with respect to the normal in each medium, respectively. The question is: How are θ

with respect to the normal in each medium, respectively. The question is: How are θ Prof. Raghuveer Parthasarathy University of Oregon Physis 35 Winter 8 3 R EFRACTION When light travels from one medium to another, it may hange diretion. This phenomenon familiar whenever we see the bent

More information

521493S Computer Graphics Exercise 3 (Chapters 6-8)

521493S Computer Graphics Exercise 3 (Chapters 6-8) 521493S Comuter Grahics Exercise 3 (Chaters 6-8) 1 Most grahics systems and APIs use the simle lighting and reflection models that we introduced for olygon rendering Describe the ways in which each of

More information

Cell Projection of Convex Polyhedra

Cell Projection of Convex Polyhedra Volume Graphis (2003) I. Fujishiro, K. Mueller, A. Kaufman (Editors) Cell Projetion of Convex Polyhedra Stefan Roettger and Thomas Ertl Visualization and Interative Systems Group University of Stuttgart

More information

arxiv: v1 [cs.gr] 10 Apr 2015

arxiv: v1 [cs.gr] 10 Apr 2015 REAL-TIME TOOL FOR AFFINE TRANSFORMATIONS OF TWO DIMENSIONAL IFS FRACTALS ELENA HADZIEVA AND MARIJA SHUMINOSKA arxiv:1504.02744v1 s.gr 10 Apr 2015 Abstrat. This work introdues a novel tool for interative,

More information

KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION

KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION Cuiui Kang 1, Shengai Liao, Shiming Xiang 1, Chunhong Pan 1 1 National Laboratory of Pattern Reognition, Institute of Automation, Chinese

More information

Stereo Disparity Estimation in Moment Space

Stereo Disparity Estimation in Moment Space Stereo Disarity Estimation in oment Sace Angeline Pang Faculty of Information Technology, ultimedia University, 63 Cyberjaya, alaysia. angeline.ang@mmu.edu.my R. ukundan Deartment of Comuter Science, University

More information

Algorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking

Algorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking Algorithms for External Memory Leture 6 Graph Algorithms - Weighted List Ranking Leturer: Nodari Sithinava Sribe: Andi Hellmund, Simon Ohsenreither 1 Introdution & Motivation After talking about I/O-effiient

More information

Outline: Software Design

Outline: Software Design Outline: Software Design. Goals History of software design ideas Design priniples Design methods Life belt or leg iron? (Budgen) Copyright Nany Leveson, Sept. 1999 A Little History... At first, struggling

More information

Active Compliant Motion Control for Grinding Robot

Active Compliant Motion Control for Grinding Robot Proeedings of the 17th World Congress The International Federation of Automati Control Ative Compliant Motion Control for Grinding Robot Juyi Park*, Soo Ho Kim* and Sungkwun Kim** *Daewoo Shipbuilding

More information

Measurement of the stereoscopic rangefinder beam angular velocity using the digital image processing method

Measurement of the stereoscopic rangefinder beam angular velocity using the digital image processing method Measurement of the stereosopi rangefinder beam angular veloity using the digital image proessing method ROMAN VÍTEK Department of weapons and ammunition University of defense Kouniova 65, 62 Brno CZECH

More information

We will then introduce the DT, discuss some of its fundamental properties and show how to compute a DT directly from a given set of points.

We will then introduce the DT, discuss some of its fundamental properties and show how to compute a DT directly from a given set of points. Voronoi Diagram and Delaunay Triangulation 1 Introduction The Voronoi Diagram (VD, for short) is a ubiquitious structure that aears in a variety of discilines - biology, geograhy, ecology, crystallograhy,

More information

The Mathematics of Simple Ultrasonic 2-Dimensional Sensing

The Mathematics of Simple Ultrasonic 2-Dimensional Sensing The Mathematis of Simple Ultrasoni -Dimensional Sensing President, Bitstream Tehnology The Mathematis of Simple Ultrasoni -Dimensional Sensing Introdution Our ompany, Bitstream Tehnology, has been developing

More information

SEGMENTATION OF IMAGERY USING NETWORK SNAKES

SEGMENTATION OF IMAGERY USING NETWORK SNAKES SEGMENTATION OF IMAGERY USING NETWORK SNAKES Matthias Butenuth Institute of Photogrammetry and GeoInformation, Leibniz Universität Hannover Nienburger Str. 1, 30167 Hannover, Germany butenuth@ipi.uni-hannover.de

More information

Multi-Channel Wireless Networks: Capacity and Protocols

Multi-Channel Wireless Networks: Capacity and Protocols Multi-Channel Wireless Networks: Capaity and Protools Tehnial Report April 2005 Pradeep Kyasanur Dept. of Computer Siene, and Coordinated Siene Laboratory, University of Illinois at Urbana-Champaign Email:

More information

Grouping of Patches in Progressive Radiosity

Grouping of Patches in Progressive Radiosity Grouing of Patches in Progressive Radiosity Arjan J.F. Kok * Abstract The radiosity method can be imroved by (adatively) grouing small neighboring atches into grous. Comutations normally done for searate

More information

Algorithms, Mechanisms and Procedures for the Computer-aided Project Generation System

Algorithms, Mechanisms and Procedures for the Computer-aided Project Generation System Algorithms, Mehanisms and Proedures for the Computer-aided Projet Generation System Anton O. Butko 1*, Aleksandr P. Briukhovetskii 2, Dmitry E. Grigoriev 2# and Konstantin S. Kalashnikov 3 1 Department

More information

NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman

NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION Ken Sauer and Charles A. Bouman Department of Eletrial Engineering, University of Notre Dame Notre Dame, IN 46556, (219) 631-6999 Shool of

More information

1. The collection of the vowels in the word probability. 2. The collection of real numbers that satisfy the equation x 9 = 0.

1. The collection of the vowels in the word probability. 2. The collection of real numbers that satisfy the equation x 9 = 0. C HPTER 1 SETS I. DEFINITION OF SET We begin our study of probability with the disussion of the basi onept of set. We assume that there is a ommon understanding of what is meant by the notion of a olletion

More information

Dr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq

Dr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq Volume 4 Issue 6 June 014 ISSN: 77 18X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om Medial Image Compression using

More information

CleanUp: Improving Quadrilateral Finite Element Meshes

CleanUp: Improving Quadrilateral Finite Element Meshes CleanUp: Improving Quadrilateral Finite Element Meshes Paul Kinney MD-10 ECC P.O. Box 203 Ford Motor Company Dearborn, MI. 8121 (313) 28-1228 pkinney@ford.om Abstrat: Unless an all quadrilateral (quad)

More information

DECT Module Installation Manual

DECT Module Installation Manual DECT Module Installation Manual Rev. 2.0 This manual desribes the DECT module registration method to the HUB and fan airflow settings. In order for the HUB to ommuniate with a ompatible fan, the DECT module

More information

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks Unsupervised Stereosopi Video Objet Segmentation Based on Ative Contours and Retrainable Neural Networks KLIMIS NTALIANIS, ANASTASIOS DOULAMIS, and NIKOLAOS DOULAMIS National Tehnial University of Athens

More information

Dynamic Algorithms Multiple Choice Test

Dynamic Algorithms Multiple Choice Test 3226 Dynami Algorithms Multiple Choie Test Sample test: only 8 questions 32 minutes (Real test has 30 questions 120 minutes) Årskort Name Eah of the following 8 questions has 4 possible answers of whih

More information

Trajectory Tracking Control for A Wheeled Mobile Robot Using Fuzzy Logic Controller

Trajectory Tracking Control for A Wheeled Mobile Robot Using Fuzzy Logic Controller Trajetory Traking Control for A Wheeled Mobile Robot Using Fuzzy Logi Controller K N FARESS 1 M T EL HAGRY 1 A A EL KOSY 2 1 Eletronis researh institute, Cairo, Egypt 2 Faulty of Engineering, Cairo University,

More information

The Implementation of RRTs for a Remote-Controlled Mobile Robot

The Implementation of RRTs for a Remote-Controlled Mobile Robot ICCAS5 June -5, KINEX, Gyeonggi-Do, Korea he Implementation of RRs for a Remote-Controlled Mobile Robot Chi-Won Roh*, Woo-Sub Lee **, Sung-Chul Kang *** and Kwang-Won Lee **** * Intelligent Robotis Researh

More information

Interactive Image Segmentation

Interactive Image Segmentation Interactive Image Segmentation Fahim Mannan (260 266 294) Abstract This reort resents the roject work done based on Boykov and Jolly s interactive grah cuts based N-D image segmentation algorithm([1]).

More information

A Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks

A Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks A Dual-Hamiltonian-Path-Based Multiasting Strategy for Wormhole-Routed Star Graph Interonnetion Networks Nen-Chung Wang Department of Information and Communiation Engineering Chaoyang University of Tehnology,

More information

13.1 Numerical Evaluation of Integrals Over One Dimension

13.1 Numerical Evaluation of Integrals Over One Dimension 13.1 Numerial Evaluation of Integrals Over One Dimension A. Purpose This olletion of subprograms estimates the value of the integral b a f(x) dx where the integrand f(x) and the limits a and b are supplied

More information