基于GVF-Snake的运动目标跟踪

为了使GVF-Snake具备快速跟踪运动目标的能力,提出采用帧差运动补偿和GVF-Snake结合的跟踪算法.采用二次帧差法对视频图像进行处理,自动得到初始轮廓解决GVF-Snake模型初始轮廓确定的问题.对于输入视频图像在每一次迭代中重新计算整幅图像的GVF场时间消耗大的现象,采用分块计算,减少了计算量,使GVF-Snake跟踪达到接近实时的要求.在遮挡方面,采用前一帧差运动补偿的方法.实验表明,此跟踪算法具有较好的性能.     

一种基于改进PCA和BP神经网络的人脸识别算法

机器学习中存在大量处理图片的高维数据,PCA是一种有效降维数据的方法.针对PCA算法在提取前几个特征值时计算量大且易受光照噪声等影响的问题,提出一种改进算法,利用分割矩阵的做法求出每一个小矩阵的最大特征值,将其特征向量组成图片的特征矩阵.这样提取出来的特征值更加具有代表性,经仿真实验验证,改进算法的正确识别训练图像集和测试集数目以及识别率均比应用在传统PCA算法上有效.     

图像边缘检测中的改进算法

针对传统的蚁群边缘检测算法存在耗时长和易受噪声影响的缺点,提出了一种改进的蚁群边缘检测算法.该算法对蚂蚁路径选择中的启发式信息值的计算方法进行改进,使其计算基于邻域中节点的梯度,能更好地引导蚂蚁向边缘节点进行移动.通过仿真实验表明:该算法与传统的蚁群算法相比,能够减少耗时、抑制噪声及准确快速地检测出图像边缘.     

基于自适应结构张量的FCM改进算法

针对传统模糊C均值聚类算法对图像特征描述单一,易受图像复杂纹理干扰而出现误分割的问题,提出一种基于自适应结构张量的FCM算法,并将其应用于图像分割.打破传统高斯滤波器在滤波方向和角度上所受限制,采用基于各向异性滤波的结构张量;引入图像边缘密度函数,用以衡量图像节点的平滑性,自适应地计算各向异性滤波函数所占比例;定义一种自适应结构张量相似性度量标准,用以计算图像中节点与聚类中心点的结构相似性,有效地代替了传统FCM中的灰度相似性度量标准;采用一种新颖的节点间距离度量公式来计算图像中节点与聚类中心点的差异.仿真结果表明,对结构复杂的图像,改进算法获得了更加精确的分割结果.     

边云协同计算下基于ST-GCN的监控视频行为识别机制

智慧城市的迅速发展为人们的日常生活带来了极大的便捷，其中视频监控系统越来越智能化是信息技术逐渐成熟的必然结果 .人体行为识别是智能安防监控领域的重要任务之一，但大量的边缘监控设备产生了井喷式图像视频数据，传统单一的云计算模式已无法全面有效地应对海量数据的计算与处理.提出一种大数据驱动下采用边云协同计算的人体行为识别机制，将以往中心化的计算扩展为边缘、云端协同处理.首先，在边缘节点N0对视频进行相似帧去除的预处理并对提取的骨架序列进行多层次表示，然后云端对时空图卷积神经网络（Spatial Temporal Graph ConvNet,STGCN）模型进行训练并将其部署至边缘节点N1～Nm，边缘节点使用训练好的模型完成行为识别任务并将结果上传至云端进行融合得出最终行为类别.实验结果证明，所提方案能有效减少以往中心化计算的网络传输量及云端存储压力问题，且边云协同的优势使得模型识别的准确率稳定提升了2.2%以上.     

一种新的多机动目标跟踪的GMPHD滤波算法

针对多机动目标跟踪的传统数据关联算法约束条件苛刻、估计精度低、计算量大等问题,提出了一种基于随机集理论的非数据关联的多机动目标跟踪算法.该算法将高斯混合概率假设密度(GMPHD)滤波与"当前"统计模型的优点相结合,绕过了棘手的数据关联问题,能高效处理目标数较大的机动跟踪问题.在漏检、虚警、多机动目标交叉杂波复杂环境下进行了仿真实验,结果表明,该算法具有较高的跟踪精度和稳健的跟踪性能.     

基于张量黎曼度量的序列图像匹配光流场计算方法

使用序列图像的灰度-时空张量描述子来描述图像特征,并在此基础上提出了一种基于张量黎曼度量的序列图像匹配光流场计算方法. 该方法使用张量的黎曼度量给出序列图像特征描述子间距离的定义,并使用改进的Hausdorff距离取代欧式距离来完成黎曼度量的计算,据此构造序列图像匹配相关函数,以提高图像在噪声及遮挡情况下的匹配能力;在上述基础上,给出匹配光流场算法. 仿真结果显示,该算法相对于传统基于微分的光流场计算方法（H-S算法,L-K算法）和传统的基于灰度的块匹配算法在计算精度、抗噪声等方面更有优势.      

人脸识别视频压缩感知跟踪算法

针对视频监控中移动的人脸图像光照强度不同、遮挡、快速变化等问题,本文提出一种人脸识别视频压缩感知跟踪算法.利用图像尖锐化处理突出目标图像边缘纹理,再利用矩形滤波器对人脸图像归一化处理并获取特征向量.通过压缩感知算法对目标样本和背景样本的Haar-like特征压缩,建立目标模型,训练Adaboost算法的贝叶斯级联分类器.最后根据人脸特征区分目标和背景图像,实现目标人脸图像的动态跟踪.实验结果表明,该算法能够实现视频中人脸图像移动、遮挡及光照强度不均匀、快速变化等情况下的有效跟踪.     

基于改进Hough变换的刀具磨损状态监测

针对传统Hough变换的参数空间所需存储量大、运算量大、不利于实现实时监测等缺点,提出了一种基于随机Hough变换的改进Hough变换算法,并将该方法用于工件表面纹理图像的处理,通过对工件表面的二值边缘图像进行改进Hough变换,提取直线段平均长度及直线段与切削速度方向的夹角作为特征参数,实现对刀具磨损状态的判断.算法分析和实验结果表明,该算法所需存储空间少,计算量小;提取的特征参数与刀具磨损状态之间存在密切联系,根据特征参数的变化规律可实现对刀具磨损状态的监测.     

基于FPGA的红外成像系统及图像处理算法

红外成像技术一直是光电子领域的热点课题,由于受红外自身成像特点、红外探测器件工艺限制及成像环境的影响,导致红外图像噪声大、对比度低,造成红外图像待测目标模糊、图像信噪比较低、无法有效识别目标等问题。同时,传统红外图像处理系统往往无法在提升红外视频图像质量的同时兼顾图像处理速度。因此为提升硬件条件下的红外图像质量和图像处理速度,本文采用FPGA作为红外图像处理系统核心处理器,搭建集图像采集、视频解码、数据缓存及显示等功能的红外图像成像系统,并基于该系统提出一种改进的红外图像处理算法提升红外图像质量,包括改进的中值滤波算法、伽马变换与直方图均衡化组合算法以及改进的伪彩色变换算法。仿真和系统实验结果表明本文提出的红外图像处理算法可以有效地改善红外成像质量并保持红外图像的处理速度,提升了红外成像系统的性能。     

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.