一种抗旋转、抗尺度变化的图像匹配算法

在研究圆投影、参数化模板、直方图不变距的基础上,提出了一种基于圆投影矢量和变换与参数化模板相结合的图像匹配算法.首先用计算量较小,并具有旋转不变性的圆投影矢量和变换的方法对输入图像进行投影,将图像投影到矢量空间当中,然后采用参数化模板的方法对图像进行可变尺度的匹配选出可能性较大的匹配点,最后利用图像的直方图的不变矩做进一步的匹配.解决了模板图像与待测图像之间存在旋转和尺度变化的问题,同时采用欧氏距离进行匹配,避免了传统方法中计算相关函数的巨大计算量.实验表明这种算法不仅提高了匹配的速度,而且在目标图像发生     

一种基于标记点的近景摄影测量系统

给出了一种基于标记点的鲁棒三维重建摄影测量系统;采用编码点和非编码点等标记点方式.为了减少不同图像间误匹配的概率,采用一种新的基于编码点的匹配方法,不同图像间非编码点的匹配从编码点开始,并通过相似性准则、模糊度准则和距离误差准则来剔除误匹配,可获得非常高的正确匹配率.采用一种新的基于标记点的加权迭代特征算法,用编码点恢复相机的投影矩阵,从而可以确定相机的外部姿态参数;用非编码点恢复3D坐标.与已有的加权迭代特征算法比较,该算法避免了所有点参与计算相机的投影矩阵,运算速度更快.由于采用标记点的亚像素定位方法,提高了3D重建精度.实验结果表明,在3D重建方面,该系统是强壮和精确的.     

一种基于小波系数投影的快速模板匹配算法

根据粘片机晶元的结构特征,提出一种改进的基于小波变换系数投影的算法.该算法将局部有剧烈变化的信号点的位置顺序记为特征点,使用匹配小波系数直方图之间的相似性进行图像匹配,通过改进的多分辨率结构分析,减少了约70%的计算量,并将晶元定位的运算速度提高至10ms左右.该算法不仅可以精准匹配和定位,显著降低系统的总体计算复杂度,也具有更快的晶元搜索速度,可以应用在其他自动化场景中,进一步提高机器性能.     

灰度图像匹配的快速算法

分析了传统的模板匹配算法 ,提出了一种新的基于投影的快速模板匹配算法 .该算法对图像计算一维投影 ,并将投影数据差分转化为描述图像特征的字符串 ,在快速字符串匹配的基础上 ,进行归一化的相关计算 ,既保证了匹配效果 ,又提高了匹配速度 .实验结果表明 ,这是一种有效的新算法     

用混合编码遗传算法实现匹配追踪算法

在分析总结浮点数编码和格雷码编码各自特点的基础上,提出了一种用浮点数和格雷码混合编码的遗传算法来实现匹配追踪算法.该算法有机结合了遗传算法和匹配追踪算法的优点,不仅能够得到较高精度的最佳匹配参数,而且有效地降低了计算量,克服了匹配追踪算法由于计算量太大而不能广泛应用的缺点.计算机仿真结果表明,该算法提取相位的精度和提取时间均有明显改善,证实了该算法的准确性.最后,将该算法应用于转子实验台的冲击信号特征提取中,提取结果证明了它的实际应用价值.     

基于Android移动终端的车辆导航地图匹配算法研究

基于Android移动终端设计了一种基于路网拓扑结构的地图匹配算法,将地图匹配分成定位数据预处理、确定车辆所在路段、确定车辆匹配位置和出错检测等4个相对独立的过程.算法在过滤掉异常定位数据后采用航位推算进行补偿,使用考虑距离和方向两种要素的加权评估模型确定匹配路段,在确定匹配位置时对常用的垂直投影进行改进,得到一种优化方法.结果表明,该算法具有较高的路段识别正确率,优化方法相对于垂直投影法在位置精度上有所提高,地图匹配效果好.     

投影栅三维形面测量中亚像素匹配算法

根据相位值寻找匹配点是投影栅三维形面测量系统的关键技术之一,匹配精度在一定程度上决定了系统最终的三维重建精度,而整像素匹配无法满足高精度三维形面测量的需要.根据相邻像素相位近似线性分布的特点,提出了一种基于相位线性插值的亚像素匹配算法.模拟实验表明: 应用该匹配算法后,三维重建测量精度有很大提高,匹配速度很快.验证实验显示: 应用该匹配算法后投影栅三维形面系统的测量精度可达0.03 mm, 能够满足一些高精度测量需求.     

基于有向超图的图像匹配算法

为了提高复杂变换下图模型的匹配精度,提出了一种基于有向超图的图像匹配算法.该算法首先分别在两个待匹配的特征点集中构造3一致超图,计算每条超边所包含三元组的权值,然后利用这些权值来构造加权邻接张量,最后通过凸凹松弛算法实现图像匹配.模拟和真实图像的实验结果表明,文中算法能够获得更高的匹配精度,对于复杂变换的图像也有很好的匹配效果.     

基于KCCA的特征匹配方法

特征匹配问题是计算机视觉和模式识别中一个关键步骤,在很多领域都有着重要的应用。借助核典型相关分析思想,提出了一种基于空间相关性的特征匹配方法,该方法通过核典型相关分析,将特征点集投影到核空间中,并将投影向量作为匹配特征,根据投影向量之间的相似性进行匹配。仿真实验结果表明,该算法优于基于谱分解的特征匹配算法,在图像含有噪声和存在结构误差的情况下,算法具有较高的匹配率。     

基于优化ORB算法的图像角点特征匹配方法

针对传统ORB算法的图像角点特征匹配精度不高的问题,提出基于优化ORB算法的图像角点特征匹配方法;首先使用Shi-Tomasi算法检测图像角点特征,然后使用BRIEF和SURF相融合算法生成图像角点特征双描述子序列并使用随机投影原理进行降维,最后使用优化的匹配算法进行匹配,简称ShiTomasi-SURFORB算法,仿真实验通过统计角点特征数、角点特征匹配数、角点特征正确匹配数、角点特征匹配精度、角点特征匹配精度率、图像匹配时间和图像匹配时间率共7个指标进行分析;分析结果表明:ShiTomasi-SURFORB算法与传统ORB算法相比,在图像角点特征匹配时间方面提升了9.46%,但在图像角点特征匹配精度方面提升了8.88%,为图像角点特征匹配提供了一种更加均衡的解决方案。     

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.