METAMORPHOSIS OF PERIODIC SURFACE MODELS

Size: px
Start display at page:

Download "METAMORPHOSIS OF PERIODIC SURFACE MODELS"

Transcription

1 Proceedings of ASE 2009 Internationa Design Engineering echnica Conferences & Coputers and Inforation in Engineering Conference IDEC/CIE 2009 August 0 Septeber 2, 2009, San Diego, Caifornia, USA DEC2009/DAC-870 EAORPHOSIS OF PERIODIC SURFACE ODES Cheng Qi and Yan Wang Departent of Industria Engineering & anageent Systes University of Centra Forida Orando, F 286 ABSRAC A phase transition is a geoetric and topoogica transforation process of aterias fro one phase to another, each of which has a unique and hoogeneous physica property. Providing an initia guess of transition path for further physica siuation studies is highy desirabe in aterias design. In this paper, we present a etaorphosis schee for periodic surface (PS) odes by interpoation in the PS paraeter space. he proposed approach creates utipe potentia transition paths for further seection based on three soothness criteria. he goa is to search for a sooth transforation in phase transition anaysis.. INRODUCION Coputer-aided nano-design (CAND) is an extension of coputer based engineering design traditionay at buk scaes to nano scaes. he genera target of odeing and siuation in nanoateria design is to search stabe and reaizabe structures and conforations with the inia tota syste energy. Geoetry optiization is the centra thee in ost of the nanoscae siuations. For the widey used oca search agoriths, siuation resuts are sensitivey dependent on the initia conforation. odeing ethods, which aow for the efficient construction of initia geoetries that are reasonaby cose to goba optia soutions, are iportant to iprove both convergence rate and accuracy of prediction. hus, enabing efficient structura description and editing is one of the key research issues in CAND. In the previous research [, 2], an ipicit surface odeing approach known as periodic surface (PS) ode is proposed. Periodic surfaces are either oci or foci. oci surfaces are fictiona continuous surfaces that pass through discrete partices in D space, whereas foci surfaces can be ooked as isosurfaces of potentia or density in which discrete partices are encosed. he PS ode aows for paraetric construction fro atoic scae to eso scae. Reconstruction of oci surfaces fro crystas [], surface degree operations to support fine-grained odeing [4, 5], and feature-based approach for crysta construction [6, 7] were aso studied. In this paper, we propose a surface orphing or etaorphosis approach for PS odes. his geoetry transforation is very usefu to siuate and visuaize phase transition processes in studying functiona aterias. A phase transition is a geoetric and topoogica transforation process of aterias fro one phase to another, each of which has a unique and hoogeneous physica property [8, 9]. ransforation of PS odes can hep to visuaize structure changes and provide initia estiations of transition paths. For exape, Figure (a) shows a BaSi 2 structure in its cubic phase and the corresponding foci surface ode, which encoses Ba atos. It has properties of seiconductor. Figure (b) shows a ayered phase of BaSi 2, which has properties of eta. he interest of phase transition anaysis is to search the goba optia transition path between the two phases with the inia potentia energy change. Structure transforation based on geoetric anaysis such as the one in Figure 2 can provide an initia guess of transition path for further physica siuation studies. In this paper, the type of phase transition which we are interested in is the oveent of any atos that resuts in a continuous change between two different crysta structures. he exapes of such type of phase transition can be diffusioness transforations and artensitic transforation. Any other types of phase transition such as a eting transforation or a freezing transforation are not in the scope of this paper. We reasonaby assue that the transition between two phases is processed in a region where a the physica conditions in that region are unifory distributed. Hence, we ignore the infuence of physica treatents such as teperatures and pressures, and ony focus on the etaorphosis of geoetry itsef. A surface orphing approach for PS odes is proposed in this paper. hree soothness criteria are proposed to quantify structure changes for pathway seection. he ain contribution of this paper is the unique surface orphing ethod of our PS ode based on interpoation in the PS paraeter space. Our ethod can provide utipe potentia transition paths for choices with different criteria. Copyright 2009 by ASE

2 (a) BaSi 2 structures in cubic phase (b) BaSi 2 structures in ayer phase Figure. BaSi 2 and corresponding foci surfaces Figure 2. Foci surface transition fro BaSi 2 cubic phase to ayer phase In the reainder of the paper, Section 2 gives a brief overview of reated work in surface orphing with ipicit and vouetric representations. Section reviews the basis of the periodic surface ode and its atrix for. Section 4 describes two surface orphing schees, which are direct inear interpoation and interpoation in the PS paraeters space. Section 5 proposes three soothness criteria for choosing surface orphing paths. 2. D EAORPHOSIS OF IPICI SURFACES Research effects in etaorphosis initiay focused on two diensiona iages. For iage orphing, there have been extensive investigations [0,, 2]. A direct extension fro 2D etaorphis to D was proposed by itta []. he D objects were represented by utipe 2D iages and 2D orphing techniques were used to orph between their 2D representations. he D interediate objects were thus reconstructed fro the resuting 2D iages. In D etaorphosis, azarus and Verroust [4] suarized and categorized a the agoriths in transforation between two shapes into two ajor approaches, voue based approaches and boundary based approaches. he voue based approaches focus on interpoations between two shapes in voxe representation. Pasko and Savchenko [5] defined a etaorphosis between two genera ipicit surfaces by direct inear interpoation of the corresponding vouetric vaues. he ethod was entirey autoatic but acked the contro over the transforation. Wyvi [ 6 ] presented a skeeton based approach to aow users to seect pairs of corresponding skeetons. he transforation coprised severa interpoations in associated potentia fieds or soft objects of paired skeetons. Kau and Rossignac [ 7 ] deveoped an interpoation agorith based on inkowski sus of two sets of vouetric data. he ethod was further extended for transforation between a set of convex poyhedra using Bézier interpoation and inkowski sus [8]. Gain and Akkouche [9] proposed an agorith for soft objects buit fro skeetons of convex shapes, which was a ixed approach between skeeton and inkowski sus. he paired skeetons were interpoated with inkowski sus, and soft objects were bended by interpoations. hen the fina interpoated shapes were the inkowski sus between the interpoated soft objects and skeetons. Barbier et a. [20] extended Gain s work by reoving the iitation to convex poygona eeents of arbitrary diension. he new approach presented a vast variety of shapes incuding curves, surfaces, and voues such as boxed or cone-spheres that ay be used as skeeta eeents. Hughes [2] proposed an approach with interpoation of two shapes in the Fourier doain. he approach interpoates the ow frequencies of the initia and end shapes whie the high frequencies of the end shape are increentay added in. he advantage of this approach is to avoid the shape distortion caused by direct interpoation of high frequency coponents. A siiar approach was proposed by He et a. [22], but it was based on D waveets. he initia vouetric data was decoposed with utipe eves of resoution, and the interediate surfaces were reconstructed after interpoation of ow frequencies. he spatia inforation within each frequency band of waveets enabed a sooth transition. o enabe oca contros, erios et a. [2] proposed a featurebased voue etaorphosis which aowed user to specify features in one shape corresponding to the other. hese paired features can be transfored fro one to the other during the orphing process. Cohen-Or and evin [ 24 ] proposed a orphing agorith based on three-diensiona distance fied. he initia and end shapes were first defored by soe pointto-point warping functions which were designed to enforce topoogica correspondence and geoetrica properties. he technique interpoates the distance vaues of each voxe and reconstructs the interediate surfaces out of the interediate distance fied. urk and O Brien [25] deveoped a etaorphosis schee to transfor between two shapes by creating a variationa ipicit function in a higher diension after artificiay introducing one extra diension. hus, the parae sices based on the extra diension represented the transforation sequence. urk and O Brien [26] further proposed another etaorphosis based on ipicit surfaces creations. In this ethod, a set of constraints which were fro scattered data of a surface created an ipicit function. he transforation between two shapes was defined by the ipicit surfaces buit fro the ixed constraints of the two shapes. Various interpoation approaches have been deveoped. Fausett et a. [27] deonstrated a technique to transfor between severa D shapes of different topoogy by bi-inear interpoation in a higher diensiona space. Fang et a. [28] presented a continuous fied based orphing agorith. In this agorith, a copex surface was construed by severa poyhedra skeetons. Basic continuous fied for each skeeton was created using variationa interpoation. he interediate surfaces between two shapes were approxiated by the iso- 2 Copyright 2009 by ASE

