Memory Efficient Max Flow for Multi-Label Submodular MRFs
Multi-label submodular Markov Random Fields (MRFs) have been shown to be solvable using max-flow based on an encoding of the labels proposed by Ishikawa, in which each variable Xi is represented by l nodes (where l is the number of labels) arranged in a column. However, this method in general requir...
| Publié dans: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 41(2019), 4 vom: 26. Apr., Seite 886-900 |
|---|---|
| Auteur principal: | |
| Autres auteurs: | , |
| Format: | Article en ligne |
| Langue: | English |
| Publié: |
2019
|
| Accès à la collection: | IEEE transactions on pattern analysis and machine intelligence |
| Sujets: | Journal Article |
| Accès en ligne |
Volltext |