一种基于单像素指纹边界的信息隐藏技术

利用信息隐藏技术提高身份认证系统的安全性是一种有效方法,通过将用户身份信息中的指纹、人脸以及口令融合进行多模态认证提高身份认证安全性。而将口令信息嵌入到指纹图像中实现口令信息的隐藏及存储,既能够满足安全认证的需要,又能够保证口令存储的安全性能。本文首先介绍了基于指纹图像为载体的口令信息隐藏技术,然后将细化后指纹图像按单元块进行像素划分,再将口令信息按照Hash函数嵌入到单元中心像素点上,相当于构成一个二元信息稀疏矩阵。该方法不仅保证了指纹图像的质量,还确保了指纹图像骨架脊线的质量,从而确保了指纹识别的精度。最后,通过实验结果表明,本文提出的基于单像素指纹边界的信息隐藏技术能够较好地将信息嵌入到指纹图像中,具有较低修改率的同时提高了PSNR峰值信噪比量,而且与其它方法相比,本文提出的方法对指纹识别正确率影响较小。     

一种基于单像素指纹边界的信息隐藏技术

利用信息隐藏技术提高身份认证系统的安全性是一种有效方法，通过将用户身份信息中的指纹、人脸以及口令融合进行多模态认证提高身份认证安全性。而将口令信息嵌入到指纹图像中实现口令信息的隐藏及存储，既能够满足安全认证的需要，又能够保证口令存储的安全性能。本文首先介绍了基于指纹图像为载体的口令信息隐藏技术，然后将细化后指纹图像按单元块进行像素划分后，将口令信息按照Hash函数嵌入到单元中心像素点上，相当于构成一个二元信息稀疏矩阵，该方法不仅保证了指纹图像的质量，还确保了指纹图像骨架脊线的质量，从而确保了指纹识别的精度。最后，通过实验结果表明，本文提出的基于单像素指纹边界的信息隐藏技术能够较好地将信息嵌入到指纹图像中，具有较低修改率的同时提高了PSNR峰值信噪比量，而且与其它方法相比，本文提出的方法对指纹识别正确率影响较小。
     

针对指纹模板的可逆信息隐藏编码方法

通过融合指纹、人脸、口令等用户身份信息来进行多模态认证可以提高身份认证系统的安全性.而利用信息隐藏技术,可以将几种身份信息嵌入到某一种生物模板中实现安全存储.本文介绍了一种以指纹模板为隐藏载体的多模态认证技术,该技术的关键问题是要保证嵌入信息后的指纹图片的质量,以确保匹配的精度.为此,提出了一种将二元信息稀疏化的数据嵌入编码方法,利用这种编码可以有效降低数据嵌入过程中对指纹图片的修改,从而改善载密图片的质量,以达到提高匹配精度的目的.该方法嵌入脆弱水印,用于指纹模板的完整性认证.     

基于二维条码的指纹特征信息隐藏方法研究

提出了一种将指纹特征信息隐藏在二维条码中的指纹信息保护方法．利用指纹图像的方向信息和频率信息确定二值化的阈值，采用PDF417条码的编码、译码技术实现指纹图像的预处理和特征提取，并将提取结果嵌入到二维条码中，当对指纹进行认证时，从二维条码中读取数据并解码，得到存储的指纹特征信息，从而达到认证、鉴别的目的．实验结果表明，所提方法可提高指纹特征信息的安全性，且识别、认证效率比较高，实现了指纹特征信息的远距离安全传输和高速录入，以及在线、离线的认证．     

指纹图像预处理算法研究

在指纹识别系统中，指纹图像预处理是指纹特征提取与识别的前提．对指纹图像预处理技术进行了研究。提出了一种指纹图像预处理算法．实验结果显示，该算法能够去除指纹噪声，得到较高质量的指纹图像．     

eBiopass数字生物信息护照——指纹与IC卡的完美结合

随着财富的日渐积聚,个人财产的保护意识也逐渐强烈。越来越多的场合需要安全可靠的身份认证。于是,一种运用先进的生物识别领域知识与技术,基于个人的生物信息,代替传统的照片、密码、口令、钥匙,实现个体身份认证的解决方案产生了。 该方案是杭州中正生物认证技术有限公司利用其自主知识产权的指纹识别算法,结合PKI加密技术,以其高效的JusTouch(TM)指纹识别模块为基础建立的一个身份认证解决方案,是业内第一个脱机的指纹身份卡解决方案。其核心问题是比较已经利用PKI技术进行加密的存储在IC卡上的指纹模版与持有者的指纹是否…     

一种新的二值图像信息隐藏方法

随着数字媒体的普及,人们已经提出了许多在灰度图像和彩色图像中隐藏信息的方法,但是由于随意修改二值图像的像素值容易引起图像质量的明显下降,所以大多数在灰度图像和彩色图像中隐藏信息的方法不能直接应用到二值图像中.本文提出了一种在二值图像中进行信息隐藏的方法.该方法将二值图像分割成大小为2×2的图像块,利用图像块的奇偶性将一条二进制信息嵌入到黑白像素邻近的块中,嵌入1位信息平均修改0.5个像素,具有计算量小、嵌入信息量大、图像质量下降少、安全性高的优点.     

基于指纹识别技术的网络身份认证系统

在Internet/Intranet的应用中，其安全性面临着严重的挑战。用户在进入系统时，传统方法是通过口令验证其身份。这在某种程序上虽确保了计算机系统的安全，但同时存在着记忆烦琐、易丢失、易遗忘的弊端。针对这一问题，研究了以指纹代替传统的口令输入，设计了一套基于指纹识别技术的网络身份认证系统。     

基于NTRU的密文域可逆信息隐藏算法

NTRU (number theory research unit)具有抗量子计算攻击、加解密速度快、安全性高的特点,非常适合用于无线保密数据网、认证系统等业务。结合可逆信息隐藏技术,提出了一种基于NTRU的密文域可逆信息隐藏算法。首先利用差值扩展算法完成对图像像素的预处理;然后使用NTRU算法对图像像素进行加密,利用NTRU算法的加法同态性质在密文中嵌入信息,嵌入的信息得到NTRU算法加密的安全性理论保证;解密与信息提取后,利用差值扩展算法的特点可逆恢复出图像像素。采用图像的直方图及方差、信息熵、相邻像素的相关性等统计学方法,论证了在密文中嵌入信息的不可感知性。仿真实验结果表明：该算法既能实现嵌入信息后密文的正确解密,又能无损提取秘密信息,平均嵌入率可达到0.5 bpp (bit per pixel)。     

基于指纹统计特征的身份鉴别系统

指纹具有唯一性和不变性,作为个人身份标志,指纹识别技术以其安全性、可靠性、高效性,在金融证券I、T业、安防、考勤、指纹IC卡等领域正逐步得到广泛应用。概括地介绍指纹识别技术及典型的基于指纹统计特征的身份鉴别系统的结构,对指纹图像采集、图像预处理、特征提取、数据库管理及图像匹配进行分析和归纳。自动指纹识别系统的研究在过去30多年中已取得了很大的进展,但目前仍是国内外图像处理、模式识别、计算机科学等领域研究的热点。     

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.