The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Markov Random Field modeling, inference & learning in computer vision & image understanding: A survey
Open accessOverview
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
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
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Object Detection with Discriminatively Trained Part-Based Models
Felzenszwalb, P. F., Girshick, R. B., McAllester, D., & Ramanan, D. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.167 · Cited by 9,853
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
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486 · cited 3×
“Factor graph [37,38] is a unified representation for both BNs and MRFs, which uses additional nodes, named factor nodes,(4) to explicitly describe the factorization of the joint distribution in the graph.”
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
Beitrag zur Theorie des Ferromagnetismus
Ising, E. (1925) · Zeitschrift für Physik · doi:10.1007/bf02980577 · Cited by 3,871
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 · cited 1×
“4We call the nodes in original graphsu ual nodeswhen an explicit distinction between the two types of nodes is required to avoid ambiguities. of the joint distribution in the graph.”
BackgroundThe Representation and Matching of Pictorial Structures
Fischler, M. A., & Elschlager, R. A. (1973) · IEEE Transactions on Computers · doi:10.1109/t-c.1973.223602 · Cited by 1,322
Boros, E., & Hammer, P. L. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00341-9 · Cited by 827 · cited 2×
“This may explain why its impact is rather limited in the literature [161,213], since our final interest is solving higher-order models.”
BackgroundLearning 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
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 · cited 1×
“This reduction method was studied from an algebraic vie wpoint in [214] and led to some interesting conclusions towards extending this met hod o models of an arbitrary order.”
MethodOptical 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 · cited 1×
“, [53, 54, 55, 56]), image registration and matching (e.”
Intrinsic dense 3D surface tracking
Zeng, Y., Wang, C., Wang, Y., Gu, X., Samaras, D., & Paragios, N. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995513 · Cited by 19 · cited 1×
“, [77,78]), where we aim to infer the configuration of each vertex or facet on the surface.”
BackgroundSelf-citation
Cited by
MSM: a new flexible framework for Multimodal Surface Matching
Robinson, E. C., Jbabdi, S., Glasser, M. F., Andersson, J., Burgess, G. C., Harms, M. P., Smith, S. M., Van Essen, D. C., & Jenkinson, M. (2014) · NeuroImage · doi:10.1016/j.neuroimage.2014.05.069 · Cited by 640
Cooperative Heterogeneous Multi-Robot Systems: A Survey
Rizk, Y., Awad, M., & Tunstel, E. W. (2020) · ACM Computing Surveys · doi:10.1145/3303848 · Cited by 449
Optical flow modeling and computation: A survey
Fortun, D., Bouthemy, P., & Kervrann, C. (2015) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2015.02.008 · Cited by 431
Komodakis, N., & Pesquet, J.-C. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2377273 · Cited by 419
Self-citationDeepNAT: Deep convolutional neural network for segmenting neuroanatomy
Wachinger, C., Reuter, M., & Klein, T. (2018) · NeuroImage · doi:10.1016/j.neuroimage.2017.02.035 · Cited by 346
Metadata
- Authors
- Wang, C., Komodakis, N., & Paragios, N.
- Venue
- Computer Vision and Image Understanding
- Publisher
- Elsevier BV
- Published
- 2013-11
- Volume
- 117
- Issue
- 11
- Pages
- 1610-1627
- ISSN
- 1077-3142 (ISSN-L)
- OpenAlex
- W2114358147
- Cited by
- 208
- References
- 14
- FWCI
- 27.24
- Type
- journal article
- Language
- en
- Open access
- green
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.