BSP-fields: An Exact Representation of Polygonal Objects by Differentiable Scalar Fields Based on Binary Space Partitioning

The problem considered in this work is to find a dimension independent algorithm for the generation of signed scalar fields exactly representing polygonal objects and satisfying the following requirements: the defining real function takes zero value exactly at the polygonal object boundary; no extra zero-value isosurfaces should be generated; C1 continuity of the function in the entire domain. The proposed algorithms are based on the binary space partitioning (BSP) of the object by the planes passing through the polygonal faces and are independent of the object genus, the number of disjoint components, and holes in the initial polygonal mesh. Several extensions to the basic algorithm are proposed to satisfy the selected optimization criteria. The generated BSP-fields allow for applying techniques of the function-based modeling to already existing legacy objects from CAD and computer animation areas, which is illustrated by several examples

2D and 3D surface image processing algorithms and their applications

This doctoral dissertation work aims to develop algorithms for 2D image segmentation application of solar filament disappearance detection, 3D mesh simplification, and 3D image warping in pre-surgery simulation. Filament area detection in solar images is an image segmentation problem. A thresholding and region growing combined method is proposed and applied in this application. Based on the filament area detection results, filament disappearances are reported in real time. The solar images in 1999 are processed with this proposed system and three statistical results of filaments are presented. 3D images can be obtained by passive and active range sensing. An image registration process finds the transformation between each pair of range views. To model an object, a common reference frame in which all views can be transformed must be defined. After the registration, the range views should be integrated into a non-redundant model. Optimization is necessary to obtain a complete 3D model. One single surface representation can better fit to the data. It may be further simplified for rendering, storing and transmitting efficiently, or the representation can be converted to some other formats. This work proposes an efficient algorithm for solving the mesh simplification problem, approximating an arbitrary mesh by a simplified mesh. The algorithm uses Root Mean Square distance error metric to decide the facet curvature. Two vertices of one edge and the surrounding vertices decide the average plane. The simplification results are excellent and the computation speed is fast. The algorithm is compared with six other major simplification algorithms. Image morphing is used for all methods that gradually and continuously deform a source image into a target image, while producing the in-between models. Image warping is a continuous deformation of a: graphical object. A morphing process is usually composed of warping and interpolation. This work develops a direct-manipulation-of-free-form-deformation-based method and application for pre-surgical planning. The developed user interface provides a friendly interactive tool in the plastic surgery. Nose augmentation surgery is presented as an example. Displacement vector and lattices resulting in different resolution are used to obtain various deformation results. During the deformation, the volume change of the model is also considered based on a simplified skin-muscle model

A Survey of Morphing Techniques

Image morphing provides the tool to generate the flexible and powerful visual effect. Morphing depicts the transformation of one image into another image. The process of image morphing starts with the feature specification phase and then proceeds to warp generation phase, followed by the transition control phase. This paper surveys the various techniques available for all three stages of image morphing

Caustic Structures and Detectability of Circumbinary Planets in Microlensing

Recent discoveries of circumbinary planets in Kepler data show that there is a viable channel of planet formation around binary main sequence stars. Motivated by these discoveries, we have investigated the caustic structures and detectability of circumbinary planets in microlensing events. We have produced a suite of animations of caustics as a function of the projected separation and angle of the binary host to efficiently explore caustic structures over the entire circumbinary parameter space. Aided by these animations, we have derived a semi-empirical analytic expression for the location of planetary caustics, which are displaced in circumbinary lenses relative to those of planets with a single host. We have used this expression to show that the dominant source of caustic motion will be due to the planet's orbital motion and not that of the binary star. Finally, we estimate the fraction of circumbinary microlensing events that are recognizable as such to be significant (5-50 percent) for binary projected separations in the range 0.1-0.5 in units of Einstein radii.Comment: 15 pages, 1 table, 18 figures. Accepted for publication in Ap

An Exact Representation of Polygonal Objects by C1-continuous Scalar Fields Based on Binary Space Partitioning

