Advertisement

International Journal of Computer Vision

, Volume 121, Issue 3, pp 365–390 | Cite as

GRMA: Generalized Range Move Algorithms for the Efficient Optimization of MRFs

  • Kangwei Liu
  • Junge Zhang
  • Peipei Yang
  • Stephen Maybank
  • Kaiqi HuangEmail author
Article
  • 457 Downloads

Abstract

Markov random fields (MRF) have become an important tool for many vision applications, and the optimization of MRFs is a problem of fundamental importance. Recently, Veksler and Kumar et al. proposed the range move algorithms, which are some of the most successful optimizers. Instead of considering only two labels as in previous move-making algorithms, they explore a large search space over a range of labels in each iteration, and significantly outperform previous move-making algorithms. However, two problems have greatly limited the applicability of range move algorithms: (1) They are limited in the energy functions they can handle (i.e., only truncated convex functions); (2) They tend to be very slow compared to other move-making algorithms (e.g., \(\alpha \)-expansion and \(\alpha \beta \)-swap). In this paper, we propose two generalized range move algorithms (GRMA) for the efficient optimization of MRFs. To address the first problem, we extend the GRMAs to more general energy functions by restricting the chosen labels in each move so that the energy function is submodular on the chosen subset. Furthermore, we provide a feasible sufficient condition for choosing these subsets of labels. To address the second problem, we dynamically obtain the iterative moves by solving set cover problems. This greatly reduces the number of moves during the optimization. We also propose a fast graph construction method for the GRMAs. Experiments show that the GRMAs offer a great speedup over previous range move algorithms, while yielding competitive solutions.

Keywords

Markov random field Discrete optimization Energy minimization Range move algorithms 

Notes

Acknowledgments

This work is funded by the National Basic Research Program of China (Grant No. 2012CB316302), National Natural Science Foundation of China (Grant No. 61322209, Grant No. 61175007 and Grant No. 61403387). The work is supported by the International Partnership Program of Chinese Academy of Sciences, Grant No. 173211KYSB2016008. We thank Olga Veksler for her great help to this work, and we thank Pushmeet Kohli for his valuable comments.

Supplementary material

