基于改进ViBe算法的运动目标检测

ViBe算法是一种基于静态背景下的运动目标检测算法，针对其“鬼影”问题和运动目标静止时会被更新为背景的问题提出了改进ViBe算法，即对原ViBe算法的背景模型初始化、动态阈值、前景分割和背景模型更新等4个部分进行了改进。采用均值法获取的背景图像初始化背景模型，可消除“鬼影”;利用计数法控制前景分割动态阈值，使前景图像更加准确；使用帧差法思想改进前景分割，使前景图像更加完整；通过引入阈值保证背景模型更新的稳定性。根据试验结果可知，改进ViBe算法对正常移动车辆、较小运动目标和存在静止情况的运动目标都有较好的检测能力，解决了“鬼影”问题和运动目标静止时会被更新为背景的问题，同时相较于原ViBe算法和其他常用运动目标检测算法，改进ViBe算法在保证准确性的基础上提高了检测的完整性。     

一种改进的ViBe运动目标检测算法

为抑制传统ViBe算法在检测运动目标时产生的"鬼影",提高监控视频运动目标检测的准确性,提出了一种改进的ViBe运动目标检测算法。该算法采用连续相邻的多帧图像序列代替传统ViBe算法中第一帧图像,构建背景模型,从根源上解决传统ViBe算法在运动目标检测中存在的"鬼影"问题。利用Canny边缘检测算子和形态学运算相结合的方式准确完整的提取运动区域,降低算法的复杂度且减少运动区域的提取时间。提出一种背景模型更新策略判定条件,提高背景模型的质量,消除高频扰动对运动目标检测的影响,从而实时保证运动目标检测的准确性和鲁棒性。实验结果表明:经过4种算法的对比,改进的ViBe算法能够有效的抑制鬼影,且在高频扰动的情况下能较好的适应动态背景,显著提高运动目标检测的准确性。     

基于改进ViBe算法与三帧差法的运动检测算法

针对ViBe(visual background extractor)算法存在的鬼影和漏检问题,文章提出了一种基于改进ViBe算法和三帧差法的运动目标检测的方法。首先针对ViBe算法检测结果存在鬼影的问题提出一种改进的方法,改变ViBe算法中仅通过第1帧建立背景模型的方式;该文在前5帧中每个像素点的邻域随机选取4个像素点建立一种具有时间和空间信息的背景模型进行运动检测,并采用"或"类型三帧差法做"或"运算改善漏检的问题;然后对显著性检测结果做"与"运算去除过检点以提高运动目标检测的准确性;最后进行适当地后处理得到最终的检测结果。该算法能够去除噪声、抑制鬼影以及减少空洞点,实验结果表明能够快速并准确地检测出运动目标。     

采取阶段性改进的全新ViBe目标检测算法

针对ViBe (Visual Background extractor)算法在目标检测过程中易产生鬼影问题和检测目标不完整问题,从ViBe算法处理过程的主要阶段出发,提出一种全新的ViBe目标检测算法.首先,在模型初始化阶段,利用前m帧视频序列对应像素点的均值构建背景模型,同时将原算法的8邻域改为24邻域进行样本选取以及动态调整匹配半径;然后,在目标检测阶段,引入最大类间方差法来计算当前图像帧的最佳分割阈值,进而对前景像素进行二次判别;其次,在背景模型更新阶段,根据背景变化快慢程度动态地调整更新因子;最后,对获得的前景图像进行形态学处理得到最终的前景目标.实验结果表明,改进后的ViBe算法使鬼影问题得到有效解决,目标检测的准确度和完整度也有大幅提高.     

面向运动目标检测的ViBe算法改进

背景差分法是静态背景下运动目标检测的常用方法,ViBe算法是它的主要建模方法之一.针对ViBe算法对鬼影消除缓慢的问题,提出了结合帧间差分技术的ViBe改进算法,使用帧间差分技术通过记录相关像素值的时域变化来判断鬼影像素,提高消除鬼影的速度.针对ViBe算法的固定阈值不能反映每个像素具体情况的问题,提出了一种自适应阈值的方法,可根据像素值的变化为每个像素设定阈值,提高前景检测的准确度.实验结果表明,结合帧间差分技术的ViBe算法能够较快地消除检测结果中的鬼影,应用自适应阈值的ViBe算法能够更准确地进行前景检测.     

