Identificador persistente para citar o vincular este elemento:
http://hdl.handle.net/10662/19594
Registro completo de Metadatos
Campo DC | Valor | idioma |
---|---|---|
dc.contributor.author | Molano Gómez, Rubén | - |
dc.contributor.author | Sancho Núñez, José Carlos | - |
dc.contributor.author | Ávila Vegas, María del Mar | - |
dc.contributor.author | García Rodríguez, Pablo | - |
dc.contributor.author | Caro Lindo, Andrés | - |
dc.date.accessioned | 2024-02-01T08:31:05Z | - |
dc.date.available | 2024-02-01T08:31:05Z | - |
dc.date.issued | 2023 | - |
dc.identifier.uri | http://hdl.handle.net/10662/19594 | - |
dc.description.abstract | In image processing, computer vision algorithms are applied to regions bounded by closed contours. These contours are often irregular, poorly defined, and contain holes or unavailable areas inside. A common problem in computational geometry includes finding the k-sided polygon (k-gon) of maximum area or maximum perimeter inscribed within a contour. This paper presents a generic method to obtain user-defined polygons within a region. Users can specify the number k of sides of the polygon to obtain. Additionally, users can also decide whether the calculated polygon should be the largest in area or perimeter. This algorithm produces a polygon or set of polygons that can be used to segment an image, allowing only relevant areas to be processed. In a real-world application, the validity and versatility of the proposed method are demonstrated. In addition, the source code developed in Java and Python is available in a GitHub repository so that researchers can use it freely. | es_ES |
dc.format.extent | 19 p. | es_ES |
dc.format.mimetype | application/pdf | en_US |
dc.language.iso | eng | es_ES |
dc.publisher | Springer | es_ES |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | k-Gon | es_ES |
dc.subject | Computational geometry | es_ES |
dc.subject | Polygon | es_ES |
dc.subject | Holes | es_ES |
dc.subject | Closed contour | es_ES |
dc.subject | Contorno cerrado | es_ES |
dc.subject | Polígono | es_ES |
dc.subject | Geometría computacional | es_ES |
dc.subject | Agujeros | es_ES |
dc.title | Obtaining the user-defined polygons inside a closed contour with holes | es_ES |
dc.type | article | es_ES |
dc.description.version | peerReviewed | es_ES |
europeana.type | TEXT | en_US |
dc.rights.accessRights | closedAccess | es_ES |
dc.subject.unesco | 3325 Tecnología de las Telecomunicaciones | es_ES |
dc.subject.unesco | 1203 Ciencia de Los Ordenadores | es_ES |
europeana.dataProvider | Universidad de Extremadura. España | es_ES |
dc.identifier.bibliographicCitation | Molano, R., Sancho, J.C., Ávila, M.M. et al. Obtaining the user-defined polygons inside a closed contour with holes. Vis Comput (2023). https://doi.org/10.1007/s00371-023-03170-9 | es_ES |
dc.type.version | publishedVersion | es_ES |
dc.contributor.affiliation | Universidad de Extremadura. Departamento de Tecnología de los Computadores y de las Comunicaciones | es_ES |
dc.relation.publisherversion | https://link.springer.com/article/10.1007/s00371-023-03170-9 | es_ES |
dc.identifier.doi | 10.1007/s00371-023-03170-9 | - |
dc.identifier.publicationtitle | The Visual Computer | es_ES |
dc.identifier.orcid | 0000-0001-5410-6589 | es_ES |
dc.identifier.orcid | 0000-0002-4584-6945 | es_ES |
dc.identifier.orcid | 0000-0002-8717-442X | es_ES |
dc.identifier.orcid | 0000-0001-8168-7892 | es_ES |
dc.identifier.orcid | 0000-0002-6367-2694 | es_ES |
Colección: | DISIT - Artículos |
Archivos
Archivo | Descripción | Tamaño | Formato | |
---|---|---|---|---|
s00371-023-03170-9-1.pdf ???org.dspace.app.webui.jsptag.ItemTag.accessRestricted??? | 3,46 MB | Adobe PDF | Descargar Pide una copia |
Este elemento está sujeto a una licencia Licencia Creative Commons