T-Base: A Triangle-Based Iterative Algorithm for Smoothing Quadrilateral Meshes
|
|
- Ferdinand Parker
- 5 years ago
- Views:
Transcription
1 T-Base: Trangle-Based Iteratve lgorthm for Smoothng Quadrlateral Meshes Gang Me, John.Tpper and Nengxong Xu 2 bstract We present a novel approach named T-Base for smoothng planar and surface quadrlateral meshes. Our motvaton s that the best shape of quadrlateral element square can be vrtually dvded nto a par of equlateral rght trangles by any of ts dagonals. When move a node to smooth a quadrlateral, t s optmal to make a par of trangles dvded by a dagonal be equlateral rght trangles separately. The fnally smoothed poston s obtaned by weghtng all ndvdual optmal postons. Three varants are produced accordng to the determnaton of weghts. Tests by the T-Base are gven and compared wth Laplacan smoothng: The Var. of T-Base s effectvely dentcal to Laplacan smoothng for planar quad meshes, whle Var.2 s the best. For the quad mesh on underlyng parametrc surface and nterpolaton surface, Var.2 and Var. are best, respectvely. Keywords Mesh smoothng Iteratve smoothng Quad meshes Laplacan smoothng Length-weghted Introducton The qualty of meshes s crtcal to obtan relable smulaton results n fnte element analyses. Usually after generatng computatonal meshes, t s necessary to mprove the qualty of meshes n further. There are two mportant categores of qualty mprovement methods. One s called clear-up technques, whch alters the connectvty between elements. The other s called mesh smoothng, whch only relocates the nodes. There are numerous publcatons on the topc of mesh smoothng. nd we just refer some popular and representatve ones. Gang Me, John.Tpper () Insttut für Geowssenschaften Geologe, lbert-ludwgs-unverstät Freburg, lbertstr. 23B, -7904, Freburg m Bresgau, Germany e-mal: {gang.me, john.tpper}@geologe.un-freburg.de Nengxong Xu () School of Engneerng and Technology, hna Unversty of Geoscences, Bejng,00083, hna e-mal: xunengxong@yahoo.com.cn
2 2 G. Me, J..Tpper and N. Xu The most popular smoothng methods s Laplacan smoothng [5, 7], whch repostons each node at the centrod of ts neghbourng nodes n one teraton. The popularty of ths method comes from ts effcency and effectveness. smpler but more effectve method s angle-based approach [6], n whch new locatons are calculated by conformng specfc angle ratos n surroundng polygons. geometrc element transformaton method [4], whch s based on a smple geometrc transformaton, s proposed and appled to polygons. Shmada et al [2] proposed a method whch treats nodes as the centre of bubbles and nodal locatons are obtaned by deformng bubbles wth each other. projectng/smoothng method s proposed for smoothng surface meshes [4], where the new poston of each free node s obtaned by mnmzng the mean rato of all trangles sharng the free node. Based on quadrc surface fttng and by combnng vertex projectng, curvature estmatng and mesh labellng, Wang and Yu [5] proposed a novel method and appled t n bomedcal modellng. varatonal method for smoothng surface and volume trangulatons s proposed by Jao [9], where the dscrepances between actual and target elements s reduced by mnmzng two energy functons. lso, a general-purpose algorthm called the target-matrx paradgm s ntroduced n [0], and can be appled to a wde varety of mesh and element types. To smooth meshes better, two or more basc methods can be combned nto a hybrd approach [,2,6],.e., an analytcal framework for mesh qualty metrcs and optmzaton drecton computaton n physcal and parametrc space are proposed for smoothng surface quad meshes n [3]. In ths paper we ntroduce a novel teratve method named T-Base to smooth planar and surface quad meshes. The best shape of a quadrlateral element s square, whch can be vrtually dvded nto a par of equlateral rght trangles by any of ts dagonals. Hence, when move a node to smooth a quad element, t s optmal to make the two trangles dvded the dagonal conssted by the node and ts opposte one be equlateral rght trangles separately. The fnal smoothed poston s obtaned by weghtng all the separate optmal postons. When smooth surface quad meshes, we frstly compute the local coordnates system for each vrtual trangle and then calculate the optmal poston, and fnally obtan the smoothed node by transformng t from local coordnates to the global coordnates and weghtng all ndvdual optmal postons. fter generatng the optmal smoothed postons, they should be moved agan n order to preserve the features of ntal surfaces. For quad mesh on parametrc surfaces, we project the smoothed node onto the orgnal parametrc surface along the normal. For quad mesh on nterpolaton surfaces, we re-nterpolate the smoothed nodes to ft them wth the ntal surfaces. The rest of ths paper s organzed as follows. Sect.2 descrbes the detals of the T-Base ncludng ts three varants for smoothng planar quad meshes. In Sect.3, we smply extend T-Base to smooth surface quad meshes. Then we gve several examples n Sect.4 to test the performance of the T-Base and compare t wth Laplacan smoothng. Fnally, Sect.5 concludes ths work.
3 T-Base: Trangle-Based Iteratve lgorthm for Smoothng Quadrlateral Meshes 3 2 T-Base for Planar Quad Meshes The best shape of a quadrlateral element s square, whch can be vrtually dvded nto a par of equlateral rght trangles by any of ts dagonals. When move a node n order to smooth a quadrlateral, t s optmal to make the two trangles dvded by the dagonal conssted wth the node and ts opposte one be equlateral rght trangles separately (Fg.). * * B B + Fg. Smoothng of quad element B based on a par of vrtual trangles onsder a sngle quadrlateral element B shown n Fg.. It s vrtually dvded nto a par of trangles B and. * s are the postons to whch node would have to be moved to make B and be equlateral rght trangles, assumng that nodes B, and were fxed. The coordnates of * n trangles B and are: * X = X B + YB Y * Y = X B + YB + X * X = X, * Y = X Y + Y + Y X () Now assume B s part of a quadrlateral mesh. Each node of B for nstance node s then shared wth several other elements, and * can be calculated for each of these. The fnal poston of ts optmal smoothed poston s obtaned by consderng all the separately calculated * s (Fg.2). The tradtonal Laplacan smoothng assumes that the new poston of a node should be an average of the postons calculated for t for each of the elements of whch t s part (Fg.2). Ths assumpton s not essental, however, and t can be relaxed by makng that new poston a weghted average of those postons, wth the weghts beng proportonal to the lengths of the opposte edges. Then, for node : X = ( w X ), Y = ( w Y ) (2)
4 4 G. Me, J..Tpper and N. Xu,where n s the number of elements of whch node s part, and w s the weght of the th separate poston * whch can be calculated accordng to the length l of relevant th edge * Fg. 2 Node belongs to 5 quad elements. * can be calculated for each trangle separately (black crcles). Optmal smoothed poston for s produced from all * s ccordng to the determnaton of the weghts w, we produce three varants: Varant. Ths varant s termed as the average verson of the T-Base: 0 w = = l 0 l (3) The averagng process s effectvely dentcal to that used n the tradtonal Laplacan smoothng, whch explans why test results obtaned usng Laplacan smoothng are dentcal to that of T-Base for planar quad meshes (see Fgs 3, 4). But the above concluson s no longer true for surface quadrlateral meshes. Varant 2. Ths varant s termed as the ( /2) nverse-length verson: w = l l = l / 2 / 2 l (4) Varant 3. Ths varant s termed as the ( ) nverse-length verson: w = l = l l l (5) The ntroducton of nverse-length weghtng s n many respects advantageous, because hgh qualty elements such as equlateral quadrlateral element or even square generally have nearly or exactly same-length edges. In order to transform
5 T-Base: Trangle-Based Iteratve lgorthm for Smoothng Quadrlateral Meshes 5 quadrlateral elements to be equlateral as more as possble, we let longer edges of an element have less mportance n the smoothng than shorter ones. The dsadvantage of nverse-length versons (Var.2 and 3) over the average verson (Var.) s of course that t brngs a tme penalty, as the weghts have to be calculated afresh at each teraton step. Ths s also the reason why nverse-length versons need more teraton steps to converge than that of the average verson. The mplementaton of T-Base for planar quadrlateral meshes s very smple: () search all ncdent elements for each node; (2) calculate of smoothed postons of each node by makng relevant vrtual trangles be equlateral rght; (3) terate prevous step untl a tolerance dstance s reached. 3 T-Base for Surface Quad Meshes Eq. computes the optmal poston for a vrtual trangle n 2. For surface quad meshes, we frstly compute the local coordnates system for each vrtual trangle and then calculate the optmal poston va Eq., and fnally obtan the smoothed nodal poston by recoverng t to global coordnates and weghtng all * s. fter obtanng the optmal smoothed postons, updatng should be done for dfferent type of dscrete surfaces n order to preserve the shape of ntal surfaces. For quad mesh on parametrc surfaces, we compute the normal at each vertex and then project the smoothed node onto the orgnal parametrc surface along the normal to obtan fnal poston (Fg.5). For quad mesh on nterpolaton surfaces, we re-nterpolate the smoothed nodes to ft them wth the ntal surfaces (Fg.6). Flow of the T-Base for surface quad meshes s lsted n lgorthm.. lgorthm T-Base for Smoothng Surface Quad Meshes Input: n orgnal surface quad mesh Output: smoothed surface quad mesh : Search the ncdent elements for each node v. 2: whle teratons not termnate do 3: for each node v do 4: for each ncdent element Q j (0 j < n) of v do 5: vde Q j nto two trangles and calculate local coordnates separately. 6: Obtan a par of * s locally and transform them back to global. 7: alculate a par of weghts w s n Q j. 8: end for 9: Obtan optmal smoothed poston of v : X = ( w X ), Y = ( w Y ), Z = ( w Z 0: Update v by projectng t to ntal parametrc surface or re-nterpolatng. : end for 2: end whle )
6 6 G. Me, J..Tpper and N. Xu 4 pplcatons and scusson 4. Mesh Qualty The smplest way to measure mesh qualty s to calculate the dstorton values for each of the mesh elements separately, and then to compare the dstrbutons, ncludng mean qualty (MQ) and mean square error (MSE), of those values. For a quad B, we use the measure λ [8], shown n Eq.6. The value of λ les between 0 and ; λ = 0 when any three nodes are collnear; λ = when B s square. B B B B λ = 24 (6) ( B + )( B + B )( + B )( + ) For a quad element n 3, t s warped generally. In ths paper, we propose a new measurement γ n whch shape and warpage are taken nto account. quad B can be dvded nto four trangles: B, B, and B. We frstly calculate the local coordnates system of these trangles and project the orgnal quad element B onto each local coordnates system to obtan four planar quads B P, B P, B P and B P, respectvely. Let λ, λ 2, λ 3 and λ 4 denote the λ values of the four planar quads, then γ = (λ + λ 2 + λ 3 + λ 4 ) / 4. The value of γ also les between 0 and ; we specally set λ = 0 when any three nodes are collnear; λ = when B s coplanar square. Thus, we have: n 2 MQ = γ, MSE = ( γ MQ) (7) n n n, where n s the number of elements n a quad mesh. 4.2 Tests of Smoothng Planar Quad Meshes (a) Orgnal (b) By Var./LS (c) By Var.2 (d) By Var.3 Fg. 3 Test of smoothng planar quad mesh by T-Base and Laplacan smoothng (LS)
7 T-Base: Trangle-Based Iteratve lgorthm for Smoothng Quadrlateral Meshes 7 These two orgnal quad meshes are generated by Q-Morph []. Fg.3 and Fg.4 dsplay the results of the two planar quad meshes by Laplacan smoothng and T-Base. From the comparson of mesh qualty lsted n Table., we can learn that Var. s effectvely dentcal to Laplace smoothng, Var.3 and Var.2 are better than Var., but Var.2 s best. onvergence We do not gve the algebrac proof of convergence for T-Base n theory. But our tests show that T-Base does converge for planar meshes, and the numbers of teraton steps of Var., 2 and 3 always ncreases when t converges. (a) Orgnal. (b) By Var./LS (c) By Var.2 (d) By Var.3 Fg. 4 Test 2 of smoothng planar quad mesh by T-Base and Laplacan smoothng (LS) 4.3 Tests of Smoothng Surface Quad Meshes We frstly generate the planar meshes n a crcular area, and then project t onto the parametrc surface z = (x 2 + y 2 ) to obtan the mesh n Fg.5a. The orgnal mesh n Fg.6a s for heght nterpolaton by Krgng method [3]; only z - value/heght s nterpolated whle coordnates x and y are fxed. Fg.5 shows the results of quad meshes on a underlyng parametrc surface. Notceably, only Laplacan smoothng converges after 49 teratons. We just let T- Base terate 49 tmes as that of Laplacan smoothng. From the comparson of mesh qualty n Table., we can learn that T-Base s better than Laplacan smoothng. In further, Var.2 s the best, and the Var. s better than Var.3 snce the dstrbuton of element qualtes s better than that of Var.3. In Fg.6, all optmal smoothed by only Laplacan smoothng or T-Base s generated frstly, and then z -value s re-nterpolated by Krgng method. ue to the expensve cost of re-nterpolaton, we only terate 0 tmes. Smlar to the quad mesh on parametrc surface, T-Base s better than Laplacan smoothng. But Var. s the best, and then the Var.2, whle Var.3 s the worst.
8 8 G. Me, J..Tpper and N. Xu (a) Orgnal (b) By LS (c) By Var. (d) By Var.2 (e) By Var.3 Fg. 5 Smoothng results of surface quad mesh on underlyng parametrc surface (a) Orgnal (b) By LS (c) By Var. (d) By Var.2 (e) By Var.3 Fg. 6 Smoothng results of surface quad mesh on nterpolaton surface
9 T-Base: Trangle-Based Iteratve lgorthm for Smoothng Quadrlateral Meshes 9 onvergence Only Laplacan smoothng converges for the quad meshes on parametrc underlyng surface. ccordng to the convergence analyss for planar quad meshes, T-Base needs to terate more tmes than Laplacan smoothng, hence, we can frstly record the teraton number of Laplacan smoothng for surface quad meshes, and then set the number from Laplacan smoothng to be the maxmum teratons n T-Base. Ths s the reason we only terate 49 tmes n T- Base. When smooth quad meshes on nterpolaton surface, snce re-nterpolaton s too expensve, we just test the results after a specfed-number of teratons. Ths soluton of endng teratons s acceptable and valuable n practcal applcatons. Table Mesh qualty results of smoothng planar and surface quad meshes Mesh Fg.3 Fg.4 Fg.5 Fg.6 lgorthm Element qualty (0.0~.0) 0.0~ ~ ~ ~ ~.0 MQ MSE Orgnal 0.00% 0.00%.3% 6.53% 92.34% Var./LS 0.00% 0.00% 0.00% 2.93% 97.07% Var % 0.00% 0.00% 3.5% 96.85% Var % 0.00% 0.00% 3.60% 96.40% Orgnal 0.00% 0.00% 0.45% 6.47% 93.08% Var./LS 0.00% 0.00% 0.30% 6.47% 93.23% Var % 0.00% 0.45% 5.86% 93.69% Var % 0.00% 0.90% 4.8% 94.29% Orgnal 0.00% 0.99% 67.26% 8.8% 2.94% LS 0.00% 0.00% 62.45% 26.03%.53% Var. 0.00% 0.00% 0.64% 75.74% 23.62% Var % 0.00% 3.8% 6.0% 35.7% Var.3 0.4%.3% 0.04% 48.30% 40.38% Orgnal 0.00% 0.00% 2.40% 9.47% 88.2% LS 0.00% 0.00%.98% 8.0% 90.0% Var. 0.00% 0.00% 0.4% 5.70% 94.6% Var % 0.00% 0.99% 5.04% 93.97% Var % 0.28%.37% 4.90% 93.45% oncluson We present a novel teratve smoothng algorthm called T-Base for planar and surface quad meshes based on vrtually dvdng a quad element nto a par of trangles by ts dagonal. We relocate a node by makng all of the ncdent vrtual trangles be equlateral rght trangles separately, and then weghtng all separate smoothed postons. ccordng to the determnaton of weghts based on length of
10 0 G. Me, J..Tpper and N. Xu relevant edges, three varants of T-Base are produced. The T-Base s appled on planar and surface quad meshes, and compared wth Laplacan smoothng. The Var. of T-Base s effectvely dentcal to Laplacan smoothng for planar quad meshes, whle Var.2 and 3 are better. For the quad mesh on a underlyng parametrc surface, Var.2 s the best; and Var. s the best for the quad mesh on a nterpolaton surface. Tests also show that T-Base always converges for planar meshes. cknowledgments. Ths research was supported by the Natural Scence Foundaton of hna (Grant Numbers and ) and the Fundamental Research Funds for the entral Unverstes of hna. References. anann, S.., Trstano, J.R., Staten, M.L. (998). n approach to combned Laplacan and optmzaton-based smoothng for trangular, quadrlateral and quad-domnant meshes. In: Proceedngs of 7th nternatonal meshng roundtable, pp hen, Z., Trstano, J.R., Kwok, W. (2003). ombned Laplacan and optmzaton-based smoothng for quadratc mxed surface meshes. In: Proceedngs of 2th nternatonal meshng roundtable, pp hles, J.P., elfner, P. (202). Geostatstcs: Modelng Spatal Uncertanty (d edton). Wley-Interscence. 4. Escobar, J.M., Montenegro, R., Rodrguez, E., Montero, G. (20). Smultaneous algnng and smoothng of surface trangulatons. Eng. omput. 27, Feld,.. (988). Laplacan smoothng and elaunay trangulaton. ommun. ppl. Numer. Methods. 4, Fretag, L.. (997). On combnng Laplacan and optmzaton-based mesh smoothng technques. M trends n unstructured mesh generaton. SME. 220, Herrman, L.R. (976). Laplacan-soparametrc grd generaton scheme. J. Eng. Mech. EM Hua, L. (995). utomatc generaton of quadrlateral mesh for arbtrary planar domans. Ph.. thess, alan Unversty of Technology, hna (In hnese). 9. Jao, X., Wang,., Zha, H. (20). Smple and effectve varatonal optmzaton of surface and volume trangulatons. Eng. omput. 27, Knupp, P.M. (200). Introducng the target-matrx paradgm for mesh optmzaton va nodemovement. In: Proceedngs of 9th nternatonal meshng roundtable, pp Owen, S.J., Staten, M.L., anann, S.., Sagal, S. (999). Q-Morph: an ndrect approach to advancng front quad meshng. Int. J. Numer. Meth. Eng. 44(9), Shmada, K. (997). nsotropc trangular meshng of parametrc surfaces va close packng of ellpsodal bubbles. In: Proceedngs of 6th nternatonal meshng roundtable, pp Shvanna, K., Grosland, N., Magnotta, V. (200). n analytcal framework for quadrlateral surface mesh mprovement wth an underlyng trangulated surface defnton. In: Proceedngs of 9th nternatonal meshng roundtable, pp Vartzots,., Wpper, J. (2009). The geometrc element transformaton method for mxed mesh smoothng. Eng. omput. 25, Wang, J., Yu, Z. (2009). novel method for surface mesh smoothng: applcatons n bomedcal modelng. In: Proceedngs of 8th nternatonal meshng roundtable, pp Zhou, T., Shmada, K. (2000). n angle-based approach to two-dmensonal mesh smoothng. In: Proceedngs of 9th nternatonal meshng roundtable, pp
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 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 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 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 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 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 informationAn efficient method to build panoramic image mosaics
An effcent method to buld panoramc mage mosacs Pattern Recognton Letters vol. 4 003 Dae-Hyun Km Yong-In Yoon Jong-Soo Cho School of Electrcal Engneerng and Computer Scence Kyungpook Natonal Unv. Abstract
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 informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
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 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 informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
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 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 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 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 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 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 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 informationHigh resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices
Hgh resoluton 3D Tau-p transform by matchng pursut Wepng Cao* and Warren S. Ross, Shearwater GeoServces Summary The 3D Tau-p transform s of vtal sgnfcance for processng sesmc data acqured wth modern wde
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
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 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 informationAvailable online at Available online at Advanced in Control Engineering and Information Science
Avalable onlne at wwwscencedrectcom Avalable onlne at wwwscencedrectcom Proceda Proceda Engneerng Engneerng 00 (2011) 15000 000 (2011) 1642 1646 Proceda Engneerng wwwelsevercom/locate/proceda Advanced
More informationGeometric Error Estimation
Geometrc Error Estmaton Houman Borouchak Project-team GAMMA 3 UTT Troyes, France Emal: houman.borouchak@utt.fr Patrck Laug Project-team GAMMA 3 INRIA Pars - Rocquencourt, France Emal: patrck.laug@nra.fr
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationIMAGE FUSION TECHNIQUES
Int. J. Chem. Sc.: 14(S3), 2016, 812-816 ISSN 0972-768X www.sadgurupublcatons.com IMAGE FUSION TECHNIQUES A Short Note P. SUBRAMANIAN *, M. SOWNDARIYA, S. SWATHI and SAINTA MONICA ECE Department, Aarupada
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
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 informationA Robust Method for Estimating the Fundamental Matrix
Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.
More informationFinite Element Analysis of Rubber Sealing Ring Resilience Behavior Qu Jia 1,a, Chen Geng 1,b and Yang Yuwei 2,c
Advanced Materals Research Onlne: 03-06-3 ISSN: 66-8985, Vol. 705, pp 40-44 do:0.408/www.scentfc.net/amr.705.40 03 Trans Tech Publcatons, Swtzerland Fnte Element Analyss of Rubber Sealng Rng Reslence Behavor
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 informationTPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints
TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process
More informationStructured Grid Generation Via Constraint on Displacement of Internal Nodes
Internatonal Journal of Basc & Appled Scences IJBAS-IJENS Vol: 11 No: 4 79 Structured Grd Generaton Va Constrant on Dsplacement of Internal Nodes Al Ashrafzadeh, Razeh Jalalabad Abstract Structured grd
More informationComputer Animation and Visualisation. Lecture 4. Rigging / Skinning
Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume
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 informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationAPPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA
RFr"W/FZD JAN 2 4 1995 OST control # 1385 John J Q U ~ M Argonne Natonal Laboratory Argonne, L 60439 Tel: 708-252-5357, Fax: 708-252-3 611 APPLCATON OF A COMPUTATONALLY EFFCENT GEOSTATSTCAL APPROACH TO
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationProper Choice of Data Used for the Estimation of Datum Transformation Parameters
Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and
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 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 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 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 informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationSENSITIVITY ANALYSIS WITH UNSTRUCTURED FREE MESH GENERATORS IN 2-D AND 3-D SHAPE OPTIMIZATION.
SENSITIVITY ANALYSIS WITH UNSTRUCTURED FREE MESH GENERATORS IN 2-D AND 3-D SHAPE OPTIMIZATION. P. Duysnx, W.H. Zhang, C. Fleury. Aerospace Laboratory, LTAS, Unversty of Lège B-4000 LIEGE, BELGIUM. ABSTRACT.
More informationEECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science
EECS 730 Introducton to Bonformatcs Sequence Algnment Luke Huan Electrcal Engneerng and Computer Scence http://people.eecs.ku.edu/~huan/ HMM Π s a set of states Transton Probabltes a kl Pr( l 1 k Probablty
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 informationMeta-heuristics for Multidimensional Knapsack Problems
2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,
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 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 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 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 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 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 informationDistance Calculation from Single Optical Image
17 Internatonal Conference on Mathematcs, Modellng and Smulaton Technologes and Applcatons (MMSTA 17) ISBN: 978-1-6595-53-8 Dstance Calculaton from Sngle Optcal Image Xao-yng DUAN 1,, Yang-je WEI 1,,*
More informationHybrid Non-Blind Color Image Watermarking
Hybrd Non-Blnd Color Image Watermarkng Ms C.N.Sujatha 1, Dr. P. Satyanarayana 2 1 Assocate Professor, Dept. of ECE, SNIST, Yamnampet, Ghatkesar Hyderabad-501301, Telangana 2 Professor, Dept. of ECE, AITS,
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 informationSteps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
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 informationOn the Efficiency of Swap-Based Clustering
On the Effcency of Swap-Based Clusterng Pas Fränt and Oll Vrmaok Department of Computer Scence, Unversty of Joensuu, Fnland {frant, ovrma}@cs.oensuu.f Abstract. Random swap-based clusterng s very smple
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 informationFitting: Deformable contours April 26 th, 2018
4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.
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 informationBioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.
[Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented
More informationDesign of Structure Optimization with APDL
Desgn of Structure Optmzaton wth APDL Yanyun School of Cvl Engneerng and Archtecture, East Chna Jaotong Unversty Nanchang 330013 Chna Abstract In ths paper, the desgn process of structure optmzaton wth
More information3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method
NICOGRAPH Internatonal 2012, pp. 114-119 3D Vrtual Eyeglass Frames Modelng from Multple Camera Image Data Based on the GFFD Deformaton Method Norak Tamura, Somsangouane Sngthemphone and Katsuhro Ktama
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
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 informationUnsupervised Learning
Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and
More informationMOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS XUNYU PAN
MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS by XUNYU PAN (Under the Drecton of Suchendra M. Bhandarkar) ABSTRACT In modern tmes, more and more
More informationLecture 4: Principal components
/3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationClustering Algorithm of Similarity Segmentation based on Point Sorting
Internatonal onference on Logstcs Engneerng, Management and omputer Scence (LEMS 2015) lusterng Algorthm of Smlarty Segmentaton based on Pont Sortng Hanbng L, Yan Wang*, Lan Huang, Mngda L, Yng Sun, Hanyuan
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
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 informationApplication of Improved Fish Swarm Algorithm in Cloud Computing Resource Scheduling
, pp.40-45 http://dx.do.org/10.14257/astl.2017.143.08 Applcaton of Improved Fsh Swarm Algorthm n Cloud Computng Resource Schedulng Yu Lu, Fangtao Lu School of Informaton Engneerng, Chongqng Vocatonal Insttute
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 informationPerformance Evaluation of Information Retrieval Systems
Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence
More informationA fast algorithm for color image segmentation
Unersty of Wollongong Research Onlne Faculty of Informatcs - Papers (Arche) Faculty of Engneerng and Informaton Scences 006 A fast algorthm for color mage segmentaton L. Dong Unersty of Wollongong, lju@uow.edu.au
More informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
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 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 informationA Clustering Algorithm for Chinese Adjectives and Nouns 1
Clusterng lgorthm for Chnese dectves and ouns Yang Wen, Chunfa Yuan, Changnng Huang 2 State Key aboratory of Intellgent Technology and System Deptartment of Computer Scence & Technology, Tsnghua Unversty,
More informationEnhanced Advancing Front Technique with Extension Cases for Initial Triangular Mesh Generation
, July 6-8, 2011, London, U.K. Enhanced Advancng Front Technque wth Extenson Cases for Intal Trangular Mesh Generaton Z. Abal Abas and S. Salleh Abstract Durng the element creaton procedure of ntal mesh
More informationRepeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits
Repeater Inserton for Two-Termnal Nets n Three-Dmensonal Integrated Crcuts Hu Xu, Vasls F. Pavlds, and Govann De Mchel LSI - EPFL, CH-5, Swtzerland, {hu.xu,vasleos.pavlds,govann.demchel}@epfl.ch Abstract.
More informationOverview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION
Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup
More informationStitching of off-axis sub-aperture null measurements of an aspheric surface
Sttchng of off-axs sub-aperture null measurements of an aspherc surface Chunyu Zhao* and James H. Burge College of optcal Scences The Unversty of Arzona 1630 E. Unversty Blvd. Tucson, AZ 85721 ABSTRACT
More informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationAn Improved Image Segmentation Algorithm Based on the Otsu Method
3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,
More informationUsing Fuzzy Logic to Enhance the Large Size Remote Sensing Images
Internatonal Journal of Informaton and Electroncs Engneerng Vol. 5 No. 6 November 015 Usng Fuzzy Logc to Enhance the Large Sze Remote Sensng Images Trung Nguyen Tu Huy Ngo Hoang and Thoa Vu Van Abstract
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 informationBiostatistics 615/815
The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts
More informationAvailable online at ScienceDirect. Procedia Environmental Sciences 26 (2015 )
Avalable onlne at www.scencedrect.com ScenceDrect Proceda Envronmental Scences 26 (2015 ) 109 114 Spatal Statstcs 2015: Emergng Patterns Calbratng a Geographcally Weghted Regresson Model wth Parameter-Specfc
More informationRelated-Mode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
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 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 informationIMPROVING AND EXTENDING THE INFORMATION ON PRINCIPAL COMPONENT ANALYSIS FOR LOCAL NEIGHBORHOODS IN 3D POINT CLOUDS
IMPROVING AND EXTENDING THE INFORMATION ON PRINCIPAL COMPONENT ANALYSIS FOR LOCAL NEIGHBORHOODS IN 3D POINT CLOUDS Davd Belton Cooperatve Research Centre for Spatal Informaton (CRC-SI) The Insttute for
More information