Unsupervised Learning for Graph Matching
International Journal of Computer Vision
Hi-index | 0.00 |
We present a new efficient algorithm for maximizing energy functions with higher order potentials suitable for MAP inference in discrete MRFs. Initially we relax integer constraints on the problem and obtain potential label assignments using higher-order (tensor) power method. Then we utilise an ascent procedure similar to the classic ICM algorithm to converge to a solution meeting the original integer constraints.