Expressive Facial Gestures From Motion Capture Data

Human facial gestures often exhibit such natural stochastic variations as how often the eyes blink, how often the eyebrows and the nose twitch, and how the head moves while speaking. The stochastic movements of facial features are key ingredients for generating convincing facial expressions. Although such small variations have been simulated using noise functions in many graphics applications, modulating noise functions to match natural variations induced from the affective states and the personality of characters is difficult and not intuitive. We present a technique for generating subtle expressive facial gestures (facial expressions and head motion) semi‐automatically from motion capture data. Our approach is based on Markov random fields that are simulated in two levels. In the lower level, the coordinated movements of facial features are captured, parameterized, and transferred to synthetic faces using basis shapes. The upper level represents independent stochastic behavior of facial features. The experimental results show that our system generates expressive facial gestures synchronized with input speech.     

Results of a User Study on 2D Hurricane Visualization

We present the results from a user study looking at the ability of observers to mentally integrate wind direction and magnitude over a vector field. The data set chosen for the study is an MM5 (PSU/NCAR Mesoscale Model) simulation of Hurricane Lili over the Gulf of Mexico as it approaches the southeastern United States. Nine observers participated in the study. This study investigates the effect of layering on the observer's ability to determine the magnitude and direction of a vector field. We found a tendency for observers to underestimate the magnitude of the vectors and a counter‐clockwise bias when determining the average direction of a vector field. We completed an additional study with two observers to try to uncover the source of the counter‐clockwise bias. These results have direct implications to atmospheric scientists, but may also be able to be applied to other fields that use 2D vector fields.     

^125I,^131I诱发小鼠精子畸形发生率比较

本文选用 ICR 雄性小鼠,经腹腔分别注射不同剂量的~(125)I 及~(131)I,观察并比较它们对小鼠精子畸形发生率的影响及染毒后睾丸中放射性活度的变化。实验结果表明:(1)~(125)I 染毒后4—5周,0、185、370和555 kBq 各组精子畸形发生率分别为9.00‰、9.57‰、11.6‰及13.9‰;~(131)I 染毒后4—5周,上述各组精子畸形发生率分别为8.50‰、12.5‰、14.7‰和15.5‰;在相同注入量下,~(125)I 与~(131)I 诱发小鼠精子畸形发生率的差异各组均不显著(X~2检验,p>0.05)。(2)~(125)I、~(131)I 染毒后2h 至7天内,两者在睾丸中的放射性活度及变化规律相似,即在染毒后2h 达最高值,每克睾丸中~(125)I 和~(131)I 的放射性活度分别占初始注入量(370 kBq)的0.72％和0.50％,然后迅速下降,至一周时,仅分别占初始注入量的0.035％和0.011％。     

PLC在电厂输煤系统中的应用

介绍了可编程序控制器在电厂皮带机输煤控制系统中的应用，详细说明了远程I／O控制系统的特点和功能。     

I．O．T．旧梦成真

该文较详细地介绍了Ｉ．Ｏ．Ｔ管的发展历程，其特点及工作方式。     

工字钢腿腰延伸系数均匀分配的计算方法

对轧制工字钢采用一种新的腿腰划分方法，用计算机迭代计算，使腿腰延伸系数趋于均匀更趋于实际，使孔型设计更为合理。     

An economical synthesis of the major sex attractant of the oak leaf roller—cis-10-tetradecenyl acetate

The major sex attractant of the oak leaf roller (Archips semiferanus Walker),cis-10-tetradecenyl acetate (I), was synthesized in 55–62% overall yield by a highly economical route from inexpensive azelaic acid (II).Authorized as Paper No. 4779 in the Journal Series of the Pennsylvania Agricultural Experiment Station.     

Importance Sampling Microfacet‐Based BSDFs using the Distribution of Visible Normals

We present a new approach to microfacet‐based BSDF importance sampling. Previously proposed sampling schemes for popular analytic BSDFs typically begin by choosing a microfacet normal at random in a way that is independent of direction of incident light. To sample the full BSDF using these normals requires arbitrarily large sample weights leading to possible fireflies. Additionally, at grazing angles nearly half of the sampled normals face away from the incident ray and must be rejected, making the sampling scheme inefficient. Instead, we show how to use the distribution of visible normals directly to generate samples, where normals are weighted by their projection factor toward the incident direction. In this way, no backfacing normals are sampled and the sample weights contain only the shadowing factor of outgoing rays (and additionally a Fresnel term for conductors). Arbitrarily large sample weights are avoided and variance is reduced. Since the BSDF depends on the microsurface model, we describe our sampling algorithm for two models: the V‐cavity and the Smith models. We demonstrate results for both isotropic and anisotropic rough conductors and dielectrics with Beckmann and GGX distributions.     

A randomized algorithm for natural object colorization

Natural objects often contain vivid color distribution with wide variety of colors. Conventional colorization techniques, on the other hand, produce colors that are relatively flat with little color variation. In this paper, we introduce a randomized algorithm which considers not only the value of target color but also the distribution of target color. In essence, our algorithm paints a color distribution to a region which synthesizes color distribution of a natural object. Our approach models the correlation between intensity and color in HSV color space in terms of H – S, H – V and S – V joint histogram. During the colorization process, we randomly swap and reassign color of a pixel to minimize a cost function that measures color consistency to its neighborhood and intensity‐to‐color correlation captured in the joint histogram. We tested our algorithm extensively on many natural objects and our user study confirms that our results are more vivid and natural compared to results from previous techniques.     

Laplacian colormaps: a framework for structure‐preserving color transformations

Mappings between color spaces are ubiquitous in image processing problems such as gamut mapping, decolorization, and image optimization for color‐blind people. Simple color transformations often result in information loss and ambiguities, and one wishes to find an image‐specific transformation that would preserve as much as possible the structure of the original image in the target color space. In this paper, we propose Laplacian colormaps, a generic framework for structure‐preserving color transformations between images. We use the image Laplacian to capture the structural information, and show that if the color transformation between two images preserves the structure, the respective Laplacians have similar eigenvectors, or in other words, are approximately jointly diagonalizable. Employing the relation between joint diagonalizability and commutativity of matrices, we use Laplacians commutativity as a criterion of color mapping quality and minimize it w.r.t. the parameters of a color transformation to achieve optimal structure preservation. We show numerous applications of our approach, including color‐to‐gray conversion, gamut mapping, multispectral image fusion, and image optimization for color deficient viewers.