Exploració per autor "Valveny, Ernest"

Ara es mostren els items 6-11 de 11

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

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

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