Location of Repository

A binary neural shape matcher using Johnson Counters and chain codes

By V.J. Hodge, S. O'Keefe and J. Austin


Images may be matched as whole images or using shape matching. Shape matching requires: identifying edges in the image, finding shapes using the edges and representing the shapes using a suitable metric. A Laplacian edge detector is simple and efficient for identifying the edges of shapes. Chain codes describe shapes using sequences of numbers and may be matched simply, accurately and flexibly. We couple this with the efficiency of a binary associative-memory neural network. We demonstrate shape matching using the neural network to index and match chain codes where the chain code elements are represented by Johnson codes

Topics: 1702, 1706, 2805
Year: 2009
DOI identifier: 10.1016/j.neucom.2008.07.013
OAI identifier: oai:eprints.whiterose.ac.uk:5431

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.