Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Graphcut textures: image and video synthesis using graph cuts
ACM SIGGRAPH 2003 Papers
Fragment-based image completion
ACM SIGGRAPH 2003 Papers
"GrabCut": interactive foreground extraction using iterated graph cuts
ACM SIGGRAPH 2004 Papers
Image completion with structure propagation
ACM SIGGRAPH 2005 Papers
Image Completion Using Global Optimization
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
Image inpainting by global structure and texture propagation
Proceedings of the 15th international conference on Multimedia
Scene completion using millions of photographs
Communications of the ACM
An Image Completion Algorithm Using Occlusion-Free Images from Internet Photo Sharing Sites
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
RepFinder: finding approximately repeated scene elements for image editing
ACM SIGGRAPH 2010 papers
Filling-in by joint interpolation of vector fields and gray levels
IEEE Transactions on Image Processing
| Hi-index | 0.00 |
Image completion technique is widely used in image processing applications such as textural recovery, object removal, image edit, etc. When filling in the missing areas of an image, it is often a challenge to keep local consistency of image structures while avoiding ambiguity and visual artifacts. To tackle with this problem, we propose a robust sample-based image completion scheme which is a cascade of two major procedures. First, we extract structural information from both source and sample images and then apply boundary band map (BBM) descriptor to perform template matching under contour consistency constraint and reconstruct the damaged structures. Second, a weighted exemplar-based image synthesis algorithm is further devised taking the previous structural information and matching results into account. Extensive experiments and comparative study show the reliability and superiority of our image completion algorithm.