Model group indexing for recognition
David T. Clemens, David W. C. Jacobs · 2002
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.>