Image completion using image skimming

This paper is concerned with the problem of image completion where the goal is to fill large missing parts (holes) in an image, video or a scene in a visually-plausible and a computationally-efficient manner. Recently, the literature on hole filling was dominated by exemplar-based (patch-based) filling techniques with a two-stage unified pipeline that starts by building a bag of significant patches (BoSP), and then uses that bag to fill the hole. In this paper, we propose a new framework which addresses the inherent limitations of the state-of-the-art techniques. Our method capitalizes on a newly-developed technique for image skimming, followed by a novel procedure to propagate the constructed skim to within the hole. Experimental results show that our method compares favourably with the state-of-the-art.

[1]  Jian Sun,et al.  Computing nearest-neighbor fields via Propagation-Assisted KD-Trees , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[2]  Andrew W. Fitzgibbon,et al.  Global stereo reconstruction under second order smoothness priors , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[3]  Vladimir Kolmogorov,et al.  An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision , 2001, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Patrick Pérez,et al.  Object removal by exemplar-based inpainting , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[5]  Yael Pritch,et al.  Shift-map image editing , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[6]  Eli Shechtman,et al.  Space-time video completion , 2004, CVPR 2004.

[7]  Shai Avidan,et al.  Coherency Sensitive Hashing , 2011, ICCV.

[8]  Olga Veksler,et al.  Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Nikos Komodakis,et al.  Image Completion Using Global Optimization , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[10]  Vladimir Kolmogorov,et al.  Minimizing Nonsubmodular Functions with Graph Cuts-A Review , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Eli Shechtman,et al.  Space-Time Completion of Video , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Jian Sun,et al.  Statistics of Patch Offsets for Image Completion , 2012, ECCV.

[13]  Lena Gorelick,et al.  Submodularization for Binary Pairwise Energies , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[14]  Kwanghoon Sohn,et al.  Space-Time Hole Filling With Random Walks in View Extrapolation for 3D Video , 2013, IEEE Transactions on Image Processing.

[15]  Steven M. Seitz,et al.  Scene Summarization for Online Image Collections , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[16]  Guillermo Sapiro,et al.  Image inpainting , 2000, SIGGRAPH.

[17]  Eli Shechtman,et al.  PatchMatch: a randomized correspondence algorithm for structural image editing , 2009, ACM Trans. Graph..

[18]  David Salesin,et al.  Interactive digital photomontage , 2004, SIGGRAPH 2004.

[19]  Luc Van Gool,et al.  Creating Summaries from User Videos , 2014, ECCV.

[20]  Denis Simakov,et al.  Summarizing visual data using bidirectional similarity , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.