Cosegmentation and Cosketch by Unsupervised Learning

被引:46
作者
Dai, Jifeng [1 ,2 ]
Wu, Ying Nian [2 ]
Zhou, Jie [1 ]
Zhu, Song-Chun [2 ]
机构
[1] Tsinghua Univ, Dept Automat, Beijing, Peoples R China
[2] Univ Calif Los Angeles, Dept Stat, Los Angeles, CA 90024 USA
来源
2013 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV) | 2013年
关键词
D O I
10.1109/ICCV.2013.165
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Cosegmentation refers to the problem of segmenting multiple images simultaneously by exploiting the similarities between the foreground and background regions in these images. The key issue in cosegmentation is to align common objects between these images. To address this issue, we propose an unsupervised learning framework for cosegmentation, by coupling cosegmentation with what we call "cosketch". The goal of cosketch is to automatically discover a codebook of deformable shape templates shared by the input images. These shape templates capture distinct image patterns and each template is matched to similar image patches in different images. Thus the cosketch of the images helps to align foreground objects, thereby providing crucial information for cosegmentation. We present a statistical model whose energy function couples cosketch and cosegmentation. We then present an unsupervised learning algorithm that performs cosketch and cosegmentation by energy minimization. Experiments show that our method outperforms state of the art methods for cosegmentation on the challenging MSRC and iCoseg datasets. We also illustrate our method on a new dataset called Coseg- Rep where cosegmentation can be performed within a single image with repetitive patterns.
引用
收藏
页码:1305 / 1312
页数:8
相关论文
共 23 条
  • [1] Ahuja N., 2007, ICCV
  • [2] [Anonymous], 2005, ICCV
  • [3] [Anonymous], 2010, CVPR
  • [4] [Anonymous], 2010, CVPR
  • [5] [Anonymous], 2012, ECCV
  • [6] [Anonymous], 2006, ECCV
  • [7] [Anonymous], 2011, CVPR
  • [8] [Anonymous], ECCV
  • [9] [Anonymous], 2012, ECCV
  • [10] [Anonymous], 2004, TOG