By Topic

High-order attention-shifting networks for relational structure matching

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
K. R. Miller ; Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA ; P. Zunde

The Hopfield-Tank optimization network has been applied to the model-image matching problem in computer vision using a graph matching formulation. However, the network has been criticized for unreliable convergence to feasible solutions and for poor solution quality, and the graph matching formulation is unable to represent matching problems with multiple object types, and multiple relations, and high-order relations. The Hopfield-Tank network dynamics is generalized to provide a basis for reliable convergence to feasible solutions, for finding high-quality solutions, and for solving a broad class of optimization problems. The extensions include a new technique called attention-shifting, the introduction of high-order connections in the network, and relaxation of the unit hypercube restriction

Published in:

Neural Networks, 1992. IJCNN., International Joint Conference on  (Volume:4 )

Date of Conference:

7-11 Jun 1992