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): 25
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Contribución de congreso (ConferenceOutput)

Parallel CT Reconstruction for Multiple Slices Studies with SuiteSparseQR Factorization Package

  • CHILLARÓN-PÉREZ, MÓNICA|||0000-0002-7611-8908
  • Vidal-Gimeno, Vicente-Emilio|||0000-0002-2384-7015
  • Verdú Martín, Gumersindo Jesús|||0000-0001-5098-080X
[EN] Algebraic factorization methods applied to the discipline of Computerized Tomography (CT) Medical Imaging Reconstruction involve a high computational cost. Since these techniques are significantly slower than the traditional analytical ones and time is critical in this field, we need to employ parallel implementations in order to exploit the machine resources and obtain efficient reconstructions. In this paper, we analyze the performance of the sparse QR decomposition implemented on SuiteSparseQR factorization package applied to the CT reconstruction problem. We explore both the parallelism provided by BLAS threads and the use of the Householder reflections to reconstruct multiple slices at once efficiently. Combining both strategies, we can boost the performance of the reconstructions and implement a reliable and competitive method that gets high-quality CT images., This research has been supported by Universitat Politècnica de València, Generalitat Valenciana under PROMETEO/2018/035 co-financed by FEDER funds, as well as ACIF/2017/075 predoctoral grant, and the Spanish Ministry of Economy and Competitiveness under Grant TIN2015-66972-C5-4-R and TIAMHA co-financed by FEDER funds.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A hybrid genetic algorithm to reduce the radiation dose in CR images

  • Sánchez, M. G.
  • Fajardo-Delgado, D.
  • Vidal-Gimeno, Vicente-Emilio|||0000-0002-2384-7015
  • Verdú Martín, Gumersindo Jesús|||0000-0001-5098-080X
[EN] The quality of computed radiography (CR) images typically relate to patient radiation exposure. The lower the X-ray dose exposure, the higher the level of inherent noise in the CR images. In this work, we address the noise reduction problem by using an estimation of the standard deviation in CR images as an objective function to minimize. We propose a hybrid genetic algorithm for this aim, which produces improved versions of CR images. We also applied an edge-detection method based on the Canny algorithm to preserve the edges of the original CR images. We executed our proposed algorithm for CR images obtained under different radiation exposures. Experimental results show that our solution improves lower radiation CR images reaching a quality as similar to those with higher radiation doses., This research has been supported by the Universitat Politecnica de Valencia, Generalitat Valenciana, under PROMETEO/2018/035 co-financed by FEDER funds (Spain). M. Sanchez and D. Fajardo-Delgado gratefully acknowledge the financial support from PRODEP and TecNM (Mexico) under grants 511-6/17-8931 (ITCGUZ-CA-7) and 5826.19-P, respectively.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A Parallel Fuzzy Algorithm for Real-Time Medical Image Enhancement

  • Arnal, Josep
  • Súcar, Luis B.
  • CHILLARÓN-PÉREZ, MÓNICA|||0000-0002-7611-8908
  • PARCERO IGLESIAS, ESTIBALIZ|||0000-0002-5155-2900
  • Vidal-Gimeno, Vicente-Emilio|||0000-0002-2384-7015
[EN] 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., This research was supported by the Spanish Ministry of Science, Innovation and Universities (Grant RTI2018-098156-B-C54) co-financed by FEDER funds.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A General Model for the Design of Efficient Sign-Coding Tools for Wavelet-Based Encoders

  • López-Granado, Otoniel Mario
  • Martínez-Rach, Miguel Onofre
  • Cruz-Chávez, Marco Antonio
  • Pérez Malumbres, Manuel
  • Martí-Campoy, Antonio|||0000-0002-6009-8703
