Fast Approximate Energy Minimization with Label Costs

被引：56

作者：

Delong, Andrew ^{[1
]}

Osokin, Anton ^{[2
]}

Isack, Hossam N. ^{[1
]}

Boykov, Yuri ^{[1
]}

机构：

[1] Univ Western Ontario, Dept Comp Sci, London, ON N6A 3K7, Canada

[2] Moscow MV Lomonosov State Univ, Dept Comp Math & Cybernetics, Moscow 117234, Russia

来源：

2010 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR) | 2010年

基金：

加拿大自然科学与工程研究理事会;

关键词：

D O I：

10.1109/CVPR.2010.5539897

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The alpha-expansion algorithm [4] has had a significant impact in computer vision due to its generality, effectiveness, and speed. Thus far it can only minimize energies that involve unary, pairwise, and specialized higher-order terms. Our main contribution is to extend alpha-expansion so that it can simultaneously optimize "label costs" as well. An energy with label costs can penalize a solution based on the set of labels that appear in it. The simplest special case is to penalize the number of labels in the solution. Our energy is quite general, and we prove optimality bounds for our algorithm. A natural application of label costs is multi-model fitting, and we demonstrate several such applications in vision: homography detection, motion segmentation, and unsupervised image segmentation. Our C++/MATLAB implementation is publicly available.

引用

页码：2173 / 2180

页数：8

共 28 条

[1] NEW LOOK AT STATISTICAL-MODEL IDENTIFICATION [J].

AKAIKE, H .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1974, AC19 (06) :716-723

[2]

[Anonymous], 2007, CVPR

[3]

[Anonymous], 1999, ICCV

[4]

[Anonymous], 2007, CVPR

[5]

[Anonymous], 2004, SIGGRAPH

[6] Fast approximate energy minimization via graph cuts [J].

Boykov, Y ;

Veksler, O ;

Zabih, R .

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (11) :1222-1239

[7] An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision [J].

Boykov, Y ;

Kolmogorov, V .

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2004, 26 (09) :1124-1137

[8]

Burnham K.P., 2002, MODEL SELECTION MULT, DOI [10.1007/978-1-4757-2917-7, DOI 10.1007/B97636]

[9] LOCATION OF BANK ACCOUNTS TO OPTIMIZE FLOAT - ANALYTIC STUDY OF EXACT AND APPROXIMATE ALGORITHMS [J].

CORNUEJOLS, G ;

FISHER, ML ;

NEMHAUSER, GL .

MANAGEMENT SCIENCE, 1977, 23 (08) :789-810

[10]

Cornuejols G., 1983, Technical Report No. 605

← 1 2 3 →