Space Efficient 3-D Model Indexing
Abstract
It is shown that the set of 2-D images produced by a group of 3-D point features of a rigid model can be optimally represented with two lines in two high-dimensional spaces. This result is used to match images and model groups by table lookup. The table is efficiently built and accessed through analytic methods that account for the effect of sensing error. In real images, it reduces the set of potential matches by a factor of several thousand. This representation of a model's images is used to analyze two other approaches to recognition. It is determined when invariants exist in several domains, and it is shown that there is an infinite set of qualitatively similar nonaccidental properties.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cite
Text
Jacobs. "Space Efficient 3-D Model Indexing." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1992. doi:10.1109/CVPR.1992.223153Markdown
[Jacobs. "Space Efficient 3-D Model Indexing." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1992.](https://mlanthology.org/cvpr/1992/jacobs1992cvpr-space/) doi:10.1109/CVPR.1992.223153BibTeX
@inproceedings{jacobs1992cvpr-space,
title = {{Space Efficient 3-D Model Indexing}},
author = {Jacobs, David W.},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {1992},
pages = {439-444},
doi = {10.1109/CVPR.1992.223153},
url = {https://mlanthology.org/cvpr/1992/jacobs1992cvpr-space/}
}