Pasar al contenido principal

TECNICAS PARA LA ACELERACION Y MEJORA DE APLICACIONES MULTIMEDIA Y HPC

RTI2018-098156-B-C54

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2018
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD MIGUEL HERNANDEZ DE ELCHE

Resultados relacionados

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

RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Multi-level parallel chaotic Jaya optimization algorithms for solving constrained engineering design problems

  • Migallón Gomis, Héctor
  • Jimeno-Morenilla, Antonio
  • Rico, Héctor
  • Sanchez-Romero, Jose-Luis
  • Belazi, Akram
  • Jimeno-Morenilla, Antonio|||/items/5a277765-a179-4393-b7b3-c50ac73dd59f
  • Sanchez-Romero, Jose-Luis|||/items/5615442e-4cfb-4a26-81e8-c54900dae552
Several heuristic optimization algorithms have been applied to solve engineering problems. Most of these algorithms are based on populations that evolve according to different rules and parameters to reach the optimal value of a function cost through an iterative process. Different parallel strategies have been proposed to accelerate these algorithms. In this work, we combined coarse-grained strategies, based on multi-populations, with fine-grained strategies, based on a diffusion grid, to efficiently use a large number of processes, thus drastically decreasing the computing time. The Chaotic Jaya optimization algorithm has been considered in this work due to its good optimization and computational behaviors in solving both the constrained optimization engineering problems (seven problems) and the unconstrained benchmark functions (a set of 18 functions). The experimental results show that the proposed parallel algorithms outperform the state-of-the-art algorithms in terms of optimization behavior, according to the quality of the obtained solutions, and efficiently exploit shared memory parallel platforms.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Efficient parallel and fast convergence chaotic Jaya algorithms

  • Migallón Gomis, Héctor
  • Jimeno-Morenilla, Antonio
  • Sanchez-Romero, Jose-Luis
  • Belazi, Akram
  • Jimeno-Morenilla, Antonio|||/items/5a277765-a179-4393-b7b3-c50ac73dd59f
  • Sanchez-Romero, Jose-Luis|||/items/5615442e-4cfb-4a26-81e8-c54900dae552
The Jaya algorithm is a recent heuristic approach for solving optimisation problems. It involves a random search for the global optimum, based on the generation of new individuals using both the best and the worst individuals in the population, thus moving solutions towards the optimum while avoiding the worst current solution. In addition to its performance in terms of optimisation, a lack of control parameters is another significant advantage of this algorithm. However, the number of iterations needed to reach the optimal solution, or close to it, may be very high, and the computational cost can hamper compliance with time requirements. In this work, a chaotic two-dimensional (2D) map is used to accelerate convergence, and parallel algorithms are developed to alleviate the computational cost. Coarse- and fine-grained parallel algorithms are developed, the former based on multi-populations and the latter at the individual level, and in both cases these are accelerated by an improved (computational) use of the chaos map.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Fast Method Based on Fuzzy Logic for Gaussian-Impulsive Noise Reduction in CT Medical Images

  • Arnal, Josep
  • Súcar Segarra, Luis Beltrán
  • Arnal, Josep|||/items/c26299fe-8dcb-4732-be9c-4b8cf6bc87d4
  • Súcar Segarra, Luis Beltrán|||/items/2bd78d60-e586-4704-9181-fe8270eda763