一种鬼影及边缘传播抑制的ViBe目标检测算法

针对在目标运动检测中ViBe算法容易产生鬼影、缓慢移动的目标容易融入背景样本模型等问题,提出一种改进的ViBe算法,首先在使用ViBe算法检测到运动目标后,利用迭代自组织分析算法的阈值分割来进行鬼影判别;其次利用改进的Canny算子获得图像的边缘特征,当ViBe算法在更新目标边缘的背景样本模型时不对其邻域的样本模型进行更新,从而使得缓慢移动的目标融入背景样本模型的时间得以延长;最后通过形态学处理获得完整的运动目标.实验结果表明,与传统ViBe算法相比,本文算法在有鬼影的情况下能更快获得较高的检测准确率,在有缓慢移动目标的情况下准确率的下降时间更晚.     

一种改进的ViBe鬼影抑制算法

为了提高交通监控的准确性,针对传统ViBe算法存在鬼影问题,提出了一种V-ViBe算法的改进方案。该算法利用连续的图像序列代替单帧图像,构造出"虚拟"背景图像,改进了传统ViBe算法初始背景模型建立方法。利用形态学相关知识消除干扰目标,使检测目标更加完整。实验表明:V-ViBe算法从第一帧即可有效消除鬼影对目标车辆检测的影响,在不改变ViBe算法优势的前提下,显著提高了检测的准确性。     

基于帧间差分的ViBe运动目标检测

针对光线变化时现有前景检测方法易将背景检测为运动目标、形成大片阴影的问题,本文利用帧差法对光线变化的不敏感性,对基于ViBe的背景建模、前景检测算法进行改进。结合帧间差分的ViBe前景检测方法包括背景初始化、背景模型更新及后期图像处理三个模块。该方法在更新背景模型时,加入了帧间差分判别多阈值比较,并依据帧间差分的结果对背景更新率进行动态调整,最后对背景建模后的检测结果进行形态学处理,针对大的噪点进行轮廓提取及判定,最终检测出运动目标。针对不同条件下监控视频的试验结果表明,本文方法初始化速度快、实时性好,有效地抑制了由于光线干扰形成的大片鬼影区域。     

参数自适应去阴影前景目标检测算法

针对前景目标检测中出现的对动态背景适应力不佳、受鬼影及阴影干扰严重的问题,提出一种改进的视觉背景提取(ViBe)算法.首先,通过像素点的动力学模型和闪烁程度来衡量场景的动态程度,并以此自适应更新像素分类和背景模型中的关键参数;然后,利用鬼影的视觉显著性和静止不动的特点,快速找出并消除隐藏在背景模型中的鬼影像素;最后,针对在HSV颜色空间下创建的阴影候选区域,结合移动阴影的纹理不变性,使用LBSP纹理特征进行检测并去除阴影部分.实验结果表明:本文算法的前景检测准确度与错误分类率都要优于经典算法,适用于多种场景下的前景目标检测.     

利用视觉显著性的前景目标分割

针对图像中的前景目标分割问题,提出一种视觉显著性引导的前景目标分割算法.对原始图像进行预处理后分解为互不重叠的超像素区域.将这些区域构成一个无向图,相邻两个区域间存在边,通过计算相邻区域间的特征差异得到边的权值.提取图像边缘的超像素区域作为背景区域,利用无向图计算各超像素区域相对于背景区域的视觉显著性,得到初始显著图.对初始显著图进行改进和优化,根据视觉显著性计算结果采用自适应阈值进行前景目标分割.在公开的图像数据集MASR-1000、ECSSD、Pascal-S和SOD上进行实验验证,并和目前流行的算法进行对比.结果表明,本研究算法在查准率、召回率、平均绝对误差及F-Measure等方面优于目前流行的几种算法,用于图像和视频的前景目标检测与分割是正确有效的.     

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.