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

2.
针对简单线性迭代聚类(simple linear iterative cluste, SLIC)对含有乘性相干斑噪声的合成孔径雷达(synthetic aperture radar, SAR)图像边缘分割不理想的问题,本文在SLIC基础上提出了一种融合边缘信息的SAR图像超像素分割算法。首先,利用高斯方向平滑对SAR图像进行预处理,从而在抑制乘性相干斑噪声的同时有效保护边缘细节;其次,提出了一种基于指数加权平均比率(ratio of exponential weighted average, ROEWA)算子的改进相似度测量参量,以提高SAR图像的分割精度;最后,采用六边形初始化聚类中心与圆形区域的搜索方式进行局部区域聚类,从而保证了算法复杂度增加的同时,算法的运行时间不会明显变化。实验结果表明,与四种经典超像素算法相比,本文算法生成的超像素边缘更加贴合SAR图像的真实边缘且得到的超像素大小较为均匀。  相似文献   

3.
超像素分割是一种重要的图像预处理工具,有关这方面的研究是近年来计算机视觉领域的研究热点。该文对近年来基于聚类方法的超像素分割算法综合分析,并重点就2000年以来三种重要的基于聚类方法的超像素分割算法进行了实验对比,从分割效果和运行效率等方面进行了分析和比较。实验效果显示:DBSCAN超像素生成算法在执行效率和边缘贴合度上都优于其他两种算法,这对于计算机视觉和图像处理领域需要进行快速准确图像分割的应用场景具有重要的参考作用。  相似文献   

4.
【目的】从野外采集的紫色土机器视觉彩色图像往往具有复杂背景,需要研究从中分割提取紫色土区域图像,为紫色土视觉图像识别打下基础。【方法】首先,引入闵可夫斯基距离重新定义 SLIC 算法的颜色空间距离,实现 SLIC 算法改进,利用改进 SLIC算法实现对紫色土彩色图像的超像素初分割;然后,重构基于a 分量的度量anew拉伸紫色土与背景差异,利用重构anew定义超像素之间的相似度,并根据类间方差最大准则建立优化模型,优化超像素之间相似度的合并阈值,根据阈值从初分割图像中心超像素开始由内而外合并紫色土超像素;最后,提出填充算法来填充紫色土区域内部空洞,获得最终分割提取的紫色土区域图像。【结果】仿真实验图像结果显示:提出的算法从具有复杂背景的野外采集的紫色土机器视觉彩色图像中,分割提取紫色土区域图像是有效的;对有不同阴影覆盖的视觉图像样本的分割提取也具有有效性;仿真实验定量分析的数据结果显示:提出的算法相对于用来对比的阈值分割算法、聚类分割算法、已有的改进 SLIC算法在杰卡德系数评价指标上有一定程度的提高。【结论】提出的算法对从紫色土机器视觉彩色图像中完整分割提取紫色土区域图像,能实现自适应分割,算法是有效的。  相似文献   

5.
针对目前流行的显著性检测算法不能精确反映显著性信息的问题,提出一种基于超像素融合方法的显著性检测算法. 首先对图像进行超像素分割,在保证高质量的图像目标边缘信息前提下,建立以超像素为节点的图模型;然后计算超像素邻接矩阵,将该图模型转化为最小生成树模型. 通过OTSU算法自适应地确定最佳阈值,根据该阈值将最小生成树模型的部分节点进行融合,获得大超像素分割区域;最后利用大超像素的颜色和相互距离信息,获得高质量的显著性图. 实验结果表明,相对于其他检测方法,该算法可以更有效地检测出图像中的显著目标,并能达到接近分割的效果.   相似文献   

