Key points are not available for this paper at this time.
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 labelling by the user. Unlike existing image completion methods, our algorithm can generate a diverse set of results for each input image and we allow users to select among them. We demonstrate the superiority of our algorithm over existing image completion approaches.
Building similarity graph...
Analyzing shared references across papers
Loading...
James Hays
Georgia Institute of Technology
Alexei A. Efros
Conference Board
ACM Transactions on Graphics
Carnegie Mellon University
Building similarity graph...
Analyzing shared references across papers
Loading...
Hays et al. (Sun,) studied this question.
synapsesocial.com/papers/6a0ecca41c5e2d2319f9e38f — DOI: https://doi.org/10.1145/1276377.1276382