The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (2009 vol.31)
pp: 1645-1656
Pushmeet Kohli , Microsoft Research, Cambridge
M. Pawan Kumar , Stanford University, Stanford
Philip H.S. Torr , Oxford Brookes University, Oxford
ABSTRACT
In this paper, we extend the class of energy functions for which the optimal \alpha-expansion and \alpha \beta-swap moves can be computed in polynomial time. Specifically, we introduce a novel family of higher order clique potentials, and show that the expansion and swap moves for any energy function composed of these potentials can be found by minimizing a submodular function. We also show that for a subset of these potentials, the optimal move can be found by solving an st-mincut problem. We refer to this subset as the {\cal P}^n Potts model. Our results enable the use of powerful \alpha-expansion and \alpha \beta-swap move making algorithms for minimization of energy functions involving higher order cliques. Such functions have the capability of modeling the rich statistics of natural scenes and can be used for many applications in Computer Vision. We demonstrate their use in one such application, i.e., the texture-based image or video-segmentation problem.
INDEX TERMS
Energy minimization, higher order MRFs, graph cuts, move making algorithms.
CITATION
Pushmeet Kohli, M. Pawan Kumar, Philip H.S. Torr, "P³ & Beyond: Move Making Algorithms for Solving Higher Order Functions", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.31, no. 9, pp. 1645-1656, September 2009, doi:10.1109/TPAMI.2008.217
REFERENCES
[1] A. Blake, C. Rother, M. Brown, P. Perez, and P. Torr, “Interactive Image Segmentation Using an Adaptive GMMRF Model,” Proc. European Conf. Computer Vision, pp.428-441, 2004.
[2] E. Boros and P. Hammer, “Pseudo Boolean Optimization,” Discrete Applied Math., vol. 123, nos.1-3, pp.155-225, 2002.
[3] E. Boros, P.L. Hammer, and G. Tavares, “Local Search Heuristics for Quadratic Unconstrained Binary Optimization (QUBO),” J.Heuristics, vol. 13, no. 2, pp.99-132, 2007.
[4] Y. Boykov and M. Jolly, “Interactive Graph Cuts for Optimal Boundary Region Segmentation of Objects in N-D Images,” Proc. Int'l Conf. Computer Vision, pp.105-112, 2001.
[5] Y. Boykov, O. Veksler, and R. Zabih, “Fast Approximate Energy Minimization via Graph Cuts,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 11, pp.1222-1239, Nov. 2001.
[6] D. Freedman and P. Drineas, “Energy Minimization via Graph Cuts: Settling What Is Possible,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, 2005.
[7] H. Ishikawa, “Exact Optimization for Markov Random Fields with Convex Priors,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 10, pp.1333-1336, Oct. 2003.
[8] S. Iwata, S.T. McCormick, and M. Shigeno, “A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem,” Lecture Notes in Computer Science, vol. 1610, 1999.
[9] P. Kohli, M. Kumar, and P. Torr, “P3 & Beyond: Solving Energies with Higher Order Cliques,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, 2007.
[10] P. Kohli, L. Ladicky, and P. Torr, “Robust Higher Order Potentials for Enforcing Label Consistency,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, 2008.
[11] V. Kolmogorov, “Convergent Tree-Reweighted Message Passing for Energy Minimization,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 28, no. 10, pp.1568-1583, Oct. 2006.
[12] V. Kolmogorov and R. Zabih, “What Energy Functions Can Be Minimized via Graph Cuts?” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 2, pp.147-159, Feb. 2004.
[13] N. Komodakis and G. Tziritas, “A New Framework for Approximate Labeling via Graph Cuts,” Proc. Int'l Conf. Computer Vision, 2005.
[14] M.P. Kumar, P.H.S. Torr, and A. Zisserman, “Extending Pictorial Structures for Object Recognition,” Proc. British Machine Vision Conf., pp.789-798, 2004.
[15] J. Lafferty, A. McCallum, and F. Pereira, “Conditional Random Fields: Probabilistic Models for Segmenting and Labelling Sequence Data,” Proc. Int'l Conf. Machine Learning, 2001.
[16] X. Lan, S. Roth, D.P. Huttenlocher, and M.J. Black, “Efficient Belief Propagation with Learned Higher-Order Markov Random Fields,” Proc. European Conf. Computer Vision, pp.269-282, 2006.
[17] T. Leung and J. Malik, “Recognizing Surfaces Using Three-Dimensional Textons,” Proc. Int'l Conf. Computer Vision, pp.1010-1017, 1999.
[18] T. Meltzer, C. Yanover, and Y. Weiss, “Globally Optimal Solutions for Energy Minimization in Stereo Vision Using Reweighted Belief Propagation,” Proc. Int'l Conf. Computer Vision, pp.428-435, 2005.
[19] A. Neubeck, A. Zalesny, and L. van Gool, “3D Texture Reconstruction from Extensive BTF Data,” Texture, pp.13-18, 2005.
[20] R. Paget and I.D. Longstaff, “Texture Synthesis via a Noncausal Nonparametric Multiscale Markov Random Field,” IEEE Trans. Image Processing, vol. 7, no. 6, pp.925-931, 1998.
[21] S. Ramalingam, P. Kohli, A. Karteek, and P. Torr, “Exact Inference in Multi-Label Crfs with Higher Order Cliques,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, 2008.
[22] S. Roth and M.J. Black, “Fields of Experts: A Framework for Learning Image Priors,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp.860-867, 2005.
[23] C. Rother, V. Kolmogorov, and A. Blake, “Grabcut: Interactive Foreground Extraction Using Iterated Graph Cuts,” Proc. ACM SIGGRAPH, pp.309-314, 2004.
[24] C. Rother, V. Kolmogorov, V. Lempitsky, and M. Szummer, “Optimizing Binary Mrfs via Extended Roof Duality,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, 2007.
[25] D. Schlesinger and B. Flach, “Transforming an Arbitrary Minsum Problem into a Binary One,” Technical Report TUD-F106-01, Dresden Univ. of Tech nology, 2006.
[26] F. Schroff, A. Criminisi, and A. Zisserman, “Single-Histogram Class Models for Image Segmentation,” Proc. Indian Conf. Computer Vision, Graphics and Image Processing, 2006.
[27] R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M.F. Tappen, and C. Rother, “A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 30, no. 6, pp.1068-1080, June 2008.
[28] M. Varma and A. Zisserman, “Texture Classification: Are Filter Banks Necessary?” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp.691-698, 2003.
[29] M.J. Wainwright, T. Jaakkola, and A.S. Willsky, “Tree-Based Reparameterization for Approximate Inference on Loopy Graphs,” Proc. Neural Information Processing Systems Conf., pp.1001-1008, 2001.
[30] O. Woodford, A. Fitzgibbon, P. Torr, and I. Reid, “Global Stereo Reconstruction Under Second Order Smoothness Priors,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, 2008.
[31] J.S. Yedidia, W.T. Freeman, and Y. Weiss, “Generalized Belief Propagation,” Proc. Neural Information Processing Systems Conf., pp.689-695, 2000.
25 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool