Permutohedral Lattice CNNs
Not on the map. Why?
Abstract (arXiv)
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 pixel position), but of more general features (such as color values). The presented algorithm makes use of the permutohedral lattice data structure. The permutohedral lattice was introduced to efficiently implement a bilateral filter, a commonly used image processing operation. Its use allows for a generalization of the convolution type found in current (spatial) convolutional network architectures.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 20 Dec 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 1.
4 papers.
- 2022What Matters for 3D Scene Flow Networkcited by 31
- 2021SKIing on Simplices: Kernel Interpolation on the Permutohedral Lattice for Scalable Gaussian Processescited by 9
- 2023Adversarial Attacks and Defenses on 3D Point Cloud Classification: A Surveycited by 5
- 2024RMS-FlowNet++: Efficient and Robust Multi-Scale Scene Flow Estimation for Large-Scale Point Cloudscited by 1
- 2024RMS-FlowNet++: Efficient and Robust Multi-Scale Scene Flow Estimation for Large-Scale Point Clouds1 Jul 2024
- 2023Adversarial Attacks and Defenses on 3D Point Cloud Classification: A Survey1 Jul 2023
- 2022What Matters for 3D Scene Flow Network19 Jul 2022
- 2021SKIing on Simplices: Kernel Interpolation on the Permutohedral Lattice for Scalable Gaussian Processes12 Jun 2021