The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Computational Experiments with a Feature Based Stereo Algorithm
Open accessAbstract
Computational models of the human stereo system can provide insight into general information processing constraints that apply to any stereo system, either artificial or biological. In 1977 Marr and Poggio proposed one such computational model, which was characterized as matching certain feature points in difference-of-Gaussian filtered images and using the information obtained by matching coarser resolution representations to restrict the search space for matching finer resolution representations. An implementation of the algorithm and its testing on a range of images was reported in 1980. Since then a number of psychophysical experiments have suggested possible refinements to the model and modifications to the algorithm. As well, recent computational experiments applying the algorithm to a variety of natural images, especially aerial photographs, have led to a number of modifications. In this paper, we present a version of the Marr-Poggio-Grimson algorithm that embodies these modifications, and we illustrate its performance on a series of natural 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
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
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
Obstacle avoidance and navigation in the real world by a seeing robot rover
Moravec, H. (2018) · KiltHub Repository · doi:10.1184/r1/6557033 · Cited by 842
Finding Edges and Lines in Images
Canny, J. (1983) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 833
Barnard, S. T., & Thompson, W. B. (1980) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1980.4767032 · Cited by 793
Towards automatic visual obstacle avoidance
Morevec, H. P. (1977) · International Joint Conference on Artificial Intelligence · Cited by 754
Binocular Depth Perception of Computer-Generated Patterns
Julesz, B. (1960) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1960.tb03954.x · Cited by 731
A four mechanism model for threshold spatial vision
Wilson, H. R., & Bergen, J. R. (1979) · Vision Research · doi:10.1016/0042-6989(79)90117-2 · Cited by 714
Multiresolution Image Processing and Analysis
Rosenfeld, A. (1984) · Springer series in information sciences · doi:10.1007/978-3-642-51590-3 · Cited by 662
Cited by
A theory for multiresolution signal decomposition: the wavelet representation
Mallat, S. G. (1989) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.192463 · Cited by 21,372
A robust layered control system for a mobile robot
Brooks, R. (1986) · IEEE Journal on Robotics and Automation · doi:10.1109/jra.1986.1087032 · Cited by 7,799
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
“Three-dimensional support functions that have been proposed include limited disparity difference [33], limited disparity gradient [56], and Prazdny’s coherence principle [57].”
BackgroundIterative 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
Multifrequency channel decompositions of images and wavelet models
Mallat, S. G. (1989) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.45554 · Cited by 1,955
SIFT Flow: Dense Correspondence across Scenes and Its Applications
Liu, C., Yuen, J., & Torralba, A. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.147 · Cited by 1,582
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
A computational framework and an algorithm for the measurement of visual motion
Anandan, P. (1989) · International Journal of Computer Vision · doi:10.1007/bf00158167 · Cited by 1,073
A stereo matching algorithm with an adaptive window: theory and experiment
Kanade, T., & Okutomi, M. (1994) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.310690 · Cited by 1,068
Okutomi, M., & Kanade, T. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.206955 · Cited by 939
Structure from stereo-a review
Dhond, U. R., & Aggarwal, J. K. (1989) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.44067 · Cited by 867
Zero-crossings of a wavelet transform
Mallat, S. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.86995 · Cited by 704
The computation of visible-surface representations
Terzopoulos, D. (1988) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.3908 · Cited by 450
Depth Discontinuities by Pixel-to-Pixel Stereo
Birchfield, S., & Tomasi, C. (1999) · International Journal of Computer Vision · doi:10.1023/a:1008160311296 · Cited by 417
Mallat, S. (1996) · Proceedings of the IEEE · doi:10.1109/5.488702 · Cited by 316
Surfaces from stereo: integrating feature matching, disparity estimation, and contour detection
Hoff, W., & Ahuja, N. (1989) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.16709 · Cited by 298
Stereo disparity computation using Gabor filters
Sanger, T. D. (1988) · Biological Cybernetics · doi:10.1007/bf00336114 · Cited by 284
Ma, J., Qiu, W., Zhao, J., Ma, Y., Yuille, A. L., & Tu, Z. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2388434 · Cited by 280
Metadata
- Authors
- Grimson, W. E. L.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1985-01
- Volume
- PAMI-7
- Issue
- 1
- Pages
- 17-34
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2102071159
- Cited by
- 529
- References
- 25
- FWCI
- 26.38
- 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.