3 surface of the goba fied which is fused by the bended basic fieds of the two shapes. reece et a. [29] deveoped an agorith to iprove the transforation between two shapes by ensuring that no part of each surface reains disconnected during the orph. he orph was guided by correspondence of sphere representations of the two shapes, which was apped fro their distance fied voue representations. Optiizationbased approaches were aso taken. Cong et a. [0] deveoped an approach for shape etaorphis under the constraints of initia and end surface functions. With the p-apacian equation, a series of reguarized ters based on the gradient of the ipicit function was generaized. he approach soves the tie dependant ipicit function which iniizes the supreu of the gradient during the orph. Bao et a. [] presented a orphing process between two hoeoorphic point-set surfaces by optiizing an energy function. Aong boundary based approaches, Sun et a. [2] proposed to interpoate poyhedra odes using intrinsic shape paraeters, such as dihedra anges and edge engths. azarus and Verroust [] deveoped a etaorphosis for cyinder-ike objects by constructing poyhedra eshes using paraeterization for two shapes. he paraeters incude D axes for discretization, vertices, edges and faces. he shape transforation was defined by the interpoation of the paraeterization. Chen and Parent [4] introduced a user interactive agorith to extract paraeters for two D objects represented by panar contours. Weighted averaging of these paraeters defined the shape transforation. Kanai et a. [5] presented an agorith for D geoetric etaorphosis between two objects based on haronic ap. 2D ebeddings were created by haronic ap for the two D shapes with adjacent reations preserved. Inbetween shapes were created by erging of the two 2D ebeddings. Different fro the above, the etaorphosis approach deveoped in this paper is based on the interpoation in the PS paraeter space. his provides certain eves of contro for our PS odes. In addition, two soothness criteria and one heuristic orphing ethod are proposed for pathway seection.. PERIODIC SURFACE A periodic surface is generay defined as = = ( ) ψ() r = μ cos2 πκ ( p r ) = 0 (.) where κ is the scae paraeter, p [,,, ] = a b c θ is a basis vector, which represents a basis pane in the -space E, r = [ x, yzw,, ] is the ocation vector with hoogeneous coordinates, and μ is the periodic oent. We usuay assue w = if not expicity specified. It eans the diensions x, y and z are in the sae scae. he degree of ψ () r in Eq.(.) is defined as the nuber of unique periodic basis vectors in set { p }, deg ( ψ ( r) ): = { p }. he scae of ψ () r is defined as the nuber of unique scae paraeters in set { } sca ψ ( r ) : = κ. We usuay assue the scae paraeters are natura nubers ( κ N ). Each basis vector can be regarded as a set of parae 2D subspaces in E, which pays an iportant roe in interactive anipuation of PS odes. he PS ode described in Eq.(.) can aso be represented by a PS paraeter atrix as shown in Figure. he PS paraeter atrix contains four sub-atrices ( κ, μ, p and 0). Each eeent μ in μ aong with the -th eeent κ in κ and the -th row p in p defines a cosine function μ cos( 2 πκ ( p r )). Periodic surfaces are thus odeed by the su of these cosine functions. Switching the first couns or the ast rows of the PS paraeter atrix does not change the periodic surface. here are totay!! possibe cobinations of couns and rows in the sub-atrix μ, and!! different PS paraeter atrices represent the sae periodic surface. his property is iportant when we appy interpoation in the PS paraeter space, as discussed ater in Section 4.2. κ κ κ 0 μ μ μ p κ = rows μ p μ μ μ p μ2 μ μ2 p2 μ μ μ p κ, ( ) { } couns Figure. PS paraeter atrix PS ode is epoyed for surface creation because periodic structures are ubiquitous in natura aterias. Crysta structures are one of the good exapes that certain cobinations of atos are appeared periodicay in the D space. Due to its periodic property, a cosed-for equation is abe to represent a periodic surface. Hence, it is an efficient too for periodic structure odeing. 4. ORPHING SCHEES In this section, two orphing schees are discussed. hey are direct inear interpoation of vouetric data and interpoation in the PS paraeter space. In the first ethod, vouetric data is generated by interpoating between those of the initia and the end surfaces. he interediate surfaces are the isosurfaces based on the interpoated vouetric data. In the second ethod, inear interpoation is appied between the paraeters of the initia and the end surfaces. Hence, the interediate surfaces are created by cosed-for PS odes. Copyright 2009 by ASE