To remove Gaussian-impulsive mixed noise in CT medical images, a parallel filter based on fuzzy logic is applied. The used methodology is structured in two steps. A method based on a fuzzy metric is applied to remove the impulsive noise at the first step. To reduce Gaussian noise, at the second step, a fuzzy peer group filter is used on the filtered image obtained at the first step. A comparative analysis with state-of-the-art methods is performed on CT medical images using qualitative and quantitative measures evidencing the effectiveness of the proposed algorithm. The parallel method is parallelized on shared memory multiprocessors. After applying parallel computing strategies, the obtained computing times indicate that the introduced filter enables to reduce Gaussian-impulse mixed noise on CT medical images in real-time.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Comparison of High Performance Parallel Implementations of TLBO and Jaya Optimization Methods on Manycore GPU

  • Rico, Héctor
  • Sanchez-Romero, Jose-Luis
  • Jimeno-Morenilla, Antonio
  • Migallón Gomis, Héctor
  • Mora, Higinio
  • Rao, Ravipudi Venkata
  • Jimeno-Morenilla, Antonio|||/items/5a277765-a179-4393-b7b3-c50ac73dd59f
  • Mora, Higinio|||/items/77871521-ed51-42c5-9240-dca1930db8e5
  • Sanchez-Romero, Jose-Luis|||/items/5615442e-4cfb-4a26-81e8-c54900dae552
The utilization of optimization algorithms within engineering problems has had a major rise in recent years, which has led to the proliferation of a large number of new algorithms to solve optimization problems. In addition, the emergence of new parallelization techniques applicable to these algorithms to improve their convergence time has made it a subject of study by many authors. Recently, two optimization algorithms have been developed: Teaching-Learning Based Optimization and Jaya. One of the main advantages of both algorithms over other optimization methods is that the former do not need to adjust specific parameters for the particular problem to which they are applied. In this paper, the parallel implementations of Teaching-Learning Based Optimization and Jaya are compared. The parallelization of both algorithms is performed using manycore GPU techniques. Different scenarios will be created involving functions frequently applied to the evaluation of optimization algorithms. Results will make it possible to compare both parallel algorithms with regard to the number of iterations and the time needed to perform them so as to obtain a predefined error level. The GPU resources occupation in each case will also be analyzed.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

A Parallel Fuzzy Algorithm for Real-Time Medical Image Enhancement

  • Arnal, Josep
  • Chillarón, Mónica
  • Parcero, Estíbaliz
  • Súcar Segarra, Luis Beltrán
  • Vidal Gimeno, Vicente
  • Arnal, Josep|||/items/c26299fe-8dcb-4732-be9c-4b8cf6bc87d4
  • Súcar Segarra, Luis Beltrán|||/items/2bd78d60-e586-4704-9181-fe8270eda763
Medical images may be corrupted by noise. This noise affects the image quality and can obscure important information required for accurate diagnosis. Effectively apply filtering techniques can facilitate diagnosis or reduce radiation exposure. In this paper, we introduce a parallel method designed to reduce mixed Gaussian-impulse noise from digital images. The method uses fuzzy logic and the fuzzy peer group concept. Implementations of the method on multi-core interface using the open multi-processing (OpenMP) and on graphics processing units (GPUs) using CUDA are presented. Efficiency is measured in terms of execution time and in terms of MAE, PSNR and SSIM over medical images from the mini-MIAS database and over computed radiography (CR) images generated at different exposure levels. These images have been contaminated with impulsive and/or Gaussian noise. Experiments show that the proposed method obtains good performance in terms of the above mentioned objective quality measures. After applying multi-core and GPUs optimization strategies, the observed time shows that the new filter allows to remove mixed Gaussian-impulse noise in real-time.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

A Parallel Fuzzy Method to Reduce Mixed Gaussian-Impulsive Noise in CT Medical Images

  • Arnal, Josep
  • Pérez Mingot, Juan Bautista
  • Vidal, Vicente
  • Arnal, Josep|||/items/c26299fe-8dcb-4732-be9c-4b8cf6bc87d4
