RIGOR: Reusing inference in graph cuts for generating object regions

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2014, Pages 336-343

  Humayun, Ahmad ^a   Li, Fuxin ^a   Rehg, James M ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Boosting; Graph Cuts; Object Proposals; Object Segmentation; Reuse

Indexed keywords

GRAPH ALGORITHMS; GRAPHIC METHODS; LAKES; OBJECT RECOGNITION;

BOOSTING; GRAPH CUT; OBJECT PROPOSALS; OBJECT SEGMENTATION; REUSE;

IMAGE SEGMENTATION;

EID: 84911456672     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2014.50     Document Type: Conference Paper

References (35)

1. P. Arbelaez, B. Hariharan, C. Gu, S. Gupta, L. Bourdev, and J. Malik. Semantic segmentation using regions and parts. In CVPR, 2012.
2. P. Arbelaez, M. Maire, C. Fowlkes, and J. Malik. Contour detection and hierarchical image segmentation. PAMI, 33(5):898-916, 2011.
3. R. Benenson, M. Mathias, R. Timofte, and L. V. Gool. Pedestrian detection at 100 frames per second. In CVPR, 2012.
4. Y. Boykov and M.-P. Jolly. Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images. In CVPR, pages 105-112 vol.1, 2001.
5. Y. Boykov and V. Kolmogorov. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. PAMI, 26(9):1124-1137, 2004.
6. J. Carreira and C. Sminchisescu. CPMC: Automatic Object Segmentation Using Constrained Parametric Min-Cuts. PAMI, 34(7):1312-1328, 2012.
7. E. A. Dinic. Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Math. Dokl, 11(5):1277-1280, 1970.
8. P. Dollar and C. Zitnick. Structured forests for fast edge detection. In ICCV, 2013.
9. I. Endres and D. Hoiem. Category independent object proposals. In ECCV, pages 575-588, 2010.
10. P. F. Felzenszwalb, D. A. McAllester, and D. Ramanan. A discriminatively trained, multiscale, deformable part model. In CVPR, 2008.
11. S. Fidler, R. Mottaghi, A. Yuille, and R. Urtasun. Bottom-up segmentation for top-down detection. In CVPR, 2013.
12. L. R. Ford and D. R. Fulkerson. Maximal flow through a network. Canadian Journal of Mathematics, 8(3):399-404, 1956.
13. J. Friedman. Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29:1189-1232, 2001.
14. R. Girshick, J. Shotton, P. Kohli, A. Criminsi, and A. Fitzgibbon. Efficient regression of general-activity human poses from depth images. In ICCV, 2011.
15. A. V. Goldberg and R. E. Tarjan. A new approach to the maximum-flow problem. Journal of the ACM (JACM), 35(4):921-940, 1988.
16. D. M. Greig, B. T. Porteous, and A. H. Seheult. Exact maximum a posteriori estimation for binary images. Journal of the Royal Statistical Society. Series B. Methodological, 51(2):271-279, 1989.
17. D. S. Hochbaum. The pseudoflow algorithm: A new algorithm for the maximum-flow problem. Operations research, 56(4):992-1009, 2008.
18. D. Hoiem, A. S. Stein, A. A. Efros, and M. Hebert. Recovering occlusion boundaries from a single image. In ICCV, 2007.
19. J. Kim and K. Grauman. Shape sharing for object segmentation. In ECCV, 2012.
20. P. Kohli and P. H. Torr. Dynamic graph cuts for efficient inference in markov random fields. PAMI, 29(12):2079-2088, 2007.
21. V. Kolmogorov, Y. Boykov, and C. Rother. Applications of parametric maxflow in computer vision. In ICCV, 2007.
22. V. Kolmogorov and R. Zabih. What energy functions can be minimized via graph cuts? PAMI, 26:147-159, 2004.
23. C. Lampert, M. Blaschko, and T. Hofmann. Beyond sliding windows: Object localization by efficient subwindow search. In CVPR, 2008.
24. Y. J. Lee, J. Kim, and K. Grauman. Key-segments for video object segmentation. In ICCV, 2011.
25. M. Leordeanu, R. Sukthankar, and C. Sminchisescu. Efficient closed-form solution to generalized boundary detection. In ECCV, 2012.
26. A. Levinshtein, C. Sminchisescu, and S. Dickinson. Optimal contour closure by superpixel grouping. In ECCV, pages 480-493, 2010.
27. F. Li, J. Carreira, and C. Sminchisescu. Object recognition as ranking holistic figure-ground hypotheses. In CVPR, 2010.
28. J. Lim, C. Zitnick, and P. Dollar. Sketch tokens: A learned mid-level representation for contour and object detection. In CVPR, 2013.
29. M. A. Sadeghi and D. Forsyth. Fast template evaluation with vector quantization. In NIPS, pages 2949-2957, 2013.
30. J. Shi and J. Malik. Normalized cuts and image segmentation. PAMI, 22(8):888-905, 2000.
31. J. Uijlings, K. van de Sande, T. Gevers, and A. Smeulders. Selective search for object recognition. IJCV, 104:154-171, 2013.
32. T. Verma and D. Batra. Maxflow revisited: An empirical comparison of maxflow algorithms for dense vision problems. In BMVC, 2012.
33. S. Wang and J. Siskind. Image segmentation with ratio cut. PAMI, 25(6):675-690, 2003.
34. D. Weiss and B. Taskar. Scalpel: Segmentation cascasdes with localized priors and efficient learning. In CVPR, 2013.
35. Z. Wu and R. Leahy. An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. PAMI, 15(11):1101-1113, 1993.