4 4. Vouetric Interpoation inear interpoation is widey used in geoetric orphing process. It can be appied in the orphing of periodic surfaces. For the initia surface ψ () = 0 r and the end surface ψ () r = 0 2, vouetric interpoation between these two surfaces can be defined as ( λψ ) ( r) + λψ 2( r ) = 0, where λ [0,]. As an exape, Figure 4 iustrates the effect of the interpoation between the P surface and I-WP surface. he PS paraeter atrices for P surface and I-WP surfaces are shown as foows P surface paraeter atrix: I-WP surface paraeter atrix: λ = 0.05 λ = 0.0 λ = 0.5 λ = 0.20 λ = 0.25 λ = 0.0 λ = 0.5 λ = 0.40 λ = 0.45 λ = 0.50 λ = 0.55 λ = 0.60 λ = 0.65 λ = 0.70 λ = 0.75 λ = 0.80 λ = 0.85 λ = 0.90 λ = 0.95 λ =.00 Figure 4. inear interpoation between P surface and I-WP surface he ethod of inear interpoation of vouetric data in the three diensiona space is straight forward. However, ony one transition path is possibe by appying this ethod if the initia and the end surfaces are known. here is no contro over the transforation process because the transition path can not be ocay odified. Creating correspondences between certain oca regions is not possibe. In addition, the surface transforation ay not be continuous. For instance, in the exape of Figure 4, the topoogy changes draaticay fro λ = 0.5 to λ = he six hoes ceary as features vanish siutaneousy in the interediate surface. Siiary, the features of hoes reappear in the interediate surface when λ = he figure aso shows that the transition path is hardy unifor because the topoogy changes ore in the first haf of the path than in the second haf. o investigate ore possibe transition paths, the ethod of interpoation in the paraeter space of PS odes is proposed in Section Interpoation in the paraeter space of PS odes An aternative orphing schee is to interpoate in the PS paraeter space between the initia and the end surfaces. ore specificay, for two surfaces = = 2 2 ( ) ψ () r = μ' cos2 πκ'( p' r ) = 0 (4.) 2 = = ( ) ψ () r = μ'' cos2 πκ''( p'' r ) = 0 (4.2) the interpoated surface is = = ( ) ψ() r = μ cos2 πκ ( p r ) = 0, where μ = ( λ) μ ' + λμ '' κ = ( λ) κ' + λκ'' p = ( λ) p' + λp'' (4.) λ [0,] = ax(, 2) = ax(, 2) κ ' 0 In the PS paraeter atrix for, et A = ' ' for ψ () r μ p κ '' 0 and B = '' '' for ψ 2 μ p () r. he interpoation is aso defined as ( λ) A+ λb, where λ [0,]. In other words, the interpoation is a process to ineary transfor fro one atrix to another, as iustrated in Figure 5. Here, the PS paraeter atrices of the initia and the end surfaces are to be extended to the sae size before interpoation if they are in different sizes. Figure 6 iustrates the atrix extension. In Figure 6(a), if < 2 and < 2, the couns for the scae paraeters κ 's can be extended fro to 2, and the rows for the basis vectors can be 4 Copyright 2009 by ASE

5 extended fro to 2 for surface ψ () r by setting μ ' = 0, κ' = κ'' and p' = p '' for [ +, 2] or [ +, 2]. In Figure 6(b), if < 2 and > 2, the couns for scae paraeters of surface ψ () r can be extended fro to 2 by setting μ ' = 0 and κ' = κ'' for [ +, 2]. At the sae tie, the rows for basis vectors of surface ψ () r can be extended fro 2 2 to by setting μ '' = 0 and p'' = p ' for [ 2 +, ]. κ' κ' κ' 2 0 μ' μ' μ' p ' μ' μ' μ' p ' μ' 2 μ' μ' 2 p ' 2 μ' μ' μ' ' p Figure 5. atrix transforation (a) Figure 6. atrix extension 0 κ'' κ'' κ'' 2 0 μ'' μ'' μ'' p '' μ'' μ'' μ'' p '' μ'' 2 μ'' μ'' 2 p '' 2 μ'' μ'' μ'' '' p As entioned in Section, switching rows or couns respectivey within the ast rows or the first couns of the PS paraeter atrix does not change the periodic surface. However, it akes the interpoated periodic surfaces different when the ethod of interpoation in the PS paraeter space is appied, as seen in Eq.(4.). hus, for two surfaces ψ () r in Eq.(4.) and ψ () 2 r in Eq.(4.2), there are possiby ax (, 2)!ax (, 2)! 2! 2! different transition paths between the initia and end surfaces defined in Eq.(4.). he objective is to seect the soothest transition path aong a these potentia candidates. hus, quantitative criteria for soothness are needed. In the next section, two soothness criteria are proposed SOOHNESS CRIERIA In this section, we propose two soothness criteria, inia space fied change and inia surface energy change, which wi be described in Sec. 5. and Sec. 5.2, respectivey. he first criterion is based on the potentia energy point of view, which assues the tota change of space energy wi be (b) 0 inia during the orphing process. On the other hand, the second criterion is based on the surface energy point of view. It assues the optia transition paths wi ake the tota change of surface energy inia. In addition, a heuristic ethod of surface orphing is proposed in Sec inia Space Fied Change In this criterion, it is assued that the optia transition path is the one with the inia change of space fied accuuativey during the orphing process. Since the vouetric vaues associated with PS odes represent the potentia energy in the three-diensiona space, the criterion of inia space fied change is to easure the tota change of potentia energy caused by the orphing process. Hence the transition path with the inia tota vouetric vaue change is considered to be the soothest one. ore accuratey, in the doain D = [ 05. x 05., 05. y 05., 05. z 05.,], the space fied change (SFC) between two periodic surfaces ψ () a r and ψ b () r is defined as D ( ψ ( ) ψ ( )) 2 SFC b r a r dr. Suppose ψ 0 () r is the initia surface, ψ n () r is the end surface and ψ k () r s (k =, 2,, n ) are the n interediate surfaces, the tota SFC (SFC) is cacuated by n ( ψ ( ) ( )) 2 t r ψt r dr (5.) SFC = t = D hus, the objective of this criterion is to iniize the SFC. In order to find the transition path with the inia SFC, we need to search and evauate a possibe candidates. he foowing exape shows the orphing process fro the P surface to I-WP surface using this criterion. abe shows the corresponding PS paraeter atrices of the P surface and I-WP surface after the atrix extension. In this exape, = 2 =, = and 2 = 9, as shown in abe. he degree of the P surface is extended to the sae as that of the I-WP surface by setting P' = P '' and μ ' 0 =, for = 4,5,...,9. he tota nuber of the transition paths is ( ) ( ) ax,!ax,9! = 504. For each of the n interediate! 9! fraes (n=20) in the transition path, we cacuate the su square of vouetric vaue changes. A resoution of in the discretized space is used. he SFC is found according to Eq.(5.) using step size he optia transition path is the one with the inia SFC. he best pair of PS paraeter atrices based on this criterion is isted in abe. Figure shows the optia transforation sequence. 5 Copyright 2009 by ASE

6 abe. he PS paraeter atrices of P and I-WP surface for inia space fied change criterion P surface I-WP surface λ = 0.05 λ = 0.0 λ = 0.5 λ = 0.20 λ = 0.25 λ = 0.0 λ = 0.5 λ = 0.40 λ = 0.45 λ = 0.50 H ( ψ ) ψ ψ 0 K = 4 ψ (5.2) where ψ is gradient and H ( ψ ) is Hessian atrix. It is assued that the optia transition path wi ake the accuuated change of surface energy inia during the orphing. We ap a periodic surface fro its vouetric space into its surface energy space using Eq.(5.2) in the doain D = [ 05. x 05., 05. y 05., 05. z 05.,]. he surface energy change (SEC) between two periodic surfaces ψ () a r and ψ b () r is defined as ( ( ) ( )) 2 SEC Kb r Ka r dr. Suppose that ψ 0 () r is the D initia periodic surface, ψ n () r is the end periodic surface and ψ () r s (k =, 2,, n ) are the n interediate periodic k surfaces. he tota SEC (SEC) is cacuated by the Eq. (5.). hus, the objective of this criterion is to iniize the SEC. In order to find the one with the inia SEC, we need to search and evauate a the possibe transition paths. n ( K ( ) ( )) 2 t r Kt r dr (5.) SEC = t = D Figure 8 shows the optia orphing sequence fro P surface to I-WP surface. In this exape, a resoution of in the discretized space is used. Step size is chosen as 0.20 so that the SEC is based on the accuuated surface energy change of five surfaces or five steps. abe 2 ists the best pair of PS paraeter atrices based on this criterion. λ = 0.55 λ = 0.60 λ = 0.65 λ = 0.70 λ = 0.75 λ = 0.05 λ = 0.0 λ = 0.5 λ = 0.20 λ = 0.25 λ = 0.80 λ = 0.85 λ = 0.90 λ = 0.95 λ =.00 Figure 7. he optia transition path based on inia SFC criterion 5.2 inia Surface Energy Change Curvature in geoetry is generay known as the aount by which a geoetric object deviates fro being fat. In differentia geoetry, surface energy can be defined as E = ( k ) 2 + k2 da 4 where k and k 2 are the two principe curvatures. In this criterion, we consider the Gaussian curvature of a periodic surface as an indicator of surface energy. Godan [6] deveoped the curvature foruas for ipicit surfaces. herefore, for a periodic surface in Eq. (.), the Gaussian curvature can be cacuated by λ = 0.0 λ = 0.5 λ = 0.40 λ = 0.45 λ = 0.50 λ = 0.55 λ = 0.60 λ = 0.65 λ = 0.70 λ = 0.75 λ = 0.80 λ = 0.85 λ = 0.90 λ = 0.95 λ =.00 Figure 8. he optia transition path based on inia SEC criterion 6 Copyright 2009 by ASE

7 abe 2 he PS paraeter atrices of P and I-WP surface for inia surface energy change criterion P surface I-WP surface Heuristic orphing Criteria he cacuation of either inia tota change of space fied or inia tota change of surface energy is a tie consuing process, because the vouetric data or Gaussian curvature of a interpoated interediate surfaces needs to be cacuated in a vouetric doain for a possibe transition paths. In this section, we propose a heuristic orphing criterion in the case of = 2 = and κ' = κ'' = in Eq. (4.) and Eq. (4.2) for an easy-to-copute soution. In fact, the conditions of = and κ = in Eq. (.) can aways be et if we utipy a the scae paraeters κ s with their corresponding p s to create new basis vectors. he purpose of this criterion is to reduce the tie copexity to deterine an acceptabe sooth transition path by avoiding evauations of a the interediate surfaces. here are three assuptions behind the heuristic orphing criterion. First, since periodic oents μ 's are the agnitude of cosine functions, they are considered to be scae reated paraeters. Second, since basis vectors P 's define the frequency and phase of cosine functions, they are considered to be shape reated paraeters. Finay, it is assued that the orphing process is sooth if the changes of basis vectors are as itte as possibe. For two surfaces ψ () r and ψ () 2 r in Eqs. (4.) and (4.2) with κ ' 0 = 2 = and κ' = κ'' =, et A = ' ' for ψ () r μ p κ '' 0 and B = '' '' for ψ 2 () r. Both A and B are ( + ) 5 μ p atrices, where = ax(, 2 ). We generaize the heuristic orphing criterion as foows.! Step. For a the possibe transition paths, find! 2 the one with inia p' p ''. = Step 2. If ore than one transition paths are found in step, further choose the one with inia inia 2 p ' if > 2. = p '' if < 2 or = Step. If ore than one transition paths are found in step2, arbitrariy choose any one of the. For the exape to find a transition path fro the P surface to I-WP surface, we appy this heuristic criterion. In step, 48 transition paths aong the tota of 504 possibe transition paths are found. In step 2, 5 transition paths are further seected as candidates. Finay in step, we arbitrariy choose one transition path, as shown in abe. Figure 9 shows the heuristic transition path with the step size of abe he PS paraeter atrices of P and I-WP surface for heuristic orphing criterion P surface I-WP surface λ = 0.05 λ = 0.0 λ = 0.5 λ = 0.20 λ = 0.25 λ = 0.0 λ = 0.5 λ = 0.40 λ = 0.45 λ = 0.50 λ = 0.55 λ = 0.60 λ = 0.65 λ = 0.70 λ = 0.75 λ = 0.80 λ = 0.85 λ = 0.90 λ = 0.95 λ =.00 Figure 9. Heuristic orphing process fro P surface to I-WP surface 7 Copyright 2009 by ASE

8 5.4 Resut discussions We presented three quantitative soothness criterions in this section and exapes are given. Here, we ony focus on etaorphosis of geoetric aspect of a shape. Any physica conditions such as teperature which are possibe to cause deviations between the actua transition path and the cacuated optia path are ignored in this stage. Since the type of phase transition that we are interested in is the oveent of any atos which resuts in changes between two crysta structures, it is reasonabe to assue that a physica conditions ike teperatures and pressures are unifor throughout the regions under consideration. In the inia space fied change criteria, the best transition path is the one with the east change of fied in the D space. Observing the shape transforation in Figure 7, we find the isosurfaces with isovaue zero in the transition path are reasonabe to expect the inia space fied change subjectivey. he inia surface energy change criteria is to find the transition path which causes the east change of surface Gaussian curvature, an indicator of the degree of bend of a shape. According to the resut shown in Figure 8, the shape transforation appears to be ess change in surface bend than those in Figure 7 and Figure 9. he heuristic orphing criteria does not have physica interpretation, but it is faster in cacuation than the other two because it is no need to cacuate vouetric data for each possibe transition path. he resut shown in Figure 9 shows the shape transforation is reasonaby sooth. One of the advantages of these soothness criteria is to provide a quantitative way so that the best transition path can be deterined objectivey. In addition, the ethod returns different outputs for different criteria. A proper seected criterion is needed ony for seecting a transition path rather than another phase transition schee. However, the ajor concern of the inia space fied change and surface energy change criteria is cacuation efficiency because a possibe aternative transitions ust be evauated before the optia path can be concuded. A heuristic criterion is proposed for quick and acceptabe soution, which ay not be the optiu. 6. SUARY AND FUURE WORK he artice presents a etaorphosis ethod between two PS odes, using interpoation in the PS ode paraeters space. he paraeter atrix representation of periodic surfaces is used so that the shape transforation is generated by atrix transforations. he etaorphosis of periodic surfaces creates utipe transition paths between two shapes. For further seections, different soothness criteria are used to contro the orphing process. wo soothness criteria, the inia space fied change and the inia space energy change, are proposed in this paper. o reduce cacuation tie, a heuristic criterion is aso presented. he in-between shapes generated by the proposed ethod and soothness criteria are natura and satisfactory. One of the future extensions is to set up corresponding contro points of the two periodic surfaces over the transforation. It ay yied ore sooth, hence ore natura, transition path throughout the etaorphosis. Another potentia extension is to add a fixed nuber of partices as a constraint during the orphing process. he consideration of the constraint wi ake it ore reaistic to ateria design. ACKNOWEDGEEN his work is supported in part by the NSF grant CI REFERENCES [] Wang, Y. (2006) Geoetric odeing of nano structures with periodic surfaces. ecture Notes in Coputer Science, Vo.4077, pp.4-56 [2] Wang, Y. (2007) Periodic surface odeing for Coputer Aided Nano Design. Coputer-Aided Design, 9(): [] Wang, Y. (2007) oci periodic surface reconstruction fro crystas. Coputer-Aided Design & Appications, 4(-4): [4] Wang, Y. (2007) Degree operations on periodic surfaces. Proc IDEC/CIE Conference, Sept.4-7, 2007, as Vegas, NV, Paper No. DEC [ 5 ] Wang, Y. (2008) Degree eevation and reduction of periodic surfaces. Coputer-Aided Design & Appications, in press [ 6 ] Qi, C. and Wang, Y., (2008) Feature-Based Crysta Construction in Coputer-Aided Nano-Design, 2008 ASE Internationa Design Engineering echnica Conferences & he Coputer and Inforation in Engineering Conference (IDEC/CIE2008), Aug.-6, 2008, New York City, NY, Paper No.DEC [ 7 ] Qi, C. and Wang, Y., (2008) Feature-Based Crysta Construction in Coputer-Aided Nano-Design, Coputer- Aided Design, in review [8] asrado, V., Ahat, D., and Wang, Y., (2008) A Review of Recent Phase ransition Siuation ethods: ransition Path Search, 2008 ASE Internationa Design Engineering echnica Conferences & he Coputer and Inforation in Engineering Conference (IDEC/CIE2008), Aug.-6, 2008, New York City, NY, Paper No.DEC [9] Ahat, D., asrado, V., and Wang, Y., (2008) A Review of Recent Phase ransition Siuation ethods: Sadde Point Search, 2008 ASE Internationa Design Engineering echnica Conferences & he Coputer and Inforation in Engineering Conference (IDEC/CIE2008), Aug.-6, 2008, New York City, NY, Paper No.DEC [ 0 ] Woberg, G. (990) Digita Iage Warping. IEEE Coputer Society P., os Aaitos, CA [] Beier,. and Neey, S. (992) Feature-based iage etaorphosis. Coputer Graphic, vo 26(2), pp 5-4, New York, NY, Juy Copyright 2009 by ASE

9 [2] Cove,. and Withgott. (994) Spanning the gap between otion estiation and. Proceedings of IEEE Internationa Conference on Acoustics, Speech and Signa Processing, vo 5, pp 2-26, New York, NY, 994 [] itta, A. (999) hree-diensiona etaorphosis using utipanar representation, utiedia Coputing and Systes, IEEE Internationa Conference, Vo., pp: [4] azarus, F. and Verroust, A. (998) hree-diensiona etaorphosis: a survey. he Visua Coputer, 4:7-89 [ 5 ] Pasko, A. and Savchenko, V. (995) Constructing functionay defined surfaces. Ipicit Surface, Grenobe, France, Eurographics association, pp [6] Wyvi, B. (99) odeing, visuaizing and aniating with ipicit surfaces. etaorphosis of Ipicit Surfaces (Siggraph 9 course notes Nuber 25), Anahei, CA, USA, August 99 [ 7 ] Kau, A. and Rossignac, J. (99) Estabishing correspondences by topoogica erging: a new approach to -D shape transforation. Graphics Interface 9, Graphics Interface'9, Cagary, Canadian Inforation Processing Society, pp 27±278 [8] Rossignac, J. and Kau, A. (994) AGRES and BIBs: etaorphosis as a Bezier curve in the space of poyhedra. Eurographics 94, Oso, Backwe, pp C79-84 [9] Gain, E. and Akkouche, S. (996) Shape constrained bob etaorphosis. Ipicit Surface 96, Poitiers, Backwe, pp C4-C5 [ 20 ] Barbier, A., Gain, E. and Akkouche S. (2004) A fraework of odeing, aniating and orphing textured ipicit odes, Graphica odes, Voue 67, Issue, pp:66-88 [2] Hughes, J. (992) Schedued Fourier voue orphing. Coputer Graph (Siggraph 92), 26: 4-46 [22] He,., Wang, S. and Kaufan, A. (994) Waveet-based voue orphing. Proceedings of Visuaization 94, IEEE Coputer Society Press, Washington, DC, pp [2] erios, A., Garfinke, C. and evoy,. (995) Featurebased voue etaorphosis. Coputer Graph (SIGGRAPH' 95) 29: [24] Cohen-Or, D., evin, D. and Sooovoci, A. (996) Contour bending using warp-guided distance fied interpoation. Proceedings of Visuaization'96, San Francisco, IEEE Coputer Society Press, pp [25] urk, G., and O Brien, J. (999) Shape transforation using variationa ipicit functions, Coputer Graphics Proccedings, Annua Conference Serie 99, AC SIGGRAPH 99, pp 5-42 [26] urk, G., and O Brien, J. (2002) odeing with ipicit surfaces that interpoate, AC ransactions on Graphics, Vo.2, No.4, October 2002, pp [27] Fausett E., Pasko A. and Adzhiev V., (2000) Space-tie and higher diensiona odeing for aniation, Coputer Aniation 2000, IEEE Coputer Society, ISBN [28] Fang, X., Bao, H., Heng, P., Wong,. and Peng, Q., (200) Continuous fied based free-for surface odeing and orphing, Coputers & Graphics, Vo. 25, Issue 2, Apri 200, pp [29] reece, G., Prager, R. and Gee, A., (200) Voue-based three-diensiona etaorphosis using sphere-guided region correspondence, he Visua Coputer, 7: [0] Cong, Ge., Esser,., Parvin, B. and Bebis, G., (2004) Shape etaorphis using p-apacian equation, Proceedings of the Pattern Recognition, 7th Internationa Conference on (ICPR'04), Vo.04, pp 5-8 [] Bao, Y., Guo, X. and Qin, H. (2005) Physicay based orphing of point-saped surfaces, Coputer Aniation and Virtua Words, 6: [2] Sun, Y., Wang, W. and Chin, FY. (997) Interpoating poyhedra odes using intrinsic shape paraeters. Visuaization Coput Ani, 8:8-96 [] azarus, F. and Verroust, A. (997) etaorphosis of cyinder-ike objects. Int J Visuaization Coput Ani, 8:-46 [4] Chen, SE. and Parent, RE. (989) Shape averaging and its appications to industria design. IEEE Coput Graph, 9:47-54 [5] Kanai,., Suzuki, H. and Kiura, F. (998) D geoetric etaorphosis based on haronic ap. An extended version of this paper appeared in the October issue of the Visua Coputer. Visua Coput 4:66-76 [6] Godan, R. (2005) Curvature foruas for ipicit curves and surfaces, Coputer Aided Geoetric Design, 22: Copyright 2009 by ASE

