By Topic

Sensitivity analysis for object recognition from large structural libraries

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
$31 $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)
Huet, B. ; Dept. of Comput. Sci., York Univ., UK ; Hancock, E.R.

The paper studies the structural sensitivity of line pattern recognition using shape graphs. We compare the recognition performance for four different algorithms. Each algorithm uses a set of pairwise geometric attributes and a neighbourhood graph to represent the structure of the line patterns. The first algorithm uses a pairwise geometric histogram, the second uses a relational histogram on the edges of the shape graph, the third compares the set of attributes on the edges of the shape graph and the final algorithm compares the arrangement of line correspondences using graph matching. The different algorithms are compared under line deletion, line addition, line fragmentation and line end point measurement errors. It is the graph matching algorithm which proves to be the most effective

Published in:

Computer Vision, 1999. The Proceedings of the Seventh IEEE International Conference on  (Volume:2 )

Date of Conference:

1999