Deep, Dense, and Low-Rank Gaussian Conditional Random Fields
arXiv:1611.09051
Abstract
In this work we introduce a fully-connected graph structure in the Deep Gaussian Conditional Random Field (G-CRF) model. For this we express the pairwise interactions between pixels as the inner-products of low-dimensional embeddings, delivered by a new subnetwork of a deep architecture. We efficiently minimize the resulting energy by solving the resulting low-rank linear system with conjugate gradients, and derive an analytic expression for the gradient of our embeddings which allows us to train them end-to-end with backpropagation. We demonstrate the merit of our approach by achieving state of the art results on three challenging Computer Vision benchmarks, namely semantic segmentation, human parts segmentation, and saliency estimation. Our implementation is fully GPU based, built on top of the Caffe library, and will be made publicly available.
References in corpus (14)
- Deep Residual Learning for Image Recognition
- Caffe: Convolutional Architecture for Fast Feature Embedding
- Efficient Inference in Fully Connected CRFs with Gaussian Edge Potentials
- Fully Convolutional Networks for Semantic Segmentation
- DeepLab: Semantic Image Segmentation with Deep Convolutional Nets, Atrous Convolution, and Fully Connected CRFs
- Visual Saliency Based on Multiscale Deep Features
- Semantic Image Segmentation via Deep Parsing Network
- Deep Contrast Learning for Salient Object Detection
- PISA: Pixelwise Image Saliency by Aggregating Complementary Appearance Contrast Measures with Edge-Preserving Coherence
- Detect What You Can: Detecting and Representing Objects using Holistic Models and Body Parts
- Pushing the Boundaries of Boundary Detection using Deep Learning
- Training Deep Networks with Structured Layers by Matrix Backpropagation
- Semantic Object Parsing with Local-Global Long Short-Term Memory
- Context-aware CNNs for person head detection