Ara es mostren els items 12-19 de 19

    • 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 ...