Presentation
A Parallel Implementation for Computing the Region-Adjacency-Tree of a Segmentation of a 2D Digital Image
Author/s | Díaz del Río, Fernando
Real Jurado, Pedro Onchis, Darian M. |
Department | Universidad de Sevilla. Departamento de Arquitectura y Tecnología de Computadores Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Publication Date | 2015 |
Deposit Date | 2018-02-08 |
Published in |
|
ISBN/ISSN | 978-3-319-30284-3 0302-9743 |
Abstract | 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 ... 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. |
Funding agencies | Ministerio de Ciencia e Innovación (MICIN). España Universidad de Sevilla |
Project ID. | TEC2012-37868-C04-02
2014/753 |
Citation | 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. |
Files | Size | Format | View | Description |
---|---|---|---|---|
A Parallel Implementation.pdf | 1.326Mb | [PDF] | View/ | |