[EN] Traditionally, it has been assumed that the compression of the sign of wavelet coefficients is not worth the effort because they form a zero-mean process. However, several image encoders such as JPEG 2000 include sign-coding capabilities. In this paper, we analyze the convenience of including sign-coding techniques into wavelet-based image encoders and propose a methodology that allows the design of sign-prediction tools for whatever kind of wavelet-based encoder. The proposed methodology is based on the use of metaheuristic algorithms to find the best sign prediction with the most appropriate context distribution that maximizes the resulting sign-compression rate of a particular wavelet encoder. Following our proposal, we have designed and implemented a sign-coding module for the LTW wavelet encoder, to evaluate the benefits of the sign-coding tool provided by our proposed methodology. The experimental results show that sign compression can save up to 18.91% of bit-rate when enabling sign-coding capabilities. Also, we have observed two general behaviors when coding the sign of wavelet coefficients: (a) the best results are provided from moderate to high compression rates; and (b) the sign redundancy may be better exploited when working with high-textured images., This research was supported by the Spanish Ministry of Economy and Competitiveness under Grant RTI2018-098156-B-C54, co-financed by FEDER funds (MINECO/FEDER/UE).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

CT image reconstruction with SuiteSparseQR factorization package

  • CHILLARÓN-PÉREZ, MÓNICA|||0000-0002-7611-8908
  • Vidal-Gimeno, Vicente-Emilio|||0000-0002-2384-7015
  • Verdú Martín, Gumersindo Jesús|||0000-0001-5098-080X
[EN] SuiteSparseQR is a factorization package for sparse matrices oriented to parallelism in multicore architectures. It employs BLAS and LAPACK as well as Intel's Threading Building Blocks to achieve high performance. Through the SPQR method implemented in this package we can use the QR decomposition to reconstruct CT images efficiently. In this paper, we analyze the behavior of the package applied to the reconstruction of medical CT images, studying the quality of the obtained image. To this purpose, we use the image dataset DeepLesion, which provides various CT studies of different lesions in different organs or tissues. We also compare it to our previous iterative reconstruction method called LSQR. This new method is promising since the computations are simplified if we compare it to the iterative options and the reconstructions are high-quality, as the results show., This research has been supported by "Universitat Politecnica de Valencia", "Generalitat Valenciana" under PROMETEO/2018/035 co-financed by FEDER funds, as well as ACIF/2017/075 predoctoral grant, and the "Spanish Ministry of Economy and Competitiveness" under Grant TIN2015-66972-05-4-R and TIAMHA co-financed by FEDER funds
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Computed tomography medical image reconstruction on affordable equipment by using Out-Of-Core techniques

  • CHILLARÓN-PÉREZ, MÓNICA|||0000-0002-7611-8908
  • Vidal-Gimeno, Vicente-Emilio|||0000-0002-2384-7015
  • Verdú Martín, Gumersindo Jesús|||0000-0001-5098-080X
  • Quintana Ortí, Gregorio
[EN] Background and objective: As Computed Tomography scans are an essential medical test, many techniques have been proposed to reconstruct high-quality images using a smaller amount of radiation. One approach is to employ algebraic factorization methods to reconstruct the images, using fewer views than the traditional analytical methods. However, their main drawback is the high computational cost and hence the time needed to obtain the images, which is critical in the daily clinical practice. For this reason, faster methods for solving this problem are required. Methods: In this paper, we propose a new reconstruction method based on the QR factorization that is very efficient on affordable equipment (standard multicore processors and standard Solid-State Drives) by using Out-Of-Core techniques. Results: Combining both affordable hardware and the new software proposed in our work, the images can be reconstructed very quickly and with high quality. We analyze the reconstructions using real Computed Tomography images selected from a dataset, comparing the QR method to the LSQR and FBP. We measure the quality of the images using the metrics Peak Signal-To-Noise Ratio and Structural Similarity Index, obtaining very high values. We also compare the efficiency of using spinning disks versus Solid-State Drives, showing how the latter performs the Input/Output operations in a significantly lower amount of time. Conclusions: The results indicate that our proposed me thod and software are valid to efficiently solve large-scale systems and can be applied to the Computed Tomography reconstruction problem to obtain high-quality images., This research has been supported by "Universitat Politecnica de Valencia", "Generalitat Valenciana" under PROMETEO/2018/035 and ACIF/2017/075, co-financed by FEDER and FSE funds, and the "Spanish Ministry of Science, Innovation and Universities" under Grant RTI2018-098156-B-C54 co-financed by FEDER funds.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Evaluation of image filters for their integration with LSQR computerized tomography reconstruction method

  • CHILLARÓN-PÉREZ, MÓNICA|||0000-0002-7611-8908
  • Vidal-Gimeno, Vicente-Emilio|||0000-0002-2384-7015
  • Verdú Martín, Gumersindo Jesús|||0000-0001-5098-080X
