Automatically Controlled Morphing of 2D Shapes with Textures

This paper deals with 2D image transformations from a perspective of a 3D heterogeneous shape modeling and computer animation. Shape and image morphing techniques have attracted a lot of attention in artistic design, computer animation, and interactive and streaming applications. We present a novel method for morphing between two topologically arbitrary 2D shapes with sophisticated textures (raster color attributes) using a metamorphosis technique called space-time blending (STB) coupled with space-time transfinite interpolation. The method allows for a smooth transition between source and target objects by generating in-between shapes and associated textures without setting any correspondences between boundary points or features. The method requires no preprocessing and can be applied in 2D animation when position and topology of source and target objects are significantly different. With the conversion of given 2D shapes to signed distance fields, we have detected a number of problems with directly applying STB to them. We propose a set of novel and mathematically substantiated techniques, providing automatic control of the morphing process with STB and an algorithm of applying those techniques in combination. We illustrate our method with applications in 2D animation and interactive applications

Morphing the CMB: a technique for interpolating power spectra

The confrontation of the Cosmic Microwave Background (CMB) theoretical angular power spectrum with available data often requires the calculation of large numbers of power spectra. The standard practice is to use a fast code to compute the CMB power spectra over some large parameter space, in order to estimate likelihoods and constrain these parameters. But as the dimensionality of the space under study increases, then even with relatively fast anisotropy codes, the computation can become prohibitive. This paper describes the employment of a "morphing" strategy to interpolate new power spectra based on previously calculated ones. We simply present the basic idea here, and illustrate with a few examples; optimization of interpolation schemes will depend on the specific application. In addition to facilitating the exploration of large parameter spaces, this morphing technique may be helpful for Fisher matrix calculations involving derivatives.Comment: 18 pages, including 6 figures, uses elsart.cls, accepted for publication in New Astronomy, changes to match published versio

Morphing Ensemble Kalman Filters

A new type of ensemble filter is proposed, which combines an ensemble Kalman filter (EnKF) with the ideas of morphing and registration from image processing. This results in filters suitable for nonlinear problems whose solutions exhibit moving coherent features, such as thin interfaces in wildfire modeling. The ensemble members are represented as the composition of one common state with a spatial transformation, called registration mapping, plus a residual. A fully automatic registration method is used that requires only gridded data, so the features in the model state do not need to be identified by the user. The morphing EnKF operates on a transformed state consisting of the registration mapping and the residual. Essentially, the morphing EnKF uses intermediate states obtained by morphing instead of linear combinations of the states.Comment: 17 pages, 7 figures. Added DDDAS references to the introductio

Morphing of Triangular Meshes in Shape Space

We present a novel approach to morph between two isometric poses of the same non-rigid object given as triangular meshes. We model the morphs as linear interpolations in a suitable shape space $\mathcal{S}$. For triangulated 3D polygons, we prove that interpolating linearly in this shape space corresponds to the most isometric morph in $\mathbb{R}^3$. We then extend this shape space to arbitrary triangulations in 3D using a heuristic approach and show the practical use of the approach using experiments. Furthermore, we discuss a modified shape space that is useful for isometric skeleton morphing. All of the newly presented approaches solve the morphing problem without the need to solve a minimization problem.Comment: Improved experimental result