首页 | 官方网站   微博 | 高级检索  
相似文献
 共查询到17条相似文献,搜索用时 171 毫秒
1.
针对当前基于流形排序的显著性检测算法缺乏子空间信息的挖掘和节点间传播不准确的问题,该文提出一种基于低秩背景约束与多线索传播的图像显著性检测算法.融合颜色、位置和边界连通度等初级视觉先验形成背景高级先验,约束图像特征矩阵的分解,强化低秩矩阵与稀疏矩阵的差异,充分描述子空间结构信息,从而有效地将前景与背景分离;引入稀疏感知和局部平滑等线索改进传播矩阵的构建,增强颜色特征出现概率低的节点的传播能力,加强局部区域内节点的关联性,准确凸显节点的属性,得到紧密且连续的显著区域.在3个基准数据集上的实验结果与图像检索领域的应用证明了该文算法的有效性和鲁棒性.  相似文献   

2.
针对当前基于流形排序的显著性检测算法缺乏子空间信息的挖掘和节点间传播不准确的问题,该文提出一种基于低秩背景约束与多线索传播的图像显著性检测算法。融合颜色、位置和边界连通度等初级视觉先验形成背景高级先验,约束图像特征矩阵的分解,强化低秩矩阵与稀疏矩阵的差异,充分描述子空间结构信息,从而有效地将前景与背景分离;引入稀疏感知和局部平滑等线索改进传播矩阵的构建,增强颜色特征出现概率低的节点的传播能力,加强局部区域内节点的关联性,准确凸显节点的属性,得到紧密且连续的显著区域。在3个基准数据集上的实验结果与图像检索领域的应用证明了该文算法的有效性和鲁棒性。  相似文献   

3.
针对目前协同显著性检测问题中存在的协同性较差、误匹配和复杂场景下检测效果不佳等问题,该文提出一种基于卷积神经网络与全局优化的协同显著性检测算法。首先基于VGG16Net构建了全卷积结构的显著性检测网络,该网络能够模拟人类视觉注意机制,从高级语义层次提取一幅图像中的显著性区域;然后在传统单幅图像显著性优化模型的基础上构造了全局协同显著性优化模型。该模型通过超像素匹配机制,实现当前超像素块显著值在图像内与图像间的传播与共享,使得优化后的显著图相对于初始显著图具有更好的协同性与一致性。最后,该文创新性地引入图像间显著性传播约束因子来克服超像素误匹配带来的影响。在公开测试数据集上的实验结果表明,所提算法在检测精度和检测效率上优于目前的主流算法,并具有较强的鲁棒性。  相似文献   

4.
针对传统的图流行排序显著性目标检测算法存在先验信息单一,显著目标检测不完整的问题,提出一种新的基于背景先验与中心先验的显著性目标检测算法。首先将图像边界节点作为背景种子进行流行排序获得粗略的前景区域,将其再次流行排序得到初步显著图;然后利用Harris角点检测、聚类实现中心先验显著性检测,捕获中心显著信息;最后在初步显著图上融合图像中心显著性,得到最终显著图。本文对综合指标、精确率-召回率曲线、F-measure值以及平均绝对误差(mean absolute error,MAE)值进行实验评估,在公开数据集MSRA-10K和ECSSD上进行的实验结果表明:对比10种主流算法,本文算法在不同的评估指标上都具有较好的表现,且能准确地突出显著目标,提升背景抑制效果。  相似文献   

5.
现有的大部分基于扩散理论的显著性物体检测方法只用了图像的底层特征来构造图和扩散矩阵,并且忽视了显著性物体在图像边缘的可能性。针对此,该文提出一种基于图像的多层特征的扩散方法进行显著性物体检测。首先,采用由背景先验、颜色先验、位置先验组成的高层先验方法选取种子节点。其次,将选取的种子节点的显著性信息通过由图像的底层特征构建的扩散矩阵传播到每个节点得到初始显著图,并将其作为图像的中层特征。然后结合图像的高层特征分别构建扩散矩阵,再次运用扩散方法分别获得中层显著图、高层显著图。最后,非线性融合中层显著图和高层显著图得到最终显著图。该算法在3个数据集MSRA10K,DUT-OMRON和ECSSD上,用3种量化评价指标与现有4种流行算法进行实验结果对比,均取得最好的效果。  相似文献   

