Anisotropic filtering on normal field and curvature tensor field using optimal estimation theory

Size: px
Start display at page:

Download "Anisotropic filtering on normal field and curvature tensor field using optimal estimation theory"

Transcription

1 Aniotropic filtering on normal field and curvature tenor field uing optimal etimation theory Min Liu Yuhen Liu and Karthik Ramani Purdue Univerity, Wet Lafayette, Indiana, USA {liu66 liu28 Abtract In thi paper, we tudy the problem of meh denoiing for improving the ingle pa urface etimation on normal and curvature tenor. We focu mainly on the engineering object repreented a dene triangle mehe. In particular, a two run non-linear diffuion algorithm baed on optimal etimation theory i propoed to adaptively filter out the undeired dicontinuitie introduced by noie while preerving the underlying feature. We how that the propoed filter can uccefully improve the local urface etimate while preerving the deired feature in term of tangential and curvature dicontinuitie. 1. Introduction Smoothne refer to the mathematical notion of continuou differentiability, or continuity. When a mooth urface i approximated a a triangle meh, it maintain only the poitional continuity (no gap) of the underlying urface, while the tangential continuity (no harp angle) and the curvature continuity (no harp radiu change) are lot due to the dicrete nature of the meh. Thi bring about the problem of etimating the dicrete urface differential propertie for the mehed object. Dicrete etimation of urface differential parameter i eential for many meh baed application, but the problem i difficult if the underlying geometry contain natural urface dicontinuitie. The problem get even harder when a meh i contructed from canned data ince they carry meaurement and quantization error. The differential propertie uch a principal curvature and direction are very enitive [13] to thoe error. A ingle pa etimation, baed on either local urface fitting uing the polynomial [15, 4, 7, 20] or the etimation of a curvature tenor in the local neighborhood [17, 11, 1, 14] are error prone, due to the preence of the natural dicontinuitie a well a the noie in the data. In practice, thi mean that the etimate computed on a local bai mut be improved at a later tage. The technique related to iotropic denoiing aume that there are no underlying urface dicontinuitie, therefore the error in the etimate reult from only noie which i randomly and uniformly ditributed. Repreentative iotropic denoiing method include Laplacian moothing [18], mean curvature flow [3], and curvature conitency framework [15]. The firt two method [18, 3] achieve moother urface by changing the vertex poition to relax all the curvature peak, with improvement in the urface normal and curvature etimation a a byproduct; while the lat method [15] improve the curvature etimation by minimizing a functional form related to a minimum variation of curvature etimate. In real cae, a typical meh contain random noie a well a urface dicontinuitie. Aniotropic denoiing method, firt introduced in image proceing and later extended to geometric problem, were developed to preerve or enhance feature like harp edge or corner. Some method moothen height field by controlling the weight in mean curvature flow [2, 5, 8]. Other method [19, 16, 12] ue diffuion filter to moothen the normal field and then integrate thi to height field to get the moother urface. In thi work, we tudy the problem of meh denoiing for improving the ingle pa urface etimate. We target mainly the canned engineering object which are repreented a dene triangle mehe, though it can be applied for general hape too. Our propoed method, derived from a ignal filter, originate from the optimal etimation theory [6]. In tead of modifying the vertex poition, we improve the normal and curvature etimate by arguing that thoe differential propertie are more important than removing noie in the geometry becaue, the typical two tage in revere engineering: egmentation and urface fitting relie more on the good etimate of urface differential propertie. The focu of our work target three problem: An etimation of dicrete hape operator. We propoe a imple per-face dicrete curvature etimation method in term of curvature tenor. It benefit

2 the edge-baed meh proceing ince the harp variation of differential propertie between the two neighboring triangle potentially define a feature edge. An aniotropic filter on the normal and curvature field. We adapt the optimal etimation theory into a two run non-linear diffuion proce; one for normal conitency in which the filter i applied on a vector field (normal). And the other i for curvature conitency in which the filter i applied on a matrix field (curvature tenor). Each tage trie to preerve the underlying dicontinuitie (feature) while moothing the ingle pa normal and curvature etimate. A general framework for extending the diffuion proce into the differential parameter field with higher order. We apply the non-linear diffuion filter both on the normal field and on the curvature field to handle engineering object. We alo how that it can be generalized to handle higher order differential propertie. 2. The local geometry etimation for per-face For each triangle f in a meh, it normal direction n f i well defined. The normal direction at each vertex p in the meh i etimated by the weighted average of the normal of face adjacent to p (1-ring neighborhood face). We ue the Nelon Max weighting method [10] for weight (area of f divided by the quare of the length of the two edge that touch vertex p) a thi produce more accurate normal etimate than other weighting approache. We etimate the per-face curvature by oberving the normal variation along it three edge. For each triangle f, there i an aociated hape operator in matrix format called curvature tenor Λ: Λ f = ( D u n D v n ) ( ) nf = u u n f v u n f u v n f v v, where (u,v) i a pair of orthogonal unit vector decribing an orthonormal coordinate ytem in the tangent frame of f. Multiplying a curvature tenor by any vector in the tangent plane give the directional derivative of the normal in that direction: Λ t = D t n. The curvature tenor for each facet i contructed uing method introduced in [14]. For a facet f, there are three well-defined direction (the edge) together with the difference in normal along thoe direction (computed from the per-vertex normal), refer Figure 1. In thi figure, n i (i = 0,1,2) are the etimated normal on three vertice of the triangle f. The equation in Figure 1 provide a et of linear contraint on the element of the econd fundamental tenor, which may then be determined uing leat quare fitting. Notice that the principal curvature (k 1, k 2 ), and the principle direction (e 1, e 2 ) of the triangle f correpond to the eigenvalue and eigenvector of Λ f, while the determinant of the tenor Det(Λ f ) and the half trace of the tenor Tr(Λ f )/2 can be conidered a a local etimation of Gauian curvature K f and Mean curvature H f. n0 e2 v u e0 n2 e1 n1 Figure 1. Etimate per-face curvature tenor 3 Aniotropic filtering baed on the optimal etimation theory The local differential propertie etimated o far (refer Section 2) are error-prone due to the exitence of urface dicontinuitie which violate the moothne aumption for the underlying geometrie. The general objective of an aniotropic filtering i to mooth out the urface dicontinuitie introduced by the random noie and preerve the true urface continuitie. The optimal etimation theory, originally introduced in [6] for ignal proceing and adapted by [9] in a curvature conitency framework for the edge detection on a range image, offer a good method for integrating meaurement from multiple ource with different noie to predict a contant quantity. The main idea i that, given a noiy ource, it contribution to predict the behavior of a target in the next iteration i dependent on the variance of it prediction error in the pat. A ource with a lower variance of etimation error i conidered to have better fitne and will be given higher weight in the next prediction. Thi mechanim work elegantly for our purpoe of aniotropic filtering on the initially etimated urface parameter. We ue the propertie of neighboring facet to redefine the propertie of a target facet. At the beginning of optimal etimation flow, the full variational relaxation take place. Thi relaxation moothe out random noie and tart to ditort the true urface dicontinuitie meanwhile. However, a the iteration progree, the real nature of the local urface i learned by recording the etimation error variance in each tep. In ubequent iteration, neighbor believed to be in the ame

3 continuou region (i.e. the neighbor with low etimation error variance) will dominate the relaxation proce. The relaxation acro dicontinuou region will be penalized ince they introduce large variance of etimation error. Now we reformulate the above idea to our per-face geometry etimator. For each triangle f, conider it 1-ring neighborhood N( f ) (which are triangle haring common edge or vertice with f ) a a noiy prediction ource. During the optimal etimation flow, differential propertie of f, at a new iteration l +1 ( f l+1 ) i etimated by the weighted average of prediction from it neighbor. Each of it neighboring facet, cat a vote on f. f l+1 i given by the following equation; f l+1 = N( f ) w l N( f ) w l, (1) where w l i the weight aigned to a neighbor for meauring how much the prediction of will contribute to the behavior of the target. can be equal to but it i not neceary. If equal weight are aigned to each of f neighbor, the above iterative proce (Equation (1)) provide an iotropic filtering which i not deired for preerving underlying feature in our cae. For aigning weight to adjut the contribution of prediction from each neighbor, we ue the following function that are baed on the optimal etimation theory [9]; w l = exp( σ γ l ), (2) σ 1 = k γ l = 2 N( f ) l l=0 N( f ) ε, (3) σ, (4) where σ i the variance of prediction error in lth iteration and γ l i the moothing control parameter which i et by taking the mean of the error variance value among all the triangle in N( f ). ε meaure the prediction error, i.e. difference between and f. In equation (2), the weight i defined a a function of prediction error variance (σ ), which i normalized by the mean variance (γ l ) among all neighbor who participate in current prediction. The exponential function i choen to avoid a ingle neighbor from taking over the relaxation proce by bonding the weight a the error variance approach zero. A deired by the optimal etimation theory, thi weighting function give higher weight to the neighbor with low error variance. In addition, it provide imilar weight to the neighbor which are correlated with the target facet in the ame ubregion. A key problem i, how to etimate the error o that the weight can be correctly adjuted. In the curvature conitency framework [15, 9], thi iterative proce i conducted in a ingle pa on the Augmented Darboux frame [15] (contain the normal and the curvature element) of a vertex p, the diffuion i applied on both the normal and the curvature parameter and the error metric ε imply combine the etimation error of all element: ε = n l f n l l + e 1 f e 1 + k 1 f k l 1 + k 2 f k l 2 2. (5) Thi error metric caue a major problem ince it imultaneouly fue on two calar propertie (k 1 and k 2 ), and two vector propertie (n, e 1 ). Cae exit where the calar element dominate the error function o that the vector element never contribute in thi optimal etimation framework. We apply the diffuion proce to different run correponding to different order of differential parameter etimation o that in each run, the error variance can be meaured in the ame field. We firt apply the optimal etimation proce on urface normal. Equation (1) in thi run become; n l+1 f = N( f ) w l n l N( f ) w l. (6) and the error metric i given by the angular ditance between etimated normal of f and the normal of neighboring facet : ε l = 1 n f l n l n l f n l. (7) In the econd run, the curvature tenor Λ etimated on f, i conidered for the optimal etimation. Since the tenor Λ f i defined on a local parameter pace aociated with three orthogonal direction (n f,u f,v f ), the tenor Λ of it neighboring facet, which i defined on (n,u,v ), cannot directly cat the vote on f. Therefore, a neighboring tenor ha to be aligned in the pace of the target facet (refer to Figure 2). For each Λ, thi alignment form a rotated tenor Λ, which will be ued for prediction. f = N( f ) w l Λ l N( f ) w l. (8) Λ l+1 Two error metric can be ued for calculating variance and weight. One i the variation between principal curvature of f and thoe of it neighbor and the other i the determinant of difference matrix between the etimated tenor Λ f and Λ. Variation between principal curvature contain two element; ε l 1 = (k1 l f kl 1 )2 + (k f kl 2 )2 and ε l 2 = inθe. l (9) The firt element in Equation (9) i the Euclidean ditance between (k 1 f, k 2 f ) and (k 1,k 2 ), and the other i the

4 n f II f n ' n II v f u f II ' v ' v u u ' Figure 2. Rotate local pace of tenor Λ to the pace of neighbor triangle tenor Λ f,. Thi form a rotated tenor Λ. 4 Reult We have implemented the aniotropic meh denoiing algorithm a decribed in the previou ection, and compared our reult to that of two popular aniotropic denoiing method, bilateral meh denoiing algorithm [5] and adaptive moothing algorithm [12]. We alo compared our reult of curvature denoiing to the method baed on curvature conitency framework; iotropic denoiing method propoed in [15], and the aniotropic cheme propoed in [9]. Thee two method denoie the meh on both the normal and the curvature field in a ingle pa. We ue the following color map (ee Figure 3) to how the two etimated principal curvature through all the reult. angular ditance between one of the principal direction e 1 f and e 1. θe l i the angle between e 1 f and e 1 in the lth iteration. We ue inθe l to treat the acute angle the ame a the obtue angle becaue the principal direction i actually a line field rather than a vector field. The above two error metric are not on the ame cale and therefore hould not be ummed up directly into one error function. The variance of each element will be calculated eparately to get two correponding σ 1, γl 1 and σ 2, γl 2 which correpond to the variance of principal curvature variation and the variance of principle direction variation. The final weight function (Equation (2)) i: w l = exp( σ 1 γ1 l σ 2 γ l 2 ). (10) Another option for the error metric for curvature tenor diffuion i a impler uniformed metric which i defined by the determinant of the tenor difference, ε l = Λ f l Λ l (11) Generally peaking, the firt error metric (Equation (10)) capture the ditance of principal curvature and principal direction among neighboring triangle. The econd one (Equation (11)) can be conidered a a meaurement of total variation of curvature along all the direction in the parameter pace of triangle f. Both the error metric have their own diadvantage. The firt metric will have problem in the vicinity of umbilical point, ince the etimation of the principal curvature direction get untable on umbilical point. The econd error metric vanihe for ingular difference matrice. Conequently, different curvature tenor may have a zero ditance. We leave the improvement of the error metric for curvature tenor a a future work. k 1 >0 k 1 <0 k 1 =0 k 2 >0 k 2 =0 k 2 <0 Figure 3. The color map of the curvature value. Figure 4 how the reult of applying our aniotropic filter for denoiing the Fandik model (with triangle, vertice, edge). Thi model contain noie near the feature region a well a global gauian noie (Figure 4(a)). After applying five iteration of our denoiing filter for normal, the etimated normal are moothed while the underlying harp variation on the normal are kept (ee Figure 4(b) for the rendering effect of thi moothing). Figure 4(c) and 4(d) how the normal ditribution (normal are rendered a red line) of a mall region (rectangle region in Figure 4(a)) before and after applying our normal filter. The harp edge (colored a light blue) behave more regularly and directionally a the reult of aniotropic denoiing on normal field. Figure 4(e) and 4(f) how the curvature ditribution of the model before and after applying our filter on the curvature tenor field, the mall line troke denote the minimum curvature direction. Figure 6 give the reult of two other aniotropic denoiing algorithm, Figure 6(a) and 6(b) are the reult of applying five iteration of bilateral meh denoiing propoed in [5], Figure 6(c) and 6(d) are the reult of applying ame number of iteration uing the adaptive meh denoiing propoed in [12]. For thi model, the bilateral denoiing doe not produce very good denoiing reult. Denoiing effect on the curvature

5 etimate, a the byproduct of denoiing the height field are hown in Figure 6(b) and 6(d). Notice the difference in the curvature ditribution compared to the reult of our method in Figure 4(f). Figure 5 how how our algorithm work on a noiy rocker arm model (Figure 5(a)). After applying our filter on the normal field, the moothing reult on the urface normal i hown in Figure 5(b). Figure 5(c) i the initial etimation of curvature, denoiing on the normal field will improve the curvature etimation too, ee the reult in Figure 5(d). Figure 5(e) and 5(f) how the reult of applying five iteration of our filter on the curvature tenor field, uing two error metric propoed in Section 3, (Equation (11) and (9) repectively). They both work well and reult in imilar denoiing effect (refer to Figure 5(e) and 5(f)). Since Equation (11) give a impler computation for error metric, we recommend the reader to ue it. We compared our reult uing aniotropic denoiing on curvature tenor field to the following method that improve the curvature etimate; one i the aniotropic cheme propoed in [9] (Figure 7(a)) and the other i the iotropic cheme propoed in [15] (Figure 7(b)). Our method achieve better reult of moothing curvature etimation while preerving the underlying dicontinuitie (refer to Figure 5(f)). Oberve the difference in the curvature ditribution along the flat region on the rocker arm model. We alo teted our method on ome general hape (ee Figure 8 for example). The tet how that our aniotropic filter work well for the general hape too. 5 A general aniotropic filtering framework In theory, the framework of our aniotropic diffuion algorithm can be generalized for treating higher order feature. The firt tep i to extend the per-face local geometry etimation to higher order differential propertie. We how here how to extend it to third order differential propertie. The third order differential propertie can be defined a a derivative of curvature tenor that give the change in curvature along the urface. It i a rank-3 tenor with four unique entrie: C = (D u Λ,D v Λ) = ( ( a b b c )( b c c d ) ). To compute the above tenor, we need to etimate the curvature tenor Λ p at each vertex p on the meh. Thi can be done by the weighted average of the curvature tenor of it triangle neighbor: Λ p = m i=1 w iλ i m i=1 w in i, where the Λ i are the rotated tenor (ee Figure 2) of the triangle in the 1-ring neighborhood of p, The tenor i rotated to align with the parameter pace of vertex p. Weight w i denote how much of the curvature tenor hould be accumulated at each vertex p. The Voronoi area weighting cheme that take the weight be proportion of the area of f that lie cloe to vertex p [11] i a good choice. The derivative of curvature tenor of a triangle can then be etimated with a leat-quare fit to the difference in the curvature tenor along three edge of each triangle, in the ame manner a we did for curvature tenor etimation. For the aniotropic diffuion filter for the third order tenor, the iteration equation can be defined a, C f l+1 = N( f ) w l C l N( f ) w l, (12) where C l denote the rotated derivative of curvature tenor, and the error metric can then be defined a: ε l = C f l C l. (13) 6 Concluion and future direction We have preented a feature-preerving filter for the normal and the curvature etimated on the dene meh model. For ome revere engineering application, the propoed filter i generally a ufficient preproceing tep for further geometric operation uch a egmentation and urface fitting. We alo howed that thi aniotropic filter can be extended to improve higher order differential parameter. In future, teting the method for denoiing on higher order field will be carried out. Our aniotropic filter of normal and curvature can be ued for table extraction of feature edge correponding to C 1 dicontinuitie and C 2 dicontinuitie that can help in egmenting dene mehe. The current implementation of the iterative diffuion proce imply pecifie the number of iteration a a uer defined parameter. In future, the iteration will be controlled by tracking the convergence of the differential propertie. Reference [1] D. Cohen-Steiner and J.-M. Morvan. Retricted delaunay triangulation and normal cycle. In SCG 03: Proceeding of the nineteenth annual ympoium on Computational geometry, page , New York, NY, USA, ACM Pre. [2] M. Debrun, M. Meyer, P. Schröder, and A. H. Barr. Aniotropic Feature-Preerving denoiing of height field and image. In Graphic Interface, page [3] M. Debrun, M. Meyer, P. Schröder, and A. H. Barr. Implicit fairing of irregular mehe uing diffuion and curvature flow. In SIGGRAPH 99: Proceeding of the 26th annual conference on Computer graphic and interactive technique, page , New York, NY, USA, ACM Pre/Addion-Weley Publihing Co.

6 [4] F. P. Ferrie, J. Lagarde, and P. Whaite. Darboux frame, nake, and uper-quadric: Geometry from the bottom up. IEEE Tran. Pattern Anal. Mach. Intell., 15(8): , [5] S. Fleihman, I. Drori, and D. Cohen-Or. Bilateral meh denoiing. ACM Tran. Graph., 22(3): , [6] A. Gelb. Applied Optimal Etimation. MIT Pre, Cambridge, Ma., [7] B. Hamann. Curvature approximation for triangulated urface. page , [8] K. Hildebrant and K. Polthier. Aniotropic filtering of non-linear urface feature. Computer Graphic Forum, 23(3): , [9] S. Mathur and F. P. Ferrie. Edge localization in urface recontruction uing optimal etimation theory. In CVPR 97: Proceeding of the 1997 Conference on Computer Viion and Pattern Recognition (CVPR 97), page 833, Wahington, DC, USA, IEEE Computer Society. [10] N. Max. Weight for computing vertex normal from facet normal. J. Graph. Tool, 4(2):1 6, [11] M. Meyer, M. Debrun, P. Schr, and A. Barr. Dicrete differentialgeometry operator for triangulated 2-manifold. In Viualization and Mathematic III, edited by H.C. Hege and K. Polthier, page 35 37, Heidelberg, Springer. [12] Y. Ohtake, A. G. Belyaev, and I. A. Bogaevki. Meh regularization and adaptive moothing. Computer-Aided Deign, 33(4): , [13] S. Petitjean. A urvey of method for recovering quadric in triangle mehe. ACM Comput. Surv., 34(2): , [14] S. Ruinkiewicz. Etimating curvature and their derivative on triangle mehe. In 3DPVT 04: Proceeding of the 3D Data Proceing, Viualization, and Tranmiion, 2nd International Sympoium on (3DPVT 04), page , Wahington, DC, USA, IEEE Computer Society. [15] P. T. Sander and S. W. Zucker. Inferring urface trace and differential tructure from 3-d image. IEEE Tran. Pattern Anal. Mach. Intell., 12(9): , [16] T. Tadizen, R. Whitaker, P. Burchard, and S. Oher. Geometric urface moothing via aniotropic diffuion of normal. In VIS 02: Proceeding of the conference on Viualization 02, page , Wahington, DC, USA, IEEE Computer Society. [17] G. Taubin. Etimating the tenor of curvature of a urface from a polyhedral approximation. In ICCV 95: Proceeding of the Fifth International Conference on Computer Viion, page 902, Wahington, DC, USA, IEEE Computer Society. [18] G. Taubin. A ignal proceing approach to fair urface deign. In SIGGRAPH 95: Proceeding of the 22nd annual conference on Computer graphic and interactive technique, page , New York, NY, USA, ACM Pre. [19] G. Taubin. Linear aniotropic meh filtering. IBM Reearch Report RC2213, [20] S. Yohizawa, A. Belyaev, and H.-P. Seidel. Fat and robut detection of cret line on mehe. In SPM 05: Proceeding of the 2005 ACM ympoium on Solid and phyical modeling, page , New York, NY, USA, ACM Pre.

7 (a) Input noiy model (23964 triangle, vertice, edge) (b) Five iteration of our filter applied on the normal field (c) Initially etimated of urface normal (d) Normal etimate after aniotropic filtering on normal field (e) Initial etimation of curvature value and direction, the mall line troke how the minimum curvature direction (f) Curvature etimate after applying 5 iteration of our aniotropic filter on curvature tenor field Figure 4. Our aniotropic filter applied on the normal field and the curvature tenor field for the fan dik model.

8 (a) The original model(80354 triangle, vertice and edge) (b) Five iteration of our filter applied on the normal field (c) Initial etimated curvature value and minimum curvature direction (d) The curvature ditribution after applying five iteration of normal diffuion (e) The curvature ditribution after applying five iteration of curvature tenor diffuion uing error metric in equation 11 (f) The curvature ditribution after applying five iteration of curvature tenor diffuion uing error metric in equation 9 Figure 5. Five iteration of our filter applied on the normal field and then the curvature tenor field of a noiy rocker arm model (model courtey of Leif Kobbelt)

9 (a) Denoiing reult uing the bilateral filter [5] (5 iteration, σ f = 4, σ g = 4 ) (b) Curvature ditribution after applying the bilateral filter (c) Denoiing reult uing the adaptive moothing [12] (5 iteration or normal diffuion + 5 iteration on the hight field, c = 2) (d) Curvature ditribution after applying the adaptive moothing filter Figure 6. Comparion to the reult two other method for the hight field denoiing applied on the Fandik model. (a) Aniotropic denoiing on the Augmented Darboux frame uing the error metric in Equation 5 [9] (b) Iotropic denoiing on the Augmented Darboux frame under the curvature conitency framework [15] Figure 7. Comparion to the reult of two other method for the curvature field denoiing applied on the rocker arm model.

10 (a) The input noiy model (b) The reult of two iteration of our filter applied on normal field (c) The curvature value etimated uing initial perface curvature etimation (d) The byproduct of curvature value ditribution after applying 2 iteration of our filter on the facet normal (e) The curvature value ditribution after applying 2 iteration of our filter on curvature tenor field Figure 8. Illutration of our aniotropic filter applied on a general hape (data courtey of Alexander Belyaev).

Performance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks

Performance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity

More information

Planning of scooping position and approach path for loading operation by wheel loader

Planning of scooping position and approach path for loading operation by wheel loader 22 nd International Sympoium on Automation and Robotic in Contruction ISARC 25 - September 11-14, 25, Ferrara (Italy) 1 Planning of cooping poition and approach path for loading operation by wheel loader

More information

/06/$ IEEE 364

/06/$ IEEE 364 006 IEEE International ympoium on ignal Proceing and Information Technology oie Variance Etimation In ignal Proceing David Makovoz IPAC, California Intitute of Technology, MC-0, Paadena, CA, 95 davidm@ipac.caltech.edu;

More information

Markov Random Fields in Image Segmentation

Markov Random Fields in Image Segmentation Preented at SSIP 2011, Szeged, Hungary Markov Random Field in Image Segmentation Zoltan Kato Image Proceing & Computer Graphic Dept. Univerity of Szeged Hungary Zoltan Kato: Markov Random Field in Image

More information

Motivation: Level Sets. Input Data Noisy. Easy Case Use Marching Cubes. Intensity Varies. Non-uniform Exposure. Roger Crawfis

Motivation: Level Sets. Input Data Noisy. Easy Case Use Marching Cubes. Intensity Varies. Non-uniform Exposure. Roger Crawfis Level Set Motivation: Roger Crawfi Slide collected from: Fan Ding, Charle Dyer, Donald Tanguay and Roger Crawfi 4/24/2003 R. Crawfi, Ohio State Univ. 109 Eay Cae Ue Marching Cube Input Data Noiy 4/24/2003

More information

CENTER-POINT MODEL OF DEFORMABLE SURFACE

CENTER-POINT MODEL OF DEFORMABLE SURFACE CENTER-POINT MODEL OF DEFORMABLE SURFACE Piotr M. Szczypinki Iintitute of Electronic, Technical Univerity of Lodz, Poland Abtract: Key word: Center-point model of deformable urface for egmentation of 3D

More information

Laboratory Exercise 6

Laboratory Exercise 6 Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two

More information

Universität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.

Universität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart. Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut

More information

CSE 250B Assignment 4 Report

CSE 250B Assignment 4 Report CSE 250B Aignment 4 Report March 24, 2012 Yuncong Chen yuncong@c.ucd.edu Pengfei Chen pec008@ucd.edu Yang Liu yal060@c.ucd.edu Abtract In thi project, we implemented the recurive autoencoder (RAE) a decribed

More information

Multi-Target Tracking In Clutter

Multi-Target Tracking In Clutter Multi-Target Tracking In Clutter John N. Sander-Reed, Mary Jo Duncan, W.B. Boucher, W. Michael Dimmler, Shawn O Keefe ABSTRACT A high frame rate (0 Hz), multi-target, video tracker ha been developed and

More information

Compressed Sensing Image Processing Based on Stagewise Orthogonal Matching Pursuit

Compressed Sensing Image Processing Based on Stagewise Orthogonal Matching Pursuit Senor & randucer, Vol. 8, Iue 0, October 204, pp. 34-40 Senor & randucer 204 by IFSA Publihing, S. L. http://www.enorportal.com Compreed Sening Image Proceing Baed on Stagewie Orthogonal Matching Puruit

More information

3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES

3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES MAKARA, TEKNOLOGI, VOL. 9, NO., APRIL 5: 3-35 3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES Mochammad Zulianyah Informatic Engineering, Faculty of Engineering, ARS International Univerity,

More information

Minimum congestion spanning trees in bipartite and random graphs

Minimum congestion spanning trees in bipartite and random graphs Minimum congetion panning tree in bipartite and random graph M.I. Otrovkii Department of Mathematic and Computer Science St. John Univerity 8000 Utopia Parkway Queen, NY 11439, USA e-mail: otrovm@tjohn.edu

More information

Hassan Ghaziri AUB, OSB Beirut, Lebanon Key words Competitive self-organizing maps, Meta-heuristics, Vehicle routing problem,

Hassan Ghaziri AUB, OSB Beirut, Lebanon Key words Competitive self-organizing maps, Meta-heuristics, Vehicle routing problem, COMPETITIVE PROBABIISTIC SEF-ORGANIZING MAPS FOR ROUTING PROBEMS Haan Ghaziri AUB, OSB Beirut, ebanon ghaziri@aub.edu.lb Abtract In thi paper, we have applied the concept of the elf-organizing map (SOM)

More information

Motion Control (wheeled robots)

Motion Control (wheeled robots) 3 Motion Control (wheeled robot) Requirement for Motion Control Kinematic / dynamic model of the robot Model of the interaction between the wheel and the ground Definition of required motion -> peed control,

More information

Trainable Context Model for Multiscale Segmentation

Trainable Context Model for Multiscale Segmentation Trainable Context Model for Multicale Segmentation Hui Cheng and Charle A. Bouman School of Electrical and Computer Engineering Purdue Univerity Wet Lafayette, IN 47907-1285 {hui, bouman}@ ecn.purdue.edu

More information

x y z Design variable positions A

x y z Design variable positions A COMMUNICATIONS IN NUMERICAL METHODS IN ENGINEERING Commun. Numer. Meth. Engng 2001 00:1{7 [Verion: 2000/03/22 v1.0] A tabilied peudo-hell approach for urface parametriation in CFD deign problem O. Soto,R.Lohner

More information

Laboratory Exercise 6

Laboratory Exercise 6 Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in Verilog and implemented

More information

3D SMAP Algorithm. April 11, 2012

3D SMAP Algorithm. April 11, 2012 3D SMAP Algorithm April 11, 2012 Baed on the original SMAP paper [1]. Thi report extend the tructure of MSRF into 3D. The prior ditribution i modified to atify the MRF property. In addition, an iterative

More information

Modeling of underwater vehicle s dynamics

Modeling of underwater vehicle s dynamics Proceeding of the 11th WEA International Conference on YTEM, Agio Nikolao, Crete Iland, Greece, July 23-25, 2007 44 Modeling of underwater vehicle dynamic ANDRZEJ ZAK Department of Radiolocation and Hydrolocation

More information

A METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS

A METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS Vietnam Journal of Science and Technology 55 (5) (017) 650-657 DOI: 10.1565/55-518/55/5/906 A METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS Nguyen Huu Quang *, Banh

More information

Laboratory Exercise 6

Laboratory Exercise 6 Laboratory Exercie 6 Adder, Subtractor, and Multiplier a a The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each b c circuit will be decribed in Verilog

More information

Representations and Transformations. Objectives

Representations and Transformations. Objectives Repreentation and Tranformation Objective Derive homogeneou coordinate tranformation matrice Introduce tandard tranformation - Rotation - Tranlation - Scaling - Shear Scalar, Point, Vector Three baic element

More information

DAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications

DAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications DAROS: Ditributed Uer-Server Aignment And Replication For Online Social Networking Application Thuan Duong-Ba School of EECS Oregon State Univerity Corvalli, OR 97330, USA Email: duongba@eec.oregontate.edu

More information

Image Morphing Using Deformation Techniques

Image Morphing Using Deformation Techniques Image Morphing Uing Deformation Technique Seung-Yong Lee, Kyung-Yong Chwa, Jame Hahn, and Sung Yong Shin Department of Computer Science Korea Advanced Intitute of Science and Technology 373-1 Kuong-dong

More information

else end while End References

else end while End References 621-630. [RM89] [SK76] Roenfeld, A. and Melter, R. A., Digital geometry, The Mathematical Intelligencer, vol. 11, No. 3, 1989, pp. 69-72. Sklanky, J. and Kibler, D. F., A theory of nonuniformly digitized

More information

Texture-Constrained Active Shape Models

Texture-Constrained Active Shape Models 107 Texture-Contrained Active Shape Model Shuicheng Yan, Ce Liu Stan Z. Li Hongjiang Zhang Heung-Yeung Shum Qianheng Cheng Microoft Reearch Aia, Beijing Sigma Center, Beijing 100080, China Dept. of Info.

More information

Increasing Throughput and Reducing Delay in Wireless Sensor Networks Using Interference Alignment

Increasing Throughput and Reducing Delay in Wireless Sensor Networks Using Interference Alignment Int. J. Communication, Network and Sytem Science, 0, 5, 90-97 http://dx.doi.org/0.436/ijcn.0.50 Publihed Online February 0 (http://www.scirp.org/journal/ijcn) Increaing Throughput and Reducing Delay in

More information

Chapter 13 Non Sampling Errors

Chapter 13 Non Sampling Errors Chapter 13 Non Sampling Error It i a general aumption in the ampling theory that the true value of each unit in the population can be obtained and tabulated without any error. In practice, thi aumption

More information

Delaunay Triangulation: Incremental Construction

Delaunay Triangulation: Incremental Construction Chapter 6 Delaunay Triangulation: Incremental Contruction In the lat lecture, we have learned about the Lawon ip algorithm that compute a Delaunay triangulation of a given n-point et P R 2 with O(n 2 )

More information

Symmetric Stereo Matching for Occlusion Handling

Symmetric Stereo Matching for Occlusion Handling Symmetric Stereo Matching for Occluion Handling Jian Sun 1 Yin Li 1 Sing Bing Kang 2 Heung-Yeung Shum 1 1 Microoft Reearch Aia 2 Microoft Reearch Beijing, P.R. China Redmond, WA, USA Abtract In thi paper,

More information

Quadrilaterals. Learning Objectives. Pre-Activity

Quadrilaterals. Learning Objectives. Pre-Activity Section 3.4 Pre-Activity Preparation Quadrilateral Intereting geometric hape and pattern are all around u when we tart looking for them. Examine a row of fencing or the tiling deign at the wimming pool.

More information

xy-monotone path existence queries in a rectilinear environment

xy-monotone path existence queries in a rectilinear environment CCCG 2012, Charlottetown, P.E.I., Augut 8 10, 2012 xy-monotone path exitence querie in a rectilinear environment Gregory Bint Anil Mahehwari Michiel Smid Abtract Given a planar environment coniting of

More information

Laboratory Exercise 6

Laboratory Exercise 6 Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in VHL and implemented

More information

MAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc

MAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic

More information

Image authentication and tamper detection using fragile watermarking in spatial domain

Image authentication and tamper detection using fragile watermarking in spatial domain International Journal of Advanced Reearch in Computer Engineering & Technology (IJARCET) Volume 6, Iue 7, July 2017, ISSN: 2278 1323 Image authentication and tamper detection uing fragile watermarking

More information

Laboratory Exercise 2

Laboratory Exercise 2 Laoratory Exercie Numer and Diplay Thi i an exercie in deigning cominational circuit that can perform inary-to-decimal numer converion and inary-coded-decimal (BCD) addition. Part I We wih to diplay on

More information

Shortest Paths with Single-Point Visibility Constraint

Shortest Paths with Single-Point Visibility Constraint Shortet Path with Single-Point Viibility Contraint Ramtin Khoravi Mohammad Ghodi Department of Computer Engineering Sharif Univerity of Technology Abtract Thi paper tudie the problem of finding a hortet

More information

Building a Compact On-line MRF Recognizer for Large Character Set using Structured Dictionary Representation and Vector Quantization Technique

Building a Compact On-line MRF Recognizer for Large Character Set using Structured Dictionary Representation and Vector Quantization Technique 202 International Conference on Frontier in Handwriting Recognition Building a Compact On-line MRF Recognizer for Large Character Set uing Structured Dictionary Repreentation and Vector Quantization Technique

More information

Focused Video Estimation from Defocused Video Sequences

Focused Video Estimation from Defocused Video Sequences Focued Video Etimation from Defocued Video Sequence Junlan Yang a, Dan Schonfeld a and Magdi Mohamed b a Multimedia Communication Lab, ECE Dept., Univerity of Illinoi, Chicago, IL b Phyical Realization

More information

Edits in Xylia Validity Preserving Editing of XML Documents

Edits in Xylia Validity Preserving Editing of XML Documents dit in Xylia Validity Preerving diting of XML Document Pouria Shaker, Theodore S. Norvell, and Denni K. Peter Faculty of ngineering and Applied Science, Memorial Univerity of Newfoundland, St. John, NFLD,

More information

Cutting Stock by Iterated Matching. Andreas Fritsch, Oliver Vornberger. University of Osnabruck. D Osnabruck.

Cutting Stock by Iterated Matching. Andreas Fritsch, Oliver Vornberger. University of Osnabruck. D Osnabruck. Cutting Stock by Iterated Matching Andrea Fritch, Oliver Vornberger Univerity of Onabruck Dept of Math/Computer Science D-4909 Onabruck andy@informatikuni-onabrueckde Abtract The combinatorial optimization

More information

Implementation of a momentum-based distance metric for motion graphs. Student: Alessandro Di Domenico (st.no ), Supervisor: Nicolas Pronost

Implementation of a momentum-based distance metric for motion graphs. Student: Alessandro Di Domenico (st.no ), Supervisor: Nicolas Pronost Implementation of a momentum-baed ditance metric for motion graph Student: Aleandro Di Domenico (t.no 3775682), Supervior: Nicola Pronot April 3, 2014 Abtract Thi report preent the procedure and reult

More information

Comparison of Methods for Horizon Line Detection in Sea Images

Comparison of Methods for Horizon Line Detection in Sea Images Comparion of Method for Horizon Line Detection in Sea Image Tzvika Libe Evgeny Gerhikov and Samuel Koolapov Department of Electrical Engineering Braude Academic College of Engineering Karmiel 2982 Irael

More information

IMPLEMENTATION OF AREA, VOLUME AND LINE SOURCES

IMPLEMENTATION OF AREA, VOLUME AND LINE SOURCES December 01 ADMS 5 P503I1 IMPEMENTATION OF AREA, VOUME AND INE SOURCES The Met. Office (D J Thomon) and CERC 1. INTRODUCTION ADMS model line ource, and area and volume ource with conve polgon bae area.

More information

On successive packing approach to multidimensional (M-D) interleaving

On successive packing approach to multidimensional (M-D) interleaving On ucceive packing approach to multidimenional (M-D) interleaving Xi Min Zhang Yun Q. hi ankar Bau Abtract We propoe an interleaving cheme for multidimenional (M-D) interleaving. To achieved by uing a

More information

( ) subject to m. e (2) L are 2L+1. = s SEG SEG Las Vegas 2012 Annual Meeting Page 1

( ) subject to m. e (2) L are 2L+1. = s SEG SEG Las Vegas 2012 Annual Meeting Page 1 A new imultaneou ource eparation algorithm uing frequency-divere filtering Ying Ji*, Ed Kragh, and Phil Chritie, Schlumberger Cambridge Reearch Summary We decribe a new imultaneou ource eparation algorithm

More information

[N309] Feedforward Active Noise Control Systems with Online Secondary Path Modeling. Muhammad Tahir Akhtar, Masahide Abe, and Masayuki Kawamata

[N309] Feedforward Active Noise Control Systems with Online Secondary Path Modeling. Muhammad Tahir Akhtar, Masahide Abe, and Masayuki Kawamata he 32nd International Congre and Expoition on Noie Control Engineering Jeju International Convention Center, Seogwipo, Korea, Augut 25-28, 2003 [N309] Feedforward Active Noie Control Sytem with Online

More information

Mid-term review ECE 161C Electrical and Computer Engineering University of California San Diego

Mid-term review ECE 161C Electrical and Computer Engineering University of California San Diego Mid-term review ECE 161C Electrical and Computer Engineering Univerity of California San Diego Nuno Vaconcelo Spring 2014 1. We have een in cla that one popular technique for edge detection i the Canny

More information

UC Berkeley International Conference on GIScience Short Paper Proceedings

UC Berkeley International Conference on GIScience Short Paper Proceedings UC Berkeley International Conference on GIScience Short Paper Proceeding Title A novel method for probabilitic coverage etimation of enor network baed on 3D vector repreentation in complex urban environment

More information

New DSP to measure acoustic efficiency of road barriers. Part 2: Sound Insulation Index

New DSP to measure acoustic efficiency of road barriers. Part 2: Sound Insulation Index New DSP to meaure acoutic efficiency of road barrier. Part 2: Sound Inulation Index LAMBERTO TRONCHIN 1, KRISTIAN FABBRI 1, JELENA VASILJEVIC 2 1 DIENCA CIARM, Univerity of Bologna, Italy 2 Univerity of

More information

Tracking High Speed Skater by Using Multiple Model

Tracking High Speed Skater by Using Multiple Model Vol. 2, No. 26 Tracing High Speed Sater by Uing Multiple Model Guojun Liu & Xianglong Tang School of Computer Science & Engineering Harbin Intitute of Technology Harbin 5000, China E-mail: hitliu@hit.edu.cn

More information

A note on degenerate and spectrally degenerate graphs

A note on degenerate and spectrally degenerate graphs A note on degenerate and pectrally degenerate graph Noga Alon Abtract A graph G i called pectrally d-degenerate if the larget eigenvalue of each ubgraph of it with maximum degree D i at mot dd. We prove

More information

A Practical Model for Minimizing Waiting Time in a Transit Network

A Practical Model for Minimizing Waiting Time in a Transit Network A Practical Model for Minimizing Waiting Time in a Tranit Network Leila Dianat, MASc, Department of Civil Engineering, Sharif Univerity of Technology, Tehran, Iran Youef Shafahi, Ph.D. Aociate Profeor,

More information

Surface Reconstruction with Higher-Order Smoothness

Surface Reconstruction with Higher-Order Smoothness Surface Recontruction with Higher-Order Smoothne Rongjiang Pan, Vaclav Skala 2 School of Computer Science and Technology, Shandong Univerity, Jinan, China, 25000, panrj@du.edu.cn 2 Centre of Computer Graphic

More information

A reduced reference image quality metric based on feature fusion and neural networks

A reduced reference image quality metric based on feature fusion and neural networks Univerity of Wollongong Reearch Online Faculty of Engineering and Information Science - Paper: Part A Faculty of Engineering and Information Science 2011 A reduced reference image quality metric baed on

More information

EVen though remarkable progress has been made in

EVen though remarkable progress has been made in JOURNAL OF L A T E X CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 1 Dene Semantic 3D Recontruction Chritian Häne, Chritopher Zach, Andrea Cohen, and Marc Pollefey, Fellow, IEEE Abtract Both image egmentation

More information

A User-Attention Based Focus Detection Framework and Its Applications

A User-Attention Based Focus Detection Framework and Its Applications A Uer-Attention Baed Focu Detection Framework and It Application Chia-Chiang Ho, Wen-Huang Cheng, Ting-Jian Pan, Ja-Ling Wu Communication and Multimedia Laboratory, Department of Computer Science and Information

More information

KS3 Maths Assessment Objectives

KS3 Maths Assessment Objectives KS3 Math Aement Objective Tranition Stage 9 Ratio & Proportion Probabilit y & Statitic Appreciate the infinite nature of the et of integer, real and rational number Can interpret fraction and percentage

More information

Maneuverable Relays to Improve Energy Efficiency in Sensor Networks

Maneuverable Relays to Improve Energy Efficiency in Sensor Networks Maneuverable Relay to Improve Energy Efficiency in Senor Network Stephan Eidenbenz, Luka Kroc, Jame P. Smith CCS-5, MS M997; Lo Alamo National Laboratory; Lo Alamo, NM 87545. Email: {eidenben, kroc, jpmith}@lanl.gov

More information

Development of an atmospheric climate model with self-adapting grid and physics

Development of an atmospheric climate model with self-adapting grid and physics Intitute of Phyic Publihing Journal of Phyic: Conference Serie 16 (2005) 353 357 doi:10.1088/1742-6596/16/1/049 SciDAC 2005 Development of an atmopheric climate model with elf-adapting grid and phyic Joyce

More information

SLA Adaptation for Service Overlay Networks

SLA Adaptation for Service Overlay Networks SLA Adaptation for Service Overlay Network Con Tran 1, Zbigniew Dziong 1, and Michal Pióro 2 1 Department of Electrical Engineering, École de Technologie Supérieure, Univerity of Quebec, Montréal, Canada

More information

Handling Degenerate Cases in Exact Geodesic Computation on Triangle Meshes

Handling Degenerate Cases in Exact Geodesic Computation on Triangle Meshes The Viual Computer manucript. (will be inerted b the editor) Yong-Jin Liu Qian-Yi Zhou Shi-Min Hu Degenerate Cae in Eact Geodeic Computation on Triangle Mehe Abtract The computation of eact geodeic on

More information

ANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION

ANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION ANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION A. Váque-Nava * Ecuela de Ingeniería. CENTRO UNIVERSITARIO MEXICO. DIVISION DE ESTUDIOS SUPERIORES J. Figueroa

More information

Finite Elements Method in Split Hopkinson Pressure Bar developing process

Finite Elements Method in Split Hopkinson Pressure Bar developing process 6th WSEAS International Conference on SYSTEM SCIENCE and SIMULATION in ENGINEERING, Venice, Italy, November 1-3, 007 63 Finite Element Method in Split Hopkinon Preure Bar developing proce ROTARIU ADRIAN

More information

IMPROVED JPEG DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION. Tak-Shing Wong, Charles A. Bouman, and Ilya Pollak

IMPROVED JPEG DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION. Tak-Shing Wong, Charles A. Bouman, and Ilya Pollak IMPROVED DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION Tak-Shing Wong, Charle A. Bouman, and Ilya Pollak School of Electrical and Computer Engineering Purdue Univerity ABSTRACT We propoe

More information

Research on Star Image Noise Filtering Based on Diffusion Model of Regularization Influence Function

Research on Star Image Noise Filtering Based on Diffusion Model of Regularization Influence Function 016 Sith International Conference on Intrumentation & Meaurement Computer Communication and Control Reearch on Star Image Noie Filtering Baed on Diffuion Model of Regularization Influence Function SunJianming

More information

A PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED

A PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED A PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED Jutin Domke and Yianni Aloimono Computational Viion Laboratory, Center for Automation Reearch Univerity of Maryland College Park,

More information

The norm Package. November 15, Title Analysis of multivariate normal datasets with missing values

The norm Package. November 15, Title Analysis of multivariate normal datasets with missing values The norm Package November 15, 2003 Verion 1.0-9 Date 2002/05/06 Title Analyi of multivariate normal dataet with miing value Author Ported to R by Alvaro A. Novo . Original by Joeph

More information

ES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK

ES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK ES05 Analyi and Deign of Engineering Sytem: Lab : An Introductory Tutorial: Getting Started with SIMULINK What i SIMULINK? SIMULINK i a oftware package for modeling, imulating, and analyzing dynamic ytem.

More information

Connected Placement of Disaster Shelters in Modern Cities

Connected Placement of Disaster Shelters in Modern Cities Connected Placement of Diater Shelter in Modern Citie Huanyang Zheng and Jie Wu Department of Computer and Information Science Temple Univerity, USA {huanyang.zheng, jiewu}@temple.edu ABSTRACT Thi paper

More information

Routing Definition 4.1

Routing Definition 4.1 4 Routing So far, we have only looked at network without dealing with the iue of how to end information in them from one node to another The problem of ending information in a network i known a routing

More information

Analysis of slope stability

Analysis of slope stability Engineering manual No. 8 Updated: 02/2016 Analyi of lope tability Program: Slope tability File: Demo_manual_08.gt In thi engineering manual, we are going to how you how to verify the lope tability for

More information

A New Approach to Pipeline FFT Processor

A New Approach to Pipeline FFT Processor A ew Approach to Pipeline FFT Proceor Shouheng He and Mat Torkelon Department of Applied Electronic, Lund Univerity S- Lund, SWEDE email: he@tde.lth.e; torkel@tde.lth.e Abtract A new VLSI architecture

More information

(12) Patent Application Publication (10) Pub. No.: US 2011/ A1

(12) Patent Application Publication (10) Pub. No.: US 2011/ A1 (19) United State US 2011 0316690A1 (12) Patent Application Publication (10) Pub. No.: US 2011/0316690 A1 Siegman (43) Pub. Date: Dec. 29, 2011 (54) SYSTEMAND METHOD FOR IDENTIFYING ELECTRICAL EQUIPMENT

More information

Laboratory Exercise 2

Laboratory Exercise 2 Laoratory Exercie Numer and Diplay Thi i an exercie in deigning cominational circuit that can perform inary-to-decimal numer converion and inary-coded-decimal (BCD) addition. Part I We wih to diplay on

More information

Distributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router

Distributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router Ditributed Packet Proceing Architecture with Reconfigurable Hardware Accelerator for 100Gbp Forwarding Performance on Virtualized Edge Router Satohi Nihiyama, Hitohi Kaneko, and Ichiro Kudo Abtract To

More information

UNIAXIAL COMPRESSION TEST AND STRESS WAVE PROPAGATION MODELLING USING SPH

UNIAXIAL COMPRESSION TEST AND STRESS WAVE PROPAGATION MODELLING USING SPH Fifth International Conference on CFD in the Proce Indutrie CSIRO, Melbourne, Autralia - December UNIAXIAL COMPRESSION TEST AND STRESS WAVE PROPAGATION MODELLING USING SPH Rajarhi DAS and Paul W. CLEARY

More information

Fast 3D Scanning with Automatic Motion Compensation

Fast 3D Scanning with Automatic Motion Compensation Fat 3D Scanning with Automatic Motion Compenation Thibaut Weie, Batian Leibe and Luc Van Gool Swi Federal Intitute of Technology ETH Zürich) Zürich, Switzerland {weie,leibe,vangool}@viion.ee.ethz.ch Abtract

More information

Kinematics Programming for Cooperating Robotic Systems

Kinematics Programming for Cooperating Robotic Systems Kinematic Programming for Cooperating Robotic Sytem Critiane P. Tonetto, Carlo R. Rocha, Henrique Sima, Altamir Dia Federal Univerity of Santa Catarina, Mechanical Engineering Department, P.O. Box 476,

More information

Karen L. Collins. Wesleyan University. Middletown, CT and. Mark Hovey MIT. Cambridge, MA Abstract

Karen L. Collins. Wesleyan University. Middletown, CT and. Mark Hovey MIT. Cambridge, MA Abstract Mot Graph are Edge-Cordial Karen L. Collin Dept. of Mathematic Weleyan Univerity Middletown, CT 6457 and Mark Hovey Dept. of Mathematic MIT Cambridge, MA 239 Abtract We extend the definition of edge-cordial

More information

Practical Analog and Digital Filter Design

Practical Analog and Digital Filter Design Practical Analog and Digital Filter Deign Artech Houe, Inc. Le Thede 004 Thi text i dedicated to my wife who keep me grounded, and to my grandchildren who know no bound. Content Preface xi Chapter Introduction

More information

A Study of a Variable Compression Ratio and Displacement Mechanism Using Design of Experiments Methodology

A Study of a Variable Compression Ratio and Displacement Mechanism Using Design of Experiments Methodology A Study of a Variable Compreion Ratio and Diplacement Mechanim Uing Deign of Experiment Methodology Shugang Jiang, Michael H. Smith, Maanobu Takekohi Abtract Due to the ever increaing requirement for engine

More information

Edge preserving smoothing by Euclidean shortening flow

Edge preserving smoothing by Euclidean shortening flow Proceeding International Mathematica Sympoium 5 5-8 Augut 5, Perth, Autralia UR: http://internationalmathematicaympoium.org/ims5/ Edge preerving moothing by Euclidean hortening flow Deign of Algorithm

More information

Operational Semantics Class notes for a lecture given by Mooly Sagiv Tel Aviv University 24/5/2007 By Roy Ganor and Uri Juhasz

Operational Semantics Class notes for a lecture given by Mooly Sagiv Tel Aviv University 24/5/2007 By Roy Ganor and Uri Juhasz Operational emantic Page Operational emantic Cla note for a lecture given by Mooly agiv Tel Aviv Univerity 4/5/7 By Roy Ganor and Uri Juhaz Reference emantic with Application, H. Nielon and F. Nielon,

More information

A Load Balancing Model based on Load-aware for Distributed Controllers. Fengjun Shang, Wenjuan Gong

A Load Balancing Model based on Load-aware for Distributed Controllers. Fengjun Shang, Wenjuan Gong 4th International Conference on Machinery, Material and Computing Technology (ICMMCT 2016) A Load Balancing Model baed on Load-aware for Ditributed Controller Fengjun Shang, Wenjuan Gong College of Compute

More information

The Association of System Performance Professionals

The Association of System Performance Professionals The Aociation of Sytem Performance Profeional The Computer Meaurement Group, commonly called CMG, i a not for profit, worldwide organization of data proceing profeional committed to the meaurement and

More information

All in-focus View Synthesis from Under-Sampled Light Fields

All in-focus View Synthesis from Under-Sampled Light Fields ICAT 2003 December 3-5, Tokyo, Japan All in-focu View Synthei from Under-Sampled Light Field Keita Takahahi,AkiraKubota and Takehi Naemura TheUniverityofTokyo Carnegie Mellon Univerity 7-3-1, Hongo, Bunkyo-ku,

More information

How to Select Measurement Points in Access Point Localization

How to Select Measurement Points in Access Point Localization Proceeding of the International MultiConference of Engineer and Computer Scientit 205 Vol II, IMECS 205, March 8-20, 205, Hong Kong How to Select Meaurement Point in Acce Point Localization Xiaoling Yang,

More information

An Active Stereo Vision System Based on Neural Pathways of Human Binocular Motor System

An Active Stereo Vision System Based on Neural Pathways of Human Binocular Motor System Journal of Bionic Engineering 4 (2007) 185 192 An Active Stereo Viion Sytem Baed on Neural Pathway of Human Binocular Motor Sytem Yu-zhang Gu 1, Makoto Sato 2, Xiao-lin Zhang 2 1. Department of Advanced

More information

Localized Minimum Spanning Tree Based Multicast Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Sensor Networks

Localized Minimum Spanning Tree Based Multicast Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Sensor Networks Localized Minimum Spanning Tree Baed Multicat Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Senor Network Hanne Frey Univerity of Paderborn D-3398 Paderborn hanne.frey@uni-paderborn.de

More information

Maximum Feedrate Interpolator for Multi-axis CNC Machining with Jerk Constraints

Maximum Feedrate Interpolator for Multi-axis CNC Machining with Jerk Constraints Maximum Feedrate Interpolator for Multi-axi CNC Machining with Jerk Contraint Xavier Beudaert, Sylvain Lavernhe, Chritophe Tournier To cite thi verion: Xavier Beudaert, Sylvain Lavernhe, Chritophe Tournier.

More information

Numerical Modeling of Material Discontinuity Using Mixed MLPG Collocation Method

Numerical Modeling of Material Discontinuity Using Mixed MLPG Collocation Method umerical odeling of aterial Dicontinuit Uing ied LPG Collocation ethod B. alušić 1,. Sorić 1 and T. arak 1 Abtract A mied LPG collocation method i applied for the modeling of material dicontinuit in heterogeneou

More information

On the Use of Shadows in Stance Recovery

On the Use of Shadows in Stance Recovery On the Ue of Shadow in Stance Recovery Alfred M. Brucktein, 1 Robert J. Holt, 1 Yve D. Jean, 2 Arun N. Netravali 1 1 Bell Laboratorie, Lucent Technologie, Murray Hill, NJ 094 2 Avaya Communication, Murray

More information

Robust object characterization from lensless microscopy videos

Robust object characterization from lensless microscopy videos Robut object characterization from lenle microcopy video Olivier Flaeur, Loïc Deni, Corinne Fournier, and Éric Thiébaut Univ Lyon, UJM-Saint-Etienne, CNRS, Intitut d Optique Graduate School, Laboratoire

More information

A Multi-objective Genetic Algorithm for Reliability Optimization Problem

A Multi-objective Genetic Algorithm for Reliability Optimization Problem International Journal of Performability Engineering, Vol. 5, No. 3, April 2009, pp. 227-234. RAMS Conultant Printed in India A Multi-objective Genetic Algorithm for Reliability Optimization Problem AMAR

More information

Mirror shape recovery from image curves and intrinsic parameters: Rotationally symmetric and conic mirrors. Abstract. 2. Mirror shape recovery

Mirror shape recovery from image curves and intrinsic parameters: Rotationally symmetric and conic mirrors. Abstract. 2. Mirror shape recovery Mirror hape recovery from image curve and intrinic parameter: Rotationally ymmetric and conic mirror Nuno Gonçalve and Helder Araújo Λ Intitute of Sytem and Robotic Univerity of Coimbra Pinhal de Marroco

More information

A Linear Interpolation-Based Algorithm for Path Planning and Replanning on Girds *

A Linear Interpolation-Based Algorithm for Path Planning and Replanning on Girds * Advance in Linear Algebra & Matrix Theory, 2012, 2, 20-24 http://dx.doi.org/10.4236/alamt.2012.22003 Publihed Online June 2012 (http://www.scirp.org/journal/alamt) A Linear Interpolation-Baed Algorithm

More information

Performance Evaluation of an Advanced Local Search Evolutionary Algorithm

Performance Evaluation of an Advanced Local Search Evolutionary Algorithm Anne Auger and Nikolau Hanen Performance Evaluation of an Advanced Local Search Evolutionary Algorithm Proceeding of the IEEE Congre on Evolutionary Computation, CEC 2005 c IEEE Performance Evaluation

More information

Bayesian segmentation for damage image using MRF prior

Bayesian segmentation for damage image using MRF prior Bayeian egmentation for damage image uing MRF prior G. Li 1, F.G. Yuan 1, R. Haftka and N. H. Kim 1 Department of Mechanical and Aeropace Engineering, North arolina State Univerity, Raleigh, N, 7695-791,

More information