Mostrar el registro sencillo del ítem

Artículo

dc.creatorDíaz del Río, Fernandoes
dc.creatorMolina Abril, Helenaes
dc.creatorReal Jurado, Pedroes
dc.creatorOnchis, Darian M.es
dc.creatorBlanco Trejo, Sergioes
dc.date.accessioned2024-02-08T12:48:59Z
dc.date.available2024-02-08T12:48:59Z
dc.date.issued2024-01-29
dc.identifier.citationDíaz del Río, F., Molina Abril, H., Real Jurado, P., Onchis, D.M. y Blanco Trejo, S. (2024). Parallel homological calculus for 3D binary digital images. Annals of Mathematics and Artificial Intelligence, 92, 77-113. https://doi.org/10.1007/s10472-023-09913-7.
dc.identifier.issn1012-2443es
dc.identifier.issn1573-7470es
dc.identifier.urihttps://hdl.handle.net/11441/154937
dc.description.abstractTopological representations of binary digital images usually take into consideration different adjacency types between colors.Within the cubical-voxel 3D binary image context, we design an algorithm for computing the isotopic model of an image, called (6, 26)-Homological Region Adjacency Tree ((6, 26)-Hom-Tree). This algorithm is based on a flexible graph scaffolding at the inter-voxel level called Homological Spanning Forest model (HSF). HomTrees are edge-weighted trees in which each node is a maximally connected set of constantvalue voxels, which is interpreted as a subtree of the HSF. This representation integrates and relates the homological information (connected components, tunnels and cavities) of the maximally connected regions of constant color using 6-adjacency and 26-adjacency for black and white voxels, respectively (the criteria most commonly used for 3D images). The EulerPoincaré numbers (which may as well be computed by counting the number of cells of each dimension on a cubical complex) and the connected component labeling of the foreground and background of a given image can also be straightforwardly computed from its Hom-Trees. Being ID a 3D binary well-composed image (where D is the set of black voxels), an almost fully parallel algorithm for constructing the Hom-Tree via HSF computation is implemented and tested here. If ID has m1×m2×m3 voxels, the time complexity order of the reproducible algorithm is near O(log(m1+m2+m3)), under the assumption that a processing element is available for each cubical voxel. Strategies for using the compressed information of the Hom-Tree representation to distinguish two topologically different images having the same homological information (Betti numbers) are discussed here. The topological discriminatory power of the Hom-Tree and the low time complexity order of the proposed implementation guarantee its usability within machine learning methods for the classification and comparison of natural 3D images.es
dc.formatapplication/pdfes
dc.format.extent37 p.es
dc.language.isoenges
dc.publisherSpringeres
dc.relation.ispartofAnnals of Mathematics and Artificial Intelligence, 92, 77-113.
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subject3D digital imageses
dc.subjectBinary imageses
dc.subjectParallel computinges
dc.subjectCavityes
dc.subjectTunneles
dc.subjectConnected componentes
dc.subjectHomological spanning forestes
dc.subjectInter-voxeles
dc.subjectHomological region adjacency treees
dc.titleParallel homological calculus for 3D binary digital imageses
dc.typeinfo:eu-repo/semantics/articlees
dc.type.versioninfo:eu-repo/semantics/publishedVersiones
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses
dc.contributor.affiliationUniversidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)es
dc.contributor.affiliationUniversidad de Sevilla. Departamento de Arquitectura y Tecnología de Computadoreses
dc.relation.projectIDPID2019-110455GB-I00es
dc.relation.projectIDUS-1381077es
dc.relation.publisherversionhttps://link.springer.com/article/10.1007/s10472-023-09913-7es
dc.identifier.doi10.1007/s10472-023-09913-7es
dc.contributor.groupUniversidad de Sevilla. TEP108: Robótica y Tecnología de Computadoreses
dc.contributor.groupUniversidad de Sevilla. TIC245: Topological Pattern Analysis, Recognition and Learninges
dc.journaltitleAnnals of Mathematics and Artificial Intelligencees
dc.publication.volumen92es
dc.publication.initialPage77es
dc.publication.endPage113es
dc.contributor.funderAgencia Estatal de Investigación. Españaes
dc.contributor.funderEuropean Commission (EC). Fondo Europeo de Desarrollo Regional (FEDER)es
dc.contributor.funderUniversidad de Sevillaes

FicherosTamañoFormatoVerDescripción
Parallel homological calculus ...3.798MbIcon   [PDF] Ver/Abrir  

Este registro aparece en las siguientes colecciones

Mostrar el registro sencillo del ítem

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional