Pasar al contenido principal

INVESTIGACION AVANZADA EN TECNOLOGIAS DEL HABLA PARA APLICACION A ENTORNOS AUDIOVISUALES

TEC2012-38939-C03-02

•
Nombre agencia financiadora Ministerio de Economía y Competitividad
Acrónimo agencia financiadora MINECO
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 2012
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Secretaría de Estado de Investigación, Desarrollo e Innovación
Centro beneficiario UNIVERSITAT POLITECNICA DE CATALUNYA
Identificador persistente http://dx.doi.org/10.13039/501100003329

Resultados relacionados

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

UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Quantification of survey expectations by means of symbolic regression via genetic programming to estimate economic growth in central and eastern european economies

  • Claveria, Oscar
  • Monte Moreno, Enrique|||0000-0002-4907-0494
  • Torra Porras, Salvador
Tendency surveys are the main source of agents' expectations. This study has a twofold aim. First, it proposes a new method to quantify survey-based expectations by means of symbolic regression (SR) via genetic programming. Second, it combines the main SR-generated indicators to estimate the evolution of GDP, obtaining the best results for the Czech Republic and Hungary. Finally, it assesses the impact of the 2008 financial crisis, finding that the capacity of agents' expectations to anticipate economic growth in most Central and Eastern European economies improved after the crisis., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Work-efficient parallel non-maximum suppression kernels

  • Oro García, David
  • Fernandez Tena, Carles
  • Martorell Bofill, Xavier|||0000-0002-0417-3430
  • Hernando Pericás, Francisco Javier|||0000-0002-1730-8154
In the context of object detection, sliding-window classifiers and single-shot convolutional neural network (CNN) meta-architectures typically yield multiple overlapping candidate windows with similar high scores around the true location of a particular object. Non-maximum suppression (NMS) is the process of selecting a single representative candidate within this cluster of detections, so as to obtain a unique detection per object appearing on a given picture. In this paper, we present a highly scalable NMS algorithm for embedded graphics processing unit (GPU) architectures that is designed from scratch to handle workloads featuring thousands of simultaneous detections on a given picture. Our kernels are directly applicable to other sequential NMS algorithms such as FeatureNMS, Soft-NMS or AdaptiveNMS that share the inner workings of the classic greedy NMS method. The obtained performance results show that our parallel NMS algorithm is capable of clustering 1024 simultaneous detected objects per frame in roughly 1 ms on both Tegra X1 and Tegra X2 on-die GPUs, while taking 2 ms on Tegra K1. Furthermore, our proposed parallel greedy NMS algorithm yields a 14–40x speed up when compared to state-of-the-art NMS methods that require learning a CNN from annotated data., This work has been partially supported by the Ministerio de Economía y Competitividad under contracts (TIN2015-65316-P, TEC2012-38939-C03-02), the Departament d’Innovació, Universitats i Empresa de la Generalitat de Catalunya under project MPEXPAR: Models de Programació i Entorns d’Execució Paral·lels (2014-SGR-1051), and the European Commission under the Horizon 2020 program (H2020-ICT-644312)., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Work-efficient parallel non-maximum suppression kernels

  • Oro García, David
  • Fernandez Tena, Carles
  • Martorell Bofill, Xavier
  • Hernando Pericás, Francisco Javier
In the context of object detection, sliding-window classifiers and single-shot convolutional neural network (CNN) meta-architectures typically yield multiple overlapping candidate windows with similar high scores around the true location of a particular object. Non-maximum suppression (NMS) is the process of selecting a single representative candidate within this cluster of detections, so as to obtain a unique detection per object appearing on a given picture. In this paper, we present a highly scalable NMS algorithm for embedded graphics processing unit (GPU) architectures that is designed from scratch to handle workloads featuring thousands of simultaneous detections on a given picture. Our kernels are directly applicable to other sequential NMS algorithms such as FeatureNMS, Soft-NMS or AdaptiveNMS that share the inner workings of the classic greedy NMS method. The obtained performance results show that our parallel NMS algorithm is capable of clustering 1024 simultaneous detected objects per frame in roughly 1 ms on both Tegra X1 and Tegra X2 on-die GPUs, while taking 2 ms on Tegra K1. Furthermore, our proposed parallel greedy NMS algorithm yields a 14–40x speed up when compared to state-of-the-art NMS methods that require learning a CNN from annotated data., This work has been partially supported by the Ministerio de Economía y Competitividad under contracts (TIN2015-65316-P, TEC2012-38939-C03-02), the Departament d’Innovació, Universitats i Empresa de la Generalitat de Catalunya under project MPEXPAR: Models de Programació i Entorns d’Execució Paral·lels (2014-SGR-1051), and the European Commission under the Horizon 2020 program (H2020-ICT-644312)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Quantification of survey expectations by means of symbolic regression via genetic programming to estimate economic growth in central and eastern european economies

  • Claveria, Oscar
  • Monte Moreno, Enrique
  • Torra Porras, Salvador
Tendency surveys are the main source of agents' expectations. This study has a twofold aim. First, it proposes a new method to quantify survey-based expectations by means of symbolic regression (SR) via genetic programming. Second, it combines the main SR-generated indicators to estimate the evolution of GDP, obtaining the best results for the Czech Republic and Hungary. Finally, it assesses the impact of the 2008 financial crisis, finding that the capacity of agents' expectations to anticipate economic growth in most Central and Eastern European economies improved after the crisis., Peer Reviewed, Postprint (author's final draft)
Investigo. Repositorio Institucional de la Universidade de Vigo
Publicación Artículo científico (JournalArticle)

Albayzín-2014 evaluation: audio segmentation and classification in broadcast news domains

  • Castán, Diego
  • Tavarez, David
  • López Otero, Paula
  • Franco Pedroso, Javier
  • Delgado, Héctor
  • Navas, Eva
  • Docío Fernández, Laura
  • Ramos Castro, Daniel
  • Serrano, Javier
  • Ortega Giménez, Alfonso
  • Lleida Solano, Eduardo
Audio segmentation is important as a pre-processing task to improve the performance of many speech technology tasks and, therefore, it has an undoubted research interest. This paper describes the database, the metric, the systems and the results for the Albayzín-2014 audio segmentation campaign. In contrast to previous evaluations where the task was the segmentation of non-overlapping classes, Albayzín-2014 evaluation proposes the delimitation of the presence of speech, music and/or noise that can be found simultaneously. The database used in the evaluation was created by fusing different media and noises in order to increase the difficulty of the task. Seven segmentation systems from four different research groups were evaluated and combined. Their experimental results were analyzed and compared with the aim of providing a benchmark and showing up the promising directions in this field., Ministerio de Ciencia e Innovación | Ref. TIN2011-28169-C05-02, Ministerio de Economía y Competitividad | Ref. TEC2012-38939-C03