Distributed Associative Memory (DAM) for Bin-Picking

  • Authors:
  • H. Wechsler;G. L. Zimmerman

  • Affiliations:
  • George Mason Univ., Fairfax, VA;Univ. of Minnesota, Minneapolis, MN

  • Venue:
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • Year:
  • 1989

Quantified Score

Hi-index 0.14

Visualization

Abstract

The feasibility of using a distributed associative memory as the recognition component for a bin-picking system is established. The system displays invariance to metric distortions and a robust response in the presence of noise, occlusions, and faults. Although the system is primarily concerned with two-dimensional problems, eight extensions to the system allow the three-dimensional bin-picking problem to be addressed. It is noted that there are implicit weaknesses in the neural network model chosen for the heart of the recognition system. The distributed associative memory used is linear, and as a result there are certain desirable properties that cannot be exhibited by the computer vision system.