基于ARAP参数化算法的约束纹理映射

针对纹理映射参数化过程中几何度量的扭曲问题,文章提出了基于尽可能保形(as-rigid-as-possible,ARAP)参数化的约束纹理映射算法。运用基于局部/整体思想的ARAP算法参数化三维人脸网格,与其他算法相比,运用ARAP算法参数化后的三维人脸网格三角形角度变形和面积变形均达到最小,进而使得纹理映射的形变最小;为降低在嵌入过程中的网格扭曲程度,采用按比例嵌入的方式,不仅使映射效果更加自然,而且减少了优化次数。将多幅人脸图像作为纹理进行映射的结果表明,该方法能够取得良好的试验效果,且优化次数明显降低。     

一种个性化人脸游戏引擎设计

个性化人脸在游戏人物造型技术中的地位变得越来越重要.设计一种基于照片的个性化人脸游戏引擎.在定义一种面向游戏且能有效支持个性化变形和实时显示的三维中性人脸模型数据结构基础上,使用径向基函数插值方法变形中性人脸模型到特定人脸模型.同时给出了一种基于特征约束的连续多分辨率快速纹理映射方法.实验表明,使用引擎绘制的个性化人脸,满足游戏中人物造型所必须平衡的精确性和效率两方面的要求.     

基于分类的纹理映射方法综述

对纹理映射的算法进行分类,从二维纹理映射和三维纹理映射两个大类分别进行阐述.二维纹理映射包括纹理的获取方法和映射方法两部分,映射方法中涵盖了参数化曲面、非参数化曲面和基于小变形的纹理映射方法的介绍.三维纹理映射介绍了基于三维纹理函数的映射,包括三维纹理的定义和映射方法研究;由于在虚拟世界的建造中对真实物体计算机重建的需要,就用于实物计算机三维重建中实物三维表面纹理的提取和映射算法等进行了研究和探讨.     

基于分类的纹理映射方法综述

对纹理映射的算法进行分类,从二维纹理映射和三维纹理映射两个大类分别进行阐述.二维纹理映射包括纹理的获取方法和映射方法两部分,映射方法中涵盖了参数化曲面、非参数化曲面和基于小变形的纹理映射方法的介绍.三维纹理映射介绍了基于三维纹理函数的映射,包括三维纹理的定义和映射方法研究;由于在虚拟世界的建造中对真实物体计算机重建的需要,就用于实物计算机三维重建中实物三维表面纹理的提取和映射算法等进行了研究和探讨.     

基于双重嵌入的三维数据模型数字水印方法研究

三维空间模型数据经过攻击后,其纹理坐标的值发生了改变,对应的纹理映射坐标的值没有发生改变,因而,通过对三维空间模型三维网格进行嵌入,同时对纹理映射坐标也进行水印信息嵌入,不但解决了单个空间模型算法对部分攻击鲁棒性低的问题,而且解决了目前具有纹理映射数据的三维空间模型数据在文件攻击和模型攻击后无法检测出水印的问题,对三维数据模型数据的版权保护具有重要意义.     

三分细分模式的纹理映射算法

纹理映射是计算机真实感绘图过程中一个重要的环节.本文针对传统纹理映射技术存在纹理接缝及收敛速度慢的问题,将基于网格曲面的三分细分模式应用于纹理映射,设计了基于三分细分模式的纹理映射算法.该算法首先对曲面控制网格和纹理图像进行相同次数的三分细分,并为所得的曲面网格坐标和纹理图像坐标建立索引表,然后通过索引表建立它们之间的对应关系,以获得纹理曲面.仿真实验结果表明,基于三分细分的纹理映射在保证较快的网格曲面收敛速度的同时,可获得较高的纹理质量.     

基于Kinect 2的三维人脸个性化建模

提出一种基于五官形状特征点以及人脸肌肉函数的优化Kinect 2 个性人脸网格的算法,然后通过自适应uv贴图,使结果更符合个性人脸特征.首先,通过提取彩色图的特征点位置获取个性人脸的x,y 空间的特征信息,基本的五官形状特征点为83 个,通过相似三角关系在鼻梁和鼻翼处添加了6 个特征点以丰富五官形状特征信息.肌肉形状特征约束方面,综合肌肉形状约束量有43 个.其次,通过Kinect 2 人脸个性化建模得到中间模型,同时也获得了五官形状和肌肉形状特征的深度先验信息.接着使用基于拉普拉斯算子的微分网格变形算法对Kinect2 的中间模型进行五官优化及肌肉形状约束,通过对比ASM、正则化均值漂移和face + + 算法检测的人脸特征点来选择更精确的五官位置.最后,为了让人脸更具有真实感,还通过平面微分网格形变实现了uv 自动贴图,提升了maya中手动调整uv 坐标的准确性和效率.同时,使用次表面散射光照模型来使人脸皮肤的真实感加强.实验表明,本文所采用的三维人脸模型的个性化变形方法能使Kinect2 模型更好地符合个性人脸特征,这将为后期的表情生成和动画制作奠定良好的基础.     

基于单幅人脸正视图的个性化人脸三维重建

人脸三维模型在很多领域有着广泛的应用,如何有效获取人脸三维模型已成为研究热点.基于单幅人脸正视图的个性化人脸三维重建方法,指出采用单幅人脸正视图进行三维重建存在的两大瓶颈问题.针对前期工作中为了解决纹理信息不足的问题,提出的基于顶点一环邻域及面片分类的纹理映射方法进行改进和完善,在此基础上设计实现一套基于单幅人脸正视图的人脸三维重建系统.实验结果表明,改进后的基于顶点一环邻域及面片分类的纹理映射方法可以有效解决此前出现的耳朵区域纹理信息不合理问题.     

一种基于MPEG-4的三维人脸表情动画算法

面向模型基人脸视频编解码领域,提出了一种基于MPEG-4的三维人脸表情动画算法.首先对编码端发送视频的首帧图像,利用Adaboost+Camshift+AAM(active appearance model算法检测人脸和定位特征点,接着特定化一个简洁人脸通用网格模型得到FDP(facial definition parameter);对于得到的FDP,解码端先用其特定化一个精细人脸通用网格模型,然后基于肌肉模型和参数模型相结合的方式来生成人脸表情动画,同时对人脸功能区进行划分.实验表明,该算法在FAP(facial animation parameter)流的驱动下可以生成真实感较强的三维人脸表情动画.     

基于参数曲面的交互式纹理映射研究(英文)

针对纹理映射中复杂物体表面重新参数化困难及映射变形问题,提出一种交互式纹理映射方法,采用NURBS曲面代替简单的中介曲面,用它近似包围所要映射物体的外表面,将纹理映射到曲面上实现参数化,通过控制NURBS曲面来调整纹理映射的效果。实验表明,该方法可以灵活地调整纹理区域,减小纹理变形。     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.