Structural Hashing: Efficient Three Dimensional Object Recognition
Abstract
An approach for the recognition of multiple three-dimensional object models from three-dimensional scene data is presented. The authors work on dense data, but neither the models nor the scene data have to be complete. The problem is addressed in a realistic environment: the viewpoint is arbitrary, the objects vary widely in complexity, and no assumptions about the structure of the surface are made. The approach is novel in that it uses two different types of primitives for matching: small surface patches, where differential properties can be reliably computed, and lines corresponding to depth or orientation discontinuities. These are represented by splashes and 3-D curves respectively. It is shown how both of these primitives can be encoded by a set of super segments, consisting of connected linear segments. These super segments are entered into a hash table, and provide the essential mechanism for fast retrieval and matching.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cite
Text
Stein and Medioni. "Structural Hashing: Efficient Three Dimensional Object Recognition." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1991. doi:10.1109/CVPR.1991.139696Markdown
[Stein and Medioni. "Structural Hashing: Efficient Three Dimensional Object Recognition." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1991.](https://mlanthology.org/cvpr/1991/stein1991cvpr-structural/) doi:10.1109/CVPR.1991.139696BibTeX
@inproceedings{stein1991cvpr-structural,
title = {{Structural Hashing: Efficient Three Dimensional Object Recognition}},
author = {Stein, Fridtjof and Medioni, Gérard G.},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {1991},
pages = {244-250},
doi = {10.1109/CVPR.1991.139696},
url = {https://mlanthology.org/cvpr/1991/stein1991cvpr-structural/}
}