Moving Gradients: A Path-Based Method for Plausible Image Interpolation

被引:98
作者
Mahajan, Dhruv [1 ]
Huang, Fu-Chung [2 ]
Matusik, Wojciech [3 ]
Ramamoorthi, Ravi [2 ]
Belhumeur, Peter [1 ]
机构
[1] Columbia Univ, New York, NY 10027 USA
[2] Univ Calif Berkeley, Berkeley, CA USA
[3] Adobe Syst Inc, San Jose, CA USA
来源
ACM TRANSACTIONS ON GRAPHICS | 2009年 / 28卷 / 03期
基金
美国国家科学基金会;
关键词
interpolation; path framework; transition point; occlusion handling; 3D poisson reconstruction;
D O I
10.1145/1531326.1531348
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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.
引用
收藏
页数:11
相关论文
共 28 条
[1]   Interactive digital photomontage [J].
Agarwala, A ;
Dontcheva, M ;
Agrawala, M ;
Drucker, S ;
Colburn, A ;
Curless, B ;
Salesin, D ;
Cohen, M .
ACM TRANSACTIONS ON GRAPHICS, 2004, 23 (03) :294-302
[2]   Symmetrical dense optical flow estimation with occlusions detection [J].
Alvarez, Luis ;
Deriche, Rachid ;
Papadopoulo, Theo .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2007, 75 (03) :371-385
[3]  
[Anonymous], P 23 ANN C COMP GRAP
[4]  
Baker Deane-Peter., 2007, Alvin Plantinga, P1, DOI DOI 10.1109/ICCV.2007.4408903
[5]   PERFORMANCE OF OPTICAL-FLOW TECHNIQUES [J].
BARRON, JL ;
FLEET, DJ ;
BEAUCHEMIN, SS .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 1994, 12 (01) :43-77
[6]  
Belhumeur P. N., 1992, Proceedings. 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.92CH3168-2), P506, DOI 10.1109/CVPR.1992.223143
[7]   The robust estimation of multiple motions: Parametric and piecewise-smooth flow fields [J].
Black, MJ ;
Anandan, P .
COMPUTER VISION AND IMAGE UNDERSTANDING, 1996, 63 (01) :75-104
[8]   Fast approximate energy minimization via graph cuts [J].
Boykov, Y ;
Veksler, O ;
Zabih, R .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (11) :1222-1239
[9]  
Brox T., 2004, ECCV (4), P25, DOI [10.1007/978-3-540-24673-2_3, DOI 10.1007/978-3-540-24673-2_3]
[10]  
Chen S. E., 1993, Computer Graphics Proceedings, P279, DOI 10.1145/166117.166153