Pasar al contenido principal

TECNICAS INTERACTIVAS Y ADAPTATIVAS PARA SISTEMAS AUTOMATICOS DE RECONOCIMIENTO, APRENDIZAJE Y PERCEPCION

TIN2009-14205-C04-01

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2009
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario UNIVERSIDAD DE ALICANTE
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

Resultados totales (Incluyendo duplicados): 4
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Capítulo o parte de un libro (BookPart)

Structural graph extraction from images

  • Gallego-Sánchez, Antonio-Javier
  • Calera Rubio, Jorge
  • López Rodríguez, Damián|||0000-0003-3633-3862
We present three new algorithms to model images with graph primitives. Our main goal is to propose algorithms that could lead to a broader use of graphs, especially in pattern recognition tasks. The first method considers the q-tree representation and the neighbourhood of regions. We also propose a method which, given any region of a q-tree, finds its neighbour regions. The second algorithm reduces the image to a structural grid. This grid is postprocessed in order to obtain a directed acyclic graph. The last method takes into account the skeleton of an image to build the graph. It is a natural generalization of similar works on trees [8, 12]. Experiments show encouraging results and prove the usefulness of the proposed models in more advanced tasks, such as syntactic pattern recognition tasks., This work is partially supported by Spanish MICINN (contract TIN2011-28260-C03-01, contract TIN2009-14205-C04-C1) and CONSOLIDER-INGENIO 2010 (contract CSD2007-00018)
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Inference of k-Testable Directed Acyclic Graph Languages

  • López Rodríguez, Damián|||0000-0003-3633-3862
  • Calera Rubio, Jorge
  • Gallego-Sánchez, Antonio-Javier
In this paper, we tackle the task of graph language learning. We first extend the well-known classes of k-testability and k-testability in the strict sense languages to directed graph languages. Second, we propose a graph automata model for directed acyclic graph languages. This graph automata model is used to propose a grammatical inference algorithm to learn the class of directed acyclic k-testable in the strict sense graph languages. The algorithm runs in polynomial time and identifies this class of languages from positive data., Damián López is partially supported by the Spanish Ministerio de Economía y Competitividad under research project TIN2011-28260-C03-01. Jorge Calera-Rubio and Antonio-Javier Gallego-Sánchez thank the Spanish CICyT for partial support of this work through project TIN2009-14205-C04-01, the IST Programme of the European Community, under the PASCAL Network of Excellence, IST-2002-506778, and the program CONSOLIDER INGENIO2010 (CSD2007-00018).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Capítulo o parte de un libro (BookPart)

Interactive structured output prediction: Application to chromosome classification

  • Oncina Carratalá, José
  • Vidal, Enrique|||0000-0003-4579-5196
Interactive Pattern Recognition concepts and techniques are applied to problems with structured output; i.e., problems in which the result is not just a simple class label, but a suitable structure of labels. For illustration purposes (a simplification of) the problem of Human Karyotyping is considered. Results show that a) taking into account label dependencies in a karyogram significantly reduces the classical (non-interactive) chromosome label prediction error rate and b) they are further improved when interactive processing is adopted. c Springer-Verlag Berlin Heidelberg 2011, Work supported by the MIPRCV Spanish MICINN “Consolider Ingenio 2010” program (CSD2007-00018). Work supported by the Spanish CICyT through project TIN2009-14205-C04-01. This work was supported in part by the IST Programme of the European Community, under the PASCAL2 Network of Excellence, IST-2007- 216886.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

An improved fast edit approach for two-string approximated mean computation applied to OCR

  • Abreu Salas, José Ignacio
  • Rico-Juan, Juan Ramón
  • Abreu Salas, José Ignacio|||/items/99fd9ec6-0b97-4c02-a28e-98bc309cff48
  • Rico-Juan, Juan Ramón|||/items/ab906fc8-ea97-4172-a38d-6eb429e9dc84
This paper presents a new fast algorithm for computing an approximation to the mean of two strings of characters representing a 2D shape and its application to a new Wilson-based editing procedure. The approximate mean is built up by including some symbols from the two original strings. In addition, a Greedy approach to this algorithm is studied, which allows us to reduce the time required to compute an approximate mean. The new dataset editing scheme relaxes the criterion for deleting instances proposed by the Wilson editing procedure. In practice, not all instances misclassified by their near neighbors are pruned. Instead, an artificial instance is added to the dataset in the hope of successfully classifying the instance in the future. The new artificial instance is the approximated mean of the misclassified sample and its same-class nearest neighbor. Experiments carried out over three widely known databases of contours show that the proposed algorithm performs very well when computing the mean of two strings, and outperforms methods proposed by other authors. In particular, the low computational time required by the heuristic approach makes it very suitable when dealing with long length strings. Results also show that the proposed preprocessing scheme can reduce the classification error in about 83% of trials. There is empirical evidence that using the Greedy approximation to compute the approximated mean does not affect the performance of the editing procedure.