6.
针对简单线性迭代聚类算法在多光谱遥感图像超像素分割中存在的未充分利用图像特征信息及超像素尺寸、 数量固定导致分割精度较低的问题, 提出将流形 简单线性迭代聚类算法引入到遥感图像超像素分割任务中, 并对其进行改进. 首先, 给出一种基于彩色局部二进制模式改进的多光谱遥感图像纹理特征提取方法; 其次, 扩展流形 简单线性迭代聚类算法的光谱空间, 使算法可以适应高维图像数据; 最后, 改进流形 简单线性迭代聚类算法的聚类距离度量, 融合图像的多段光谱特征、 空间特征及纹理特征对像素进行迭代聚类, 实现内容敏感超像素分割. 实验结果表明, 与现有方法相比, 该算法对多光谱遥感图像的超像素分割结果更准确, 在边缘召回率、 欠分割误差、 可达细分精度指标上均有提升, 能改善多光谱遥感图像分割预处理方法中精度较低的问题.  相似文献   

7.
显著区域检测是计算机视觉领域中一个极具挑战性的问题。当前,多数显著区域检测算法通过直接计算图像中每个像素或图像块与其一定范围内邻域的差异来判断像素的显著性。当图像背景杂乱或者图像中的前景和背景有相似特征时,这些传统方法的检测性能明显下降。该文提出一个基于再聚类的显著区域检测算法框架:首先,利用聚类算法将图像过分割得到的超像素再聚类成多个超像素簇,其中提出了自动确定尺度参数和聚类个数的方法;其次,基于聚类得到的超像素簇,该文又提出一个自动选择可能的背景簇的方法,并将其作为排序算法中的查询项来估计全图的显著性。在两个差异较大的公开数据集上,该算法实现了相对稳定的显著区域检测结果,而且在部分性能指标上明显优于其他5种算法。  相似文献   

8.
针对当前显著性检测算法普遍存在的背景噪声较多,目标区域检测不够完整等问题,提出了一种空间域的显著性算法.首先将输入图像进行超像素分割,以边缘信息作为背景先验区域集,通过计算超像素与背景先验区域集内超像素在颜色、亮度方面的差异,得到背景差异显著图;然后确定前景先验区域集,计算各超像素与前景先验区域集内超像素的差异性,得到前景差异显著图.最后融合两部分显著图;最后在此基础上构建视觉中心,围绕视觉中心确定各超像素空间权重信息,得到最终显著图.采用MSRA-1000数据库进行对照实验,结果表明本文算法的准确性更高,整体效果更好.  相似文献   

9.
针对现有显著性检测方法得到的显著区域不完整以及存在背景干扰的问题,提出一种空间域的图像显著性检测方法.首先将输入图像进行超像素分割,然后利用超像素图像的颜色和亮度信息获得差值显著图以及视觉中心,依据超像素种子点与视觉中心的位置关系获得空间权重,最后将各超像素块的显著值与其视觉空间权重相结合计算,以此得到最终的视觉显著图.与现有算法相比,方法既能得到精确的显著区域,保留边缘细节信息,又能有效地去除背景干扰,提高了检测精确度.  相似文献   

10.
针对目前图像显著性检测存在的显著性图边缘模糊、缺乏视觉高层信息等问题,提出了一种基于物体信息的显著性检测算法。将似物性计算与显著性计算相结合,可以将前景与背景分离,抑制高对比度干扰区域的影响。首先采用改进的L0平滑算法对图像进行滤波处理,然后通过超像素分割将图像分成若干图像块,再通过聚类算法进行合并,得到待检测图像块。采用似物性检测算法计算物体可能存在的区域,与待检测图像块进行融合,得到物体显著性图,再通过颜色对比度及空间分布特征计算显著性图,最后将二者融合,得到最终结果。实验结果表明,算法能够得到清晰的物体边缘,对图像的显著性区域能够较为全面地覆盖,有效地抑制高对比区域的干扰。  相似文献   

11.
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.  相似文献   

12.
AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…  相似文献   

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

14.
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  相似文献   

15.
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  相似文献   

16.
17.
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.  相似文献   

18.
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).  相似文献   

19.
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.  相似文献   

20.
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.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号