Repositorio de producción científica de la Universidad de Sevilla

A Parallel Implementation for Computing the Region-Adjacency-Tree of a Segmentation of a 2D Digital Image

Opened Access A Parallel Implementation for Computing the Region-Adjacency-Tree of a Segmentation of a 2D Digital Image

Citas

buscar en

Estadísticas
Icon
Exportar a
Autor: Díaz del Río, Fernando
Real Jurado, Pedro
Onchis, Darian M.
Departamento: Universidad de Sevilla. Departamento de Arquitectura y Tecnología de Computadores
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Fecha: 2015
Publicado en: PSIVT 2015: Pacific-Rim Symposium on Image and Video Technology (2015), p 98-109
ISBN/ISSN: 978-3-319-30284-3
Tipo de documento: Ponencia
Resumen: A design and implementation of a parallel algorithm for computing the Region-Adjacency Tree of a given segmentation of a 2D digital image is given. The technique is based on a suitable distributed use of the algorithm for computing a Homological Spanning Forest (HSF) structure for each connected region of the segmentation and a classical geometric algorithm for determining inclusion between regions. The results show that this technique scales very well when executed in a multicore processor.
Cita: Díaz del Río, F., Real Jurado, P. y Onchis, D.M. (2015). A Parallel Implementation for Computing the Region-Adjacency-Tree of a Segmentation of a 2D Digital Image. En PSIVT 2015: Pacific-Rim Symposium on Image and Video Technology (98-109), Auckland, New Zealand: Springer.
Tamaño: 1.326Mb
Formato: PDF

URI: https://hdl.handle.net/11441/70118

DOI: 10.1007/978-3-319-30285-0_9

Ver versión del editor

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones