The DOI matches its Crossref record; 58 of the 58 references it cites were found in a registry or an index.
Fast approximate energy minimization with label costs
Abstract
The α-expansion algorithm has had a significant impact in computer vision due to its generality, effectiveness, and speed. Thus far it can only minimize energies that involve unary, pairwise, and specialized higher-order terms. Our main contribution is to extend α-expansion so that it can simultaneously optimize “label costs” as well. An energy with label costs can penalize a solution based on the set of labels that appear in it. The simplest special case is to penalize the number of labels in the solution. Our energy is quite general, and we prove optimality bounds for our algorithm. A natural application of label costs is multi-model fitting, and we demonstrate several such applications in vision: homography detection, motion segmentation, and unsupervised image segmentation. Our C++/MATLAB implementation is publicly available.
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
Distinctive Image Features from Scale-Invariant Keypoints
Lowe, D. G. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029664.99615.94 · Cited by 55,589
A new look at the statistical model identification
Akaike, H. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100705 · Cited by 51,879
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Fischler, M. A., & Bolles, R. C. (1981) · Communications of the ACM · doi:10.1145/358669.358692 · Cited by 25,893
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
Multiple View Geometry in Computer Vision
Hartley, R., & Zisserman, A. (2004) · doi:10.1017/cbo9780511811685 · Cited by 21,070
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
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
(2006) · Springer eBooks · Cited by 8,123
Vector Quantization and Signal Compression
Gersho, A., & Gray, R. M. (1992) · Springer eBooks · doi:10.1007/978-1-4615-3626-0 · Cited by 7,003
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
Self-citationInformation theory, inference, and learning algorithms
(2004) · Choice Reviews Online · doi:10.5860/choice.41-5949 · Cited by 6,362
GrabCut: Interactive foreground extraction using iterated graph cuts
Rother, C., Kolmogorov, V., & Blake, A. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015720 · Cited by 5,703
Model Selection and Multimodel Inference
(2003) · Technometrics · doi:10.1198/tech.2003.s146 · Cited by 5,449
Information Theory, Inference, and Learning Algorithms
(2004) · Kybernetes · doi:10.1108/03684920410534506 · Cited by 4,937
An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision
Boykov, Y., & Kolmogorov, V. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.60 · Cited by 4,577
Self-citationMaximum likelihood estimation from incomplete data via the EM algorithm
Dempster, A. P. (1977) · Journal of the Royal Statistical Society Series A (Statistics in Society) · Cited by 4,543
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
What energy functions can be minimized via graph cuts?
Kolmogorov, V., & Zabih, R. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1262177 · Cited by 3,127
A threshold of ln n for approximating set cover
Feige, U. (1998) · Journal of the ACM · doi:10.1145/285055.285059 · Cited by 3,086
Unsupervised learning of finite mixture models
Figueiredo, M. A. T., & Jain, A. K. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.990138 · Cited by 2,125
Blake, A., & Zisserman, A. (1987) · The MIT Press eBooks · doi:10.7551/mitpress/7132.001.0001 · Cited by 2,105
Region competition: unifying snakes, region growing, and Bayes/MDL for multiband image segmentation
Zhu, S. C., & Yuille, A. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.537343 · Cited by 1,913
Large Margin Methods for Structured and Interdependent Output Variables
Tsochantaridis, I., Joachims, T., Hofmann, T., & Altün, Y. (2005) · MPG.PuRe (Max Planck Society) · Cited by 1,879
Example-based learning for view-based human face detection
Sung, K.-K., & Poggio, T. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.655648 · Cited by 1,773
Bayesian Variable Selection in Linear Regression
Mitchell, T. J., & Beauchamp, J. J. (1988) · Journal of the American Statistical Association · doi:10.1080/01621459.1988.10478694 · Cited by 1,424
Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
Everett, H. (1963) · Operations Research · doi:10.1287/opre.11.3.399 · Cited by 1,274
Convergent Tree-Reweighted Message Passing for Energy Minimization
Kolmogorov, V. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.200 · Cited by 1,095
Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., & Rother, C. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.70844 · Cited by 966
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
Boros, E., & Hammer, P. L. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00341-9 · Cited by 827
Rate-distortion methods for image and video compression
Ortego, A., & Ramchandran, K. (1998) · IEEE Signal Processing Magazine · doi:10.1109/79.733495 · Cited by 808
Cornuejols, G., Fisher, M. L., & Nemhauser, G. L. (1977) · Management Science · doi:10.1287/mnsc.23.8.789 · Cited by 793
The Complexity of Multiterminal Cuts
Dahlhaus, E., Johnson, D. S., Papadimitriou, C. H., Seymour, P. D., & Yannakakis, M. (1994) · SIAM Journal on Computing · doi:10.1137/s0097539792225297 · Cited by 662
A Benchmark for the Comparison of 3-D Motion Segmentation Algorithms
Tron, R., & Vidal, R. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.382974 · Cited by 658
Computing geodesics and minimal surfaces via graph cuts
Boykov, & Kolmogorov (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238310 · Cited by 555
Constructing simple stable descriptions for image partitioning
Leclerc, Y. G. (1989) · International Journal of Computer Vision · doi:10.1007/bf00054839 · Cited by 520
The uncapacitated facility location problem
Cornuéjols, G., Nemhauser, G. L., & Wolsey, L. A. (1990) · Cited by 483
Cornuéjols, G., Fisher, M. L., & Nemhauser, G. L. (1979) · Management Science · doi:10.1287/mnsc.25.8.808 · Cited by 430
SMEM Algorithm for Mixture Models
Ueda, N., Nakano, R., Ghahramani, Z., & Hinton, G. E. (2000) · Neural Computation · doi:10.1162/089976600300015088 · Cited by 409
Kleinberg, J., & Tardos, É. (2002) · Journal of the ACM · doi:10.1145/585265.585268 · Cited by 400
Energy-Based Geometric Multi-model Fitting
Isack, H., & Boykov, Y. (2012) · International Journal of Computer Vision · doi:10.1007/s11263-011-0474-7 · Cited by 318
Self-citationGraph Cut Based Inference with Co-occurrence Statistics
Ladicky, L., Russell, C., Kohli, P., & Torr, P. H. S. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15555-0_18 · Cited by 308
Geometric motion segmentation and model selection
Torr, P. H. S. (1998) · Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.1998.0224 · Cited by 307
The multiRANSAC algorithm and its application to detect planar homographies
Zuliani, M., Kenney, C. S., & Manjunath, B. S. (2005) · IEEE International Conference on Image Processing 2005 · doi:10.1109/icip.2005.1530351 · Cited by 288
Learning CRFs Using Graph Cuts
Szummer, M., Kohli, P., & Hoiem, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88688-4_43 · Cited by 243
Multiway cut for stereo and motion with slanted surfaces
Birchfield, S., & Tomasi, C. (1999) · Proceedings of the Seventh IEEE International Conference on Computer Vision · doi:10.1109/iccv.1999.791261 · Cited by 239
On Detection of Multiple Object Instances Using Hough Transforms
Barinova, O., Lempitsky, V., & Kholi, P. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.79 · Cited by 233
P3 & Beyond: Solving Energies with Higher Order Cliques
Kohli, P., Kumar, M. P., & Torr, P. H. S. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383204 · Cited by 223
Energy Minimization via Graph Cuts: Settling What is Possible
Freedman, D., & Drineas, P. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.143 · Cited by 173
Learning associative Markov networks
Taskar, B., Chatalbashev, V., & Koller, D. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015444 · Cited by 171
Spatially coherent clustering using graph cuts
Zabih, R., & Kolmogorov, V. (2004) · 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.2004.1315196 · Cited by 136
3D LayoutCRF for Multi-View Object Class Recognition and Segmentation
Hoiem, D., Rother, C., & Winn, J. M. (2007) · 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.2007.383045 · Cited by 133
Applications of parametric maxflow in computer vision
Kolmogorov, V., Boykov, Y., & Rother, C. (2007) · IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2007.4408910 · Cited by 116
Self-citationFLoSS: Facility location for subspace segmentation
Lazic, N., Givoni, I. E., Frey, B. J., & Aarabi, P. (2009) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2009.5459302 · Cited by 77
A cost function property for plant location problems
FRIEZE, A. M. (1974) · Mathematical Programming · doi:10.1007/bf01585521 · Cited by 45
A Region Merging Prior for Variational Level Set Image Segmentation
Ayed, I. B., & Mitiche, A. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.2006425 · Cited by 45
Comments on the note of Frieze
Babayev, D. A. (1974) · Mathematical Programming · doi:10.1007/bf01585522 · Cited by 34
Cited by
Chen, L.-C., Papandreou, G., Kokkinos, I., Murphy, K., & Yuille, A. L. (2018) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2017.2699184 · Cited by 22,392
Chen, L.-C., Papandreou, G., Kokkinos, I., Murphy, K., & Yuille, A. L. (2016) · arXiv · doi:10.48550/arxiv.1606.00915 · Cited by 22,392
Semantic Image Segmentation with Deep Convolutional Nets and Fully Connected CRFs
Chen, L.-C., Papandreou, G., Kokkinos, I., Murphy, K., & Yuille, A. L. (2014) · arXiv · doi:10.48550/arxiv.1412.7062 · Cited by 4,213
Local-global parcellation of the human cerebral cortex from intrinsic functional connectivity MRI
Schaefer, A., Kong, R., Gordon, E. M., Laumann, T. O., Zuo, X.-N., Holmes, A. J., Eickhoff, S. B., & Yeo, B. T. T. (2018) · Cerebral Cortex · doi:10.1093/cercor/bhx179 · Cited by 3,657
Weakly-and Semi-Supervised Learning of a Deep Convolutional Network for Semantic Image Segmentation
Papandreou, G., Chen, L.-C., Murphy, K. P., & Yuille, A. L. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.203 · Cited by 1,005
Metadata
- Authors
- Delong, A., Osokin, A., Isack, H. N., & Boykov, Y.
- Venue
- 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2010-06
- Pages
- 2173-2180
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W3184458996
- Cited by
- 404
- References
- 58
- FWCI
- 32.44
- 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.