A NEW METHOD FOR OPTIMAL LOCATION OF FACTS CONTROLLERS USING GENETIC ALGORITHM

A NEW METHOD FOR OPTIMAL LOCATION OF FACTS CONTROLLERS USING GENETIC ALGORITHM Journa of heoretica and Appied Inforation echnoogy 200-2007 JAI. A rights reserved. www.atit.org A NEW MEHOD FOR OPIMAL LOCAION OF FACS CONROLLERS USING GENEIC ALGORIHM 1 K. Vayakuar, 2 Dr. R. P. Kuudinidevi

More information

Computer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13

Computer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13 Coputer Aided Drafting, Design and Manufacturing Volue 26, uber 2, June 2016, Page 13 CADDM 3D reconstruction of coplex curved objects fro line drawings Sun Yanling, Dong Lijun Institute of Mechanical

More information

Performance Modeling of Database Servers in a Telecommunication Service Management System

Performance Modeling of Database Servers in a Telecommunication Service Management System ICDT : The Seventh Internationa Conference on Digita Teecounications Perforance Modeing of Database Servers in a Teecounication Service Manageent Syste Maria Kih, Paya Aani, Anders Robertsson, Gabriea

More information

A Fast Recovery Technique for Multi-Point to Multi-Point MPLS tunnels

A Fast Recovery Technique for Multi-Point to Multi-Point MPLS tunnels M. Chaitou and J. L. Roux / IJECCT 01, Vo. (3) 34 A Fast Recovery Technique for Muti-Point to Muti-Point MPLS tunnes Mohaad Chaitou and Jean-Louis Le RouxOrange Labs avenue Pierre Marzin, 300 Lannion France

More information

Improving Memory Energy Using Access Pattern Classification

Improving Memory Energy Using Access Pattern Classification Iproving Meory Energy Using Access Pattern Cassification Mahut Kandeir Microsystes Design Lab Pennsyvania State University University Par, PA 16802 andeir@cse.psu.edu Ugur Sezer ECE Departent University

More information

Origami Axioms. O2 Given two marked points P and Q, we can fold a marked line that places P on top of Q.

