Object indexing using an iconic sparse distributed memory

Rajesh P. N. Rao, D.h. Ballard

Abstract

A general-purpose object indexing technique is described that combines the virtues of principal component analysis with the favorable matching properties of high-dimensional spaces to achieve high-precision recognition. An object is represented by a set of high-dimensional iconic feature vectors comprised of the responses of derivatives of Gaussian filters at a range of orientations and scales. Since these filters can be shown to form the eigenvectors of arbitrary images containing both natural and man-made structures, they are well-suited for indexing in disparate domains. The indexing algorithm uses an active vision system in conjunction with a modified form of Kanerva's (1988, 1993) sparse distributed memory which facilitates interpolation between views and provides a convenient platform for learning the association between an object's appearance and its identity. The robustness of the indexing method was experimentally confirmed by subjecting the method to a range of viewing conditions and the accuracy was verified using a well-known model database containing a number of complex 3D objects under varying pose.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>
BibTeX
@inproceedings{rao1995object,
  author = {Rajesh P. N. Rao and D.H. Ballard},
  title = {{Object indexing using an iconic sparse distributed memory}},
  booktitle = {IEEE/CVF International Conference on Computer Vision},
  year = {1995},
  url = {https://openreview.net/forum?id=r1bGx-fuZr},
}

Loading related content...

Figure