Weakly-Supervised Contrastive Learning in Path Manifold for Monte Carlo Image Reconstruction

被引:9
作者
Cho, In-Young [1 ]
Huo, Yuchi [1 ]
Yoon, Sung-Eui [1 ]
机构
[1] Korea Adv Inst Sci & Technol, Daejeon, South Korea
来源
ACM TRANSACTIONS ON GRAPHICS | 2021年 / 40卷 / 04期
关键词
Monte Carlo image reconstruction; contrastive learning; weakly-supervised learning; REPRESENTATION;
D O I
10.1145/3450626.3459876
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Image-space auxiliary features such as surface normal have significantly contributed to the recent success of Monte Carlo (MC) reconstruction networks. However, path-space features, another essential piece of light propagation, have not yet been sufficiently explored. Due to the curse of dimensionality, information flow between a regression loss and high-dimensional path-space features is sparse, leading to difficult training and inefficient usage of path-space features in a typical reconstruction framework. This paper introduces a contrastive manifold learning framework to utilize path-space features effectively. The proposed framework employs weakly-supervised learning that converts reference pixel colors to dense pseudo labels for light paths. A convolutional path-embedding network then induces a low-dimensional manifold of paths by iteratively clustering intra-class embeddings, while discriminating inter-class embeddings using gradient descent. The proposed framework facilitates path-space exploration of reconstruction networks by extracting low-dimensional yet meaningful embeddings within the features. We apply our framework to the recent image- and sample-space models and demonstrate considerable improvements, especially on the sample space.
引用
收藏
页数:14
相关论文
共 62 条
  • [1] Abadi Martin, 2016, arXiv
  • [2] Feature Generation for Adaptive Gradient-Domain Path Tracing
    Back, Jonghee
    Yoon, Sung-Eui
    Moon, Bochang
    [J]. COMPUTER GRAPHICS FORUM, 2018, 37 (07) : 65 - 74
  • [3] Offline Deep Importance Sampling for Monte Carlo Path Tracing
    Bako, Steve
    Meyer, Mark
    DeRose, Tony
    Sen, Pradeep
    [J]. COMPUTER GRAPHICS FORUM, 2019, 38 (07) : 527 - 542
  • [4] Bako S, 2017, ACM T GRAPHIC, V36, DOI [10.1145/3072959.3073703, 10.1145/3072959.3073708]
  • [5] Learning A Stroke-Based Representation for Fonts
    Balashova, Elena
    Bermano, Amit H.
    Kim, Vladimir G.
    DiVerdi, Stephen
    Hertzmann, Aaron
    Funkhouser, Thomas
    [J]. COMPUTER GRAPHICS FORUM, 2019, 38 (01) : 429 - 442
  • [6] Benedikt Bitterli, 2016, RENDERING RESOURCES
  • [7] Random forests
    Breiman, L
    [J]. MACHINE LEARNING, 2001, 45 (01) : 5 - 32
  • [8] A review of image denoising algorithms, with a new one
    Buades, A
    Coll, B
    Morel, JM
    [J]. MULTISCALE MODELING & SIMULATION, 2005, 4 (02) : 490 - 530
  • [9] Interactive Reconstruction of Monte Carlo Image Sequences using a Recurrent Denoising Autoencoder
    Chaitanya, Chakravarty R. Alla
    Kaplanyan, Anton S.
    Schied, Christoph
    Salvi, Marco
    Lefohn, Aaron
    Nowrouzezahrai, Derek
    Aila, Timo
    [J]. ACM TRANSACTIONS ON GRAPHICS, 2017, 36 (04):
  • [10] Using Ranking-CNN for Age Estimation
    Chen, Shixing
    Zhang, Caojin
    Dong, Ming
    Le, Jialiang
    Rao, Mike
    [J]. 30TH IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2017), 2017, : 742 - 751