Scene Completion Using Millions of Photographs

被引:101
作者
Hays, James [1 ]
Efros, Alexei A. [1 ]
机构
[1] Carnegie Mellon Univ, Pittsburgh, PA 15213 USA
关键词
D O I
10.1145/1400181.1400202
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
What can you do with a million images? In this paper, we present a new image completion algorithm powered by a huge database of photographs gathered from the Web. The algorithm patches up holes in images by finding similar image regions in the database that are not only seamless, but also semantically valid. Our chief insight is that while the space of images is effectively infinite, the space of semantically differentiable scenes is actually not that large. For many image completion tasks, we are able to find similar scenes which contain image fragments that will convincingly complete the image. Our algorithm is entirely data driven, requiring no annotations or labeling by the user. Unlike existing image completion methods, our algorithm can generate a diverse set of image completions and we allow users to select among them. We demonstrate the superiority of our algorithm over existing image completion approaches.
引用
收藏
页码:87 / 94
页数:8
相关论文
共 25 条
[1]   Interactive digital photomontage [J].
Agarwala, A ;
Dontcheva, M ;
Agrawala, M ;
Drucker, S ;
Colburn, A ;
Curless, B ;
Salesin, D ;
Cohen, M .
ACM TRANSACTIONS ON GRAPHICS, 2004, 23 (03) :294-302
[2]  
[Anonymous], EUR C COMP VIS ECCV
[3]   Fast approximate energy minimization via graph cuts [J].
Boykov, Y ;
Veksler, O ;
Zabih, R .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (11) :1222-1239
[4]  
Criminisi A, 2003, PROC CVPR IEEE, P721
[5]  
DIAKOPOULOS N, 2004, C IM VID RETR CIVR
[6]   Fragment-based image completion [J].
Drori, I ;
Cohen-Or, D ;
Yeshurun, H .
ACM TRANSACTIONS ON GRAPHICS, 2003, 22 (03) :303-312
[7]  
Efros AA, 2001, COMP GRAPH, P341, DOI 10.1145/383259.383296
[8]  
EFROS AA, 1999, TEXTURE SYNTHESIS NO, P1033
[9]  
Hays J, 2008, IM2GPS ESTIMATING GE
[10]  
Hays J, 2007, ACM T GRAPHIC, V26, DOI [10.1145/1239451.1239455, 10.1145/1276377.1276382]