Tree-based iterated local search for Markov random fields with applications in image analysis
The maximum a posteriori assignment for general structure Markov random fields is computationally intractable. In this paper, we exploit tree-based methods to efficiently address this problem. Our novel method, named Tree-based Iterated Local Search (T-ILS), takes advantage of the tractability of tr...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
Kluwer Academic Publishers
2014
|
| Online Access: | http://hdl.handle.net/20.500.11937/39305 |