English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30205
logo share SHARE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:


Distance between attributed graphs and function-described graphs relaxing 2nd order restrictions

AuthorsAlquézar Mancho, Renato ; Serratosa, Francesc; Sanfeliu, Alberto
KeywordsPattern recognition
Pattern recognition systems
Issue Date2000
Citation8th Joint IAPR International Workshop on Structural, Syntactic and Statistical Pattern Recognition: 277-286 (2000)
AbstractFunction-Described Graphs (FDGs) have been introduced as a representation of an ensemble of Attributed Graphs (AGs) for structural pattern recognition and a distance measure using restrictions between AGs and FDGs has been reported. Nevertheless, in real applications, AGs can be distorted by some external noise, and therefore some constraints have to be relaxed. To gain more flexibility and robustness, some local costs may be added to the global cost of the labelling depending on the fulfilment of the graph element constraints of the FDG instead of applying hard binary constraints.
DescriptionJoint IAPR International Workshop on Structural, Syntactic and Statistical Pattern Recognition (SSPR&SPR), 2000, Alicante (España)
Appears in Collections:(IRII) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
doc1.pdf275,56 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.