The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Efficiently solving dynamic Markov random fields using graph cuts
Abstract
In this paper, we present a fast new fully dynamic algorithm for the st-mincut/max-flow problem. We show how this algorithm can be used to efficiently compute MAP estimates for dynamically changing MRF models of labeling problems in computer vision, such as image segmentation. Specifically, given the solution of the max-flow problem on a graph, we show how to efficiently compute the maximum flow in a modified version of the graph. Our experiments showed that the time taken by our algorithm is roughly proportional to the number of edges whose weights were different in the two graphs. We test the performance of our algorithm on one particular problem: the object-background segmentation problem for video and compare it with the best known st-mincut algorithm. The results show that the dynamic graph cut algorithm is much faster than its static counterpart and enables real time image segmentation. It should be noted that our method is generic and can be used to yield similar improvements in many other cases that involve dynamic change in the graph
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
Cited by
Graph Cuts and Efficient N-D Image Segmentation
Boykov, Y., & Funka-Lea, G. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-006-7934-5 · Cited by 1,910
Shotton, J., Winn, J., Rother, C., & Criminisi, A. (2009) · International Journal of Computer Vision · doi:10.1007/s11263-007-0109-1 · Cited by 1,026
Optimizing Binary MRFs via Extended Roof Duality
Rother, C., Kolmogorov, V., Lempitsky, V., & Szummer, M. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383203 · Cited by 427
Image segmentation with a bounding box prior
Lempitsky, V., Kohli, P., Rother, C., & Sharp, T. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459262 · Cited by 390
Self-citationGraph cut based image segmentation with connectivity priors
Vicente, S., Kolmogorov, V., & Rother, C. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587440 · Cited by 385
Background Modeling using Mixture of Gaussians for Foreground Detection - A Survey
Bouwmans, T., El Baf, F., & Vachon, B. (2010) · Recent Patents on Computer Science · doi:10.2174/1874479610801030219 · Cited by 374
Discovering social circles in ego networks
Mcauley, J., & Leskovec, J. (2014) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2556612 · Cited by 366
Optical flow estimation with uncertainties through dynamic MRFs
Glocker, B., Paragios, N., Komodakis, N., Tziritas, G., & Navab, N. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587562 · Cited by 69
Optimization by Self-Organized Criticality
Hoffmann, H., & Payton, D. W. (2018) · Scientific Reports · doi:10.1038/s41598-018-20275-7 · Cited by 65
Bottom dressing by a life-sized humanoid robot provided failure detection and recovery functions
Yamazaki, K., Oya, R., Nagahama, K., Okada, K., & Inaba, M. (2014) · 2014 IEEE/SICE International Symposium on System Integration · doi:10.1109/sii.2014.7028101 · Cited by 42
Bottom dressing by a dual-arm robot using a clothing state estimation based on dynamic shape changes
Yamazaki, K., Oya, R., Nagahama, K., Okada, K., & Inaba, M. (2016) · International Journal of Advanced Robotic Systems · doi:10.5772/61930 · Cited by 34
“Before description of the state, the image region of the target clothing item is extracted via a dynamic graph cut method [9].”
MethodA method of state recognition of dressing clothes based on dynamic state matching
Yamazaki, K., Oya, R., Nagahama, K., & Inaba, M. (2013) · Proceedings of the 2013 IEEE/SICE International Symposium on System Integration · doi:10.1109/sii.2013.6776728 · Cited by 20
Metadata
- Authors
- Kohli, P., & Torr, P. H. S.
- Venue
- Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1
- Publisher
- IEEE
- Published
- 2005
- Pages
- 922-929 Vol. 2
- OpenAlex
- W2120804060
- Cited by
- 173
- References
- 1
- FWCI
- 14.33
- 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.