3-D Morphing by Direct Mapping between Mesh Models Using Self-organizing Deformable Model
|
|
- Andrea McBride
- 5 years ago
- Views:
Transcription
1 3-D Morphing by Direct Mapping between Mesh Models Using Self-organizing Deformable Model Shun Matsui Ken ichi Morooka Hiroshi Nagahashi Tokyo Institute of Technology Kyushu University Tokyo Institute of Technology Abstract This paper presents a new method for 3-D morphing between mesh models using a deformable model called SDM (Self-organizing Deformable Model). The SDM is a mesh model which deforms its shape by learning a target surface. Since the model doesn t depend on a specified shape, we can use various mesh models as SDMs. This enables us to use a SDM for making a correspondence between mesh models. It is also possible to define the correspondence based on their model features. We demonstrate some examples of SDM-based morphing. 1 Introduction Morphing is a key technique in computer animation. It is a process of transforming a given source shape (initial model) into another one (final model) smoothly. Compared with 2-D image morphing, 3-D morphing with 3-D shape deformation enables us to make interpolated images from various view-points and to generate good visual effects. Therefore, 3-D morphing is widely used in movies, games, virtual reality and so on. There are several ways to describe 3-D object models in CG and many morphing methods have been proposed for models in different descriptions[5]. Among them, a description by triangle meshes is often used because of the goodness of the expression for complex models. It is necessary to solve a corresponding problem and an interpolating problem for 3-D morphing between mesh models[1]. The former problem is to construct one-toone correspondences between mesh models which have different data structures. On the other hand, the latter problem is to make intermediate shapes for morphing. There are many methods for morphing between mesh models and most of them focus on the corresponding problem. In this paper, we also discuss the corresoponding problem between genus-0 mesh models. One major method for solving the corresoponding problem is to make a synthesis mesh with interpolating primitive region[2],[3]. It is to create one mesh model which have the data structure of two mesh models and whose vertices have several coordinates. In this case, the mesh fusion yields increasing mesh data. Also, it is difficult for a user to control it. Another major method is to make a correspondence by using low-resolusion mesh models and parameterize from an initial model to a target model[6],[12]. However, these methods require some kind of experience of making low-resolusion models. We proposed a new method for 3-D morphing based on a Self-organizing Deformable Model (SDM). The SDM is a mesh model which deforms its shape by learning a target surface. First, we use an initial model and a final model as two SDMs, respectively and we perform SDM-mappings of them onto a common surface defined as a target surface. Next, compared with the mapping results, we make a rough correspondence between them. Then, we use the resulting model as SDM and the final model as a target surface, respectively and perform a SDM-mapping again. After these processes, a new model we get is to be an approximate model of the final model which has the same topological information of the initial model. Consequently, we make one-to-one correspondence for each vertices of the initial model and the new model which have the same index and interpolate their coordinates to make their intermediate models. Additionally, it is important for 3-D morphing to be able to control the morphing according to structural features of models. A SDM-mapping realizes it by setting some constraints to the movement of the SDM s vertices. 2 Self-organizing Deformable Model 2.1 Notations A SDM is a mesh model which can deform its shape by learning a target surface[9]. The target surface should be represented as a set of vertices which have normal vectors defined at their neighborhood. Usually, we represent the target surface as a mesh model. In this paper, the SDM and the target surface are assumed to be genus-0 mesh models. By using notations adopted in [7], they are represnted as M = (P, K), where P is a set of the vertices positions p i with i = 1,..., N v and N v is the number of vertices of M. K is an abstract simplicical complex which contains all topological information of M. The complex K is composed of three types of subsets of simplices: a set K v of vertices v = {i} K v, a set K e of edges e = {i, j} K e, a set K f of faces f = {i, j, k} K f. p i represents a position of a vertex i K v. An edge e has two vertices i and j on its both ends and a triangle face f is composed of three vertices i, j and k. 2.2 SDM-Mapping A SDM-mapping changes the coordinates of vertices in P, while preserving its topological information in K. Given an SDM M S and a target surface M G, a topologypreserving mapping Φ by the SDM is formulated as Φ : M S = (P S, K S ) M (G S) = (P (G S), K S ). (1) Here, M (G S) is a resulting model which approximates the shape of the target surface M G and has the same topological information of the SDM M S. Generally, such a mapping is non-linear and nonunique. A SDMmapping realizes such a non-linear mapping by deforming its shape in terms of self-organizing map[4]. Particularly, we represent the relation between such a topologypreserving mapping Φ S G from M S onto M G and M (G S)
2 Initial Model Deformed Final Model Figure 1: Direct Mapping from an initial model to a final model. as M (G S) = Φ S G (M S ). (2) A SDM-mapping is composed of the following steps. [Algorithm 1] 1. Initialize a time parameter to t = Select a control point j K G v randomly. 3. Determine its winner vertex i K S v by the following criterion. i = arg min SD(i, j) (3) i K S v We define a signed distance SD(i, j) between i and j as SD(i, j) = n G j (ps i pg j ), (4) where n G j is a normal vector of j K G v. 4. For the winner vertex i K S v and its neighbors, adapt their positions according to the topological distance from i as p S i p S i + ɛ(t)λ(i i ) p S i, (5) where ɛ(t) is a learning rate which adapts the movement degree from p S i to p G j. λ(i i ) is called a neighborhood function which defines the degree of adaptation according to the topological distance between i and i. In our method, we defined them as ɛ(t) = ɛ s ( ɛ f ɛ s ) t T λ(i i ) = exp{ 1 2 ( L(i,i ) σ(t) )} σ(t) = σ s ( σ f σ s ) t T, (6) where L(i, i ) represents the shortest path between i and i. ɛ s (σ s ) and ɛ f (σ f ) are the initial value and the final value of ɛ(σ), respectively. p S i is the movement vector for each vertex i. 5. t t If t < T, go to the step 2. Otherwise go to the step For minimizing energy between M S and M G, we define the distance D(M S, M G ) between them as D(M S, M G ) = 1 3 i K S v E(i) Γ i Ω i, (8) where Γ i is a set of triangle patches f Kf S which include a vertex i Kv S and Ω i is a set of the control point j Kv G on M G corresponded to its closest vertex among all vertives of M S. E(i) is a energy function for i of SDM M S and it is defined as E(i) = {H(j, f)} 2, (9) j Ω i f Γ i where H(j, f) is a function which returns the distance between j Kv G and f Kf S. In the following steps, we minimize the distance D(M S, M G ). 8. For each vertex i K S v, calculate a position p S i by p S i = p S i + w(p G j p S i ); j Ω i, (10) where w is a step value which defines the degree of the movement from p S i to p G j. 9. For all positions calculated by (10), decide the next position p S i of the vertex i K S v as follows. p S i = arg min E(i) (11) p S i 10. If the distance D(M S, M G ) satisfies the following equation, finish the deformation. Otherwise, go to step 8. ξ is a threshold value. D(M S, M G ) < ξ (12) p S i = p G j ps i (7)
3 Initial Model step 1: step 2 Mediator Final Model step 2 step 3: Deformed step 1: Figure 2: Direct Mapping using a mediator model 3 Correspondence Problem between Mesh Models 3.1 Direct Mapping using only a SDM-mapping In our method, we can get a new model which has the same topological information of a given initial model and approximates a given final model by using a SDMmapping. Therefore, it seems available to perform a SDM-mapping using an initial model and a final model as a SDM and a target surface, respectively ( as shown in Fig.1). In this case, the user can estimate the SDMmapping result viscerally and it simplifies the user s control of the SDM-mapping discussed below. However, the method isn t applicable for mesh models which have complex shapes. Conseqently, we use another method for direct mapping between mesh models using a mediator model. We detail the method in the next section. 3.2 Direct Mapping using a Mediator Model Because of the complexity discussed in 3.1, we use a mediator model for direct mapping between mesh models (as shown in Fig.2). At first, an initial model and a final model are respectively mapped onto the same mediator model by using SDM-mappings. Next, we make a rough correspondence between the mapping results via the mediator model. Finally, we perform an additional SDM-mapping using the semi-approximated model and the final model as a SDM and a target surface, respectively. A process for making a correspondence between mesh models using a mediator model is composed of the following steps. [Algorithm 2] 1. Let M I, M F and M C be an initial, a final and a mediator model, respectively. M I and M F are SDMs and M C is a target surface. Then, perform the following SDM-mappings according to the algorithm 1. M (C I) = Φ I C (M I ) M (C F ) = Φ F C (M F ) (13) After this process, both M (C I) and M (C F ) approximate the shape of M C and have the same topological information as those of M I and M F, respectively. 2. For the vertex i K (C I) v, (i) Select the vertex j K v (C F ) which minimizes the distance d(i, j) as the corresponding vertex j for i j = arg min j d (i, j), (14) where d (i, j) is the Euclidian distance between p (C I) i P (C I) and p (C F ) j P (C F ). (ii) Assign the coordinates p F j PF of M F to the coordinates p (C I) i p (C I) i p F j (15) After transforming the coordinates, we get a semiapproximate model M (F I) of M F. 3. Let the defomed model M (F I) and M F be a SDM and a target surface, respectively. Perform a SDMmapping Φ (F I) F as follows. M (F I) = Φ (F I) F (M (F I) ) (16) Then, we get a new mesh model M (F I) which approximates the shape of M F and has the same topological information as that of M I. In step 2, the one to one correspondence between the vertices of M (C I) and M (C F ) is not obtained usually. Therefore, some vertices of M (F I) may have the same coordinates after the step 2. Such a condition doesn t preserve the topological information compared with M I. This leads a self-intersection in morphing and it is not desirable. Consequently, we get a new model M (F I) by performing Φ (F I) F. It involves the movement of the vertices of M (F I) depending on the topological distance
4 between them. Then, M (F I) becomes an mesh model approximating the shape of M F and has the same topological information as that of M I. 3.3 Control of SDM-mapping It is important for 3-D morphing to make a flexible correspondence. For example, making structural feature correspondences between models (eye to eye, nose to nose, etc) is desirable for 3-D face morphing. Therefore, it is neccesary to control the SDM-mapping according to user s purpose. A SDM-mapping realizes it by setting some constraints to the movement of the SDM s vertices. In particular, some vertices g n Kv S and corresponding control points h n Kv G are selected manually. Then, we get a set of pairs X as X = {(g 1, h 1 ), (g 2, h 2 ),..., (g N, h N )}, (17) (a) (b) (c) (d) (e) (f) where N is the number of pairs selected by user. Then, we modify the determination of the winner vertex in (3) as follows. { i = g n ; ( if j = h n ) arg min i K S v SD (i, j) ; ( otherwise ) (18) In our method, one can control the correspondence between mesh models by setting the constraints to the movement of the SDM s vertices. 3.4 Interpolating Problem Using the method represented in the previous section, we get a mesh model M (F I) which approximates a final model M F and has the same topological information as that of a initial model M I. We make the intermediate models for morphing animation by making the oneto-one correspondence between the vertices of M I and M (F I) which have the same indices. Let the vertex position of the intermediate model M M be p M i P M, it is represented as p M i = (1 f (t))p I i + f (t) p(f I) i (0 t 1). (19) A time function f (t) is a function which changes smoothly 0 f (t) 1. (g) (h) (i) Figure 3: Mesh Models used in our experiments; Top : mesh models used as an initial model (a) Rabbit, (b) Pig, (c) Armadillo; Midium : mesh models used as a final model (d) Balljoint, (e) Lion, (f) Santa; Bottom : mesh models used as a mediator model (g) Sphere,(h) Animal, (i) Cylinderman. 4.2 Direct Mapping between Mesh Models Fig.4 shows the results of the mapping from an initial model onto a final model. Normals of the initial models are mapped on them and their shapes approximate the final models, respectively. Thus, the initial models are mapped onto the target models while the topological information may be preserved. In our experiments, we used mediator models which have the same skeleton data structure with mesh models for the mappings of Pig Lion and of Armadillo Santa. One can make a correspondence easily by using such mediator models. 4 Experimental Results For examining the effectiveness of our method, we made some experiments. 4.1 Mesh Models Fig.3 shows some examples of mesh models used in our experiments. Table.1 and 2 show the specifications of mesh models and the combinations of the morphing, respectively. Three mesh models as mediators are shown in Fig.3 (g) (i) (a sphere, an approximated quadrupedal model and an approximated human model). We set the parameters in algorithm 1 as ɛ s = 0.5, ɛ f = 0.005, σ s = 3.0 and σ f = 0.1, respectively. 4.3 Morphing Table 1: Detail of mesh models. # vertex # patch Rabbit 6,706 13,408 Balljoint 3,429 6,854 Pig 14,058 28,112 Lion 8,154 18,304 Armadillo 17,299 34,584 Santa 7,580 15,156 In this paper, we define a time function f(t) as f (t) = t (0 t 1). (20)
5 (a) (b) (c) Figure 4: Mapping Results; (a) Rabbit Balljoint, (b) Pig Lion, (c) Armadillo Santa. Figure 5: Morphing in the part of the face with some constraints for feature points. Table 2: Combination of mesh models. Ex.1 Ex.2 Ex.3 Initial Model Rabbit Pig Armadillo Final Model Balljoint Lion Santa Mediator Sphere Animal Cylinderman Fig.5 shows the morphing focusing on the face part between Pig and Lion. We set 5 feature points as constraints in the part. By setting them, the face morphing becomes a natural morphing according to feature points. Fig.6 shows the morphing from Rabbit to Balljoint. We have no constraints between them because they have no semantic corresponding parts. In our method, the correspondence can be constructed without user s interposition. Fig.7 shows the morphing from Pig to Lion. We set 4 feature points as constraints for them except the face feature points. Fig.8 shows the morphing from Armadillo to Santa. In this morphing, 6 feature points were given as their constraints. 5 Conclusion In this paper, we present a new method for 3-D morphing by direct mapping from a mesh model onto another one by using a SDM-mapping. First, an initial model and a final model are mapped onto a mediator, respectively. Next, we make a rough correspondence between the mapped models via the mappings. Then, the vertex coordinates of the mapped initial model is transposed to the corresponding vertex coordinates of the mapped final model and we perform a SDM-mapping again. After these processes, we can realize the direct mapping between mesh models. Thus, the new method we proposed needs neither combining two meshes nor making low-resolution models. In addition, some constraints for feature points of two mesh models enables us to control a mapping according to the structural features of the mesh models. Besides, we can standardize the description of some mesh models by describing their data structures using the method we present. It enables to perform multitarget morphing[8]. As future works, we will realize the morphing based on our method between the mesh models whose genus are non-zero[14]. In this paper, we set some constraints for only feature points of the models. Therefore, we need to extend the constraints including the discriminative regions such as a head, a body and arms[11]. We are also examining the effectiveness of the SDM for deformation transfer[13], expression cloning[10] and another techniques. References [1] Alexa, M.: Recent Advances in Mesh Mophing, Technical report, Interactive Graphics Systems Group (2002). [2] Kanai, T., Suzuki, H. and Kimura, F.: 3D Geometric Metamorphosis based on Harmonic Map, The Visual Computer, pp (1997). [3] Kent, J, R., Carlson, W. and Parent, R.: Shape transformation for polyhedral objects, SIGGRAPH 92 Proceedings, pp (1992).
6 Figure 6: Morphing from Rabbit to Balljoint. Figure 7: Morphing from Pig to Lion. Figure 8: Morphing from Armadillo to Santa. [4] Kohonen, T.(ed.): Self-Organizing Maps, Springer- Verlag, Berlin Heidelberg New York (1996). [5] Lazarus, F. and Verroust, A.: Three-dimensional metamorphosis : a survey, The Visual Computer, pp (1998). [6] Lee, A., Dobkin, D., Sewldens, W. and Schroder, P.: Multiresolution Mesh Morphing, SIGGRAPH 99, pp (1999). [7] Lee, A., Sweldens, W., Schröder, P., Cowsar, L. and Dobkin, D.: MAPS: Multiresolution Adaptive Parameterization of Surfaces, SIGGRAPH 98 Proceedings, pp (1998). [8] Michikawa, T., Kanai, T., Fijita, M. and Chiyokura, H.: Multiresolution Interpolation Meshes, In 9th Pacific Conference on Computer Graphics and Applications,IEEE, pp (2001). [9] Morooka, K. and Nagahashi, H: Self-organizing Deformable Model : A New Method for Fitting Mesh Model to Given Object Surface, International Symposium on Visual Computing, LNCS 3804, pp (2005). [10] Noh, J. and Neumann, U.: Expression cloning, SIG- GRAPH 01 Proceedings, pp (2001). [11] Schölkopf, B., Steinke, F. and Blanz, V.: Object Correspondence as a Machine Learning Problem, Proceedings of 22th International Conference on Machine Learning (2005). [12] Schreiner, J., Asirvsthsm, A., Praun, E. and Hoppe, H.: Inter-Surface Mapping, SIGGRAPH 04 Proceedings, pp (2004). [13] Sumner, R. and Popovic, J.: Deformation Transfer for Triangle Meshes, SIGGRAPH 04 Proceedings, pp (2004). [14] Takahashi, S., Kokojima, Y. and Ohbuchi, R.: Explicit Control of Topological Transitions in Morphing Shapes of 3D Meshes, Proc. Pacific Graphics 2001, pp (2001).
Manifold Parameterization
Manifold Parameterization Lei Zhang 1,2, Ligang Liu 1,2, Zhongping Ji 1,2, and Guojin Wang 1,2 1 Department of Mathematics, Zhejiang University, Hangzhou 310027, China 2 State Key Lab of CAD&CG, Zhejiang
More informationWe are IntechOpen, the first native scientific publisher of Open Access books. International authors and editors. Our authors are among the TOP 1%
We are IntechOpen, the first native scientific publisher of Open Access books 3,350 108,000 1.7 M Open access books available International authors and editors Downloads Our authors are among the 151 Countries
More informationA Multiresolutional Approach for Facial Motion Retargetting Using Subdivision Wavelets
A Multiresolutional Approach for Facial Motion Retargetting Using Subdivision Wavelets Kyungha Min and Moon-Ryul Jung Dept. of Media Technology, Graduate School of Media Communications, Sogang Univ., Seoul,
More informationCloning Skeleton-driven Animation to Other Models
Cloning Skeleton-driven Animation to Other Models Wan-Chi Luo Jian-Bin Huang Bing-Yu Chen Pin-Chou Liu National Taiwan University {maggie, azar, toby}@cmlab.csie.ntu.edu.tw robin@ntu.edu.tw Abstract-3D
More informationLevel-of-Detail Triangle Strips for Deforming. meshes
Level-of-Detail Triangle Strips for Deforming Meshes Francisco Ramos 1, Miguel Chover 1, Jindra Parus 2 and Ivana Kolingerova 2 1 Universitat Jaume I, Castellon, Spain {Francisco.Ramos,chover}@uji.es 2
More informationLevel-of-Detail Triangle Strips for Deforming Meshes
Level-of-Detail Triangle Strips for Deforming Meshes Francisco Ramos 1, Miguel Chover 1, Jindra Parus 2, and Ivana Kolingerova 2 1 Universitat Jaume I, Castellon, Spain {Francisco.Ramos,chover}@uji.es
More informationParameterization of Triangular Meshes with Virtual Boundaries
Parameterization of Triangular Meshes with Virtual Boundaries Yunjin Lee 1;Λ Hyoung Seok Kim 2;y Seungyong Lee 1;z 1 Department of Computer Science and Engineering Pohang University of Science and Technology
More informationMesh morphing using polycube-based cross-parameterization
COMPUTER ANIMATION AND VIRTUAL WORLDS Comp. Anim. Virtual Worlds 2005; 16: 499 508 Published online in Wiley InterScience (www.interscience.wiley.com). DOI: 10.1002/cav.92 Animating Geometrical Models
More informationMetamorphosis of Polyhedral Surfaces using Decomposition
EUROGRAPHICS 22 / G. Drettakis and H.-P. Seidel (Guest Editors) Volume 2 (22), Number 3 Metamorphosis of Polyhedral Surfaces using Decomposition Shymon Shlafman, Ayellet Tal and Sagi Katz Department of
More informationExplicit Control of Topological Transitions in Morphing Shapes of 3D Meshes
Explicit Control of Topological Transitions in Morphing Shapes of 3D Meshes Shigeo Takahashi Department of Graphics and Computer Science Graduate School of Arts and Sciences University of Tokyo takahashis@acm.org
More information3D Geometric Metamorphosis based on Harmonic Map
3D Geometric Metamorphosis based on Harmonic Map Takashi KANAI Hiromasa SUZUKI Fumihiko KIMURA Department of Precision Machinery Engineering The University of Tokyo 7-3-1, Hongo, Bunkyo-ku, Tokyo 113,
More informationMultiresolution Remeshing Using Weighted Centroidal Voronoi Diagram
Multiresolution Remeshing Using Weighted Centroidal Voronoi Diagram Chao-Hung Lin 1, Chung-Ren Yan 2, Ji-Hsen Hsu 2, and Tong-Yee Lee 2 1 Dept. of Geomatics, National Cheng Kung University, Taiwan 2 Dept.
More informationLocal Modification of Subdivision Surfaces Based on Curved Mesh
Local Modification of Subdivision Surfaces Based on Curved Mesh Yoshimasa Tokuyama Tokyo Polytechnic University tokuyama@image.t-kougei.ac.jp Kouichi Konno Iwate University konno@cis.iwate-u.ac.jp Junji
More informationTopology-driven Surface Mappings with Robust Feature Alignment
Topology-driven Surface Mappings with Robust Feature Alignment Christopher Carner, Miao Jin, Xianfeng Gu, and Hong Qin Stony Brook University Figure 1: Surface mapping between horse and lizard The color-coding
More informationCSE452 Computer Graphics
CSE452 Computer Graphics Lecture 19: From Morphing To Animation Capturing and Animating Skin Deformation in Human Motion, Park and Hodgins, SIGGRAPH 2006 CSE452 Lecture 19: From Morphing to Animation 1
More informationDeformation Transfer for Triangle Meshes
Deformation Transfer for Triangle Meshes a Paper (SIGGRAPH 2004) by Robert W. Sumner & Jovan Popovic presented by Roni Oeschger Deformation Transfer Source deformed Target deformed 1 Outline of my presentation
More informationMesh Morphing. Ligang Liu Graphics&Geometric Computing Lab USTC
Mesh Morphing Ligang Liu Graphics&Geometric Computing Lab USTC http://staff.ustc.edu.cn/~lgliu Morphing Given two objects produce sequence of intermediate objects that gradually evolve from one object
More informationInteractive Editing of Multiresolution Meshes
Interactive Editing of Multiresolution Meshes Frutuoso G. M. Silva and Abel J. P. Gomes IT - Networks and Multimedia Group Department of Computer Science and Engineering University of Beira Interior, Portugal
More informationA New Constrained Texture Mapping Method
A New Constrained Texture Mapping Method Yan-Wen Guo 1,2,,JinWang 1,Xiu-FenCui 1, and Qun-Sheng Peng 1,2 1 State Key Lab of CAD&CG, Zhejiang University, Hangzhou 310027, China 2 Department of Mathematics,
More informationApproximate Shortest Path on a Polyhedral Surface Based on Selective Refinement of the Discrete Graph and Its Applications
Approximate Shortest Path on a Polyhedral Surface Based on Selective Refinement of the Discrete Graph and Its Applications Takashi Kanai RIKEN Materials Fabrication Lab.. Hiromasa Suzuki University of
More informationMetamorphosis of Arbitrary Triangular Meshes
Feature Article Metamorphosis of Arbitrary Triangular Meshes Metamorphosis of 3D objects achieves shape transformation between objects. We present an efficient framework for morphing between two topologically
More informationResearch Article Polygon Morphing and Its Application in Orebody Modeling
Mathematical Problems in Engineering Volume 212, Article ID 732365, 9 pages doi:1.1155/212/732365 Research Article Polygon Morphing and Its Application in Orebody Modeling Hacer İlhan and Haşmet Gürçay
More informationMuscle Based facial Modeling. Wei Xu
Muscle Based facial Modeling Wei Xu Facial Modeling Techniques Facial modeling/animation Geometry manipulations Interpolation Parameterizations finite element methods muscle based modeling visual simulation
More informationInteractive Multiresolution Editing of Arbitrary Meshes
EUROGRAPHICS 99 / P. Brunet and R. Scopigno (Guest Editors) Volume 18 (1999), Number 3 Interactive Multiresolution Editing of Arbitrary Meshes Seungyong Lee Department of Computer Science and Engineering
More informationFeature-based Surface Decomposition for Correspondence and Morphing between Polyhedra
Feature-based Surface Decomposition for Correspondence and Morphing between Polyhedra Arthur Gregory, Andrei State, Ming C. Lin, Dinesh Manocha, Mark A. Livingston Department of Computer Science, University
More informationShape Blending Using the Star-Skeleton Representation
Shape Blending Using the Star-Skeleton Representation Michal Shapira Ari Rappoport Institute of Computer Science, The Hebrew University of Jerusalem Jerusalem 91904, Israel. arir@cs.huji.ac.il Abstract:
More informationTexture Mapping with Hard Constraints
EUROGRAPHICS 2001 / A.Chalmers and T.-M.Rhyne Volume 20 (2001), Number 3 (Guest Editors) Texture Mapping with Hard Constraints Ilya Eckstein Vitaly Surazhsky Craig Gotsman Computer Science Department,
More informationTopology-driven Surface Mappings with Robust Feature Alignment
Topology-driven Surface Mappings with Robust Feature Alignment Christopher Carner, Miao Jin, Xianfeng Gu, and Hong Qin Stony Brook University Figure 1: Surface mapping between horse and lizard The color-coding
More informationCross-Parameterization and Compatible Remeshing of 3D Models
Cross-Parameterization and Compatible Remeshing of 3D Models Vladislav Kraevoy Alla Sheffer University of British Columbia, {vlady sheffa}@cs.ubc.ca Abstract Figure 1: Applications: (left) texture transfer
More informationPolyhedron Realization for Shape Transformation
Polyhedron Realization for Shape Transformation Avner Shapiro Ayellet Tal Department of Computer Science Department of Electrical Engineering The Hebrew University Technion Israel Institute of Technology
More informationProbability Distribution of Index Distances in Normal Index Array for Normal Vector Compression
Probability Distribution of Index Distances in Normal Index Array for Normal Vector Compression Deok-Soo Kim 1, Youngsong Cho 1, Donguk Kim 1, and Hyun Kim 2 1 Department of Industrial Engineering, Hanyang
More informationMultiresolution Mesh Morphing
Multiresolution Mesh Morphing AaronW.F.Lee Princeton University David Dobkin Princeton University Wim Sweldens Bell Laboratories Peter Schröder Caltech Figure 1: Morph sequence between two topologically
More informationAdaptive Semi-Regular Remeshing: A Voronoi-Based Approach
Adaptive Semi-Regular Remeshing: A Voronoi-Based Approach Aymen Kammoun 1, Frédéric Payan 2, Marc Antonini 3 Laboratory I3S, University of Nice-Sophia Antipolis/ CNRS (UMR 6070) - France 1 kammoun@i3s.unice.fr
More informationIDETC POINT-BASED SHAPE MONITORING OF PLATE BENDING FOR LARGE-SCALE STORAGE TANKS
Proceedings of the ASME 2017 International Design Engineering Technical Conferences & Computers and Information in Engineering Conference IDETC2017 August 6-9, 2017, Cleveland, Ohio, USA IDETC2017-68105
More informationMetamorphosis of Arbitrary Triangular Meshes
to appear in IEEE Computer Graphics and Applications Metamorphosis of Arbitrary Triangular Meshes Takashi Kanai Materials Fabrication Laboratory, The Institute of Physical and Chemical Research (RIKEN),
More informationInteractive Shape Metamorphosis
Interactive Shape Metamorphosis David T. Chen Andrei State Department of Computer Science University of North Carolina Chapel Hill, NC 27599 David Banks Institute for Computer Applications in Science and
More informationAdaptive Fuzzy Watermarking for 3D Models
International Conference on Computational Intelligence and Multimedia Applications 2007 Adaptive Fuzzy Watermarking for 3D Models Mukesh Motwani.*, Nikhil Beke +, Abhijit Bhoite +, Pushkar Apte +, Frederick
More informationIntrinsic Morphing of Compatible Triangulations. VITALY SURAZHSKY CRAIG GOTSMAN
International Journal of Shape Modeling Vol. 9, No. 2 (2003) 191 201 c World Scientific Publishing Company Intrinsic Morphing of Compatible Triangulations VITALY SURAZHSKY vitus@cs.technion.ac.il CRAIG
More informationMesh Repairing and Simplification. Gianpaolo Palma
Mesh Repairing and Simplification Gianpaolo Palma Mesh Repairing Removal of artifacts from geometric model such that it becomes suitable for further processing Input: a generic 3D model Output: (hopefully)a
More informationInteractive Deformation with Triangles
Interactive Deformation with Triangles James Dean Palmer and Ergun Akleman Visualization Sciences Program Texas A&M University Jianer Chen Department of Computer Science Texas A&M University Abstract In
More informationMeshless Modeling, Animating, and Simulating Point-Based Geometry
Meshless Modeling, Animating, and Simulating Point-Based Geometry Xiaohu Guo SUNY @ Stony Brook Email: xguo@cs.sunysb.edu http://www.cs.sunysb.edu/~xguo Graphics Primitives - Points The emergence of points
More informationMesh-Based Inverse Kinematics
CS468, Wed Nov 9 th 2005 Mesh-Based Inverse Kinematics R. W. Sumner, M. Zwicker, C. Gotsman, J. Popović SIGGRAPH 2005 The problem 1 General approach Learn from experience... 2 As-rigid-as-possible shape
More informationSelf-Organizing Maps for cyclic and unbounded graphs
Self-Organizing Maps for cyclic and unbounded graphs M. Hagenbuchner 1, A. Sperduti 2, A.C. Tsoi 3 1- University of Wollongong, Wollongong, Australia. 2- University of Padova, Padova, Italy. 3- Hong Kong
More informationCS 523: Computer Graphics, Spring Shape Modeling. Skeletal deformation. Andrew Nealen, Rutgers, /12/2011 1
CS 523: Computer Graphics, Spring 2011 Shape Modeling Skeletal deformation 4/12/2011 1 Believable character animation Computers games and movies Skeleton: intuitive, low-dimensional subspace Clip courtesy
More informationTriangular Mesh Segmentation Based On Surface Normal
ACCV2002: The 5th Asian Conference on Computer Vision, 23--25 January 2002, Melbourne, Australia. Triangular Mesh Segmentation Based On Surface Normal Dong Hwan Kim School of Electrical Eng. Seoul Nat
More informationCross-Parameterization and Compatible Remeshing of 3D Models
Cross-Parameterization and Compatible Remeshing of 3D Models Vladislav Kraevoy Alla Sheffer University of British Columbia Authors Vladislav Kraevoy Ph.D. Student Alla Sheffer Assistant Professor Outline
More informationSubdivision Depth Computation for Extra-Ordinary Catmull-Clark Subdivision Surface Patches
Subdivision Depth Computation for Extra-Ordinary Catmull-Clark Subdivision Surface Patches Fuhua Frank Cheng,GangChen, and Jun-Hai Yong University of Kentucky, Lexington, KY, USA Tsinghua University, Beijing,
More informationDiffusion Wavelets for Natural Image Analysis
Diffusion Wavelets for Natural Image Analysis Tyrus Berry December 16, 2011 Contents 1 Project Description 2 2 Introduction to Diffusion Wavelets 2 2.1 Diffusion Multiresolution............................
More informationCharacter animation creation using hand-drawn sketches
Visual Comput (2005) 21: 551 558 DOI 10.1007/s00371-005-0333-z ORIGINAL ARTICLE Bing-Yu Chen Yutaka Ono Tomoyuki Nishita Character animation creation using hand-drawn sketches Published online: 31 August
More informationFinal Project, Digital Geometry Processing
Final Project, Digital Geometry Processing Shayan Hoshyari Student #: 81382153 December 2016 Introduction In this project an adaptive surface remesher has been developed based on the paper [1]. An algorithm
More informationAdding Hand Motion to the Motion Capture Based Character Animation
Adding Hand Motion to the Motion Capture Based Character Animation Ge Jin and James Hahn Computer Science Department, George Washington University, Washington DC 20052 {jinge, hahn}@gwu.edu Abstract. Most
More informationJoint Alignment and Stitching of Non Overlapping Meshes
Joint Alignment and Stitching of Non Overlapping Meshes Susana Brandão 1 and João P. Costeira 2 and Manuela Veloso 3 Abstract We contribute a novel algorithm for aligning and stitching non-overlapping
More informationInteractively Morphing Irregularly Shaped Images Employing Subdivision Techniques
Interactively Morphing Irregularly Shaped Images Employing Subdivision Techniques Jan Van den Bergh Fabian Di Fiore Johan Claes Frank Van Reeth Expertise Centre for Digital Media - Limburg University Centre
More informationcoding of various parts showing different features, the possibility of rotation or of hiding covering parts of the object's surface to gain an insight
Three-Dimensional Object Reconstruction from Layered Spatial Data Michael Dangl and Robert Sablatnig Vienna University of Technology, Institute of Computer Aided Automation, Pattern Recognition and Image
More informationTransfer Facial Expressions with Identical Topology
Transfer Facial Expressions with Identical Topology Alice J. Lin Department of Computer Science University of Kentucky Lexington, KY 40506, USA alice.lin@uky.edu Fuhua (Frank) Cheng Department of Computer
More informationOptimal Segmentation and Understanding of Motion Capture Data
Optimal Segmentation and Understanding of Motion Capture Data Xiang Huang, M.A.Sc Candidate Department of Electrical and Computer Engineering McMaster University Supervisor: Dr. Xiaolin Wu 7 Apr, 2005
More informationSkeletal deformation
CS 523: Computer Graphics, Spring 2009 Shape Modeling Skeletal deformation 4/22/2009 1 Believable character animation Computers games and movies Skeleton: intuitive, low dimensional subspace Clip courtesy
More informationSurface Mapping using Consistent Pants Decomposition
1 Surface Mapping using Consistent Pants Decomposition Xin Li, Student Member, IEEE, Xianfeng Gu, Member, IEEE, and Hong Qin, Member, IEEE Abstract Surface mapping is fundamental to shape computing and
More informationFree-form deformation (FFD)
T.D. DeRose, M. Meyer, Harmonic Coordinates. Pixar Technical Memo #06-02 Free-form deformation (FFD) Advanced Computer Animation Techniques Aug-Dec 2014 cesteves@cimat.mx Free-form deformation (FFD) 2d
More informationShape and Expression Space of Real istic Human Faces
8 5 2006 5 Vol8 No5 JOURNAL OF COMPU TER2AIDED DESIGN & COMPU TER GRAPHICS May 2006 ( 0087) (peiyuru @cis. pku. edu. cn) : Canny ; ; ; TP394 Shape and Expression Space of Real istic Human Faces Pei Yuru
More informationRegistration of Deformable Objects
Registration of Deformable Objects Christopher DeCoro Includes content from: Consistent Mesh Parameterizations, Praun et. al, Siggraph 2001 The Space of Human Body Shapes, Allen et. al, Siggraph 2003 Shape-based
More informationPoint-based Simplification Algorithm
Point-based Simplification Algorithm Pai-Feng Lee 1, Bin-Shyan Jong 2 Department of Information Management, Hsing Wu College 1 Dept. of Information and Computer Engineering Engineering, Chung Yuan Christian
More informationSpectral Coding of Three-Dimensional Mesh Geometry Information Using Dual Graph
Spectral Coding of Three-Dimensional Mesh Geometry Information Using Dual Graph Sung-Yeol Kim, Seung-Uk Yoon, and Yo-Sung Ho Gwangju Institute of Science and Technology (GIST) 1 Oryong-dong, Buk-gu, Gwangju,
More informationSpace Deformation using Ray Deflectors
Space Deformation using Ray Deflectors Yair Kurzion and Roni Yagel Department of Computer and Information Science The Ohio State University Abstract. In this paper we introduce a new approach to the deformation
More information3-Dimensional Object Modeling with Mesh Simplification Based Resolution Adjustment
3-Dimensional Object Modeling with Mesh Simplification Based Resolution Adjustment Özgür ULUCAY Sarp ERTÜRK University of Kocaeli Electronics & Communication Engineering Department 41040 Izmit, Kocaeli
More information751 Problem Set I JWR. Due Sep 28, 2004
751 Problem Set I JWR Due Sep 28, 2004 Exercise 1. For any space X define an equivalence relation by x y iff here is a path γ : I X with γ(0) = x and γ(1) = y. The equivalence classes are called the path
More informationFace Morphing. Introduction. Related Work. Alex (Yu) Li CS284: Professor Séquin December 11, 2009
Alex (Yu) Li CS284: Professor Séquin December 11, 2009 Face Morphing Introduction Face morphing, a specific case of geometry morphing, is a powerful tool for animation and graphics. It consists of the
More informationBlind watermarking of 3D shapes using localized constraints
Blind watermarking of 3D shapes using localized constraints Adrian G. Bors Dept. of Computer Science, University of York, York YO DD, U.K. E-mail: adrian.bors@cs.york.ac.uk Abstract This paper develops
More informationData sharing of shape model with VRML environment
Data sharing of shape model with VRML environment K. G. Kobayasht, K. Ujihara, M. Hayamizu, and M. Fujii" Japan Society for Precision Engineering Toyama Prefectural University, Dept. of Mech. Systems Eng.
More informationVideo based Animation Synthesis with the Essential Graph. Adnane Boukhayma, Edmond Boyer MORPHEO INRIA Grenoble Rhône-Alpes
Video based Animation Synthesis with the Essential Graph Adnane Boukhayma, Edmond Boyer MORPHEO INRIA Grenoble Rhône-Alpes Goal Given a set of 4D models, how to generate realistic motion from user specified
More informationModular network SOM : Theory, algorithm and applications
Modular network SOM : Theory, algorithm and applications Kazuhiro Tokunaga and Tetsuo Furukawa Kyushu Institute of Technology, Kitakyushu 88-96, Japan {tokunaga, furukawa}@brain.kyutech.ac.jp Abstract.
More informationCS233: The Shape of Data Handout # 3 Geometric and Topological Data Analysis Stanford University Wednesday, 9 May 2018
CS233: The Shape of Data Handout # 3 Geometric and Topological Data Analysis Stanford University Wednesday, 9 May 2018 Homework #3 v4: Shape correspondences, shape matching, multi-way alignments. [100
More informationComputational Design. Stelian Coros
Computational Design Stelian Coros Schedule for presentations February 3 5 10 12 17 19 24 26 March 3 5 10 12 17 19 24 26 30 April 2 7 9 14 16 21 23 28 30 Send me: ASAP: 3 choices for dates + approximate
More informationSurface Reconstruction. Gianpaolo Palma
Surface Reconstruction Gianpaolo Palma Surface reconstruction Input Point cloud With or without normals Examples: multi-view stereo, union of range scan vertices Range scans Each scan is a triangular mesh
More informationTopology-Free Cut-and-Paste Editing over Meshes
Topology-Free Cut-and-Paste Editing over Meshes Hongbo Fu, Chiew-Lan Tai, Hongxin Zhang Department of Computer Science Hong Kong University of Science and Technology Abstract Existing cut-and-paste editing
More informationFeature-based 3D Morphing based on Geometrically Constrained Sphere Mapping Optimization
Feature-based 3D Morphing based on Geometrically Constrained Sphere Mapping Optimization Theodoris Athanasiadis Dept. of Computer Science University of Ioannina GR45110 Ioannina, Greece thathana@cs.uoi.gr
More informationImage-Based Deformation of Objects in Real Scenes
Image-Based Deformation of Objects in Real Scenes Han-Vit Chung and In-Kwon Lee Dept. of Computer Science, Yonsei University sharpguy@cs.yonsei.ac.kr, iklee@yonsei.ac.kr Abstract. We present a new method
More informationGPU-Based Multiresolution Deformation Using Approximate Normal Field Reconstruction
GPU-Based Multiresolution Deformation Using Approximate Normal Field Reconstruction Martin Marinov, Mario Botsch, Leif Kobbelt Computer Graphics Group, RWTH Aachen, Germany Multiresolution shape editing
More informationComputer Animation Visualization. Lecture 5. Facial animation
Computer Animation Visualization Lecture 5 Facial animation Taku Komura Facial Animation The face is deformable Need to decide how all the vertices on the surface shall move Manually create them Muscle-based
More informationSynthesizing Realistic Facial Expressions from Photographs
Synthesizing Realistic Facial Expressions from Photographs 1998 F. Pighin, J Hecker, D. Lischinskiy, R. Szeliskiz and D. H. Salesin University of Washington, The Hebrew University Microsoft Research 1
More informationAnimating cuts with on-the-fly re-meshing
EUROGRAPHICS 2001 / Jonathan C. Roberts Short Presentations Animating cuts with on-the-fly re-meshing F. Ganovelli and C. O Sullivan Image Synthesis Group, Computer Science Department, Trinity College
More informationMonotone Paths in Geometric Triangulations
Monotone Paths in Geometric Triangulations Adrian Dumitrescu Ritankar Mandal Csaba D. Tóth November 19, 2017 Abstract (I) We prove that the (maximum) number of monotone paths in a geometric triangulation
More informationMorphing Planar Graphs in Spherical Space
Morphing Planar Graphs in Spherical Space Stephen G. Kobourov and Matthew Landis Department of Computer Science University of Arizona {kobourov,mlandis}@cs.arizona.edu Abstract. We consider the problem
More informationing and enhancing operations for shapes represented by level sets (isosurfaces) and applied unsharp masking to the level set normals. Their approach t
Shape Deblurring with Unsharp Masking Applied to Mesh Normals Hirokazu Yagou Λ Alexander Belyaev y Daming Wei z Λ y z ; ; Shape Modeling Laboratory, University of Aizu, Aizu-Wakamatsu 965-8580 Japan fm50534,
More informationA Study on Clustering Method by Self-Organizing Map and Information Criteria
A Study on Clustering Method by Self-Organizing Map and Information Criteria Satoru Kato, Tadashi Horiuchi,andYoshioItoh Matsue College of Technology, 4-4 Nishi-ikuma, Matsue, Shimane 90-88, JAPAN, kato@matsue-ct.ac.jp
More informationTexture Transfer During Shape Transformation
Texture Transfer During Shape Transformation Huong Quynh Dinh Multimedia, Vision, and Visualization Department of Computer Science Stevens Institute of Technology Anthony Yezzi Systems and Control School
More informationThe correspondence problem. A classic problem. A classic problem. Deformation-Drive Shape Correspondence. Fundamental to geometry processing
The correspondence problem Deformation-Drive Shape Correspondence Hao (Richard) Zhang 1, Alla Sheffer 2, Daniel Cohen-Or 3, Qingnan Zhou 2, Oliver van Kaick 1, and Andrea Tagliasacchi 1 July 3, 2008 1
More informationDirect Extraction of Normal Mapped Meshes from Volume Data
Direct Extraction of Normal Mapped Meshes from Volume Data Mark Barry and Zoë Wood California Polytechnic State University Abstract. We describe a method of directly extracting a simplified contour surface
More information6.3 Poincare's Theorem
Figure 6.5: The second cut. for some g 0. 6.3 Poincare's Theorem Theorem 6.3.1 (Poincare). Let D be a polygon diagram drawn in the hyperbolic plane such that the lengths of its edges and the interior angles
More informationConstrained Optimization of the Stress Function for Multidimensional Scaling
Constrained Optimization of the Stress Function for Multidimensional Scaling Vydunas Saltenis Institute of Mathematics and Informatics Akademijos 4, LT-08663 Vilnius, Lithuania Saltenis@ktlmiilt Abstract
More informationPhysically-Based Modeling and Animation. University of Missouri at Columbia
Overview of Geometric Modeling Overview 3D Shape Primitives: Points Vertices. Curves Lines, polylines, curves. Surfaces Triangle meshes, splines, subdivision surfaces, implicit surfaces, particles. Solids
More informationDecoration of plastic objects using multi view-dependent textures
Decoration of plastic objects using multi view-dependent textures Maxime Belperin, Sylvain Brandel & David Coeurjolly Universite de Lyon, CNRS Universite Lyon 1, LIRIS, UMR5205, F-69622, France {maxime.belperin,sylvain.brandel,david.coeurjolly}@liris.cnrs.fr
More informationRobustness of Boolean operations on subdivision-surface models
Robustness of Boolean operations on subdivision-surface models Di Jiang 1, Neil Stewart 2 1 Université de Montréal, Dép t. Informatique CP6128, Succ. CentreVille, Montréal, H3C 3J7, Qc, Canada jiangdi@umontreal.ca
More informationLevel Set Models for Computer Graphics
Level Set Models for Computer Graphics David E. Breen Department of Computer Science Drexel University Ross T. Whitaker School of Computing University of Utah Ken Museth Department of Science and Technology
More informationWATERMARKING FOR 3D POLYGONS USING WAVELET TRANSFORM AND MODIFIED TRAVELING SALESMAN PROBLEM
Journal of the Operations Research Society of Japan 2009, Vol. 52, No. 4, 402-416 WATERMARKING FOR 3D POLYGONS USING WAVELET TRANSFORM AND MODIFIED TRAVELING SALESMAN PROBLEM Shinichi Murata Yasunari Yoshitomi
More informationLaplacian Meshes. COS 526 Fall 2016 Slides from Olga Sorkine and Yaron Lipman
Laplacian Meshes COS 526 Fall 2016 Slides from Olga Sorkine and Yaron Lipman Outline Differential surface representation Ideas and applications Compact shape representation Mesh editing and manipulation
More information2D Image Morphing using Pixels based Color Transition Methods
2D Image Morphing using Pixels based Color Transition Methods H.B. Kekre Senior Professor, Computer Engineering,MP STME, SVKM S NMIMS University, Mumbai,India Tanuja K. Sarode Asst.Professor, Thadomal
More informationSimplicial Hyperbolic Surfaces
Simplicial Hyperbolic Surfaces Talk by Ken Bromberg August 21, 2007 1-Lipschitz Surfaces- In this lecture we will discuss geometrically meaningful ways of mapping a surface S into a hyperbolic manifold
More informationConspicuous Character Patterns
Conspicuous Character Patterns Seiichi Uchida Kyushu Univ., Japan Ryoji Hattori Masakazu Iwamura Kyushu Univ., Japan Osaka Pref. Univ., Japan Koichi Kise Osaka Pref. Univ., Japan Shinichiro Omachi Tohoku
More informationDeformable Mesh Model for Complex Multi-Object 3D Motion Estimation from Multi-Viewpoint Video
Deformable Mesh Model for Complex Multi-Object 3D Motion Estimation from Multi-Viewpoint Video Shohei NOBUHARA Takashi MATSUYAMA Graduate School of Informatics, Kyoto University Sakyo, Kyoto, 606-8501,
More information