Origami Axioms. O2 Given two marked points P and Q, we can fold a marked line that places P on top of Q. Origai Axios Given a piece of paper, it is possibe to fod ots of different ines on it. However, ony soe of those ines are constructibe ines, eaning that we can give precise rues for foding the without

More information

Lines and Angles. introduction

Lines and Angles. introduction 9 Lines and nges intrductin In cass VI, you have earnt soe basic concepts and ters of geoetry point, ine, pane, ine segent, ray, ange and types of anges. In this chapter, we sha earn about soe pairs of

More information

Database Replication Algorithm Performance in High Speed Networks Under Load Balancing

Database Replication Algorithm Performance in High Speed Networks Under Load Balancing Database Repication Agorith Perforance in High Speed Networks Under Load Baancing Rekh Nath Singh 1, Raghura Singh 2 1 Research Schoar, A. P. J. Abdu Kaa Technica University, Lucknow, India. 2 Director,

More information

INTEGRATION OF A TERRESTRIAL LASER SCANNER WITH GPS/IMU ORIENTATION SENSORS

INTEGRATION OF A TERRESTRIAL LASER SCANNER WITH GPS/IMU ORIENTATION SENSORS INTEGRATION OF A TERRESTRIAL LASER SCANNER WITH GPS/IMU ORIENTATION SENSORS J.Taaya, R.Aaus, E.Bosch, A.Serra, W.Kornus, A.Baron Institut Cartogràfic de Cataunya (ICC), Parc de Montjuïc, E-08038 Barceona

More information

MosaicShape: Stochastic Region Grouping with Shape Prior

MosaicShape: Stochastic Region Grouping with Shape Prior Boston University Coputer Science Technica Report No. 2005-008, Feb. 2005. To appear in Proc. CVPR, 2005. MosaicShape: Stochastic Region Grouping with Shape Prior Jingbin Wang Erdan Gu Margrit Bete Coputer

More information

Running Tite: Conict-Free Access of Paths Address for Correspondence: M.C. Pinotti IEI-CNR Via S. Maria, Pisa ITALY E-ai:

Running Tite: Conict-Free Access of Paths Address for Correspondence: M.C. Pinotti IEI-CNR Via S. Maria, Pisa ITALY E-ai: Mappings for Conict-Free Access of Paths in Bidiensiona Arrays, Circuar Lists, and Copete Trees Aan A. Bertossi y and M. Cristina Pinotti Istituto di Eaborazione de' Inforazione Nationa Counci of Research

More information

Concise Papers. Main Memory Indexing: The Case for BD-Tree 1 INTRODUCTION 3 COST ANALYSIS 2 THE MEMORY-BASED BD-TREE

Concise Papers. Main Memory Indexing: The Case for BD-Tree 1 INTRODUCTION 3 COST ANALYSIS 2 THE MEMORY-BASED BD-TREE 870 IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 16, NO. 7, JULY 2004 Concise Papers Main Meory Indexing: The Case for BD-Tree BinCui,BengChinOoi,Meber, IEEE, Jianwen Su, Senior Meber, IEEE,

More information

COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL

COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL 1 Te-Wei Chiang ( 蔣德威 ), 2 Tienwei Tsai ( 蔡殿偉 ), 3 Jeng-Ping Lin ( 林正平 ) 1 Dept. of Accounting Inforation Systes, Chilee Institute

More information

Image Filter Using with Gaussian Curvature and Total Variation Model

Image Filter Using with Gaussian Curvature and Total Variation Model IJECT Vo l. 7, Is s u e 3, Ju l y - Se p t 016 ISSN : 30-7109 (Online) ISSN : 30-9543 (Print) Iage Using with Gaussian Curvature and Total Variation Model 1 Deepak Kuar Gour, Sanjay Kuar Shara 1, Dept.

More information

Hiding secrete data in compressed images using histogram analysis

Hiding secrete data in compressed images using histogram analysis University of Woongong Research Onine University of Woongong in Dubai - Papers University of Woongong in Dubai 2 iding secrete data in compressed images using histogram anaysis Farhad Keissarian University

More information

LARGE SCALE MARS MAPPING AND ROVER LOCALIZATION USING DESCENT AND ROVER IMAGERY

LARGE SCALE MARS MAPPING AND ROVER LOCALIZATION USING DESCENT AND ROVER IMAGERY LRGE SCLE MRS MIG D ROVER LOCLIZIO USIG DESCE D ROVER IMGERY Rongxing LI *, Fei M *, Fengiang U *, Larry MHIES **, Cark OLSO **, Yaing IOG ** * Departent of Civi and Environenta Engineering and Geodetic

More information

Automatic Conversion Software for the Safety Verification of Goal-Based Control Programs

Automatic Conversion Software for the Safety Verification of Goal-Based Control Programs Subitted, 2009 Internationa Conference on Software Engineering (ICSE) http://www.cds.catech.edu/~urray/papers/2008t_h09-icse.ht Autoatic Conversion Software for the Safety Verification of Goa-Based Contro

More information

The optimization design of microphone array layout for wideband noise sources

The optimization design of microphone array layout for wideband noise sources PROCEEDINGS of the 22 nd International Congress on Acoustics Acoustic Array Systes: Paper ICA2016-903 The optiization design of icrophone array layout for wideband noise sources Pengxiao Teng (a), Jun

More information

A comparative study of colortexture

A comparative study of colortexture 12th Int. Worshop on Systes, Signas & Iage Processing, 22-24 Septeber 2005, haida, Greece 205 A coparative study of coortexture iage features Diitris Iaovidis* Departent of Inforatics and Teecounications,

More information

Novel Image Representation and Description Technique using Density Histogram of Feature Points

Novel Image Representation and Description Technique using Density Histogram of Feature Points Novel Iage Representation and Description Technique using Density Histogra of Feature Points Keneilwe ZUVA Departent of Coputer Science, University of Botswana, P/Bag 00704 UB, Gaborone, Botswana and Tranos

More information

Extending Graph Rewriting for Refactoring

Extending Graph Rewriting for Refactoring Extending Graph Rewriting for Refactoring Nies Van Eetvede, Dirk Janssens University of Antwerp Departent of oputer science Middeheiaan 1 2020 Antwerpen {nies.vaneetvede dirk.janssens@ua.ac.be Abstract.

More information

A Petrel Plugin for Surface Modeling

A Petrel Plugin for Surface Modeling A Petre Pugin for Surface Modeing R. M. Hassanpour, S. H. Derakhshan and C. V. Deutsch Structure and thickness uncertainty are important components of any uncertainty study. The exact ocations of the geoogica

More information

Language Identification for Texts Written in Transliteration

Language Identification for Texts Written in Transliteration Language Identification for Texts Written in Transiteration Andrey Chepovskiy, Sergey Gusev, Margarita Kurbatova Higher Schoo of Economics, Data Anaysis and Artificia Inteigence Department, Pokrovskiy

More information

OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS

OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS Key words SOA, optial, coplex service, coposition, Quality of Service Piotr RYGIELSKI*, Paweł ŚWIĄTEK* OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS One of the ost iportant tasks in service oriented

More information

AN EVOLUTIONARY APPROACH TO OPTIMIZATION OF A LAYOUT CHART

AN EVOLUTIONARY APPROACH TO OPTIMIZATION OF A LAYOUT CHART 13 AN EVOLUTIONARY APPROACH TO OPTIMIZATION OF A LAYOUT CHART Eva Vona University of Ostrava, 30th dubna st. 22, Ostrava, Czech Repubic e-mai: Eva.Vona@osu.cz Abstract: This artice presents the use of

More information

A Secure Approach for Caching Contents in Wireless Ad Hoc Networks

A Secure Approach for Caching Contents in Wireless Ad Hoc Networks A Secure Approach for Caching Contents in Wireess Ad Hoc Networks Mohsen Karizadeh Kiskani and Haid R. Sadjadpour Abstract Caching ais to store data ocay in soe nodes within the network to be abe to retrieve

More information

Sensitivity Analysis of Hopfield Neural Network in Classifying Natural RGB Color Space

Sensitivity Analysis of Hopfield Neural Network in Classifying Natural RGB Color Space Sensitivity Anaysis of Hopfied Neura Network in Cassifying Natura RGB Coor Space Department of Computer Science University of Sharjah UAE rsammouda@sharjah.ac.ae Abstract: - This paper presents a study

More information

Digital Image Watermarking Algorithm Based on Fast Curvelet Transform

Digital Image Watermarking Algorithm Based on Fast Curvelet Transform J. Software Engineering & Appications, 010, 3, 939-943 doi:10.436/jsea.010.310111 Pubished Onine October 010 (http://www.scirp.org/journa/jsea) 939 igita Image Watermarking Agorithm Based on Fast Curveet

More information

(Geometric) Camera Calibration

(Geometric) Camera Calibration (Geoetric) Caera Calibration CS635 Spring 217 Daniel G. Aliaga Departent of Coputer Science Purdue University Caera Calibration Caeras and CCDs Aberrations Perspective Projection Calibration Caeras First

More information

A Memory Grouping Method for Sharing Memory BIST Logic

A Memory Grouping Method for Sharing Memory BIST Logic A Memory Grouping Method for Sharing Memory BIST Logic Masahide Miyazai, Tomoazu Yoneda, and Hideo Fuiwara Graduate Schoo of Information Science, Nara Institute of Science and Technoogy (NAIST), 8916-5

More information

Relief shape inheritance and graphical editor for the landscape design

Relief shape inheritance and graphical editor for the landscape design Relief shape inheritance and graphical editor for the landscape design Egor A. Yusov Vadi E. Turlapov Nizhny Novgorod State University after N. I. Lobachevsky Nizhny Novgorod Russia yusov_egor@ail.ru vadi.turlapov@cs.vk.unn.ru

More information

Game Theory-Based Nonlinear Bandwidth Pricing for Congestion Control in Cloud Networks

Game Theory-Based Nonlinear Bandwidth Pricing for Congestion Control in Cloud Networks 216 IEEE 8th Internationa Conference on Coud Coputing Technoogy and Science Gae Theory-ased Noninear andwidth Pricing for Congestion Contro in Coud Networs Abouzar Ghavai, Zhuozhao Li and Haiying Shen

More information

Data pre-processing framework in SPM. Bogdan Draganski

Data pre-processing framework in SPM. Bogdan Draganski Data pre-processing fraework in SPM Bogdan Draganski Outline Why do we need pre-processing? Overview Structural MRI pre-processing fmri pre-processing Why do we need pre-processing? What do we want? Reason

More information

CS 231. Inverse Kinematics Intro to Motion Capture. 3D characters. Representation. 1) Skeleton Origin (root) Joint centers/ bones lengths

CS 231. Inverse Kinematics Intro to Motion Capture. 3D characters. Representation. 1) Skeleton Origin (root) Joint centers/ bones lengths CS Inverse Kinematics Intro to Motion Capture Representation D characters ) Skeeton Origin (root) Joint centers/ bones engths ) Keyframes Pos/Rot Root (x) Joint Anges (q) Kinematics study of static movement

