一种基于局部对比度的分块压缩感知多聚焦图像融合算法

提出了一种有效的基于局部对比度的分块压缩感知多聚焦图像融合算法。首先采用结构随机矩阵对源图像进行分块压缩测量,获得分块压缩测量值;其次,根据块局部对比度选择清晰的块进行初步融合;再通过多数滤波对初步融合结果进行一致性校验,得到最终的融合结果;最后,通过平滑投影Landweber算法(SPL)重构融合图像。实验结果表明,与目前基于BCS图像融合方法相比,本文所提方法对于多聚焦图像融合,在主观视觉感知以及客观定量指标如信息熵、互信息及平均梯度及算法运行效率等方面均有明显改进。     

基于SUKF与SIFT特征的红外目标跟踪算法研究

针对复杂红外背景下单一跟踪算法难以准确定位运动目标的问题,提出了基于尺度无迹卡尔曼滤波(SUKF,scale unscented Kalman filter)与尺度不变特征变换(SIFT,scale invariant featuretransform)相结合的红外运动目标跟踪方法。首先,通过SUKF算法对状态空间进行滤波估计,确定运动目标的初步位置,并以此建立局部SIFT特征检测域。其次,SIFT算法在该局部检测域内对运动目标进行特征提取与匹配,最终实现对目标的准确定位;同时,利用定位结果更新并校正SUKF的状态模型。实验结果表明,本文提出的基于SUKF-SIFT的跟踪策略与相关算法相比,体现出较好的跟踪效果与实时性能。     

基于显著特征区域和概率图模型的目标跟踪

针对目标跟踪中的遮挡问题,提出一种基于局部显著特征区域和概率图模型的跟踪算法.提取目标的一组局部显著特征点,以局部显著特征点为依据,在目标区域中划分出多个感兴趣的显著特征区域;利用这组显著特征区域相互之间的空间位置关系,并结合各个显著特征区域自身的局部信息建立目标的马尔可夫随机场(MRF)模型;采用mean shift(MS)算法对各个显著特征区域分别进行跟踪,利用MRF模型对MS算法的跟踪结果进行概率推断,融合各个显著特征区域的权重,精确定位运动目标的最终位置.在多个视频序列上的实验结果表明,与改进的MS算法、粒子滤波算法以及分块跟踪方法相比,此算法具有较高的跟踪精度;尤其是当目标被遮挡时,该算法具有较好的跟踪鲁棒性.该算法充分利用了显著特征区域自身的局部特征和区域之间的空间结构信息,能够实现复杂情况下的运动目标的鲁棒跟踪.     

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

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

尺度自适应的分块核相关滤波目标跟踪算法

针对目标跟踪过程中由于遮挡导致的算法性能下降的问题,在分析和研究核相关滤波算法的基础上提出了一种尺度自适应的分块跟踪策略.首先从目标中心划分子块,使用融合梯度特征和颜色特征的局部核相关滤波器单独跟踪每个目标子块,并结合目标子块与整体间的位置约束关系得到目标中心位置的粗略估计,然后由全局滤波器用作初始估计以确定目标中心的...     

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

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

一种改进的基于全变差范数图像融合方法

针对基于全变差范数图像融合方法在多聚焦图像融合中产生分块效应的缺陷，提出将区域的特征表示与主成分分析思想相结合的改进算法，解决了单独块变换造成的图像分块效应问题.实验结果表明，改进算法能有效地消除分块效应，且针对含噪图像，其融合效果明显优于离散小波方法.     

一种改进的自适应阈值分块曲面滤波方法

针对传统的分块曲面滤波算法使用固定阈值进行滤波时造成的误分现象,提出了一种改进的自适应阈值分块曲面滤波算法.首先采用高斯滤波以及K-D树(K-dimensional树)滤波对异常点云进行剔除;然后利用网格法对点云进行逐级分块,并以曲面拟合的方式自动获取块域种子点,降低种子区域过大造成的滤波影响,从而建立了顾及块域面积及块域内最大高差两个因素的滤波阈值自适应模型.利用3组不同的数据对传统算法与改进算法进行滤波对比试验,结果表明改进方法不仅解决了人工选取种子点带来的问题,还能有效降低两类误差,充分验证了改进算法的可靠性.     

基于分块的网页主题信息自动提取算法

对互联网上大量存在的基于模板的网页,根据其半结构化的特点,提出了一种网页分块和主题信息自动提取算法.该算法利用网页标记对网页进行分块,改进了传统的文本特征选择方法,把网页块表示成特征向量,并根据有序标记集识别主题内容块.用该算法改进了网页分类的预处理过程,提高了分类的速度和准确性.实验表明,对网页进行主题信息提取后再进行分类,可以提高分类系统的查全率和查准率.     

一种面向移动终端的混合跟踪定位算法

通过扩展卡尔曼滤波器(EKF)对手机移动终端的加速度计、陀螺仪以及视觉数据进行融合,实现混合跟踪。在此基础上,对基于EKF的数据融合算法进行改进,当失去视觉校正时,利用同步跟踪的背景区域速度更新目标区域速度,使算法在目标区域提取特征点数不足的情况下可以持续跟踪;同时引入参考坐标系,定义世界坐标系在参考坐标系中的姿态,校正在基于EKF的数据融合算法中由于光照遮挡等问题出现的角度跳变错误;最后,在实际环境中进行测试,实验结果显示本混合跟踪算法相比传统单一视觉的跟踪注册算法和以往基于EKF的数据融合算法具有明显优势。     

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.