Saliency Density Maximization for Efficient Visual Objects Discovery

被引:36
作者
Luo, Ye [1 ]
Yuan, Junsong [1 ]
Xue, Ping [1 ]
Tian, Qi [2 ]
机构
[1] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore, Singapore
[2] Agcy Sci Technol & Res, Inst Infocomm Res, Singapore, Singapore
关键词
Branch-and-bound search; maximum saliency density (MSD); unsupervised salient object discovery; video retargeting; ATTENTION; REGION; MODEL; COLOR;
D O I
10.1109/TCSVT.2011.2147230
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Detection of salient objects in an image remains a challenging problem despite extensive studies in visual saliency, as the generated saliency map is usually noisy and incomplete. In this paper, we propose a new method to discover the salient object without prior knowledge on its shape and size. By searching the sub-image, i.e., a bounding box of maximum saliency density, the new formulation can automatically crop the salient objects of various sizes in spite of the cluttered background, and is capable to handle different types of saliency maps. A global optimal solution is obtained by the proposed density-based branch-and-bound search. The proposed method can apply to both images and videos. Experimental results on a public dataset of 5000 images show that our unsupervised detection approach is comparable to the state-of-the-art learning-based methods. Promising results are also observed in the salient object detection for videos with a good potential in video retargeting.
引用
收藏
页码:1822 / 1834
页数:13
相关论文
共 45 条
  • [1] Achanta R, 2009, PROC CVPR IEEE, P1597, DOI 10.1109/CVPRW.2009.5206596
  • [2] [Anonymous], 2008, PROC INT CONF PATTER
  • [3] [Anonymous], P ACCV
  • [4] [Anonymous], P ACM INT C MULT
  • [5] [Anonymous], 2007, PROC IEEE C COMPUT V, DOI 10.1109/CVPR.2007.383267
  • [6] [Anonymous], 2008, NIPS
  • [7] [Anonymous], 2007, Computer Vision and Pattern Recognition (CVPR), IEEE Conference on
  • [8] [Anonymous], P ICCV WDV
  • [9] [Anonymous], 2006, P 14 ACM INT C MULT
  • [10] [Anonymous], 2007, 2007 IEEE 11 INT C C, DOI DOI 10.1109/ICCV.2007.4409010