Parallelization of ARTUR algorithm using PVM

The algorithms based on Markov Random Fields (MRF), used for restoring images affected by blur and noise are usually effective, but also computationally very heavy. In this work, a parallelization of the ARTUR algorithm, on the Parallel Virtual Machine (PVM), is considered. © 2000 IEEE.

Guardado en:
Detalles Bibliográficos
Autores principales: Jacobo Berlles, Julio C. A., Mejail, Marta Estela
Publicado: 2000
Materias:
Algorithms
Computer graphics
Markov processes
Markov Random Fields
Parallel virtual machines
Parallelizations
Image processing
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15301834_v2000-January_n_p331_Fernandez
http://hdl.handle.net/20.500.12110/paper_15301834_v2000-January_n_p331_Fernandez
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
id paper:paper_15301834_v2000-January_n_p331_Fernandez
record_format dspace
spelling paper:paper_15301834_v2000-January_n_p331_Fernandez2023-06-08T16:19:42Z Parallelization of ARTUR algorithm using PVM Jacobo Berlles, Julio C. A. Mejail, Marta Estela Algorithms Computer graphics Markov processes Markov Random Fields Parallel virtual machines Parallelizations Image processing The algorithms based on Markov Random Fields (MRF), used for restoring images affected by blur and noise are usually effective, but also computationally very heavy. In this work, a parallelization of the ARTUR algorithm, on the Parallel Virtual Machine (PVM), is considered. © 2000 IEEE. Fil:Jacobo-Berlles, J. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Mejail, M. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. 2000 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15301834_v2000-January_n_p331_Fernandez http://hdl.handle.net/20.500.12110/paper_15301834_v2000-January_n_p331_Fernandez
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic Algorithms
Computer graphics
Markov processes
Markov Random Fields
Parallel virtual machines
Parallelizations
Image processing
spellingShingle Algorithms
Computer graphics
Markov processes
Markov Random Fields
Parallel virtual machines
Parallelizations
Image processing
Jacobo Berlles, Julio C. A.
Mejail, Marta Estela
Parallelization of ARTUR algorithm using PVM
topic_facet Algorithms
Computer graphics
Markov processes
Markov Random Fields
Parallel virtual machines
Parallelizations
Image processing
description The algorithms based on Markov Random Fields (MRF), used for restoring images affected by blur and noise are usually effective, but also computationally very heavy. In this work, a parallelization of the ARTUR algorithm, on the Parallel Virtual Machine (PVM), is considered. © 2000 IEEE.
author Jacobo Berlles, Julio C. A.
Mejail, Marta Estela
author_facet Jacobo Berlles, Julio C. A.
Mejail, Marta Estela
author_sort Jacobo Berlles, Julio C. A.
title Parallelization of ARTUR algorithm using PVM
title_short Parallelization of ARTUR algorithm using PVM
title_full Parallelization of ARTUR algorithm using PVM
title_fullStr Parallelization of ARTUR algorithm using PVM
title_full_unstemmed Parallelization of ARTUR algorithm using PVM
title_sort parallelization of artur algorithm using pvm
publishDate 2000
url https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15301834_v2000-January_n_p331_Fernandez
http://hdl.handle.net/20.500.12110/paper_15301834_v2000-January_n_p331_Fernandez
work_keys_str_mv AT jacoboberllesjulioca parallelizationofarturalgorithmusingpvm
AT mejailmartaestela parallelizationofarturalgorithmusingpvm
_version_ 1768544838575194112

Ejemplares similares