Approximate nearest neighbor queries in fixed dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Video Repairing under Variable Illumination Using Cyclic Motions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Space-Time Completion of Video
IEEE Transactions on Pattern Analysis and Machine Intelligence
PatchMatch: a randomized correspondence algorithm for structural image editing
ACM SIGGRAPH 2009 papers
Temporally consistent gradient domain video editing
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
Image melding: combining inconsistent images using patch-based synthesis
ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
Virtual Contour Guided Video Object Inpainting Using Posture Mapping and Retrieval
IEEE Transactions on Multimedia
How Not to Be Seen — Object Removal from Videos of Crowded Scenes
Computer Graphics Forum
Disocclusion: a variational approach using level lines
IEEE Transactions on Image Processing
Computing nearest-neighbor fields via Propagation-Assisted KD-Trees
CVPR '12 Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
| Hi-index | 0.00 |
Achieving globally coherent video inpainting results in reasonable time and in an automated manner is still an open problem. In this paper, we build on the seminal work by Wexler et al. to propose an automatic video inpainting algorithm yielding convincing results in greatly reduced computational times. We extend the PatchMatch algorithm to the spatio-temporal case in order to accelerate the search for approximate nearest neighbours in the patch space. We also provide a simple and fast solution to the well known over-smoothing problem resulting from the averaging of patches. Furthermore, we show that results similar to those of a supervised state-of-the-art method may be obtained on high resolution videos without any manual intervention. Our results indicate that globally coherent patch-based algorithms are feasible and an attractive solution to the difficult problem of video inpainting.