基于卡尔曼滤波器的运动目标检测与跟踪

针对摄像机静止的情况,提出了一种可运用于实时监控中的运动目标检测与跟踪的方法．采用更新函数实现背景实时更新,通过差分算法检测运动目标．在跟踪模块中,提出建立帧间目标“关系矩阵”实现多个运动目标匹配,并采用卡尔曼滤波器预测目标参数,在运动目标相互遮挡的情况下,根据预测参数跟踪目标,获得目标轨迹．通过多个图像序列测试,算法具有良好的实时性和适应环境变化的能力．     

基于“贴标签”算法的多运动目标分割与标识

针对固定场景中的监控问题,给出一种基于"贴标签"算法的多目标标识方法.通过背景差分和连续帧间差分相结合的方法,检测和分割视频序列中的多运动目标;同时采用"贴标签"算法对检测后的二值图像进行连通成分标识;根据得到的"标签"将不同的运动目标用不同颜色的外接矩形框区分.     

基于kinect摄像机的多运动目标实时跟踪

多运动目标跟踪是视频监控中的关键问题,在目标相互运动发生遮挡时,采用二维摄像头监控容易丢失信息而造成跟踪失败.本文采用kinect摄像机获取目标的RGB图像及深度图像,并分别获取基于RGB图像信息的目标颜色模型和基于深度信息的目标三维空间模型,在视频帧间将颜色、空间模型分别匹配得到目标帧间匹配度,通过Mahalanobis距离算法实现多目标匹配,从而得到多目标识别跟踪结果.实验表明,在RGB-D数据集及拍摄的视频序列上均取得了较好的跟踪结果,实现了kinect三维视觉下的实时多目标的跟踪.     

一种视频序列中运动目标的检测与跟踪方法

运动目标的监控与测量在汽车导航和智能监控行业中得到大量应用。本文提出了基于统计背景模型和灰度质心模型的运动目标检测和跟踪算法。在此方法中先建立背景的高斯模型,然后检测出场景中的运动目标,最后根据目标检测的结论,得到运动目标灰度质心的计算结果,并在坐标系中记录位置,采用最小二乘法拟合实现了对运动目标的跟踪。相应的实验结果表明这种方法能有效检测和跟踪运动目标。     

一种基于运动目标检测的视觉车辆跟踪方法

针对复杂交通场景中动态光照变化、阴影和遮挡等因素带来的影响,提出了一种基于运动目标检测的高效、鲁棒的车辆跟踪方法. 采用自适应背景建模获取动态场景中的运动信息,通过阴影去除获得准确的运动区域,并针对场景中的遮挡问题提出了相应的遮挡检测与处理策略,最后通过区域匹配获得跟踪结果,同时使用Kalman滤波器建立车辆的运动模型,对跟踪结果进行了约束和优化. 实验结果表明,提出的视觉车辆跟踪方法可以在复杂多变的室外场景下有效地解决场景中的阴影和遮挡问题,得到鲁棒的车辆跟踪结果.      

一种改进的三帧差分运动目标检测

针对当前常用运动目标检测方法易受到光照和噪声影响、不易提取完整运动目标,提出一种改进的三帧差分运动目标检测算法.首先取连续三帧图像,对前两帧进行滤波及边缘提取,将提取结果进行异或运算,保留前两帧之间不同的边缘信息,然后对后两帧图像进行差分二值化,并进行膨胀处理,粗略得到运动目标,最后将该结果与异或结果进行与运算即可得到较为完整的运动目标边缘图.实验表明,该算法简单易行、可实时检测、能有效提取出运动目标边缘,改善了差分法常出现的运动目标信息丢失问题.     

基于帧差法与边缘信息的红外目标检测算法研究

根据红外序列图像中运动目标具有连续性和一致性,本文提出了帧差法和边缘检测相结合的检测方法。首先采用连续帧间差分法处理图像得到运动区域,然后对当前帧进行canny边缘检测得到边缘信息,两者检测结果相与得到运动目标边缘;最后进行形态学运算得到精确的目标边缘。仿真结果表明,该方法克服了帧差法和边缘检测的不足,对复杂背景下的运动目标能够进行准确检测。     

一种快速运动目标检测算法

运动目标检测是智能视觉监控系统的重要组成部分,其主要功能是检测监控场景中的运动目标,为高层运动分析提供必要的信息。文章提出一种快速运动目标检测算法,以帧差法和背景减法为基础,快速实现背景提取、背景更新、运动目标检测的功能。实验结果表明,该算法计算量小,检测目标完整,能够满足实时监控系统的要求。     

基于模板匹配的运动目标快速检测与跟踪

在图像跟踪系统中，运动目标的快速检测与识别是至关重要的．通过分析视频序列图像的特点，并结合帧差法和多分辨率图像匹配的优点，提出了一种基于模板匹配的快速检测识别目标的方案．实验结果表明，该方法能快速有效地识别目标，基本上达到了实时跟踪的要求．     

基于运动平台的运动目标检测与跟踪

为了实现大视场智能监控,本文提出了一种基于运动平台的运动目标检测与跟踪方法.在相邻帧之间通过块匹配进行运动补偿,采用三帧差分法分割出运动目标.当运动目标正常运动时跟踪其形心;当运动目标被遮档时,根据卡尔曼滤波器预测的形心跟踪目标.其中,对于块匹配,采用边缘点作为匹配块的中心点并根据摄像机的运动方向确定搜索范围,使处理速度提高了38.6%.另外,比较得出最小二乘法对运动目标运动状态突然改变时拟合效果差,因此采用卡尔曼滤波器进行预测.实验证明,本算法适应环境变化的能力强,而且平均每秒处理37.6帧,达到实时处理要求.     

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.