The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2010 vol.32)
pp: 1182-1196
Xiaoqing Liu , UtopiaCompression Corporation, Los Angeles
Olga Veksler , University of Western Ontario, London
Jagath Samarabandu , University of Western Ontario, London
ABSTRACT
In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically, graph-cut methods are used to incorporate smoothness constraints on a labeling, encouraging most nearby pixels to have equal or similar labels. In addition to smoothness, ordering constraints on labels are also useful. For example, in object segmentation, a pixel with a “car wheel” label may be prohibited above a pixel with a “car roof” label. We observe that the commonly used graph-cut \alpha-expansion move algorithm is more likely to get stuck in a local minimum when ordering constraints are used. For a certain model with ordering constraints, we develop new graph-cut moves which we call order-preserving. The advantage of order-preserving moves is that they act on all labels simultaneously, unlike \alpha-expansion. More importantly, for most labels \alpha, the set of \alpha-expansion moves is strictly smaller than the set of order-preserving moves. This helps to explain why in practice optimization with order-preserving moves performs significantly better than \alpha-expansion in the presence of ordering constraints. We evaluate order-preserving moves for the geometric class scene labeling (introduced by Hoiem et al.) where the goal is to assign each pixel a label such as “sky,” “ground,” etc., so ordering constraints arise naturally. In addition, we use order-preserving moves for certain simple shape priors in graph-cut segmentation, which is a novel contribution in itself.
INDEX TERMS
Energy minimization, graph cuts, max-flow, SVM, geometric class labeling, shape prior.
CITATION
Xiaoqing Liu, Olga Veksler, Jagath Samarabandu, "Order-Preserving Moves for Graph-Cut-Based Optimization", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.32, no. 7, pp. 1182-1196, July 2010, doi:10.1109/TPAMI.2009.120
REFERENCES
[1] R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, and C. Rother, "A Comparative Study of Energy Minimization Methods for Markov Random Fields," Proc. European Conf. Computer Vision, vol. II, pp. 16-29, 2006.
[2] 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.
[3] 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.
[4] J. Yedidia, W. Freeman, and Y. Weiss, "Bethe Free Energy, Kikuchi Approximations, and Belief Propagation," Proc. Workshop Statistical and Computational Theories of Vision, 2001.
[5] V. Kolmogorov and R. Zabih, "Computing Visual Correspondence with Occlusions via Graph Cuts," Proc. Int'l Conf. Computer Vision, vol. II, pp. 508-515, 2001.
[6] J. Winn and J. Shotton, "The Layout Consistent Random Field for Recognizing and Segmenting Partially Occluded Objects," Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 37-44, 2006.
[7] D. Hoiem, C. Rother, and J. Winn, "3D Layout CRF for Multi-View Object Class Recognition and Segmentation," Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 1-8, 2007.
[8] D. Hoiem, A. Efros, and M. Hebert, "Geometric Context from a Single Image," Proc. Int'l Conf. Computer Vision, pp. 654-661, 2005.
[9] D. Hoiem, A. Efros, and M. Hebert, "Recovering Surface Layout from an Image," Int'l J. Computer Vision, vol. 75, no. 1, pp. 151-172, Oct. 2007.
[10] J. Keuchel, "Multiclass Image Labeling with Semidefinite Programming," Proc. European Conf. Computer Vision, vol. II, pp. 454-467, 2006.
[11] X. Liu, O. Veksler, and J. Samarabandu, "Graph Cut with Ordering Constraints on Labels and Its Applications," Proc. Conf. Computer Vision and Pattern Recognition, 2008.
[12] L. Ford and D. Fulkerson, Flows in Networks. Princeton Univ. Press, 1962.
[13] Y. Boykov and V. Kolmogorov, "An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 9, pp. 1124-1137, Sept. 2004.
[14] V. Kolmogorov and R. Zabih, "What Energy Function Can Be Minimized via Graph Cuts?" IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 2, pp. 147-159, Feb. 2004.
[15] 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.
[16] D. Schlesinger and B. Flach, "Transforming an Arbitrary Minsum Problem into a Binary One," Technical Report TUD-FI06-01, Dresden Univ. of Tech nology, 2006.
[17] P. Kohli and P. Torr, "Dynamic Graph Cuts for Efficient Inference in Markov Random Fields," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 29, no. 12, pp. 2079-2088, Dec. 2007.
[18] J. Darbon, "Global Optimization for First Order Markov Random Fields with Submodular Priors," Proc. 12th Int'l Workshop Combinatorial Image Analysis, 2008.
[19] O. Veksler, "Graph Cut Based Optimization for MRFs with Truncated Convex Priors," Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 1-8, 2007.
[20] O. Faugeras, Three-Dimensional Computer Vision: A Geometric Viewpoint. MIT Press, 1993.
[21] Y. Horry, K. Anjyo, and K. Arai, "Tour into the Picture: Using a Spidery Mesh Interface to Make Animation from a Single Image," Proc. ACM SIGGRAPH, vol. III, pp. 225-232, 1997.
[22] P.E. Debevec, C.J. Taylor, and J. Malik, "Modeling and Rendering Architecture from Photographs: A Hybrid Geometry- and Image-Based Approach," Proc. ACM SIGGRAPH, pp. 11-20, 1996.
[23] H. Shum, M. Han, and R. Szeliski, "Interactive Construction of 3D Models from Panoramic Mosaics," Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 427-433, 1998.
[24] A. Criminisi, I.D. Reid, and A. Zisserman, "Single View Metrology," Int'l J. Computer Vision, vol. 2, pp. 123-148, 2000.
[25] E. Delage, H. Lee, and A.Y. Ng, "A Dynamic Bayesian Network Model for Autonomous 3D Reconstruction from a Single Indoor Image," Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, vol. II, pp. 2418-2428, 2006.
[26] J. Coughlan and A. Yuille, "Manhattan World: Compass Direction from a Single Image by Bayesian Inference," Proc. Int'l Conf. Computer Vision, 1999.
[27] A. Saxena, S. Chung, and A. Ng, "3-D Depth Reconstruction from a Single Still Image," Int'l J. Computer Vision, vol. 76, no. 1, pp. 53-69, Jan. 2008.
[28] S. Ramalingam, P. Kohli, K. Alahari, and P. Torr, "Exact Inference in Multi-Label CRFs with Higher Order Cliques," Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, June 2008.
[29] P. Felzenszwalb and D. Huttenlocher, "Efficient Graph-Based Image Segmentation," Int'l J. Computer Vision, vol. 59, no. 2, pp. 167-181, 2004.
[30] V. Vapnik, The Nature of Statistical Learning Theory. Springer Verlag, 1995.
[31] T.F. Wu, C.J. Lin, and R. Weng, "Probability Estimates for Multi-Class Classification by Pairwise Coupling," J. Machine Learning Research, vol. 5, pp. 975-1005, 2004.
[32] J.C. Platt, "Probabilistic Outputs for Support Vector Machines and Comparisons to Regularized Likelihood Methods," Advances in Large Margin Classifiers, MIT Press, 1999.
[33] M.A. Fischler and R.C. Bolles, "Random Sample Consensus: A Paradigm for Model Fitting with Applications to Image Analysis and Automated Cartography," Comm. ACM, vol. 24, pp. 381-395, 1981.
[34] M. Leventon, W. Grimson, and O. Faugeras, "Statistical Shape Influence in Geodesic Active Contours," Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 316-323, 2000.
[35] M. Rousson and N. Paragios, "Shape Priors for Level Set Representations," Proc. European Conf. Computer Vision, pp. 416-418, 2002.
[36] D. Cremers, S. Osher, and S. Soatto, "Kernel Density Estimation and Intrinsic Alignment for Shape Priors in Level Set Segmentation," Int'l J. Computer Vision, vol. 69, pp. 335-351, 2006.
[37] D. Freedman and T. Zhang, "Interactive Graph Cut Based Segmentation with Shape Priors," Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 755-762, 2005.
[38] M. Kumar, P. Torr, and A. Zisserman, "Obj Cut," Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, vol. I, pp. 18-25, 2005.
28 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool