Harris角点检测算法的优化研究

在研究Harris角点检测算法时,发现检测出的角点常常会受到噪声的影响.通过优化Har-ris角点响应函数,避免了角点响应函数中k值的影响,提高了每个目标像素点的响应值精度.把该方法运用到人脸特征的检测中,实验结果表明,该算法和传统的Harris角点检测算法相比抗噪能力有较大提高.     

自适应Harris角点提取的点云粗配准算法

针对传统3D-Harris角点提取算法中,Harris算子使用降维后的缺失几何信息、角点提取时响应值计算量大且耗时长、特征点对匹配精度不高以及需要手动设定角点响应阈值等问题,提出了一种完整而高效的Harris角点自适应特征描述、提取和匹配的点云粗配准算法。引入正交梯度算子对传统Harris算子和自相关函数进行改进;利用点云曲率约束实现角点的自适应筛选与提取,减少角点响应值的计算量;构建角点几何结构的特征描述子,结合阈值检测和描述子匹配,将角点匹配对集合进行扩展,从而完成源点云和目标点云之间粗配准;将所提算法得到的配准结果作为精配准初始值,利用迭代最近点算法实现精配准。与对比算法在公开数据集上进行实验比较,结果表明：所提算法的特征正确提取率为0.93,正确率最高;提取时间为7.63 s,效率最快;所提算法结合精配准步骤在实验数据集上的旋转误差、平移误差和运行时间均为最低,配准效果最佳。     

基于分块Harris特征的航拍视频拼接方法

针对现有航拍视频拼接算法处理速度慢、准确性不高等问题,提出一种基于分块Harris特征的航拍视频拼接方法,改进了传统基于SIFT特征提取算法的不足,缩短了匹配时间,提高了匹配准确性.首先采用分块Harris角点提取的方法均匀提取图像中的角点,然后采用金字塔光流算法进行角点匹配,最后通过改进的RANSAC方法求出仿射变换参数.实验表明,该方法能够实时对航拍视频进行拼接,具有更高的准确性.     

基于图像视觉伺服的移动机器人自主导航实现

提出了一种基于移动机器人双目摄像头的图像视觉伺服方法,实现了基于图像视觉伺服的移动机器人自主导航.当匹配图像特征点时,采取KLT算法和基于Harris算子角点检测与匹配算法相结合的方法,大幅优化了整个工程的运行时间,并结合RANSAC算法剔除误匹配的特征点对,使机器人能够精确地定位.实验结果证明该方法有效、正确.     

基于图像分块的多尺度Harris特征点检测算法

通过分析Harris特征点检测算法在应用中的不足,提出一种基于图像分块的多尺度Harris特征点检测算法,解决了特征点聚簇现象,检测出的特征点分布均匀.实验结果表明,该算法具有精确性、有效性和鲁棒性,为进一步图像特征点匹配工作提供了保证.     

基于尺度空间理论的Harris角点检测

研究了一种基于尺度空间理论的Harris角点检测方法. 建立Harris函数的尺度空间表示, 检测每个尺度水平上的极值, 利用迭代算法验证每个尺度水平上LoG算子是否获得最大值, 从而得到特征角点的位置及其尺度. 该方法在保持Harris角点不受光照条件及摄像机姿态变化影响的同时, 还能检测出多尺度下的特征点. 通过实验验证该方法具有尺度不变特性, 适用于尺度变化较大的视觉系统.     

基于分块Harris特征的航拍视频拼接方法

针对现有航拍视频拼接算法处理速度慢、准确性不高等问题,提出一种基于分块Harris特征的航拍视频拼接方法,改进了传统基于SIFT特征提取算法的不足,缩短了匹配时间,提高了匹配准确性。首先采用分块Harris角点提取的方法均匀提取图像中的角点,然后采用金字塔光流算法进行角点匹配,最后通过改进的RANSAC方法求出仿射变换参数。实验表明,该方法能够实时对航拍视频进行拼接,具有更高的准确性。     

一种基于Harris—Laplace特征点检测的抗几何攻击数字水印算法

基于图像特征点检测的第2代数字水印算法具有良好的抗几何攻击能力．Harris算子是2代水印中使用较多的一种特征点检测方法．然而传统Harris算子提取的特征点对于较大尺度缩放攻击的稳定性较差，结合自适应尺度特性的Harris—Laplace算子在一定程度上克服了这一缺点，并且对于旋转，噪声及压缩攻击均具有较好鲁棒性．据此给出了一种基于Harris—Laplace特征点检测的数字水印算法，实验结果表明，该算法对于常规信号处理和几何攻击具有较好的鲁棒性．     

基于特征点的数字图像配准

基于特征点的数字图像配准技术的重点在于如何提取图像上的有效特征点,通过Harris算子提取静止多线条图像的角点作为特征点,能有效解决图像配准过程中特征点数目少、配准精度难以保证的问题.仿真试验结果表明,该方法不但速度快,而且抗噪声性能好、精度高.     

基于Harris与改进SIFT算法的图像匹配算法

提出一种新的Harris与改进SIFT算法相结合的算法.首先用Harris算子提取图像的角点作为特征点,然后采用基于同心圆形窗口的64维向量有效地表征一个特征点.实验结果说明,算法在保持很好匹配率的同时能降低计算复杂度.     

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…     

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.     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

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.