The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Probabilistic Solution of Ill-Posed Problems in Computational Vision
Open accessAbstract
Computational vision is a set of inverse problems. We review standard regularization theory, discuss its limitations, and present new stochastic (in particular, Bayesian) methods for their solution. We derive efficient algorithms and describe parallel implementations on digital parallel SIMD architectures, as well as a new class of parallel hybrid computers.
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
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
Cited by
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
Networks for approximation and learning
Poggio, T., & Girosi, F. (1990) · Proceedings of the IEEE · doi:10.1109/5.58326 · Cited by 3,252
Self-citationConstrained restoration and the recovery of discontinuities
Geman, D., & Reynolds, G. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.120331 · Cited by 1,085
A 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
Using dynamic programming for solving variational problems in vision
Amini, A. A., Weymouth, T. E., & Jain, R. C. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.57681 · Cited by 1,008
Metadata
- Authors
- Marroquin, J., Mitter, S., & Poggio, T.
- Venue
- Journal of the American Statistical Association
- Publisher
- Informa UK Limited
- Published
- 1987-03
- Volume
- 82
- Issue
- 397
- Pages
- 76-89
- ISSN
- 0162-1459 (ISSN-L)
- 1537-274X
- OpenAlex
- W2019635781
- Cited by
- 766
- References
- 1
- FWCI
- 37.30
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Probabilistic Solution of Ill-Posed Problems in Computational Vision. https://app.cochat.ai/papers/10.1080/01621459.1987.10478393
- The paper
- Marroquin, J., Mitter, S., & Poggio, T. (1987). Probabilistic Solution of Ill-Posed Problems in Computational Vision. Journal of the American Statistical Association. https://doi.org/10.1080/01621459.1987.10478393
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.
