Adaptive figure-ground classification

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

Volumn , Issue , 2012, Pages 654-661

  Chen, Yisong ^a   Chan, Antoni B ^b   Wang, Guoping ^a  

^a PEKING UNIVERSITY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDING-BOX; CLASSIFICATION ALGORITHM; COMPUTATIONAL COSTS; DATA SETS; DISTANCE FUNCTIONS; DISTANCE MEASURE; FIGURE-GROUND; FOREGROUND REGIONS; MEAN SHIFT ALGORITHM; MULTIPLE HYPOTHESIS; SCORE FUNCTION; SEGMENTATION QUALITY; WEIGHTED COMBINATION SCHEME;

ALGORITHMS; IMAGE SEGMENTATION; ITERATIVE METHODS;

COMPUTER VISION;

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

References (32)

1. V. Gulshan, C. Rother, A. Criminisi, A. Blake and A. Zisserman, Geodesic star convexity for interactive image segmentation. In CVPR2010, pp. 3129-2136.
2. Y. Boykov and M. Jolly. Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images. In Proc. ICCV2001, volume 1, pp. 105-112.
3. L. Grady. Random walks for image segmentation. PAMI, 28(11):1768-1783, 2006.
4. X. Bai and G. Sapiro, A geodesic framework for fast interactive image and video segmentation and matting. In ICCV2007, pp. 1-8.
5. S. Bagon, O. Boiman, and M. Irani, What is a good image segment? a unified approach to segment extraction. In ECCV, pages 30-44, 2008.
6. G. Hua, Z. Liu, Z. Zhang, and Y. Wu, Iterative local global energy minimization for automatic extraction of objects of interest, PAMI, 28(10), 1701-1706, 2006.
7. C. Rother, V. Kolmogorov, and A. Blake, "grabcut": interactive foreground extraction using iterated graph cuts. ACM Trans. Graph., 23(3):309-314, 2004.
8. B. Micusik and A. Hanbury. Automatic image segmentation by positioning a seed, ECCV2006, Vol. 2, 468-480.
9. R. B. S. Alpert, M. Galun and A. Brandt. Image segmentation by probabilistic bottom-up aggregation and cue integration, CVPR2007, pp. 1-8.
10. R. Szeliski, et al., A comparative study of energy minimization methods for markov random fields with smoothness-based priors. PAMI, 30(6):1068-1080, 2008.
11. A. Criminisi, T. Sharp, and A. Blake. GeoS: Geodesic image segmentation. In ECCV, pp. 99-112, 2008.
12. I. Ayed, H. Chen, K. Punithakumar, I. Ross, and S. Li, Graph cut segmentation with a global constraint: Recovering region distribution via a bound of the Bhattacharyya measure, CVPR2010, pp. 3288-3295.
13. J. Carreira and C. Sminchisescu. Constrained parametric min cuts for automatic object segmentation, CVPR2010, pp. 3241-3248.
14. L. Grady, M. Jolly, A. Seitz, Segmentation from a box, ICCV2011, pp. 367-374.
15. V. Pham, K. Takahashi, T. Naemura, Foreground- Background Segmentation using Iterated Distribution Matching, CVPR2011, pp. 2113-2120.
16. V. Lempitsky, P. Kohli, C. Rother, T. Sharp, Image segmentation with a bounding box prior. ICCV2009, 277-284.
17. D. Comaniciu and P. Meer. Mean shift: A robust approach toward feature space analysis. PAMI, 24(5):603-619, 2002.
18. P. Felzenszwalb and D. Huttenlocher. Efficient graph-based image segmentation. IJCV, 59(2):167-181, 2004.
19. J. Shi and J. Malik. Normalized cuts and image segmentation. PAMI, 22(8), pp. 888-905, 2000.
20. M. Donoser, M. Urschler, M. Hirzer, H. Bischof. Saliency driven total variation segmentation, ICCV2009, 817-824.
21. S. R. Rao, H. Mobahi, A. Y. Yang, S. S. Sastry, and Y. Ma. Natural image segmentation with adaptive texture and boundary encoding, ACCV2009, pp. 135-146.
22. T. Malisiewicz and A. Efros. Improving spatial support for objects via multiple segmentations, BMVC2007.
23. D. Comaniciu, An algorithm for data-driven bandwidth selection, PAMI, 25(2), 2003, pp. 281-288.
24. T. Cover and J. Thomas, Elements of information theory. John Wiley and Sons, New-York, USA, 1991.
25. J. M. Lattin, J. D. Carrol, P. E. Green, Analyzing multivariate data, Thomson Brooks/Cole, 2003.
26. K. Kanatani, Statistical Optimization for Geometric Computation: Theory and Practice, Elsevier 1996.
27. J. Kittler, M. Hatef, R. Duin, and J. Matas, On combining classifiers, IEEE Trans. PAMI, 20(3), pp. 226-239, 1998.
28. A. K. Sinop and L. Grady. A seeded image segmentation framework unifying graph cuts and random walker which yields a new algorithm, ICCV2007, pp.1-8.
29. http://www.wisdom.weizmann.ac.il/~vision/Seg-Evaluation-DB/scores.html, Weizmann dataset webpage.
30. http://ivrg.epfl.ch/supplementary-material/RK-CVPR09/index.html, ivrg dataset webpage.
31. http://research.microsoft.com/en-us/um/cambridge/projects/ visionimagevideoediting/segmentation/grabcut.htm.
32. http://www.eecs.berkeley.edu/Research/Projects/CS/vision/grouping/ segbench/,Berkeley segmentation dataset page.