The problem considered in this work is to find a dimension independent algorithm for the generation of signed scalar fields exactly representing polygonal objects and satisfying the following requirements: the defining real function takes zero value exactly at the polygonal object boundary; no extra zero-value isosurfaces should be generated; C1 continuity of the function in the entire domain. The proposed algorithms are based on the binary space partitioning (BSP) of the object by the planes passing through the polygonal faces and are independent of the object genus, the number of disjoint components, and holes in the initial polygonal mesh. Several extensions to the basic algorithm are proposed to satisfy the selected optimization criteria. The generated BSP-fields allow for applying techniques of function-based modelling to already existing legacy objects from CAD and computer animation areas, which is illustrated by several examples

Fully Automatic Facial Deformation Transfer

Facial Animation is a serious and ongoing challenge for the Computer Graphic industry. Because diverse and complex emotions need to be expressed by different facial deformation and animation, copying facial deformations from existing character to another is widely needed in both industry and academia, to reduce time-consuming and repetitive manual work of modeling to create the 3D shape sequences for every new character. But transfer of realistic facial animations between two 3D models is limited and inconvenient for general use. Modern deformation transfer methods require correspondences mapping, in most cases, which are tedious to get. In this paper, we present a fast and automatic approach to transfer the deformations of the facial mesh models by obtaining the 3D point-wise correspondences in the automatic manner. The key idea is that we could estimate the correspondences with different facial meshes using the robust facial landmark detection method by projecting the 3D model to the 2D image. Experiments show that without any manual labelling efforts, our method detects reliable correspondences faster and simpler compared with the state-of-the-art automatic deformation transfer method on the facial models

An Image Morphing Technique Based on Optimal Mass Preserving Mapping

©2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or distribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.DOI: 10.1109/TIP.2007.896637Image morphing, or image interpolation in the time domain, deals with the metamorphosis of one image into another. In this paper, a new class of image morphing algorithms is proposed based on the theory of optimal mass transport. The 2 mass moving energy functional is modified by adding an intensity penalizing term, in order to reduce the undesired double exposure effect. It is an intensity-based approach and, thus, is parameter free. The optimal warping function is computed using an iterative gradient descent approach. This proposed morphing method is also extended to doubly connected domains using a harmonic parameterization technique, along with finite-element methods

Image Morphing

Morphing is also used in the gaming industry to add engaging animation to video games and computer games. However, morphing techniques are not limited only to entertainment purposes. Morphing is a powerful tool that can enhance many multimedia projects such as presentations, education, electronic book illustrations, and computer-based training

Vector offset operators for deformable organic objects.

Many natural materials and most of living tissues exhibit complex deformable behaviours that may be characteriseda s organic. In computer animation, deformable organic material behaviour is needed for the development of characters and scenes based on living creatures and natural phenomena. This study addresses the problem of deformable organic material behaviour in computer animated objects. The focus of this study is concentrated on problems inherent in geometry based deformation techniques, such as non-intuitive interaction and difficulty in achieving realism. Further, the focus is concentrated on problems inherent in physically based deformation techniques, such as inefficiency and difficulty in enforcing spatial and temporal constraints. The main objective in this study is to find a general and efficient solution to interaction and animation of deformable 3D objects with natural organic material properties and constrainable behaviour. The solution must provide an interaction and animation framework suitable for the creation of animated deformable characters. An implementation of physical organic material properties such as plasticity, elasticity and iscoelasticity can provide the basis for an organic deformation model. An efficient approach to stress and strain control is introduced with a deformation tool named Vector Offset Operator. Stress / strain graphs control the elastoplastic behaviour of the model. Strain creep, stress relaxation and hysteresis graphs control the viscoelastic behaviour of the model. External forces may be applied using motion paths equipped with momentum / time graphs. Finally, spatial and temporal constraints are applied directly on vector operators. The suggested generic deformation tool introduces an intermediate layer between user interaction, deformation, elastoplastic and viscoelastic material behaviour and spatial and temporal constraints. This results in an efficient approach to deformation, frees object representation from deformation, facilitates the application of constraints and enables further development