[EN] In CT (computerized tomography) imaging reconstruction, the acquired sinograms are usually noisy, so artifacts will appear on the resulting images. Thus, it is necessary to find the adequate filters to combine with reconstruction methods that eliminate the greater amount of noise possible without altering in excess the information that the image contains. The present work is focused on the evaluation of several filtering techniques applied in the elimination of artifacts present in CT sinograms. In particular, we analyze the elimination of Gaussian and Speckle noise. The chosen filtering techniques have been studied using four functions designed to measure the quality of the filtered image and compare it with a reference image. In this way, we determine the ideal parameters to carry out the filtering process on the sinograms, prior to the process of reconstruction of the images. Moreover, we study their application on reconstructed noisy images when using noisy sinograms and finally we select the best filter to combine with an iterative reconstruction method in order to test if it improves the quality of the images. With this, we can determine the feasibility of using the selected filtering method for our CT reconstructions with projections reduction, concluding that the bilateral filter is the filter that behaves best with our images. We will test it when combined with our iterative reconstruction method, which consists on the Least Squares QR method in combination with a regularization technique and an acceleration step, showing how integrating this filter with our reconstruction method improves the quality of the CT images., This research has been supported by "Universitat Politecnica de Valencia", "Generalitat Valenciana" under PROMETEO/2018/035 as well as ACIF/2017/075 predoctoral grant co-financed by FEDER and FSE funds, and "Spanish Ministry of Science, Innovation and Universities" under Grant RTI2018-098156-B-C54 co-financed by FEDER funds.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

High-performance reconstruction of CT medical images by using out-of-core methods in GPU

  • Quintana-Ortí, Gregorio
  • CHILLARÓN-PÉREZ, MÓNICA|||0000-0002-7611-8908
  • Vidal-Gimeno, Vicente-Emilio|||0000-0002-2384-7015
  • Verdú Martín, Gumersindo Jesús|||0000-0001-5098-080X
[EN] Background and objective: Since Computed Tomography (CT) is one of the most widely used medical imaging tests, it is essential to work on methods that reduce the radiation the patient is exposed to. Although there are several possible approaches to achieve this, we focus on reducing the exposure time through sparse sampling. With this approach, efficient algebraic methods are needed to be able to generate the images in real time, and since their computational cost is high, using high-performance computing is essential. Methods: In this paper we present a GPU (Graphics Processing Unit) software for solving the CT image reconstruction problem using the QR factorization performed with out-of-core (OOC) techniques. This implementation is optimized to reduce the data transfer times between disk, CPU, and GPU, as well as to overlap input/output operations and computations. Results: The experimental study shows that a block cache stored on main page-locked memory is more efficient than using a cache on GPU memory or mirroring it in both GPU and CPU memory. Compared to a CPU version, this implementation is up to 6.5 times faster, providing an improved image quality when compared to other reconstruction methods. Conclusions: The software developed is an optimized version of the QR factorization for GPU that allows the algebraic reconstruction of CT images with high quality and resolution, with a performance that can be compared with state-of-the-art methods used in clinical practice. This approach allows reducing the exposure time of the patient and thus the radiation dose., This research has been supported by the "Universitat Politecnica de Valencia", "Generalitat Valenciana" under PROMETEO/2018/035 and ACIF/2017/075, co-financed by FEDER and FSE funds, and the "Spanish Ministry of Science, Innovation and Universities" under Grant RTI2018-098156-B-C54 co-financed by FEDER funds. The authors would also like to thank Francisco D. Igual (Universidad Complutense de Madrid) for granting access to the volta1 server.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Tesis doctoral (DoctoralThesis)

