Polyhedral Surface Smoothing with Simultaneous Mesh Regularization
|
|
- Jemima Webb
- 6 years ago
- Views:
Transcription
1 olyhedral Surface Smoothng wth Smultaneous Mesh Regularzaton Yutaka Ohtake The Unversty of Azu Azu-Wakamatsu Cty Fukushma Japan Alexander G. Belyaev The Unversty of Azu Azu-Wakamatsu Cty Fukushma Japan Ila A. Bogaevsk Independent Unversty of Moscow Bolsho Vlasevsky ereulok Moscow, Russa Abstract A computer graphcs object reconstructed from real-world data often contans undesrable nose and small-scale oscllatons. An mportant problem s how to remove the nose and oscllatons whle preservng desrable geometrc features of the object. Ths paper develops methods for polyhedral surface smoothng and denosng wth smultaneous ncreasng mesh regularty. We also propose an adaptve smoothng method allowng to reduce possble oversmoothng. Roughly speakng, our smoothng schemes consst of movng every vertex n the drecton defned by the Laplacan flow wth speed equal to a properly chosen functon of the mean curvature at the vertex. Keywords: mesh smoothng and denosng, mesh regularty, Laplacan smoothng, mean curvature flow Introducton Recent advances n 3D data-acquston hardware call for development of methods to rapdly remove undesrable nose and small scale oscllatons from an rregularly trangulated data. Two the most popular approaches for smoothng and denosng of polyhedral surfaces are mnmzng energy functonals assocated wth dfferental-geometrc surface characterstcs and Laplacan smoothng. Mnmzng an energy functonal s usually a computatonally expensve task. Moreover, t lacks a local shape control. Laplacan smoothng s smple, fast, and so far the most common technque for mesh smoothng. The Laplacan smoothng flow, n ts smplest form, moves recursvely each vertex of the mesh by a dsplacement equal to a postve scale factor tmes the average of the neghborng vertces. Actually, the Laplacan smoothng flow can be consdered as the gradent descent flow for a smple quadratc energy functonal. However, due to ts smplcty, the Laplacan flow opens many ways for modfcatons and mprovements. Taubn n [8] proposed to alternate two scale factors of opposte sgns wth the negatve factor of larger magntude n a weghted Laplacan smoothng flow. Such smoothng does not produces shrnkage and suppresses hgh frequences of a dscrete Laplacan operator defned on the mesh, whle enhancng low frequences. When the scale factors are equal n magntude, the Taubn smoothng scheme turns to the blaplacan smoothng flow [4] whch can be consdered as a dscrete approxmaton of the gradent descent flow for the thn-plate energy functonal. Another non-shrnkng modfcaton of the Laplacan smoothng flow was very recently proposed n [9]. A sgnfcant development of the Laplacan smoothng method, mesh smoothng by the mean curvature flow [3, 6] (see also references theren), came from mathematcs and materal scence. The dscrete mean curvature flow moves every vertex n the normal drecton wth speed equal to a dscrete approxmaton of the mean curvature at the vertex. Smoothng by the mean curvature flow and ts varous modfcatons have became extremely popular n geometrc mage processng (see, for nstance, [6] for references). Laplacan smoothng, Taubn smoothng, and the dscrete mean curvature flow contan a number of drawbacks. The Laplacan smoothng flow ncreases the mesh regularty but develops unnatural deformatons whle beng appled to a hghly rregular mesh. Smoothng by the dscrete mean curvature flow s relatvely ndependent of the mesh samplng rate but ncreases the mesh rregularty. Both the Laplacan and mean curvature flows do not decelerate the smoothng process and may lead to oversmoothng and loosng desrable geometrc features. The Taubn smoothng scheme lacks a local shape control and enhances low frequency surface features. In ths paper we propose smple and effectve polyhedral
2 (a) (b) (c) (d) (e) (f) Fgure. The top row: (a) a polyhedral sphere; (b) the sphere wth a unform nose added; (c) Laplacan smoothng develops unnatural deformatons; (d) smoothng by the Taubn method converts hgh-frequency surface oscllatons nto low-frequency waves; (e) smoothng by the mean curvature ow ncreases the mesh rregularty; (f) smoothng accordng to a method proposed n ths paper, see Secton 3. The bottom row: (a) the Stanford bunny; (b) the bunny wth a unform nose added; (c) Laplacan smoothng wth a number of teratons chosen to acheve `a good lookng' result: extra teratons wll lead to oversmoothng; (d) Taubn smoothng reduces hgh-frequency surface oscllatons but enhances low-frequency oscllatons: extra teratons wll lead to enhancng of surface wrnkles; (e) smoothng by the mean curvature ow wth a number of teratons chosen to acheve `a good lookng' result: extra teratons wll lead to oversmoothng; (f) smoothng accordng to a method proposed n ths paper: the smoothng process slows down automatcally and extra teratons wll produce almost the same appearance, see Secton 4. surface smoothng schemes whch combne the best propertes of the Laplacan smoothng flow and dscrete mean curvature flow, often outperform best exstng smoothng methods, and, n addton, reduce possble oversmoothng. Fg. demonstrates some of our results. The paper s organzed as follows. In Secton 2, we ntroduce the Laplacan flow, the Taubn smoothng method, and the dscrete mean curvature flow. In Secton 3, our new technque whch combnes the best propertes of the Laplacan and dscrete mean curvature flow s explaned. In Secton 4, we descrbe our technque to reduce possble oversmoothng. We dscuss applcaton of smoothng methods for stable detecton of rdges and ravnes on a polyhedral surfaces n Secton 5. We conclude and sketch drectons for future research n Secton 6. mean curvature flow [3]. Laplacan Smoothng. Let us consder a trangulated surface and, for any vertex, let us defne the so-called umbrella-operator [4] U( )= w w, () where summaton s taken over all neghbors of, w are postve weghts. See Fg. 2. old 2 Laplacan Flow, Taubn Method, Blaplacan Flow, Mean Curvature Flow In ths secton we wll ntroduce and analyze four methods for polyhedral surface smoothng: Laplacan smoothng, Taubn smoothng [8], the blaplacan flow [4], and the n Fgure 2. new 2
3 The local update rule, old + U( old ) (2) appled typcally to every nner pont of the trangulated surface s called Laplacan smoothng of the surface. Here s a small postve number and the process (2) s executed repeatedly. The Laplacan smoothng algorthm reduces the hgh frequency surface nformaton and tends to flatten the surface. The weghts can be chosen n many dfferent ways. The smplest choce s to set the weghts equal to each other: w =, U 0 ( )= n, ; (3) where n s the number of neghbors. Another choce that produces good results [8] s set the weghts as the nverse dstances between and ts neghbors: U ( )= w w, ; w = k, k, : (4) Note that smoothng wth U 0 mproves the mesh samplng rate, whereas smoothng wth U worsens the rate. To demonstrate ths, let us consder a plane curve r(s) parameterzed by arclength parameter s. Consder three ponts on the curve A = r(s, ); O = r(s); B = r(s + ) wth dstances a = joaj and b = jobj between them. Let dr=ds = t and n = t? compose the Frenet frame at O, see Fg. 3. Smple manpulatons wth Taylor seres expansons n r(s) t O r (s ) r(s+ ) a b A B Fgure 3. and Frenet formulas show that ",,!,,! # 2 OA OB a + b a + = n b + t k + b, a 3 k0 + O(a; b) 2 + a, b 4 k2 + O(a; b) 2 ; (5) h 2,,!,,! OA + OB a 2 + b 2 = k + b3, a 3 = n + t 3(a 2 + b 2 ) k0 + O(a; b) 2 2(b, a) a 2 + b 2 + a3, b 3 4(a 2 + b 2 ) k2 + O(a; b) 2 : If, for example, pont O s located closer to A than to B, a < b, then, due to the tangent components n the above expansons, one step of Laplacan smoothng wth U 0 shfts O closer to B and one step of the Laplacan smoothng wth U shfts O closer to A. However Laplacan smoothng wth U 0 develops unnatural deformatons, see Fg. c (the top row). Taubn Smoothng. Taubn n [8] proposed to alternate two scale factors of opposte sgns wth the negatve factor of larger magntude n the Laplacan smoothng flow. Such smoothng suppresses hgh frequences of the umbrella operator (), whle preservng and enhancng ts low frequences [8]. Combnng the two successve steps of the Taubn method n one local update rule we arrve at, (, U)( + U) old = (6) = old, (, ) U( old ), U 2 ( old ); where >>0, U 2 s the squared umbrella operator U 2 ( )= w + w U( ),U( ): Accordng to [8], the best smoothng wth (6) s obtaned when U = U 0 or U = U. In our experments, Taubn smoothng wth U = U 0 works much better than wth U = U. However, even the frst Taubn smoothng scheme often produces poor results, see for example Fg. d (the top row) where we used =0:3 and =, = =0:. In Fg. d (the bottom row) the Taubn flterng scheme demonstrates a good performance. Nevertheless, one can note enhancng of low-frequency surface wrnkles. Blaplacan flow. The blaplacan flow, old + U 2 ( old ) s a dscrete analog of the steepest descent flow for the the thn-plate energy functonal [4]. It can be obtaned from the Taubn smoothng scheme f the postve and negatve scale factors are equal n magntude. The blaplacan flow does not enhance low-frequency surface features. In our mplementaton of the blaplacan flow we use the plan umbrella operator (3). 3
4 (a) (b) (c) (d) (e) (f) (g) (h) Fgure 4. (a) A torus wth consstng of two parts wth derent samplng rates; (b) a magned vew of a part of the torus; (c) the torus wth a unform nose added; (d) Laplacan smoothng deforms the ntal shape; (e) smoothng by the Taubn method reduces hgh-frequency surface oscllatons but develops low-frequency surface waves; (f) the blaplacan ow smoothes well but slghtly deforms the ntal shape; (g) the mean curvature ow smoothes well but produces rregular mesh; (h) smoothng accordng to (). Mean curvature flow. Recently t was reported [3] that the smoothng procedure, old + H( old ) n( old ); (7) where H s a dscrete verson of the mean curvature and n s the unt normal vector, produces better results than Laplacan smoothng (2). Accordng to [3], a good estmaton of the mean curvature vector at a vertex s gven by Hn =, ra 2A ; where A = A s the sum of the areas of the trangles surroundng. Calculatons [3] show that Hn( )= 4A (cot + cot )(, ); (8) where and are the two angles opposte to the edge, see Fg. 5. The two dmensonal analog of ths approxmaton s gven by the left hand-sde of (5), snce ",,!,,! # OA OB r(a + b) =ra + rb =, a + b + Fgure 5. Thus, smlar to U, smoothng by dscrete curvature flow (7), (8) worsens the mesh samplng rate. See Fg. e (the top row) where the mean curvature flow demonstrates a good performance n smoothng a nosy sphere but produces uneven dstrbuton of vertces. 3 Modfed Mean Curvature Flow Let us consder a famly of smooth surfaces S(u; v; t), where (u; v) parameterze the surface and t parameterzes the famly. We suppose (u; v) to be ndependent of t. Let us assume that ths famly evolves accordng to the evoluton 4
5 (a) (b) (c) (d) (e) (f) Fgure 6. (a) A polyhedral two-holed torus gven as a mesh havng rregular connectvty and consstng of parts wth derent samplng rates, a small nose s also added; (b) Laplacan smoothng mproves the mesh samplng rate but deforms the ntal shape; (c) smoothng by the Taubn method substantally deforms the ntal shape n unnatural way; (d) the blaplacan ow also deforms the ntal shape n an rregular manner. (e) the mean curvature ow produces rregular mesh; (f) smoothng accordng to (2), (3) produces a regular meshng surface whch shape s close to the shape produced by the mean curvature ow. v; t) = F n; S(u; v; 0) = S (0) (u; v); where n(u; v; t) s the unt normal vector for S(u; v; t), F s a speed functon, S (0) (u; v) s an ntal surface. The famly parameter t can be consdered as the tme duraton of the evoluton. Equaton (9) means that the surface S(u; v; t) moves along ts normals wth speed equal to F. Consder now the v; t) = F n + G t; S(u; v; 0) = S (0) (u; v); where t s a vector tangent to the surface and G s a gven functon. Note that the tangent speed component does not affect the geometry of the evolvng surface and changes only surface parameterzaton. Solvng (9) for a polyhedral surface by an explct Euler scheme s more stable for polyhedral surfaces wth unform mesh samplng rates and, therefore, allows to use larger tme steps to acheve faster smoothng. Note that a backward scheme (t was proposed and used for smoothng n [3]) s no better than Euler s scheme. For larger tme steps where Euler s scheme s unstable the backward scheme s naccurate [5]. Roughly speakng, our man dea of smultaneous mesh smoothng and regularzaton conssts of usng the normal speed component F n for polyhedral surface smoothng and the tangent speed component to mprove the mesh samplng rate. For polygonal curve evolutons ths dea was proposed and used n []. Let us use the dscrete mean curvature flow (7), (8) for smoothng and the Laplacan flow (2), (3) for mprovng the mesh samplng rate. One possble mplementaton s to take F n = H n and G t = C [U 0, (U 0 n) U 0 ] ; where U 0 s the umbrella vector (3), C s a postve constant, 5
6 (b) (c) (d) (a) (e) (f) (g) (h) () (j) Fgure 7. (a) A polyhedral surface consstng of two parts wth derent samplng rates. (b){(d) Deformaton of (a) nto a at patch by the Laplacan ow. (e){(g) Deformaton of (a) nto a at patch by the mean curvature ow. (h){(j) Deformaton of (a) nto a at patch by our method (2), (3). and the dot stands for the scalar product. One can see that U 0,(U 0 n) U 0 s the projecton of the umbrella vector onto the tangent plane. It leads to the local update rule n H( old )n( old )+ () + C U 0 ( old ), (U 0 ( old ) n( old )) U 0 ( old ) o, old + Smoothng by () produces shapes of the same qualty as the mean curvature flow but wth unform dstrbuton of vertces. See Fg. 4. One can also defne the parameter C as a functon of surface curvatures to acheve a hgher mesh samplng rate n the curved surface regons. However, accordng to our experments, a smlar smoothng scheme produces better results. Let m = U 0 =ku 0 k and s the angle between the mean curvature vector Hn and m : cos = m Hn=jHj. Vector m defnes a 3D analog of 2D medan drecton. Our basc dea s to move the vertces n the medan drecton such that the normal speed component s equal to the mean curvature. However, snce for saddle vertces the medan drecton vector m and the mean curvature vector H n may have opposte normal components (.e., > =2), see Fg. 8b, we use the followng flow where F = 8 >< >:, old + F( old ); (2) jhjm cos 2 H n, jhj m f cos >" f cos <," cos 0 f j cos j " (3) Here " s a small postve parameter. Geometrc deas behnd (2) are explaned n Fg. 8. If the normal and medan vectors are almost orthogonal to each other at a vertex (j cos j "), we do not move the vertex at all. 6
7 Hn θ medan drecton (a) m H cosθ m H m -cos θ -Hn tangent plane (a) (b) θ Hn H 2H n - m cos θ (b) Hn (c) Fgure 8. (a) The case when the medan and normal vectors le on the same sde from the tangent plane: movng n the medan drecton wth normal speed component equal to the mean curvature. (b) The case the medan and normal vectors le on the opposte sdes from the tangent plane may happen for saddle vertces. (c) Computaton of the speed vector n (b). (c) (d) Fgure 9. (a) The orgnal Stanford bunny; (b) the bunny wth a unform nose added; (c) smoothng by (2) (Laplacan and mean curvature ows produce almost the same results); (d) smoothng by (4) wth the same number of teratons as n (c). Accordng to our experments, choosng " = 0: produces good results ndependently of the mesh samplng rate. Our smoothng scheme (2) demonstrates better results than the Laplacan flow, the mean curvature flow, and the Taubn smoothng scheme, see Fg.. See also Fg. 7 where a polyhedral surface consstng of two parts wth dfferent samplng rates s smoothed by the Laplacan flow, the mean curvature flow, and our scheme (2) and (3). 4 How to Avod Oversmoothng Laplacan smoothng, the mean curvature flow, and our new technque presented n the prevous secton smooth polyhedral surfaces by suppressng hgh frequency surface oscllatons. Lackng a local surface control, they may lead to oversmoothng and, therefore, destroyng desrable surface features. To ncorporate a local control for smoothng and to reduce possble oversmoothng due to too large number of teratons, let us consder a smple but very useful modfcaton allowng to slow down the smoothng process adaptvely: wth ef( )= 8 < :, old + e F(old ) (4), kf( )k,t F( ) f kf( )k >T jjf( )jj 0 f kf( )k T where T s a postve threshold selected by a user. Accordng to ths modfcaton, the smoothng s performed only on those mesh vertces where kf( )k >T. See Fg. 9 to compare performance of smoothng schemes (2), (3) and (4) wth F( ) defned n (3). Of course the above smple modfcaton can be appled to the any smoothng flow consdered before. In our experments exposed n Fg. 9 the parameter T n (4) s the same for all vertces. It s natural to allow T be dependent on shape characterstcs at the vertces: T = T ( ). In our experments we defne the threshold T ( ) at the vertex as the arthmetc mean of the mean curvatures computed at the frst rng of neghbors of or at the frst and second rngs of neghbors of. Fg. 0 demonstrates 7
8 (a) (b) (c) (d) (e) (f) Fgure. (a) A Godzlla model. (b) - (f) The rdges (black) and ravnes (whte) detected on the Godzlla model smoothed by varous smoothng schemes. (b) Smoothng by the Laplacan ow. (c) Smoothng by the Taubn method. (d) Smoothng by the blaplacan ow. (e) Smoothng by the mean curvature ow. (f) Smoothng by our method (2), (3). our experments wth smoothng a Noh mask trangulated model reconstructed from a cloud of ponts. Accordng to our experments, the best smoothng strategy conssts of recomputng perodcally the threshold T ( ) for each vertex after a fxed number of smoothng teratons. Fg. f (the bottom row) shows advantages of such threshold recomputng scheme. 5 Applcatons (a) (b) (c) Fgure 0. (a) A trangulated Noh mask model reconstructed from a scattered data generated by a laser scanner system; (b) smoothng accordng to (4) wth constant T chosen manually; (c) smoothng accordng to (4) wth T ( ) equal to the arthmetc mean of the mean curvatures of at the rst and second rngs of neghbors of. We apply our smoothng technque (2), (3) to detect rdges and ravnes on a smooth surface approxmated by a trangular mesh. Let us defne the rdges as the locus of ponts where the maxmal prncpal curvature attans a postve maxmum along ts curvature lne and the ravnes as the locus of ponts where the mnmal prncpal curvature attans a negatve mnmum along ts curvature lne [2]. ractcal detecton of the rdges and ravnes on a surface nvolves estmaton of hgh-order surface dervatves and, therefore, requres a careful surface smoothng before detecton. It seems natural to choose a smoothng procedure mnmzng vertces drft over the surface. On the other hand, a smoothng scheme ncreasng the mesh regularty mproves curvature estmaton. For practcal detecton of the rdge and ravne vertces on the mesh, we frst smooth the mesh and then estmate the normal, the prncpal curvatures, and the prncpal drectons at the mesh vertces. We use the method proposed n [7]. To check whether a gven vertex s a rdge vertex, we fnd the ntersecton between the polygon composed the rng of the frst neghbors of and the normal plane generated by the normal vector and maxmal prncpal drecton 8
9 at. We estmate the maxmal prncpal curvature at the ntersecton ponts by lnear nterpolaton. Fnally we compare the the values of the maxmal prncpal curvature at and the ntersecton ponts. Some results of our experments wth varous smoothng schemes are shown n Fg. where the rdges are colored n black and ravnes are colored n whte. We thnk that our smoothng scheme produces one of the best results. 6 Concluson In ths paper we propose smple and effectve polyhedral surface smoothng schemes whch combne the best propertes of the Laplacan smoothng flow and dscrete mean curvature flow, are good for hghly rregular meshes, outperform exstng methods, and reduce possble oversmoothng. In future we are plannng to extend deas presented n the paper to varous dscrete mplementatons of the Laplacan and mean curvature flows. Also we want to examne how the developed methods can be enhanced by blaplacan flows and surface dffuson processes. We also hope to make our smoothng methods faster and more accurate by usng the mplct Crank-Ncolson method. Another nterestng drecton for future research s shape enhancement, the opposte operaton to smoothng. Smple nvertng of a smoothng flow s usually unstable. However, stablty can be acheved by ncorporatng a curvature-based local control smlar to that we developed n Secton 4. Our prelmnary results are encouragng. [4] L. Kobbelt, S. Campagna, J. Vorsatz, and H.-. Sedel. Interactve multresoluton modelng on arbtrary meshes. In Computer Graphcs (SIGGRAH 98 roceedngs), pages 05 4, 998. [5] R. Mohtar and L. Segerlnd. Accuracy-based tme step crtera for solvng parabolc equatons. In Modelng, Mesh Generaton, and Adaptve Numercal Methods for artal Dfferental Equatons, IMA Volume 75, pages Sprnger, 995. [6] J. A. Sethan. Level Set Methods and Fast Marchng Methods. Cambrdge Unv. ress, 999. [7] G. Taubn. Estmatng the tensor of curvature of a surface from a polyhedral approxmaton. In roc. ICCV 95, pages , 985. [8] G. Taubn. A sgnal processng approach to far surface desgn. In Computer Graphcs (SIGGRAH 95 roceedngs), pages , 985. [9] J. Vollmer, R. Mencl, and H. Muller. Improved laplacan smoothng of nosy surface meshes. Computer Graphcs Forum (roc. Eurographcs 999), 8(3):3 38, 999. Acknowledgments We thank the anonymous revewers for ther careful readng and helpful suggestons. Ila Bogaevsk s grateful to the Unversty of Azu where he spent one year as a vstng researcher n 998/99 when ths research was manly conducted. Thanks to Shn Yoshzawa for the Godzlla 3D data set. References [] A. G. Belyaev, E. V. Anoshkna, S. Yoshzawa, and M. Yano. olygonal curve evolutons for planar shape modelng and analyss. Internatonal Journal of Shape Modelng, to appear. [2] A. G. Belyaev and Y. Ohtake. An mage processng approach to detecton of rdges and ravnes on polyhedral surfaces. Submtted for publcaton, [3] M. Desbrun, M. Meyer,. Schröder, and A. H. Barr. Implct farng of rregular meshes usng dffuson and curvature flow. Computer Graphcs (SIGGRAH 99 roceedngs), pages ,
High-Boost Mesh Filtering for 3-D Shape Enhancement
Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,
More informationFair Triangle Mesh Generation with Discrete Elastica
Far Trangle Mesh Generaton wth Dscrete Elastca Shn Yoshzawa, and Alexander G. Belyaev, Computer Graphcs Group, Max-Planck-Insttut für Informatk, 66123 Saarbrücken, Germany Phone: [+49](681)9325-414 Fax:
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationImage Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline
mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and
More informationFeature-Preserving Mesh Denoising via Bilateral Normal Filtering
Feature-Preservng Mesh Denosng va Blateral Normal Flterng Ka-Wah Lee, Wen-Png Wang Computer Graphcs Group Department of Computer Scence, The Unversty of Hong Kong kwlee@cs.hku.hk, wenpng@cs.hku.hk Abstract
More informationAdaptive Fairing of Surface Meshes by Geometric Diffusion
Adaptve Farng of Surface Meshes by Geometrc Dffuson Chandrajt L. Bajaj Department of Computer Scences, Unversty of Texas, Austn, TX 78712 Emal: bajaj@cs.utexas.edu Guolang Xu State Key Lab. of Scentfc
More informationMesh Editing in ROI with Dual Laplacian
Mesh Edtng n ROI wth Dual Laplacan Luo Qong, Lu Bo, Ma Zhan-guo, Zhang Hong-bn College of Computer Scence, Beng Unversty of Technology, Chna lqngng@sohu.com, lubo@but.edu.cn,mzgsy@63.com,zhb@publc.bta.net.cn
More informationAn Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method
Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07), pp. 33-4 Research Inda Publcatons http://www.rpublcaton.com An Accurate Evaluaton of Integrals n Convex and
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationInterpolation of the Irregular Curve Network of Ship Hull Form Using Subdivision Surfaces
7 Interpolaton of the Irregular Curve Network of Shp Hull Form Usng Subdvson Surfaces Kyu-Yeul Lee, Doo-Yeoun Cho and Tae-Wan Km Seoul Natonal Unversty, kylee@snu.ac.kr,whendus@snu.ac.kr,taewan}@snu.ac.kr
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationDiscrete Schemes for Gaussian Curvature and Their Convergence
Dscrete Schemes for Gaussan Curvature and Ther Convergence Zhqang Xu Guolang Xu Insttute of Computatonal Math. and Sc. and Eng. Computng, Academy of Mathematcs and System Scences, Chnese Academy of Scences,
More informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More informationElectrical analysis of light-weight, triangular weave reflector antennas
Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationBarycentric Coordinates. From: Mean Value Coordinates for Closed Triangular Meshes by Ju et al.
Barycentrc Coordnates From: Mean Value Coordnates for Closed Trangular Meshes by Ju et al. Motvaton Data nterpolaton from the vertces of a boundary polygon to ts nteror Boundary value problems Shadng Space
More informationThe Theory and Application of an Adaptive Moving Least. Squares for Non-uniform Samples
Xanpng Huang, Qng Tan, Janfe Mao, L Jang, Ronghua Lang The Theory and Applcaton of an Adaptve Movng Least Squares for Non-unform Samples Xanpng Huang, Qng Tan, Janfe Mao*, L Jang, Ronghua Lang College
More informationDiscrete surface modelling using partial differential equations
Computer Aded Geometrc Desgn 23 (2006) 125 145 www.elsever.com/locate/cagd Dscrete surface modellng usng partal dfferental equatons Guolang Xu a,1,qngpan a, Chandrajt L. Bajaj b,,2 a State Key Laboratory
More informationA Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines
A Modfed Medan Flter for the Removal of Impulse Nose Based on the Support Vector Machnes H. GOMEZ-MORENO, S. MALDONADO-BASCON, F. LOPEZ-FERRERAS, M. UTRILLA- MANSO AND P. GIL-JIMENEZ Departamento de Teoría
More informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More informationParameterization of Quadrilateral Meshes
Parameterzaton of Quadrlateral Meshes L Lu 1, CaMng Zhang 1,, and Frank Cheng 3 1 School of Computer Scence and Technology, Shandong Unversty, Jnan, Chna Department of Computer Scence and Technology, Shandong
More informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationVISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
More informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
More informationRobust Curvature Estimation and Geometry Analysis of 3D point Cloud Surfaces
Robust Curvature Estmaton and Geometry Analyss of 3D pont Cloud Surfaces Xaopeng ZHANG, Hongjun LI, Zhangln CHENG, Ykuan ZHANG Sno-French Laboratory LIAMA, Insttute of Automaton, CAS, Bejng 100190, Chna
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationIn the planar case, one possibility to create a high quality. curve that interpolates a given set of points is to use a clothoid spline,
Dscrete Farng of Curves and Surfaces Based on Lnear Curvature Dstrbuton R. Schneder and L. Kobbelt Abstract. In the planar case, one possblty to create a hgh qualty curve that nterpolates a gven set of
More informationFuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches
Proceedngs of the Internatonal Conference on Cognton and Recognton Fuzzy Flterng Algorthms for Image Processng: Performance Evaluaton of Varous Approaches Rajoo Pandey and Umesh Ghanekar Department of
More informationVery simple computational domains can be discretized using boundary-fitted structured meshes (also called grids)
Structured meshes Very smple computatonal domans can be dscretzed usng boundary-ftted structured meshes (also called grds) The grd lnes of a Cartesan mesh are parallel to one another Structured meshes
More informationRobust Denoising of Point-Sampled Surfaces
Jfang L, Renfang Wang Robust Denosng of Pont-Sampled Surfaces Jfang L, Renfang Wang College of Computer Scence and Informaton Technology Zhejang Wanl Unversty Nngbo 315100, Chna Abstract: - Based on samplng
More informationComputers and Mathematics with Applications. Discrete schemes for Gaussian curvature and their convergence
Computers and Mathematcs wth Applcatons 57 (009) 87 95 Contents lsts avalable at ScenceDrect Computers and Mathematcs wth Applcatons journal homepage: www.elsever.com/locate/camwa Dscrete schemes for Gaussan
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationReducing Frame Rate for Object Tracking
Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg
More informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationType-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data
Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
More informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More informationComplex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
More informationAccounting for the Use of Different Length Scale Factors in x, y and z Directions
1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,
More informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationSimulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010
Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement
More information1. Introduction. 2. Related Work
ASIAGRAPH 008 PROCEEDINGS Curvature Estmaton of 3D Pont Cloud Surfaces Through the Fttng of Normal Secton Curvatures Xaopeng Zhang* /LIAMA-NLPR, Insttute of Automaton, CAS; Hongjun L /LIAMA-NLPR, Insttute
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationModeling, Manipulating, and Visualizing Continuous Volumetric Data: A Novel Spline-based Approach
Modelng, Manpulatng, and Vsualzng Contnuous Volumetrc Data: A Novel Splne-based Approach Jng Hua Center for Vsual Computng, Department of Computer Scence SUNY at Stony Brook Talk Outlne Introducton and
More informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationFast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
More informationVisual Curvature. 1. Introduction. y C. IEEE Conf. on Computer Vision and Pattern Recognition (CVPR), June 2007
IEEE onf. on omputer Vson and Pattern Recognton (VPR June 7 Vsual urvature HaRong Lu, Longn Jan Lateck, WenYu Lu, Xang Ba HuaZhong Unversty of Scence and Technology, P.R. hna Temple Unversty, US lhrbss@gmal.com,
More informationAssignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
More informationn i P i φ i t i P i-1 i+1 P i+1 P i i-1 i+1 2 r i
New Algorthms for Controllng Actve Contours Shape and Topology H. Delngette and J. Montagnat Projet Epdaure I.N.R.I.A. 06902 Sopha-Antpols Cedex, BP 93, France Abstract In recent years, the eld of actve-contour
More informationActive Contours/Snakes
Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng
More informationSome Tutorial about the Project. Computer Graphics
Some Tutoral about the Project Lecture 6 Rastersaton, Antalasng, Texture Mappng, I have already covered all the topcs needed to fnsh the 1 st practcal Today, I wll brefly explan how to start workng on
More informationLobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide
Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.
More informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
More informationShape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram
Shape Representaton Robust to the Sketchng Order Usng Dstance Map and Drecton Hstogram Department of Computer Scence Yonse Unversty Kwon Yun CONTENTS Revew Topc Proposed Method System Overvew Sketch Normalzaton
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationMultiblock method for database generation in finite element programs
Proc. of the 9th WSEAS Int. Conf. on Mathematcal Methods and Computatonal Technques n Electrcal Engneerng, Arcachon, October 13-15, 2007 53 Multblock method for database generaton n fnte element programs
More informationReading. 14. Subdivision curves. Recommended:
eadng ecommended: Stollntz, Deose, and Salesn. Wavelets for Computer Graphcs: heory and Applcatons, 996, secton 6.-6., A.5. 4. Subdvson curves Note: there s an error n Stollntz, et al., secton A.5. Equaton
More informationAn Image Fusion Approach Based on Segmentation Region
Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua
More informationA Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems
A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty
More informationFace Recognition using 3D Directional Corner Points
2014 22nd Internatonal Conference on Pattern Recognton Face Recognton usng 3D Drectonal Corner Ponts Xun Yu, Yongsheng Gao School of Engneerng Grffth Unversty Nathan, QLD, Australa xun.yu@grffthun.edu.au,
More informationMulti-Resolution Geometric Fusion
Internatonal Conference on Recent Advances n 3-D Dgtal Imagng and Modellng, Ottawa, Canada May 12 15, 1997 Mult-Resoluton Geometrc Fuson Adran Hlton and John Illngworth Centre for Vson, Speech and Sgnal
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationDELAUNAY TRIANGULATION BASED IMAGE ENHANCEMENT FOR ECHOCARDIOGRAPHY IMAGES
17th European Sgnal Processng Conference (EUSIPCO 9) Glasgow, Scotland, August 4-8, 9 DELAUNAY TRIANGULATION BASED IMAGE ENHANCEMENT FOR ECHOCARDIOGRAPHY IMAGES V Ahanathaplla 1, J. J. Soraghan 1, P. Soneck
More informationSimplification of 3D Meshes
Smplfcaton of 3D Meshes Addy Ngan /4/00 Outlne Motvaton Taxonomy of smplfcaton methods Hoppe et al, Mesh optmzaton Hoppe, Progressve meshes Smplfcaton of 3D Meshes 1 Motvaton Hgh detaled meshes becomng
More informationSimilarity-based denoising of point-sampled surfaces *
Wang et al. / J Zhejang Unv Sc A 008 9(6):807-85 807 Journal of Zhejang Unversty SCIENCE A ISSN 673-565X (Prnt); ISSN 86-775 (Onlne) www.zju.edu.cn/jzus; www.sprngerlnk.com E-mal: jzus@zju.edu.cn Smlarty-based
More informationS.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION?
S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? Célne GALLET ENSICA 1 place Emle Bloun 31056 TOULOUSE CEDEX e-mal :cgallet@ensca.fr Jean Luc LACOME DYNALIS Immeuble AEROPOLE - Bat 1 5, Avenue Albert
More informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More informationConstructing Minimum Connected Dominating Set: Algorithmic approach
Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected
More informationMOTION BLUR ESTIMATION AT CORNERS
Gacomo Boracch and Vncenzo Caglot Dpartmento d Elettronca e Informazone, Poltecnco d Mlano, Va Ponzo, 34/5-20133 MILANO boracch@elet.polm.t, caglot@elet.polm.t Keywords: Abstract: Pont Spread Functon Parameter
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationThe Evaluation and Correction of the Reconstructed NURBS Surface Smoothing and Accuracy
Sensors & Transducers 2013 by IFSA http://www.sensorsportal.com The Evaluaton and Correcton of the Reconstructed NURBS Surface Smoothng and Accuracy Shgang WANG, Janzhou ZHANG, Yong YAN School of Mechatroncs
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationOutline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:
Self-Organzng Maps (SOM) Turgay İBRİKÇİ, PhD. Outlne Introducton Structures of SOM SOM Archtecture Neghborhoods SOM Algorthm Examples Summary 1 2 Unsupervsed Hebban Learnng US Hebban Learnng, Cntd 3 A
More informationWavefront Reconstructor
A Dstrbuted Smplex B-Splne Based Wavefront Reconstructor Coen de Vsser and Mchel Verhaegen 14-12-201212 2012 Delft Unversty of Technology Contents Introducton Wavefront reconstructon usng Smplex B-Splnes
More informationRandom Kernel Perceptron on ATTiny2313 Microcontroller
Random Kernel Perceptron on ATTny233 Mcrocontroller Nemanja Djurc Department of Computer and Informaton Scences, Temple Unversty Phladelpha, PA 922, USA nemanja.djurc@temple.edu Slobodan Vucetc Department
More informationFeature-Preserving Denoising of Point-Sampled Surfaces
Feature-Preservng Denosng of Pont-Sampled Surfaces Jfang L College of Computer Scence and Informaton Technology Zhejang Wanl Unversty Nngbo 315100 Chna Abstract: Based on samplng lkelhood and feature ntensty,
More informationThe Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole
Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng
More informationA PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION
1 THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Seres A, OF THE ROMANIAN ACADEMY Volume 4, Number 2/2003, pp.000-000 A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION Tudor BARBU Insttute
More informationArray transposition in CUDA shared memory
Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some
More informationDynamic wetting property investigation of AFM tips in micro/nanoscale
Dynamc wettng property nvestgaton of AFM tps n mcro/nanoscale The wettng propertes of AFM probe tps are of concern n AFM tp related force measurement, fabrcaton, and manpulaton technques, such as dp-pen
More informationLoop Transformations for Parallelism & Locality. Review. Scalar Expansion. Scalar Expansion: Motivation
Loop Transformatons for Parallelsm & Localty Last week Data dependences and loops Loop transformatons Parallelzaton Loop nterchange Today Scalar expanson for removng false dependences Loop nterchange Loop
More informationHarmonic Coordinates for Character Articulation PIXAR
Harmonc Coordnates for Character Artculaton PIXAR Pushkar Josh Mark Meyer Tony DeRose Bran Green Tom Sanock We have a complex source mesh nsde of a smpler cage mesh We want vertex deformatons appled to
More informationLoop Permutation. Loop Transformations for Parallelism & Locality. Legality of Loop Interchange. Loop Interchange (cont)
Loop Transformatons for Parallelsm & Localty Prevously Data dependences and loops Loop transformatons Parallelzaton Loop nterchange Today Loop nterchange Loop transformatons and transformaton frameworks
More informationDenoising Manifold and Non-Manifold Point Clouds
Denosng Manfold and Non-Manfold Pont Clouds Ranjth Unnkrshnan Martal Hebert Carnege Mellon Unversty, Pttsburgh, PA 23 ranjth,hebert@cs.cmu.edu Abstract The fathful reconstructon of 3-D models from rregular
More informationA COMPARISON OF TWO METHODS FOR FITTING HIGH DIMENSIONAL RESPONSE SURFACES
Mam, Florda, U.S.A., Aprl 6-8, 7 A COMPARISON OF TWO METHODS FOR FITTING HIGH DIMENSIONAL RESPONSE SURFACES Marcelo J. Colaço Department of Mechancal and Materals Eng. Mltary Insttute of Engneerng Ro de
More information