Nonrigid deformation modeling and estimation from images is a technically challenging task due to its nonlinear, nonconvex and high-dimensional nature. Traditional optimization procedures often rely on good initializations and give locally optimal solutions. On the other hand, learning-based methods that directly model the relationship between deformed images and their parameters either cannot ...

We present a cage-based method for transferring animation from a mesh sequence or motion capture data to geometric models in variant representations. To reach the aimed generality, the target model is first embedded into a cage by Green Coordinates interpolation, which preserves the geometric details inherently. The deformation gradient sequences of some user-selected points on the source are t...

We introduce and investigate several state-of-the-art shape deformation methods for their use in evolutionary design optimization problems. Starting from classical free-form deformation (FFD) we broaden our investigation to more flexible methods such as direct manipulation FFD and deformations based on radial basis functions. We integrate the different methods into a framework for evolutionary ...

This paper presents a novel craniofacial reconstruction algorithm based on moving least squares deformation. The 3D skull mesh model is obtained with Marching Cube Algorithm, which extract the iso-surface from a complete head CT slice datum. The holes detected in the 3D skull model can be repaired with different methods after the holes are clarifed . Then, the craniofacial is reconstructed usin...

Superplastic materials show a very high ductility. This is due to both peculiar process conditions and material intrinsic characteristics. However, a number of superplastic materials are subjected to cavitation during superplastic deformation. Evidently, extensive cavitation imposes significant limitations on their commercial application. The deformation and failure of superplastic sheet metals...

Given the set of square matrices M ⊂ Mn+m(C) that keep the subspace W = Cnx{0} ⊂ C invariant, we obtain the implicit form of a miniversal deformation of a matrix a ∈ M, and we compute it explicitely when this matrix is marked (this is, if there is a permutation matrix p ∈ Mn+m(C) such that p−1ap is a Jordan matrix). We derive some applications to tackle the classical Carlson problem.

The associated poster summarizes results from the OOPSLA 2001 workshop on Specification and Verification of Component-Based Systems. The workshop's goal is to explore foundations for applying formal methods to component-based systems. The results and future work sections of the poster will be prepared during the workshop.