The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Parallel and deterministic algorithms from MRFs: surface reconstruction
Abstract
Deterministic approximations to Markov random field (MRF) models are derived. One of the models is shown to give in a natural way the graduated nonconvexity (GNC) algorithm proposed by A. Blake and A. Zisserman (1987). This model can be applied to smooth a field preserving its discontinuities. A class of more complex models is then proposed in order to deal with a variety of vision problems. All the theoretical results are obtained in the framework of statistical mechanics and mean field techniques. A parallel, iterative algorithm to solve the deterministic equations of the two models is presented, together with some experiments on synthetic and real images.>
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
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
Solutions of Ill-Posed Problems.
Bell, J. B., Tikhonov, A. N., & Arsenin, V. Y. (1978) · Mathematics of Computation · doi:10.2307/2006360 · Cited by 8,101
Blake, A., & Zisserman, A. (1987) · The MIT Press eBooks · doi:10.7551/mitpress/7132.001.0001 · Cited by 2,105
Finding Edges and Lines in Images
Canny, J. (1983) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 833
Practical Approximate Solutions to Linear Operator Equations When the Data are Noisy
Wahba, G. (1977) · SIAM Journal on Numerical Analysis · doi:10.1137/0714044 · Cited by 798
Probabilistic Solution of Ill-Posed Problems in Computational Vision
Marroquin, J., Mitter, S., & Poggio, T. (1987) · Journal of the American Statistical Association · doi:10.1080/01621459.1987.10478393 · Cited by 766
Ill-posed problems in early vision
Bertero, M., Poggio, T. A., & Torre, V. (1988) · Proceedings of the IEEE · doi:10.1109/5.5962 · Cited by 723
Analog "neuronal" networks in early vision.
Koch, C., Marroquin, J., & Yuille, A. (1986) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.83.12.4263 · Cited by 278
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
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
Scharstein, D., & Szeliski, R. (2002) · International Journal of Computer Vision · doi:10.1023/a:1014573219977 · Cited by 6,740
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
Warfield, S. K., Zou, K. H., & Wells, W. M. (2004) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2004.828354 · Cited by 2,072
The Robust Estimation of Multiple Motions: Parametric and Piecewise-Smooth Flow Fields
Black, M. J., & Anandan, P. (1996) · Computer Vision and Image Understanding · doi:10.1006/cviu.1996.0006 · Cited by 1,570
A new point matching algorithm for non-rigid registration
Chui, H., & Rangarajan, A. (2003) · Computer Vision and Image Understanding · doi:10.1016/s1077-3142(03)00009-2 · Cited by 1,560
Freeman, W. T., Pasztor, E. C., & Carmichael, O. T. (2000) · International Journal of Computer Vision · doi:10.1023/a:1026501619075 · Cited by 1,459
Deterministic edge-preserving regularization in computed imaging
Charbonnier, P., Blanc-Feraud, L., Aubert, G., & Barlaud, M. (1997) · IEEE Transactions on Image Processing · doi:10.1109/83.551699 · Cited by 1,301
Stereo matching using belief propagation
Sun, J., Zheng, N.-N., & Shum, H.-Y. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1206509 · Cited by 1,271
Statistical Physics of Spin Glasses and Information Processing: An Introduction
Nishimori, H. (2001) · doi:10.1093/acprof:oso/9780198509417.001.0001 · Cited by 1,182
A graduated assignment algorithm for graph matching
Gold, S., & Rangarajan, A. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.491619 · Cited by 1,090
“Second, a continuation method|graduated non-convexity| is used in an e ort to avoid poor local minima [29, 30, 31, 32, 33], with a parameter controlling the convexity.”
MethodA taxonomy and evaluation of dense two-frame stereo correspondence algorithms
Scharstein, D., Szeliski, R., & Zabih, R. (2002) · Proceedings IEEE Workshop on Stereo and Multi-Baseline Vision (SMBV 2001) · doi:10.1109/smbv.2001.988771 · Cited by 1,084
Two deterministic half-quadratic regularization algorithms for computed imaging
Charbonnier, P., Blanc-Feraud, L., Aubert, G., & Barlaud, M. (2002) · Proceedings of 1st International Conference on Image Processing · doi:10.1109/icip.1994.413553 · Cited by 879
Rose, K. (1998) · Proceedings of the IEEE · doi:10.1109/5.726788 · Cited by 876
Black, M. J., & Rangarajan, A. (1996) · International Journal of Computer Vision · doi:10.1007/bf00131148 · Cited by 757
Chaotic simulated annealing by a neural network model with transient chaos
Chen, L., & Aihara, K. (1995) · Neural Networks · doi:10.1016/0893-6080(95)00033-v · Cited by 661
New algorithms for 2D and 3D point matching
Gold, S., Rangarajan, A., Lu, C.-P., Pappu, S., & Mjolsness, E. (1998) · Pattern Recognition · doi:10.1016/s0031-3203(98)80010-1 · Cited by 580
Structural matching in computer vision using probabilistic relaxation
Christmas, W. J., Kittler, J., & Petrou, M. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.400565 · Cited by 495
Pairwise data clustering by deterministic annealing
Hofmann, T., & Buhmann, J. M. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.566806 · Cited by 451
A new algorithm for non-rigid point matching
Chui, H., & Rangarajan, A. (2002) · Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662) · doi:10.1109/cvpr.2000.854733 · Cited by 440
The Use of Personal Pronouns: Role Relationships in Scientific Journal Articles
Kuo, C.-H. (1999) · English for Specific Purposes · doi:10.1016/s0889-4906(97)00058-6 · Cited by 427
Iterative reconstruction techniques in emission computed tomography
Qi, J., & Leahy, R. M. (2006) · Physics in Medicine and Biology · doi:10.1088/0031-9155/51/15/r01 · Cited by 415
Freeman, W. T., & Pasztor, E. C. (1999) · Proceedings of the Seventh IEEE International Conference on Computer Vision · doi:10.1109/iccv.1999.790414 · Cited by 345
A Stochastic Approach to Content Adaptive Digital Image Watermarking
Voloshynovskiy, S., Herrigel, A., Baumgaertner, N., & Pun, T. (2000) · Lecture Notes in Computer Science · doi:10.1007/10719724_16 · Cited by 322
EM procedures using mean field-like approximations for Markov model-based image segmentation
Celeux, G., Forbes, F., & Peyrard, N. (2003) · Pattern Recognition · doi:10.1016/s0031-3203(02)00027-4 · Cited by 321
Prior learning and Gibbs reaction-diffusion
Zhu, S. C., & Mumford, D. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.632983 · Cited by 319
Structural matching by discrete relaxation
Wilson, R. C., & Hancock, E. R. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.601251 · Cited by 311
Stereo Matching Using Belief Propagation
Sun, J., Shum, H.-Y., & Zheng, N.-N. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47967-8_34 · Cited by 296
Stereo Correspondence by Dynamic Programming on a Tree
Veksler, O. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.334 · Cited by 295
Fast gradient-based methods for Bayesian reconstruction of transmission and emission PET images
Mumcuoglu, E. U., Leahy, R., Cherry, S. R., & Zhou, Z. (1994) · IEEE Transactions on Medical Imaging · doi:10.1109/42.363099 · Cited by 282
Metadata
- Authors
- Geiger, D., & Girosi, F.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1991-05
- Volume
- 13
- Issue
- 5
- Pages
- 401-412
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2020278873
- Cited by
- 447
- References
- 14
- FWCI
- 32.21
- Type
- journal article
- 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.