基于全局对比图的显著目标检测

F. Nouri, K. Kazemi, H. Danyali
{"title":"基于全局对比图的显著目标检测","authors":"F. Nouri, K. Kazemi, H. Danyali","doi":"10.1109/SPIS.2015.7422332","DOIUrl":null,"url":null,"abstract":"In this paper, we propose an unsupervised bottom-up method which formulates salient object detection problem as finding salient vertices of a graph. Global contrast is extracted in a novel graph-based framework to determine localization of salient objects. Saliency values are assigned to regions in terms of nodes degrees on graph. The proposed method has been applied on SED2 dataset. The qualitative and quantitative evaluation of the proposed method show that it can detect the salient objects appropriately in comparison with 5 state-of-art saliency models.","PeriodicalId":424434,"journal":{"name":"2015 Signal Processing and Intelligent Systems Conference (SPIS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Salient object detection via global contrast graph\",\"authors\":\"F. Nouri, K. Kazemi, H. Danyali\",\"doi\":\"10.1109/SPIS.2015.7422332\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose an unsupervised bottom-up method which formulates salient object detection problem as finding salient vertices of a graph. Global contrast is extracted in a novel graph-based framework to determine localization of salient objects. Saliency values are assigned to regions in terms of nodes degrees on graph. The proposed method has been applied on SED2 dataset. The qualitative and quantitative evaluation of the proposed method show that it can detect the salient objects appropriately in comparison with 5 state-of-art saliency models.\",\"PeriodicalId\":424434,\"journal\":{\"name\":\"2015 Signal Processing and Intelligent Systems Conference (SPIS)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 Signal Processing and Intelligent Systems Conference (SPIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPIS.2015.7422332\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Signal Processing and Intelligent Systems Conference (SPIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPIS.2015.7422332","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

本文提出了一种无监督的自底向上方法,该方法将显著目标检测问题表述为寻找图的显著顶点。在一种新的基于图的框架中提取全局对比度,以确定显著目标的定位。显著性值是根据图上的节点度分配给区域的。该方法已在SED2数据集上得到应用。定性和定量评价表明,与现有的5种显著性模型相比,该方法能较好地检测出显著性目标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Salient object detection via global contrast graph
In this paper, we propose an unsupervised bottom-up method which formulates salient object detection problem as finding salient vertices of a graph. Global contrast is extracted in a novel graph-based framework to determine localization of salient objects. Saliency values are assigned to regions in terms of nodes degrees on graph. The proposed method has been applied on SED2 dataset. The qualitative and quantitative evaluation of the proposed method show that it can detect the salient objects appropriately in comparison with 5 state-of-art saliency models.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信