Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Image quilting for texture synthesis and transfer
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Real-time texture synthesis by patch-based sampling
ACM Transactions on Graphics (TOG)
Texture Synthesis by Non-Parametric Sampling
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Graphcut textures: image and video synthesis using graph cuts
ACM SIGGRAPH 2003 Papers
Learning How to Inpaint from Global Image Statistics
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Near-regular texture analysis and manipulation
ACM SIGGRAPH 2004 Papers
Image completion with structure propagation
ACM SIGGRAPH 2005 Papers
Scene completion using millions of photographs
ACM SIGGRAPH 2007 papers
Inpainting and Zooming Using Sparse Representations
The Computer Journal
PatchMatch: a randomized correspondence algorithm for structural image editing
ACM SIGGRAPH 2009 papers
Exact Matrix Completion via Convex Optimization
Foundations of Computational Mathematics
A comprehensive framework for image inpainting
IEEE Transactions on Image Processing - Special section on distributed camera networks: sensing, processing, communication, and implementation
The generalized patchmatch correspondence algorithm
ECCV'10 Proceedings of the 11th European conference on computer vision conference on Computer vision: Part III
TILT: Transform Invariant Low-Rank Textures
International Journal of Computer Vision
Sparse Representation for Color Image Restoration
IEEE Transactions on Image Processing
Unwrapping low-rank textures on generalized cylindrical surfaces
ICCV '11 Proceedings of the 2011 International Conference on Computer Vision
Hi-index | 0.00 |
In this paper, we show how to harness both low-rank and sparse structures in regular or near regular textures for image completion. Our method leverages the new convex optimization for low-rank and sparse signal recovery and can automatically correctly repair the global structure of a corrupted texture, even without precise information about the regions to be completed. Through extensive simulations, we show our method can complete and repair textures corrupted by errors with both random and contiguous supports better than existing low-rank matrix recovery methods. Through experimental comparisons with existing image completion systems (such as Photoshop) our method demonstrate significant advantage over local patch based texture synthesis techniques in dealing with large corruption, non-uniform texture, and large perspective deformation.