3D Mesh Simplification for Deformable Human Body Mesh Using Deformation Saliency
|
|
- Lillian Hawkins
- 6 years ago
- Views:
Transcription
1 3D Mesh Smplfcaton for Deformable Human Body Mesh Usng Deformaton Salency Tanhao ZHAO R301, SHB, CUHK Shatn, N.T , Hong Kong Kng Ng NGAN R304, SHB, CUHK Shatn, N.T , Hong Kong Songnan LI R301, SHB, CUHK Shatn, N.T , Hong Kong ABSTRACT 3D mesh of human body s the foundaton of many hot research topcs, such as 3D body pose trackng. In ths topc, the deformaton of the human body mesh has to be taken nto account because of varous poses of the human body. Consderng the tme cost of the body deformaton, however, t s mpractcal to adopt a hgh resoluton body mesh generated from scannng systems for the real-tme trackng. Mesh smplfcaton s a soluton to reduce the sze of body meshes and accelerate the deformaton process. In ths paper, we propose a mesh smplfcaton algorthm usng deformaton salency for such deformable human body meshes. Ths algorthm s based on quadrc edge contracton. The deformaton salency s computed from a set of meshes wth varous poses. Wth ths salency, our algorthm can smplfy the 3D mesh non-unformly. Experment shows that usng our algorthm can mprove the accuracy of body pose smulaton n the smplfed resoluton compared to usng classcal quadrc edge contracton methods. Keywords Mesh smplfcaton, Deformable human body mesh, Deformaton salency. 1 INTRODUCTION Nowadays, 3D human body trackng s a hot research topc [Bog15, Baa13, We12, Gan10]. In ths topc, 3D body mesh s a basc structure. Generally, the nput of 3D body trackng s a sequence of depth mages captured by depth cameras. A body mesh n an ntal pose s selected as a template mesh. The template mesh s deformed to dfferent poses accordng to the real-tme nput frames. The body mesh s defned as the combnaton of a pont cloud and a set of trangulated faces. The faces cover all the ponts and there s no overlay between any two faces. Typcally the 3D mesh s obtaned from a multple depth-camera scannng system or a laser scannng system. The mesh generated by these scannng systems s n very hgh resoluton, contanng tens of thousands of vertces and faces, such as the CAESAR dataset. Nevertheless, 3D human body trackng s requred to be real-tme, so the body mesh n such hgh resoluton s not sutable for the real-tme trackng. Reducng the mesh resoluton,.e., the number of vertces and faces of the mesh s necessary. Permsson to make dgtal or hard copes of all or part of ths work for personal or classroom use s granted wthout fee provded that copes are not made or dstrbuted for proft or commercal advantage and that copes bear ths notce and the full ctaton on the frst page. To copy otherwse, or republsh, to post on servers or to redstrbute to lsts, requres pror specfc permsson and/or a fee. In ths paper, we focus on the mesh smplfcaton for such deformable human body object. We adopt the deformable human body model proposed by [Ang05]. The body meshes of SCAPE model are from the CAESAR dataset. The mesh standng n the "A" pose (shown n Fg.1) s selected as the template mesh and other meshes contan varous poses of the same person. All the meshes have the same number of vertces, whch have been regstered. In dfferent meshes, the topologes of trangulated faces are also the same. The human body s parttoned nto 16 parts, contanng head, chest, torso, arms, hands, legs and feet. The moton model of SCAPE descrbes two knds of deformatons of human bodes: the rgd transformaton and non-rgd deformaton. The rgd transformaton matrces show the global transformaton of an ntegral body part. For all the vertces n the same body part, ther rgd transformaton matrces of a certan pose are the same. The non-rgd deformaton matrces ndcate the change of muscle, skn and lgament n dfferent poses. These matrces are unque for each face. Apparently, there are much more non-rgd deformatons at jonts or muscular regons than other body regons. Therefore, n smplfcaton more vertces n these specal regons should be preserved to smulate the non-rgd deformaton more accurately. However, there s a drawback of the tradtonal mesh smplfcaton algorthms when they are appled to such deformable meshes: they always smplfy a 3D mesh
2 unformly or based on geometrc features, whch means that more vertces wll be kept n some geometry-salent regons, lke fngers and face of the human. Ths may lead to very few vertces remanng n the hghly nonrgd deformng regons. Hence, our purpose s to dstngush the hghly non-rgd deformng regons, and keep more vertces n these regons when smplfyng the body mesh. Based on the quadrc edge contracton (Qslm) [Gar97], we developed a mesh smplfcaton algorthm guded by deformaton salency. In our algorthm, we compute the deformaton salency for every vertex n the template mesh from the SCAPE pose database. Besdes the deformaton salency, we also ntroduce a dstance balancng tem to avod the over-contracton. Our method can smplfy meshes regon-specfcally accordng to the non-rgd deformaton levels. Expermental result shows that usng our smplfcaton method, the deformed result s more accurate than that usng the Qslm. Ths paper s organzed as followng. Secton 2 ntroduces the related work. Secton 3 dscusses our methodology. Secton 4 analyzes expermental results and compares the proposed method wth the pror studes. Concluson s drawn n Secton 5. 2 RELATED WORK Mesh smplfcaton ams to reduce the number of vertces of a 3D mesh, meanwhle preservng the shape of the mesh as accurately as possble. To ths end, the Quadrc Edge Collapse Decmaton (Qslm) was proposed by [Gar97]. In ther paper, each vertex of the mesh was assocated wth a quadrc error matrx, whch was defned as the squared dstances from ths vertex to the planes of ts adjacent trangulated faces. Every edge had a contracton cost based on ts potental contracton-target vertex and the quadrc error matrces of ts two endponts. Iteratvely the edges wth the mnmum contracton costs were contracted to the optmal target vertex whch could mnmze the contracton costs. The contracton costs for all related vertces would be updated n each teraton. One trend to mprove the mesh smplfcaton method s to reduce the runnng tme. Usng GPU s a common way to speed up the computaton. [Sho13] proposed a CPU-GPU combned algorthm, whch has the lowest computatonal cost compared to all the other methods just runnng on CPU. Some methods lke [Cam13] consdered both accuracy and smplcty to obtan the optmal smplfcaton result. Another multlevel refnement method was proposed n [Mor14], whch combned a Laplacan flow to the hgh resoluton mesh. Ths method can locate the most approprate regons to be contracted n dfferent refnement levels, whch took nto account both accuracy and speed. Another trend to mprove the smplfcaton s to keep more detals. Mesh features are used wdely n the related work. More vertces n the regons wth promnent features wll be preserved. For example, mesh curvature s a common feature used n the pror studes [All03, Lee05, Wan11, Yao15]. [All03] ntroduced curvature drectons to represent the ntrnsc ansotropy of the mesh geometry. In [Lee05], mesh feature was defned as a center-surround operator on Gaussan-weghted mean curvatures. In [Wan11], by measurng the curvature, the authors proposed a method to perform coarse smplfcaton n flat regons and fne smplfcaton near creases and corners respectvely. [Yao15] adopted the dscrete curvature to modfy the Qslm method. Besdes curvature, there are many other salences used for mesh smplfcaton. [Tol08] ntroduced acceleraton and deceleraton of vertces as salency for smplfcaton of dynamc meshes. [Zha12] dentfed vsually mportant regons by ponts samplng method to keep the mesh salency. [Pey14] reduced the number of vertces by Posson dsk samplng based on features such as sharp edges or corners, and re-meshed vertces along the detected feature lnes. In [Pel14], Pellern et al. appled Centrodal Vorono optmzaton to smplfy the mesh and merged features for the mesh wth complex contacts. A B-rep feature-based model was proposed n [Km14]. [Ng14] developed a method called half-edge collapsed scheme. They dentfed vald decmated edges by the length of the edges and the dfference between every two adjacent faces. Another dstnctve method was proposed n [Van15], whch adopted outgong radance functons of the mesh surface as the mesh feature. In [Ďur15], shape dameter functon was adopted as mesh salency to extract skeleton, whch can also be used n mesh smplfcaton. 3 METHODOLOGY Our purpose s to smplfy the human body mesh whle preservng more vertces at jonts and other regons wth promnent non-rgd deformatons. Gven a set of meshes M of varous poses and a template mesh T of the SCAPE data set, we compute the deformaton salency along wth a balancng weght for each vertex. Then we teratvely contract a vald edge on the template mesh to generate a new mesh T n lower resoluton. The ndces of the preserved vertces are recorded. For the other meshes, the vertces wth the same ndces wll be kept, so that the topologes of the trangulated faces of these meshes are the same as that of the smplfed template mesh T. 3.1 Deformaton salency We defne the deformaton salency as the Eucldean dstance of the correspondng vertces between the
3 Fgure 2: The red edge denotes the edge wth the mnmum deformaton weght and contracton cost; t s contracted to a new vertex (the red pont) whch can mnmze the contracton cost; other related vertces are re-connected to the new vertex. Fgure 1: The heat maps of salency values on the template mesh. Red means the hghest value, and blue means the lowest value rgdly transformed template mesh and the mesh n the target pose, whch s also descrbed by the non-rgd deformaton n the SCAPE model. Frst we estmate the rgd transformaton between the template mesh T and each mesh M X of pose X n the pose dataset, whch means to calculate the ntegral rotaton matrx for each body part between mesh T and M X n the global coordnates. In the SCAPE database, vertces have been regstered across dfferent meshes and parttoned nto 16 body parts. For each body part k, the rotaton matrx and translaton vector are denoted as R k and t k, respectvely. To estmate R k and t k, we mnmze the followng energy functon: E trans f orm = argmn R k,t k v T,vM X part(k) R k v T +t k v M X 2 2 (1) In ths least square functon, v T s the th vertex n the mesh T and v M X s the th vertex n the mesh M X. By vectorzng R k and t k, Eq. (1) can be turned nto a system of lnear equatons, whch can be solved analytcally. Wth the rgd transformaton, we can transform each body part of the template mesh va ths equaton: v T X = R k v T +t k,v part(k) (2) where T X s the rgdly transformed template mesh correspondng to the mesh M X. After generatng the rgdly transformed meshes T X n all poses X, we calculate the Eucldean dstance error between every vertex of T X and ts correspondng vertex of M X. For each vertex, we add up ts dstance errors calculated from all the poses X. Then we normalze the total error and take t as the deformaton salency for each vertex. Fg.1 shows the salency values around the human body. The vertex wth hgh value of deformaton salency means there s promnent non-rgd deformaton, so n the smplfcaton ts possblty to be preserved should be larger than other vertces. As the Qslm algorthm llustrated [Gar97], every vertex holds a quadrc matrx Q, whch represents the entre set of planes adjacent to ths vertex. For an edge (v 1,v 2 ), the contracton cost assocated to ts potental target vertex v t s defned as: E contract = v T t (Q 1 + Q 2 )v t (3) In ths equaton, Q 1 and Q 2 are the quadrc matrces of v 1 and v 2, respectvely. v t s the optmal target vertex whch can mnmze the contracton cost E contract. The contracton cost ndcates the sum of squared dstances from v t to the plane set represented by Q 1 and Q 2. Usng a couple of weghts w 1, w 2 to represent the deformaton salences of v 1, v 2, we update the edge contracton cost as: E contract = w 1 + w 2 2 v T t (Q 1 + Q 2 )v t (4) The deformaton weght of an edge s defned as the average weght of ts two attached endponts. However, an extreme result s that too many edges may be contracted n the regons where vertces have low deformaton weghts. In ths case, very long edges may be generated; meanwhle few edges are contracted n the regons where vertces have hgh deformaton weghts. To solve ths dlemma, we ntroduce a balancng weght for each edge, whch s equal to the length of the edge (v 1,v 2 ). The effect of ths balancng weght s to reduce the contractng prorty of long edges. By denotng ths balancng weght as d, the edge contracton cost s rewrtten as: E contract = d(w 1 + w 2 ) 2 v T t (Q 1 + Q 2 )v t (5) Iteratvely, the edge wth the least contracton cost s contracted, generatng the smplfed template mesh T. Fg.2 llustrates edge contracton n a sngle teraton, and Fg.3 compares the smplfed results wth and wthout the balancng tem.
4 Fgure 3: From left to rght: front sde of the smplfed template mesh wth and wthout balancng tem; back sde of the smplfed template mesh wth and wthout balancng tem. Edges of the meshes are shown explctly. Wth the balancng tem, the varance of edge length s 1.53e-04; wthout t, the varance of edge length s 3.08e-02. Ths proves that the balancng tem can prevent too long edges occurrng effectvely. 3.2 Greedy least dstance mappng Accordng to the SCAPE, to buld the body deformaton model, vertex parttons and face topologes of all the meshes should be the same, and all the meshes should be regstered. So we use a greedy least dstance mappng from T to T to keep vertces regstered across dfferent smplfed meshes. Intally, we defne the smplfed canddates as all vertces of T and the orgnal canddates as all vertces of T. Iteratvely, between the two canddates we fnd the mappng vertex par wth the least Eucldean dstance, record the vertex ndex of ths par, and take them out from the canddates. All vertces of T are mapped to dstnctve vertces of T. Wth the mappng record, we can smplfy other meshes va preservng the vertces wth the same ndces as n the record. As a consequence, all smplfed meshes stll contan the regstered vertces and the same body partton. 4 EXPERIMENTS We conducted the experments on a subset of the SCAPE database. We chose 70 body meshes n dfferent poses of the same person as the pose dataset. Each of them has vertces and trangulated faces. In the 70 meshes, the frst mesh standng n the "A" pose was selected as the template mesh. Based on the pose set, deformaton salency was computed. Wth our method and the compared methods, the template mesh and other meshes were smplfed. The number of faces and vertces were reduced from to 5000 and from to 2500, respectvely. Then the template mesh was deformed to other poses. The errors between the deformed template mesh and the mesh of the target pose were computed to evaluate the proposed methods. Fgure 4: The area heat maps of the smplfed template mesh usng our method (2500 vertces, 5000 faces). Fgure 5: The area heat maps of the smplfed template mesh usng Qslm (2500 vertces, 5000 faces).
5 4.1 Area heat map of the smplfed result The vsualzed comparson between the results of the proposed method and the Qslm method s drawn n Fg.4 and Fg.5, whch are referred to as the heat maps of the area of the trangulated faces. In both fgures, the faces are colorzed accordng to the sze of ther area: smaller faces have warmer color, whle larger faces have cooler color. That s to say, red regons have the hghest vertex densty, and blue regons have the lowest vertex densty. Yellow and green regons have medan vertex densty. By observng the two heat maps, we can fnd that vertex denstes are qute dfferent n the same regon across the results produced by dfferent methods. We know the head, hands, and feet typcally have more geometrc detals. Therefore, the Qslm method preserves more vertces n these regons. On the contrary, t s clear that we preserve more vertces at shoulders, knees, elbows, even n chest and thghs; meanwhle we preserve fewer vertces n the regons lke hands, head and feet. Ths means that we have more vertces to smulate the nonrgd deformaton at jonts and muscular regons. 4.2 Deformaton errors In ths secton, we measure the deformaton errors between the deformed template mesh and the mesh of the target pose. Less deformaton error means that the smplfcaton method s more sutable for such deformable human body mesh to change the body pose. The detal of the body pose deformaton can be referred to [Ang05]. Besdes the 70 meshes smplfed by our method and the Qslm, we also smplfy 10 meshes usng the method provded n the open-source CGAL lbrary for comparson. The CGAL ( s a wdely-used lbrary of geometry algorthms. We ntroduce two crtera to measure the deformaton errors: 1. Vertex-to-face error (v2f) The vertex-to-face error measures the average squared dstance between the deformed template mesh and the smplfed mesh of the target pose, from a vertex to the closest face. It s also adopted by the Qslm method [Gar97]. The vertex-to-face error E = (M,M n ) between the deformed template M and ground-truth M n s defned as: E = 1 X + X n ( ) d1(v,m 2 n ) + d1(v,m 2 ) v X v X n (6) where X, X n are the pont clouds n the mesh M and M n respectvely. The dstance functon d 1 (v,m) = mn p M v p s the mnmum Eucldean dstance from the vertex v to the closest face p on the mesh M. The measurement unt of ths error s meter 2. Method v2f error v2v error Ours(70 poses) 1.08e e-05 Qslm(70 poses) 1.12e e-05 CGAL(10 poses) 1.10e e-05 Table 1: The average deformaton errors of our method, Qslm and CGAL. 2. Vertex-to-vertex error (v2v) The vertex-to-vertex error measures the average squared dstance from a vertex of the deformed template mesh to the closest vertex of the smplfed mesh of the target pose. Ths metrc s adopted n [Bog15]. Based on the prevous notatons, the vertex-to-vertex error E = (M,M n ) s defned as: E = 1 X v X d 2 2(v,M n ) (7) The dstance functon d 2 (v,m) = mn u M v u s the mnmum Eucldean dstance from the vertex v to the closest vertex u on the mesh M. The measurement unt s also meter 2. The comparson results between our method and other methods are shown n Table 1. The average errors show that our method can reduce the deformaton errors n both metrcs. The reducton of the v2v error s more sgnfcant, whch approaches about 8 percent compared to the Qslm. The results ndcate that usng our method, the smplfed human mesh can be deformed more accurately than usng the Qslm and CGAL. Fg.6 shows some smplfed results of dfferent denttes wth the same pose, and Fg.7 shows the pose deformaton results after smplfcaton for several poses. 5 CONCLUSION In ths paper, we propose a mesh smplfcaton method usng deformaton salency for 3D human pose deformng. Based on SCAPE dataset, we compute the vertex dstance error caused by non-rgd deformaton for each vertex as the deformaton salency. In the template body mesh we contract the edges wth the lowest salency n pror. We also add a balancng weght to avod generatng too long edges caused by over-contracton. Our method shows better performance of body pose deformaton compared to the Qslm and CGAL algorthms. Smlarly, our method can be also appled to smplfyng the meshes of other deformable objects for pose deformaton. 6 REFERENCES [Bog15] Bogo F, Black M J, Loper M, et al. Detaled Full-Body Reconstructons of Movng People from Monocular RGB-D Sequences. Proceedngs of the IEEE Internatonal Conference on Computer Vson, pp , 2015.
6 Fgure 6: The frst row shows several examples of the hgh resoluton meshes from the SCAPE database (12500 vertces and faces); the second row shows our smplfed meshes (2500 vertces and 5000 faces). [Baa13] Baak A, Muller M, Bharaj G, et al. A datadrven approach for real-tme full body pose reconstructon from a depth camera. Consumer Depth Cameras for Computer Vson, pp.71-98, [We12] We X, Zhang P, Cha J. Accurate realtme full-body moton capture usng a sngle depth camera. ACM Trans. Graph., 31(6), pp.188, [Gan10] Ganapath V, Plagemann C, Koller D, et al. Real tme moton capture usng a sngle tmeof-flght camera. Computer Vson and Pattern Recognton, pp , [Ang05] Anguelov D, Srnvasan P, Koller D, et al. SCAPE: shape completon and anmaton of people. ACM Trans. Graph., 24(3), pp , [Gar97] Garland M, Heckbert P S. Surface smplfcaton usng quadrc error metrcs. Proceedngs of the 24th annual conference on Computer graphcs and nteractve technques, pp , [Sho13] Shontz S M, Nstor D M. CPU-GPU algorthms for trangular surface mesh smplfcaton. Proceedngs of the 21st nternatonal meshng roundtable, pp , [Cam13] Campomanes-Alvarez B R, Cordon O, Damas S. Evolutonary mult-objectve optmzaton for mesh smplfcaton of 3D open models. 20(4), pp , [Mor14] Morg S, Rucc M. Multlevel mesh smplfcaton. The Vsual Computer, 30(5), pp , [All03] Allez P, Cohen-Stener D, Devllers O, et al. Ansotropc polygonal remeshng. ACM Trans. Graph., 22(3), pp , [Lee05] Lee C H, Varshney A, Jacobs D W. Mesh salency. ACM Trans. Graph., 24(3), pp , [Wan11] Wang J, Wang L, L J, et al. A feature preserved mesh smplfcaton algorthm. Journal of Engneerng and Computer Innovatons, 6, pp , [Yao15] Yao L, Huang S, Xu H, et al. Quadratc Error Metrc Mesh Smplfcaton Algorthm Based on Dscrete Curvature. Mathematcal Problems n Engneerng, [Tol08] Tolgay A. Anmated mesh smplfcaton based on salency metrcs. bilkent unversty, [Pey14] Peyrot J L, Payan F, Antonn M. Alasng-free smplfcaton of surface meshes. Internatonal Conference on Image Processng, pp , [Pel14] Pellern J, Levy B, Caumon G, et al. Automatc surface remeshng of 3D structural models at specfed resoluton: A method based on Vorono dagrams. Computers and Geoscences, 62, pp , [Km14] Km B C, Mun D. Feature-based smplfcaton of boundary representaton models usng sequental teratve volume decomposton. Computers and Graphcs, 38, pp , [Ng14] Ng K W, Low Z W. Smplfcaton of 3D Trangular Mesh for Level of Detal Computaton. Computer Graphcs, Imagng and Vsualzaton, pp.11-16, [Van15] Vanhoey K, Sauvage B, Kraemer P, et al. Smplfcaton of meshes wth dgtzed radance. The Vsual Computer, 31(6-8), pp , [Zha12] Zhao Y, Lu Y, Song R, et al. A salency detecton based method for 3d surface smplfcaton. Acoustcs, Speech and Sgnal Processng, pp , [Ďur15] Ďurkovč R, Madaras M. Controllable Skeleton-Sheets Representaton Va Shape Dameter Functon. Mathematcal Progress n Expressve Image Synthess II, pp.79-90, 2015.
7 Fgure 7: The frst row shows some orgnal meshes of dfferent target poses; the second row shows the smplfed results of these target poses; the thrd row shows the deformed results from the smplfed template mesh to these target poses.
Computer 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 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 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 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 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 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 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 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 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 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 informationHigh-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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationEcient Computation of the Most Probable Motion from Fuzzy. Moshe Ben-Ezra Shmuel Peleg Michael Werman. The Hebrew University of Jerusalem
Ecent Computaton of the Most Probable Moton from Fuzzy Correspondences Moshe Ben-Ezra Shmuel Peleg Mchael Werman Insttute of Computer Scence The Hebrew Unversty of Jerusalem 91904 Jerusalem, Israel Emal:
More informationVectorization of Image Outlines Using Rational Spline and Genetic Algorithm
01 Internatonal Conference on Image, Vson and Computng (ICIVC 01) IPCSIT vol. 50 (01) (01) IACSIT Press, Sngapore DOI: 10.776/IPCSIT.01.V50.4 Vectorzaton of Image Outlnes Usng Ratonal Splne and Genetc
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 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 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 informationCalibration of an Articulated Camera System
Calbraton of an Artculated Camera System CHEN Junzhou and Kn Hong WONG Department of Computer Scence and Engneerng The Chnese Unversty of Hong Kong {jzchen, khwong}@cse.cuhk.edu.hk Abstract Multple Camera
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 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 informationReal-time Motion Capture System Using One Video Camera Based on Color and Edge Distribution
Real-tme Moton Capture System Usng One Vdeo Camera Based on Color and Edge Dstrbuton YOSHIAKI AKAZAWA, YOSHIHIRO OKADA, AND KOICHI NIIJIMA Graduate School of Informaton Scence and Electrcal Engneerng,
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 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 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 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 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 informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More informationOctree Subdivision Using Coplanar Criterion for Hierarchical Point Simplification
Octree Subdvson Usng Coplanar Crteron for Herarchcal Pont Smplfcaton Pa-Feng Lee 1, Chen-Hsng Chang 1, Jun-Lng Tseng 2, Bn-Shyan Jong 3, and Tsong-Wuu Ln 4 1 Dept. of Electronc Engneerng, Chung Yuan Chrstan
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 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 informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationMultiresolution Modeling for Real-Time Facial Animation
Multresoluton Modelng for Real-me Facal Anmaton Soo-Kyun Km, Jong-In Cho and Chang-Hun Km Department of Computer Scence and Engneerng, Korea Unersty {ncesk, cho, chkm}@cgr.korea.ac.kr Fgure 1. Same expresson
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 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 informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationReal-time Joint Tracking of a Hand Manipulating an Object from RGB-D Input
Real-tme Jont Tracng of a Hand Manpulatng an Object from RGB-D Input Srnath Srdhar 1 Franzsa Mueller 1 Mchael Zollhöfer 1 Dan Casas 1 Antt Oulasvrta 2 Chrstan Theobalt 1 1 Max Planc Insttute for Informatcs
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
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 informationCalibration of an Articulated Camera System with Scale Factor Estimation
Calbraton of an Artculated Camera System wth Scale Factor Estmaton CHEN Junzhou, Kn Hong WONG arxv:.47v [cs.cv] 7 Oct Abstract Multple Camera Systems (MCS) have been wdely used n many vson applcatons and
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 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 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 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 informationMulti-stable Perception. Necker Cube
Mult-stable Percepton Necker Cube Spnnng dancer lluson, Nobuuk Kaahara Fttng and Algnment Computer Vson Szelsk 6.1 James Has Acknowledgment: Man sldes from Derek Hoem, Lana Lazebnk, and Grauman&Lebe 2008
More informationCalibration of an Articulated Camera System
Calbraton of an Artculated Camera System CHEN Junzhou and Kn Hong WONG Department of Computer Scence and Engneerng The Chnese Unversty of Hong Kong {jzchen, khwong}@cse.cuhk.edu.hk Abstract Multple Camera
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 informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationAngle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga
Angle-Independent 3D Reconstructon J Zhang Mrelle Boutn Danel Alaga Goal: Structure from Moton To reconstruct the 3D geometry of a scene from a set of pctures (e.g. a move of the scene pont reconstructon
More informationLearning-Based Top-N Selection Query Evaluation over Relational Databases
Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **
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 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 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 informationTHE PULL-PUSH ALGORITHM REVISITED
THE PULL-PUSH ALGORITHM REVISITED Improvements, Computaton of Pont Denstes, and GPU Implementaton Martn Kraus Computer Graphcs & Vsualzaton Group, Technsche Unverstät München, Boltzmannstraße 3, 85748
More informationMulti-view 3D Position Estimation of Sports Players
Mult-vew 3D Poston Estmaton of Sports Players Robbe Vos and Wlle Brnk Appled Mathematcs Department of Mathematcal Scences Unversty of Stellenbosch, South Afrca Emal: vosrobbe@gmal.com Abstract The problem
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 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 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 information3D Face Reconstruction With Local Feature Refinement. Abstract
, pp.6-74 http://dx.do.org/0.457/jmue.04.9.8.06 3D Face Reconstructon Wth Local Feature Refnement Rudy Adpranata, Kartka Gunad and Wendy Gunawan 3, formatcs Department, Petra Chrstan Unversty, Surabaya,
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 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 informationDetection of an Object by using Principal Component Analysis
Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,
More informationResolving Ambiguity in Depth Extraction for Motion Capture using Genetic Algorithm
Resolvng Ambguty n Depth Extracton for Moton Capture usng Genetc Algorthm Yn Yee Wa, Ch Kn Chow, Tong Lee Computer Vson and Image Processng Laboratory Dept. of Electronc Engneerng The Chnese Unversty of
More information3D Rigid Facial Motion Estimation from Disparity Maps
3D Rgd Facal Moton Estmaton from Dsparty Maps N. Pérez de la Blanca 1, J.M. Fuertes 2, and M. Lucena 2 1 Department of Computer Scence and Artfcal Intellgence ETSII. Unversty of Granada, 1871 Granada,
More informationLecture #15 Lecture Notes
Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal
More informationCorner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity
Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent
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 informationFeature-Area Optimization: A Novel SAR Image Registration Method
Feature-Area Optmzaton: A Novel SAR Image Regstraton Method Fuqang Lu, Fukun B, Lang Chen, Hao Sh and We Lu Abstract Ths letter proposes a synthetc aperture radar (SAR) mage regstraton method named Feature-Area
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 information3D Face Reconstruction With Local Feature Refinement
ternatonal Journal of Multmeda and Ubqutous Engneerng Vol.9, No.8 (014), pp.59-7 http://dx.do.org/10.1457/jmue.014.9.8.06 3D Face Reconstructon Wth Local Feature Refnement Rudy Adpranata 1, Kartka Gunad
More informationSIMULTANEOUS REGISTRATION OF MULTIPLE VIEWS OF A 3D OBJECT
SIMULTANEOUS REGISTRATION OF MULTIPLE VIEWS OF A 3D OBJECT Helmut Pottmann a, Stefan Leopoldseder a, Mchael Hofer a a Insttute of Geometry, Venna Unversty of Technology, Wedner Hauptstr. 8 10, A 1040 Wen,
More informationREFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water.
Purpose Theory REFRACTION a. To study the refracton of lght from plane surfaces. b. To determne the ndex of refracton for Acrylc and Water. When a ray of lght passes from one medum nto another one of dfferent
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 informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More informationChapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward
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 informationClassifier Swarms for Human Detection in Infrared Imagery
Classfer Swarms for Human Detecton n Infrared Imagery Yur Owechko, Swarup Medasan, and Narayan Srnvasa HRL Laboratores, LLC 3011 Malbu Canyon Road, Malbu, CA 90265 {owechko, smedasan, nsrnvasa}@hrl.com
More informationA 3D Human Skeletonization Algorithm for a Single Monocular Camera Based on Spatial Temporal Discrete Shadow Integration
appled scences Artcle A 3D Human Skeletonzaton Algorthm for a Sngle Monocular Camera Based on Spatal Temporal Dscrete Shadow Integraton Je Hou *, Baolong Guo, Wangpeng He and Jnfu Wu School of Aerospace
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 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 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 informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationA SYSTOLIC APPROACH TO LOOP PARTITIONING AND MAPPING INTO FIXED SIZE DISTRIBUTED MEMORY ARCHITECTURES
A SYSOLIC APPROACH O LOOP PARIIONING AND MAPPING INO FIXED SIZE DISRIBUED MEMORY ARCHIECURES Ioanns Drosts, Nektaros Kozrs, George Papakonstantnou and Panayots sanakas Natonal echncal Unversty of Athens
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 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 informationLECTURE : MANIFOLD LEARNING
LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors
More informationArticulated Motion Capture from Visual Hulls in High Dimensional Configuration Spaces
Semnar Presentaton June 18th, 010 Artculated Moton Capture from Vsual Hulls n Hgh Dmensonal Confguraton Spaces Azawa Yamasak Lab D, 48-09741, 羅衛蘭 ABSTRACT In ths paper, we propose a novel approach for
More informationMachine Learning. Topic 6: Clustering
Machne Learnng Topc 6: lusterng lusterng Groupng data nto (hopefully useful) sets. Thngs on the left Thngs on the rght Applcatons of lusterng Hypothess Generaton lusters mght suggest natural groups. Hypothess
More informationCHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION
24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and
More information