By Topic

Multiple shape recognition using pairwise geometric histogram based algorithms

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 $33
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

3 Author(s)

Pairwise geometric histogram (PGH) based algorithms have previously been shown to be a robust solution for the recognition of arbitrary 2D shapes in the presence of occlusion and scene clutter (Evans et al., 1993). The method is both statistically founded and complete in the sense that a shape may be reconstructed from its PGH representation (Riocreuz et al., 1994). The generality of this method has been further reinforced by an analysis of its scaleability which concludes that, if used appropriately, it is suitable for the recognition of very large numbers of objects (Ashbrook et al., 1995). The present authors demonstrate the application of PGHs to recognition tasks involving very large model training sets

Published in:

Image Processing and its Applications, 1995., Fifth International Conference on

Date of Conference:

4-6 Jul 1995