Self Annealing: Unifying Deterministic Annealing and Relaxation Labelling
EMMCVPR '97 Proceedings of the First International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Neural Computation
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
On the Foundations of Relaxation Labeling Processes
IEEE Transactions on Pattern Analysis and Machine Intelligence
Loopy belief propagation for approximate inference: an empirical study
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
IEEE Transactions on Information Theory
MAP estimation via agreement on trees: message-passing and linear programming
IEEE Transactions on Information Theory
MIR '08 Proceedings of the 1st ACM international conference on Multimedia information retrieval
A spectral method for context based disambiguation of image annotations
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Unsupervised Learning for Graph Matching
International Journal of Computer Vision
An optimization approach for extracting and encoding consistent maps in a shape collection
ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2012
Fine-grained semi-supervised labeling of large shape collections
ACM Transactions on Graphics (TOG)
Hi-index | 0.00 |
We present an efficient method for maximizing energy functions with first and second order potentials, suitable for MAP labeling estimation problems that arise in undirected graphical models. Our approach is to relax the integer constraints on the solution in two steps. First we efficiently obtain the relaxed global optimum following a procedure similar to the iterative power method for finding the largest eigenvector of a matrix. Next, we map the relaxed optimum on a simplex and show that the new energy obtained has a certain optimal bound. Starting from this energy we follow an efficient coordinate ascent procedure that is guaranteed to increase the energy at every step and converge to a solution that obeys the initial integral constraints. We also present a sufficient condition for ascent procedures that guarantees the increase in energy at every step.