A fuzzy logic filter to remove mixed Gaussian and impulsive noise from CT medical images is presented. The method performs a weighted average operation where a fuzzy rule-based model is defined to compute the coefficients. In addition, a parallel filter based on this method is presented. Implementation of the parallel algorithm on multi-core platform using OpenMP is presented. Efficiency is measured in terms of execution time and in terms of PSNR over medical CT images. Experimental results show that mixed Gaussian-impulsive noise is reduced efficiently and image details are preserved. The multi-core implementation allows reducing mixed Gaussian-impulse noise in real-time.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Settings-Free Hybrid Metaheuristic General Optimization Methods

  • Migallón Gomis, Héctor
  • Belazi, Akram
  • Sanchez-Romero, Jose-Luis
  • Rico, Héctor
  • Jimeno-Morenilla, Antonio
  • Jimeno-Morenilla, Antonio|||/items/5a277765-a179-4393-b7b3-c50ac73dd59f
  • Sanchez-Romero, Jose-Luis|||/items/5615442e-4cfb-4a26-81e8-c54900dae552
Several population-based metaheuristic optimization algorithms have been proposed in the last decades, none of which are able either to outperform all existing algorithms or to solve all optimization problems according to the No Free Lunch (NFL) theorem. Many of these algorithms behave effectively, under a correct setting of the control parameter(s), when solving different engineering problems. The optimization behavior of these algorithms is boosted by applying various strategies, which include the hybridization technique and the use of chaotic maps instead of the pseudo-random number generators (PRNGs). The hybrid algorithms are suitable for a large number of engineering applications in which they behave more effectively than the thoroughbred optimization algorithms. However, they increase the difficulty of correctly setting control parameters, and sometimes they are designed to solve particular problems. This paper presents three hybridizations dubbed HYBPOP, HYBSUBPOP, and HYBIND of up to seven algorithms free of control parameters. Each hybrid proposal uses a different strategy to switch the algorithm charged with generating each new individual. These algorithms are Jaya, sine cosine algorithm (SCA), Rao’s algorithms, teaching-learning-based optimization (TLBO), and chaotic Jaya. The experimental results show that the proposed algorithms perform better than the original algorithms, which implies the optimal use of these algorithms according to the problem to be solved. One more advantage of the hybrid algorithms is that no prior process of control parameter tuning is needed.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Parallel techniques for speckle noise reduction in medical ultrasound images

  • Arnal, Josep
  • Mayzel, Ilya
  • Arnal, Josep|||/items/c26299fe-8dcb-4732-be9c-4b8cf6bc87d4
Parallel computing is used to accelerate the computations in the reduction of speckle noise in medical ultrasound images. A new hybrid algorithm for speckle noise reduction in medical ultrasound images is proposed and compared to an existing efficient method. The method combines in an efficient manner the advantages of several denoising filters using local and non-local information. A comparative study is carried out using quantitative and qualitative measures and showing the competitiveness of the proposed method. Both methods are parallelized using OpenMP, and a hybrid combination of MPI and OpenMP. The parallel implementations are compared to the sequential ones, obtaining significative values of speedup.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Parallel implementation of metaheuristics for optimizing tool path computation on CNC machining

  • Rico, Héctor
  • Sanchez-Romero, Jose-Luis
  • Migallón Gomis, Héctor
  • Rao, Ravipudi Venkata
  • Sanchez-Romero, Jose-Luis|||/items/5615442e-4cfb-4a26-81e8-c54900dae552
The incorporation of technological advances in industry is a must, even for traditional sectors where most companies are SMEs and investments are limited. Technology can be used to increase productivity and the quality of the manufactured product. Drilling is a common procedure in industry. It usually consists of multiple drilling of a flat surface with a tool. Usually the tool is placed on the surface to be drilled at a safe distance and then it makes the drilling in a linear fashion. Optimization of the tool path often involves reducing the movement of the tool to place it over the next point to be drilled, known as airtime. The problem of minimizing airtime for drill paths is highly complex. Most proposals to solve the problem try to adapt it to the formulation of the Traveling Salesman Problem (TSP), in which the objective is to navigate a list of nodes using the minimum global distance. In this paper, the purpose is to provide a solution to the TSP applied to tool path optimization by means of a Discrete version of the Teacher-Learner-Based Optimization (TLBO) algorithm. To improve performance, the algorithm is implemented using a parallel Computer Unified Device Architecture (CUDA) and run on a manycore Graphical Processing Unit (GPU). The results show that the parallel implementation of Discrete TLBO is faster than 9x the sequential implementation.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Parallel approach of a Galerkin-based methodology for predicting the compressive strength of the lightweight aggregate concrete

  • Migallón, Violeta
  • Navarro-González, Francisco J.
  • Penadés, Jose
  • Villacampa, Yolanda
  • Migallón, Violeta|||/items/19db1ff4-dc48-424b-b2ea-0522ff049c8a
  • Navarro-González, Francisco J.|||/items/9f1efaa0-7045-4f34-a1be-870ba61564ab
  • Penadés, Jose|||/items/2f533297-8ae6-4b05-9fb6-1bb85696f056
  • Villacampa, Yolanda|||/items/5d1c4e66-74be-4b8b-924a-7a6795ca96d5
