paper-with-me

Papers

Learning Task-Specific Generalized Convolutions in the Permutohedral Lattice

2019-09-09 · Anne S. Wannenwetsch, Martin Kiefel, Peter V. Gehler, Stefan Roth

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.

📄 PDF Abstract BibTeX arXiv:1909.03677

Code (1)

visinf/semantic_lattice 공식 구현 mxnet

Tasks

DecoderOptical Flow EstimationSemantic Segmentation

Methods 이 논문이 사용한 방법론

Sparse Convolutions 설명 없음
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…

Similar Papers 제목 키워드 기반

LatticeNet: Fast Point Cloud Segmentation Using Permutohedral Lattices

2019-12-12 · Radu Alexandru Rosu, Peer Schütt, Jan Quenzel, Sven Behnke

Deep convolutional neural networks (CNNs) have shown outstanding performance in the task of semantically segmenting images. However, applying the same methods on 3D data still poses challenges due to the heavy memory req…

3D Semantic SegmentationPoint Cloud SegmentationSegmentationSemantic Segmentation

LatticeNet: Fast Spatio-Temporal Point Cloud Segmentation Using Permutohedral Lattices

2021-08-09 · Radu Alexandru Rosu, Peer Schütt, Jan Quenzel, Sven Behnke

Deep convolutional neural networks (CNNs) have shown outstanding performance in the task of semantically segmenting images. Applying the same methods on 3D data still poses challenges due to the heavy memory requirements…

3D Semantic SegmentationPoint Cloud SegmentationSegmentationSemantic Segmentation

Permutohedral Lattice CNNs

2014-12-20 · Martin Kiefel, Varun Jampani, Peter V. Gehler

This paper presents a convolutional layer that is able to process sparse input features. As an example, for image recognition problems this allows an efficient filtering of signals that do not lie on a dense grid (like p…

Position

Fast High-Dimensional Filtering Using the Permutohedral Lattice

2010-05-03 · Eurographics 2010 5 · Andrew Adams, Jongmin Baek, Myers Abraham Davis

Many useful algorithms for processing images and geometry fall under the general framework of high-dimensional Gaussian filtering. This family of algorithms includes bilateral filtering and non-local means. We propose a …

Vocal Bursts Intensity Prediction

SKIing on Simplices: Kernel Interpolation on the Permutohedral Lattice for Scalable Gaussian Processes

2021-06-12 · Sanyam Kapoor, Marc Finzi, Ke Alexander Wang, Andrew Gordon Wilson

State-of-the-art methods for scalable Gaussian processes use iterative algorithms, requiring fast matrix vector multiplies (MVMs) with the covariance kernel. The Structured Kernel Interpolation (SKI) framework accelerate…

Gaussian ProcessesGPU