Learning Task-Specific Generalized Convolutions in the Permutohedral Lattice

被引:1
作者
Wannenwetsch, Anne S. [1 ]
Kiefel, Martin [2 ]
Gehler, Peter V. [2 ]
Roth, Stefan [1 ]
机构
[1] Tech Univ Darmstadt, Darmstadt, Germany
[2] Amazon, Tubingen, Germany
来源
PATTERN RECOGNITION, DAGM GCPR 2019 | 2019年 / 11824卷
关键词
D O I
10.1007/978-3-030-33676-9_24
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Dense prediction tasks typically employ encoder-decoder architectures, but the prevalent convolutions in the decoder are not image-adaptive and can lead to boundary artifacts. Different generalized convolution operations have been introduced to counteract this. We go beyond these by leveraging guidance data to redefine their inherent notion of proximity. Our proposed network layer builds on the permutohedral lattice, which performs sparse convolutions in a high-dimensional space allowing for powerful non-local operations despite small filters. Multiple features with different characteristics span this permutohedral space. In contrast to prior work, we learn these features in a task-specific manner by generalizing the basic permutohedral operations to learnt feature representations. As the resulting objective is complex, a carefully designed framework and learning procedure are introduced, yielding rich feature embeddings in practice. We demonstrate the general applicability of our approach in different joint upsampling tasks. When adding our network layer to state-of-the-art networks for optical flow and semantic segmentation, boundary artifacts are removed and the accuracy is improved.
引用
收藏
页码:345 / 359
页数:15
相关论文
共 48 条
  • [1] Fast High-Dimensional Filtering Using the Permutohedral Lattice
    Adams, Andrew
    Baek, Jongmin
    Davis, Myers Abraham
    [J]. COMPUTER GRAPHICS FORUM, 2010, 29 (02) : 753 - 762
  • [2] [Anonymous], 2015, CVPR
  • [3] [Anonymous], 2017, CVPR
  • [4] [Anonymous], 2018, CVPR
  • [5] [Anonymous], 2012, NIPS
  • [6] [Anonymous], 1998, BILATERAL FILTERING
  • [7] [Anonymous], 2005, CVPR
  • [8] [Anonymous], 2012, CVPR
  • [9] [Anonymous], 2015, ICLR
  • [10] [Anonymous], 2016, CVPR