English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30186
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:


Clique-to-clique distance computation using a specific architecture

AuthorsCliment Vilaro, Juan; Grau Saldes, Antoni; Aranda López, Juan; Sanfeliu, Alberto
KeywordsPattern recognition
Pattern recognition systems
Issue Date1998
Citation7th Joint IAPR International Workshop on Structural, Syntactic and Statistical Pattern Recognition: 405-412 (1998)
AbstractIn this paper, we present a new fast architecture to compute the distance between cliques in different graphs. The distance obtained is used as a support function for graph labelling using probabilistic relaxation techniques. The architecture presented consists on a pipe-lined structure which computes the distance between an input clique and k reference cliques. The number of processing elements needed is m2, and the number of cycles required to compute the distance is ni (being m the number of external nodes in the input clique, and ni the number of external nodes in the i-th reference clique). The processing elements are very simple basic cells and very simple communication between them is needed, which makes it suitable for VLSI implementation.
DescriptionJoint IAPR International Workshop on Structural, Syntactic and Statistical Pattern Recognition (SSPR&SPR), 1998, Sydney (Australia)
Appears in Collections:(IRII) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
doc1.pdf598,74 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.