ACM Home Page
Please provide us with feedback. Feedback
Moving gradients: a path-based method for plausible image interpolation
Full text PdfPdf (19.72 MB)
Source
ACM Transactions on Graphics (TOG) archive
Volume 28 ,  Issue 3  (August 2009) table of contents
Proceedings of ACM SIGGRAPH 2009
SESSION: Image warping and interpolation table of contents
Article No. 42  
Year of Publication: 2009
ISSN:0730-0301
Also published in ...
Authors
Dhruv Mahajan  Columbia University
Fu-Chung Huang  UC Berkeley
Wojciech Matusik  Adobe Systems, Inc.
Ravi Ramamoorthi  UC Berkeley
Peter Belhumeur  Columbia University
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 162,   Downloads (12 Months): 330,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1531326.1531348
What is a DOI?

ABSTRACT

We describe a method for plausible interpolation of images, with a wide range of applications like temporal up-sampling for smooth playback of lower frame rate video, smooth view interpolation, and animation of still images. The method is based on the intuitive idea, that a given pixel in the interpolated frames traces out a path in the source images. Therefore, we simply move and copy pixel gradients from the input images along this path. A key innovation is to allow arbitrary (asymmetric) transition points, where the path moves from one image to the other. This flexible transition preserves the frequency content of the originals without ghosting or blurring, and maintains temporal coherence. Perhaps most importantly, our framework makes occlusion handling particularly simple. The transition points allow for matches away from the occluded regions, at any suitable point along the path. Indeed, occlusions do not need to be handled explicitly at all in our initial graph-cut optimization. Moreover, a simple comparison of computed path lengths after the optimization, allows us to robustly identify occluded regions, and compute the most plausible interpolation in those areas. Finally, we show that significant improvements are obtained by moving gradients and using Poisson reconstruction.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
Baker, S., Scharstein, D., Lewis, J. P., Roth, S., Black, M. J., and Szeliski, R. 2007. A database and evaluation methodology for optical flow. In Proc. IEEE Int. Conf. Computer Vision, 1--8.
 
4
 
5
Belhumeur, P., and Mumford, D. 1992. A bayesian treatment of the stereo correspondence problem using half-occluded regions. Proc. IEEE Conf. Computer Vision and Pattern Recognition, 506--512.
 
6
 
7
 
8
Brox, T., Bruhn, A., Papenberg, N., and Weickert, J. 2004. High accuracy optical flow estimation based on a theory for warping. In Proc. European Conf. Computer Vision, vol. 3024, 25--36.
9
 
10
 
11
 
12
 
13
14
 
15
Kolmogorov, V., and Zabih, R. 2001. Computing visual correspondence with occlusions using graph cuts. Proc. IEEE Int. Conf. Computer Vision, 508--515.
16
17
 
18
19
 
20
 
21
22
 
23
 
24
 
25
 
26
 
27
Xiao, J., Cheng, H., Sawhney, H., Rao, C., and Isnardi, M. 2006. Bilateral filtering-based optical flow estimation with occlusion detection. In Proc. European Conf. Computer Vision, vol. 1, 211--224.
 
28

Collaborative Colleagues:
Dhruv Mahajan: colleagues
Fu-Chung Huang: colleagues
Wojciech Matusik: colleagues
Ravi Ramamoorthi: colleagues
Peter Belhumeur: colleagues