Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/2764
|
Título:
|
Computationally efficient graph matching via energy vector extraction
|
|
Autor/a:
|
Amato, Ariel; Al, Murad; Lladós, Josep; Gonzàlez, Jordi
|
|
Otros autores:
|
Institut de Robòtica i Informàtica Industrial |
|
Abstract:
|
This paper presents a method for graph matching based on domain knowledge by quantifying representative graph features. Our method searches and extracts the most relevant cues in different graphs. Once these cues are extracted and quantified, a new energy function is used to match the different graphs based on the obtained features values. This approach has been successfully applied for deformable template matching. As a result the error of matching is reduced, as well as the computational cost by efficiently selecting and grouping representative features. |
|
Abstract:
|
Peer Reviewed |
|
Materia(s):
|
-Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Processament del senyal::Processament de la imatge i del senyal vídeo
-Computer vision
-Visió per ordinador
-Classificació INSPEC::Pattern recognition::Computer vision |
|
Derechos:
|
|
|
Tipo de documento:
|
Objeto de conferencia |
|
Editor:
|
Springer
|
|
Compartir:
|
|
Mostrar el registro completo del ítem
