Efficient planar graph cuts with applications in computer vision

2009 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2009

Volumn , Issue , 2009, Pages 351-356

  Schmidt, Frank R ^a   Töppe, Eno ^a   Cremers, Daniel ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH ALGORITHMS; GRAPH THEORY; GRAPHIC METHODS; IMAGE SEGMENTATION;

EXPERIMENTAL BENCH; GRAPH CUT; GRAPH-CUT METHODS; PLANAR GRAPH; PLANAR SHAPE; RUNTIME BEHAVIORS; SHAPE MATCHING; UPPER BOUND;

COMPUTER VISION;

EID: 70450187795     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPRW.2009.5206863     Document Type: Conference Paper

References (23)

1. S. Belongie, J. Malik, and J. Puzicha. Shape matching and objects recognition using shape contexts. IEEE PAMI, 24(4):509-522, 2002.
2. G. Borradaile. Exploiting Planarity for Network Flow and Connectivity Problems. PhD thesis, Brown University, May 2008.
3. Y. Boykov and M.-P. Jolly. Interactive organ segmentation using graph cuts. In MICCAI, volume 1935 of LNCS, pages 276-286. Springer, 2000.
4. Y. Boykov and V. Kolmogorov. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE PAMI, 26(9):1124-1137, 2004.
5. V. Caselles, R. Kimmel, and G. Sapiro. Geodesic active contours. In IEEE ICCV, pages 694-699, Boston, USA, 1995.
6. A. Delong and Y. Boykov. A scalable graph-cut algorithm for n-d grids. In IEEE CVPR, Anchorage, Alaska, June 2008.
7. E. A. Dinic. Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Math. Dokl., 11:1277-1280, 1970.
8. D. Farin, M. Pfeffer, P. H. N. deWith, and W. Effelsberg. Corridor Scissors: A semi-automatic segmentation tool employing minimum-cost circular paths. In IEEE ICIP, Singapore, October 2004.
9. L. Ford and D. Fulkerson. Flows in Networks. Princeton University Press, Princeton, New Jersey, 1962.
10. D. M. Greig, B. T. Porteous, and A. H. Seheult. Exact maximum a posteriori estimation for binary images. J. Roy. Statist. Soc., Ser. B., 51(2):271-279, 1989.
11. M. R. Henzinger and V. King. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J. ACM, 46(4):502-516, 1999.
12. O. Juan and Y. Boykov. Capacity scaling for graph cuts in vision. In IEEE ICCV, 2007.
13. P. Kohli and P. H. S. Torr. Dynamic graph cuts for efficient inference in markov random fields. IEEE PAMI, 29(12):2079-2088, 2007.
14. H. Ling and D. W. Jacobs. Shape classification using the inner-distance. IEEE PAMI, 29(02):286-299, 2007.
15. E. N. Mortensen and W. A. Barrett. Intelligent scissors for image composition, 1995.
16. C. Rother, V. Kolmogorov, and A. Blake. GrabCut: interactive foreground extraction using iterated graph cuts. ACM Trans. Graph., 23(3):309-314, 2004.
17. F. R. Schmidt, D. Farin, and D. Cremers. Fast matching of planar shapes in sub-cubic runtime. In IEEE ICCV, Rio de Janeiro, Brazil, October 2007.
18. F. R. Schmidt, E. Töppe, D. Cremers, and Y. Boykov. Efficient shape matching via graph cuts. In Int. Conf. on EMM- CVPR, 2007.
19. S. N. Sinha and M. Pollefeys. Multi-view reconstruction using photo-consistency and exact silhouette constraints: A max-flow formulation. In IEEE ICCV, pages 349-356, 2005.
20. D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. In JCSS, pages 362-391, 1981.
21. G. Vogiatzis, P. Torr, and R. Cippola. Multi-view stereo via volumetric graph-cuts. In IEEE CVPR, pages 391-399, 2005.
22. K. Weihe. Maximum (s, t)-flows in planar networks in O(|V| log|V|) time. J. Comput. Syst. Sci., 55(3):454-475, 1997.
23. X. Yang, X. Bai, L. J. Latecki, and Z. Tu. Improving shape retrieval by learning graph transduction. In Europ. Conf. on Computer Vision, pages 788-801, Marseille, France, October 2008.