Mean field approximation, using approximate filtering [2]
Mean field approximation, performing all summations explicitly (slow)
TRW-S [3]
Graph cuts [4] (only works for 2 label problems)
References
Efficient Inference in Fully Connected CRFs with Gaussian Edge Potentials.
Conference on Neural Information Processing Systems (NIPS), 2011. Philipp Krähenbühl and Vladlen Koltun.
Parameter Learning and Convergent Inference for Dense Random Fields.
International Conference on Machine Learning (ICML), 2013. Philipp Krähenbühl and Vladlen Koltun.
Convergent Tree-reweighted Message Passing for Energy Minimization.
IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), 2006. Vladimir Kolmogorov.
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Computer Vision.
IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), 2004 Yuri Boykov and Vladimir Kolmogorov.
请发表评论