A methodology based on the Galerkin formulation of the finite element method has been analyzed for predicting the compressive strength of the lightweight aggregate concrete using ultrasonic pulse velocity. Due to both the memory requirements and the computational cost of this technique, its parallelization becomes necessary for solving this problem. For this purpose a mixed MPI/OpenMP parallel algorithm has been designed and different approaches and data distributions analyzed. On the other hand, this Galerkin methodology has been compared with multiple linear regression models, regression trees and artificial neural networks. Based on different measures of goodness of fit, the effectiveness of the Galerkin methodology, compared with these statistical techniques for data mining, is shown.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

A Parallel Meta-Heuristic Approach to Reduce Vehicle Travel Time in Smart Cities

  • Rico, Héctor
  • Sanchez-Romero, Jose-Luis
  • Jimeno-Morenilla, Antonio
  • Migallón Gomis, Héctor
  • Jimeno-Morenilla, Antonio|||/items/5a277765-a179-4393-b7b3-c50ac73dd59f
  • Sanchez-Romero, Jose-Luis|||/items/5615442e-4cfb-4a26-81e8-c54900dae552
The development of the smart city concept and inhabitants’ need to reduce travel time, in addition to society’s awareness of the importance of reducing fuel consumption and respecting the environment, have led to a new approach to the classic travelling salesman problem (TSP) applied to urban environments. This problem can be formulated as “Given a list of geographic points and the distances between each pair of points, what is the shortest possible route that visits each point and returns to the departure point?”. At present, with the development of Internet of Things (IoT) devices and increased capabilities of sensors, a large amount of data and measurements are available, allowing researchers to model accurately the routes to choose. In this work, the aim is to provide a solution to the TSP in smart city environments using a modified version of the metaheuristic optimization algorithm Teacher Learner Based Optimization (TLBO). In addition, to improve performance, the solution is implemented by means of a parallel graphics processing unit (GPU) architecture, specifically a Compute Unified Device Architecture (CUDA) implementation.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

A parallel methodology using radial basis functions versus machine learning approaches applied to environmental modelling

  • Migallón, Violeta
  • Navarro-González, Francisco J.
  • Penadés Migallón, Héctor
  • Penadés, Jose
  • Villacampa, Yolanda
  • Migallón, Violeta|||/items/19db1ff4-dc48-424b-b2ea-0522ff049c8a
  • Navarro-González, Francisco J.|||/items/9f1efaa0-7045-4f34-a1be-870ba61564ab
  • Penadés Migallón, Héctor|||/items/ab4cb1a8-107a-418b-8d07-4339d7657ef6
  • Penadés, Jose|||/items/2f533297-8ae6-4b05-9fb6-1bb85696f056
  • Villacampa, Yolanda|||/items/5d1c4e66-74be-4b8b-924a-7a6795ca96d5
