Name
Abstract | ||
|---|---|---|
Many computer vision problems can be cast into optimization problems over discrete graphical models also known as Markov or conditional random fields. Standard methods are able to solve those problems quite efficiently. However, problems with huge label spaces and or higher-order structure remain challenging or intractable even for approximate methods.We reconsider the work of Lempitsky et al. 2010 on fusion moves and apply it to general discrete graphical models. We propose two alternatives for calculating fusion moves that outperform the standard in several applications. Our generic software framework allows us to easily use different proposal generators which spans a large class of inference algorithms and thus makes exhaustive evaluation feasible.Because these fusion algorithms can be applied to models with huge label spaces and higher-order terms, they might stimulate and support research of such models which may have not been possible so far due to the lack of adequate inference methods. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-16181-5_37 | COMPUTER VISION - ECCV 2014 WORKSHOPS, PT II |
Keywords | Field | DocType |
Integer Linear Programming,Fusion Algorithm,Optimal Move,Unary Term,Proposal Generator | Conditional random field,Computer science,Markov chain,Fusion,Theoretical computer science,Integer programming,Artificial intelligence,Graphical model,Map inference,Optimization problem,Machine learning | Conference |
Volume | ISSN | Citations |
8926 | 0302-9743 | 2 |
PageRank | References | Authors |
0.37 | 20 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jörg Hendrik Kappes | 1 | 98 | 5.58 |
| Thorsten Beier | 2 | 69 | 5.79 |
| Christoph Schnörr | 3 | 3025 | 219.34 |