PatchMove: Patch-based Fast Image Interpolation with Greedy Bidirectional Correspondence

Shunsuke Saito
Waseda University
Ryuuki Sakamoto
Yahoo Japan Corp.
Shigeo Morishima
Waseda University

(a) and (b) show input images with motion parallax. Simple patch-based interpolation causes unwanted blurring and loss of detailed texture, such as in (c). In such a challenging situation, the texture reconstruction algorithm renders an intermediate frame (d) that is as fine as the ground truth (e).


In this paper, we present a method for the plausible interpolation of images. This method has several applications, such as for smooth view interpolation, low frame-rate video upsampling, and animation. The central idea is to quickly form dense correspondences using a patch-based nearest-neighbor search method called PatchMatch. However, the conventional PatchMatch method does not always find an accurate correspondence. This means that some patches do not find appropriate counterparts. Our method employs a greedy algorithm and an occlusion handling technique to correct inaccurate correspondences. Furthermore, our texture reconstruction method successfully reduces blurring effects. We demonstrate that our method significantly reduces the computation time required for interpolation, and show that the quality of reconstructed images is almost identical to that of those generated using state-of-the-art methods.


Shunsuke Saito, Ryuuki Sakamoto, Shigeo Morishima. PatchMove: Patch-based Fast Image Interpolation with Greedy Bidirectional Correspondence. Pacific Graphics 2014 (Short Paper)  

Links and Downloads


Bib Text


This study was supported in part by ”R&D Program for Implementation of Anti-Crime and Anti-Terrorism Technologies for a Safe and Secure Society”, Funds for integrated promotion of social system reform and research and development of the Ministry of Education, Culture, Sports, Science and Technology, the Japanese Government.