Ara es mostren els items 1-19 de 19

  • 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 conductance electrical model for representing and matching weighted undirected graphs 

    Igelmo Ganzo, Manuel; Sanfeliu Cortés, Alberto; Ferrer Sumsi, Miquel (2010)
    Text en actes de congrés
    Accés obert
    In this paper we propose a conductance electrical model to represent weighted undirected graphs that allows us to efficiently compute approximate graph isomorphism in large graphs. The model is built by transforming a graph ...
  • 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 recursive embedding approach to median graph computation 

    Ferrer Sumsi, Miquel; Valveny, Ernest; Bunke, Horst (Springer Verlag, 2009-06-12)
    Capítol de llibre
    Accés obert
    The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Nevertheless, its computation is extremely ...
  • An approximate algorithm for median graph computation using graph embedding 

    Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc; Riesen, Kaspar; Bunke, Horst (Institute of Electrical and Electronics Engineers (IEEE), 2008)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for instance, how to obtain a representative of a ...
  • An iterative algorithm for approximate median graph computation 

    Ferrer Sumsi, Miquel; Bunke, Horst (Institute of Electrical and Electronics Engineers (IEEE), 2010)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    Recently, the median graph has been shown to be a good choice to obtain a representative of a given set of graphs. It has been successfully applied to graph-based classification and clustering. In this paper we exploit a ...
  • Application of graph embedding to solve graph matching problems 

    Valveny, Ernest; Ferrer Sumsi, Miquel (2008)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    Graphs have very interesting properties for object representation in pattern recognition. However, graph matching algorithms are usually computationally complex. In addition, graphs are harder to manipulate and operate ...
  • Aprendizaje cooperativo aplicado a la docencia de las asignaturas de programación en ingeniería informática 

    Ferrer Sumsi, Miquel; Benavente, Robert; Valveny, Ernest; Garcia-Barnés, Jaume; Lapedriza, A.; Sànchez, Gemma (2011)
    Text en actes de congrés
    Accés obert
    En este trabajo se presentan los resultados de la aplicación de la metodología del aprendizaje cooperativo a la docencia de dos asignaturas de programación en ingeniería informática. ‘Algoritmos y programación’ y ‘Lenguajes ...
  • Autonomous navigation for urban service mobile robots 

    Corominas Murtra, Andreu; Trulls Fortuny, Eduard; Sandoval Torres, Óscar; Perez Ibarz, Joan; Vasquez, Dizan; Mirats Tur, Josep Maria; Ferrer Sumsi, Miquel; Sanfeliu Cortés, Alberto (2010)
    Text en actes de congrés
    Accés obert
    We present to the robotic community a fully autonomous navigation solution for mobile robots operating in urban pedestrian areas. We introduce our robots and the experimental zone, overview the architecture of the navigation ...
  • Combination of OCR engines for page segmentation based on performance evaluation 

    Ferrer Sumsi, Miquel; Valveny, Ernest (Institute of Electrical and Electronics Engineers (IEEE), 2007)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    In this paper we present a method to improve the performance of individual page segmentation engines based on the combination of the output of several engines. The rules of combination are designed after analyzing the ...
  • Computing the barycenter graph by means of the graph edit distance 

    Bardaji Goikoetxea, Itziar; Ferrer Sumsi, Miquel; Sanfeliu Cortés, Alberto (2010)
    Text en actes de congrés
    Accés obert
    The barycenter graph has been shown as an alternative to obtain the representative of a given set of graphs. In this paper we propose an extension of the original algorithm which makes use of the graph edit distance in ...
  • Editorial for the special issue on graph-based representations in pattern recognition 

    Torsello, Andrea; Jiang, Xiaoyi; Ferrer Sumsi, Miquel (2012)
    Altres
    Accés restringit per política de l'editorial
  • Generalized median graph computation by means of graph embedding in vector spaces 

    Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc; Riesen, Kaspar; Bunke, Horst (2010)
    Article
    Accés restringit per política de l'editorial
    The median graph has been presented as a useful tool to represent a set of graphs. Nevertheless its computation is very complex and the existing algorithms are restricted to use limited amount of data. In this paper we ...
  • Generalized median string computation by means of string embedding in vector spaces 

    Jiang, Xiaoyi; Wentker, Jöran; Ferrer Sumsi, Miquel (2012-11-01)
    Article
    Accés restringit per política de l'editorial
    In structural pattern recognition the median string has been established as a useful tool to represent a set of strings. However, its exact computation is complex and of high computational burden. In this paper we propose ...
  • Graph-based k-means clustering: A comparison of the set versus the generalized median graph 

    Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc; Bardaji Goikoetxea, Itziar; Bunke, Horst (Springer Berlin / Heidelberg, 2009)
    Capítol de llibre
    Accés restringit per política de l'editorial
    In this paper we propose the application of the generalized median graph in a graph-based k-means clustering algorithm. In the graph-based k-means algorithm, the centers of the clusters have been traditionally represented ...
  • Median graph computation by means of a genetic approach based on minimum common supergraph and maximum common subraph 

    Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc (Springer Berlin / Heidelberg, 2009)
    Capítol de llibre
    Accés restringit per política de l'editorial
    Given a set of graphs, the median graph has been theoretically presented as a useful concept to infer a representative of the set. However, the computation of the median graph is a highly complex task and its practical ...
  • Median graph: a new exact algorithm using a distance based on the maximum common subgraph 

    Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc (2009)
    Article
    Accés restringit per política de l'editorial
    Median graphs have been presented as a useful tool for capturing the essential information of a set of graphs. Nevertheless, computation of optimal solutions is a very hard problem. In this work we present a new and more ...
  • Median graphs: a genetic approach based on new theoretical properties 

    Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc (2009)
    Article
    Accés restringit per política de l'editorial
    Given a set of graphs, the median graph has been theoretically presented as a useful concept to infer a representative of the set. However, the computation of the median graph is a highly complex task and its practical ...
  • Segmentation robust to the vignette effect for machine vision systems 

    Karatzas, D; Rusiñol, Marçal; Antens, Coen; Ferrer Sumsi, Miquel (Institute of Electrical and Electronics Engineers (IEEE), 2008)
    Text en actes de congrés
    Accés restringit per política de l'editorial
    The vignette effect (radial fall-off) is commonly encountered in images obtained through certain image acquisition setups and can seriously hinder automatic analysis processes. In this paper we present a fast and efficient ...