自适应阈值局部特征融合的人脸识别

针对局部二值模式(local binary pattern,LBP)提取图像纹理特征时阈值不能自适应以及缺少方向信息的问题,文章提出了一种自适应阈值局部特征融合的人脸识别算法。首先对原始人脸图像进行分块处理,提取每个子块自适应阈值均匀模式的局部二值模式(uniform local binary pattern,ULBP)特征和局部梯度编码(local gradient coding,LGC)特征;然后,将2种局部特征串联在一起融合为1种特征,得到每个子块的直方图特征,把每个子块图像的信息熵作为直方图加权系数,将所有子块图像的直方图乘以各自的加权系数,连接得到整幅人脸图像的直方图特征;最后用支持向量机(support vector machine,SVM)分类器进行识别分类。在ORL、Yale、FERET(be、bj、bf子库)人脸数据库上进行试验,该人脸识别算法分别得到了99.0%、98.7%、87.5%、93.0%、88.5%的识别率,正确识别率较高,算法对其他纹理分类、目标识别也具有一定的参考价值。     

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

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

基于LTP和局部PCA的低分辨率人脸识别算法

针对单特征提取人脸识别算法识别率较低的问题,提出一种基于多特征融合的低分辨率人脸识别算法.首先,利用局部三值模式(local ternary pattern, LTP)和局部主成分分析(principal component analysis, PCA)提取低分辨率人脸特征,将其分割成若干块并统计各子块的特征直方图;其次,融合各子块的局部主成分分析和局部三值模式的直方图并级联各个分块,作为新的人脸特征;最后,通过卡方距离度量训练集和测试集直方图的相似度,采用最近邻算法识别相似度.实验结果表明,所提算法对环境和光照变化更具鲁棒性,识别率得到有效提升.     

CLAHE融合低频DCT系数重变换的人脸识别算法

针对人脸识别中由于伪装(如围巾、太阳镜和头发)或其他物体引起的面部遮挡而严重影响识别率的问题,提出了CLAHE融合低频DCT系数重变换的人脸识别算法。首先将图像划分成多个互不重叠的局部小块,使用受限直方图均衡化对局部子块进行局部对比拉伸以实现去噪;然后,通过缩减适当数目的低频DCT系数来消除人脸图像中的光照变化;最后,利用核主成分分析进行特征提取,最近邻分类器完成最终的人脸识别。在扩展Yale B、FRGC V2.0及一个户外人脸数据库上的实验验证了所提算法的有效性及鲁棒性。实验结果表明,相比几种线性表示算法,本文算法在处理鲁棒人脸识别时取得了更高的识别率。     

仿生算法与主成分分析相融合的人脸识别方法

基于人脸特征提取问题可以转化为组合优化问题这一思路,提出了仿生算法与主成分分析相融合的人脸识别算法.该方法先通过主成分分析方法得到人脸特征子空间;然后在已有特征的基础上,分别通过遗传算法与离散粒子群算法进一步提取出可使识别正确率达到最高的人脸图像特征.在ORL人脸库上的实验结果表明:与传统的主成分分析相比,该方法不仅能进一步降低特征子空间的维数,从而提高识别速度,而且能获得更高的识别率.     

基于子图特征组合的人脸识别技术研究

提出了一种基于子图特征组合的人脸特征提取方法,并结合BP神经网络给出一种人脸识别模型.模型首先将人脸图片分割为子图,然后对每个子图进行离散余弦变换并选择最大的余弦系数表示该子图,最后将这些系数组合为向量作为整幅图像的特征.我们选择BP神经网络作为人脸识别模型中的分类器,并通过实验优化相关参数.基于ORL数据库的模拟实验表明,所提出的特征提取算法是有效的,并且模型具有较高的识别率.     

复合不变矩和GLCM特征加权融合的人脸识别研究

为了提高人脸识别率,提出一种基于复合不变矩和灰度共生矩阵的特征提取方法 CHu-GLCM。首先将人脸图像分割成许多大小相等的子块,提取所有子块的不变矩特征,并按照一定的权重系数把所有子块的不变矩特征组合起来作为整幅人脸图像的复合不变矩特征,再提取人脸图像的灰度共生矩阵;然后利用支持向量机在决策层把人脸图像的复合不变矩特征和灰度共生矩阵进行加权融合;最后分别在ORL和YALE人脸库中进行实验检测。研究结果表明:在训练样本个数为5时,与传统的特征提取方法相比,给出的方法可以使人脸识别率至少提高4个百分点。     

基于改进LTP算子和稀疏表示的人脸表情识别

为了提高实际应用中的人脸表情识别率,本文提出了改进局部三值模式算法(ILTP),并结合稀疏表达分类器(SRC)组成新的算法应用于人脸表情识别.该算法首先利用ILTP算法对人脸表情图像进行特征提取,然后将得到的图像顶层特征数据和图像底层特征数据作为SRC的输入,从而完成人脸表情分类.基于JAFFE数据的实验结果表明:改进算法的人脸表情识别率达70.48%,具有较高的可行性.     

基于小波变换的人脸图像压缩

传统的人脸识别方法,在对压缩的人脸图像进行识别时,要先进行图像的“全解压”操作,然后再进行识别,这无疑大大限制了识别系统性能的提高.为提高压缩人脸识别中压缩域特征提取的有效性和识别率,提出一种支持在压缩数据中提取识别特征的人脸图像压缩算法,反对称双正交小波变换子带编码的方法.与DCT法相比较,在获得高压缩比的同时,较好地保留了人脸图像的识别特征和主观质量.     

基于fast PCA和K-CV优化SVM的人脸识别算法研究

为了解决支持向量机(Support Vector Machine, SVM)分类器人脸识别率不高的问题,提出了一种快速主成分分析法(fast Principal Component Analysis, fast PCA)与优化参数支持向量机分类器相结合的人脸识别算法.首先,在传统的PCA算法理论基础上提出一种快速PCA算法,用于人脸图像的降维和特征提取,减少特征提取时间,降低计算量,缩短SVM识别时间;其次,利用K折交叉验证法(K-fold cross-validation method,K-CV)联合改进的网格搜索法对SVM分类器最优参数进行搜索,减少最优参数搜索时间,提高算法人脸识别率和泛化能力.在ORL人脸库实验结果表明:该算法在每类训练样本数大于5时,人脸识别率为100%;在训练样本较少时,仍然保持较高识别率.与一般的SVM算法及PCA算法比较,该算法平均识别率提高了0.61%～8.92%.     

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.     

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.     

Tracking data management using topology of moving object database system for moving object constrained trajectory in LBS application

Advances in wireless technologies and positioning technologies and spread of wireless devices, an interest in LBS (Location Based Service) is arising. To provide location based service, tracking data should have been stored in moving object database management system (called MODBMS) with proper policies and managed efficiently. So the methods which acquire the location information at regular time intervals then, store and manage have been studied. In this paper, we suggest tracking data management techniques using topology that is corresponding to the moving path of moving object. In our techniques, we update the MODBMS when moving object arrived at a street intersection or a curved road which is represented as the node in topology and predict the location at past and future with attribute of topology and linear function. In this technique, location data that are corresponding to the node in topology are stored, thus reduce the number of update and amount of data. Also in case predicting the location,because topology are used as well as existing location information, accuracy for prediction is increased than applying linear function or spline function.