6.
为了改善红外图像的视觉效果,突出细节信息,同时抑制噪声。提出了结合改进的LC显著性检测和双区域直方图均衡化的红外图像增强方法。首先使用结合局部熵加权的LC显著性检测算法得到显著图。然后使用K-means算法对显著图进行自适应分割得到前景区域和背景区域。最后对前景区域进行结合局部方差的改进直方图均衡化,对背景区域使用限制对比度直方图均衡化增强。实验结果表明,与当前主流算法相比,本文算法主观效果更佳,且峰值信噪比、结构相似性、信息熵等客观评价参数均有所提升。  相似文献   

7.
郑云飞  张雄伟  曹铁勇  孙蒙 《电子学报》2017,45(11):2593-2601
基于底层视觉特征和先验知识的显著性区域检测算法难以检测一些复杂的显著性目标,人的视觉系统能分辨这些目标是由于其中包含丰富的语义知识.本文构建了一个基于全卷积结构的语义显著性区域检测网络,用数据驱动的方式构建从图像底层特征到人类语义认知的映射,提取语义显著性区域.针对网络提取的语义显著性区域的缺点,本文进一步引入颜色信息、目标边界信息、空间一致性信息获得准确的超像素级前景和背景概率.最后提出一个优化模型融合前景和背景概率信息、语义信息、空间一致性信息得到最终的显著性区域图.在6个数据集上与15种最新算法的比较实验证明了本文算法的有效性和鲁棒性.  相似文献   

8.
针对显著性目标多样性和不确定性,机器学习算法无法检测没有先验信息的图像问题,提出了一种基于图像边缘信息构建背景模型结合SVM分类算法的显著性目标检测算法.该方法对输入图像进行超像素预处理,使像素级转化为超像素级,既抑制噪声,又提高了计算效率.利用图像边缘超像素构建图像的初始背景模型,得到初始显著图.基于SVM算法建立目...  相似文献   

9.
复杂背景是影响场景文字自动定位算法性能的重要因素。为消除背景干扰,本文首先根据谱残差理论获取显著性区域,然后利用基于笔画特征的点对梯度方向差比例图与基于傅里叶谱统计特征的后验概率图取得显著性区域的文字置信图,最后借助图模型融合视觉显著性图、文字置信图与HSI颜色特征最终达到抑制自然图像背景并突出前景文字的效果。在ICDAR2011场景文字定位竞赛数据库与实验室场景中文数据库中的实验结果表明,本算法可较好的抑制自然图像中复杂背景,并有效提升算法的性能。  相似文献   

10.
针对遥感船舶检测任务场景中与海面颜色相似船舶显著值低以及海岸线、岛屿等背景干扰问题,提出一种基于显著性候选区域的遥感船舶检测算法.首先,该算法采用脉冲耦合神经网络将根据改进频率调谐显著性检测与Hessian矩阵边缘检测得到的两种显著图相融合得到总显著图,以提高与海面背景颜色相近船舶的显著值,从而提取有效的船舶候选区域切...  相似文献   

11.
该文针对现有的基于图的流形排序的显著性目标检测方法中仅使用k-正则图刻画各个节点的空间连接性的不足以及先验背景假设过于理想化的缺陷,提出一种改进的方法,旨在保持高查全率的同时,提高准确率。在构造图模型时,先采用仿射传播聚类将各超像素(节点)自适应地划分为不同的颜色类,在传统的k-正则图的基础上,将属于同一颜色类且空间上位于同一连通区域的各个节点也连接在一起;而在选取背景种子点时,根据边界连接性赋予位于图像边界的超像素不同的背景权重,采用图割方法筛选出真正的背景种子点;最后,采用经典的流形排序算法计算显著性。在常用的MSRA-1000和复杂的SOD数据库上同7种流行算法的4种量化评价指标的实验对比证明了所提改进算法的有效性和优越性。  相似文献   

12.
In this paper, we propose a salient region detection algorithm from the point of view of unique and compact representation of individual image. In first step, the original image is segmented into super-pixels. In second step, the sparse representation measure and uniqueness of the features are computed. Then both are ranked on the basis of the background and foreground seeds respectively. Thirdly, a location prior map is used to enhance the foci of attention. We apply the Bayes procedure to integrate computed results to produce smooth and precise saliency map. We compare our proposed algorithm against the state-of-the-art saliency detection methods using four of the largest widely available standard data-bases, experimental results specify that the proposed algorithm outperforms. We also show that how the saliency map of the proposed method is used to discover outline of object, furthermore using this outline our method produce the saliency cut of the desired object.  相似文献   

