logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Relational object recognition from large structural libraries

delete2002-09-01
delete23
PRE
AI
B
Benoît Huet
E
Edwin R. Hancock
DOI：10.1016/S0031-3203(01)00172-8delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
This paper presents a probabilistic similarity measure for object recognition from large libraries of line-patterns. We commence from a structural pattern representation which uses a nearest neighbour graph to establish the adjacency of line-segments. Associated with each pair of line-segments connected in this way is a vector of Euclidean invariant relative angle and distance ratio attributes. The relational similarity measure uses robust error kernels to compare sets of pairwise attributes on the edges of a nearest neighbour graph. We use the relational similarity measure in a series of recognition experiments which involve a library of over 2500 line-patterns. A sensitivity study reveals that the method is capable of delivering a recognition accuracy of 94%. A comparative study reveals that the method is most effective when either a Gaussian kernel or Huber's robust kernel is used to weight the attribute relations. Moreover, the method consistently outperforms the standard and the quantile Hausdorff distance. (C) 2002 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
Keywords:
image retrieval
relational graphs
Hansdorf distance
robust statistics
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Pattern Recognition cover
Pattern Recognition
IF:
7.6
Papers:
1.3W
Citations:
4.5W

Organization

No organization information available