English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30408
logo share SHARE   Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE
Exportar a otros formatos:


Distance measures between attributed graphs and second-order random graphs

AuthorsSerratosa, Francesc; Sanfeliu, Alberto
KeywordsPattern recognition
Pattern recognition systems
Issue Date2004
Citation10th Joint IAPR International Workshop on Structural, Syntactic and Statistical Pattern Recognition: p. 1135-1144 (2004)
AbstractThe aim of this article is to purpose a distance measure between Attributed Graphs (AGs) and Second-Order Random Graphs (SORGs) for recognition and classification proposes. The basic feature of SORGs is that they include both marginal probability functions and joint probability functions of graph elements (vertices or arcs). This allows a more precise description of both the structural and semantic information contents in a set (or cluster) of AGs and, consequently, an expected improvement in graph matching and object recognition. The distance measure is derived from the probability of instantiating a SORG into an AG. SORGs are shown to improve the performance of other random graph models such as FORGs and FDGs and also the direct AG-to-AG matching in two experimental recognition tasks.
DescriptionJoint IAPR International Workshop on Structural, Syntactic and Statistical Pattern Recognition (SSPR&SPR), 2004, Lisbon (Portugal)
Appears in Collections:(IRII) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
doc1.pdf399,68 kBAdobe PDFThumbnail
Show full item record
Review this work

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.