13.
Unlike 2D saliency detection, 3D saliency detection can consider the effects of depth and binocular parallax. In this paper, we propose a 3D saliency detection approach based on background detection via depth information. With the aid of the synergism between a color image and the corresponding depth map, our approach can detect the distant background and surfaces with gradual changes in depth. We then use the detected background to predict the potential characteristics of the background regions that are occluded by foreground objects through polynomial fitting; this step imitates the human imagination/envisioning process. Finally, a saliency map is obtained based on the contrast between the foreground objects and the potential background. We compare our approach with 14 state-of-the-art saliency detection methods on three publicly available databases. The proposed model demonstrates good performance and succeeds in detecting and removing backgrounds and surfaces of gradually varying depth on all tested databases.  相似文献   

14.
There have been remarkable improvements in the salient object detection in the recent years. During the past few years, graph-based saliency detection algorithms have been proposed and made advances. Nevertheless, most of the state-of-the-art graph-based approaches are usually designed with low-level features, misleading assumption, fixed predefined graph structure and weak affinity matrix, which determine that they are not robust enough to handle images with complex or cluttered background.In this paper, we propose a robust label propagation-based mechanism for salient object detection throughout an adaptive graph to tackle above issues. Low-level features as well as deep features are integrated into the proposed framework to measure the similarity between different nodes. In addition, a robust mechanism is presented to calculate seeds based on the distribution of salient regions, which can achieve desirable results even if the object is in contact with the image boundary and the image scene is complex. Then, an adaptive graph with multiview connections is constructed based on different cues to learn the graph affinity matrix, which can better capture the characteristics between spatially adjacent and distant regions. Finally, a novel RLP-AGMC model, i.e. robust label propagation throughout an adaptive graph with multiview connections, is put forward to calculate saliency maps in combination with the obtained seed vectors. Comprehensive experiments on six public datasets demonstrate the proposed method outperforms fourteen existing state-of-the-art methods in terms of various evaluation metrics.  相似文献   

15.
Saliency detection has been researched for conventional images with standard aspect ratios, however, it is a challenging problem for panoramic images with wide fields of view. In this paper, we propose a saliency detection algorithm for panoramic landscape images of outdoor scenes. We observe that a typical panoramic image includes several homogeneous background regions yielding horizontally elongated distributions, as well as multiple foreground objects with arbitrary locations. We first estimate the background of panoramic images by selecting homogeneous superpixels using geodesic similarity and analyzing their spatial distributions. Then we iteratively refine an initial saliency map derived from background estimation by computing the feature contrast only within local surrounding area whose range and shape are changed adaptively. Experimental results demonstrate that the proposed algorithm detects multiple salient objects faithfully while suppressing the background successfully, and it yields a significantly better performance of panorama saliency detection compared with the recent state-of-the-art techniques.  相似文献   

16.
In this paper, we propose a novel approach to automatically detect salient regions in an image. Firstly, some corner superpixels serve as the background labels and the saliency of other superpixels are determined by ranking their similarities to the background labels based on ranking algorithm. Subsequently, we further employ an objectness measure to pick out and propagate foreground labels. Furthermore, an integration algorithm is devised to fuse both background-based saliency map and foreground-based saliency map, meanwhile an original energy function is acted as refinement before integration. Finally, results from multiscale saliency maps are integrated to further improve the detection performance. Our experimental results on five benchmark datasets demonstrate the effectiveness of the proposed method. Our method produces more accurate saliency maps with better precision-recall curve, higher F-measure and lower mean absolute error than other 13 state-of-the-arts approaches on ASD, SED, ECSSD, iCoSeg and PASCAL-S datasets.  相似文献   

17.
针对复杂海面背景下红外图像舰船目标由于灰度不均匀、海杂波干扰大等因素造成的自动检测虚警率高、准确率低的问题,提出了一种显著区域提取和目标精确分割相结合的红外舰船目标检测方法。首先,利用基于图论的视觉显著性(Graph-based Visual Saliency ,GBVS)模型计算待检测图像的显著图,使得目标区域信息增强;其次,结合舰船目标先验信息(长短轴、面积等),利用多级阈值划分算法提取关注的显著区域,并确定原图中候选目标区域;最后,利用空间约束模糊C均值(Fuzzy C-Means,FCM)算法对候选区域进行分割,结合目标先验知识对分割区域筛选并输出目标位置。所提方法在公开数据集IRShips上与相关方法进行比较,结果表明,相比直接进行全图目标搜索的方法,所提方法不仅准确率高、执行速度快,且检测目标的位置更加精确。  相似文献   

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

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

京公网安备 11010802026262号