Skip to main content

TECNICAS PARA LA MEJORA DE LAS APLICACIONES MULTIMEDIA Y COMPUTACION MATRICIAL

TIN2015-66972-C5-4-R

•
Funding agency name Ministerio de Economía y Competitividad
Funding agency acronym MINECO
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos I+D+i Retos de Investigación
Call year 2015
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Management unit Dirección General de Investigación Científica y Técnica
Beneficiary centre UNIVERSIDAD MIGUEL HERNANDEZ DE ELCHE

Resultados relacionados

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

RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

CT Medical Imaging Reconstruction Using Direct Algebraic Methods with Few Projections

  • Chillarón, Mónica
  • Vidal, Vicente
  • Verdú, Gumersindo
  • Arnal, Josep
  • Arnal, Josep|||/items/c26299fe-8dcb-4732-be9c-4b8cf6bc87d4
In the field of CT medical image reconstruction, there are two approaches you can take to reconstruct the images: the analytical methods, or the algebraic methods, which can be divided into iterative or direct. Although analytical methods are the most used for their low computational cost and good reconstruction quality, they do not allow reducing the number of views and thus the radiation absorbed by the patient. In this paper, we present two direct algebraic approaches for CT reconstruction: performing the Sparse QR (SPQR) factorization of the system matrix or carrying out a singular values decomposition (SVD). We compare the results obtained in terms of image quality and computational time cost and analyze the memory requirements for each case.
RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

Multipopulation-based multi-level parallel enhanced Jaya algorithms

  • Migallón Gomis, Héctor
  • Jimeno-Morenilla, Antonio
  • Sanchez-Romero, Jose-Luis
  • Rico, Héctor
  • Rao, Ravipudi Venkata
  • Jimeno-Morenilla, Antonio|||/items/5a277765-a179-4393-b7b3-c50ac73dd59f
  • Sanchez-Romero, Jose-Luis|||/items/5615442e-4cfb-4a26-81e8-c54900dae552
To solve optimization problems, in the field of engineering optimization, an optimal value of a specific function must be found, in a limited time, within a constrained or unconstrained domain. Metaheuristic methods are useful for a wide range of scientific and engineering applications, which accelerate being able to achieve optimal or near-optimal solutions. The metaheuristic method called Jaya has generated growing interest because of its simplicity and efficiency. We present Jaya-based parallel algorithms to efficiently exploit cluster computing platforms (heterogeneous memory platforms). We propose a multi-level parallel algorithm, in which, to exploit distributed-memory architectures (or multiprocessors), the outermost layer of the Jaya algorithm is parallelized. Moreover, in internal layers, we exploit shared-memory architectures (or multicores) by adding two more levels of parallelization. This two-level internal parallel algorithm is based on both a multipopulation structure and an improved heuristic search path relative to the search path of the sequential algorithm. The multi-level parallel algorithm obtains average efficiency values of 84% using up to 120 and 135 processes, and slightly accelerates the convergence with respect to the sequential Jaya algorithm.
RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

Efficient Subpopulation Based Parallel TLBO Optimization Algorithms

  • García-Monzó, Alejandro
  • Migallón Gomis, Héctor
  • Jimeno-Morenilla, Antonio
  • Sanchez-Romero, Jose-Luis
  • Rico, Héctor
  • Rao, Ravipudi Venkata
  • Jimeno-Morenilla, Antonio|||/items/5a277765-a179-4393-b7b3-c50ac73dd59f
  • Sanchez-Romero, Jose-Luis|||/items/5615442e-4cfb-4a26-81e8-c54900dae552
A numerous group of optimization algorithms based on heuristic techniques have been proposed in recent years. Most of them are based on phenomena in nature and require the correct tuning of some parameters, which are specific to the algorithm. Heuristic algorithms allow problems to be solved more quickly than deterministic methods. The computational time required to obtain the optimum (or near optimum) value of a cost function is a critical aspect of scientific applications in countless fields of knowledge. Therefore, we proposed efficient algorithms parallel to Teaching-learning-based optimization algorithms. TLBO is efficient and free from specific parameters to be tuned. The parallel proposals were designed with two levels of parallelization, one for shared memory platforms and the other for distributed memory platforms, obtaining good parallel performance in both types of parallel architectures and on heterogeneous memory parallel platforms.
RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

Jaya optimization algorithm with GPU acceleration

  • Jimeno-Morenilla, Antonio
  • Sanchez-Romero, Jose-Luis
  • Migallón Gomis, Héctor
  • Mora, Higinio
  • 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
Optimization methods allow looking for an optimal value given a specific function within a constrained or unconstrained domain. These methods are useful for a wide range of scientific and engineering applications. Recently, a new optimization method called Jaya has generated growing interest because of its simplicity and efficiency. In this paper, we present the Jaya GPU-based parallel algorithms we developed and analyze both parallel performance and optimization performance using a well-known benchmark of unconstrained functions. Results indicate that parallel Jaya implementation achieves significant speed-up for all benchmark functions, obtaining speed-ups of up to 190×, without affecting optimization performance.
RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

Parallel two-stage algorithms for solving the PageRank problem

  • 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 we present parallel algorithms based on the use of two-stage methods for solving the PageRank problem as a linear system. Different parallel versions of these methods are explored and their convergence properties are analyzed. The parallel implementation has been developed using a mixed MPI/OpenMP model to exploit parallelism beyond a single level. In order to investigate and analyze the proposed parallel algorithms, we have used several realistic large datasets. The numerical results show that the proposed algorithms can speed up the time to converge with respect to the parallel Power algorithm and behave better than other well-known techniques.
RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

A heuristic relaxed extrapolated algorithm for accelerating PageRank

  • Migallón Gomis, Héctor
  • Migallón, Violeta
  • Palomino Benito, Juan
  • Penadés, Jose
  • Migallón, Violeta|||/items/19db1ff4-dc48-424b-b2ea-0522ff049c8a
  • Penadés, Jose|||/items/2f533297-8ae6-4b05-9fb6-1bb85696f056
The PageRank algorithm for determining the importance of Web pages has become a central technique in Web search. This algorithm uses the Power method to compute successive iterates that converge to the principal eigenvector of the Markov chain representing the Web link graph. In this work we present an effective heuristic Relaxed and Extrapolated algorithm based on the Power method that accelerates its convergence. A hybrid parallel implementation of this algorithm has been designed by combining various OpenMP threads for each MPI process and several strategies of data distribution among nodes have been analyzed. The results show that the proposed algorithm can significantly speed up the convergence time with respect to the parallel Power algorithm.