Kernel-Based Frame Interpolation for Spatio-Temporally Adaptive Rendering

被引:2
|
作者
Briedis, Karlis Martins [1 ,2 ]
Djelouah, Abdelaziz [1 ]
Ortiz, Raphael [1 ]
Meyer, Mark [3 ]
Gross, Markus [1 ,2 ]
Schroers, Christopher [1 ]
机构
[1] DisneyRes Studios, Zurich, Switzerland
[2] Swiss Fed Inst Technol, Zurich, Switzerland
[3] Pixar Animat Studios, Emeryville, CA USA
关键词
Video Frame Interpolation; Rendered Content; Deep Learning; PHOTOGRAPHY; ENHANCEMENT; FLASH;
D O I
10.1145/3588432.3591497
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recently, there has been exciting progress in frame interpolation for rendered content. In this offline rendering setting, additional inputs, such as albedo and depth, can be extracted from a scene at a very low cost and, when integrated in a suitable fashion, can significantly improve the quality of the interpolated frames. Although existing approaches have been able to show good results, most high-quality interpolation methods use a synthesis network for direct color prediction. In complex scenarios, this can result in unpredictable behavior and lead to color artifacts. To mitigate this and to increase robustness, we propose to estimate the interpolated frame by predicting spatially varying kernels that operate on image splats. Kernel prediction ensures a linear mapping from the input images to the output and enables new opportunities, such as consistent and efficient interpolation of alpha values or many other additional channels and render passes that might exist. Additionally, we present an adaptive strategy that allows predicting full or partial keyframes that should be rendered with color samples solely based on the auxiliary features of a shot. This content-based spatio-temporal adaptivity allows rendering significantly fewer color pixels as compared to a fixed-step scheme when wanting to maintain a certain quality. Overall, these contributions lead to a more robust method and significant further reductions of the rendering costs.
引用
收藏
页数:11
相关论文
共 50 条
  • [1] A Spatio-Temporally Adaptive Clustering Protocol for Wireless Microsensor Networks
    Kota, Nagarjun Rao
    Grover, Piyush
    Mitra, Pabitra
    2009 INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS (ICT), 2009, : 178 - 183
  • [2] Superconvergence of kernel-based interpolation
    Schaback, Robert
    JOURNAL OF APPROXIMATION THEORY, 2018, 235 : 1 - 19
  • [3] Stability of kernel-based interpolation
    De Marchi, Stefano
    Schaback, Robert
    ADVANCES IN COMPUTATIONAL MATHEMATICS, 2010, 32 (02) : 155 - 161
  • [4] Stability of kernel-based interpolation
    Stefano De Marchi
    Robert Schaback
    Advances in Computational Mathematics, 2010, 32 : 155 - 161
  • [5] Fully adaptive turbulence simulations based on Lagrangian spatio-temporally varying wavelet thresholding
    Nejadmalayeri, Alireza
    Vezolainen, Alexei
    De Stefano, Giuliano
    Vasilyev, Oleg V.
    JOURNAL OF FLUID MECHANICS, 2014, 749 : 794 - 817
  • [6] Spatio-Temporally Adaptive Waiting Time for Cell Phone Sensor Networks
    Chander, Deepthi
    Jagyasi, Bhushan
    Desai, U. B.
    Merchant, S. N.
    INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2011,
  • [7] MULTILEVEL SPARSE KERNEL-BASED INTERPOLATION
    Georgoulis, Emmanuil H.
    Levesley, Jeremy
    Subhan, Fazli
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2013, 35 (02): : A815 - A831
  • [8] Spatio-temporally adaptive regularization for enhancement of motion compensated wavelet coded video
    Jung, J
    Ki, H
    Lee, S
    Shin, J
    Kang, J
    Paik, J
    ADVANCES IN MULTIMEDIA INFORMATION PROCESSING - PCM 2004, PT 3, PROCEEDINGS, 2004, 3333 : 232 - 240
  • [9] Parameter Reduction of Kernel-Based Video Frame Interpolation Methods Using Multiple Encoders
    Khalifeh, Issa
    Murn, Luka
    Izquierdo, Ebroul
    IEEE JOURNAL ON EMERGING AND SELECTED TOPICS IN CIRCUITS AND SYSTEMS, 2024, 14 (02) : 245 - 260
  • [10] Kernel-based interpolation at approximate Fekete points
    Karvonen, Toni
    Sarkka, Simo
    Tanaka, Ken'ichiro
    NUMERICAL ALGORITHMS, 2021, 87 (01) : 445 - 468