基于相关性与纹理度量的SVM隐写分析算法

为提高图像信息隐藏正确检测率,扩展隐写分析算法的适用范围,提出了一种新的基于最低有效位(LSB)的隐写分析方法,引入了一组基于相邻像素相关性和图像纹理复杂度的差值关系的高阶统计矩作为特征矢量。基于此特征量构造分类器,采用支持向量机(SVM)进行训练和分类。对1 600幅BMP图像在不同嵌入率情形下进行仿真实验,并与经典的RS(regular singular)隐写算法和GPC(gray-levelplane crossing)算法进行对比分析。结果表明,针对原始无损存储图像,基于该文建立的分类器的准确率高于目前的主流算法识别掩密图像,具有较可靠的盲检测性能。     

基于相关性与纹理度量的SVM隐写分析算法

为提高图像信息隐藏正确检测率,扩展隐写分析算法的适用范围,提出了一种新的基于最低有效位(LSB)的隐写分析方法,引入了一组基于相邻像素相关性和图像纹理复杂度的差值关系的高阶统计矩作为特征矢量。基于此特征量构造分类器,采用支持向量机(SVM)进行训练和分类。对1600幅BMP图像在不同嵌入率情形下进行仿真实验,并与经典的RS(regular singular)隐写算法和GPC(gray-level plane crossing)算法进行对比分析。结果表明,针对原始无损存储图像,基于该文建立的分类器的准确率高于目前的主流算法识别掩密图像,具有较可靠的盲检测性能。     

基于二重扰动SVM集成分类的JPEG图像隐写检测

针对目前大部分JPEG隐写分析方法主要采用单一支持向量机分类器,可能产生泛化能力恶化、分类精度难以提高等问题,提出了一种新的基于二重扰动SVM集成分类的JPEG图像隐写检测方法.利用多项式核函数和高斯核函数构造混合核函数模型,并用主成分分析法进行特征变换,去除冗余信息,最后在变换后的特征空间上进行模型参数和特征的二重扰动产生成员分类器,并用多数投票法对它们进行组合.实验结果表明,与传统方法相比,具有更高的JPEG隐写图像检测率.     

基于二重扰动SVM集成分类的JPEG图像隐写检测

针对目前大部分JPEG隐写分析方法主要采用单一支持向量机分类器,可能产生泛化能力恶化、分类精度难以提高等问题,提出了一种新的基于二重扰动SVM集成分类的JPEG图像隐写检测方法.利用多项式核函数和高斯核函数构造混合核函数模型,并用主成分分析法进行特征变换,去除冗余信息,最后在变换后的特征空间上进行模型参数和特征的二重扰动产生成员分类器,并用多数投票法对它们进行组合.实验结果表明,与传统方法相比,具有更高的JPEG隐写图像检测率.     

一种基于无监督学习的MB1隐写分析方法

为了提高针对混杂小样本集的MB1隐写算法的检测率,提出了一种泛化能力较强的MB1隐写分析方法.通过分析多种图像特征,在离散余弦变化(DCT)域选取对隐写敏感易变的特征,包括变分特征、块边界度量特征、共生矩阵特征和马尔可夫特征组成的108维特征向量,并以无监督学习中的支持向量数据描述法(SVDD)为分类器,使用含有混杂样本的小样本集进行训练,测试算法对隐写图像的检测率.实验结果表明,当检测相对嵌入率为40%以上的隐写图像时,检测率可靠度达到96%以上,明显高于其他2种基于支持向量机的经典算法.这说明本方法打破了其他方法对训练样本集的限制,提高了对混杂小样本集的MB1隐写算法的检测率.但由于它对混杂样本具有一定的容忍度,对较小嵌入率的隐写图像的检测率稍低.     

基于污染数据分析的隐写分析方法

隐写分析是信息隐藏技术的重要分支,大量的隐写软件利用彩色及灰度图像的最低有效比特位(LSB)隐藏秘密消息.基于污染数据分析,针对图像空域LSB隐写算法提出了一种新的隐写分析方法, 该方法不仅可以快速有效地检测出图像中秘密消息的存在性,同时还可以精确地估计出连续及随机间隔嵌入算法下所嵌入秘密消息的长度.     

针对空域明文LSB隐写的消息提取方法

在嵌入消息为明文的情况下,利用中英文字节比特的统计特性,改进了已有的针对空域连续最低有效位(LSB)隐写的消息提取方法,提高了提取消息的准确度;提出了一种针对空域随机LSB隐写的消息提取方法.该方法首先求出恢复隐写密钥的唯一解距,然后穷举隐写密钥空间,对每个密钥确定长度为T的隐写路径,提取此隐写路径上像素的LSB,并从该LSB序列的第一个比特开始间隔7采样获得一条子序列,若该子序列为全0或全1,则该密钥为真密钥,否则为伪密钥;同时还研究了漏检的情况.实验结果表明了本文方法的可行性和有效性.     

基于主成分分析的并行特征融合JPEG隐写检测

针对目前JPEG隐写检测方法的特征选取缺乏理论依据,特征冗余度高的问题,提出一种基于主成分分析进行并行特征融合的JPEG隐写分析方法.首先分析所选特征之间的互补性,然后用主成分分析进行特征变换,去除冗余信息,最后将特征并行融合.实验结果表明,和串行特征融合相比,本文方法具有更高的JPEG隐写图像检测率和更快的分类速度.     

基于深度置信网络与梯度提升决策树的糖尿病检测方法

针对糖尿病数据特征维度较高,单一分类器过度拟合导致性能受限,不能较好对糖尿病进行分类识别这一问题,提出了一种深度置信网(Deep Belief Networks,DBN)融合梯度提升决策树(Gradient Boosting Decision Tree,GBDT)的糖尿病检测算法(DBN-GBDT).该算法利用DBN对海量数据的特征提取和拟合复杂模型的能力,GBDT算法具有很强的泛化能力,将DBN用于特征提取和特征降维,GBDT方法用于分类.将提出的算法用于糖尿病数据分类识别,并与DBN、GBDT、SVM和随机森林四种经典方法进行对比.实验结果表明,该算法分类精度较高,稳定性更强,为糖尿病检测提供了新的方法.     

基于Multiwavelet广义高斯模型的图像盲隐写分析

针对目前图像盲隐写分析中提取的特征的有效性不高问题,提出了一种新的基于Multiwavelet广义高斯模型的图像盲隐写分析算法.采用Multiwavelet变换对样本图像进行多尺度分解,并使用广义高斯模型对每个子带的Multiwavelet系数进行建模,提取参数特征.利用这些参数特征训练支持向量机SVM(support vector machine)构成盲隐写分析算法的分类检测器.通过对大量图像样本进行测试,实验结果表明,和经典的Farid方法相比,提出的盲隐写分析算法提取的图像特征更加有效,具有更高的正确检测率.     

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.