By Topic

Contour shape matching by a constraint satisfaction network

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)
W. Watunyuta ; Center for Adv. Comput. Studies, Univ. of Southwestern Louisiana, Lafayette, LA, USA ; C. H. Chu

The contour shape-matching task is formulated as a constraint satisfaction problem and solved using a Hopfield net. Constraints that are intrinsic to the shape-matching task are coded in the network interconnection weights. Direct evidence obtained from the observed data, as gauged by a local shape measure, are provided as the external input to the network. The local shape measure used is based on an affine transformation model, which is a general class of mappings that includes the rigid body motion. Empirical results demonstrate the performance of this network when applied to match contours that have undergone rotation, scale change, translation, or combinations of these transformations. The network is shown to be capable of handling noisy data, as well as a reasonable amount of deformation resulting from object rotation in the three-dimensional space. The affine transformation can be generalized to match entire contour segments; hence the network is not confined to matching point patterns

Published in:

Systems, Man and Cybernetics, 1990. Conference Proceedings., IEEE International Conference on

Date of Conference:

4-7 Nov 1990