Constrained Texture Mapping And Foldover-free Condition

Texture mapping has been widely used in image processing and graphics to enhance the realism of CG scenes. However to perfectly match the feature points of a 3D model with the corresponding pixels in texture images, the parameterisation which maps a 3D mesh to the texture space must satisfy the positional constraints. Despite numerous research efforts, the construction of a mathematically robust foldover-free parameterisation subject to internal constraints is still a remaining issue. In this paper, we address this challenge by developing a two-step parameterisation method. First, we produce an initial parameterisation with a method traditionally used to solve structural engineering problems, called the bar-network. We then derive a mathematical foldover-free condition, which is incorporated into a Radial Basis Function based scheme. This method is therefore able to guarantee that the resulting parameterization meets the hard constraints without foldovers

Example Based Caricature Synthesis

The likeness of a caricature to the original face image is an essential and often overlooked part of caricature production. In this paper we present an example based caricature synthesis technique, consisting of shape exaggeration, relationship exaggeration, and optimization for likeness. Rather than relying on a large training set of caricature face pairs, our shape exaggeration step is based on only one or a small number of examples of facial features. The relationship exaggeration step introduces two definitions which facilitate global facial feature synthesis. The first is the T-Shape rule, which describes the relative relationship between the facial elements in an intuitive manner. The second is the so called proportions, which characterizes the facial features in a proportion form. Finally we introduce a similarity metric as the likeness metric based on the Modified Hausdorff Distance (MHD) which allows us to optimize the configuration of facial elements, maximizing likeness while satisfying a number of constraints. The effectiveness of our algorithm is demonstrated with experimental results

Mean value coordinates–based caricature and expression synthesis

We present a novel method for caricature synthesis based on mean value coordinates (MVC). Our method can be applied to any single frontal face image to learn a specified caricature face pair for frontal and 3D caricature synthesis. This technique only requires one or a small number of exemplar pairs and a natural frontal face image training set, while the system can transfer the style of the exemplar pair across individuals. Further exaggeration can be fulfilled in a controllable way. Our method is further applied to facial expression transfer, interpolation, and exaggeration, which are applications of expression editing. Additionally, we have extended our approach to 3D caricature synthesis based on the 3D version of MVC. With experiments we demonstrate that the transferred expressions are credible and the resulting caricatures can be characterized and recognized

Fast and Exact Discrete Geodesic Computation Based on Triangle-Oriented Wavefront Propagation

Computing discrete geodesic distance over triangle meshes is one of the fundamental problems in computational geometry and computer graphics. In this problem, an effective window pruning strategy can significantly affect the actual running time. Due to its importance, we conduct an in-depth study of window pruning operations in this paper, and produce an exhaustive list of scenarios where one window can make another window partially or completely redundant. To identify a maximal number of redundant windows using such pairwise cross checking, we propose a set of procedures to synchronize local window propagation within the same triangle by simultaneously propagating a collection of windows from one triangle edge to its two opposite edges. On the basis of such synchronized window propagation, we design a new geodesic computation algorithm based on a triangle-oriented region growing scheme. Our geodesic algorithm can remove most of the redundant windows at the earliest possible stage, thus significantly reducing computational cost and memory usage at later stages. In addition, by adopting triangles instead of windows as the primitive in propagation management, our algorithm significantly cuts down the data management overhead. As a result, it runs 4-15 times faster than MMP and ICH algorithms, 2-4 times faster than FWP-MMP and FWP-CH algorithms, and also incurs the least memory usage

PCA Based Robust Motion Data Recovery.

Human motion tracking is a prevalent technique in many fields. A common difficulty encountered in motion tracking is the corrupted data is caused by detachment of markers in 3D motion data or occlusion in 2D tracking data. Most methods for missing markers problem may quickly become ineffective when gaps exist in the trajectories of multiple markers for an extended duration. In this paper, we propose the principal component eigenspace based gap filling methods that leverage a training sample set for estimation. The proposed method is especially beneficial in the scenario of motion data with less predictable or repeated movement patterns, and that of even missing entire frames within an interval of a sequence. To highlight algorithm robustness, we perform algorithms on twenty test samples for comparison. The experimental results show that our methods are numerical stable and fast to work

Recent Advances in Liver Engineering With Decellularized Scaffold

Liver transplantation is currently the only effective treatment for patients with end-stage liver disease; however, donor liver scarcity is a notable concern. As a result, extensive endeavors have been made to diversify the source of donor livers. For example, the use of a decellularized scaffold in liver engineering has gained considerable attention in recent years. The decellularized scaffold preserves the original orchestral structure and bioactive chemicals of the liver, and has the potential to create a de novo liver that is fit for transplantation after recellularization. The structure of the liver and hepatic extracellular matrix, decellularization, recellularization, and recent developments are discussed in this review. Additionally, the criteria for assessment and major obstacles in using a decellularized scaffold are covered in detail

High Relief from Brush Painting

Relief is an art form part way between 3D sculpture and 2D painting. We present a novel approach for generating a texture-mapped high-relief model from a single brush painting. Our aim is to extract the brushstrokes from a painting and generate the individual corresponding relief proxies rather than recovering the exact depth map from the painting, which is a tricky computer vision problem, requiring assumptions that are rarely satisfied. The relief proxies of brushstrokes are then combined together to form a 2.5D high-relief model. To extract brushstrokes from 2D paintings, we apply layer decomposition and stroke segmentation by imposing boundary constraints. The segmented brushstrokes preserve the style of the input painting. By inflation and a displacement map of each brushstroke, the features of brushstrokes are preserved by the resultant high-relief model of the painting. We demonstrate that our approach is able to produce convincing high-reliefs from a variety of paintings(with humans, animals, flowers, etc.). As a secondary application, we show how our brushstroke extraction algorithm could be used for image editing. As a result, our brushstroke extraction algorithm is specifically geared towards paintings with each brushstroke drawn very purposefully, such as Chinese paintings, Rosemailing paintings, etc

Fabrication and Characterization of Al/NiO Energetic Nanomultilayers

The redox reaction between Al and metallic oxide has its advantage compared with intermetallic reaction and Al/NiO nanomutlilayers are a promising candidate for enhancing the performance of energetic igniter. Al/NiO nanomutlilayers with different modulation periods are prepared on alumina substrate by direct current (DC) magnetron sputtering. The thicknesses of each period are 250 nm, 500 nm, 750 nm, 1000 nm, and 1500 nm, respectively, and the total thickness is 3 μm. The X-ray diffraction (XRD) and scanning electron microscope (SEM) results of the as-deposited Al/NiO nanomutlilayers show that the NiO films are amorphous and the layered structures are clearly distinguished. The X-ray photoelectron spectroscopy (XPS) demonstrates that the thickness of Al2O3 increases on the side of Al monolayer after annealing at 450°C. The thermal diffusion time becomes greater significantly as the amount of thermal boundary conductance across the interfaces increases with relatively smaller modulation period. Differential scanning calorimeter (DSC) curve suggests that the energy release per unit mass is below the theoretical heat of the reaction due to the nonstoichiometric ratio between Al and NiO and the presence of impurities