The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Stereo by Intra- and Inter-Scanline Search Using Dynamic Programming
Abstract
This paper presents a stereo matching algorithm using the dynamic programming technique. The stereo matching problem, that is, obtaining a correspondence between right and left images, can be cast as a search problem. When a pair of stereo images is rectified, pairs of corresponding points can be searched for within the same scanlines. We call this search intra-scanline search. This intra-scanline search can be treated as the problem of finding a matching path on a two-dimensional (2D) search plane whose axes are the right and left scanlines. Vertically connected edges in the images provide consistency constraints across the 2D search planes. Inter-scanline search in a three-dimensional (3D) search space, which is a stack of the 2D search planes, is needed to utilize this constraint. Our stereo matching algorithm uses edge-delimited intervals as elements to be matched, and employs the above mentioned two searches: one is inter-scanline search for possible correspondences of connected edges in right and left images and the other is intra-scanline search for correspondences of edge-delimited intervals on each scanline pair. Dynamic programming is used for both searches which proceed simultaneously: the former supplies the consistency constraint to the latter while the latter supplies the matching score to the former. An interval-based similarity metric is used to compute the score. The algorithm has been tested with different types of images including urban aerial images, synthesized images, and block scenes, and its computational requirement has been 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
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Barnard, S. T., & Fischler, M. A. (1982) · ACM Computing Surveys · doi:10.1145/356893.356896 · Cited by 713
The HARPY speech recognition system
Lowerre, B. T. (1976) · Cited by 474
Depth from edge and intensity based stereo
Baker, H. H., & Binford, T. O. (1981) · Defense Technical Information Center (DTIC) · Cited by 401
Medioni, G., & Nevatia, R. (1985) · Computer Vision, Graphics, and Image Processing · doi:10.1016/s0734-189x(85)80073-6 · Cited by 371
VISUAL MAPPING BY A ROBOT ROVER
Moravec, H. (1979) · International Joint Conference on Artificial Intelligence · Cited by 290
A computer implementation of a theory of human stereo vision
Grimson, W. E. L. (1981) · Philosophical Transactions of the Royal Society of London. B, Biological Sciences · doi:10.1098/rstb.1981.0031 · Cited by 267
O'Kennedy, B. (2002) · SUNScholar (Stellenbosch University) · Cited by 76
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
Sonar-based real-world mapping and navigation
Elfes, A. (1987) · IEEE Journal on Robotics and Automation · doi:10.1109/jra.1987.1087096 · Cited by 1,397
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
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
Metadata
- Authors
- Ohta, Y., & Kanade, T.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1985-03
- Volume
- PAMI-7
- Issue
- 2
- Pages
- 139-154
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W1977948323
- Cited by
- 932
- References
- 8
- FWCI
- 30.06
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Stereo by Intra- and Inter-Scanline Search Using Dynamic Programming. https://app.cochat.ai/papers/10.1109/tpami.1985.4767639
- The paper
- Ohta, Y., & Kanade, T. (1985). Stereo by Intra- and Inter-Scanline Search Using Dynamic Programming. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/tpami.1985.4767639
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.
