Detecting Co-Salient Objects in Large Image Sets | |
Du Shuze; Chen Shifeng | |
刊名 | IEEE SIGNAL PROCESSING LETTERS
![]() |
2015 | |
英文摘要 | Co-salient object detection has attracted much more attention recently as it is useful for many problems in vision computing. However, most of existing methods emphasize detecting the common salient objects in a small group of images and the objects of interest in those images have clear borders with respect to the backgrounds. In this work, we propose a novel co-saliency detection method, which aims at discovering the common objects in a large and diverse image set composed of hundreds of images. First, we search a group of similar images for each image in the set. Our method is based on the overlapped groups. We handle each group with an unsupervised random forest to extract the rough contours of the common objects. Then a contrast-based measure is utilized to produce the saliency map for an individual image. For each image in the set, we collect all the maps from the groups that contain the image and fuse them together as the inter-saliency map for the image. The final co-saliency map is computed by combining the inter-saliency map with the single saliency map of this image. Experimental evaluation on an established large dataset demonstrates that our approach attains superior results and outperforms the state-of-the-art methods. |
收录类别 | SCI |
原文出处 | http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6880789 |
语种 | 英语 |
内容类型 | 期刊论文 |
源URL | [http://ir.siat.ac.cn:8080/handle/172644/6564] ![]() |
专题 | 深圳先进技术研究院_集成所 |
作者单位 | IEEE SIGNAL PROCESSING LETTERS |
推荐引用方式 GB/T 7714 | Du Shuze,Chen Shifeng. Detecting Co-Salient Objects in Large Image Sets[J]. IEEE SIGNAL PROCESSING LETTERS,2015. |
APA | Du Shuze,&Chen Shifeng.(2015).Detecting Co-Salient Objects in Large Image Sets.IEEE SIGNAL PROCESSING LETTERS. |
MLA | Du Shuze,et al."Detecting Co-Salient Objects in Large Image Sets".IEEE SIGNAL PROCESSING LETTERS (2015). |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论