Robust Higher Order Potentials for Enforcing Label Consistency

被引:497
作者
Kohli, Pushmeet [1 ]
Ladicky, L'ubor [2 ]
Torr, Philip H. S. [2 ]
机构
[1] Microsoft Res, Cambridge, England
[2] Oxford Brookes Univ, Oxford OX3 0BP, England
基金
英国工程与自然科学研究理事会;
关键词
Discrete energy minimization; Markov and conditional random fields; Object recognition and segmentation;
D O I
10.1007/s11263-008-0202-0
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper proposes a novel framework for labelling problems which is able to combine multiple segmentations in a principled manner. Our method is based on higher order conditional random fields and uses potentials defined on sets of pixels (image segments) generated using unsupervised segmentation algorithms. These potentials enforce label consistency in image regions and can be seen as a generalization of the commonly used pairwise contrast sensitive smoothness potentials. The higher order potential functions used in our framework take the form of the Robust P (n) model and are more general than the P (n) Potts model recently proposed by Kohli et al. We prove that the optimal swap and expansion moves for energy functions composed of these potentials can be computed by solving a st-mincut problem. This enables the use of powerful graph cut based move making algorithms for performing inference in the framework. We test our method on the problem of multi-class object segmentation by augmenting the conventional crf used for object segmentation with higher order potentials defined on image regions. Experiments on challenging data sets show that integration of higher order potentials quantitatively and qualitatively improves results leading to much better definition of object boundaries. We believe that this method can be used to yield similar improvements for many other labelling problems.
引用
收藏
页码:302 / 324
页数:23
相关论文
共 49 条
  • [1] Alahari K., 2008, IEEE C COMP VIS PATT
  • [2] [Anonymous], 2006, CVPR
  • [3] [Anonymous], 2001, P 18 INT C MACH LEAR, DOI DOI 10.5555/645530.655813
  • [4] [Anonymous], 2007, P 2007 IEEE C COMP V, DOI 10.1109/CVPR.2007.383095
  • [5] [Anonymous], 1991, Submodular Functions and Optimization
  • [6] BLAKE A, 2004, ECCV, V1, P428
  • [7] Borenstein E., 2006, PROC COMPUTER VISION, V1, P969, DOI DOI 10.1109/CVPR.2006.276
  • [8] Pseudo-Boolean optimization
    Boros, E
    Hammer, PL
    [J]. DISCRETE APPLIED MATHEMATICS, 2002, 123 (1-3) : 155 - 225
  • [9] Fast approximate energy minimization via graph cuts
    Boykov, Y
    Veksler, O
    Zabih, R
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (11) : 1222 - 1239
  • [10] Boykov YY, 2001, EIGHTH IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION, VOL I, PROCEEDINGS, P105, DOI 10.1109/ICCV.2001.937505