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: Fernandez, G.J., Jacobo-Berlles, J., Bauzá, M., Borensztejn, P., Mejail, M., Walter M., Carvalho P.C., Conselho Nacional de Desenvolvimento Cientifico e Tecnologico (CNPq); FAPERGS; Informatica UFRGS; PUCRS; Sociedade Brasileira de Computacao (SBC); Universidade do Vale do Rio dos Sinos (UNISINOS)
Formato: CONF
Materias:
Algorithms
Computer graphics
Markov processes
Markov Random Fields
Parallel virtual machines
Parallelizations
Image processing
Acceso en línea: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
Descripción
Sumario: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.

Ejemplares similares