基于测地线采样的三维表情人脸识别

针对测地线类人脸识别算法速度慢的问题, 提出了一种基于测地线环带特征点采样的三维人脸识别方法。首先根据测地线距离以鼻尖点为中心在人脸表面绘制一系列等距测地线环; 再对测地线环带进行特征点采样构成人脸描述特征, 并进行PCA(Principal Component Analysis)运算和去相关处理; 最终使用投票法融合各环带单独结果以识别人脸。在FaceWareHouse 表情三维人脸数据集上进行的识别实验表明, 该方法识别准确率与传统测地线法相当, 而识别时间有明显减少, 平均识别时间由2. 55 s 降至0. 624 3 s。     

基于区域改进LBP的三维人脸识别

针对三维人脸识别中的表情问题,提出一种基于区域改进局部二值模式(LBP)的三维人脸识别算法.首先将预处理后的三维点云转化为深度图并进行归一化处理;然后根据表情对人脸的影响,利用二元掩膜提取人脸的刚性、半刚性和非刚性区域;对每个局部区域,计算其改进LBP特征,并用等价模式进行表征;最后使用稀疏表示分类器(SRC)对单个局部区域进行识别实验,并使用带权重的稀疏表示分类器(W-SRC)对刚性和半刚性区域进行决策级融合,给出最终识别结果.在FRGC v2.0人脸数据库上的实验结果表明,该方法具有较好的鲁棒性和较高的识别精度.     

三维人脸表情识别研究与进展

随着人机交互与情感计算的快速发展,人脸表情识别已经成为研究热点.二维人脸表情图像对于姿态变化与光照变化不具备鲁棒性,为了解决这些问题,研究者们使用三维人脸表情数据进行表情分析研究.本文在前人工作的基础上,对三维人脸表情识别中的对齐与跟踪、表情数据库、特征提取等方面进行综述.指出人脸表情识别的热点与趋势以及存在的局限,并对未来发展进行了展望.     

基于HMAX模型的仿生人脸识别算法

为了提高人脸识别效率,减小特征提取的时间消耗,本文提出一种基于改进HMAX模型的类脑识别算法,通过模拟生物视觉皮层的信息处理机制,构建了一个五层结构的分层网络用以提取目标图像的不变特征并进行识别.在S1层应用小波分解模拟视皮层V1简单细胞对目标图像进行滤波;在C1层进行特征提取,采用SVDP算法代替标准HMAX模型中的最大值操作,得到对光照、表情、姿态不变性的代表特征;最后,在VTU层对人脸图像进行分类.实验表明,改进后的算法在对样本进行识别时,能够有效降低特征提取的时间开销,同时也提升了识别效率.     

基于局部二元模式和重采样双向2DLDA的人脸识别算法

针对人脸识别中存在的小样本问题及光照变化、 表情变化等导致的识别问题, 提出一种基于局部二元模式和重采样双向2DLDA的人脸识别算法
LBP-RB2DLDA. AR人脸库的实验结果表明, 该算法具有较高的识别率和鲁棒性.     

一种基于压缩感知的单样本人脸识别方法

针对人脸姿态、光照和表情等各方面原因引起人脸识别率不高的问题,提出了一种基于单样本特征点形变成冗余样本的压缩传感人脸识别方法.将人脸图像信号进行小波变换得到系数的稀疏表示,采用高斯随机测量矩阵进行测量得到离散人脸单样本,基于特征点形变人脸三维模型生成冗余样本,通过稀疏特征点正交匹配追踪非线性重建算法重建冗余图像进行人脸识别.仿真实验结果表明,所提出的算法相对于同类算法,时间复杂度较低、精确度较高、鲁棒性较强,且随复杂环境变化,其优势更明显.     

基于混合Gauss模型的鲁棒性人脸识别算法

针对人脸图像受表情、光照、角度变化等因素影响,传统算法难以获得较理想的人脸识别结果问题,提出一种基于混合Gauss模型的鲁棒人脸识别算法.先将每副图像划分成子块,提取其方向梯度直方图特征,并加入子块相应的空间位置信息产生人脸图像的局部特征向量;再采用全部图像的局部特征向量训练混合Gauss模型生成人脸特征向量;最后采用最小二乘支持向量机建立人脸识别分类器,实现人脸匹配与识别.采用ORL,Yale和CIGIT人脸库进行仿真对比测试,仿真结果表明,该算法的人脸识别率高于其他人脸识别算法,对光照、角度、表情等有较强的鲁棒性,且可以获得更快的人脸识别速度.     

DCT和2DPCA降维与识别算法的比较研究

首先分析了DCT用于特征降维的可行性,并给出了DCT特征降维的基本原理.然后以人脸识别和人脸表情识别为背景,在DCT和2DPCA具有相当的降维效果时,给出了DCT比2DPCA具有较高的人脸识别率和人脸表情识别率的理论分析.最后,利用AT&T人脸库和JAFFE人脸表情库,分别对DCT和2DPCA进行了比较仿真实验.     

基于小波变换和支持向量机的人脸识别研究

人脸识别是机器视觉、模式识别等领域的研究热点,具有广阔的应用前景.文章利用小波变换对人脸图像进行预处理,减少表情变化对人脸识别的影响;根据PCA法,将处理后的人脸图像映射到相互正交的特征脸坐标轴上,实现了特征降维;利用支持向量机分类模型对人脸图像在特征脸坐标轴上的投影向量进行识别,并在ORL和Yale人脸库上进行实验,...     

基于2DPCA和RBF神经网络相结合的人脸识别算法

人脸识别已成为图像处理工程领域研究的一个热点,本文首先简述了基于模型匹配的人脸识别方法,该算法利用人的脸部特征规律建立一个立体可调的模型框架,着重于解决人脸识别过程中的观察角度、遮挡和表情变化等因素的影响;文中最后提出了2DPCA和RBF神经网络相结合的人脸识别方法,并将该方法应用于ORL人脸库。实验结果表明,这种方法不仅具有较好的人脸图像识别能力,而且能够明显缩短识别算法的时间。     

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.