Gould, Stephen; Amat, Fernando; Koller, Daphne
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, much attention in recent years has been placed on finding good approximate solutions. In particular, graph-cut based algorithms, such as α-expansion, are tremendously successful at solving problems with regular potentials. However, for arbitrary energy functions, message passing algorithms, such as max-product belief...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.