Entropy rate superpixel segmentation

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

Volumn , Issue , 2011, Pages 2097-2104

  Liu, Ming Yu ^a   Tuzel, Oncel ^b   Ramalingam, Srikumar ^b   Chellappa, Rama ^a  

^a UNIVERSITY OF MARYLAND   (United States)

^b MITSUBISHI ELECTRIC RESEARCH LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; ENTROPY; PATTERN RECOGNITION; PIXELS; SIGNAL THEORY; TOPOLOGY; VECTOR SPACES;

APPROXIMATION BOUNDS; COMBINATORIAL STRUCTURES; GRAPH CONSTRUCTION; HOMOGENEOUS CLUSTER; LINEAR INDEPENDENCE; OBJECTIVE FUNCTIONS; STANDARD EVALUATIONS; SUPERPIXEL SEGMENTATIONS;

SUPERPIXELS;

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

References (23)

1. Y. Boykov, O. Veksler, and R. Zabih. Efficient approximate energy minimization via graph cut. TPAMI, 20(12):1222-1239, 2001.
2. D. Comaniciu and P. Meer. Mean shift: A robust approach toward feature space analysis. TPAMI, 24(5):603-619, 2002.
3. T. M. Cover and J. A. Thomas. Elements of Information Theory. John Wiley, 2 edition, 1991.
4. P. F. Felzenszwalb and D. P. Huttenlocher. Efficient graphbased image segmentation. IJCV, 59(2):167-181, 2004.
5. M. L. Fisher, G. L. Nemhauser, and L. A. Wolsey. An analysis of the approximations for maximizing submodular set functions - ii. Mathematical Programming, pages 73-87, 1978.
6. C. Guestrin, A. Krause, and A. P. Singh. Near-optimal sensor placements in gaussian processes: Theory, efficient algorithms and empirical studies. Journal of Machine Learning Research, pages 235-284, 2008.
7. D. Hoiem, A. N. Stein, A. A. Efros, and M. Hebert. Recovering occlusion boundaries from a single image. In ICCV, 2007.
8. P. Kohli, L. Ladicky, and P. Torr. Robust higher order potentials for enforcing label consistency. IJCV, 82:302-324, 2009.
9. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. Van-Briesen, and N. Glance. Cost-effective outbreak detection in networks. In SIGKDD, pages 420-429, 2007.
10. A. Levinshtein, A. Stere, K. N. Kutulakos, D. J. Fleet, and S. J. Dickinson. Fast superpixels using geometric flows. TPAMI, 31(12):2290-2297, 2009.
11. M.-Y. Liu, O. Tuzel, S. Ramalingam, and R. Chellappa. Entropy rate superpixel segmentation. Technical report, University of Maryland College Park, 2011.
12. D. Martin, C. Fowlkes, D. Tal, and J. Malik. A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In ICCV, 2001.
13. A. P. Moore, S. J. Prince, and J. Warrell. "lattice cut" - construcitng superpixles using layer constraints. In CVPR, 2010.
14. A. P. Moore, S. J. Prince, J. Warrell, U. Mohammed, and G. Jones. Superpixel lattices. In CVPR, 2008.
15. G. Mori, X. Ren, A. A. Efros, and J. Malik. Recovering human body configurations: Combining segmentation and recognition. In CVPR, 2004.
16. G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher. An analysis of the approximations for maximizing submodular set functions. Mathematical Programming, pages 265-294, 1978.
17. S. Nowozin, P. Gehler, and C. Lampert. On parameter learning in crf-based approaches to object class image segmentation. In ECCV, 2010.
18. J. Oxley. Matroid Theory. Oxford University Press, 1992.
19. S. Ramalingam, P. Kohli, K. Alahari, and P. H. S. Torr. Exact inference in multi-label crfs with higher order cliques. In CVPR, 2008.
20. X. Ren and J. Malik. Learning a classification model for segmentation. In ICCV, 2003.
21. J. Shi and J. Malik. Normalized cuts and image segmentation. TPAMI, 22(8):888-905, 2000.
22. O. Veksler and Y. Boykov. Superpixels and supervoxels in an energy optimization framework. In ECCV, 2010.
23. L. Vincent and P. Soille. Watersheds in digital spaces: an efficient algorithm based on immersion simulations. TPAMI, 13(6):583-598, 1991.