Model Group Indexing for Recognition

Abstract

It is shown that an index space can be a powerful tool for reducing the image-model match search by a factor of k/sup G-3/, but only when accompanied by some mechanism, such as grouping, that prevents the system from having to consider all matches between image groups of size G and model groups of size G. It is also shown that if image groups are to index a single point at recognition time, then the index space must contain pointers to each model group over a 2-D sheet, and should therefore be 2G-4 dimensional. A simple indexing system has been implemented to demonstrate these concepts, and a series of experiments have been conducted to investigate the tradeoffs between space and time. They indicate that the speedups are achievable, but require a large amount of space.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Cite

Text

Clemens and Jacobs. "Model Group Indexing for Recognition." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1991. doi:10.1109/CVPR.1991.139652

Markdown

[Clemens and Jacobs. "Model Group Indexing for Recognition." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1991.](https://mlanthology.org/cvpr/1991/clemens1991cvpr-model/) doi:10.1109/CVPR.1991.139652

BibTeX

@inproceedings{clemens1991cvpr-model,
  title     = {{Model Group Indexing for Recognition}},
  author    = {Clemens, David T. and Jacobs, David W.},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1991},
  pages     = {4-9},
  doi       = {10.1109/CVPR.1991.139652},
  url       = {https://mlanthology.org/cvpr/1991/clemens1991cvpr-model/}
}