2D shape classification and retrieval

Authors:
Graham McNeill;Sethu Vijayakumar
Affiliations:
Institute of Perception, Action and Behavior, School of Informatics, University of Edinburgh, Edinburgh, UK;Institute of Perception, Action and Behavior, School of Informatics, University of Edinburgh, Edinburgh, UK
Venue:
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Year:
2005

Citing 4
Cited 7

A shape recognition scheme based on relative distances of feature points from the centroid

Pattern Recognition
Shape Matching and Object Recognition Using Shape Contexts

IEEE Transactions on Pattern Analysis and Machine Intelligence
Multiscale Fourier Descriptor for Shape Classification

ICIAP '03 Proceedings of the 12th International Conference on Image Analysis and Processing
Fast correspondence-based system for shape retrieval

Pattern Recognition Letters

A fast evaluation criterion for the recognition of occluded shapes

Robotics and Autonomous Systems
Detection and recognition of contour parts based on shape similarity

Pattern Recognition
Numismatic Object Identification Using Fusion of Shape and Local Descriptors

ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Saliency-based automatic target detection in forward looking infrared images

ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Shape analysis for power signal cryptanalysis on secure components

Journal of Systems and Software
Shape classification via image-based multiscale description

Pattern Recognition
Shape retrieval with qualitative relations: the influence of part-order and approximation precision on retrieval performance and computational effort

KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a novel correspondence-based technique for efficient shape classification and retrieval. Shape boundaries are described by a set of (ad hoc) equally spaced points - avoiding the need to extract "landmark points". By formulating the correspondence problem in terms of a simple generative model, we are able to efficiently compute matches that incorporate scale, translation, rotation and reflection invariance. A hierarchical scheme with likelihood cut-off provides additional speed-up. In contrast to many shape descriptors, the concept of a mean (prototype) shape follows naturally in this setting. This enables model based classification, greatly reducing the cost of the testing phase. Equal spacing of points can be defined in terms of either perimeter distance or radial angle. It is shown that combining the two leads to improved classification/ retrieval performance.