Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Fast texture synthesis using tree-structured vector quantization
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
Real-time texture synthesis by patch-based sampling
ACM Transactions on Graphics (TOG)
Missing data correction in still images and image sequences
Proceedings of the tenth ACM international conference on Multimedia
Texture Synthesis by Non-Parametric Sampling
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Image Denoising through Locally Linear Embedding
CGIV '05 Proceedings of the International Conference on Computer Graphics, Imaging and Visualization
Fast Anisotropic Smoothing of Multi-Valued Images using Curvature-Preserving PDE's
International Journal of Computer Vision
Image Completion Using Global Optimization
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
Projected Gradient Methods for Nonnegative Matrix Factorization
Neural Computation
LDR-LLE: LLE with Low-Dimensional Neighborhood Representation
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
PatchMatch: a randomized correspondence algorithm for structural image editing
ACM SIGGRAPH 2009 papers
Image inpainting by patch propagation using patch sparsity
IEEE Transactions on Image Processing
A comprehensive framework for image inpainting
IEEE Transactions on Image Processing - Special section on distributed camera networks: sensing, processing, communication, and implementation
Graph Regularized Nonnegative Matrix Factorization for Data Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Region filling and object removal by exemplar-based image inpainting
IEEE Transactions on Image Processing
IEEE Transactions on Image Processing
IEEE Transactions on Image Processing
Statistics of patch offsets for image completion
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part II
Hi-index | 0.00 |
Exemplar-based inpainting methods involve three critical steps: finding the patch processing order, searching for best matching patches, and estimating the unknown pixels from the best matching patches. The paper addresses each step and first introduces a new patch priority term taking into account the presence of edges in the patch to be filled-in. The paper then presents a method using linear regression based local learning of subspace mapping functions to enhance the search for the nearest neighbors (K-NN) to the input patch in the particular case of inpainting. Several neighbor embedding (NE) methods are then considered for estimating the unknown pixels. The performances of the resulting inpainting algorithms are assessed in two application contexts: object removal and loss concealment. In the loss concealment application, the ground truth is known, hence objective measures (e.g., PSNR) can be used to assess the performances of the different methods. The inpainting results are compared against those obtained with various state-of-the-art solutions for both application contexts.