Parallel nonlinear models using radial kernels on local mesh support have been designed and implemented for application to real-world problems. Although this recently developed approach reduces the memory requirements compared with other methodologies suggested over the last few years, its computational cost makes parallelisation necessary, especially for big datasets with many instances or attributes. In this work, several strategies for the parallelisation of this methodology are proposed and compared. The MPI communication protocol and the OpenMP application programming interface are used to implement the algorithm. The performance of this methodology is compared with various machine learning methods, with particular consideration of techniques using radial basis functions (RBF). Different methods are applied to model the daily maximum air temperature from real meteorological data collected from the Agroclimatic Station Network of the Phytosanitary Alert and Information Network of Andalusia, an autonomous community of southern Spain. The obtained goodness-of-fit measures illustrate the effectiveness of this nonlinear methodology, and its training process is shown to be simpler than those of other powerful machine learning methods.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Non-Stationary Acceleration Strategies for PageRank Computing

  • Migallón Gomis, Héctor
  • Migallón, Violeta
  • Penadés, Jose
  • Migallón, Violeta|||/items/19db1ff4-dc48-424b-b2ea-0522ff049c8a
  • Penadés, Jose|||/items/2f533297-8ae6-4b05-9fb6-1bb85696f056
In this work, a non-stationary technique based on the Power method for accelerating the parallel computation of the PageRank vector is proposed and its theoretical convergence analyzed. This iterative non-stationary model, which uses the eigenvector formulation of the PageRank problem, reduces the needed computations for obtaining the PageRank vector by eliminating synchronization points among processes, in such a way that, at each iteration of the Power method, the block of iterate vector assigned to each process can be locally updated more than once, before performing a global synchronization. The parallel implementation of several strategies combining this novel non-stationary approach and the extrapolation methods has been developed using hybrid MPI/OpenMP programming. The experiments have been carried out on a cluster made up of 12 nodes, each one equipped with two Intel Xeon hexacore processors. The behaviour of the proposed parallel algorithms has been studied with realistic datasets, highlighting their performance compared with other parallel techniques for solving the PageRank problem. Concretely, the experimental results show a time reduction of up to 58.4% in relation to the parallel Power method, when a small number of local updates is performed before each global synchronization, outperforming both the two-stage algorithms and the extrapolation algorithms, more sharply as the number of processes increases.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Impact of Programming Exposure on the Development of Computational Thinking Capabilities: An Empirical Study

  • Cachero, Cristina
  • Barra Hernández, Pilar
  • Meliá, Santiago
  • López, Otoniel
  • Cachero, Cristina|||/items/9ee1ce05-0cb5-42ea-9e13-c69efcd58606
  • Meliá, Santiago|||/items/f44a8d6b-5912-48e3-9f3d-117f5f2f5efc
Today’s digital society has turned the development of students’ computational thinking capabilities into a critical factor for their future success. As higher education institutions, we need to take responsibility for this development in every degree course we offer, and provide students with the kind of subjects and activities that best contribute to this aim. In this paper, we study the impact of following an introductory programming course on the development of the computational thinking capabilities of university students. In order to achieve this aim, a concurrent cohort observational study was carried out in which we measured both the subjective and objective computational thinking capabilities of 104 participants (50 first year students enrolled on a Bachelor’s degree course in Psychology at the Catholic University of Murcia (UCAM), and 54 first year students enrolled on a Bachelor’s degree course in Health Information Systems at the University of Alicante (UA)). The statistical procedures applied to test our hypotheses were a two-way mixed ANOVA, a paired-sample T-test and an independent-sample T-test. The data shows that the group at UA had an initial higher subjective perception of their computational capabilities than the group at UCAM. This perception was supported by their objective scores, which were also significantly higher. However, the subjective assessment of computational capability of the UA group diminished after exposure to the programming course, contrasting with the fact that their objective computational capabilities improved significantly. In the UCAM group, both subjective and objective capabilities remained constant over time. Based on these results, we can conclude that computational thinking capabilities are not developed naturally, but need to be trained. Providing such training to all our students, and not only to those enrolled on undergraduate degrees in engineering, is of paramount importance to allow them to face the challenges of their future professions. This paper empirically demonstrates the extent to which exposing subjects to a programming course may contribute to this aim.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Enhanced Parallel Sine Cosine Algorithm for Constrained and Unconstrained Optimization

  • Belazi, Akram
  • Migallón Gomis, Héctor
  • González-Sánchez, Daniel
  • González-García, Jorge
  • Jimeno-Morenilla, Antonio
  • Sanchez-Romero, Jose-Luis
  • Jimeno-Morenilla, Antonio|||/items/5a277765-a179-4393-b7b3-c50ac73dd59f
  • Sanchez-Romero, Jose-Luis|||/items/5615442e-4cfb-4a26-81e8-c54900dae552
