Direct multi-resolution estimation of ego-motion and structure from motion
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
The paper describes an iterative algorithm that estimates the motion of a camera through an environment directly from brightness derivatives of an image pair. A global ego-motion constraint is combined with the local brightness constancy constraint to relate local surface models with the global ego-motion model and local brightness derivatives. In an iterative process, the author first refines the local surface models using the ego-motion as a constraint, and then refines the ego-motion model using the local surface models as constraints. He performs this analysis at multiple resolutions. He shows how information from local corner-like and edge-like image structures contribute to the refinement of the global ego-motion estimate, and how the ego-motion constraint can help resolve local motion ambiguities that arise from the aperture problem. Results of the algorithm are shown on uncalibrated outdoor image sequences, and also on a computer-rendered image sequence.>
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
The Laplacian pyramid as a compact image code
Burt, P., & Adelson, E. (1983) · IEEE Transactions on Communications · doi:10.1109/tcom.1983.1095851 · Cited by 6,077
Research works printed but not linked: 11
- 10.1109/TPAMI.1987.4767897 · DOI · Paper page
- 10.1016/0004-3702(87)90041-5 · DOI
- 10.1109/TPAMI.1987.4767884 · DOI
- 10.1007/BF00137442 · DOI
- burt, 1990, Proc IEEE Int Workshop Intelligent Motion Control, ip75
- 10.1109/WVM.1991.212808 · DOI
- bergen, 1990, Dynamic Multiple-Motion Computation, Proc 7th Israeli Conf on Artificial Intelligence and Image Processing, 149
- heel, 1990, Direct estimation of structure and motion from multiple frames
- 10.1109/ICCV.1990.139502 · doi:10.1109/iccv.1990.139502
- 10.1109/TPAMI.1985.4767678 · DOI · Paper page
- horn, 1986, Robot Vision
Cited by
A Database and Evaluation Methodology for Optical Flow
Baker, S., Scharstein, D., Lewis, J. P., Roth, S., Black, M. J., & Szeliski, R. (2011) · International Journal of Computer Vision · doi:10.1007/s11263-010-0390-2 · Cited by 2,205
“These constraints have both been strictly enforced [1, 29,52] and added as a soft prior [78,79].”
BackgroundThe computation of optical flow
Beauchemin, S. S., & Barron, J. L. (1995) · ACM Computing Surveys · doi:10.1145/212094.212141 · Cited by 1,278
Hierarchical model-based motion estimation
Bergen, J. R., Anandan, P., Hanna, K. J., & Hingorani, R. (1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-55426-2_27 · Cited by 1,154
Self-citationA Database and Evaluation Methodology for Optical Flow
Baker, S., Roth, S., Scharstein, D., Black, M. J., Lewis, J. P., & Szeliski, R. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408903 · Cited by 618
Handling occlusions in dense multi-view stereo
Kang, S. B., Szeliski, R., & Chai, J. (2005) · Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001 · doi:10.1109/cvpr.2001.990462 · Cited by 353
Metadata
- Authors
- Hanna, K. J.
- Venue
- Proceedings of the IEEE Workshop on Visual Motion
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-12-10
- Pages
- 156-162
- OpenAlex
- W2126545287
- Cited by
- 83
- References
- 1
- FWCI
- 5.43
- Type
- conference paper
- 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.