Mostra el registre d'ítem simple
A multi-resolution approach for spectral graph matching
dc.contributor | Salembier Clairon, Philippe Jean |
dc.contributor | Ortega Redondo, Juan Antonio |
dc.contributor.author | González Navarro, Víctor |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions |
dc.date.accessioned | 2019-02-08T10:10:24Z |
dc.date.available | 2019-02-08T10:10:24Z |
dc.date.issued | 2018-08 |
dc.identifier.uri | http://hdl.handle.net/2117/128766 |
dc.description.abstract | This project presents an innovative way of solving the inexact graph matching problem of weighted graphs. The goal is to find the correspondence between the vertices of two similar graphs. This problem is solved through a multi-resolution approach in the spectral domain. Spectral graph matching provides a framework that allows to represent both graphs in a different dimensional space where the problem is more tractable. Furthermore, the multi-resolution approach improves the performance of the graph matching algorithm, since lower resolutions reveal new structural patterns. To obtain lower resolutions of both graphs, the proposed graph downsampling methods must make sure that the vertices selected for the lower resolutions should be the ones that are more likely to be correctly matched. If this property is not accomplished, the matching in this lower resolution will not provide useful information for the final matching. A novel solution to common challenges in graph matching, i.e, sign ambiguity of the eigenvectors, are provided in order to improve the correspondence between the vertices of both graphs. Different graph matching applications are presented to illustrate the effectiveness of the proposed technique. A comparison with other spectral graph matching algorithms demonstrates the benefits of the proposed approach. |
dc.language.iso | eng |
dc.publisher | Universitat Politècnica de Catalunya |
dc.rights | S'autoritza la difusió de l'obra mitjançant la llicència Creative Commons o similar 'Reconeixement-NoComercial- SenseObraDerivada' |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Enginyeria de la telecomunicació |
dc.subject.lcsh | Artificial intelligence |
dc.subject.lcsh | Signal processing -- Digital techniques |
dc.subject.other | spectral graph theory |
dc.subject.other | multi-resolution systems |
dc.subject.other | point-clouds |
dc.subject.other | graph matching |
dc.subject.other | graph signal processing |
dc.subject.other | 3D matching |
dc.title | A multi-resolution approach for spectral graph matching |
dc.type | Bachelor thesis |
dc.subject.lemac | Algorismes bidimensionals |
dc.subject.lemac | Intel·ligència artificial |
dc.subject.lemac | Tractament del senyal -- Tècniques digitals |
dc.identifier.slug | ETSETB-230.134480 |
dc.rights.access | Open Access |
dc.date.updated | 2019-01-21T06:50:38Z |
dc.audience.educationlevel | Grau |
dc.audience.mediator | Escola Tècnica Superior d'Enginyeria de Telecomunicació de Barcelona |
dc.audience.degree | GRAU EN ENGINYERIA DE TECNOLOGIES I SERVEIS DE TELECOMUNICACIÓ (Pla 2015) |