The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
PMF: A Stereo Correspondence Algorithm Using a Disparity Gradient Limit
Abstract
The advantages of solving the stereo correspondence problem by imposing a limit on the magnitude of allowable disparity gradients are examined. It is shown how the imposition of such a limit can provide a suitable balance between the twin requirements of disambiguating power and the ability to deal with a wide range of surfaces. Next, the design of a very simple stereo algorithm called PMF is described. In conjunction with certain other constraints used in many other stereo algorithms, PMF employs a limit on allowable disparity gradients of 1, a value that coincides with that reported for human stereoscopic vision. The excellent performance of PMF is illustrated on a series of natural and artificial stereograms. Finally, the differences between the theoretical justification for the use of disparity gradients for solving the stereo correspondence problems presented in the paper and others that exist in the stereo algorithm literature are discussed.
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
Marr, D., & Hildreth, E. (1980) · Proceedings of the Royal Society of London. Series B. Biological Sciences · doi:10.1098/rspb.1980.0020 · Cited by 6,510
A computational theory of human stereo vision
Marr, D., & Poggio, T. (1979) · Proceedings of the Royal Society of London. Series B. Biological Sciences · doi:10.1098/rspb.1979.0029 · Cited by 1,801
Scene Labeling by Relaxation Operations
Rosenfeld, A., Hummel, R. A., & Zucker, S. W. (1976) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1976.4309519 · Cited by 1,399
Marr, D., & Poggio, T. (1976) · Science · doi:10.1126/science.968482 · Cited by 1,377
Stereo by Intra- and Inter-Scanline Search Using Dynamic Programming
Ohta, Y., & Kanade, T. (1985) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1985.4767639 · Cited by 932
Psychophysical and computational studies towards a theory of human stereopsis
Mayhew, J. E. W., & Frisby, J. P. (1981) · Artificial Intelligence · doi:10.1016/0004-3702(81)90029-1 · Cited by 389
Self-citationDetection of binocular disparities
Prazdny, K. (1985) · Biological Cybernetics · doi:10.1007/bf00363999 · Cited by 254
Foundations of Cyclopean Perception
Pokorny, J. (1972) · American Journal of Ophthalmology · doi:10.1016/0002-9394(72)90151-1 · Cited by 200
The Computation of Binocular Edges
Mayhew, J. E. W., & Frisby, J. P. (1980) · Perception · doi:10.1068/p090069 · Cited by 63
Self-citationMayhew, J. E. W. (1983) · Springer series in information sciences · doi:10.1007/978-3-642-68888-1_14 · Cited by 11
Self-citation
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
Iterative point matching for registration of free-form curves and surfaces
Zhang, Z. (1994) · International Journal of Computer Vision · doi:10.1007/bf01427149 · Cited by 2,402
Modeling and rendering architecture from photographs: a hybrid geometry- and image-based approach
Debevec, P. E., Taylor, C. J., & Malik, J. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237191 · Cited by 1,905
Zhang, Z., Deriche, R., Faugeras, O., & Luong, Q.-T. (1995) · Artificial Intelligence · doi:10.1016/0004-3702(95)00022-4 · Cited by 1,367
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
Metadata
- Authors
- Pollard, S. B., Mayhew, J. E. W., & Frisby, J. P.
- Venue
- Perception
- Publisher
- SAGE Publications
- Published
- 1985-08
- Volume
- 14
- Issue
- 4
- Pages
- 449-470
- ISSN
- 0301-0066 (ISSN-L)
- 1468-4233
- OpenAlex
- W2054961868
- Cited by
- 473
- References
- 10
- FWCI
- 20.86
- 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.