More information

Optimized stereo reconstruction of free-form space curves based on a nonuniform rational B-spline model

Optimized stereo reconstruction of free-form space curves based on a nonuniform rational B-spline model 1746 J. Opt. Soc. A. A/ Vol. 22, No. 9/ Septeber 2005 Y. J. Xiao and Y. F. Li Optiized stereo reconstruction of free-for space curves based on a nonunifor rational B-spline odel Yi Jun Xiao Departent of

More information

A Design Method for Optimal Truss Structures with Certain Redundancy Based on Combinatorial Rigidity Theory

A Design Method for Optimal Truss Structures with Certain Redundancy Based on Combinatorial Rigidity Theory 0 th Word Congress on Structura and Mutidiscipinary Optimization May 9 -, 03, Orando, Forida, USA A Design Method for Optima Truss Structures with Certain Redundancy Based on Combinatoria Rigidity Theory

More information

DKD-R 4-2 Calibration of Devices and Standards for Roughness Metrology Sheet 2: Calibration of the vertical measuring system of stylus instruments

DKD-R 4-2 Calibration of Devices and Standards for Roughness Metrology Sheet 2: Calibration of the vertical measuring system of stylus instruments DKD-R 4- Calibration of Devices and Standards for Roughness Metrology Sheet : Calibration of the vertical easuring syste of stylus instruents DKD-R 4- Sheet.7 DKD-R 4- Calibration of Devices and Standards

More information

An Integrated Processing Method for Multiple Large-scale Point-Clouds Captured from Different Viewpoints

An Integrated Processing Method for Multiple Large-scale Point-Clouds Captured from Different Viewpoints 519 An Integrated Processing Method for Multiple Large-scale Point-Clouds Captured fro Different Viewpoints Yousuke Kawauchi 1, Shin Usuki, Kenjiro T. Miura 3, Hiroshi Masuda 4 and Ichiro Tanaka 5 1 Shizuoka

More information

Area Efficient Implementation of Elliptic Curve Point Multiplication Algorithm

Area Efficient Implementation of Elliptic Curve Point Multiplication Algorithm (IJACSA) Internationa Journa of Advanced Coputer Science and Appications, Vo. 6, No., 5 Area Efficient Ipeentation of Eiptic Curve Point Mutipication Agorith Suni Devidas Bobade Research Schoar S.G.B.Aravati

More information

Solutions to the Final Exam

Solutions to the Final Exam CS/Math 24: Intro to Discrete Math 5//2 Instructor: Dieter van Mekebeek Soutions to the Fina Exam Probem Let D be the set of a peope. From the definition of R we see that (x, y) R if and ony if x is a

More information

A simplified approach to merging partial plane images

A simplified approach to merging partial plane images A siplified approach to erging partial plane iages Mária Kruláková 1 This paper introduces a ethod of iage recognition based on the gradual generating and analysis of data structure consisting of the 2D

More information

Evaluation of a multi-frame blind deconvolution algorithm using Cramér-Rao bounds

Evaluation of a multi-frame blind deconvolution algorithm using Cramér-Rao bounds Evaluation of a ulti-frae blind deconvolution algorith using Craér-Rao bounds Charles C. Beckner, Jr. Air Force Research Laboratory, 3550 Aberdeen Ave SE, Kirtland AFB, New Mexico, USA 87117-5776 Charles

More information

TALLINN UNIVERSITY OF TECHNOLOGY, INSTITUTE OF PHYSICS 17. FRESNEL DIFFRACTION ON A ROUND APERTURE

TALLINN UNIVERSITY OF TECHNOLOGY, INSTITUTE OF PHYSICS 17. FRESNEL DIFFRACTION ON A ROUND APERTURE 7. FRESNEL DIFFRACTION ON A ROUND APERTURE. Objective Exaining diffraction pattern on a round aperture, deterining wavelength of light source.. Equipent needed Optical workbench, light source, color filters,

More information

Computer Graphics. - Shading & Texturing -

