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

dc.contributor.authorSaito, Shunsukeen_US
dc.contributor.authorSakamoto, Ryuukien_US
dc.contributor.authorMorishima, Shigeoen_US
dc.contributor.editorJohn Keyser and Young J. Kim and Peter Wonkaen_US
dc.date.accessioned2014-12-16T07:23:37Z
dc.date.available2014-12-16T07:23:37Z
dc.date.issued2014en_US
dc.description.abstractIn 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.en_US
dc.description.seriesinformationPacific Graphics Short Papersen_US
dc.identifier.isbn978-3-905674-73-6en_US
dc.identifier.urihttps://doi.org/10.2312/pgs.20141261en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectI.3.m [Computer Graphics]en_US
dc.subjectImage Processingen_US
dc.subjectImage Interpolationen_US
dc.titlePatchMove: Patch-based Fast Image Interpolation with Greedy Bidirectional Correspondenceen_US
Files
Original bundle
Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
107-112.pdf
Size:
3.72 MB
Format:
Adobe Portable Document Format
No Thumbnail Available
Name:
pgdemo.wmv
Size:
23.49 MB
Format:
Unknown data format
Collections