Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

A projected gradient descent method for crf inference allowing end-to-end training of arbitrary pairwise potentials

Larsson, Måns ; Arnab, Anurag ; Kahl, Fredrik LU ; Zheng, Shuai and Torr, Philip (2018) 11th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition, EMMVCPR 2017 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10746 LNCS. p.564-579
Abstract

Are we using the right potential functions in the Conditional Random Field models that are popular in the Vision community? Semantic segmentation and other pixel-level labelling tasks have made significant progress recently due to the deep learning paradigm. However, most state-of-the-art structured prediction methods also include a random field model with a hand-crafted Gaussian potential to model spatial priors, label consistencies and feature-based image conditioning. In this paper, we challenge this view by developing a new inference and learning framework which can learn pairwise CRF potentials restricted only by their dependence on the image pixel values and the size of the support. Both standard spatial and high-dimensional... (More)

Are we using the right potential functions in the Conditional Random Field models that are popular in the Vision community? Semantic segmentation and other pixel-level labelling tasks have made significant progress recently due to the deep learning paradigm. However, most state-of-the-art structured prediction methods also include a random field model with a hand-crafted Gaussian potential to model spatial priors, label consistencies and feature-based image conditioning. In this paper, we challenge this view by developing a new inference and learning framework which can learn pairwise CRF potentials restricted only by their dependence on the image pixel values and the size of the support. Both standard spatial and high-dimensional bilateral kernels are considered. Our framework is based on the observation that CRF inference can be achieved via projected gradient descent and consequently, can easily be integrated in deep neural networks to allow for end-to-end training. It is empirically demonstrated that such learned potentials can improve segmentation accuracy and that certain label class interactions are indeed better modelled by a non-Gaussian potential. In addition, we compare our inference method to the commonly used mean-field algorithm. Our framework is evaluated on several public benchmarks for semantic segmentation with improved performance compared to previous state-of-the-art CNN+CRF models.

(Less)
Please use this url to cite or link to this publication:
author
; ; ; and
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
Conditional random fields, Convolutional neural networks, Segmentation
host publication
Energy Minimization Methods in Computer Vision and Pattern Recognition - 11th International Conference, EMMCVPR 2017, Revised Selected Papers
series title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
volume
10746 LNCS
pages
16 pages
publisher
Springer
conference name
11th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition, EMMVCPR 2017
conference location
Venice, Italy
conference dates
2017-10-30 - 2017-11-01
external identifiers
  • scopus:85044740218
ISSN
0302-9743
1611-3349
ISBN
9783319781983
DOI
10.1007/978-3-319-78199-0_37
language
English
LU publication?
yes
id
bf660148-877e-4d0e-9fa5-0bcbdd9b2e3d
date added to LUP
2018-04-12 13:55:16
date last changed
2024-05-13 08:18:43
@inproceedings{bf660148-877e-4d0e-9fa5-0bcbdd9b2e3d,
  abstract     = {{<p>Are we using the right potential functions in the Conditional Random Field models that are popular in the Vision community? Semantic segmentation and other pixel-level labelling tasks have made significant progress recently due to the deep learning paradigm. However, most state-of-the-art structured prediction methods also include a random field model with a hand-crafted Gaussian potential to model spatial priors, label consistencies and feature-based image conditioning. In this paper, we challenge this view by developing a new inference and learning framework which can learn pairwise CRF potentials restricted only by their dependence on the image pixel values and the size of the support. Both standard spatial and high-dimensional bilateral kernels are considered. Our framework is based on the observation that CRF inference can be achieved via projected gradient descent and consequently, can easily be integrated in deep neural networks to allow for end-to-end training. It is empirically demonstrated that such learned potentials can improve segmentation accuracy and that certain label class interactions are indeed better modelled by a non-Gaussian potential. In addition, we compare our inference method to the commonly used mean-field algorithm. Our framework is evaluated on several public benchmarks for semantic segmentation with improved performance compared to previous state-of-the-art CNN+CRF models.</p>}},
  author       = {{Larsson, Måns and Arnab, Anurag and Kahl, Fredrik and Zheng, Shuai and Torr, Philip}},
  booktitle    = {{Energy Minimization Methods in Computer Vision and Pattern Recognition - 11th International Conference, EMMCVPR 2017, Revised Selected Papers}},
  isbn         = {{9783319781983}},
  issn         = {{0302-9743}},
  keywords     = {{Conditional random fields; Convolutional neural networks; Segmentation}},
  language     = {{eng}},
  month        = {{01}},
  pages        = {{564--579}},
  publisher    = {{Springer}},
  series       = {{Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}},
  title        = {{A projected gradient descent method for crf inference allowing end-to-end training of arbitrary pairwise potentials}},
  url          = {{http://dx.doi.org/10.1007/978-3-319-78199-0_37}},
  doi          = {{10.1007/978-3-319-78199-0_37}},
  volume       = {{10746 LNCS}},
  year         = {{2018}},
}