Análisis y desarrollo de algoritmos de altas prestaciones para reconstrucción de imagen médica TAC 3D basados en la reducción de dosis.

  • CHILLARÓN-PÉREZ, MÓNICA|||0000-0002-7611-8908
[ES] La prueba médica de Tomografía Computarizada (TC) es esencial actualmente en la práctica clínica para el diagnóstico y seguimiento de múltiples enfermedades y lesiones, siendo una de las pruebas de imagen médica más importante por la gran cantidad de información que es capaz de aportar. Sin embargo, a diferencia de otros métodos de diagnóstico por imagen que son inocuos, la prueba de TC utiliza rayos X, que son ionizantes, por lo que suponen un riesgo para los pacientes. Es por ello que es necesario desarrollar métodos que permitan reducir la dosis de radiación a la que se expone a los pacientes que se realizan un estudio, sin comprometer la calidad de imagen puesto que sino se estaría sometiendo a un riesgo a estas personas sin que un diagnóstico de calidad esté garantizado. Durante el desarrollo de esta tesis se han investigado métodos de reconstrucción de imagen TC que se basan en reducir el número de proyecciones usadas, con el objetivo de reducir el tiempo de exposición a los rayos X. Esta estrategia de reducción de dosis está en fase de investigación, a diferencia de otras que están implantadas en la práctica clínica y ya han sido desarrolladas por los propios fabricantes de los escáneres. Por tanto, nos hemos centrado en los llamados métodos algebraicos de reconstrucción, que son los más apropiados para este tipo de adquisición de proyecciones puesto que son capaces de trabajar con menos información que los métodos clásicos conservando una buena calidad de imagen. En concreto, se ha estudiado a fondo el comportamiento del método LSQR para la resolución de este problema, combinado con una técnica de filtrado llamada Soft Thresholding Filter y una técnica de aceleración llamada FISTA. Además, se ha introducido el filtro de imagen Bilateral que es capaz de mejorar la calidad de las imágenes cuando se combina con los métodos anteriores. El estudio multiparamétrico realizado se ha llevado a cabo en un entorno de computación distribuida Grid, para analizar cómo los distintos parámetros que intervienen en el proceso de reconstrucción pueden influir sobre la imagen resultado. Dicho estudio se ha diseñado para hacer uso de la potencia de cómputo de la plataforma distribuida aunque el software que se necesita no esté disponible. La instalación de dicho software se puede realizar en el tiempo de ejecución de los trabajos, o en se puede empaquetar en una imagen que estará instalada en un contenedor Docker, lo que es una opción muy interesante para sistemas donde no tengamos privilegios. El esquema seguido para la creación y lanzamiento de los trabajos es fácilmente reproducible. Por otra parte, se han planteado dos métodos algebraicos directos para la reconstrucción de TC basados en la factorización de la matriz que modela el sistema. El primero es el método SVD, que se ha probado mediante la librería SLEPc, obteniendo mayores tasas de uso de memoria principal, por lo que ha sido descartado en favor del método QR. La primera aproximación a la resolución se ha hecho mediante la librería SuiteSparseQR, desarrollando después un método propio siguiendo la técnica Out-Of-Core que permite almacenar las matrices en el propio disco duro en lugar de cargarlas en memoria, por lo que el tamaño del problema puede aumentar sin que el coste del hardware sea muy alto. Dicho método obtiene reconstrucciones de alta calidad cuando el rango de la matriz factorizada es completo. En los resultados se muestra como para una resolución alta, garantizar el rango completo todavía supone una reducción del número de proyecciones con respecto a métodos tradicionales. Por tanto, en esta tesis se ha llevado a cabo la investigación y el posterior desarrollo mediante librerías y técnicas de computación de Altas Prestaciones de varios métodos algebraicos de reconstrucción de TC basados en la reducción de proyecciones que permiten mantener una buena calidad de imagen. Dichos métodos han sido optimizados para lograr los menores tiempos de reconstrucción posibles, con el fin de hacerlos competitivos y que algún día puedan ser instaurados en la práctica clínica., [CA] Actualment, la prova mèdica de tomografia computeritzada (TC) és essencial en la pràctica clínica per al diagnòstic i el seguiment de múltiples malalties i lesions, sent una de les proves d'imatge mèdica més importants a causa de la gran quantitat d'informació que és capaç d'oferir. Tanmateix, a diferència d'altres mètodes d'imatge médica, la prova CT utilitza raigs X, que són ionitzants i suposen un risc per als pacients. Per això, és necessari desenvolupar mètodes que permetin reduir la dosi de radiació a la qual estan exposats els pacients sotmesos a un estudi, sense comprometre la qualitat de la imatge, ja que en cas contrari estarien sotmetent a aquestes persones a un risc sense que es garantís l'avantatge d'un diagnòstic d'alta qualitat. Durant el desenvolupament d'aquesta tesi, s'han investigat diversos mètodes de reconstrucció d'imatges CT basats en la reducció del nombre de projeccions utilitzades, amb l'objectiu de reduir el temps d'exposició als raigs X. Aquesta estratègia de reducció de dosis es troba en fase investigació, a diferència d'altres que s'implementen a la pràctica clínica i que ja han estat desenvolupades pels propis fabricants d'escàners. Per tant, ens hem centrat en els anomenats mètodes de reconstrucció algebraica, que són els més adequats per a aquest tipus d'adquisició de projecció, ja que són capaços de treballar amb menys informació que els mètodes clàssics mantenint una bona qualitat d'imatge. Concretament, s'ha estudiat a fons el comportament del mètode LSQR per resoldre aquest problema, combinat amb una tècnica de filtratge anomenada Soft Thresholding Filter i una tècnica d'acceleració anomenada FISTA. A més, s'ha introduït un filtre d'imatges anomenat filtre bilateral, que és capaç de millorar la qualitat de les imatges quan es combina amb els mètodes anteriors. L'estudi multiparamètric de LSQR es va dur a terme en un entorn informàtic distribuït Grid, per analitzar com els diferents paràmetres implicats en el procés de reconstrucció poden influir en la imatge resultant. Aquest estudi ha estat dissenyat per fer ús de la potència de càlcul de la plataforma distribuïda encara que el programari requerit no estigui disponible. La instal·lació d'aquest programari es pot fer en el moment d'executar els treballs o es pot empaquetar en una imatge que s'instal·larà en un contenidor Docker, que és una opció molt interessant per a sistemes on no tenim privilegis. L'esquema seguit per a la creació i el llançament dels treballs es pot reproduir fàcilment per a estudis multiparamètrics d'aquest tipus. D'altra banda, s'han proposat dos mètodes algebraics directes per a la reconstrucció CT basats en la factorització de la matriu que modela el sistema. El primer és el mètode SVD, que s'ha provat mitjançant la biblioteca SLEPc, obtenint taxes d'ús més alt de memòria principal, motiu pel qual s'ha descartat a favor del mètode QR. La primera aproximació a la resolució s'ha fet a través de la biblioteca SuiteSparseQR, desenvolupant posteriorment la nostra pròpia implementació mitjançant la tècnica Out-Of-Core que permet emmagatzemar les matrius al disc dur en lloc de carregar-les a la memòria, de manera que la mida de el problema pot augmentar sense que el cost del maquinari sigui molt alt. Aquest mètode obté reconstruccions d'alta qualitat quan el rang de la matriu factoritzada és complet. En els resultats es demostra que per a una alta resolució, garantir el rang complet encara significa una reducció del nombre de projeccions en comparació amb els mètodes tradicionals. Per tant, en aquesta tesi s'ha dut a terme la investigació i el desenvolupament posterior de diversos mètodes de reconstrucció algebraica de CT mitjançant biblioteques i tècniques de computació d'altes prestacions. Aquests mètodes basats en la reducció de projeccions, que permeten mantenir una bona qualitat d’imatge, s’han optimitzat per aconseguir els temps de reconstrucció més breus possibles, per tal de fer-los competitius perquè algun dia puguin implementarse a la pràctica clínica., [EN] The Computerized Tomography (CT) medical test is currently essential in clinical practice for the diagnosis and monitoring of multiple diseases and injuries, being one of the most important medical imaging tests due to the large amount of information it is capable of providing. However, unlike other safe imaging methods, the CT test uses X-rays, which are ionizing, posing a risk to patients. That is why it is necessary to develop methods that allow reducing the radiation dose to which patients undergoing a study are exposed, without compromising image quality since otherwise they would be subjecting these people to a risk without the benefit of a high-quality diagnosis being guaranteed. During the development of this thesis, several CT image reconstruction methods that are based on reducing the number of projections used have been investigated, with the aim of reducing the time of exposure to X-rays. This dose reduction strategy is in research phase, unlike others that are implemented in clinical practice and have already been developed by the scanner manufacturers themselves. Therefore, we have focused on the algebraic reconstruction methods, which are the most appropriate for this type of projection acquisition since they are capable of working with less information than the classical methods while maintaining good image quality. Specifically, the behavior of the LSQR method to solve this problem has been thoroughly studied, combined with a filtering technique called Soft Thresholding Filter and an acceleration technique called FISTA. In addition, the so-called Bilateral filter has been introduced, which is capable of improving the quality of images when combined with the above methods. The multiparametric LSQR study was carried out in a Grid distributed computing environment, to analyze how the different parameters involved in the reconstruction process can influence the resulting image. This study has been designed to make use of the computing power of the distributed platform even if the software required is not available. The installation of said software can be done at the time of execution of the jobs, or it can be packaged in an image that will be installed in a Docker container, which is a very interesting option for systems where we do not have privileges. The scheme followed for the creation and launch of the jobs is easily reproducible for multiparametric studies of this type. On the other hand, two direct algebraic methods have been proposed for CT reconstruction based on the factorization of the matrix that models the system. The first is the SVD method, which has been tested using the SLEPc library, obtaining higher rates of main memory usage, which is why it has been discarded in favor of the QR method. The first approximation to the resolution has been made through the SuiteSparseQR library, later developing our own implementation using the Out-Of-Core technique that allows the matrices to be stored on the hard drive itself instead of loading them in memory, so the size of the problem can increase without the cost of the hardware being very high. This method obtains high-quality reconstructions when the rank of the factored matrix is complete. In the results it is shown that for a high resolution, guaranteeing the full rank still means a reduction in the number of projections compared to traditional methods. Therefore, in this thesis, research and subsequent development of several algebraic CT reconstruction methods has been carried out using libraries and High Performance Computing techniques. These methods based on the reduction of projections, which allows maintaining good image quality, and have been optimized to achieve the shortest possible reconstruction times, in order to make them competitive so that one day they can be implemented in clinical practice., This research has been supported by Universitat Politècnica de València and partially funded by TIN2015-66972-C5-4-R, ENE2014-59442-P-AR and TIN2013-44390-R projects of the "Ministerio de Economía y Competitividad" of Spain, as well as the Spanish ”Generalitat Valenciana” PROMETEOII/2014/008, PROMETEO/2018/035 projects and ACIF/2017/075 predoctoral grant. This work has also been co-financed by FEDER and FSE funds, and the “Spanish Ministry of Science, Innovation and Universities” under Grant RTI2018-098156-B-C54
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).