Exploració per tema "graph matching"

Ara es mostren els items 1-6 de 6

    • A comparison between two representatives of a set of graphs: median vs barycenter graph 

      Bardaji Goikoetxea, Itziar; Ferrer Sumsi, Miquel; Sanfeliu Cortés, Alberto (Springer Verlag, 2010)
      Text en actes de congrés
      Accés obert
      In this paper we consider two existing methods to generate a representative of a given set of graphs, that satisfy the following two conditions. On the one hand, that they are applicable to graphs with any kind of labels ...

    • A generic framework for median graph computation based on a recursive embedding approach 

      Ferrer Sumsi, Miquel; Karatzas, D; Valveny, Ernest; Bardaji Goikoetxea, Itziar; Bunke, Horst (2011)
      Article
      Accés obert
      The median graph has been shown to be a good choice to obtain a representative of a set of graphs. However, its computation is a complex problem. Recently, graph embedding into vector spaces has been proposed to obtain ...

    • A multi-resolution approach for spectral graph matching 

      González Navarro, Víctor (Universitat Politècnica de Catalunya, 2018-08)
      Treball Final de Grau
      Accés obert
      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 ...

    • Compact form of the pseudo-inverse matrix in the approximation of a star graph using the conductance electrical model (CEM) 

      Igelmo Ganzo, Manuel; Sanfeliu Cortés, Alberto (2012)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      The Conductance Electrical Model (CEM) translate a graph into a circuit. After applying the model, in many cases, it is necessary to approximate the circuit obtained by a star circuit and this requires the calculation ...

    • Non-rigid graph registration using active testing search 

      Serradell, Eduard; Amável Pinheiro, Miguel; Sznitman, Raphael; Kybic, Jan; Moreno-Noguer, Francesc; Fua, Pascal (2015)
      Article
      Accés obert
      We present a new approach for matching sets of branching curvilinear structures that form graphs embedded in R^2 or R^3 and may be subject to deformations. Unlike earlier methods, ours does not rely on local appearance ...

    • Robust non-rigid registration of 2D and 3D graphs 

      Serradell, Eduard; Glowacki, Przemyslaw; Jan, Kybic; Moreno-Noguer, Francesc; Fua, Pascal (2012)
      Text en actes de congrés
      Accés obert
      We present a new approach to matching graphs embedded in R2 or R3. Unlike earlier methods, our approach does not rely on the similarity of local appearance features, does not require an initial alignment, can handle partial ...