The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Entropy rate superpixel segmentation
Abstract
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term. The entropy rate favors formation of compact and homogeneous clusters, while the balancing function encourages clusters with similar sizes. We present a novel graph construction for images and show that this construction induces a matroid - a combinatorial structure that generalizes the concept of linear independence in vector spaces. The segmentation is then given by the graph topology that maximizes the objective function under the matroid constraint. By exploiting submodular and mono-tonic properties of the objective function, we develop an efficient greedy algorithm. Furthermore, we prove an approximation bound of ½ for the optimality of the solution. Extensive experiments on the Berkeley segmentation benchmark show that the proposed algorithm outperforms the state of the art in all the standard evaluation metrics.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Mean shift: a robust approach toward feature space analysis
Comaniciu, D., & Meer, P. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.1000236 · Cited by 11,305
Martin, D., Fowlkes, C., Tal, D., & Malik, J. (2002) · Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 · doi:10.1109/iccv.2001.937655 · Cited by 8,216
Fast approximate energy minimization via graph cuts
Boykov, Y., Veksler, O., & Zabih, R. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.969114 · Cited by 6,988
Efficient Graph-Based Image Segmentation
Felzenszwalb, P. F., & Huttenlocher, D. P. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000022288.19776.77 · Cited by 6,176
Watersheds in digital spaces: an efficient algorithm based on immersion simulations
Vincent, L., & Soille, P. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.87344 · Cited by 5,649
An analysis of approximations for maximizing submodular set functions—I
Nemhauser, G. L., Wolsey, L. A., & Fisher, M. L. (1978) · Mathematical Programming · doi:10.1007/bf01588971 · Cited by 4,412
Cost-effective outbreak detection in networks
Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., & Glance, N. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281239 · Cited by 2,502
Learning a classification model for segmentation
Ren, & Malik (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238308 · Cited by 1,765
TurboPixels: Fast Superpixels Using Geometric Flows
Levinshtein, A., Stere, A., Kutulakos, K. N., Fleet, D. J., Dickinson, S. J., & Siddiqi, K. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.96 · Cited by 1,146
Robust Higher Order Potentials for Enforcing Label Consistency
Kohli, P., Ladický, L., & Torr, P. H. S. (2009) · International Journal of Computer Vision · doi:10.1007/s11263-008-0202-0 · Cited by 853
KrauseAndreas, SinghAjit, & GuestrinCarlos (2008) · Journal of Machine Learning Research · doi:10.5555/1390681.1390689 · Cited by 815
An analysis of approximations for maximizing submodular set functions—II
Fisher, M. L., Nemhauser, G. L., & Wolsey, L. A. (1978) · Mathematical Programming Studies · doi:10.1007/bfb0121195 · Cited by 589
Recovering human body con .gurations:combining segmentation and recognition
Mori, G., Ren, X., Efros, A. A., & Malik, J. (2004) · Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. · doi:10.1109/cvpr.2004.1315182 · Cited by 507
Superpixels and Supervoxels in an Energy Optimization Framework
Veksler, O., Boykov, Y., & Mehrani, P. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15555-0_16 · Cited by 443
Moore, A. P., Prince, S. J. D., Warrell, J., Mohammed, U., & Jones, G. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587471 · Cited by 380
Recovering Occlusion Boundaries from a Single Image
Hoiem, D., Stein, A. N., Efros, A. A., & Hebert, M. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408985 · Cited by 206
Exact inference in multi-label CRFs with higher order cliques
Ramalingam, S., Kohli, P., Alahari, K., & Torr, P. H. S. (2008) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2008.4587401 · Cited by 93
Self-citationOn Parameter Learning in CRF-Based Approaches to Object Class Image Segmentation
Nowozin, S., Gehler, P., & Lampert, C. H. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15567-3_8 · Cited by 79
Cited by
DeepOrgan: Multi-level Deep Convolutional Networks for Automated Pancreas Segmentation
Roth, H. R., Lu, L., Farag, A., Shin, H.-C., Liu, J., Turkbey, E. B., & Summers, R. M. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-24553-9_68 · Cited by 784
Superpixels: An evaluation of the state-of-the-art
Stutz, D., Hermans, A., & Leibe, B. (2018) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2017.03.007 · Cited by 538
SEEDS: Superpixels Extracted via Energy-Driven Sampling
Van den Bergh, M., Boix, X., Roig, G., de Capitani, B., & Van Gool, L. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33786-4_2 · Cited by 473
Semi-Supervised Deep Learning Using Pseudo Labels for Hyperspectral Image Classification
Wu, H., & Prasad, S. (2018) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2772836 · Cited by 463
Towards unified depth and semantic prediction from a single image
Wang, P., Shen, X., Lin, Z., Cohen, S., Price, B., & Yuille, A. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7298897 · Cited by 447
Metadata
- Authors
- Liu, M.-Y., Tuzel, O., Ramalingam, S., & Chellappa, R.
- Venue
- CVPR 2011
- Publisher
- IEEE
- Published
- 2011-06
- Pages
- 2097-2104
- OpenAlex
- W2135431554
- Cited by
- 1,026
- References
- 20
- FWCI
- 18.89
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.