“Patch-based Fast Image Interpolation in Spatial and Temporal Direction” by Saito, Sakamoto and Morishima
Conference:
Type:
Entry Number: 75
Title:
- Patch-based Fast Image Interpolation in Spatial and Temporal Direction
Presenter(s)/Author(s):
Abstract:
Recently, a plausible interpolation of images has been proposed for many applications such as smooth view interpolation, upsampling low frame rate video, and making animation from still images. However, producing an intermediate frame from two images is still a challenging task. The moving gradient method enables one to obtain intermediate frames without suffering from blurring or ghost effects, by computing the displacement of each pixel [Mahajan et al 2009]. However, their method requires many iterations of the optimization process for pixel displacements by graph-cut. Hence their method is not suitable for interactive applications. To compute correspondence between two images rapidly, we employ the PatchMatch framework [Bames et al 2009], which is a significantly faster method for reconstructing an image from plenty of patches. However, an issue is that it is not necessary to find accurate correspondence in this method, which means that while some patches find appropriate counterparts, the others do not. We employ a greedy approach so that the incorrect correspondences can follow the accurate ones. Finally, we show that significant improvements on computing times are obtained, and that difference of the results between the state-of-the-art approach and our method is negligibly small.
References:
- Mahajan, D., Huang, F., Matusik, W., Ramamoorthi, R., and Belhumeur, P. “Moving gradients: a path-based method for plausible image interpolation.” ACM Trans. Graphics, 28(3), 2009.
- Barnes, C., Shechtman, E., Finkelstein, A., and Goldman D. “PatchMatch: a randomized correspondence algorithm for structural image editing.” ACM Trans. Graphics, 28(3), 2009