The sine cosine algorithm’s main idea is the sine and cosine-based vacillation outwards or towards the best solution. The first main contribution of this paper proposes an enhanced version of the SCA algorithm called as ESCA algorithm. The supremacy of the proposed algorithm over a set of state-of-the-art algorithms in terms of solution accuracy and convergence speed will be demonstrated by experimental tests. When these algorithms are transferred to the business sector, they must meet time requirements dependent on the industrial process. If these temporal requirements are not met, an efficient solution is to speed them up by designing parallel algorithms. The second major contribution of this work is the design of several parallel algorithms for efficiently exploiting current multicore processor architectures. First, one-level synchronous and asynchronous parallel ESCA algorithms are designed. They have two favors; retain the proposed algorithm’s behavior and provide excellent parallel performance by combining coarse-grained parallelism with fine-grained parallelism. Moreover, the parallel scalability of the proposed algorithms is further improved by employing a two-level parallel strategy. Indeed, the experimental results suggest that the one-level parallel ESCA algorithms reduce the computing time, on average, by 87.4% and 90.8%, respectively, using 12 physical processing cores. The two-level parallel algorithms provide extra reductions of the computing time by 91.4%, 93.1%, and 94.5% with 16, 20, and 24 processing cores, including physical and logical cores. Comparison analysis is carried out on 30 unconstrained benchmark functions and three challenging engineering design problems. The experimental outcomes show that the proposed ESCA algorithm behaves outstandingly well in terms of exploration and exploitation behaviors, local optima avoidance, and convergence speed toward the optimum. The overall performance of the proposed algorithm is statistically validated using three non-parametric statistical tests, namely Friedman, Friedman aligned, and Quade tests.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Hybrid Filter Based on Fuzzy Techniques for Mixed Noise Reduction in Color Images

  • Arnal, Josep
  • Súcar Segarra, Luis Beltrán
  • Arnal, Josep|||/items/c26299fe-8dcb-4732-be9c-4b8cf6bc87d4
  • Súcar Segarra, Luis Beltrán|||/items/2bd78d60-e586-4704-9181-fe8270eda763
To decrease contamination from a mixed combination of impulse and Gaussian noise on color digital images, a novel hybrid filter is proposed. The new technique is composed of two stages. A filter based on a fuzzy metric is used for the reduction of impulse noise at the first stage. At the second stage, to remove Gaussian noise, a fuzzy peer group method is applied on the image generated from the previous stage. The performance of the introduced algorithm was evaluated on standard test images employing widely used objective quality metrics. The new approach can efficiently reduce both impulse and Gaussian noise, as much as mixed noise. The proposed filtering method was compared to the state-of-the-art methodologies: adaptive nearest neighbor filter, alternating projections filter, color block-matching 3D filter, fuzzy peer group averaging filter, partition-based trimmed vector median filter, trilateral filter, fuzzy wavelet shrinkage denoising filter, graph regularization filter, iterative peer group switching vector filter, peer group method, and the fuzzy vector median method. The experiments demonstrated that the introduced noise reduction technique outperforms those state-of-the-art filters with respect to the metrics peak signal to noise ratio (PSNR), the mean absolute error (MAE), and the normalized color difference (NCD).