Computer Graphics. - Shading & Texturing - Computer Graphics - Shading & Texturing - Empirica BRDF Approximation Purey heuristic mode Initiay without units (vaues [0,1] r = r,a + r,d + r,s ( + r,m + r,t r,a : Ambient term Approximate indirect iumination

More information

Multi-level Shape Recognition based on Wavelet-Transform. Modulus Maxima

Multi-level Shape Recognition based on Wavelet-Transform. Modulus Maxima uti-eve Shape Recognition based on Waveet-Transform oduus axima Faouzi Aaya Cheikh, Azhar Quddus and oncef Gabbouj Tampere University of Technoogy (TUT), Signa Processing aboratory, P.O. Box 553, FIN-33101

More information

Mobile App Recommendation: Maximize the Total App Downloads

Mobile App Recommendation: Maximize the Total App Downloads Mobie App Recommendation: Maximize the Tota App Downoads Zhuohua Chen Schoo of Economics and Management Tsinghua University chenzhh3.12@sem.tsinghua.edu.cn Yinghui (Catherine) Yang Graduate Schoo of Management

More information

A Broadband Spectrum Sensing Algorithm in TDCS Based on ICoSaMP Reconstruction

A Broadband Spectrum Sensing Algorithm in TDCS Based on ICoSaMP Reconstruction MATEC Web of Conferences 73, 03073(08) https://doi.org/0.05/atecconf/087303073 SMIMA 08 A roadband Spectru Sensing Algorith in TDCS ased on I Reconstruction Liu Yang, Ren Qinghua, Xu ingzheng and Li Xiazhao

More information

PARALLEL database systems are essential to important

PARALLEL database systems are essential to important IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 13, NO. 12, DECEMBER 2002 1211 Load Baanced and Optia Disk Aocation Strategy for Partia Match Queries on Mutidiensiona Fies Saja K. Das, Meber,

More information

INTERLEAVED DIMENSION DECOMPOSITION: A NEW DECOMPOSITION METHOD FOR WAVELETS AND ITS APPLICATION TO COMPUTER GRAPHICS

INTERLEAVED DIMENSION DECOMPOSITION: A NEW DECOMPOSITION METHOD FOR WAVELETS AND ITS APPLICATION TO COMPUTER GRAPHICS INTERLEAVED DIMENSION DECOMPOSITION: A NEW DECOMPOSITION METHOD FOR WAVELETS AND ITS APPLICATION TO COMPUTER GRAPHICS Manfred Kopp and Werner Purgathofer Vienna University of Technology Institute of Coputer

More information

A Discrete Spring Model to Generate Fair Curves and Surfaces

A Discrete Spring Model to Generate Fair Curves and Surfaces A Discrete Spring Model to Generate Fair Curves and Surfaces Atsushi Yaada Kenji Shiada 2 Tootake Furuhata and Ko-Hsiu Hou 2 Tokyo Research Laboratory IBM Japan Ltd. LAB-S73 623-4 Shiotsurua Yaato Kanagawa

More information

A Comparison of a Second-Order versus a Fourth- Order Laplacian Operator in the Multigrid Algorithm

A Comparison of a Second-Order versus a Fourth- Order Laplacian Operator in the Multigrid Algorithm A Comparison of a Second-Order versus a Fourth- Order Lapacian Operator in the Mutigrid Agorithm Kaushik Datta (kdatta@cs.berkeey.edu Math Project May 9, 003 Abstract In this paper, the mutigrid agorithm

More information

Stereo. CS 510 May 2 nd, 2014

Stereo. CS 510 May 2 nd, 2014 Stereo CS 510 May 2 nd, 2014 Where are we? We are done! (essentiay) We covered image matching Correation & Correation Fiters Fourier Anaysis PCA We covered feature-based matching Bag of Features approach

More information

Discrete elastica model for shape design of grid shells

Discrete elastica model for shape design of grid shells Abstracts for IASS Annua Symposium 017 5 8th September, 017, Hamburg, Germany Annette Böge, Manfred Grohmann (eds.) Discrete eastica mode for shape design of grid shes Yusuke SAKAI* and Makoto OHSAKI a

More information

DETERMINING INTUITIONISTIC FUZZY DEGREE OF OVERLAPPING OF COMPUTATION AND COMMUNICATION IN PARALLEL APPLICATIONS USING GENERALIZED NETS

DETERMINING INTUITIONISTIC FUZZY DEGREE OF OVERLAPPING OF COMPUTATION AND COMMUNICATION IN PARALLEL APPLICATIONS USING GENERALIZED NETS DETERMINING INTUITIONISTIC FUZZY DEGREE OF OVERLAPPING OF COMPUTATION AND COMMUNICATION IN PARALLEL APPLICATIONS USING GENERALIZED NETS Pave Tchesmedjiev, Peter Vassiev Centre for Biomedica Engineering,

More information

Gromov-Hausdorff Distance Between Metric Graphs

Gromov-Hausdorff Distance Between Metric Graphs Groov-Hausdorff Distance Between Metric Graphs Jiwon Choi St Mark s School January, 019 Abstract In this paper we study the Groov-Hausdorff distance between two etric graphs We copute the precise value

More information

Image Processing for fmri John Ashburner. Wellcome Trust Centre for Neuroimaging, 12 Queen Square, London, UK.

Image Processing for fmri John Ashburner. Wellcome Trust Centre for Neuroimaging, 12 Queen Square, London, UK. Iage Processing for fmri John Ashburner Wellcoe Trust Centre for Neuroiaging, 12 Queen Square, London, UK. Contents * Preliinaries * Rigid-Body and Affine Transforations * Optiisation and Objective Functions

More information

AGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM

AGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM International Journal of Software Engineering & Applications (IJSEA), Vol.6, No.5, Septeber 205 AGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM Xie Yang and Cheng Wushan College of Mechanical Engineering,

More information

Advances in Crystallographic Image Processing for Scanning Probe Microscopy

Advances in Crystallographic Image Processing for Scanning Probe Microscopy Advances in Crystaographic Iage Processing for Scanning Probe Microscopy P. Moeck Nano-Crystaography Group, Departent of Physics, Portand State University, 1719 SW 10 th Avenue (SRTC), Portand, OR 97201,

More information

Discrete Fourier Transform

Discrete Fourier Transform Discrete Fourier Transfor This is the first tutorial in our ongoing series on tie series spectral analysis. In this entry, we will closely exaine the discrete Fourier transfor (aa DFT) and its inverse,

More information

TRANSFORMATIONS AND SYMMETRY

TRANSFORMATIONS AND SYMMETRY TRNSFORMTIONS ND SYMMETRY 1.2.1 1.2.5 Studing transforations of geoetric shapes buids a foundation for a ke idea in geoetr: congruence. In this introduction to transforations, the students epore three

More information

IMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE. Rafael García, Xevi Cufí and Lluís Pacheco

IMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE. Rafael García, Xevi Cufí and Lluís Pacheco IMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE Rafael García, Xevi Cufí and Lluís Pacheco Coputer Vision and Robotics Group Institute of Inforatics and Applications, University of

More information

Depth Estimation of 2-D Magnetic Anomalous Sources by Using Euler Deconvolution Method

Depth Estimation of 2-D Magnetic Anomalous Sources by Using Euler Deconvolution Method Aerican Journal of Applied Sciences 1 (3): 209-214, 2004 ISSN 1546-9239 Science Publications, 2004 Depth Estiation of 2-D Magnetic Anoalous Sources by Using Euler Deconvolution Method 1,3 M.G. El Dawi,

More information

POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION. Junjun Jiang, Ruimin Hu, Zhen Han, Tao Lu, and Kebin Huang

POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION. Junjun Jiang, Ruimin Hu, Zhen Han, Tao Lu, and Kebin Huang IEEE International Conference on ultiedia and Expo POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION Junjun Jiang, Ruiin Hu, Zhen Han, Tao Lu, and Kebin Huang National Engineering

More information

Geo-activity Recommendations by using Improved Feature Combination

Geo-activity Recommendations by using Improved Feature Combination Geo-activity Recoendations by using Iproved Feature Cobination Masoud Sattari Middle East Technical University Ankara, Turkey e76326@ceng.etu.edu.tr Murat Manguoglu Middle East Technical University Ankara,

More information

COMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, August 23, 2004, 12:38 PM) PART III: CHAPTER ONE DIFFUSERS FOR CGH S

COMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, August 23, 2004, 12:38 PM) PART III: CHAPTER ONE DIFFUSERS FOR CGH S COPUTER GEERATED HOLOGRAS Optical Sciences 67 W.J. Dallas (onday, August 3, 004, 1:38 P) PART III: CHAPTER OE DIFFUSERS FOR CGH S Part III: Chapter One Page 1 of 8 Introduction Hologras for display purposes

More information

Resolution. Super-Resolution Imaging. Problem

Resolution. Super-Resolution Imaging. Problem Resolution Super-Resolution Iaging Resolution: Sallest easurable detail in a visual presentation Subhasis Chaudhuri Departent of Electrical Engineering Indian institute of Technology Bobay Powai, Mubai-400

More information

TSR: Topology Reduction from Tree to Star Data Grids

TSR: Topology Reduction from Tree to Star Data Grids 03 Seventh Internationa Conference on Innovative Mobie and Internet Services in biquitous Computing TSR: Topoogy Reduction from Tree to Star Data Grids Ming-Chang Lee #, Fang-Yie Leu *, Ying-ping Chen

More information

ELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH

ELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH ELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH Kulapraote Prathuchai Geoinforatics Center, Asian Institute of Technology, 58 Moo9, Klong Luang, Pathuthani, Thailand.

More information

MONTE Carlo ray tracing is the method of choice for

MONTE Carlo ray tracing is the method of choice for IEEE TRASACTIOS O VISUALIZATIO AD COMPUTER GRAPHICS, VOL. 11, O. 5, SEPTEMBER/OCTOBER 25 1 Radiance Caching for Efficient Goba Iuination Coputation Jarosav Kriváne, Pasca Gautron, Suanta Pattanai, Meber,

More information

EE 364B Convex Optimization An ADMM Solution to the Sparse Coding Problem. Sonia Bhaskar, Will Zou Final Project Spring 2011

EE 364B Convex Optimization An ADMM Solution to the Sparse Coding Problem. Sonia Bhaskar, Will Zou Final Project Spring 2011 EE 364B Convex Optiization An ADMM Solution to the Sparse Coding Proble Sonia Bhaskar, Will Zou Final Project Spring 20 I. INTRODUCTION For our project, we apply the ethod of the alternating direction

More information

Real-Time Image Generation with Simultaneous Video Memory Read/Write Access and Fast Physical Addressing

Real-Time Image Generation with Simultaneous Video Memory Read/Write Access and Fast Physical Addressing Rea-Time Image Generation with Simutaneous Video Memory Read/rite Access and Fast Physica Addressing Mountassar Maamoun 1, Bouaem Laichi 2, Abdehaim Benbekacem 3, Daoud Berkani 4 1 Department of Eectronic,

More information

Summary. Reconstruction of data from non-uniformly spaced samples

Summary. Reconstruction of data from non-uniformly spaced samples Is there always extra bandwidth in non-unifor spatial sapling? Ralf Ferber* and Massiiliano Vassallo, WesternGeco London Technology Center; Jon-Fredrik Hopperstad and Ali Özbek, Schluberger Cabridge Research

More information

Effective Tracking of the Players and Ball in Indoor Soccer Games in the Presence of Occlusion

Effective Tracking of the Players and Ball in Indoor Soccer Games in the Presence of Occlusion Effective Tracking of the Players and Ball in Indoor Soccer Gaes in the Presence of Occlusion Soudeh Kasiri-Bidhendi and Reza Safabakhsh Airkabir Univerisity of Technology, Tehran, Iran {kasiri, safa}@aut.ac.ir

More information

Ming-Wei Lee 1, Wei-Tso Lin 1, Yu-Ching Ni 2, Meei-Ling Jan 2, Yi-Chun Chen 1 * National Central University

Ming-Wei Lee 1, Wei-Tso Lin 1, Yu-Ching Ni 2, Meei-Ling Jan 2, Yi-Chun Chen 1 * National Central University Rapid Constructions of Circular-Orbit Pinhole SPECT Iaging Syste Matrices by Gaussian Interpolation Method Cobined with Geoetric Paraeter Estiations (GIMGPE Ming-Wei Lee, Wei-Tso Lin, Yu-Ching Ni, Meei-Ling

More information

Stereo Matching with Energy Minimizing Snake Grid for 3D Face Modeling

Stereo Matching with Energy Minimizing Snake Grid for 3D Face Modeling Stereo Matching with Energy Minimizing Snake Grid for 3D Face Modeing Shafik Huq 1, Besma Abidi 1, Ardeshir Goshtasby 2, and Mongi Abidi 1 1 Imaging, Robotics, and Inteigent System (IRIS) Laboratory, Department

More information

Automatic Graph Drawing Algorithms

Automatic Graph Drawing Algorithms Autoatic Graph Drawing Algoriths Susan Si sisuz@turing.utoronto.ca Deceber 7, 996. Ebeddings of graphs have been of interest to theoreticians for soe tie, in particular those of planar graphs and graphs

More information

Shape Optimization of Quad Mesh Elements

Shape Optimization of Quad Mesh Elements Shape Optiization of Quad Mesh Eleents Yufei Li 1, Wenping Wang 1, Ruotian Ling 1, and Changhe Tu 2 1 The University of Hong Kong 2 Shandong University Abstract We study the proble of optiizing the face

More information

Region Segmentation Region Segmentation

Region Segmentation Region Segmentation /7/ egion Segentation Lecture-7 Chapter 3, Fundaentals of Coputer Vision Alper Yilaz,, Mubarak Shah, Fall UCF egion Segentation Alper Yilaz,, Mubarak Shah, Fall UCF /7/ Laer epresentation Applications

More information

TensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3

TensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3 2017 2nd International Conference on Coputational Modeling, Siulation and Applied Matheatics (CMSAM 2017) ISBN: 978-1-60595-499-8 TensorFlow and Keras-based Convolutional Neural Network in CAT Iage Recognition

More information

Further Optimization of the Decoding Method for Shortened Binary Cyclic Fire Code

Further Optimization of the Decoding Method for Shortened Binary Cyclic Fire Code Further Optimization of the Decoding Method for Shortened Binary Cycic Fire Code Ch. Nanda Kishore Heosoft (India) Private Limited 8-2-703, Road No-12 Banjara His, Hyderabad, INDIA Phone: +91-040-3378222

More information

Transformations. Prof. George Wolberg Dept. of Computer Science City College of New York

Transformations. Prof. George Wolberg Dept. of Computer Science City College of New York Transforations Prof. George Wolberg Dept. of Coputer Science City College of New York Objectives Introduce standard transforations - Rotations - Translation - Scaling - Shear Derive hoogeneous coordinate

More information

Utility-based Camera Assignment in a Video Network: A Game Theoretic Framework

Utility-based Camera Assignment in a Video Network: A Game Theoretic Framework This artice has been accepted for pubication in a future issue of this journa, but has not been fuy edited. Content may change prior to fina pubication. Y.LI AND B.BHANU CAMERA ASSIGNMENT: A GAME-THEORETIC

More information

Coupled Oscillators. Description. Easy Java Simulations step-by-step series of examples

Coupled Oscillators. Description. Easy Java Simulations step-by-step series of examples Easy Java Siuations step-by-step series of eapes Coupe Osciators page of 8 Coupe Osciators Description We siuate the otion of two partice asses connecte by three springs. One spring connects the two asses

More information

Module Contact: Dr Rudy Lapeer (CMP) Copyright of the University of East Anglia Version 1

Module Contact: Dr Rudy Lapeer (CMP) Copyright of the University of East Anglia Version 1 UNIVERSITY OF EAST ANGLIA School of Coputing Sciences Main Series UG Exaination 2016-17 GRAPHICS 1 CMP-5010B Tie allowed: 2 hours Answer THREE questions. Notes are not peritted in this exaination Do not

More information

PERFORMANCE MEASURES FOR INTERNET SERVER BY USING M/M/m QUEUEING MODEL

PERFORMANCE MEASURES FOR INTERNET SERVER BY USING M/M/m QUEUEING MODEL IJRET: International Journal of Research in Engineering and Technology ISSN: 239-63 PERFORMANCE MEASURES FOR INTERNET SERVER BY USING M/M/ QUEUEING MODEL Raghunath Y. T. N. V, A. S. Sravani 2 Assistant

More information

Image Segmentation Using Semi-Supervised k-means

Image Segmentation Using Semi-Supervised k-means I J C T A, 9(34) 2016, pp. 595-601 Internationa Science Press Image Segmentation Using Semi-Supervised k-means Reza Monsefi * and Saeed Zahedi * ABSTRACT Extracting the region of interest is a very chaenging

More information

Preprocessing I: Within Subject John Ashburner

Preprocessing I: Within Subject John Ashburner Preprocessing I: Within Subject John Ashburner Pre-processing Overview Statistics or whatever fmri tie-series Anatoical MRI Teplate Soothed Estiate Spatial Nor Motion Correct Sooth Coregister 11 21 31

More information

Replication of Virtual Network Functions: Optimizing Link Utilization and Resource Costs

Replication of Virtual Network Functions: Optimizing Link Utilization and Resource Costs Repication of Virtua Network Functions: Optimizing Link Utiization and Resource Costs Francisco Carpio, Wogang Bziuk and Admea Jukan Technische Universität Braunschweig, Germany Emai:{f.carpio, w.bziuk,

More information

The Internal Conflict of a Belief Function

The Internal Conflict of a Belief Function The Internal Conflict of a Belief Function Johan Schubert Abstract In this paper we define and derive an internal conflict of a belief function We decopose the belief function in question into a set of

More information

Utility-Based Resource Allocation for Mixed Traffic in Wireless Networks

Utility-Based Resource Allocation for Mixed Traffic in Wireless Networks IEEE IFOCO 2 International Workshop on Future edia etworks and IP-based TV Utility-Based Resource Allocation for ixed Traffic in Wireless etworks Li Chen, Bin Wang, Xiaohang Chen, Xin Zhang, and Dacheng

More information

Distance Weighted Discrimination and Second Order Cone Programming

Distance Weighted Discrimination and Second Order Cone Programming Distance Weighted Discrimination and Second Order Cone Programming Hanwen Huang, Xiaosun Lu, Yufeng Liu, J. S. Marron, Perry Haaand Apri 3, 2012 1 Introduction This vignette demonstrates the utiity and

More information

LOSSLESS COMPRESSION OF BAYER MASK IMAGES USING AN OPTIMAL VECTOR PREDICTION TECHNIQUE

LOSSLESS COMPRESSION OF BAYER MASK IMAGES USING AN OPTIMAL VECTOR PREDICTION TECHNIQUE 1th European Signal Processing Conference (EUSIPCO 2006), Florence, Italy, Septeber -8, 2006, copyright by EUASIP LOSSLESS COMPESSION OF AYE MASK IMAES USIN AN OPTIMAL VECTO PEDICTION TECHNIQUE Stefano

More information

Sect 8.1 Lines and Angles

Sect 8.1 Lines and Angles 7 Sect 8. Lines and nges Objective a: asic efinitions. efinition Iustration Notation point is a ocation in space. It is indicated by aking a dot. Points are typicay abeed with capita etters next to the

More information

TRANSFORMATIONS AND SYMMETRY

TRANSFORMATIONS AND SYMMETRY 2 Transforations Defense Practice TRNSFORMTIONS ND SYMMETRY 1.2.1 1.2.5 Studing transforations of geoetric shapes buids a foundation for a ke idea in geoetr: congruence. In this introduction to transforations,

More information

CHAPTER 5 EXPERIMENTAL RESULTS. 5.1 Boresight Calibration

CHAPTER 5 EXPERIMENTAL RESULTS. 5.1 Boresight Calibration CHAPTER 5 EXPERIMENTAL RESULTS 5. Boresight Caibration To compare the accuracy of determined boresight misaignment parameters, both the manua tie point seections and the tie points detected with image

More information

3 Conference on Inforation Sciences and Systes, The Johns Hopkins University, March, 3 Sensitivity Characteristics of Cross-Correlation Distance Metric and Model Function F. Porikli Mitsubishi Electric

More information

Registration of Point Cloud Data from a Geometric Optimization Perspective

Registration of Point Cloud Data from a Geometric Optimization Perspective Eurographics Syposiu on Geoetry Processing (2004) R. Scopigno, D. Zorin, (Editors) Registration of Point Cloud Data fro a Geoetric Optiization Perspective Niloy J. Mitra, Natasha Gelfand, Helut Pottann,

More information

MCSE Training Guide: Windows Architecture and Memory

MCSE Training Guide: Windows Architecture and Memory MCSE Training Guide: Windows 95 -- Ch 2 -- Architecture and Memory Page 1 of 13 MCSE Training Guide: Windows 95-2 - Architecture and Memory This chapter wi hep you prepare for the exam by covering the

More information

Neural Network Enhancement of the Los Alamos Force Deployment Estimator

Neural Network Enhancement of the Los Alamos Force Deployment Estimator Missouri University of Science and Technoogy Schoars' Mine Eectrica and Computer Engineering Facuty Research & Creative Works Eectrica and Computer Engineering 1-1-1994 Neura Network Enhancement of the

More information

Response Surface Model Updating for Nonlinear Structures

Response Surface Model Updating for Nonlinear Structures Response Surface Mode Updating for Noninear Structures Gonaz Shahidi a, Shamim Pakzad b a PhD Student, Department of Civi and Environmenta Engineering, Lehigh University, ATLSS Engineering Research Center,

More information