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

Saito, Shunsuke; Sakamoto, Ryuuki; Morishima, Shigeo

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

Files

107-112.pdf (3.72 MB)

pgdemo.wmv (23.49 MB)

Date

2014

Authors

Saito, Shunsuke
Sakamoto, Ryuuki
Morishima, Shigeo

Publisher

The Eurographics Association

Abstract

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.

        @inproceedings{:10.2312/pgs.20141261
,
booktitle = {Pacific Graphics Short Papers
},
editor = {John Keyser and Young J. Kim and Peter Wonka
},
title = {{PatchMove: Patch-based Fast Image Interpolation with Greedy Bidirectional Correspondence
}},
author = {Saito, Shunsuke and 
Sakamoto, Ryuuki and 
Morishima, Shigeo
},
year = {2014
},
publisher = {The Eurographics Association
},
ISBN = {978-3-905674-73-6
},
DOI = {/10.2312/pgs.20141261
}
}