References

  1. Batra, D., & Kohli, P. (2011). Making the right moves: Guiding alpha-expansion using local primal-dual gaps. In IEEE Conference on Computer Vision and Pattern Recognition (pp. 1865–1872).Google Scholar
  2. Besag, J. (1986). On the statistical analysis of dirty pictures. Journal of the Royal Statistical Society, 48(3), 259–302.MathSciNetzbMATHGoogle Scholar
  3. Boykov, Y., & Jolly. (2001) Interactive graph cuts for optimal boundary and region segmentation of objects in nd images. In IEEE International Conference on Computer Vision (pp. 105–112).Google Scholar
  4. Boykov, Y., & Jolly, M. P. (2000). Interactive organ segmentation using graph cuts. In Medical Image Computing and Computer-Assisted Intervention (pp. 276–286).Google Scholar
  5. Boykov, Y., & Kolmogorov, V. (2003). Computing geodesics and minimal surfaces via graph cuts. In IEEE International Conference on Computer Vision (pp. 26–33).Google Scholar
  6. Boykov, Y., Veksler, O., & Zabih, R. (2001). Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(11), 1222–1239.CrossRefGoogle Scholar
  7. Chekuri, C., Khanna, S., Naor, J., & Zosin, L. (2004). A linear programming formulation and approximation algorithms for the metric labeling problem. SIAM Journal on Discrete Mathematics, 18(3), 608–625.MathSciNetCrossRefzbMATHGoogle Scholar
  8. Feige, U. (1998). A threshold of ln n for approximating set cover. Journal of the ACM, 45(4), 634–652.MathSciNetCrossRefzbMATHGoogle Scholar
  9. Gould, S,, Amat, F., & Koller, D. (2009). Alphabet soup: A framework for approximate energy minimization. In IEEE Conference on Computer Vision and Pattern Recognition (pp. 903–910).Google Scholar
  10. Greig, D., Porteous, B., & Seheult, A. H. (1989). Exact maximum a posteriori estimation for binary images. Journal of the Royal Statistical Society, 51, 271–279.Google Scholar
  11. Gridchyn, I., & Kolmogorov, V. (2013). Potts model, parametric maxflow and k-submodular functions. In IEEE International Conference on Computer Vision (pp. 2320–2327).Google Scholar
  12. Ishikawa, H. (2003). Exact optimization for markov random fields with convex priors. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(10), 1333–1336.CrossRefGoogle Scholar
  13. Kappes, J. H., Andres, B., Hamprecht, F. A., Schnörr, C., Nowozin, S., Batra, D., Kim, S., Kausler, B. X., Lellmann, J., Komodakis, N., & Rother, C. (2013). A comparative study of modern inference techniques for discrete energy minimization problem. In IEEE Conference on Computer Vision and Pattern Recognition (pp. 1328–1335).Google Scholar
  14. Kohli, P., Osokin, A., & Jegelka, S. (2013). A principled deep random field model for image segmentation. In IEEE Conference on Computer Vision and Pattern Recognition (pp. 1971–1978)Google Scholar
  15. Kolmogorov, V. (2006). Convergent tree-reweighted message passing for energy minimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(10), 1568–1583.CrossRefGoogle Scholar
  16. Kolmogorov, V., & Rother, C. (2007). Minimizing nonsubmodular functions with graph cuts-a review. IEEE Transactions on Pattern Analysis and Machine Intelligence, 29(7), 1274–1279.CrossRefGoogle Scholar
  17. Kolmogorov, V., & Zabin, R. (2004). What energy functions can be minimized via graph cuts? IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(2), 147–159.CrossRefGoogle Scholar
  18. Kumar, M. P. (2014). Rounding-based moves for metric labeling. In Advances in Neural Information Processing Systems (pp. 109–117).Google Scholar
  19. Kumar, M. P., Koller, D. (2009). Map estimation of semi-metric mrfs via hierarchical graph cuts. In Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (pp. 313–320).Google Scholar
  20. Kumar, M. P., & Torr, P. H. (2009). Improved moves for truncated convex models. In Advances in Neural Information Processing Systems (pp. 889–896).Google Scholar
  21. Kumar, M. P., Veksler, O., & Torr, P. H. (2011). Improved moves for truncated convex models. The Journal of Machine Learning Research, 12, 31–67.Google Scholar
  22. Lempitsky, V., Rother, C., & Blake, A. (2007). Logcut-efficient graph cut optimization for markov random fields. In IEEE International Conference on Computer Vision (pp. 1–8).Google Scholar
  23. Lempitsky, V., Rother, C., Roth, S., & Blake, A. (2010). Fusion moves for markov random field optimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 32(8), 1392–1405.CrossRefGoogle Scholar
  24. Liu, K., Zhang, J., Huang, K., & Tan, T. (2014). Deformable object matching via deformation decomposition based 2d label mrf. In IEEE Conference on Computer Vision and Pattern Recognition (pp. 2321–2328).Google Scholar
  25. Liu, K., Zhang, J., Yang, P., & Huang, K. (2015). GRSA: Generalized range swap algorithm for the efficient optimization of mrfs. In IEEE Conference on Computer Vision and Pattern Recognition (pp. 1761–1769).Google Scholar
  26. Martin, D., Fowlkes, C., Tal, D., & Malik, J. (2001). A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. IEEE International Conference on Computer Vision, 2, 416–423.Google Scholar
  27. Nagarajan, R. (2003). Intensity-based segmentation of microarray images. IEEE Transactions on Medical Imaging, 22(7), 882–889.CrossRefGoogle Scholar
  28. Poggio, T., Torre, V., & Koch, C. (1989). Computational vision and regularization theory. Image understanding, 3(1–18), 111.Google Scholar
  29. Rother, C., Kolmogorov, V., Lempitsky, V., & Szummer, M. (2007). Optimizing binary mrfs via extended roof duality. In textitIEEE Conference on Computer Vision and Pattern Recognition (pp. 1–8).Google Scholar
  30. Scharstein, D., & Szeliski, R. (2002). A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. International Journal of Computer Vision, 47, 7–42.CrossRefzbMATHGoogle Scholar
  31. Schlesinger, D., & Flach, B. (2006). Transforming an arbitrary minsumproblem into a binary one. TU, Fak. Informatik.Google Scholar
  32. Slavłk, P. (1996). A tight analysis of the greedy algorithm for set cover. In Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing (pp. 435–441).Google Scholar
  33. Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., et al. (2008). A comparative study of energy minimization methods for mrfs with smoothness-based priors. IEEE Transactions on Pattern Analysis and Machine Intelligence, 30(6), 1068–1080.CrossRefGoogle Scholar
  34. Tappen, M. F., & Freeman, W. T. (2003). Comparison of graph cuts with belief propagation for stereo using identical mrf parameters. In IEEE International Conference on Computer Vision (pp. 900–906).Google Scholar
  35. Veksler, O. (2007). Graph cut based optimization for mrfs with truncated convex priors. In IEEE Conference on Computer Vision and Pattern Recognition (pp. 1–8).Google Scholar
  36. Veksler, O. (2012). Multi-label moves for mrfs with truncated convex priors. International Journal of Computer Vision, 98(1), 1–14.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  • Kangwei Liu
    • 1
  • Junge Zhang
    • 1
  • Peipei Yang
    • 1
  • Stephen Maybank
    • 2
  • Kaiqi Huang
    • 1
    Email author
  1. 1.CASIABeijingChina
  2. 2.Department of Computer Science and Information Systems, Birkbeck CollegeUniversity of LondonLondonUK

Personalised recommendations