一种基于不变特征的图像识别算法研究

深入研究了图象的不变特征,并建立了一种基于图像不变特征的目标识别算法。算法首先提取目标的SIFt特征向量,并建立改进的Kd—Tree特征结构,使用BBF搜索策略完成特征点的匹配,接着建立目标的姿态变换空间对匹配点进行HOUGH聚类,去除错误的匹配点,最后对匹配点按照最小二乘法拟合出目标的姿态参数,从而完成目标的定位。实验证明,在目标发生平移、旋转和缩放以及场景部分遮挡、视角变化等因素引起的图像变形,算法都能够稳定的识别出目标。     

基于感知哈希与尺度不变特征变换的快速拼接算法

鉴于尺度不变特征变换(SIFT)结构复杂域,k-d树匹配算法对于高维特征计算量过大,对SIFT特征信息利用少并且匹配的结果有大量误差,因此提出一种基于感知哈希与尺度不变特征变换的快速拼接算法.首先,使用感知哈希算法,提取匹配图像与待匹配图像的HASH指纹,快速识别出两幅图像的相似部分;然后,计算并提取出相似区域SIFT特征点.在特征点匹配算法上,替换传统的k-d树算法,利用SIFT特征点的主方向以及坐标位置信息过滤掉不必要的特征点匹配,减少匹配耗时;最后,用加权最佳拼接缝图像融合算法消除突变,完成拼接.实验结果显示,本文算法提取的特征点数比传统算法更少,在匹配算法上减少计算量,同时还粗过滤了一部分误匹配,提高了匹配准确度,算法的耗时较传统方法有明显提升.     

基于图像锐化的SIFT图像复制粘贴篡改检测

SIFT算法提取图像的特征点多为图像目标的边缘点,对于较模糊图像而言,直接使用SIFT算法提取特征点后进行特征点匹配,会降低特征点的匹配数量和匹配正确率,甚至对于复制粘贴篡改图像不能做出正确的判断。所以,提出先对被检测图像利用梯度法进行锐化,使图像目标边缘变得清晰,再用SIFT算法提取特征点及后续操作,以提高匹配的正确率。实验表明,改进算法性能有明显提升。     

一种基于显著性区域分割的SAR图像配准算法

针对传统SIFT算法的配准精度和配准效率易受斑点噪声和图像灰度差异影响的问题,提出一种基于显著性区域分割的SAR图像配准算法.首先基于改进的马尔可夫(MRF)算法对SAR图像进行分割,结合区域特征和边缘特征筛选出稳定的显著性区域;然后在显著性区域的边缘附近进行SIFT特征点的提取;最后通过SIFT特征点的匹配实现图像配准.实验结果表明,该方法在保证较高的配准精度的同时,提升了算法效率.     

一种改进SIFT的SAR与可见光图像配准算法

针对合成孔径雷达(synthetic aperture radar,SAR)图像与可见光图像配准存在特征点提取困难、匹配效率不高的问题,文章提出了一种基于非下采样Shearlet变换(non-subsampled shearlet transform,NSST)与改进的尺度不变特征变换(scale invariant feature transform,SIFT)结合的配准算法。该算法采用NSST变换来提取图像低频信息作为后续检测特征点的原始图像,在保证特征点提取数量的同时提升算法运行速度;选用Harris算子和指数加权平均值(ratio of exponentially weighted averages,ROEWA)边缘检测算法相结合的方法提取SAR图像特征点,改进传统SIFT算法在SAR图像特征点提取时鲁棒性较差的问题;采用快速近似最近邻搜索(fast library for approximate nearest neighbors algorithm,FLANN)与改进的随机抽样一致算法(random sampling consensus algorithm,RANSAC)完成特征点匹配与误匹配剔除。选用GF-1号与GF-3号图像作为实验数据,并与传统SIFT算法进行对比。结果表明,该算法在特征点提取数量与配准精度上相比于传统算法均有明显提高。     

基于SIFT和小波变换的图像拼接算法

提出了一种基于尺度不变特征变换(SIFT)和小波变换的图像拼接算法,以提高室外复杂场景的图像拼接质量.利用SIFT算法提取基准图像(待匹配图像)和后续图像(与基准图像进行匹配的图像)的特征点,确定特征点的位置、尺度与方向;利用128维向量对特征点进行描述;利用最近邻法完成两幅图像特征点的匹配,确定重合区域;利用基于小波变换的多分辨率方法完成对图像的拼接.实验结果表明,该方法对亮度差异较大的图像拼接效果良好,适宜于室外复杂环境的图像拼接.     

基于SIFT的新特征提取匹配算法

针对传统的图像匹配算法特征点不稳定和匹配时间慢的问题,提出了一种改进的尺度不变特征变换(SIFT)图像匹配算法。首先对传统的Harris角点构造高斯多尺度空间,使角点具备多尺度不变性;然后采用Canny边缘提取算法修饰Harris角点以增加稳定特征点数量;最后构造SIFT特征描述符,计算多幅图像中对应特征点描述子的欧式距离,完成特征点对的匹配。实验结果表明:相比于传统的SIFT算法和SURF算法,研究所提出的方法能够有效地提高特征点匹配精度,减少图像匹配时间。     

基于改进ORB的图像特征点匹配

鉴于ORB算法在特征点匹配时基本不具备尺度不变性,结合SIFT算法思想,提出了改进的ORB算法:SIRB(ORB and SIFT)。首先生成图像的多尺度空间,并在多尺度空间里检测稳定的极值点,使得提取出的特征点具有尺度不变信息;然后使用ORB描述子对特征点进行描述,生成旋转不变性的二进制描述子;最后通过Hamming距离完成对特征点的匹配。实验结果表明,SIRB有效地解决了ORB不具备尺度不变性的缺陷,在图像尺度发生变化时,SIRB算法特征点匹配的平均准确度达到约93.3%,相比于ORB提高了约70.7%;同时SIRB和ORB两种算法的匹配速度大致相当,SIRB保留了原ORB算法的快速优越性,平均匹配速度比SIFT快约63.2倍;将提出的SIRB算法应用到视频目标跟踪系统中,取得了良好的实验效果,具有一定的应用价值。     

基于FAST特征点提取的图像拼接算法

针对SIFT图像拼接算法在特征点提取阶段,采用基于差分高斯金字塔的方式导致的算法运行时间较长,且易造成特征点漏检、位置偏移的问题,提出一种基于FAST特征点提取的图像拼接算法。该算法首先对拼接图像进行基于FAST算法的特征点提取,取代原有SIFT算法中特征点提取方式,然后对提取特征点进行描述和向量匹配,利用欧氏距离和RANSAC算法实现配准,最后通过加权平均融合算法完成图像拼接。仿真实验表明,该算法加快了特征点的提取速度,提高了定位准确性,更有利于得到灰度整体和谐的拼接图像。     

基于无人机航拍图像拼接算法的优化

目的为了提高无人机航拍图像拼接的精度,深入研究了航拍图像拼接中提取特征点的算法,并对原算法加以优化.方法在图像特征点提取的SIFT算法中,设计了一种将Harris角点检测算子融入SIFT特征点提取的优化算法,优化后可以突显获取到的特征点的独特性.结果利用优化算法获取图像特征角点,可以降低实验过程中所消耗的检测时间,有效地改善了SIFT算法中匹配数据量大及过程繁琐的弱点,同时优化算法简化了图像特征点匹配的计算过程,降低了计算量,提高了实验效率.结论优化算法可以去除大量的类匹配点,使图像特征点的独特性更加明显;也提高了图像的配准精度,增强了关键点的稳定性,在关键点的匹配速度和准确率上有积极的影响.     

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.