A Computational Approach to Edge Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fundamentals of digital image processing
Fundamentals of digital image processing
Computer graphics (2nd ed. in C): principles and practice
Computer graphics (2nd ed. in C): principles and practice
Shape measures for content based image retrieval: a comparison
Information Processing and Management: an International Journal
Trademark shape recognition using closed contours
Pattern Recognition Letters
Digital Design
Digital Image Processing
Content-based retrieval from trademark databases
Pattern Recognition Letters
A Neural Architecture for Fast Rule Matching
ANNES '95 Proceedings of the 2nd New Zealand Two-Stream International Conference on Artificial Neural Networks and Expert Systems
A binary neural k-nearest neighbour technique
Knowledge and Information Systems
Efficiency of chain codes to represent binary objects
Pattern Recognition
Pattern recognition and reading by machine
IRE-AIEE-ACM '59 (Eastern) Papers presented at the December 1-3, 1959, eastern joint IRE-AIEE-ACM computer conference
Identifying perceptual structures in trademark images
SPPRA '08 Proceedings of the Fifth IASTED International Conference on Signal Processing, Pattern Recognition and Applications
Shape feature matching for trademark image retrieval
CIVR'03 Proceedings of the 2nd international conference on Image and video retrieval
Hi-index | 0.01 |
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.