Efficient planar graph cuts with applications in Computer Vision

We present a fast graph cut algorithm for planar graphs. It is based on the graph theoretical work and leads to an efficient method that we apply on shape matching and image segmentation. In contrast to currently used methods in computer vision, the presented approach provides an upper bound for its runtime behavior that is almost linear. In particular, we are able to match two different planar shapes of N points in O(N2 log N) and segment a given image of N pixels in O(N log N). We present two experimental benchmark studies which demonstrate that the presented method is also in practice faster than previously proposed graph cut methods: On planar shape matching and image segmentation we observe a speed-up of an order of magnitude, depending on resolution.

[1]  E. A. Dinic.  Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .

[2]  Daniel Cremers,et al.  Fast Matching of Planar Shapes in Sub-cubic Runtime , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[3]  William A. Barrett,et al.  Intelligent scissors for image composition , 1995, SIGGRAPH.

[4]  Eric V. Denardo,et al.  Flows in Networks , 2011 .

[5]  Andrew Blake,et al.  "GrabCut" , 2004, ACM Trans. Graph..

[6]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[7]  Roberto Cipolla,et al.  Multi-view stereo via volumetric graph-cuts , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[8]  Zhuowen Tu,et al.  Improving Shape Retrieval by Learning Graph Transduction , 2008, ECCV.

[9]  Vladimir Kolmogorov,et al.  An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision , 2001, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Yuri Boykov,et al.  A Scalable graph-cut algorithm for N-D grids , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[11]  Haibin Ling,et al.  Shape Classification Using the Inner-Distance , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Pushmeet Kohli,et al.  Dynamic Graph Cuts for Efficient Inference in Markov Random Fields , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Guillermo Sapiro,et al.  Geodesic Active Contours , 1995, International Journal of Computer Vision.

[14]  Daniel Cremers,et al.  Efficient Shape Matching Via Graph Cuts , 2007, EMMCVPR.

[15]  G. Borradaile,et al.  Exploiting Planarity for Network Flow and Connectivity Problems , 2008 .

[16]  Philip N. Klein,et al.  An O (n log n) algorithm for maximum st-flow in a directed planar graph , 2006, SODA '06.

[17]  Olivier Juan,et al.  Capacity Scaling for Graph Cuts in Vision , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[18]  D. Greig,et al.  Exact Maximum A Posteriori Estimation for Binary Images , 1989 .

[19]  Wolfgang Effelsberg,et al.  Corridor scissors: a semiautomatic segmentation tool employing minimum-cost circular paths , 2004, 2004 International Conference on Image Processing, 2004. ICIP '04..

[20]  Marc Pollefeys,et al.  Multi-view reconstruction using photo-consistency and exact silhouette constraints: a maximum-flow formulation , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[21]  Karsten Weihe.  Maximum (s,t)-flows in planar networks in O(|V|log|V|) time , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[22]  Marie-Pierre Jolly,et al.  Interactive Organ Segmentation Using Graph Cuts , 2000, MICCAI.

[23]  Jitendra Malik,et al.  Shape matching and object recognition using shape contexts , 2010, 2010 3rd International Conference on Computer Science and Information Technology.